• Title/Summary/Keyword: Computer Identification

Search Result 1,477, Processing Time 0.028 seconds

A Study on the Computer Assisted Dental Identification in Mass Disaster (대형참사시 컴퓨터를 이용한 법의치과학적 개인식별)

  • Shin, Kyoung-Jin;Choi, Jong-Hoon;Yoon, Chang-Lyuk;Kim, Chong-Youl
    • Journal of Oral Medicine and Pain
    • /
    • v.24 no.1
    • /
    • pp.81-94
    • /
    • 1999
  • This study intends to find usefulness of the computer assisted dental identification in mass disaster. The variety of dental characteristics was investigated through the research of dental records of 508 adults. And a computer assisted simulation program was used to evaluate the selectivity of dental identification. Findings were as follows : 1. Combinations of dental characteristics were found 155 types. The most various dental characteristic was showed on the mandibular first molar. 99.0% of subjects had dental characteristics for dental identification. 2. The posterior teeth, in comparison with anterior teeth, showed higher selectivity in dental identification which was enhanced by information on the material, type and cavity of the restoration. 3. The variety of dental characteristics was mainly found on the combinations of missing tooth with the material, type and cavity of the restoration. 4. The computer assisted dental identification program, with informa- tion about one's tooth state, made individual identification possible when there was only a part of the teeth in a corpse. 5. The computer assisted dental identification had considerably high selectivity based on the variety of dental characteristics. And it was also performed faster and preciser than the existing identification methods. Based on the results of this study, there are various combinations of the feature of the tooth itself with dental characteristics caused by a certain type of treatment on the teeth. And using the computer assisted dental identification program based on this, dental identification can be more efficient economically and more useful than any other forensic identification methods.

  • PDF

Receiving Pad Identification Coil for Wireless Charging of Electric Vehicle (전기자동차 무선 충전용 수신패드 식별코일의 형상 설계 및 운용 방안)

  • Dong-Hyeon, Sim;Hyeon-Woo, Jo;Hun, Heo;Ju-A, Lee;Won-Jin, Son;Byoung-Kuk, Lee
    • The Transactions of the Korean Institute of Power Electronics
    • /
    • v.27 no.6
    • /
    • pp.455-463
    • /
    • 2022
  • This study proposes a receiving pad identification coil for wireless charging of electric vehicles. The proposed coil identifies the shape of the receiving pad through magnetic coupling with the receiving pad. Therefore, the shape of the coil is designed to show the different magnetic properties of each receiving pad. The accuracy of this design is verified through finite element method simulation. Furthermore, the operation method of the secondary pad identification circuit is described, and the appropriate magnitude and length of the pulse voltage applied to this circuit for receiving pad identification are derived through simulation. The performance of the proposed identification coil set is verified by the experimental results.

Hot Data Identification For Flash Based Storage Systems Considering Continuous Write Operation

  • Lee, Seung-Woo;Ryu, Kwan-Woo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.22 no.2
    • /
    • pp.1-7
    • /
    • 2017
  • Recently, NAND flash memory, which is used as a storage medium, is replacing HDD (Hard Disk Drive) at a high speed due to various advantages such as fast access speed, low power, and easy portability. In order to apply NAND flash memory to a computer system, a Flash Translation Layer (FTL) is indispensably required. FTL provides a number of features such as address mapping, garbage collection, wear leveling, and hot data identification. In particular, hot data identification is an algorithm that identifies specific pages where data updates frequently occur. Hot data identification helps to improve overall performance by identifying and managing hot data separately. MHF (Multi hash framework) technique, known as hot data identification technique, records the number of write operations in memory. The recorded value is evaluated and judged as hot data. However, the method of counting the number of times in a write request is not enough to judge a page as a hot data page. In this paper, we propose hot data identification which considers not only the number of write requests but also the persistence of write requests.

Robust Person Identification Using Optimal Reliability in Audio-Visual Information Fusion

  • Tariquzzaman, Md.;Kim, Jin-Young;Na, Seung-You;Choi, Seung-Ho
    • The Journal of the Acoustical Society of Korea
    • /
    • v.28 no.3E
    • /
    • pp.109-117
    • /
    • 2009
  • Identity recognition in real environment with a reliable mode is a key issue in human computer interaction (HCI). In this paper, we present a robust person identification system considering score-based optimal reliability measure of audio-visual modalities. We propose an extension of the modified reliability function by introducing optimizing parameters for both of audio and visual modalities. For degradation of visual signals, we have applied JPEG compression to test images. In addition, for creating mismatch in between enrollment and test session, acoustic Babble noises and artificial illumination have been added to test audio and visual signals, respectively. Local PCA has been used on both modalities to reduce the dimension of feature vector. We have applied a swarm intelligence algorithm, i.e., particle swarm optimization for optimizing the modified convection function's optimizing parameters. The overall person identification experiments are performed using VidTimit DB. Experimental results show that our proposed optimal reliability measures have effectively enhanced the identification accuracy of 7.73% and 8.18% at different illumination direction to visual signal and consequent Babble noises to audio signal, respectively, in comparison with the best classifier system in the fusion system and maintained the modality reliability statistics in terms of its performance; it thus verified the consistency of the proposed extension.

A Comprehensive Review of Emerging Computational Methods for Gene Identification

  • Yu, Ning;Yu, Zeng;Li, Bing;Gu, Feng;Pan, Yi
    • Journal of Information Processing Systems
    • /
    • v.12 no.1
    • /
    • pp.1-34
    • /
    • 2016
  • Gene identification is at the center of genomic studies. Although the first phase of the Encyclopedia of DNA Elements (ENCODE) project has been claimed to be complete, the annotation of the functional elements is far from being so. Computational methods in gene identification continue to play important roles in this area and other relevant issues. So far, a lot of work has been performed on this area, and a plethora of computational methods and avenues have been developed. Many review papers have summarized these methods and other related work. However, most of them focus on the methodologies from a particular aspect or perspective. Different from these existing bodies of research, this paper aims to comprehensively summarize the mainstream computational methods in gene identification and tries to provide a short but concise technical reference for future studies. Moreover, this review sheds light on the emerging trends and cutting-edge techniques that are believed to be capable of leading the research on this field in the future.

Microservice Identification by Partitioning Monolithic Web Applications Based on Use-Cases

  • Si-Hyun Kim;Daeil Jung;Norhayati Mohd Ali;Abu Bakar Md Sultan;Jaewon Oh
    • Journal of information and communication convergence engineering
    • /
    • v.21 no.4
    • /
    • pp.268-280
    • /
    • 2023
  • Several companies have migrated their existing monolithic web applications to microservice architectures. Consequently, research on the identification of microservices from monolithic web applications has been conducted. Meanwhile, the use-case model plays a crucial role in outlining the system's functionalities at a high level of abstraction, and studies have been conducted to identify microservices by utilizing this model. However, previous studies on microservice identification utilizing use-cases did not consider the components executed in the presentation layer. Unlike existing approaches, this paper proposes a technique that considers all three layers of web applications (presentation, business logic, and data access layers). Initially, the components used in the three layers of a web application are extracted by executing all the scenarios that constitute its use-cases. Thereafter, the usage rate of each component is determined for each use-case and the component is allocated to the use-case with the highest rate. Then, each use-case is realized as a microservice. To verify the proposed approach, microservice identification is performed using open-source web applications.

A Method for Protein Identification Based on MS/MS using Probabilistic Graphical Models (확률그래프모델을 이용한 MS/MS 기반 단백질 동정 기법)

  • Li, Hong-Lan;Hwang, Kyu-Baek
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2012.06b
    • /
    • pp.426-428
    • /
    • 2012
  • In order to identify proteins that are present in biological samples, these samples are separated and analyzed under the sequential procedure as follows: protein purification and digestion, peptide fragmentation by tandem mass spectrometry (MS/MS) which breaks peptides into fragments, peptide identification, and protein identification. One of the widely used methods for protein identification is based on probabilistic approaches such as ProteinProphet and BaysPro. However, they do not consider the difference in peptide identification probabilities according to their length. Here, we propose a probabilistic graphical model-based approach to protein identification from MS/MS data considering peptide identification probabilities, number of sibling peptides, and peptide length. We compared our approach with ProteinProphet using a yeast MS/MS dataset. As a result, our model identified 27 more proteins than ProteinProphet at 1% of FDR (false discovery rate), confirming the importance of peptide length information in protein identification.

Design of a Fault Detector by using System Identification (시스템 식별 기법을 이용한 고장 탐지기 설계)

  • Park, Tae-Dong;Lee, Jea-Ho;Bai, Shan-Lin;Park, Ki-Heon
    • Proceedings of the KIEE Conference
    • /
    • 2008.04a
    • /
    • pp.199-200
    • /
    • 2008
  • Demand for reliability and safety in modem systems has been increased in the research on fault detection and isolation. At traditional approaches to fault detection, redundant sensors have been used. More advanced methods are the residual analysis of signals which are created by the comparison between the actual plant behavior and the output response of a mathematical model. However, mathematical system models are difficult to obtain by using physical laws. These problems can be solved by system identification. In this paper, the transfer function of a direct current motor is estimated by using the system identification. And, the efficiency of the fault detector design is verified by using experiments.

  • PDF

A Method and Tool for Identifying Domain Components Using Object Usage Information

  • Lee, Woo-Jin;Kwon, Oh-Cheon;Kim, Min-Jung;Shin, Gyu-Sang
    • ETRI Journal
    • /
    • v.25 no.2
    • /
    • pp.121-132
    • /
    • 2003
  • To enhance the productivity of software development and accelerate time to market, software developers have recently paid more attention to a component-based development (CBD) approach due to the benefits of component reuse. Among CBD processes, the identification of reusable components is a key but difficult process. Currently, component identification depends mainly on the intuition and experience of domain experts. In addition, there are few systematic methods or tools for component identification that enable domain experts to identify reusable components. This paper presents a systematic method and its tool called a component identifier that identifies software components by using object-oriented domain information, namely, use case models, domain object models, and sequence diagrams. To illustrate our method, we use the component identifier to identify candidates of reusable components from the object-oriented domain models of a banking system. The component identifier enables domain experts to easily identify reusable components by assisting and automating identification processes in an earlier development phase.

  • PDF

A Simple and Fast Anti-collision Protocol for Large-scale RFID Tags Identification

  • Jia, Xiaolin;Feng, Yuhao;Gu, Yajun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.4
    • /
    • pp.1460-1478
    • /
    • 2020
  • This paper proposes a novel anti-collision protocol for large-scale RFID tags identification, named Bi-response Collision Tree Protocol (BCT). In BCT, two group of tags answer the reader's same query in two response-cycles respectively and independently according to the bi-response pattern. BCT improves the RFID tag identification performance significantly by decreasing the query cycles and the bits transmitted by the reader and tags during the identification. Computation and simulation results indicate that BCT improves the RFID tag identification performance effectively, e.g. the tag identification speed is improved more than 13.0%, 16.9%, and 22.9% compared to that of Collision Tree Protocol (CT), M-ary Collision Tree Protocol (MCT), and Dual Prefix Probe Scheme (DPPS) respectively when tags IDs are distributed uniformly.