• Journal of KIISE
• /
• v.44 no.2
• /
• pp.115-123
• /
• 2017

A message processor is server software that receives non-realtime messages as well as realtime messages from clients that need to be processed within a deadline. With the recent advances of micro-processor technologies and Linux, the message processor is often implemented in Linux-based multi-core servers and it is important to use cores efficiently to maximize the performance of system in multi-core environments. Numerous research efforts on a real-time scheduler for the efficient utilization of the multi-core environments have been conducted. Typically, though, they have been conducted theoretically or via simulation, making a subsequent real-system application difficult. Moreover, many Linux-based real-time schedulers can only be used in a specific Linux version, or the Linux source code needs to be modified. This paper presents the design of a Linux-based message processor for multi-core environments that maps the threads to the cores at user level. The message processor is implemented through a modification of the traditional RM algorithm that consolidates the real-time messages into certain cores using a first-fit-based bin-packing algorithm; this minimizes the response-time delay of the non-real-time messages, while guaranteeing the violation rate of the real-time messages. To compare the performances, the message processor was implemented using the two multi-core-scheduling algorithms GSN-EDF and P-FP, which are provided by the LITMUS framework. The benchmarking results show that the response-time delay of non-real-time messages in the proposed system was improved up to a maximum of 17% to 18%.

• Journal of the Korea Convergence Society
• /
• v.11 no.4
• /
• pp.125-131
• /
• 2020

As technology advances, the importance of software education is increasing. Accordingly, interest in information subjects is increasing, but intending elementary learners to show algorithms only for specialized IT skills that could spoil the interest. In this paper for the elementary school students, through the four stages, 2015 revision curriculum analysis, creating of training program development operating plans, applying programs for the targeting students and analysis of results and evaluation, using Rich Picture technique which is various tools such as pictures and speech bubble symbols for the learners can express the intelligent CCTV algorithm freely and easily so they can understand fully about the algorithm of intelligent CCTV that uses artificial intelligence to extract faces from subjects. Suggest on this paper, the proposal of educational program can help the learner to grasp the principle of the algorithm by using the flowchart. As the result, Through the modification and development of the proposed program, we will conduct research on IT creative education that can be applied in various areas.

• Journal of KIISE:Software and Applications
• /
• v.31 no.3
• /
• pp.293-307
• /
• 2004

We consider the problem of scheduling tasks of a precedence constrained task graph, where each task has its execution time and deadline, onto a set of identical processors in a way that simultaneously minimizes the number of processors required and the total tardiness of tasks. Most existing approaches tend to focus on the minimization of the total tardiness of tasks. In another methods, solutions to this problem are usually computed by combining the two objectives into a simple criterion to be optimized. In this paper, the minimization is carried out using a multiobjective genetic algorithm (GA) that independently considers both criteria by using a vector-valued cost function. We present various GA components that are well suited to the problem of task scheduling, such as a non-trivial encoding strategy. a domination-based selection operator, and a heuristic crossover operator We also provide three local improvement heuristics that facilitate the fast convergence of GA's. The experimental results showed that when compared to five methods used previously, such as list-scheduling algorithms and a specific genetic algorithm, the Performance of our algorithm was comparable or better for 178 out of 180 randomly generated task graphs.

• Journal of the Korean Geographical Society
• /
• v.43 no.2
• /
• pp.235-252
• /
• 2008

Many cartographers have for many years searched for a way to construct cartograms in which the sizes of geographic areas such as states, counties or census tracts are reseated in proportion to their population or some other socio-economic properties. While many techniques and algorithms for creating cartograms have been proposed, some of them are still extremely complex to generate in a proper manner, and many of them suffer either from this lack of readability or from seamless integration with GIS software. This paper, therefore, presents a simple population cartogam technique based on the Circular Cartogram Algorithm(CCA) by Dorling(1996) to tackle these drawbacks by drawing the areas as simple circles for use as a base map and linking the construction with GIS mapping processes. For an automated approach in the cartogram generation, this paper proposes a close coupling method of ArcView GIS 3.3. package in order for users to access to the cartopam algorithm. Then, they will be available through an interface that the ArcView GIS system allows user-written routines to be accessed easily. The CCA and its coupling architecture ensure to improve the potential applicability of the use of cartograms to census mapping at practical levels. As the cartogram examples, cartograms of population and property types in 2005 Korea census data sets are illustrated in the end, by which viewers can easily identify the residential concentration and their relative ratio in Seoul metropolitan area.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.46 no.6
• /
• pp.503-512
• /
• 2018

SAR(Synthetic Aperture Radar) is a technology to acquire images by processing signals obtained from radar, and there is an increasing demand for utilization of high-resolution SAR images. In this paper, for high-speed processing of high-resolution SAR image data, a study for SAR image processing algorithms to achieve optimal performance in multi-core based computer architecture is performed. The performance deterioration due to a large amount of input/output data for high resolution images is reduced by maximizing the memory utilization, and the parallelization ratio of the code is increased by using dynamic scheduling and nested parallelism of OpenMP. As a result, not only the total computation time is reduced, but also the upper bound of parallel performance is increased and the actual parallel performance on a multi-core system with 10 cores is improved by more than 8 times. The result of this study is expected to be used effectively in the development of high-resolution SAR image processing software for multi-core systems with large memory.

• Proceedings of the Korean Society of Near Infrared Spectroscopy Conference
• /
• 2001.06a
• /
• pp.1523-1523
• /
• 2001

The wine industry requires practical methods for objectively measuring the composition of both red wine grapes on the vine to determine optimal harvest time; and of freshly harvested grapes for efficient allocation to vinery process streams for particular red wine products, and to determine payment of contract grapegrowers. To be practical for industry application these methods must be rapid, inexpensive and accurate. In most cases this restricts the analyses available to measurement of TSS (total soluble solids, predominantly sugars) by refractometry and pH by electropotentiometry. These two parameters, however, do not provide a comprehensive compositional characterization for the purpose of winemaking. The concentration of anthocyanin pigment in red wine grapes is an accepted indicator of potential wine quality and price. However, routine analysis for total anthocyanins is not considered as a practical option by the wider wine industry because of the high cost and slow turnaround time of this multi-step wet chemical laboratory analysis. Recent work by this ${group}^{l,2}$ has established the capability of near infrared (NIR) spectroscopy to provide rapid, accurate and simultaneous measurement of total anthocyanins, TSS and pH in red wine grapes. The analyses may be carried out equally well using either research grade scanning spectrometers or much simpler reduced spectral range portable diode-array based instrumentation. We have recently expanded on this work by collecting thousands of red wine grape samples in Australia. The sample set spans two vintages (1999 and 2000), five distinct geographical winegrowing regions and three main red wine grape varieties used in Australia (Cabernet Sauvignon, Shiraz and Merlot). Homogenized grape samples were scanned in diffuse reflectance mode on a FOSE NIR Systems6500 spectrometer and subject to laboratory analysis by the traditional methods for total anthocyanins, TSS and pH. We report here an analysis of the correlations between the NIR spectra and the laboratory data using standard chemometric algorithms within The Unscrambler software package. In particular, various subsets of the total data set are considered in turn to elucidate the effects of vintage, geographical area and grape variety on the measurement of grape composition by NIR spectroscopy. The relative ability of discrete calibrations to predict within and across these differences is considered. The results are then used to propose an optimal calibration strategy for red wine grape analysis.

• Journal of KIISE:Software and Applications
• /
• v.37 no.10
• /
• pp.788-801
• /
• 2010

Advancing of mobile device is remarkable, so the research on mobile input device is getting more important issue. There are lots of input devices such as keypad, QWERTY keypad, touch and speech recognizer, but they are not as convenient as typical keyboard-based desktop input devices so input strings usually contain many typing errors. These input errors are not trouble with communication among person, but it has very critical problem with searching in database, such as dictionary and address book, we can not obtain correct results. Especially, Hangeul has more than 10,000 different characters because one Hangeul character is made by combination of consonants and vowels, frequency of error is higher than English. Generally, suffix tree is the most widely used data structure to deal with errors of query, but it is not enough for variety errors. In this paper, we propose fast approximate Korean word searching system, which allows variety typing errors. This system includes several algorithms for applying general approximate string searching to Hangeul. And we present profanity filters by using proposed system. This system filters over than 90% of coined profanities.

• The KIPS Transactions:PartB
• /
• v.18B no.2
• /
• pp.57-66
• /
• 2011

To prevent cardiac diseases, quantifying cardiac function is important in routine clinical practice by analyzing blood volume and ejection fraction. These works have been manually performed and hence it requires computational costs and varies depending on the operator. In this paper, an automatic left ventricle segmentation algorithm is presented to segment left ventricle on cardiac magnetic resonance images. After coil sensitivity of MRI images is compensated, a K-mean clustering scheme is applied to segment blood area. A graph searching scheme is employed to correct the segmentation error from coil distortions and noises. Using cardiac MRI images from 38 subjects, the presented algorithm is performed to calculate blood volume and ejection fraction and compared with those of manual contouring by experts and GE MASS software. Based on the results, the presented algorithm achieves the average accuracy of 6.2mL${\pm}$5.6, 2.9mL${\pm}$3.0 and 2.1%${\pm}$1.5 in diastolic phase, systolic phase and ejection fraction, respectively. Moreover, the presented algorithm minimizes user intervention rates which was critical to automatize algorithms in previous researches.

• KIPS Transactions on Software and Data Engineering
• /
• v.4 no.5
• /
• pp.219-224
• /
• 2015

In this paper, the designed fish robots DOMI ver1.0 is researched and development for aquarium underwater robot. The presented fish robot consists of the head, 1'st stage body, 2nd stage body and tail, which is connected two point driving joints. The model of the robot fish is analysis to maximize the momentum of the robot fish and the body of the robot is designed through the analysis of the biological fish swimming. Also, Lighthill was applied to the kinematics analysis of robot fish swimming algorithms, we are applied to the approximate method of the streamer model that utilizes techniques mimic the biological fish. The swimming robot has two operating mode such as manual and autonomous operation modes. In manual mode the fish robot is operated to using the RF transceiver, and in autonomous mode the robot is controlled by microprocessor board that is consist PSD sensor for the object recognition and avoidance. In order to the submerged and emerged, the robot has the bladder device in a head portion. The robot gravity center weight is transferred to a one-axis sliding and it is possible to the submerged and emerged of DOMI robot by the breath unit. It was verified by the performance test of this design robot DOMI ver1.0. It was confirmed that excellent performance, such as driving force, durability and water resistance through the underwater field test.

• Journal of KIISE:Software and Applications
• /
• v.26 no.12
• /
• pp.1445-1454
• /
• 1999

광역 조건식의 계산은 분산 프로그램의 수행을 테스트 또는 디버깅하기 위한 방법으로 활 발히 연구되고 있다. 이제까지 주로 연구된 광역조건식은 AND 또는 OR 광역 조건식 등이 있는데, 특히 AND 광역 조건식은 분산 프로그램의 동시적 조건을 표현하는데 유용하여 효율적인 검색 알고리즘이 활발히 연구되었다. 분산프로그램의 수행오류로서 공유자원의 배타적 접근조건은 가장 중요하고 일반적인 경우라 할 수 있다. 본 논문에서는 XOR 연산을 이용하여 공유자원 프로그램의 오류 검색을 위한 광역조건식을 기술하는 방식에 대해 제안하였다. XOR 연산을 이용한 광역 조건식은 연산자 중 많아야 하나의 지역조건식만이 참일 때 전체 조건식이 참이 되는데 이러한 성질은 여러 프로세스 중 한번에 하나만이 공유자원에 배타적으로 접근할 수 있는 조건을 표현하는데 매우 유용하다. n 개의 프로세스로 이루어진 분산프로그램에서 한개의 공유자원에 대한 배타적 접근 조건을 기술하기 위해서 AND로 연결된 광역조건식을 이용하면 O(n2)개의 광역 조건식이 필요한데 반해 XOR 연산으로는 하나의 조건식으로 나타낼 수 있다. 더구나 XOR 연산을 이용한 광역조건식은 최근 소개된 겹치는 구간의 개념을 활용하면 매우 간단하게 검색할 수 있다. 본 논문에서는 겹치는 구간을 찾는 검색 알고리즘을 소개하고 증명하였다.Abstract Detecting global predicates is an useful tool for debugging and testing a distributed program. Past research has considered several restricted forms of predicates, including conjunctive or disjunctive form of predicates. Especially, conjunctive predicates have attracted main attention not only because they are useful to describe simultaneous conditions in a distributed program, but also because it is possible to find algorithms to evaluate them within reasonable time bound. Detecting errors in accessing shared resources are the most popular and important constraints of distributed programs. In this paper, we introduced an exclusive OR predicates as a model of global predicates to describe shared resource conditions in distributed programs. An exclusive OR predicate holds only when at most one operand is true, which is useful to describe mutual exclusion conditions of distributed programs where only one process should be allowed to access the shared resource at a time. One exclusive OR predicate is enough to describe mutual exclusion condition of n processes with one shared resource, while it takes O(n2) conjunctive predicates. Moreover, exclusive OR condition is easily detectable using the concept of overlapping intervals introduced by Venkatesan and Dathan. An off-line algorithm for evaluating exclusive OR global predicates is presented with a correctness proof.