• IEMEK Journal of Embedded Systems and Applications
• /
• v.12 no.5
• /
• pp.267-275
• /
• 2017

Time of difference of arrival (TDOA) method using passive sonar sensor array has normally been used to estimate the location of a concealed moving target in underwater environment. Particle filter has been introduced for effective target estimation for non-Gaussian and nonlinear systems. In this paper, we propose a GPU-based acceleration of target position estimation using particle filter and propose efficient embedded system and software architecture. For the TDOA measurement from the passive sonar sensor, we use the generalized cross correlation phase transform (GCC-PHAT) method to obtain the correlation coefficient of the signal using FFT and we try to accelerate the calculation of GCC-PHAT based TDOA measurements using FFT with GPU CUDA. We also propose parallelization method of the target position estimation algorithm using the GPU CUDA to update the state of each particle for the target position estimation using the measured values. The target estimation algorithm was verified using Matlab and implemented using GPU CUDA. Then, we realized the proposed signal processing acceleration system using NVIDIA Jetson TX1 as the target board to analyze in terms of the execution time. The execution time of the algorithm is reduced by 55% to the CPU standalone-operation on the target board. Experiment results show that the proposed architecture is a feasible solution in terms of high-performance and area-efficient architecture.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.4
• /
• pp.17-24
• /
• 2014

Detecting data races is important for debugging shared-memory programs with nested parallelism, because races result in unintended non-deterministic executions of the program. It is especially important to detect the first occurred data races for effective debugging, because the removal of such races may make other affected races disappear or appear. Previous dynamic detection tools for first race detecting can not guarantee that detected races are unaffected races. Also, the tools does not consider the nesting levels or need support of other techniques. This paper suggests a post-mortem tool which collects candidate accesses during program execution and then detects the first races to occur on the program after execution. This technique is efficient, because it guarantees that first races reported by analyzing a nesting level are the races that occur first at the level, and does not require more analyses to the higher nesting levels than the current level.

• Journal of Korea Multimedia Society
• /
• v.7 no.7
• /
• pp.859-876
• /
• 2004

This paper presents optimal configurations of multidimensional path indexes (MPIs) for the efficient execution of object-oriented queries in object databases. MPI uses a multidimensional index structure for efficiently supporting nested predicates that involve both nested attribute and class hierarchies, which are not supported by the nested attribute index using one-dimensional index structure such as $B^+$-tree. In this paper, we have analyzed the MPIs in the framework of complex queries, containing conjunctions of nested predicates, each one involving a path expression having target classes and domain classes substitution. First of all, we have considered MPI operations caused by updating of object databases, and the use of the MPI in the case of a query containing a single nested predicate. And then, we have considered the use of the MPIs in the framework of more general queries containing nested predicates over both overlapping and non-overlapping paths. The former are paths having common subpaths, while the latter have no common subpaths.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.2
• /
• pp.39-48
• /
• 2014

In this paper, we propose an efficient dynamic workload balancing strategy which improves the performance of high-performance computing system. The key idea of this dynamic workload balancing strategy is to minimize execution time of each job and to maximize the system throughput by effectively using system resource such as CPU, memory. Also, this strategy dynamically allocates job by considering demanded memory size of executing job and workload status of each node. If an overload node occurs due to allocated job, the proposed scheme migrates job, executing in overload nodes, to another free nodes and reduces the waiting time and execution time of job by balancing workload of each node. Through simulation, we show that the proposed dynamic workload balancing strategy based on CPU, memory improves the performance of high-performance computing system compared to previous strategies.

• Journal of Digital Convergence
• /
• v.15 no.7
• /
• pp.191-199
• /
• 2017

This study aims to confirm the effects of the practical work-oriented educational program applied to the nursing students prior to the commencement of their employment on the ability of the newly recruited nurses in execution of clinical competency, critical thinking and turnover rates. It is a single-group pre-post design and non-equivalent control group design. As for the results of the research, nurses who participated in the practical work-oriented educational program prior to employment displayed an increase in their ability to execute clinical competency and critical thinking capabilities along with the reduction in their turnover rate within 1month after their employment. The results indicate that practical work-oriented educational program form the stage of nursing school years prior to employment at hospital in important and the practical work-oriented educational program attempted as a new means of management of human resources for new nurses can be used as a beneficial program at the time of the development of education programs at the hospitals ans nursing schools.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.10
• /
• pp.167-174
• /
• 2019

In this paper, We propose the purpose the examine the physical factors that influence the success rate during the endotracheal intubation and to provide the basic data for effective intubation success. The subject of this study was 42 students in emergency rescue department who had completed the BLS Health Care-provider and a specialized airway maintenance course dealing with endotracheal intubation and it is a similar experimental study after the non-equivalence single group. For data analysis, SPSS 23.0 Version was used. The study methods were measuring the grip fotce of subjects, the angle of arm during intubation tube, distance from manikin, palm length, etc. The results showed that there was a correlation between the time of successful endotracheal intubation and the physical characteristics. In particular, when performing endotracheal intubation, it was related to the angle of the arm and the execution time of the performer, and the narrower the angle of the arm, the shorter the execution time. The results of this study suggest that successful endotracheal intubation could be implemented if the operator tried to reduce the angle of the arm when performing endotracheal intubation, and through further research on various job groups, identify the possibility of clinical use will be necessary.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.744-747
• /
• 1997

High performance digital computer technology enables the digital computer-based controllers to replace traditional analog controllers used for factory automations. This replacement, however, brings up the side effects caused by discrete quantization and non-real-time execution of control softwares. This paper describes the structure of real-time simulator and controller that can be used for design and verification of real-time digital controllers. The virtual machine concept adopted by real-time simulator make the proposed simulator be independent from the specific hardware platforms. The proposed system can also be used in the loosely coupled distributed environments connected through local area network using real-time message passing algorithm and virtual data table based on the shared memory mechanism.

• Journal of Institute of Control, Robotics and Systems
• /
• v.5 no.1
• /
• pp.115-121
• /
• 1999

Advanced digital computer technology enables the computer-based controllers to replace the traditional analog controllers used in factory automations. This replacement, however, brings up the side effects caused by the quantization error and non-real-time execution of control software. This paper describes the structure of real-time simulator and controller that can be used for design and verification of real-time digital controllers. The virtual machine concept adopted by the proposed real-time simulator makes the proposed simulator be independent from the specific hardware platforms. The proposed system can also be used in the loosely coupled distributed environments connected through local area network using real-time message passing algorithm and virtual data table based on the shared memory mechanism.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.587-591
• /
• 2003

This study develops a neural network for solving optimization problems. Hopfield network has been used for such problems, but it frequently gives abnormal solutions or non-optimal solutions. Moreover, it takes much time for solving a solution. To overcome such disadvantages, this study adopts a neural network whose output nodes change with a small value at every evolution, and the proposed neural network is applied to solve ALB (Assembly Line Balancing) problems . Given a precedence diagram and a required number of workstations, an ALB problem is solved while achieving even distribution of workload among workstations. Here, the workload variance is used as the index of workload deviation, and is reflected to an energy function. The simulation results show that the proposed neural network yields good results for solving ALB problems with high success rate and fast execution time.

• Journal of KIISE:Software and Applications
• /
• v.26 no.1
• /
• pp.139-139
• /
• 1999

In most application programs, loops usually comprise most of the computation in a program and the most important source of parallelism. When the data dependency relation is uniformin terms of distance, several compile time parallelization methods were introduced. On the otherhand,when the data dependency relation is non-uniform in distance, the compile time extraction ofparallelism is much complicated. In this paper, a general method the extracting parallelism in nestedloops is presented. This algorithm can be applicable where the dependency relation is both uniform andnon-uniform in distance. According to execution repeatedly the statements in nested loops, thealgorithm which effectively removes these kind of data dependencies is developed in order to presentthe total parallelization of nested loops.