• Journal of the Korea Society for Simulation
• /
• 제19권2호
• /
• pp.107-118
• /
• 2010

Automotive manufacturing is a complex task that requires the production and assembly of thousands of different components or parts. The engine and the transmission are the major components that constitute a power train system. Although manufacturing processes of an engine are similar, the layouts of the manufacturing lines are different from factory to factory. It is due to the different design concept that how to combine the serial and parallel structures. In this paper, three engine lines of different factories are introduced, and the simulation technology is used to make the performance analysis for different design concepts.

• Journal of the Korea Society of Computer and Information
• /
• 제19권9호
• /
• pp.1-10
• /
• 2014

In this paper, we propose MPI gridding algorithm of LiDAR data that minimizes the communication between the cores. The LiDAR data collected from aircraft is a 3D spatial information which is used in various applications. Since there are many cases where the LiDAR data has too high resolution than actually required or non-surface information is included in the data, filtering the raw LiDAR data is required. In order to use the filtered data, the interpolation using the data structure to search adjacent locations is conducted to reconstruct the data. Since the processing time of LiDAR data is directly proportional to the size of it, there have been many studies on the high performance parallel processing system using MPI. However, previously proposed methods in parallel approach possess possible performance degradations such as imbalanced data size among cores or communication overhead for resolving boundary condition inconsistency. We conduct empirical experiments to verify the effectiveness of our proposed algorithm. The results show that the total execution time of the proposed method decreased up to 4.2 times than that of the conventional method on heterogeneous clusters.

• Smart Media Journal
• /
• 제10권1호
• /
• pp.16-24
• /
• 2021

The exiting word embedding methodology such as word2vec represents words, which only occur in the raw training corpus, as a fixed-length vector into a continuous vector space, so when mapping the words incorporated in the raw training corpus into a fixed-length vector in morphologically rich language, out-of-vocabulary (OOV) problem often happens. Even for sentence embedding, when representing the meaning of a sentence as a fixed-length vector by synthesizing word vectors constituting a sentence, OOV words make it challenging to meaningfully represent a sentence into a fixed-length vector. In particular, since the agglutinative language, the Korean has a morphological characteristic to integrate lexical morpheme and grammatical morpheme, handling OOV words is an important factor in improving performance. In this paper, we propose parallel Tri-LSTM sentence embedding that is robust to the OOV problem by extending utilizing the morphological information of words into sentence-level. As a result of the sentiment analysis task with corpus in Korean, we empirically found that the character unit is better than the morpheme unit as an embedding unit for Korean sentence embedding. We achieved 86.17% accuracy on the sentiment analysis task with the parallel bidirectional Tri-LSTM sentence encoder.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제23권6호
• /
• pp.1409-1418
• /
• 1998

The recent audio CODEC(Coding/Decoding) algorithms are complex of several coding techniques, and can be divided into DSP tasks, controller tasks and mixed tasks. The traditional DSP processor has been designed for fast processing of DSP tasks only, but not for controller and mixed tasks. This paper presents a new architecture that achieves high throughput on both controller and mixed tasks of such algorithms while maintaining high performance for DSP tasks. The proposed processor, YSP-3, operates four algorithms while maintaining high performance for DSP tasks. The proposed processor, YSP-3, operates functional units (Multiplier, two ALUs, Load/Store Unit) in parallel via 4-issue super-scalar instruction structure. The performance evaluation of YSP-3 has been done through the implementation of the several DSP algorithms and the part of the AC-3 decoding algorithms.

• Journal of the Korean Society for Precision Engineering
• /
• 제29권7호
• /
• pp.717-722
• /
• 2012

This paper presents the design and dynamic model of the finger exoskeleton actuated by Ionic Polymer Metal Composites (IPMC) to assist a tip pinch task. Although this exoskeleton will be developed to assist 3 degree-of-freedom motion of each finger, it has been currently made to perform the tip pinch task using 1 degree-of-freedom mechanism as the first step. The six layers of IPMC were stacked in parallel to increase the low actuation force of IPMC. In addition, the finger dummy was manufactured to evaluate the performance of the finger exoskeleton. The pinch task experiments, which were performed on the finger dummy with the developed exoskeleton, showed that the pinch force close to the desired level was obtained. Moreover, the dynamic model of the exoskeleton and finger dummy was developed in order to perform the various analyses for the improvement of the exoskeleton.

• Pediatric Gastroenterology, Hepatology & Nutrition
• /
• 제22권1호
• /
• pp.63-71
• /
• 2019

Purpose: The aim of this study was to identify the minimally meaningful dosage of inulin leading to a prebiotic effect in Indonesian infants. Methods: In a randomized controlled double-blinded, parallel, 3-arm intervention study, 164 healthy formula-fed infants aged 3 to 5 months first obtained formula-A (without inulin) during a 4-week adaptation period. Subsequently, 142 subjects were subjected to a 4-week feeding period by administering either formula-A (no inulin), formula-B (0.2 g/100 mL inulin) or formula-C (0.4 g/100 mL inulin). The primary outcome parameter was %-bifidobacteria in faecal samples determined using quantitative polymerase chain reaction analyses. Secondary outcome parameters were faecal %-lactobacilli, pH and stool frequency, and consistency. Growth and tolerance/adverse effects were recorded as safety parameters. Results: Typical %-bifidobacteria and %-lactobacilli at the end of the adaptation period in the study population were 14% and 2%, respectively. For faecal pH, significant differences between formula groups A vs. C and A vs. B were found at the end of the intervention period. Testing for differences in faecal %-bifidobacteria and %-lactobacilli between groups was hampered by non-normal data set distributions; no statistically significant differences were obtained. Comparisons within groups revealed that only in formula group C, all the three relevant parameters exhibited a significant effect with an increase in faecal %-bifidobacteria and %-lactobacilli and a decrease in pH. Conclusion: A consistent prebiotic effect along with a decrease in pH and increase in %-bifidobacteria and %-lactobacilli was found only in the group administered 0.4 g inulin/100 mL.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• 제46권6호
• /
• pp.56-62
• /
• 2009

Inexpensive high performance computer systems combined with high speed networks and machine independent communication libraries have made cluster computing a viable option for parallel applications. In a heterogeneous cluster environment, efficient resource management is critically important since the computing power of the individual computer system is a significant performance factor when executing applications in parallel. This paper presents a dynamic task manager, called DWM (dynamic work manager). It makes a heterogeneous cluster system fully utilize the different computing power of its individual computer system. We measure the performance of DWM in a heterogeneous cluster environment with several kernel-level benchmark programs and their programming complexity quantitatively. From the experiments, we found that DWM provides competitive performance with a notable reduction in programming effort.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• 제10권12호
• /
• pp.2132-2139
• /
• 2006

A parallel program including a nested parallelism has a complex execution aspects and tasks are executed concurrently. This concurrency is a main cause raising most of errors. In this paper, a new method for checking concurrency between two tasks is proposed. The existing techniques for checking the concurrency have their limits to represent a global structure. A new labeling technique that appropriate for image visualization is proposed. To show the global structure by imaging of execution aspects through region partition on 2D plane. On the basis of it, each of the tasks that can distinguish the ordered relation create an independent image. Image information generated by the result simplifies semantic analysis of the related task, and provides an outline of a global execution aspects structure of the program to user effectively.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• 제16권10호
• /
• pp.2303-2308
• /
• 2012

In this paper, we deal with the problem of scheduling parallel tasks with deadlines. Parallel tasks can be simultaneously executed on various machines and specially, we consider the malleable tasks, that is, the tasks whose execution time is given by a function of the number of machines on which they are executed. The goal of the problem is to maximize the throughput of tasks completed within their deadlines. This problem is well-known as NP-hard problem. Thus we will find an approximation algorithm, and its performance is compared with that of the optimal algorithm and analyzed by finding the approximation ratio. In particular, the algorithm has more resources, that is, more machines, than the optimal algorithm. This is called the resource augmentation analysis. We propose an algorithm to guarantee the approximation ratio of 3.67 using 1.5 times machines.

• Journal of the Korea Society of Computer and Information
• /
• 제19권12호
• /
• pp.1-10
• /
• 2014

This paper proposes a scheduling scheme that enhances power consumption efficiency of periodic real-time tasks using DVFS and power-shut-down mechanisms while meeting their deadlines on multicore processors. The proposed scheme is suitable for dependent multicore processors in which processing cores have an identical speed at an instant, and resolves the load unbalance of processing cores by exploiting parallel processing because the load unbalance causes inefficient power consumption in previous methods. Also the scheme activates a part of processing cores and turns off the power of unused cores. The number of activated processing cores is determined through mathematical analysis. Evaluation experiments show that the proposed scheme saves up to 77% power consumption of the previous method.