• School Mathematics
• /
• v.12 no.4
• /
• pp.563-584
• /
• 2010

This study is aimed at analysing the mathematical thinking processes based on image by the mathematically gifted. For this, the 'Splitting a Tetrahedron' Task was used and mathematical thinking of the two middle school students were investigated. One of them deduced how many tetrahedral and octahedral were there when a tetrahedra was splitted by the surfaces which were parallel to each face of the tetrahedra without using any physical material. The other one solved the task using physical material and invented new images. A concrete image, indexical image and symbolic image were founded and the various roles of images could be confirmed.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.237-243
• /
• 2004

A multichannel smart sound sensor capable to detect and identify sound events in noisy conditions is presented in this paper. Sound information extraction is a complex task and the main difficulty consists is the extraction of high­level information from an one-dimensional signal. The input of smart sound sensor is composed of data collected by 5 microphones and its output data is sent through a network. For a real time working purpose, the sound analysis is divided in three steps: sound event detection for each sound channel, fusion between simultaneously events and sound identification. The event detection module find impulsive signals in the noise and extracts them from the signal flow. Our smart sensor must be capable to identify impulsive signals but also speech presence too, in a noisy environment. The classification module is launched in a parallel task on the channel chosen by data fusion process. It looks to identify the event sound between seven predefined sound classes and uses a Gaussian Mixture Model (GMM) method. Mel Frequency Cepstral Coefficients are used in combination with new ones like zero crossing rate, centroid and roll-off point. This smart sound sensor is a part of a medical telemonitoring project with the aim of detecting serious accidents.

• Journal of the Korea Society for Simulation
• /
• v.24 no.3
• /
• pp.17-26
• /
• 2015

A cluster tool used in many kinds of semiconductor processes for improving the performance and the quality of wafers has a simple configuration, but its schedule is not easy because of its parallel processing module, a lack of intermediate buffers, and time constraints. While there have been many studies on its schedule, most of them have focused on full cycles in which identical work cycles are repeated under constant task times. In this research, we suggest strategies of start-up transient scheduling which satisfies time constraints and converges into a desirable steady schedule for full work cycle. The proposed schedules are expected robust under the stationary stochastic task times. Finally, we show that the strategies make schedules enters the desirable steady schedule and robust using the simulation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.1
• /
• pp.165-171
• /
• 2005

In this paper, the centralized dynamic load-balancing was processed effectively by using the network based parallel genetic algorithm. Unlike the existing method using genetic algorithm, the performance of central scheduler was improved by distributing the process for the searching of the optimal task assignment to clients. A roulette wheel selection and an elite preservation strategy were used as selection operation to improve the convergence speed of optimal solution. A chromosome was encoded by using sliding window method. And a cyclic crossover was used as crossover operation. By the result of simulation for the performance estimation of central scheduler according to the change of flexibility of load-balancing method, it was verified that the performance is improved in the proposed method.

• Journal of Biosystems Engineering
• /
• v.31 no.1 s.114
• /
• pp.52-58
• /
• 2006

Various robots were developed for harvesting fruits and vegetables. However, each robot was designed for a specific task such as harvesting apples or vegetables. This has been a big hurdle in application of robots to agriculture. A new type of hybrid manipulator with both parallel and serial joints was developed and designed to apply to various kinds of field operations. The hybrid manipulator had 2 extra degree of freedom in serial joints which made it flexible in switching one to the other type of hybrid manipulator, for example, PUMA to SCARA. And it was designed to harvest heavy fruits such as musky melons or water melons even behind leaves or branches of tree. This hybrid manipulator showed less than $\pm1mm$ position error. It was concluded that the hybrid manipulator was an effective and feasible tool to perform various works and to increase working performance.

• Nuclear Engineering and Technology
• /
• v.52 no.2
• /
• pp.258-270
• /
• 2020

A new task of using the Jacobian-Free-Newton-Krylov (JFNK) method for the PWR core transient simulations involving neutronics, thermal hydraulics and mechanics is conducted. For the transient scenario of PWR, normally the Picard iteration of the coupled coarse-mesh nodal equations and parallel channel TH equations is performed to get the transient solution. In order to solve the coupled equations faster and more stable, the Newton Krylov (NK) method based on the explicit matrix was studied. However, the NK method is hard to be extended to the cases with more physics phenomenon coupled, thus the JFNK based iteration scheme is developed for the nodal method and parallel-channel TH method. The local gap conductance is sensitive to the gap width and will influence the temperature distribution in the fuel rod significantly. To further consider the local gap conductance during the transient scenario, a 1D mechanics model is coupled into the JFNK scheme to account for the fuel thermal expansion effect. To improve the efficiency, the physics-based precondition and scaling technique are developed for the JFNK iteration. Numerical tests show good convergence behavior of the iterations and demonstrate the influence of the fuel thermal expansion effect during the rod ejection problems.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.211-216
• /
• 2009

As demands for high-definition television (HDTV) increase, the implementation of real-time decoding of high-definition (HD) video becomes an important issue. The data size for HD video is so large that real-time processing of the data is difficult to implement, especially with software. In order to implement a fast moving picture expert group-2 decoder for HDTV, we compose five scenarios that use parallel processing techniques such as data decomposition, task decomposition, and pipelining. Assuming the multi digital signal processor environments, we analyze each scenario in three aspects: decoding speed, L1 memory size, and bandwidth. By comparing the scenarios, we decide the most suitable cases for different situations. We simulate the scenarios in the dual-core and dual-central processing unit environment by using OpenMP and analyze the simulation results.

• The KIPS Transactions:PartA
• /
• v.8A no.2
• /
• pp.117-124
• /
• 2001

At NOW (Networks Of Workstations), the load sharing is very important role for improving the performance. The known load sharing strategy is fixed-granularity, variable-granularity and adaptive-granularity. The variable-granularity algorithm is sensitive to the various parameters. But Send algorithm, which implements the fixed-granularity strategy, is robust to task granularity. And the performance difference between Send and variable-granularity algorithm is not substantial. But, in Send algorithm, the computing time and the communication time are not overlapped. Therefore, long latency time at the network has influence on the execution time of the parallel program. In this paper, we propose the preSend algorithm. In the preSend algorithm, the master node can send the data to the slave nodes in advance without the waiting for partial results from the slaves. As the master node sent the next data to the slaves in advance, the slave nodes can process the data without the idle time. As stated above, the preSend algorithm can overlap the computing time and the communication time. Therefore we reduce the influence of the long latency time at the network and the execution time of the parallel program on the NOW. To compare the execution time of two algorithms, we use the $320{\times}320$ matrix multiplication. The comparison results of execution times show that the preSend algorithm has the shorter execution time than the Send algorithm.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.103-109
• /
• 2004

In NLP (Natural Language Processing) tasks, the highest difficulty which computers had to face with, is the built-in ambiguity of Natural Languages. To disambiguate it, formerly, they based on human-devised rules. Building such a complete rule-set is time-consuming and labor-intensive task whilst it doesn't cover all the cases. Besides, when the scale of system increases, it is very difficult to control that rule-set. So, recently, many NLP tasks have changed from rule-based approaches into corpus-based approaches with large annotated corpora. Corpus-based NLP tasks for such popular languages as English, French, etc. have been well studied with satisfactory achievements. In contrast, corpus-based NLP tasks for Vietnamese are at a deadlock due to absence of annotated training data. Furthermore, hand-annotation of even reasonably well-determined features such as part-of-speech (POS) tags has proved to be labor intensive and costly. In this paper, we present our building an annotated English-Vietnamese parallel aligned corpus named EVC to train for Vietnamese-related NLP tasks such as Word Segmentation, POS-tagger, Word Order transfer, Word Sense Disambiguation, English-to-Vietnamese Machine Translation, etc.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.9
• /
• pp.2320-2331
• /
• 1999

Over the Internet, in order to utilize a collection of idle computers as a parallel computing platform, we propose a new scheme called GICE(Global Internet Computing Environment). GICE is motivated to obtain high programmability, efficient support for heterogeneous computing resources, system scalability, and finally high performance. The programming model of GICE is based on a single address space. GICE is featured with a Java based programming environment, a dynamic resource management scheme, and efficient parallel task scheduling and execution mechanisms. Based on a prototype implementation of GICE, we address the concept, feasibility, complexity and performance of Internet computing.