• Title/Summary/Keyword: Search frequency

Search Result 883, Processing Time 0.033 seconds

Investigation of the visual search patterns of the cockpit displays for the ergonomic cockpit design (인간공학적 조종실 설계를 위한 계기 탐색 형태에 관한 연구)

  • Song Young-Woong;Lee Jong-Seon
    • Journal of the Korea Safety Management & Science
    • /
    • v.8 no.2
    • /
    • pp.71-80
    • /
    • 2006
  • There are many display panels in the flight cockpit and pilots get various flight information from those displays. The ergonomic layout of the displays must be determined based upon frequency of use and sequence of use. This study investigated the visual search patterns of the six display groups(one head-up-display: HUD, two multi function displays: MFDs, one engine group: EG, one flight display group: FD and others) in a fighting aircraft. Four expert pilots conducted Imaginary flight in the physical mock-up and the eye movements were collected using eye tracking system. Data of dwell time, frequency of use, and eye movement path were collected. Pilots spent most of time on HUD(55.2%), and others (21.6%), FD(14.2%), right MFD(4.7%), EG(3.2%), and left MFD(1.1%) in descending order. Similarly HUD(42.8%) and others(30.0%) were the most frequently visited displays. These data can be used in the layout of cockpit displays and the determination of optimal visual search pattern.

An Efficient Algorithm for Similarity Search in Large Biosequence Database (대용량 유전체를 위한 효율적인 유사성 검색 알고리즘)

  • Jeong, In-Seon;Park, Kyoung-Wook;Lim, Hyeong-Seok
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.2
    • /
    • pp.1073-1076
    • /
    • 2005
  • Since the size of biosequence database grows exponentially every year, it becomes impractical to use Smith-Waterman algorithm for exact sequence similarity search. For fast sequence similarity search, researchers have been proposed heuristic methods that use the frequency of characters in subsequences. These methods have the defect that different sequences are treated as the same sequence. Because of using only the frequency of characters, the accuracy of these methods are lower than Smith-Waterman algorithm. In this paper, we propose an algorithm which processes query efficiently by indexing the frequency of characters including the positional information of characters in subsequences. The experiments show that our algorithm improve the accuracy of sequence similarity search approximately 5${\sim}$20% than heuristic algorithms using only the frequency of characters.

  • PDF

Mining Search Keywords for Improving the Accuracy of Entity Search (엔터티 검색의 정확성을 높이기 위한 검색 키워드 마이닝)

  • Lee, Sun Ku;On, Byung-Won;Jung, Soo-Mok
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.5 no.9
    • /
    • pp.451-464
    • /
    • 2016
  • Nowadays, entity search such as Google Product Search and Yahoo Pipes has been in the spotlight. The entity search engines have been used to retrieve web pages relevant with a particular entity. However, if an entity (e.g., Chinatown movie) has various meanings (e.g., Chinatown movies, Chinatown restaurants, and Incheon Chinatown), then the accuracy of the search result will be decreased significantly. To address this problem, in this article, we propose a novel method that quantifies the importance of search queries and then offers the best query for the entity search, based on Frequent Pattern (FP)-Tree, considering the correlation between the entity relevance and the frequency of web pages. According to the experimental results presented in this paper, the proposed method (59% in the average precision) improved the accuracy five times, compared to the traditional query terms (less than 10% in the average precision).

Sensing Optimization for an Receiver Structure in Cognitive Radio Systems

  • Kang, Bub-Joo;Nam, Yoon-Seok
    • Journal of information and communication convergence engineering
    • /
    • v.9 no.1
    • /
    • pp.27-31
    • /
    • 2011
  • This paper describes the optimization of spectrum sensing in terms of the throughput of a cognitive radio (CR) system. Dealing with the optimization problem of spectrum sensing, this paper evaluates the throughput of a CR system by considering such situations as the penalty time of a channel search and incumbent user (IU) detection delay caused by a missed detection of an incumbent signal. Also, this paper suggests a serial channel search scheme as the search method for a vacant channel, and derives its mean channel search time by considering the penalty time due to the false alarm of a vacant channel search. The numerical results suggest the optimum sensing time of the channel search process using the derived mean channel search time of a serial channel search in the case of a sensing hardware structure with single radio frequency (RF) path. It also demonstrates that the average throughput is improved by two separate RF paths in spite of the hardware complexity of an RF receiver.

Magnetic Inspection using High-frequency Current Behaviors (고주파 전류의 특성과 자기 센서를 이용한 도체 결함 검사 방법)

  • Im, Han-Sang;Park, Jae-Hong
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.49 no.3
    • /
    • pp.95-101
    • /
    • 2000
  • In this paper, an improved method for magnetic inspection to detect surface of a conductor is presented. The presented method is based on the technique of ECP(Electric Current Perturbation), which is to measure the variation of current flow due to defects with a magnetic sensor. The inspection performance is improved by using high frequency current behaviors in order to concentrate the current near the defect and employing the resonant frequency of a search coil as an operating frequency. By analytical results and experiments of the test specimens, the feasibility of the inspection method is shown.

  • PDF

An Enhancement of Image Segmentation Using Modified Watershed Algorithm

  • Kwon, Dong-Jin
    • International journal of advanced smart convergence
    • /
    • v.11 no.4
    • /
    • pp.81-87
    • /
    • 2022
  • In this paper, we propose a watershed algorithm that applies a high-frequency enhancement filter to emphasize the boundary and a local adaptive threshold to search for minimum points. The previous method causes the problem of over-segmentation, and over- segmentation appears around the boundary of the object, creating an inaccurate boundary of the region. The proposed method applies a high-frequency enhancement filter that emphasizes the high-frequency region while preserving the low-frequency region, and performs a minimum point search to consider local characteristics. When merging regions, a fixed threshold is applied. As a result of the experiment, the proposed method reduced the number of segmented regions by about 58% while preserving the boundaries of the regions compared to when high frequency emphasis filters were not used.

A Study on Consumer Information Search and Consumer Satisfaction According to Product Characteristics (상품특성별 소비자 정보탐색정도의 소비자만족도에 관한연구)

  • 김윤정
    • Journal of Families and Better Life
    • /
    • v.11 no.1
    • /
    • pp.12-21
    • /
    • 1993
  • This Study focused on consumer information search and consumer satisfaction according to product characteristics and sex. For these purpose a survey was conducted using questionaires on 225 males 299 females that lived in Seoul. Statistics used for data were Frequency. Prequency. Percentile Mean Multiple Regression Analysis and Path Analysis. The major findings were: 1) I male Group reference orientation were effect on convenience experience credience goods and information search were effect on experience credience goods. 2) In Femal Group her job and information search effect on convenience experience credience goods and involvement effect on credience goods only.

  • PDF

Searching Patents Effectively in terms of Keyword Distributions (키워드 분포를 고려한 효과적 특허검색기법)

  • Lee, Wookey;Song, Justin Jongsu;Kang, Michael Mingu
    • Journal of Information Technology and Architecture
    • /
    • v.9 no.3
    • /
    • pp.323-331
    • /
    • 2012
  • With the advancement of the area of knowledge and information, Intellectual Property, especially, patents have captured attention more and more emergent. The increasing need for efficient way of patent information search has been essential, but the prevailing patent search engines have included too many noises for the results due to the Boolean models. This has occasioned too much time for the professional experts to investigate the results manually. In this paper, we reveal the differences between the conventional document search and patent search and analyze the limitations of existing patent search. Furthermore, we propose a specialized in patent search, so that the relationship between the keywords within each document and their significance within each patent document search keyword can be identified. Which in turn, the keywords and the relationships have been appointed a ranking for this patent in the upper ranks and the noise in the data sub-ranked. Therefore this approach is proposed to significantly reduce noise ratio of the data from the search results. Finally, in, we demonstrate the superiority of the proposed methodology by comparing the Kipris dataset.

A Study on the Impact of TV ad Exposure on Search Volumes on App-based Service Brands: Focusing on the Moderating Effect of Industry Type and Search Language Type (앱기반 서비스 브랜드의 TV 광고 노출량이 검색량에 미치는 영향: 업종유형 및 검색언어 유형의 조절효과를 중심으로)

  • Kim, Donna;Moon, Yoon Taek
    • The Journal of the Korea Contents Association
    • /
    • v.21 no.9
    • /
    • pp.284-298
    • /
    • 2021
  • In addition to awareness building, TV media creates search behavior for the brand and the search result may link to a brand homepage and/or an e-commerce site. This study analyzed the impact of TV advertisements on a search volume at NAVER, a leading Korean search platform, in order to verify the impact of TV advertisements on brand-related search behavior. Results are as follows. TV advertisement exposure was significantly related to the amount of Korean search, English search, and total search. In addition, changes in TV advertising exposure also had a significant static influence on changes in search volume. The increase in the number of brand search was different by industries that carried out TV advertisements, and it was verified that the frequency of English searches increased faster than the frequency of Korean search as the exposure of TV advertisements increased. Therefore, domestic TV advertising volume has been verified to affect NAVER search volume, and the advertising industry and brand search language that conducted TV advertisements have been verified to be moderating variables. TV advertisements can be interpreted to cause brand search behavior in English even though it is not a native language for Koreans.

Customized Web Search Rank Provision (개인화된 웹 검색 순위 생성)

  • Kang, Youngki;Bae, Joonsoo
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.39 no.2
    • /
    • pp.119-128
    • /
    • 2013
  • Most internet users utilize internet portal search engines, such as Naver, Daum and Google nowadays. But since the results of internet portal search engines are based on universal criteria (e.g. search frequency by region or country), they do not consider personal interests. Namely, current search engines do not provide exact search results for homonym or polysemy because they try to serve universal users. In order to solve this problem, this research determines keyword importance and weight value for each individual search characteristics by collecting and analyzing customized keyword at external database. The customized keyword weight values are integrated with search engine results (e.g. PageRank), and the search ranks are rearranged. Using 50 web pages of Goolge search results for experiment and 6 web pages for customized keyword collection, the new customized search results are proved to be 90% match. Our personalization approach is not the way that users enter preference directly, but the way that system automatically collects and analyzes personal information and then reflects them for customized search results.