• Journal of the Korea Society of Computer and Information
• /
• v.15 no.11
• /
• pp.143-156
• /
• 2010

Faced with an increase of malicious threats from the Internet as well as local area networks, many companies are considering deploying a security system. To help a decision maker select a suitable security tool, this paper proposed a three-step integrated framework using linear fuzzy regression (LFR) and physical programming (PP). First, based on the experts' estimations on security criteria, analytic hierarchy process (AHP) and quality function deployment (QFD) are employed to specify an intermediate score for each criterion and the relationship among these criteria. Next, evaluation value of each criterion is computed by using LFR. Finally, a goal programming (GP) method is customized to obtain the most appropriate security tool for an organization, considering a tradeoff among the multi-objectives associated with quality, credibility and costs, utilizing the relative weights calculated by the physical programming weights (PPW) algorithm. A numerical example provided illustrates the advantages and contributions of this approach. Proposed approach is anticipated to help a decision maker select a suitable security tool by taking advantage of experts' experience, with noises eliminated, as well as the accuracy of mathematical optimization methods.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.5
• /
• pp.137-146
• /
• 2012

In SCM(Supply Chain Management), a management paradigm where the customer satisfaction is to be achieved by minimizing the cost, reducing the uncertainty, and obtaining the overall optimization. As it performs the integrated operation of the paths of information, assets, and knowledge from the raw material providers to the retailers, the adoption of RFID(Radio Frequency Identification) in SCM could be expected to magnify the effectiveness of the system. However, there is a huge risk by deciding whether or not RFID system is adopted without the objective analysis under the uncertain circumstances. This research paper presents the statistical analysis methodologies for the comparison of RFID with Barcode on the aspect of utility and the statistical analysis tool, RUSAT, which was programmed for nonstatisticians' convenience. Assuming a pharmaceutical industry, this paper illustrates how the data were entered and analyzed in RUSAT. The results of this research are expected to be used not only for the pharmaceutical related company but also for the manufacturer, the whole-saler, and the retailer in the other logistic industries.

• Journal of Internet Computing and Services
• /
• v.14 no.4
• /
• pp.63-72
• /
• 2013

Business Process Intelligence (BPI) is one of the emerging technologies in the knowledge discovery and analysis area. BPI deals with a series of techniques from discovering knowledge to analyzing the discovered knowledge in BPM-supported organizations. By means of the BPI technology, we are able to provide the full functionality of control, monitoring, prediction, and optimization of process-supported organizational knowledge. Particularly, we focus on the focal organizational knowledge, which is so-called the BPM activity-performer affiliation networking knowledge that represents the affiliated relationships between performers and activities in enacting a specific business process model. That is, in this paper we devise a statistical analysis method to be applied to the BPM activity-performer affiliation networking knowledge, and dubbed it the activity-performer correspondence analysis method. The devised method consists of a series of pipelined phases from the generation of a bipartite matrix to the visualization of the analysis result, and through the method we are eventually able to analyze the degree of correspondences between a group of performers and a group of activities involved in a business process model or a package of business process models. Conclusively, we strongly expect the effectiveness and efficiency of the human resources allotments, and the improvement of the correlational degree between business activities and performers, in planning and designing business process models and packages for the BPM-supported organization, through the activity-performer correspondence analysis method.

• The Journal of Korean Association of Computer Education
• /
• v.14 no.2
• /
• pp.83-94
• /
• 2011

In the biomedical domain, the longest matching method is frequently used for recognizing named entity written in the literature. This method uses a dictionary as a resource for named entity recognition. If there exist appropriated dictionary about target domain, the longest matching method has the advantage of being able to recognize the entities of target domain quickly and exactly. However, the longest matching method is difficult to recognize the enumerated named entities, because these entities are frequently expressed as being omitted some words. In order to resolve this problem, we propose the partial matching method using a dictionary. The proposed method makes several candidate entities on the assumption that the ellipses may be included. After that, the method selects the most valid one among candidate entities through the optimization algorithm. We tested the longest and partial matching method about HLA entities: HLA gene, antigen, and allele entities, which are frequently enumerated among biomedical entities. As preparing for named entity recognition, we built two new resource, extended dictionary and tag-based dictionary about HLA entities. And later, we performed the longest and partial matching method using each dictionary. According to our experiment result, the longest matching method was effective in recognizing HLA antigen entities, in which the ellipses are rare, and the partial matching method was effective in recognizing HLA gene and allele entities, in which the ellipses are frequent. Especially, the partial matching method had a high F-score 95.59% about HLA alleles.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.23 no.5
• /
• pp.385-391
• /
• 2013

Big Data is data of big size which is not processed, collected, stored, searched, analyzed by the existing database management system. The parallel genetic algorithm using the Hadoop for BigData technology is easily realized by implementing GA(Genetic Algorithm) using MapReduce in the Hadoop Distribution System. The previous study that the genetic algorithm using MapReduce is proposed suitable transforming for the GA by MapReduce. However, they did not show good performance because of frequently occurring data input and output. In this paper, we proposed the MRPGA(MapReduce Parallel Genetic Algorithm) using improvement Map and Reduce process and the parallel processing characteristic of MapReduce. The optimal solution can be found by using the topology, migration of parallel genetic algorithm and local search algorithm. The convergence speed of the proposal method is 1.5 times faster than that of the existing MapReduce SGA, and is the optimal solution can be found quickly by the number of sub-generation iteration. In addition, the MRPGA is able to improve the processing and analysis performance of Big Data technology.

• Journal of Advanced Marine Engineering and Technology
• /
• v.40 no.7
• /
• pp.663-670
• /
• 2016

This paper introduces the concept of the computer-aided engineering(CAE) design method for a bypass valve in a system that is used for the safe lifting of mineral resources in deep-seabed mining. Although the bypass valve has a simple mechanism, its design is very difficult because of various influencing factors. This equipment, which has a complex design process, should be developed by CAE-based design method. The method can perform the design, design verification, and virtual experiment at the same time. In this study, the CAE-based method for the design of the bypass valve has been developed using fluid dynamics, multi-body dynamics, and optimization method.

• Journal of Energy Engineering
• /
• v.2 no.1
• /
• pp.123-132
• /
• 1993

This work is focussed on the reduction of ethanol separation energy from alcohol fermented broth and categorized into the development of a computer program for the design of the pressurized/depressurized distillation process which has been regarded as one of the energy-reducing models for the conventional distillation process, the optimization of operating conditions of distillation towers by means of the developed program, and the evaluation of the total annual energy cost of pressurized/depressurized distillation columns compared with that of the conventional single distillation columns. The operating pressures are, in case of pressurized/depressurized distillation, 3103/760 mmHg, 3103/450 mmHg, 3103/160 mmHg, and in case of conventional distillation, 760 mmHg. The optimum reflex rations which the sum of the annual energy cost and the annual fixed cost for each process becomes minimum are 3.7475/2.9111 for the operating pressures of 3103/760 mmHg, 3.814/2.9712 for 3103/450 mmHg, 3.0783/2.2400 for 3103/150 mmHg, and 3.8544 for the atmospheric operating pressure. And the annual energy cost of pressurized/depressurized distillation process for the above-mentioned operating pressures is distributed between 42% and 47% of that of conventional distillation process.

• Journal of the Institute of Convergence Signal Processing
• /
• v.19 no.1
• /
• pp.7-13
• /
• 2018

In the current study, we proposed an optimized brain-computer interface (BCI) which employed blind source separation (BBS) approach to remove noises. Thus motor imagery (MI) signal and steady state visual evoked potential (SSVEP) signal were easily to be detected due to enhancement in signal-to-noise ratio (SNR). Moreover, a combination between MI and SSVEP which is typically can increase the number of commands being generated in the current BCI. To reduce the computational time as well as to bring the BCI closer to real-world applications, the current system utilizes a single-channel EEG signal. In addition, a convolutional neural network (CNN) was used as the multi-class classification model. We evaluated the performance in term of accuracy between a non-BBS+BCI and BBS+BCI. Results show that the accuracy of the BBS+BCI is achieved $16.15{\pm}5.12%$ higher than that in the non-BBS+BCI by using BBS than non-used on. Overall, the proposed BCI system demonstrate a feasibility to be applied for multi-dimensional control applications with a comparable accuracy.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.8
• /
• pp.13-21
• /
• 2010

One of the most distinguished features of the DHP association rules mining algorithm is that it counts the support of hash key combinations composed of k items at phase k-1, and uses the counted support for pruning candidate large itemsets to improve performance. At this time, it is desirable for each hash key combination to have a separate count variable, where it is impossible to allocate the variables owing to memory shortage. So, the algorithm uses a direct hashing mechanism in which several hash key combinations conflict and are counted in a same hash bucket. But the direct hashing mechanism is not efficient because the distribution of hash key combinations is unvalanced by the characteristics sourced from the mining process. This paper proposes a mapped perfect hashing function which maps the region of hash key combinations into a continuous integer space for phase 3 and maximizes the efficiency of direct hashing mechanism. The results of a performance test experimented on 42 test data sets shows that the average performance improvement of the proposed hashing mechanism is 7.3% compared to the existing method, and the highest performance improvement is 16.9%. Also, it shows that the proposed method is more efficient in case the length of transactions or large itemsets are long or the number of total items is large.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.3
• /
• pp.45-51
• /
• 2011

This paper proposes a method to accelerate the evolution speed of individuals through hybrid reproduction of monogenesis and gamogenesis. Monogenesis as a reproduction method that bacteria or monad without sexual distinction divide into two individuals has an advantage for local search and gamogenesis as a reproduction method that individuals with sexual distinction mate and breed the offsprings has an advantages for keeping the diversity of individuals. These properties can be properly used for improvement of evolution speed of individuals in genetic algorithms. In this paper, we made relatively good individuals among selected parents to do monogenesis for local search and forced relatively bad individuals among selected parents to do gamogenesis for global search by increasing the diversity of chromosomes. The mutation probability for monogenesis was set to a lower value than that of original genetic algorithm for local search and the mutation probability for gamogenesis was set to a higher value than that of original genetic algorithm for global search. Experimental results with four function optimization problems showed that the performances of three functions were very good, but the performances of fourth function with distributed global optima were not good. This was because distributed global optima prevented individuals from steady evolution.