• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.8
• /
• pp.3182-3202
• /
• 2015

Flexibly expanding the storage capacity required to process a large amount of rapidly increasing unstructured log data is difficult in a conventional computing environment. In addition, implementing a log processing system providing features that categorize and analyze unstructured log data is extremely difficult. To overcome such limitations, we propose and design a MongoDB-based unstructured log processing system (MdbULPS) for collecting, categorizing, and analyzing log data generated from banks. The proposed system includes a Hadoop-based analysis module for reliable parallel-distributed processing of massive log data. Furthermore, because the Hadoop distributed file system (HDFS) stores data by generating replicas of collected log data in block units, the proposed system offers automatic system recovery against system failures and data loss. Finally, by establishing a distributed database using the NoSQL-based MongoDB, the proposed system provides methods of effectively processing unstructured log data. To evaluate the proposed system, we conducted three different performance tests on a local test bed including twelve nodes: comparing our system with a MySQL-based approach, comparing it with an Hbase-based approach, and changing the chunk size option. From the experiments, we found that our system showed better performance in processing unstructured log data.

• Nuclear Medicine and Molecular Imaging
• /
• v.43 no.5
• /
• pp.443-450
• /
• 2009

Purpose: Conventional image reconstruction uses simplified physical models of projection. However, real physics, for example 3D reconstruction, takes too long time to process all the data in clinic and is unable in a common reconstruction machine because of the large memory for complex physical models. We suggest the realistic distributed memory model of fast-reconstruction using parallel processing on personal computers to enable large-scale technologies. Materials and Methods: The preliminary tests for the possibility on virtual manchines and various performance test on commercial super computer, Tachyon were performed. Expectation maximization algorithm with common 2D projection and realistic 3D line of response were tested. Since the process time was getting slower (max 6 times) after a certain iteration, optimization for compiler was performed to maximize the efficiency of parallelization. Results: Parallel processing of a program on multiple computers was available on Linux with MPICH and NFS. We verified that differences between parallel processed image and single processed image at the same iterations were under the significant digits of floating point number, about 6 bit. Double processors showed good efficiency (1.96 times) of parallel computing. Delay phenomenon was solved by vectorization method using SSE. Conclusion: Through the study, realistic parallel computing system in clinic was established to be able to reconstruct by plenty of memory using the realistic physical models which was impossible to simplify.

• Proceedings of the KIEE Conference
• /
• 2000.11d
• /
• pp.697-699
• /
• 2000

In this paper, an extension of model predictive controller for nonlinear process using Takagi-Sugeno(TS) fuzzy model is proposed Since the consequent parts of TS fuzzy model comprise linear equations of input and output variables. it is locally linear, and the Generalized Predictive Control(GPC) technique which has been developed to control Linear Time Invariant(LTI) plants, can be extended as a parallel distributed controller. Also fuzzy soft constraints are introduced to handle both equality and inequality constraints in a unified form. So the traditional constrained GPC can be transferred to a standard fuzzy optimization problem. The proposed method conciliates the advantages of the fuzzy modeling with the advantages of the constrained predictive control, and the degree of freedom is increased in specifying the desired process behavior.

• Journal of the Korean Institute of Gas
• /
• v.8 no.2 s.23
• /
• pp.28-34
• /
• 2004

Enhanced methodologies for process diagnosis and abnormal situation management have been developed for the last two decades. However, there is no single method that always shows better performance over all kinds of diagnostic problems. In this paper, a framework of message-passing, cooperative, intelligent diagnostic agents is presented for improved on-line fault diagnosis through cooperative problem solving of different expertise. A group of diagnostic agents in charge of different process functional perform local diagnoses in parallel; exchange related information with other diagnostic agents; and cooperatively solve the global diagnostic problem of the whole process plant or business units just like human experts would do. For their better understanding, sharing and exchanging of process knowledge and information, we also suggest a way of remodeling processes and protocols, taking into account semantic abstracts of process information and data. The benefits of the suggested multi-agents-based approach are demonstrated by the implementations for solving the diagnostic problems of various chemical processes.

• The KIPS Transactions:PartA
• /
• v.8A no.3
• /
• pp.235-244
• /
• 2001

Development of network and computer technology results in many studies to use physically distributed computers as a single resource. Generally, these studies have focused on developing environments based on message passing. These environments are mainly used to solve problems for scientific computation and process in parallel suing inside parallelism of the given problems. Therefore, these environments provide high parallelism generally, while it is difficult to program and use as well as it is required to have user accounts in the distributed computers. If a given problem is divided into completely independent subproblems, more efficient environment can be provided. We can find these problems in bio-informatics, 3D animatin, graphics, and etc., so the development of new environment for these problems can be considered to be very important. Therefore, we suggest new environment called InterCom based on a proxy computing, which can solve these problems efficiently, and explain the implementation of this environment. This environment consists of agent, server, and client. Merits of this environment are easy programing, no need of user accounts in the distributed computers, and easiness by compiling distributed code automatically.

• Korean Journal of Computational Design and Engineering
• /
• v.13 no.1
• /
• pp.36-44
• /
• 2008

This paper proposes a modeling and simulation process of a panel production line (PPL) in a shipyard. The panel production line is an assembly process to produce a main panel of a flat block and a curved block. In this paper, its activity analysis is carried out using expression of IDEF0, and its process is qualitatively and quantitatively analyzed and modeled by Petri Nets. A commercial discrete event simulation tool, $QUEST^{TM}$, is used for virtual PPL and simulation. The modeling results by Petri Net are mapped to elements of the simulation tool. Finally, an integrated simulation environment of PPL is implemented in order to efficiently utilize the virtual PPL model. With the help of IDEF0 and Petri Nets, we could systematically analyze and describe the PPL process that are characterized as being concurrent, asynchronous, distributed, parallel, nondeterministic, and/or stochastic. Also, the dynamic and concurrent activities of a PPL system were able to be simulated. A timing concept can be included into the Petri nets model to evaluate performance and dependability issues of the system.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.32 no.10
• /
• pp.12-19
• /
• 2004

An aerodynamic design optimization system for three-dimensional wing was developed as a part of the future MDO framework. The present design optimization system includes four modules such as geometry design, grid generation, flow solver and optimizer. All modules were based on commercial softwares and programmed to have automated execution capability in batch mode utilizing built-in script and journaling. The integration of all modules into the system was accomplished through programming using Visual Basic language. The distributed computational environment based on network communication was established to save computational time especially for time-consuming aerodynamic analyses. The distributed aerodynamic computations were performed in conjunction with the global optimization algorithm of response surface method, instead of using usual parallel computation based on domain decomposition. The application of the design system in the drag minimization problem demonstrated considerably enhanced efficiency of the design process while the final design showed reasonable results of reduced drag.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.10
• /
• pp.477-482
• /
• 2016

As being the advanced analytics indispensable on big data for agile decision-making and tactical planning in enterprises, distributed processing platforms, such as Hadoop and Spark which distribute and handle the large volume of data on multiple nodes, receive great attention in the field. In Spark platform stack, Spark SQL unveiled recently to make Spark able to support distributed processing framework based on SQL. However, Spark SQL cannot effectively handle advanced analytics that involves machine learning and graph processing in terms of iterative tasks and task allocations. Motivated by these issues, this paper proposes the design of SQL-based big data optimal processing engine and processing framework to support advanced analytics in Spark environments. Big data optimal processing engines copes with complex SQL queries that involves multiple parameters and join, aggregation and sorting operations in distributed/parallel manner and the proposing framework optimizes machine learning process in terms of relational operations.

• Journal of Internet Computing and Services
• /
• v.15 no.1
• /
• pp.55-61
• /
• 2014

Various human-friendly robot services have been developed and mobile cloud computing is a real time computing service that allows users to rent IT resources what they want over the internet and has become the new-generation computing paradigm of information society. The enterprises and nations are actively underway of the business process using mobile cloud computing and they are aware of need for implementing mobile cloud computing to their business practice, but it has some week points such as authentication services and distributed processing technologies of big data. Sometimes it is difficult to clarify the objective of cloud computing service. In this study, the vulnerability of authentication services on mobile cloud computing is analyzed and mobile cloud computing model is constructed for efficient and safe business process. We will also be able to study how to process and analyze unstructured data in parallel to this model, so that in the future, providing customized information for individuals may be possible using unstructured data.

• Journal of KIISE
• /
• v.42 no.8
• /
• pp.998-1009
• /
• 2015

In recent years, there has been a growing interest in RDFS Inference to build a rich knowledge base. However, it is difficult to improve the inference performance with large data by using a single machine. Therefore, researchers are investigating the development of a RDFS inference engine for a distributed computing environment. However, the existing inference engines cannot process data in real-time, are difficult to implement, and are vulnerable to repetitive tasks. In order to overcome these problems, we propose a method to construct an in-memory distributed inference engine that uses a parallel graph structure. In general, the ontology based on a triple structure possesses a graph structure. Thus, it is intuitive to design a graph structure-based inference engine. Moreover, the RDFS inference rule can be implemented by utilizing the operator of the graph structure, and we can thus design the inference engine according to the graph structure, and not the structure of the data table. In this study, we evaluate the proposed inference engine by using the LUBM1000 and LUBM3000 data to test the speed of the inference. The results of our experiment indicate that the proposed in-memory distributed inference engine achieved a performance of about 10 times faster than an in-storage inference engine.