• Korean Management Science Review
• /
• v.31 no.3
• /
• pp.113-130
• /
• 2014

Cooperative coevolutionary algorithm (CCEA) has proven to be a very powerful means of solving optimization problems through problem decomposition. CCEA implies the use of several populations, each population having the aim of finding a partial solution for a component of the considered problem. Populations evolve separately and they interact only when individuals are evaluated. Interactions are made to obtain complete solutions by combining partial solutions, or collaborators, from each of the populations. In this respect, we can think of various interaction modes. The goal of this research is to develop a CCEA for a supply chain network design (SCND) problem and identify which interaction mode gives the best performance for this problem. We present general design principle of CCEA for the SCND problem, which require several co-evolving populations. We classify these populations into two groups and classify the collaborator selection scheme into two types, the random-based one and the best fitness-based one. By combining both two groups of population and two types of collaborator selection schemes, we consider four possible interaction modes. We also consider two modes of updating populations, the sequential mode and the parallel mode. Therefore, by combining both four possible interaction modes and two modes of updating populations, we investigate seven possible solution algorithms. Experiments for each of these solution algorithms are conducted on a few test problems. The results show that the mode of the best fitness-based collaborator applied to both groups of populations combined with the sequential update mode outperforms the other modes for all the test problems.

• Journal of Fisheries and Marine Sciences Education
• /
• v.28 no.4
• /
• pp.925-935
• /
• 2016

It is provided that seafarers qualified in accordance with STCW(International Convention on Standards of Training Certification and Watch-keeping for Seafarers) convention and code in safety training shall be required, every five years, to provide evidence of having maintained the required standard of competence, to undertake the tasks, duties and responsibilities listed in Chapter VI, section A-VI/1 of the STCW Code A. Every party to the STCW Convention has amended the relevant national regulations according to the above international convention and code. These amended Seaman's Act require the updating safety training which is only five years valid for existing seafarers serving onboard ship on international voyage. And above specified existing seafarers must, as of the 1st January 2017, have documentary evidence of either having completed the training course or updated their training within the last 5 years. In relation to the above international trend, the Korean Ministry of Oceans and Fisheries also has completed an amendment to its Seaman's Act. But, the Korean Seaman's Act has a supplementary provision to exempt the seafarers who have completed STCW advanced safety training from basic safety training. The purpose of this study is to define the problems of above mentioned exemption provisions and to make better policies for improvement. In order to complete the purpose, the research team has conducted an in-depth survey of various foreign cases on STCW safety training. Moreover, the team has suggested an improvement scheme in consonance with Korean shipping industry and society through out this report.

• Journal of the Korea Convergence Society
• /
• v.5 no.3
• /
• pp.1-5
• /
• 2014

The development of communication method for a variety of intelligent automobiles are delivering comfortable and safe information. However the development of such communication method must also think about security. Even the update of navigation to be used for intelligent automobiles uses the wireless updating methods but the updating methods currently being used has no reliable security measures. The navigation communications used in the intelligent automobiles are being provided with TTI(Traffic and Travel Information) service using a variety of methods by the countries. In the case of Korea, most are based on T-DMB using the TPEG method for transmitting the information. By identifying the characteristics on the navigation wireless update, a security solution is proposed for delivering the reliable update information after creating the attack scenario.

• Journal of KIISE:Databases
• /
• v.30 no.4
• /
• pp.397-407
• /
• 2003

Transactions of updating spatial dta with mobile clients are log transactions because a user disconnected from a server surveys real features and updates them. In this environment, it is appropriate to exploit the optimistic approach based on the validation test in order to control the concurrency of transactions. On the contrary, the pessimistic concurrency control scheme makes transactions wait for a long time due to the lock. In this paper, we propose the surrogate transaction model and implement its manager for the S-S-M(Server-Surrogate PC-Mobile Client) structure which is appropriate for updating spatial data in mobile environments. In the S-S-M structure, the mobile client communicates with the server by the surrogate PC. We extend the validation condition in consideration of spatial relationships between spatial objects in this model. We also present the commit protocol where the user of a surrogate PC adjusts objects of the conflicted surrogate transaction to minimize costs for the abortion of the transaction.

• The Journal of the Acoustical Society of Korea
• /
• v.28 no.7
• /
• pp.680-685
• /
• 2009

In this paper, we propose a efficient noise power estimation technique for an integrated acoustic echo and noise suppression system in a frequency domain. The proposed method uses speech absence probability (SAP) derived from the microphone input signal as the smoothing parameter updating noise power to reduce the noise power estimation error resulted from the distortions in the unified structure where the noise suppression (NS) operation is placed after the acoustic echo suppression (AES) algorithm. Therefore, in the proposed approach, the smoothing parameter based on SAP derived from the input signal instead of echo-suppressed signal should stop updating noise power estimates during the distorted noise spectrum periods. The performance of the proposed algorithm is evaluated by the objective test under various environments and yields better results compared with the conventional scheme.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.6
• /
• pp.1-7
• /
• 2012

Due to the increasing demand of network convergence, in future, hybrid/integrated satellite and terrestrial systems will play an important role. In that case, compatibilities between the satellite and terrestrial systems are very important for efficiency of the systems. 3GPP Long Term Evolution (LTE) is one of the 4G system. Therefore, in this paper, we introduce the design of interleaver for mobile satellite system based 3GPP LTE specification. The 4G system including the LTE specification adopted adaptive modulation and coding (AMC) schemes for efficient usage of resources, and the updating interval of resource allocation is an order of msec. However, because of the long round trip delay of satellite systems, we cannot employ the same AMC scheme specified for the terrestrial system, and thus it cannot effectively counteract to short term fadings. Therefore, in order to overcome these problems, we propose an interleaver scheme combined with AMC. We present the interleaver design results considering mobile satellite system based on the LTE and analyze the simulation results.

• Journal of KIISE:Databases
• /
• v.33 no.5
• /
• pp.551-562
• /
• 2006

XML query caching for XML database-backed Web applications began to be investigated recently. Despite its practical significance, efficiency of the storage schemes for cached query results has not been addressed. In this paper, we deal with the storage schemes for XML query cache. A fundamental problem that needs to be considered in designing an efficient storage structure for XML query cache is that there exist performance tradeoffs between the two major types of operations on a cached query result. The two are (1) retrieving the whole of it to return the query result and (2) updating just a small portion of it for its incremental refresh against the updates done to its source. We propose eight different storage schemes for XML query cache, which are categorized into three groups: (1) the schemes based on the plain text file, (2) the schemes based on the persistent DOM (PDOM) file, and (3) a scheme employing an RDBMS. We implemented all of them, and compared their performance with each other. We also compared our proposal with a storage scheme based on a current state-of-the-art XML storage scheme, showing that ours is more efficient.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.3
• /
• pp.1510-1532
• /
• 2017

In smart grid, privacy implications to individuals and their families are an important issue because of the fine-grained usage data collection. Wireless communications are utilized by many utility companies to obtain information. Network coding is exploited in smart grids, to enhance network performance in terms of throughput, delay, robustness, and energy consumption. However, random linear network coding introduces a new challenge for privacy preserving due to the encoding of data and updating of coefficients in forwarder nodes. We propose a distributed privacy preserving scheme for random linear network coding in smart grid that considers the converged flows character of the smart grid and exploits a homomorphic encryption function to decrease the complexities in the forwarder node. It offers a data confidentiality privacy preserving feature, which can efficiently thwart traffic analysis. The data of the packet is encrypted and the tag of the packet is encrypted by a homomorphic encryption function. The forwarder node random linearly codes the encrypted data and directly processes the cryptotext tags based on the homomorphism feature. Extensive security analysis and performance evaluations demonstrate the validity and efficiency of the proposed scheme.

• Journal of KIISE:Databases
• /
• v.29 no.6
• /
• pp.502-512
• /
• 2002

Most of previous replication schemes assume lazy schemes, which asynchronously propagate replica updates to other nodes after the updating transaction commits. While lazy schemes are novel in the sense that they can resolve high deadlock frequencies of eager schemes, they suffer from the fact that users should be responsible for the data consistency. Recently replication schemes based on the messaging order of group communication have been studied. They can reduce the deadlock frequencies using the messaging order, but they have another problem of increasing execution overhead of aborted transactions at high degree of concurrency. This is because the sender node validates global serializability after multicasting replica update messages to other nodes. In this paper, we propose an efficient eager replication scheme for reducing the number of messaging and overhead of aborted transactions significantly. The proposed scheme validates any conflicts before multicasting and does not multicast when there is any conflict; hence, it can exploit performance improvement by alleviating the message traffic for replica update or by reducing the number of disk accesses and locking delay due to aborted transactions.

• Journal of KIISE:Databases
• /
• v.29 no.6
• /
• pp.500-500
• /
• 2002

Most of previous replication schemes assume lazy schemes, which asynchronously propagate replica updates to other nodes after the updating transaction commits. While lazy schemes are novel in the sense that they can resolve high deadlock frequencies of eager schemes, they suffer from the fact that users should be responsible for the data consistency. Recently replication schemes based on the messaging order of group communication have been studied. They can reduce the deadlock frequencies using the messaging order, but they have another problem of increasing execution overhead of aborted transactions at high degree of concurrency. This is because the sender node validates global serializability after multicasting replica update messages to other nodes. In this paper, we propose an efficient eager replication scheme for reducing the number of messaging and overhead of aborted transactions significantly. The proposed scheme validates any conflicts before multicasting and does not multicast when there is any conflict; hence, it can exploit performance improvement by alleviating the message traffic for replica update or by reducing the number of disk accesses and locking delay due to aborted transactions.