• The KIPS Transactions:PartD
• /
• v.14D no.6
• /
• pp.597-604
• /
• 2007

Stream data is a continuous flow of information that mostly arrives as the form of an infinite rapid stream. Recently researchers show a great deal of interests in analyzing such data to obtain value added information. Here, we propose an efficient cube computation algorithm for multidimensional analysis of stream data. The fact that stream data arrives in an unsorted fashion and aggregation results can only be obtained after the last data item has been read. cube computation requires a tremendous amount of memory. In order to resolve such difficulties, we compute user selected aggregation fables only, and use a combination of an way and AVL trees as a temporary storage for aggregation tables. The proposed cube computation algorithm works even when main memory is not large enough to store all the aggregation tables during the computation. We showed that the proposed algorithm is practically fast enough by theoretical analysis and performance evaluation.

• KIPS Transactions on Software and Data Engineering
• /
• v.6 no.6
• /
• pp.293-302
• /
• 2017

This paper proposes a method that generates test cases from Simulink/Stateflow(SL/SF) using a SMT (Satisfiability Modulo Theory) solver, Yices and information of SL/SF model. The most difficult problem to generate test cases from SL/SF model is to solve reachability problem. In the propose method, Yices and the tables built with the model information are utilized to solve the reachability problem. The method utilizes the SMT model, that is the SL/SF model transformed in Yices. The tables built from SL/SF are used for backward processing of the proposed method and increases test generation efficiency. A commercial refrigerator model and two car ECU (Electrical Control Unit) models are used to evaluate the performance of the proposed algorithm..

• KIPS Transactions on Software and Data Engineering
• /
• v.7 no.10
• /
• pp.397-404
• /
• 2018

Various applications are widely developed for smartphones to meet customer's needs. In many companies, messenger's typed interactive systems have been studied for business marketing, advertising and promotion to provide useful services for the customers. Such interactive systems are usually called as "Chatbot". In Chatbot, duplicated responses from Chatbot could occur frequently, and these make one lose interest. In this paper, we define a case that the response of Chatbot is duplicated according to the user's input, and propose a method to reduce duplicated responses of Chatbot. In the proposed method, we try to reduce duplication responses through a new duplication avoidance algorithm by building multiple tables in a database and by making combinations of user's input and its response in each table. In our experiments, the proposed method shows that duplicated responses are reduced by an average of 70%, compared with the existing method.

• The Korean Journal of Applied Statistics
• /
• v.21 no.5
• /
• pp.739-754
• /
• 2008

Researches on conversion formulas between multiple decrement models and the associated single decrement models have focused on calculating yearly-based conversion formulas. In practice, actuaries may be more interested in monthly-based conversion formulas. Multiple decrement tables and their associated single decrement tables consist of yearly-based rates of multiple decrements and absolute rates of decrements, respectively. This paper derives conversion formulas from yearly-based absolute rates of decrements to monthly-based rates of decrement due to cause j under the uniform distribution of decrements(UDD). Next, it suggests conversion formulas from monthly-based absolute rates of decrements to monthly-based rates of decrement due to cause j under UDD. In addition, it calculates conversion formulas from yearly-based rates of decrement due to cause j to the corresponding absolute rates of decrements under UDD or constant force assumption. Some numerical examples are discussed.

• The Journal of Fisheries Business Administration
• /
• v.43 no.3
• /
• pp.75-87
• /
• 2012

Today, the Korean fisheries is undergoing significant hardships, both domestically and internationally. While declining amount of catch, ascending international oil prices and others pose a compelling challenge to the fishing sector, the ever strengthening influence of international institutions related to fisheries and international trade organizations also compel to bring about myriad of changes in the realm of fishery products. Against the backdrop, this study attempted to examine the fisheries catch, aquaculture, service, processing fields in terms of its rippling effect and of how the industry has been changed by analyzing the past and present through an input-output analysis. As for research methods, 168 items of the input-output tables in 2000, 2005, 2009, and 2010 were integrated to form and classify 32 sectors (28 basic sectors + catch, aquaculture, fishery service, processed fishery products) so as to generate production inducement coefficient, sensitivity coefficient, and impact coefficient. The analysis results revealed that : though the linkage effect of fishery industry was not very sizable, the impact coefficient of the processed fishery products was high; the consumption and investment coefficient sector among production inducement coefficient was on an upturn trend ; the export coefficient was tended to decline. In the future research, it is necessary to carry out a study based on the integration of detailed classification (404 sector) and a study and analysis of fishery industry by different regions through the inter-regional input-output tables. The fishery industry is one of the crucial industries in Korea. The fishery industry is not only important in its own right but also significant as it exerts influence over other industries. Therefore, it is required that there should be more investment and supports for the development of the fishery industry, and pay efforts to ensure that the investment and development could lead to mutual growth for both the fishery and other various industries.

• Journal of the Korean Dietetic Association
• /
• v.13 no.4
• /
• pp.389-406
• /
• 2007

This study was conducted to estimate the safety level of non-cooking and cooking processed foods to propose the sanitary management of foods donated to foodbanks. The time and temperature were measured and the microbial levels of aerobic plate counts (APC), coliforms, E. coli, Salmonella spp., S. aureus, B. cereus, and E. coli O157:H7 were analyzed on ten food items donated to seven foodbanks. The amount of cooked foods donated to each foodbank was about 10 to 40 servings. All foodbanks hired a supervisor and had at least one refrigerator/freezer and one temperature-controlled vehicle, but only four foodbanks had the separate offices to manage the foodbank operation. The flow of donated foods was gone through the steps; production, meal service and holding at donator, collection by foodbank, transport (or holding after transport) and distribution to recipients. After production, the levels of APC of both non-cooking and cooking processed foods were complied with the standards by Ministry of Education & Human Resources Development, and were not increased till distribution. Only the level of coliforms in dried squid & cucumber salad (1.5×$10^3$ CFU/g) was not met the standards. E. coli and other pathogens were not detected in all tested samples. The microbial levels of delivery vessels and work tables were satisfactory, but the APC levels of two of four tested serving tables (6.9×$10^3$ and 5.3×$10^3$ CFU/100$cm^2$) and the coliforms level of one (1.1×$10^3$ CFU/100$cm^2$) were over the standards. The air-borne microflora level in serving room was estimated as satisfactory. It took about 3.0 to 6.5 hours from after-production to distribution and the temperatures of donated foods were exposed mostly to temperature danger zone, which had a high potential of microbial growth. These results imply that a checklist to monitor time and temperature in each step should be provided and the employees involving foodbank operation should be properly educated to ensure the safety of donated foods.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.2
• /
• pp.197-204
• /
• 2014

This paper investigates a design of optimization database structure layout of Message Oriented Analysis and Management Tool (MOMAT) for naval combat systems (NCS). The NCS is composed of heterogeneous and large-scale component such as communication service and data distribution servcies (DDS). Each components are massively made the data as components. To manage the messages, MOMAT is developed. Typical modeling tool have problems that low performance due to duplicate database tables. An efficient design that one of the database optimization is proposed to solve the problems in this paper. It reduces the number of tables and improves application response and processing time. Experiment results shows that an availability of proposed method in MOMAT and decrease of both amount of data from client node to server and sever load.

• Journal of IKEEE
• /
• v.20 no.4
• /
• pp.344-350
• /
• 2016

In this Paper, we propose an optimized method of hardware design based on Field Programmable Gate Array (FPGA) to detect rotated angle of high definition image about Extreme Contour Point (ECP) algorithm with moving video image could be not happened to translation motion, but also physical rotation motion. It was evaluated by XC7Z020 xc7z020-3clg400 FPGA board by using xilinx 14.2 tool. The much well-known method, the Coordinate Rotation Digital Integrated Computation (CORDIC) is an algorithm to estimate rotated angle between point and point. Through the result both ECP and CORDIC, our proposed design are confirmed to have similar operating speed of about 4ns with CORDIC. However, it is verified to have high performance result in terms of the hardware cost, is much better than CORDIC with cost reduction of registers and Look Up Tables (LUTs) of 108% and 91%, respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.3B
• /
• pp.339-348
• /
• 2004

Packet classification is an important factor to support various services such as QoS guarantee and VPN for users in Internet. Packet classification is a searching process for best matching rule on rule tables by employing multi-field such as source address, protocol, and port number as well as destination address in If header. In this paper, we propose hardware based packet classification algorithm by employing tree bitmap of multi-bit trio. We divided prefixes of searching fields and rule into multi-bit stride, and perform a rule searching with multi-bit of fixed size. The proposed scheme can reduce the access times taking for rule search by employing indexing key in a fixed size of upper bits of rule prefixes. We also employ a marker prefixes in order to remove backtracking during searching a rule. In this paper, we generate two dimensional random rule set of source address and destination address using routing tables provided by IPMA Project, and compare its memory usages and performance.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8
• /
• pp.2273-2286
• /
• 2000

In order to acquire the precise and fast response for an analytical query, proper selection of the views to materialize in data warehouse is very crucial. In traditional view selection algorithms, the whole relations are considered to be selected as materialized views. However, materializing the whole relations rather than a part of relations results in much worse performance in terms of time and space cost. Therefore, we present an improved algorithm for selection of views to materialize using clustering method to overcome the problem resulted from conventional view selection algorithms. In the presented algorithm, ASVMRT(Algorithm for Selection of Views to daterialize using Iteduced Table). we first generate reduced tables in clata warehouse using automatic clustering based on attrihute-values density, then we consider the combination of reduced tables as materialized views instead of the combination of the original hase relations. For the justification of the proposecl algorithm. we show the experimental results in which both time and space cost are approximately 1.8 times better than the conventional algorithms.