• Title/Summary/Keyword: 적중율

Search Result 68, Processing Time 0.023 seconds

The comparison of the BAD and the BCD methods in a P300-based concealed information test (P300 숨긴정보검사에서 BAD 방법과 BCD 방법의 비교)

  • Eom, Jin-Sup
    • Korean Journal of Forensic Psychology
    • /
    • v.12 no.2
    • /
    • pp.151-169
    • /
    • 2021
  • In the P300-based concealed information test, most commonly used methods to detect whether a subject is lying are the bootstrapped amplitude difference (BAD) and the bootstrap correlation difference (BCD). Previous studies comparing the accuracy of the two methods reported inconsistent results. Most studies showed that the BAD is more accurate than the BCD, but some studies found that the BCD had a higher accuracy rate than the BAD. The purpose of the study is to identify conditions where the each method has higher accuracy compared to the other. In the result of Monte Carlo study, the false alarm rate of the BAD was generally higher than that of the BCD, and the hit rate of the BAD was higher than that of the BCD. Compared to the condition where the P300 latencies of probe and irrelevant were similar, the hit rate of the BCD was decreased when the P300 latency of probe was about 100 ms faster, and the hit rate of the BCD was increased when the P300 latency of probe was about 100 ms slower. When the P300 amplitude of the probe was slightly larger than that of the irrelevant and the P300 latency of probe was longer than that of target, the hit rate of the BCD was higher than that of the BAD. The reason why the false alarm rate of the BAD is higher than that of BCD and why the hit rate of the BCD is affected by the P300 latency of the probe were discussed.

Adaptive Migration Path Technique of Mobile Agent Using the Metadata of Naming Agent (네이밍 에이전트의 메타데이터를 이용한 이동 에이전트의 적응적 이주 경로 기법)

  • Kim, Kwang-Jong;Ko, Hyun;Lee, Yon-Sik
    • Journal of the Korea Society of Computer and Information
    • /
    • v.12 no.3
    • /
    • pp.165-175
    • /
    • 2007
  • The mobile agent executes a given task by which the agent code moves to the server directly. Therefore, node migration method becomes an important factor which impact on the whole performance of distributed system. In this paper, we propose an adaptive migration path technique of mobile agent using the metadata of naming agent. In this proposed technique, node selection for migration depends on the content of referenced metadata, and the reliability of migrated information is determined by the metadata updating method and cooperative operations of individual agents in multi-agents system. For these, we design the metadata using by the number of hit documents, hit ratio, node processing time and network delay time, and describe the methods for creating, using and updating metadata for which determine the adaptive node migration path of mobile agent according to the cooperation of individual agents and number of hit documents using by designed metadata. And results of evaluated performance for proposed adaptive migration path technique through the proper experiment and analysis gain rate of high effective information earning, because of high hit ratio(72%) about of fathered documents by case of applying metadata move to the 13 nodes. But, in case of non-applying metadata is hit ratio(46%) of gathered documents and rate of effective information earning about of 26 nodes is 36.8%.

  • PDF

The Implementation Performance Evaluation of PR-File Based on Circular ar Domain (순환도메인을 기반으로 하는 PR-화일의 구현 및 성능 평가)

  • Kim, Hong-Ki;Hwang, Bu-Hyun
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.1
    • /
    • pp.63-76
    • /
    • 1996
  • In this paper, we propose a new dynamic spatial index structure, called PR -file, for handling spatial objects and the modified hierarchical variance which measures the degree of spatial locality at each level. Under the assumption that a multidimensional search space has a circular domain, PR-file uses the modified hierarchical variance for clustering spatially adjacent objects. The insertion and splitting algorithms of PR_file preserve and index which has a low hierarchical variance regardless of object distributions. The simulation result shows that PR- file has a high hit ratio during a retrieval of objects by using an index with low hierarchical variance. And it shows a characteristic that the larger the bucket capacity, the higher the bucket utilization.

  • PDF

Improvement of roll force precalculation accuracy in cold mill using a corrective neural network (보정신경망을 이용한 냉연 압하력 적중율 향상)

  • 이종영;조형석;조성준;조용중;윤성철
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1996.10b
    • /
    • pp.1083-1086
    • /
    • 1996
  • Cold rolling mill process in steel works uses stands of rolls to flatten a strip to a desired thickness. At cold rolling mill process, precalculation determines the mill settings before a strip actually enters the mill and is done by an outdated mathematical model. A corrective neural network model is proposed to improve the accuracy of the roll force prediction. Additional variables to be fed to the network include the chemical composition of the coil, its coiling temperature and the aggregated amount of processed strips of each roll. The network was trained using a standard backpropagation with 4,944 process data collected from no.1 cold rolling mill process from March 1995 through December 1995, then was tested on the unseen 1,586 data from Jan 1996 through April 1996. The combined model reduced the prediction error by 32.8% on average.

  • PDF

Distributed Construction of the Recrystallization Topology and Efficient Searching in the Unstructured Peer-to-Peer Network (재결정 위상의 분산적 구성과 비구조적 피어투피어 망에서의 효율적 검색)

  • Park, Jae-Hyun
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.4
    • /
    • pp.251-267
    • /
    • 2008
  • In this paper, we present a distributed topology control algorithm for constructing an optimized topology having a minimal search-time in unstructured peer-to-peer network. According to the proposed algorithm, each node selects the best nodes having higher hit-ratio than other nodes as many as the number being exponentially proportional to the hit-ratio of the node itself, and then it connects to them. The ensemble behavior of the proposed algorithm is very similar to the recrystrallizing phenomenon that is observed in nature. There is a partial order relationship among the hit-ratios of most nodes of constructed topology. Therefore once query message visits a node, it has a higher hit-ratio than the node that was visited last by the message. The query message even sent from freeloader can escape to the node having high hit-ratio by one hop forwarding, and it never revisits any freeloader again. Thus the search can be completed within a limited search time. We also propose the Chain-reactive search scheme using the constructed topology. Such a controlled multicasting reduces the query messages by 43 percent compared to that of the naive Gnutella using broadcasting, while it saves the search time by 94 percent. The search success rate of the proposed scheme is 99 percent.

Acceleration of LU-SGS Code on Latest Microprocessors Considering the Increase of Level 2 Cache Hit-Rate (최신 마이크로프로세서에서 2차 캐쉬 적중률 증가를 고려한 LU-SGS 코드의 가속)

  • Choi, J.Y.;Oh, Se-Jong
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.30 no.7
    • /
    • pp.68-80
    • /
    • 2002
  • An approach for composing a performance optimized computational code is suggested for latest microprocessors. The concept of the code optimization, called here as localization, is maximizing the utilization of the second level cache that is common to all the latest computer system, and minimizing the access to system main memory. In this study, the localized optimization of LU-SGS (Lower-Upper Symmetric Gauss-Seidel) code for the solution of fluid dynamic equations was carried out in three different levels and tested for several different microprocessor architectures most widely used in these days. The test results of localized optimization showed a remarkable performance gain up to 7.35 times faster solution, depending on the system, than the baseline algorithm for producing exactly the same solution on the same computer system.

Optimal Weather Variables for Estimation of Leaf Wetness Duration Using an Empirical Method (결로시간 예측을 위한 경험모형의 최적 기상변수)

  • K. S. Kim;S. E. Taylor;M. L. Gleason;K. J. Koehler
    • Korean Journal of Agricultural and Forest Meteorology
    • /
    • v.4 no.1
    • /
    • pp.23-28
    • /
    • 2002
  • Sets of weather variables for estimation of LWD were evaluated using CART(Classification And Regression Tree) models. Input variables were sets of hourly observations of air temperature at 0.3-m and 1.5-m height, relative humidity(RH), and wind speed that were obtained from May to September in 1997, 1998, and 1999 at 15 weather stations in iowa, Illinois, and Nebraska, USA. A model that included air temperature at 0.3-m height, RH, and wind speed showed the lowest misidentification rate for wetness. The model estimated presence or absence of wetness more accurately (85.5%) than the CART/SLD model (84.7%) proposed by Gleason et al. (1994). This slight improvement, however, was insufficient to justify the use of our model, which requires additional measurements, in preference to the CART/SLD model. This study demonstrated that the use of measurements of temperature, humidity, and wind from automated stations was sufficient to make LWD estimations of reasonable accuracy when the CART/SLD model was used. Therefore, implementation of crop disease-warning systems may be facilitated by application of the CART/SLD model that inputs readily obtainable weather observations.

Weak-linked Neurons Elimination Method based Neural Network Models for Bankruptcy Prediction (약체연결뉴런 제거법에 의한 부도예측용 인공신경망 모형에 관한 연구)

  • 손동우;이웅규
    • Proceedings of the Korea Association of Information Systems Conference
    • /
    • 2000.05a
    • /
    • pp.115-121
    • /
    • 2000
  • 본 연구는 인공신경망 모형에서 최적 입력 변수를 선정하기 위하여 새로운 선처리 기법인 약체연결뉴런 제거법을 제안하고 그 예측력의 우월성을 순수 인공신경망과 의사결정트리로 선처리한 인공신경망 모델과 각각 비교했으며, 그 결과를 보면 본 연구에서 제안하고 있는 약체연결뉴런 제거법에 의해 입력변수 선정과정을 거친 모델의 성과가 순수 인공신경망이나 의사결정트리로 선처리한 인공신경망 모델에 비해 예측적중율이 우수한 것으로 나타났다.

  • PDF

유채박의 사료화를 위한 유해성분(Glucosinolate) 개량육종에 관한 연구 IV. 5-vinyl-2-oxazolidinethione 함량의 유전

  • Jung-Il Lee
    • KOREAN JOURNAL OF CROP SCIENCE
    • /
    • v.32 no.2
    • /
    • pp.196-200
    • /
    • 1987
  • 유채박의 사료화를 위한 성분개량을 목표한 육종의 기초자료를 얻고자 유채박의 OZT함량이 낮은 영산유채와 그 함량이 고함유인 품종들을 정역교배하여 얻은 F$_2$세대의 종실을 대상으로 OZT함량에 관여하는 유전자수와 세포질의 영향에 관하여 조사분석한 결과는 다음과 같다. 1. F$_2$세대에서 OZT함양을 영산유채에 기준한 낮은 개체의 출현율은 OZT함량이 저함유인 품종을 모본으로 교배한 조합에서 높게 나타났다. 2. OZT함량의 분리비는 63 : 1에 가장 적중도가 높아 3쌍의 열성유전자가 OZT생성에 관여하고 있는 것으로 추정되었다. 3. OZT함량의 유전에 세포질의 영향이 인정되었다.

  • PDF

A Study on Establishment of Discrimination Model of Big Traffic Accident (대형교통사고 판별모델 구축에 관한 연구)

  • 고상선;이원규;배기목;노유진
    • Journal of Korean Port Research
    • /
    • v.13 no.1
    • /
    • pp.101-112
    • /
    • 1999
  • Traffic accidents increase with the increase of the vehicles in operation on the street. Especially big traffic accidents composed of over 3 killed or 20 injured accidents with the property damage become one of the serious problems to be solved in most of the cities. The purpose of this study is to build the discrimination model on big traffic accidents using the Quantification II theory for establishing the countermeasures to reduce the big traffic accidents. The results are summarized as follows. 1)The existing traffic accident related model could not explain the phenomena of the current traffic accident appropriately. 2) Based on the big traffic accident types vehicle-vehicle, vehicle-alone, vehicle-pedestrian and vehicle-train accident rates 73%, 20.5% 5.6% and two cases respectively. Based on the law violation types safety driving non-fulfillment center line invasion excess speed and signal disobedience were 48.8%, 38.1% 2.8% and 2.8% respectively. 3) Based on the law violation types major factors in big traffic accidents were road and environment, human, and vehicle in order. Those factors were vehicle, road and environment, and human in order based on types of injured driver’s death. 4) Based on the law violation types total hitting and correlation rates of the model were 53.57% and 0.97853. Based on the types of injured driver’s death total hitting and correlation rates of the model were also 71.4% and 0.59583.

  • PDF