• Title/Summary/Keyword: Target Search

Search Result 607, Processing Time 0.022 seconds

The Effects of Perceptual Load and Category-Specific Dilution on Visual Search (지각적 부담과 범주 별 희석이 시각 탐색에 미치는 영향)

  • Rhim, Jee-Hyang;Yi, Do-Joon
    • Korean Journal of Cognitive Science
    • /
    • v.21 no.1
    • /
    • pp.177-197
    • /
    • 2010
  • Three experiments compared two hypotheses on visual selection; perceptual load hypothesis and dilution hypothesis. The perceptual load hypothesis predicts that perceptual load of task-relevant processing determines the level of task-irrelevant processing whereas the dilution hypothesis predicts that competition for limited-capacity attentional resource, not perceptual load, determines the locus of selection. To compare the two hypotheses, we investigated the influence of perceptual load in visual search on response interference by a distractor. Experiment 1 and 2 manipulated perceptual load by the set size of a search array and the colors of a target and non-targets, respectively. As a result, distractor interference decreased with a set size regardless of perceptual load. In order to further test the set size effect, Experiment 3 manipulated the perceptual categories of non-targets and a distractor. The results showed that distractor interference decreased only when non-targets belonged to the same category as a distractor. Overall, the current findings support the dilution hypothesis, but not the perceptual load hypothesis, and provide the evidence that visual selection is constrained by capacity-limited, category-specific attentional resources.

  • PDF

Development of Radius Search System based on Raster Map in the Flash Environment (플래시 환경에서 래스터 지도를 기반으로 한 반경 검색 시스템 개발)

  • Kim, Sung-Ho
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.4
    • /
    • pp.39-47
    • /
    • 2008
  • This paper describes the life GIS(Geographic Information System) system that enables users to look up the final destination on a map automatically by setting up a random radius of threshold under the present user position. Various information systems based on the existing GIS have disadvantage that a search is difficult when the destination location is not clear. And it is inefficient that the processing time is delay due to a complex configuration and large amount of informations based on the target of special business supports. Therefore, this paper improves these problems and proposes the customized life GIS which is for the general user in the Flash(Action Script) environment. The customized life GIS confirms the detail items from search results, which is destinations fitting for a condition in the suitable radius of threshold from the present user position. And the user can look up the suitable final destination on a map easily using the customized information system. The result of this paper, which is based on the sample of the large unit locations, will be expected to be able to guide more detail, extensive and various informations.

A Study on Advertising Effect according to Involvement, Advertising Location and Advertising Forms - Focusing on the Fashion Internet Search Advertising - (관여, 광고위치, 광고형태에 따른 광고효과 연구 - 패션 인터넷 검색광고를 중심으로 -)

  • Je, Eun-Suk
    • The Research Journal of the Costume Culture
    • /
    • v.20 no.2
    • /
    • pp.251-262
    • /
    • 2012
  • This research aimed to examine an advertising location according to consumer involvement about internet search advertising and advertising effect according to advertising forms. This research carried out a questionnaire survey from May 25, 2011 for seven days with the target of men and women at the age of 20s-30s who tried search advertising in Seoul and capital area, and 519 copies were used for final analysis. For analysis of collected materials, the reliability test, factor analysis, $t$-test, regression analysis and ${\chi}^2$ test were executed by using statistical package SPSS 16.0. The results are as follows. First, it appeared that consumer's clothing involvement, advertising involvement, advertising location and advertising forms had an influence on site attitude and clicking intention. Consumers of high clothing involvement, high advertising involvement and upper end advertising appeared to have high site attitude and clicking intention. Second, all consumers of the low and high clothing involvement and upper end advertising appeared to prefer the upper end advertising. It appeared that consumers of low advertising involvement prefer lower end advertising, and consumers of high advertising involvement prefer the upper end advertising at an advertising location according to clothing involvement. Accordingly, it is important that the search advertising exposes advertising in the upper end, and that should use an advertising phrase capable of giving trust to consumers. As the text advertising had high site attitude and clicking intention in the advertising forms, consumers should pay attention to the advertising phrase.

Automated Method for Detecting Use-After-Free Vulnerability of Windows System Calls Using Dynamic Symbolic Execution (동적 기호 실행을 이용한 윈도우 시스템 콜 Use-After-Free 취약점 자동 탐지 방법)

  • Kang, Sangyong;Lee, Gwonwang;Noh, Bongnam
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.27 no.4
    • /
    • pp.803-810
    • /
    • 2017
  • Recently, social security problems have been caused by the development of the software industry, and a variety of automation techniques have been used to verify software stability. In this paper, we propose a method of automatically detecting a use-after-free vulnerability on Windows system calls using dynamic symbolic execution, one of the software testing methods. First, a static analysis based pattern search is performed to select a target point. Based on the detected pattern points, we apply an induced path search technique that blocks branching to areas outside of interest. Through this, we overcome limitations of existing dynamic symbolic performance technology and verify whether vulnerability exists at actual target point. As a result of applying the proposed method to the Windows system call, it is confirmed that the use-after-free vulnerability, which had previously to be manually analyzed, can be detected by the proposed automation technique.

Isolation and Bioactivity Analysis of Salidroside from Acer tegmentosum using On-line Screening HPLC-ABTS+ Assay (On-line Screening HPLC-ABTS+ Assay을 이용한 산청목으로부터 Salidroside의 분리 및 생물활성 분석)

  • Lee, Kwang Jin;Song, Na-Young;Ma, Jin Yeul
    • KSBB Journal
    • /
    • v.29 no.2
    • /
    • pp.124-130
    • /
    • 2014
  • Acer tegmentosum was a traditional Korean herbal medicine showing various pharmacological activities. In this work, A. tegmentosum were extracted with boiling water and then successively partitioned with dichloromethane, ethyl acetate, n-butyl alcohol (n-BuOH), and water. Salidoside, the target compound, was purified in n-BuOH phase using a chromatography method. For the analysis of salidoside, TLC and LC-MS were used as well as on-line screening $HPLC-ABTS^+$ assay with three different wavelength of 254, 280, and 320 nm. An amount of 1.34 g of salidoside were obtained in n-BuOH phase fromAcer tegmentosum was a traditional Korean herbal medicine showing various pharmacological activities. In this work, A. tegmentosum were extracted with boiling water and then successively partitioned with dichloromethane, ethyl acetate, n-butyl alcohol (n-BuOH), and water. Salidoside, the target compound, was purified in n-BuOH phase using a chromatography method. For the analysis of salidoside, TLC and LC-MS were used as well as online screening $HPLC-ABTS^+$ assay with three different wavelength of 254, 280, and 320 nm. An amount of 1.34 g of salidoside were obtained in n-BuOH phase from 3 kg of dry biomass. The on-line screening $HPLC-ABTS^+$ assay is rapid and efficient tool to search bioactivity from A. tegmentosum. 3 kg of dry biomass. The on-line screening $HPLC-ABTS^+$ assay is rapid and efficient tool to search bioactivity from A. tegmentosum.

PageRank Algorithm Using Link Context (링크내역을 이용한 페이지점수법 알고리즘)

  • Lee, Woo-Key;Shin, Kwang-Sup;Kang, Suk-Ho
    • Journal of KIISE:Databases
    • /
    • v.33 no.7
    • /
    • pp.708-714
    • /
    • 2006
  • The World Wide Web has become an entrenched global medium for storing and searching information. Most people begin at a Web search engine to find information, but the user's pertinent search results are often greatly diluted by irrelevant data or sometimes appear on target but still mislead the user in an unwanted direction. One of the intentional, sometimes vicious manipulations of Web databases is Web spamming as Google bombing that is based on the PageRank algorithm, one of the most famous Web structuring techniques. In this paper, we regard the Web as a directed labeled graph that Web pages represent nodes and the corresponding hyperlinks edges. In the present work, we define the label of an edge as having a link context and a similarity measure between link context and the target page. With this similarity, we can modify the transition matrix of the PageRank algorithm. A motivating example is investigated in terms of the Singular Value Decomposition with which our algorithm can outperform to filter the Web spamming pages effectively.

Real-Time Human Tracking Using Skin Area and Modified Multi-CAMShift Algorithm (피부색과 변형된 다중 CAMShift 알고리즘을 이용한 실시간 휴먼 트래킹)

  • Min, Jae-Hong;Kim, In-Gyu;Baek, Joong-Hwan
    • Journal of Advanced Navigation Technology
    • /
    • v.15 no.6
    • /
    • pp.1132-1137
    • /
    • 2011
  • In this paper, we propose Modified Multi CAMShift Algorithm(Modified Multi Continuously Adaptive Mean Shift Algorithm) that extracts skin color area and tracks several human body parts for real-time human tracking system. Skin color area is extracted by filtering input image in predefined RGB value range. These areas are initial search windows of hands and face for tracking. Gaussian background model prevents search window expending because it restricts skin color area. Also when occluding between these areas, we give more weights in occlusion area and move mass center of target area in color probability distribution image. As result, the proposed algorithm performs better than the original CAMShift approach in multiple object tracking and even when occluding of objects with similar colors.

A Study of the Influence of Choice of Record Fields on Retrieval Performance in the Bibliographic Database (서지 데이터베이스에서의 레코드 필드 선택이 검색 성능에 미치는 영향에 관한 연구)

  • Heesop Kim
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.35 no.4
    • /
    • pp.97-122
    • /
    • 2001
  • This empirical study investigated the effect of choice of record field(s) upon which to search on retrieval performance for a large operational bibliographic database. The query terms used in the study were identified algorithmically from each target set in four different ways: (1) controlled terms derived from index term frequency weights, (2) uncontrolled terms derived from index term frequency weights. (3) controlled terms derived from inverse document frequency weights, and (4) uncontrolled terms based on universe document frequency weights. Su potable choices of record field were recognised. Using INSPEC terminology, these were the fields: (1) Abstract. (2) 'Anywhere'(i.e., ail fields). (3) Descriptors. (4) Identifiers, (5) 'Subject'(i.e., 'Descriptors' plus Identifiers'). and (6) Title. The study was undertaken in an operational web-based IR environment using the INSPEC bibliographic database. The retrieval performances were evaluated using D measure (bivariate in Recall and Precision). The main findings were that: (1) there exist significant differences in search performance arising from choice of field, using 'mean performance measure' as the criterion statistic; (2) the rankings of field-choices for each of these performance measures is sensitive to the choice of query : and (3) the optimal choice of field for the D-measure is Title.

  • PDF

Searching for an Intra-block Remarshalling Plan for Multiple Transfer Cranes (복수 트랜스퍼 크레인을 활용하는 블록 내 재정돈 계획 탐색)

  • Oh Myung-Seob;Kang Jae-Ho;Ryu Kwang-Ryel;Kim Kap-Hwan
    • Journal of KIISE:Software and Applications
    • /
    • v.33 no.7
    • /
    • pp.624-635
    • /
    • 2006
  • This paper applies simulated annealing algorithm to the problem of generating a plan for intra-block remarshalling with multiple transfer cranes. Intra-block remarshalling refers to the task of rearranging containers scattered around within a block into certain designated target areas of the block so that they can be efficiently loaded onto a ship. In generating a remarshalling plan, the predetermined container loading sequence should be considered carefully to avoid re-handlings that may delay the loading operations. In addition, the required time for the remarshalling operation itself should be minimized. A candidate solution in our search space specifies target locations of the containers to be rearranged. A candidate solution is evaluated by deriving a container moving plan and estimating the time needed to execute the plan using two cranes with minimum interference. Simulation experiments have shown that our method can generate efficient remarshalling plans in various situations.

A Study on Intention Exchange-based Ship Collision Avoidance by Changing the Safety Domain

  • Kim, Donggyun
    • Journal of the Korean Society of Marine Environment & Safety
    • /
    • v.25 no.3
    • /
    • pp.259-268
    • /
    • 2019
  • Even if only two ships are encountered, a collision may occur due to the mistaken judgment of the positional relationship. In other words, if an officer does not know a target ship's intention, there is always a risk of collision. In this paper, the experiments are conducted to investigate how the intention affects the action of collision avoidance in cooperative and non-cooperative situations. In non-cooperative situation, each ship chooses a course that minimizes costs based on the current situation. That is, it always performs a selfish selection. In a cooperative situation, the information is exchanged with a target ship and a course is selected based on this information. Each ship uses the Distributed Stochastic Search Algorithm so that a next-intended course can be selected by a certain probability and determines the course. In the experimental method, four virtual ships are set up to analyze the action of collision avoidance. Then, using the actual AIS data of eight ships in the strait of Dover, I compared and analyzed the action of collision avoidance in cooperative and non-cooperative situations. As a result of the experiment, the ships showed smooth trajectories in the cooperative situation, but the ship in the non-cooperative situation made frequent big changes to avoid a collision. In the case of the experiment using four ships, there was no collision in the cooperative situation regardless of the size of the safety domain, but a collision occurred between the ships when the size of the safety domain increased in cases of non-cooperation. In the case of experiments using eight ships, it was found that there are optimal parameters for collision avoidance. Also, it was possible to grasp the variation of the sailing distance and the costs according to the combination of the parameters, and it was confirmed that the setting of the parameters can have a great influence on collision avoidance among ships.