• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.38 no.4
• /
• pp.11-21
• /
• 2015

In order to achieve success in ground operations, searching for moving targets is one of critical factors. Usually, the system of searching for adversary ground moving targets has complex properties which includes target's moving characteristics, camouflage level, terrain, weather, available search time window, distance between target and searcher, moving speed, target's tactics, etc. The purpose of this paper is to present a practical quantitative method for effectively searching for infiltrated moving targets considering aforementioned complex properties. Based upon search theories, this paper consists of two parts. One is infiltration route analysis, through terrain and mobility analysis. The other is building dynamic probability maps through Monte Carlo simulation to determine the prioritized searching area for moving targets. This study primarily considers ground moving targets' moving pattern. These move by foot and because terrain has a great effect on the target's movement, they generally travel along a constrained path. With the ideas based on the terrain's effect, this study deliberately performed terrain and mobility analysis and built a constrained path. In addition, dynamic probability maps taking terrain condition and a target's moving speed into consideration is proposed. This analysis is considerably distinct from other existing studies using supposed transition probability for searching moving targets. A case study is performed to validate the effectiveness and usefulness of our methodology. Also, this study suggests that the proposed approach can be used for searching for infiltrated ground moving target within critical time window. The proposed method could be used not only to assist a searcher's mission planning, but also to support the tactical commander's timely decision making ability and ensure the operations' success.

• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.641-649
• /
• 2004

The relationship between chemical structures and biological activities is researched briskly in the area of 'Medicinal Chemistry' At the base of these structure-based drug design tries, medicinal chemists search the existing drugs of similar chemical structure to target drug for the development of a new drug. Therefore, it is such necessary that an automatic system selects drug files that have a set of chemical moieties matching a user-defined query moiety. Substructure searching is the process of identifying a set of chemical moieties that match a specific query moiety. Testing for substructure searching was developed in the late 1950s. In graph theoretical terms, this problem corresponds to determining which graphs in a set are subgraph isomorphic to a specified query moiety. Testing for subgraph isomorphism has been proved, in the general case, to be an NP- complete problem. For the purpose of overcoming this difficulty, there were computational approaches. On the 1990s, a US patent has been granted on an atom-centered indexing scheme, used by the RS3 system; this has the virtue that the indexes generated can be searched by direct text comparison. This system is commercially used(http://www.acelrys.com/rs3). We define the RS3 system's drawback and present a new indexing scheme. The RS3 system treats substructure searching with substring matching by means of expressing chemical structure aspredefined strings. However, it has insufficient 'rerall' and 'precision‘ because it is impossible to index structures uniquely for same atom and same bond. To resolve this problem, we make the minimum-cost- spanning tree for one centered atom and describe a structure with paths per levels. Expressing 2D chemical structure into 1D a string has limit. Therefore, we break 2D chemical structure into 1D structure fragments. We present in this paper a new index technique to improve recall and precision surprisingly.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.7C
• /
• pp.688-695
• /
• 2003

In this paper, the parallel sub-filter searching structure to be adapted that divides a filter into several sub filters and the parameter decision technique to control adaptive parameters with power of received signal in the code acquisition system using adaptive filter are proposed. The numerical results for the system probabilities are derived that the code acquisition system using parallel sub-filter searching structure is statistically analyzed. Also, characteristic of the parameters in adaptive code acquisition system is analyzed by simulations and the parameter decision technique through SNRc estimation is explained. The system with parallel sub-filter searching structure outperforms by 1∼l.5 dB for 16 taps, 5∼6 dB for 64 taps. And the system with parameter decision technique works efficiently with the reasonable degree of degradation about 1 ∼2.5dB for 16 and 32 taps.

• Nuclear Engineering and Technology
• /
• v.41 no.3
• /
• pp.247-270
• /
• 2009

This paper reviews studies on information searching behavior in process control systems and discusses some implications learned from previous studies for use in human factors studies on nuclear power plants (NPPs) main control rooms (MCRs). Information searching behavior in NPPs depends on expectancy, value, salience, and effort. The first quantitative scanning model developed by Senders for instrument panel monitoring considered bandwidth (change rate) of instruments as a determining factor in scanning behavior. Senders' model was subsequently elaborated by other researchers to account for value in addition to bandwidth. There is also another type of model based on the operator's situation awareness (SA) which has been developed for NPP application. In these SA-based models, situation-event relations or rules on system dynamics are considered the most significant factor forming expectancy. From the review of previous studies it is recommended that, for NPP application, (1) a set of symptomatic information sources including both changed and unchanged symptoms should be considered along with bandwidth as determining factors governing information searching (or visual sampling) behavior; (2) both data-driven monitoring and knowledge-driven monitoring should be considered and balanced in a systematic way; (3) sound models describing mechanisms of cognitive activities during information searching tasks should be developed so as to bridge studies on information searching behavior and design improvement in HMI; (4) the attention-situation awareness (A-SA) modeling approach should be recognized as a promising approach to be examined further; and (5) information displays should be expected to have totally different characteristics in advanced control rooms. Hence much attention should be devoted to information searching behavior including human-machine interface (HMI) design and human cognitive processes.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.20 no.11
• /
• pp.1209-1216
• /
• 2009

This paper presents an efficient Quantized Equal Gain Transmission(QEGT) codebook index searching technique for MISO beamforming system in a Rayleigh flat fading channel. The searching time for the optimum weight vector among the codebook vectors increases exponentially when the codebook size increases linearly, although the bit error rate decreases. So, newly defined simple metric is proposed for fast searching, which determines a few candidates. Then the conventional method combined with accurate search algorithm selects the optimal index. This strategy significantly reduces the overall search time, while maintaining almost the same bit error rate performance. Furthermore, as the codebook size increases, the search time is considerably decreased compared to that of the conventional approach.

• Journal of Internet Computing and Services
• /
• v.7 no.2
• /
• pp.9-21
• /
• 2006

Researches on enhancing the searching function of the web service using the ontology concept have been studying. One of them suggests a searching method for UDDI using DAML and DAML+OIL. However this approach has inconveniences to use operations proper to the circumstance and to define respective ontologies according to them. To solve these problems, we introduce an effective method of dealing with N-Triple, filtering care Triples, merging Triples, semantic connection between Triples and searching Triples for searching information and recommending the results in semantic web environment. Furthermore, we implement this proposed method in a system to test it. Finally, we test the system in the virtual semantic web environment for out research analysis.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.11a
• /
• pp.1158-1159
• /
• 2013

It gives to users a difficulty for searching between this huge numbers of programs. Searching the best applications for our needs is a big challenge today. In this paper, we propose a study on collaborative filtering based app recommendation system. The proposed method is composed of three steps. In the first step, we extract the data set from the target website. In the second step, we parse the extracted raw data according to the types, and store in a database. In the third, we perform recommendations based on the stored data in database.

• Proceedings of the IEEK Conference
• /
• 2003.11b
• /
• pp.129-132
• /
• 2003

The metathesaurus(UMLS, 2003AA edition) supports multi language and includes 875, 233 concepts, 2, 146, 897 concept names. It is impossible for PubMed or NLM serve searching of the metatheaurus to retrieval using a query that is not to be text, a fault sentence structure or a part of concept name. That means the user notice correctly suitable medical words in order to get correct answer, otherwise she or he can't find information that they want to find I propose that the method of searching unified medical language system using automatic modified a query for problem that I mentioned. This method use dictionary that is standard for automation of modified query gauge similarity between query and dictionary using string comparison algorithm. And then, the tested term converse the form of metathesaurus for optimized result. For the evaluation of method, I select some query and I contrast NLM method that renewed Aug. 2003.

• Journal of Power System Engineering
• /
• v.20 no.2
• /
• pp.5-16
• /
• 2016

Generally, methods using transfer techniques, like the transfer matrix method and the transfer stiffness coefficient method, find natural frequencies using the sign change of frequency determinants in searching frequency region. However, these methods may omit some natural frequencies when the initial frequency interval is large. The Sylvester-transfer stiffness coefficient method ("S-TSCM") can always obtain all natural frequencies in the searching frequency region even though the initial frequency interval is large. Because the S-TSCM obtain natural frequencies using the number of natural frequencies existing under a searching frequency. In this paper, the algorithm for the free vibration analysis of axisymmetric conical shells was formulated with S-TSCM. The effectiveness of S-TSCM was verified by comparing numerical results of S-TSCM with those of other methods when analyzing free vibration in two computational models: a truncated conical shell and a complete (not truncated) conical shell.

• Journal of the Korea Safety Management & Science
• /
• v.13 no.3
• /
• pp.97-105
• /
• 2011

In order to determine home delivery service routes, conditions specified for each parcel such as customer-assigned delivery times and parcel contents should be considered, so the conventional route search algorithms have some limits to be applied for home delivery services. In this study, a multi-purpose route searching algorithm is suggested in order to deal with every requirement of deliveries that vary in delivery distances, contents and appointed times. A simulation study to verify the performances of the system with example data of Seoul and Kyungki provinces shows that it significantly improves the customer satisfaction and the productivity of delivery businesses.