• Journal of Intelligence and Information Systems
• /
• v.15 no.1
• /
• pp.1-14
• /
• 2009

The Capacitated Vehicle Routing Problem (CVRP) is the problem that the vehicles stationed at central depot are to be optimally routed to supply customers with demands, satisfying vehicle capacity constraints. The CVRP is the NP-hard as it is a natural generalization of the Traveling Salesman Problem (TSP). In this article, we propose the heuristic algorithm, called the bisection seed detection method, to solve the CVRP. The algorithm is composed of 3-phases. In the first phase, we work out the initial cluster using the improved sweep algorithm. In the next phase, we choose a seed node in each initial cluster by using the bisection seed detection method, and we compose the rout with the nearest node from each seed. At this phase, we compute the regret value to decide the list of priorities for the node assignment. In the final phase, we improve the route result by using the tabu search and exchange algorithm. We compared our heuristic with different heuristics such as the Clark-Wright heuristic and the genetic algorithm. The result of proposed heuristic show that our algorithm can get the nearest optimal value within the shortest execution time comparatively.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.25 no.4
• /
• pp.739-747
• /
• 2015

Masking technique that is most widely known as countermeasure against power analysis attack prevents leakage for sensitive information during the implementations of cryptography algorithm. it have been studied extensively until now applied on block cipher algorithms. Masking countermeasure have been applied to international standard SEED algorithm. Masked SEED algorithm proposed by Cho et al, not only protects against first order power analysis attacks but also efficient by reducing the execution of Arithmetic to Boolean converting function. In this paper, we analyze the vulnerability of Cho's algorithm against first order power analysis attacks. We targeted additional pre-computation to improve the efficiency in order to recover the random mask value being exploited in first order power analysis attacks. We describe weakness by considering both theoretical and practical aspects and are expecting to apply on every device equipped with cho's algorithm using the proposed attack method.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.39 no.2
• /
• pp.51-59
• /
• 2002

In this paper, we studied the voice cryptograph system designed by the SEED algorithm for the safe transmission and receipt on the voice communication. Voice band signal converts to digital signal by the CODEC and DSP that applied the improved SEED algorithm encrypt the digital signal. The CODEC convert Encryption signal into analog voice signal. This voice signal is transmitted safely because of encryption signal even if someone wiretap. Receiver can hear the source voice, because the encryption signal decrypted using the SEED algorithm. In this paper, We designed the 32 round key instead of 16 round key in the SEED algorithm so that we improve the truncated differential probability from $2^{-143.1}$ to $2^{-286.6}$. 

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.1
• /
• pp.215-222
• /
• 2008

In this paper, we analyse eavesdrop problem of existing RFID security scheme and proposed improved SEEB algorithm for RFID security. we suggest partial round process and security in SEED algorithm. Existing scheme has vulnerability of security and implementation so far from realization. Therefore In our paper, we proposed new scheme using modified SEED algorithm for backward channel protection.

• Journal of Korea Society of Industrial Information Systems
• /
• v.15 no.3
• /
• pp.41-49
• /
• 2010

Recently, RFID systems are spreading in various industrial areas faster but cause some serious problems of information security because of its unstable wireless communication. Moreover, traditional RFID systems have a restriction that one tag per each application object. This restriction deteriorates their usability because it is difficult to distinguish many tags without some kind of effort. Therefore, efficient information sharing of objects based on information security has to be studied for more spreading of RFID technologies. In this paper, we design a new RFID tag structure for supporting multiple objects which can be shared by many different RFID applications. We also design an encryption/decryption algorithm to protect the identifying information of objects stored in our tag structure. This algorithm is a light revision of the existing SEED algorithm which can be operated in RFID tag environment. To evaluate the performance of our algorithm, we measure the encryption and decryption times of this algorithm and compare the results with those of the original SEED algorithm.

• Language and Information
• /
• v.10 no.1
• /
• pp.21-46
• /
• 2006

This study proposes a Word Sense Disambiguation (WSD) algorithm, based on concept learning with special emphasis on statistically meaningful lowest frequency words. Previous works on WSD typically make use of frequency of collocation and its probability. Such probability based WSD approaches tend to ignore the lowest frequency words which could be meaningful in the context. In this paper, we show an algorithm to extract and make use of the meaningful lowest frequency words in WSD. Learning method is adopted from the Find-Specific algorithm of Mitchell (1997), according to which the search proceeds from the specific predefined hypothetical spaces to the general ones. In our model, this algorithm is used to find contexts with the most specific classifiers and then moves to the more general ones. We build up small seed data and apply those data to the relatively large test data. Following the algorithm in Yarowsky (1995), the classified test data are exhaustively included in the seed data, thus expanding the seed data. However, this might result in lots of noise in the seed data. Thus we introduce the 'maximum a posterior hypothesis' based on the Bayes' assumption to validate the noise status of the new seed data. We use the Naive Bayes Classifier and prove that the application of Find-Specific algorithm enhances the correctness of WSD.

• Journal of Institute of Control, Robotics and Systems
• /
• v.22 no.9
• /
• pp.766-772
• /
• 2016

Recent advances in networking and computers, especially internet of things (IoT) technologies, have improved the quality of home life and industrial sites. However, the security vulnerability of IoT technologies causes life-threatening issues and information leakage concerns. Studies regarding security algorithms are being conducted. In this paper, we proposed SEED algorithms based on one time passwords (OTPs). The specified server sent time data to the client every 10 seconds. The client changed the security key using time data and generated a ciphertext by combining the changed security key and the matrix. We applied the SEED algorithms with enhanced security to Linux-based embedded boards and android smart phones, then conducted a door lock control experiment (door lock & unlock). In this process, the power consumed for decryption was measured. The power consumption of the OTP-based algorithm was measured as 0.405-0.465W. The OTP-based algorithm didn't show any difference from the existing SEED algorithms, but showed a better performance than the existing algorithms.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.8 no.1
• /
• pp.107-115
• /
• 2012

This paper proposes on the structure for reducing the circuit area and increasing the computation speed in implementing to hardware using the SEED algorithm of a 128-bit block cipher. SEED cipher can be implemented with S/W or H/W method. It should be important that we have minimize the area and computation time in H/W implementation. To increase the computation speed, we used the structure of the pipelined systolic array, and this structure is a simple thing without including any buffer at the input and output circuit. This circuit can record the encryption rate of 320 Mbps at 10 MHz clock. We have designed the circuit with the Verilog HDL coding showing the circuit performances in the figures and the table.

• Journal of Biosystems Engineering
• /
• v.19 no.2
• /
• pp.91-98
• /
• 1994

Planting, transplanting, and harvesting are important processes for the successful production of farm products in Korea because those require the high labor intensity during limitted period. Recently, many researches of using automatic control with a microcomputer are carried in the agricultural field, but are not much spread to the seeder development. Automatic sowing technology would be much attractive if there was a way to assure that each seed was count accurately in the seed metering device. Thus, an automatic seed metering device was designed and constructed to be controlled by microcomputer. This device could be improved in not only counting the number of seeds in but also sowing seeds between row spacings. Automatic seed metering device consisted of conveyor belt and temporary storage device. Performance of seed metering device depends on the apparatus including sensor, stepping motor and DC-solenoid. Research contents and results are summarized as follows. 1. The seed metering device involving seed hopper, sorter and temporary storage device was designed and constructed. 2. A seed counting system with six photo electric sensors, designed and built for this project, was adequate for tranferring and counting seeds accurately. 3. Operating algorithm for stepping motor and photo electric DC-solenoid was developed. The Seed metering device proved to be a smooth and accurate operating device using the algorithm. 4. The performance of second prototype metering device was examined with five kinds of seeds ; mung beans, red beans, white beans, black beans and corn to transfer and count the seeds. The error ratio of seed metering was less than 3.5%.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.687-690
• /
• 2015

Forward collision warning systems(FCWS) and lane change assist systems(LCAS) need regions of interest for detecting lanes and objects as road regions. Watershed segmentation is effective algorithm that classify the road. That algorithm is split results appear differently depending on Watershed line with local minimum in the early part of the seed. If not road regions or vehicles combined the road's seed, It segment road with the others. For compensate the that defect, It has to adaptive change by road environment. The method is that image segmentate the several of regions of interest. Then It is set in a straight line that is detected in regions of interest. If It was detected cars on seed, seed is adjusted the location. And If It wasn't include the line, seed is adjusted the length for final decision the seed. We can detect the road region using the final seed that selected according to the road environment.