• Title/Summary/Keyword: users' search terms

Search Result 178, Processing Time 0.024 seconds

A study to Analyze the Korean National Knowledge Distribution Status and to Generate Suggestions for Developing a Distribution Model (국가지식정보의 유통 현황 분석 및 유통방안에 관한 연구)

  • Lee, Jee-Yeon;Min, Ji-Yeon;Joo, Soo-Hyung
    • Journal of the Korean Society for information Management
    • /
    • v.24 no.3
    • /
    • pp.299-319
    • /
    • 2007
  • Recently, information portals, national institutions, and integrated information centers, which are eager to acquire quality contents, actively share contents. Korean national knowledge is recognized to be superior in terms of its specialty and reliability. Currently, the distribution of national knowledge in Korea is at the beginning stage as the content sharing was intended to enhance the users' accessibility to the information and ease of information use. In this study, we identified the national knowledge distribution status in Korea and abroad by analyzing the roles of the information providers, information search portals, and Korea Knowledge Portal. We also conducted in-depth interviews with six experts, who represent academic institutions, libraries, specialized information centers, and commercial ventures. To enable effective Korean national knowledge distribution, we generated suggestions for the respective information providing services to share and cooperate based on the analysis and tile Interviews.

Projection of Spatial Correlation-Based Antenna Selection for Cognitive Radio Systems in Correlated Channels (인지무선 시스템의 상관채널에서 공간 상관 행렬 사영을 이용한 안테나 선택기법)

  • Cho, Jae-Bum;Jang, Sung-Jeen;Jung, Won-Sik;Kim, Jae-Moung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.1A
    • /
    • pp.8-16
    • /
    • 2012
  • Recent work has been shown that cognitive radio systems with multiple antenna at both transmitter and receiver are able to improve performance of secondary users. In such system, the main drawback is the increased complexity and raised cost as the number of antennas increase. It is desirable to apply antenna selection which select a subset of the available antennas so as to solve these problems. In this paper, we consider antenna selection method for cognitive radio systems in correlated channel from the IEEE 802.11n. For a multiple-input multiple-output(MIMO) system with more antennas at transmitter than the receiver, we select the same number of transmit antennas as that of receive antennas. The exhaustive search for optimal antenna becomes impractical. We present criterion for selecting subset in terms of projection of channel correlation vector to increase performance of secondary user with decreasing interference at primary user.

k-Bitmap Clustering Method for XML Data based on Relational DBMS (관계형 DBMS 기반의 XML 데이터를 위한 k-비트맵 클러스터링 기법)

  • Lee, Bum-Suk;Hwang, Byung-Yeon
    • The KIPS Transactions:PartD
    • /
    • v.16D no.6
    • /
    • pp.845-850
    • /
    • 2009
  • Use of XML data has been increased with growth of Web 2.0 environment. XML is recognized its advantages by using based technology of RSS or ATOM for transferring information from blogs and news feed. Bitmap clustering is a method to keep index in main memory based on Relational DBMS, and which performed better than the other XML indexing methods during the evaluation. Existing method generates too many clusters, and it causes deterioration of result of searching quality. This paper proposes k-Bitmap clustering method that can generate user defined k clusters to solve above-mentioned problem. The proposed method also keeps additional inverted index for searching excluded terms from representative bits of k-Bitmap. We performed evaluation and the result shows that the users can control the number of clusters. Also our method has high recall value in single term search, and it guarantees the searching result includes all related documents for its query with keeping two indices.

SePH: Seamless Proxy-based Handoff Scheme in IP-based Heterogeneous Mobile Networks (이기종의 모바일 IP 네트워크에서 끊김없는 프록시 기반의 핸드오프 기법)

  • Lee, Seung-Hyun;Shin, Dong-Ryeol;Jeong, Jong-Pil
    • The KIPS Transactions:PartC
    • /
    • v.19C no.1
    • /
    • pp.71-82
    • /
    • 2012
  • In Next Generation Wireless Networks (NGWN), lots of information, such as voice and video data, will be used in All-IP networks. It is important note that seamless service for users and handoff between heterogeneous networks must be taken into account in such environments. Therefore, in this paper, we propose a SePH(Seamless Proxy based Handoff) using PMIPv6-based proxy model which is enable to improve the performance of handoff in NGWN. The SePH can efficiently support seamless and IP-based mobility by reducing the search process. The performance results show that our proposed scheme outperforms in terms of QoS (Quality of Service) such as throughput, handoff latency, packet loss, and signaling overhead comparing to the existing schemes.

Design and Implementation of High-Resolution Image Transmission Interface for Mobile Device (모바일용 고화질 영상 전송 인터페이스의 설계 및 구현)

  • Ahn, Yong-Beom;Lee, Sang-Wook;Kim, Eung-Soo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.8
    • /
    • pp.1511-1518
    • /
    • 2007
  • As studies on ubiquitous computing are actively conducted, desire for various services, including image transmission storage, search and remote monitoring. has been expanding into mobile environment as well as to PCs. while CCTV (closed circuit TV) and un DVR (Digital video Recording) are used in places where security service such as intrusion detection system is required, these are high-end equipment. So it is not easy for ordinary users or household and small-sized companies to use them. Besides, they are difficult to be carried and camera solution for mobile device does not support high-quality function and provides low-definition of QVGA for picture quality. Therefore, in this study, design and implementation of embedded system of high-definition image transmission for ubiquitous mobile device which is not inferior to PC or DVR are described. To this end, usage of dedicated CPU for mobile device and design and implementation of MPEG-4 H/W CODEC also are examined. The implemented system showed excellent performance in mobile environment, in terms of speed, picture quality.

Exploring Navigation Pattern and Site Evaluation Variation in a Community Website by Mixture Model at Segment Level (커뮤니티 사이트 특성과 navigation pattern 연관성의 세분시장별 이질성분석 - 믹스처모델의 구조방정식 적용을 중심으로 -)

  • Kim, So-Young;Kwak, Young-Sik;Nam, Yong-Sik
    • Journal of Global Scholars of Marketing Science
    • /
    • v.13
    • /
    • pp.209-229
    • /
    • 2004
  • Although the site evaluation factors that affect the navigation pattern are well documented, the attempt to explore the difference in the relationship between navigation pattern and site evaluation factors by post hoc segmentation approach has been relatively rare. For this purpose, this study constructs the structure equation model using web-evaluation data and log file of a community site with 300,000 members. And then it applies the structure equation model to each segment. Each segment is identified by mixture model. Mixture model is to unmix the sample, to identify the segments, and to estimate the parameters of the density function underlying the observed data within each segment. The study examines the opportunity to increase GFI, using mixture model which supposes heterogeneous groups in the users, not through specification search by modification index from structure equation model. This study finds out that AGFI increases from 0.819 at total sample to 0.927, 0.930, 0.928, 0.929 for each 4 segments in the case of the community site. The results confirm that segment level approach is more effective than model modification when model is robust in terms of theoretical background. Furthermore, we can identify a heterogeneous navigation pattern and site evaluation variation in the community website at segment level.

  • PDF

Content Based Video Retrieval by Example Considering Context (문맥을 고려한 예제 기반 동영상 검색 알고리즘)

  • 박주현;낭종호;김경수;하명환;정병희
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.30 no.12
    • /
    • pp.756-771
    • /
    • 2003
  • Digital Video Library System which manages a large amount of multimedia information requires efficient and effective retrieval methods. In this paper, we propose and implement a new video search and retrieval algorithm that compares the query video shot with the video shots in the archives in terms of foreground object, background image, audio, and its context. The foreground object is the region of the video image that has been changed in the successive frames of the shot, the background image is the remaining region of the video image, and the context is the relationship between the low-level features of the adjacent shots. Comparing these features is a result of reflecting the process of filming a moving picture, and it helps the user to submit a query focused on the desired features of the target video clips easily by adjusting their weights in the comparing process. Although the proposed search and retrieval algorithm could not totally reflect the high level semantics of the submitted query video, it tries to reflect the users' requirements as much as possible by considering the context of video clips and by adjusting its weight in the comparing process.

A Study on the Meaning and Strategy of Keyword Advertising Marketing

  • Park, Nam Goo
    • Journal of Distribution Science
    • /
    • v.8 no.3
    • /
    • pp.49-56
    • /
    • 2010
  • At the initial stage of Internet advertising, banner advertising came into fashion. As the Internet developed into a central part of daily lives and the competition in the on-line advertising market was getting fierce, there was not enough space for banner advertising, which rushed to portal sites only. All these factors was responsible for an upsurge in advertising prices. Consequently, the high-cost and low-efficiency problems with banner advertising were raised, which led to an emergence of keyword advertising as a new type of Internet advertising to replace its predecessor. In the beginning of 2000s, when Internet advertising came to be activated, display advertisement including banner advertising dominated the Net. However, display advertising showed signs of gradual decline, and registered minus growth in the year 2009, whereas keyword advertising showed rapid growth and started to outdo display advertising as of the year 2005. Keyword advertising refers to the advertising technique that exposes relevant advertisements on the top of research sites when one searches for a keyword. Instead of exposing advertisements to unspecified individuals like banner advertising, keyword advertising, or targeted advertising technique, shows advertisements only when customers search for a desired keyword so that only highly prospective customers are given a chance to see them. In this context, it is also referred to as search advertising. It is regarded as more aggressive advertising with a high hit rate than previous advertising in that, instead of the seller discovering customers and running an advertisement for them like TV, radios or banner advertising, it exposes advertisements to visiting customers. Keyword advertising makes it possible for a company to seek publicity on line simply by making use of a single word and to achieve a maximum of efficiency at a minimum cost. The strong point of keyword advertising is that customers are allowed to directly contact the products in question through its more efficient advertising when compared to the advertisements of mass media such as TV and radio, etc. The weak point of keyword advertising is that a company should have its advertisement registered on each and every portal site and finds it hard to exercise substantial supervision over its advertisement, there being a possibility of its advertising expenses exceeding its profits. Keyword advertising severs as the most appropriate methods of advertising for the sales and publicity of small and medium enterprises which are in need of a maximum of advertising effect at a low advertising cost. At present, keyword advertising is divided into CPC advertising and CPM advertising. The former is known as the most efficient technique, which is also referred to as advertising based on the meter rate system; A company is supposed to pay for the number of clicks on a searched keyword which users have searched. This is representatively adopted by Overture, Google's Adwords, Naver's Clickchoice, and Daum's Clicks, etc. CPM advertising is dependent upon the flat rate payment system, making a company pay for its advertisement on the basis of the number of exposure, not on the basis of the number of clicks. This method fixes a price for advertisement on the basis of 1,000-time exposure, and is mainly adopted by Naver's Timechoice, Daum's Speciallink, and Nate's Speedup, etc, At present, the CPC method is most frequently adopted. The weak point of the CPC method is that advertising cost can rise through constant clicks from the same IP. If a company makes good use of strategies for maximizing the strong points of keyword advertising and complementing its weak points, it is highly likely to turn its visitors into prospective customers. Accordingly, an advertiser should make an analysis of customers' behavior and approach them in a variety of ways, trying hard to find out what they want. With this in mind, her or she has to put multiple keywords into use when running for ads. When he or she first runs an ad, he or she should first give priority to which keyword to select. The advertiser should consider how many individuals using a search engine will click the keyword in question and how much money he or she has to pay for the advertisement. As the popular keywords that the users of search engines are frequently using are expensive in terms of a unit cost per click, the advertisers without much money for advertising at the initial phrase should pay attention to detailed keywords suitable to their budget. Detailed keywords are also referred to as peripheral keywords or extension keywords, which can be called a combination of major keywords. Most keywords are in the form of texts. The biggest strong point of text-based advertising is that it looks like search results, causing little antipathy to it. But it fails to attract much attention because of the fact that most keyword advertising is in the form of texts. Image-embedded advertising is easy to notice due to images, but it is exposed on the lower part of a web page and regarded as an advertisement, which leads to a low click through rate. However, its strong point is that its prices are lower than those of text-based advertising. If a company owns a logo or a product that is easy enough for people to recognize, the company is well advised to make good use of image-embedded advertising so as to attract Internet users' attention. Advertisers should make an analysis of their logos and examine customers' responses based on the events of sites in question and the composition of products as a vehicle for monitoring their behavior in detail. Besides, keyword advertising allows them to analyze the advertising effects of exposed keywords through the analysis of logos. The logo analysis refers to a close analysis of the current situation of a site by making an analysis of information about visitors on the basis of the analysis of the number of visitors and page view, and that of cookie values. It is in the log files generated through each Web server that a user's IP, used pages, the time when he or she uses it, and cookie values are stored. The log files contain a huge amount of data. As it is almost impossible to make a direct analysis of these log files, one is supposed to make an analysis of them by using solutions for a log analysis. The generic information that can be extracted from tools for each logo analysis includes the number of viewing the total pages, the number of average page view per day, the number of basic page view, the number of page view per visit, the total number of hits, the number of average hits per day, the number of hits per visit, the number of visits, the number of average visits per day, the net number of visitors, average visitors per day, one-time visitors, visitors who have come more than twice, and average using hours, etc. These sites are deemed to be useful for utilizing data for the analysis of the situation and current status of rival companies as well as benchmarking. As keyword advertising exposes advertisements exclusively on search-result pages, competition among advertisers attempting to preoccupy popular keywords is very fierce. Some portal sites keep on giving priority to the existing advertisers, whereas others provide chances to purchase keywords in question to all the advertisers after the advertising contract is over. If an advertiser tries to rely on keywords sensitive to seasons and timeliness in case of sites providing priority to the established advertisers, he or she may as well make a purchase of a vacant place for advertising lest he or she should miss appropriate timing for advertising. However, Naver doesn't provide priority to the existing advertisers as far as all the keyword advertisements are concerned. In this case, one can preoccupy keywords if he or she enters into a contract after confirming the contract period for advertising. This study is designed to take a look at marketing for keyword advertising and to present effective strategies for keyword advertising marketing. At present, the Korean CPC advertising market is virtually monopolized by Overture. Its strong points are that Overture is based on the CPC charging model and that advertisements are registered on the top of the most representative portal sites in Korea. These advantages serve as the most appropriate medium for small and medium enterprises to use. However, the CPC method of Overture has its weak points, too. That is, the CPC method is not the only perfect advertising model among the search advertisements in the on-line market. So it is absolutely necessary that small and medium enterprises including independent shopping malls should complement the weaknesses of the CPC method and make good use of strategies for maximizing its strengths so as to increase their sales and to create a point of contact with customers.

  • PDF

Implementing the Faceted Navigation Interface for Searching Performing Arts Contents (공연예술 콘텐츠 검색을 위한 패싯 내비게이션 인터페이스 구현)

  • Lee, Won-Kyung;Seo, Eun-Gyoung
    • Journal of the Korean Society for information Management
    • /
    • v.33 no.2
    • /
    • pp.77-102
    • /
    • 2016
  • The effective searching for performing arts contents can be achieved by providing various access points and searching methods based on specialized metadata. The purpose of this study is to develop a faceted navigation interface which user could effectively and efficiently retrieve performing arts contents even if the users do not know accurate descriptive information about them. Therefore, the study, first, investigated search access points and navigation items providing by other the performing arts retrieval systems and to analyze information seeking behaviors of university students who major in music, dance and theater. And then, the study proposed the 36 facets with the 9 main facet categories suitable for performing arts and also proposed 27 descriptive elements suitable for performing arts contents. Finally, the study developed the performing arts contents retrieval system based faceted navigation interface with 3,360 experimental data and conducted an in-depth interview in terms of usability, serendipity, and efficiency. The applying the faceted navigations for searching performing arts contents will help users access and utilize them in the retrieval system and moreover satisfy user demands.

Voronoi-Based Search Scheme for Road Network Databases (도로 망 데이터베이스를 위한 보로노이 기반의 탐색 방안)

  • Kim, Dae-Hoon;Hwang, Een-Jun
    • Journal of IKEEE
    • /
    • v.11 no.4
    • /
    • pp.348-357
    • /
    • 2007
  • Due to the improved performance and cost of personal mobile devices and rapid progress of wireless communication technology, the number of users who utilize these devices is increasing. This trend requires various types of services be available to users. So far, there have been many solutions provided for the shortest path problem. But, technologies which can offer various recommendation services to user depending on user’s current location are focused on Euclidean spaces rather than road network. Thus, in this paper, we extend the previous work to satisfy this requirement on road network database. Our proposed scheme requires pre-computation for the efficient query processing. In the preprocessing step, we first partition the input road network into a fixed number of Voronoi polygons and then pre-compute routing information for each polygon. In the meantime, we select the number of Voronoi polygons in proposition to the scale of road network. Through this selection, the required size of pre-computation is linearly increasing to the size of road network. Using this pre-computated information, we can process queries more quickly. Through experiments, we have shown that our proposed scheme can achieve excellent performance in terms of scheduling time and the number of visited nodes.

  • PDF