• Journal of Information Processing Systems
• /
• v.12 no.4
• /
• pp.724-740
• /
• 2016

The performance issues of screening large database compounds and multiple query compounds in virtual screening highlight a common concern in Chemoinformatics applications. This study investigates these problems by choosing group fusion as a pilot model and presents efficient parallel solutions in parallel platforms, specifically, the multi-core architecture of CPU and many-core architecture of graphical processing unit (GPU). A study of sequential group fusion and a proposed design of parallel CUDA group fusion are presented in this paper. The design involves solving two important stages of group fusion, namely, similarity search and fusion (MAX rule), while addressing embarrassingly parallel and parallel reduction models. The sequential, optimized sequential and parallel OpenMP of group fusion were implemented and evaluated. The outcome of the analysis from these three different design approaches influenced the design of parallel CUDA version in order to optimize and achieve high computation intensity. The proposed parallel CUDA performed better than sequential and parallel OpenMP in terms of both execution time and speedup. The parallel CUDA was 5-10x faster than sequential and parallel OpenMP as both similarity search and fusion MAX stages had been CUDA-optimized.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2000.11a
• /
• pp.233-238
• /
• 2000

CNC machine tool is assembled by central processor, PLC(Programmable Logic Controller), and actuator. The sequential control of machine generally controlled by a PLC. The main fault occured at PLC in 3 control parts. In LC faults, operational fault is charged over 70%. This paper describes diagnosis model and data processing for remote monitoring and diagnosis system in machine tools with open architecture controller. Two diagnostic models based on the ladder diagram. Logical Diagnosis Model(LDM), Sequential Diagnosis Model(SDM), are proposed. Data processing structure is proposed ST(Structured Text) based on IEC1131-3. The faults from CNC are received message form open architecture controller and faults from PLC are gathered by sequential data.. To do this, CNC and PLC's logical and sequential data is constructed database.

• Journal of Information Processing Systems
• /
• v.13 no.1
• /
• pp.104-113
• /
• 2017

In this paper, we present an approach to transmit data from the source to the destination through a minimal path (least-cost path) in a computer network of n nodes. The motivation behind our approach is to address the problem of finding a minimal path between the source and destination. From the work we have studied, we found that a Steiner tree with bounded Steiner vertices offers a good solution. A novel algorithm to construct a Steiner tree with vertices and bounded Steiner vertices is proposed in this paper. The algorithm finds a path from each source to each destination at a minimum cost and minimum number of Steiner vertices. We propose both the sequential and parallel versions. We also conducted a comparative study of sequential and parallel versions based on time complexity, which proved that parallel implementation is more efficient than sequential.

• The KIPS Transactions:PartD
• /
• v.18D no.2
• /
• pp.81-88
• /
• 2011

Sequential pattern mining that determines frequent patterns appearing in a given set of sequences is an important data mining problem with broad applications. For example, sequential pattern mining can find the web access patterns, customer's purchase patterns and DNA sequences related with specific disease. In this paper, we develop the sequential pattern mining algorithms using MapReduce framework. Our algorithms distribute input data to several machines and find frequent sequential patterns in parallel. With synthetic data sets, we did a comprehensive performance study with varying various parameters. Our experimental results show that linear speed up can be achieved through our algorithms with increasing the number of used machines.

• Journal of the Korean Home Economics Association
• /
• v.46 no.9
• /
• pp.125-135
• /
• 2008

The purpose of this study was to examine the effects of young children's age and information processing style in understanding spatial coordinates. For sampling the subjects of this study, Korean version K-ABC Intelligence Test(Moon, Soo-Back, 1997)was conducted with 165 children aged 5-6 who were attending I and G kindergarten in D city. From this pool 30 children who possessed sequential processing style and 30 children who possessed simultaneous processing style were sampled. In order to analyze the understanding of spatial coordinates, a test tool was formulated according to methodology of Blades & Spencer(1989) which was modified. Acquired data was subjected to descriptive and comparative statistical analysis. The following conclusions were arrived at: Firstly, there was significant difference between 5-year-olds and 6-year-olds in understanding spatial coordinates. The 6-year-old group got statistically higher grades than the 5-year-old group in locating a point on the coordinate plane and reading the coordinate numbers. Secondly, there was significant difference between children's information processing style in understanding spatial coordinate. Children with high simultaneous-low sequential processing showed higher performance in locating a point on the coordinate plane and reading coordinate numbers than children with high sequential-low simultaneous processing. Thirdly, after verifying statistical significance of interactivity between young children's age and children's processing strength, there was significant interactive effects in both tasks.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.3
• /
• pp.564-571
• /
• 1996

The logic synthesis systems for table look up(TLU) type field programmable e gate arrays(FPGAs) have so farstudied mostly the combinational logic problem m. This paper presents for mapping a sequential circuit onto a popular table look up architecture, theXilinx 3090 architecture. In thefirst for solving this problem, combinational and sequential elements which have 6 or7 input combinational and sequential elements which haveless thanor equal to 5 inputs. We heavily use the combinational synthesis techniques tosolve the sequential synthesis problem. Our syntheisis approach is very simple, but its results are reasonable. We compare seveal benchmark Examples with sis-pga(map_together and map_separate) synthesis system and the experimental results show that our synthesis system is 17% betterthan sis-pga sequential synthesis system for TLU PGAs.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.1
• /
• pp.11-17
• /
• 1992

This paper is to propose an analytical queuing model for parallel processing of sequential program with nested loops. The analytical results are compared with the results from the implemented multiprocessor system composed of four intel 8088 microprocessor, eight 2KB shared common memories, and a hardware token ring. At results, this study shows that the processed results are almost similar in proposed analytical model and real system. Proposed analytical model can be applied to evaluate parallel processing of sequential program with nested loops.

• Journal of Korea Society of Industrial Information Systems
• /
• v.6 no.3
• /
• pp.29-34
• /
• 2001

In this paper, a new associative memory system for analog time-sequential data processing is proposed. This system effectively associate time-sequential data using not only matching with present data but also matching with past data. Furthermore in order to improve error correction ability, weight varying in time domain is introduced in this system. The network is simulated with several periodic time-sequential input patterns including noise. The results show that the proposed system has ability to correct input errors. We expect that the proposed system may be applied for a real time processing of analog time-sequential information.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.11a
• /
• pp.771-774
• /
• 2014

지난 몇 년간 스마트폰은 굉장히 빠른 속도로 발전하면서 생활 속에서 큰 비중을 차지하고 있다. 이러한 스마트폰에는 에너지 효율, 크기, 속도 면에서 모바일 기기에 적합한 Flash storage가 탑재되고 있다. 이 논문에서는 스마트폰에 탑재된 Flash storage를 기반으로 한 버퍼 교체 알고리즘들 가운데 Spatial Clock 알고리즘에 초점을 맞추고 있다. 그리고 이 알고리즘이 Video Streaming workload에서 성능 발휘를 하지 못한다는 점을 해결하기 위해 SWSC(Sequential Write Spatial Clock) 알고리즘을 제안하였다. 이 알고리즘은 dirty 페이지들이 연속적인 경우 sequential write를 수행한다. 따라서 write 수행시간을 줄일 수 있고 결과적으로 Video Streaming workload에서도 좋은 성능을 발휘할 수 있다.

• 한국정보디스플레이학회:학술대회논문집
• /
• 2009.10a
• /
• pp.1069-1072
• /
• 2009

Field sequential display has some advantages but color breakup (CBU) is the significant problem. Many researches had introduced several methods to reduce CBU phenomenon, however there are no reliable methods to measure the degree of CBU. In this report, a novel CBU measurement technique which was based on the image processing method and subjective analysis results had proposed to evaluate the degree of CBU. Color Breakup Index (CBI) was presented to be a useful index to recognize the CBU phenomenon in the different field sequential technique displays.