• KIPS Transactions on Software and Data Engineering
• /
• v.9 no.8
• /
• pp.229-234
• /
• 2020

This paper presents the design and the implementation of CRESTIVE-DX, a concolic testing tool that distribute the concolic testing process over the embedded target system and the host system for efficient test generation of a target embedded program. CRESTIVE-DX conducts the execution of a target program on the target embedded system to consider possible machine-dependent behaviors of a target program execution, and conducts machine-independent parts, such as search-strategy heuristics, constraint solving, on host systems with high-speed computation unit, and coordinates their concurrent executions. CRESTIVE-DX is implemented by extending an existing concolic testing tool for C programs CREST. We conducted experiments with a test bed that consists of an embedded target system in the Arm Cortex A54 architecture and host systems in the x86-64 architecture. The results of experiments with Unix utility programs Grep, Busybox Awk, and Busybox Ed show that test input generation of CRESTIVE-DX is 1.59 to 2.64 times faster than that of CREST.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.35 no.3
• /
• pp.715-723
• /
• 2015

Earthwork in a large construction project such as a land development generally costs 20-30% of the total cost. The earthmoving process, comprising of four repetitive tasks: loading, hauling, unloading, returning, is quite simple and it does not need delicate or advanced techniques. Therefore, earthmoving earthwork planning can heavily affect the cost and time., and Even a slight deviation from the plan can increase or decrease the cost and time. This study presents a planning model that minimizes average haul distance in a large complex construction project. Based on earthwork planning, practitioners' heuristics, a districting algorithm and Simulated Annealing algorithm were employed to build the model. Districting algorithm plays a role that divides in dividing an earthmoving area into several sections. Simulated annealing provides a function that decides whether a new generated solution is confident. Finally, the proposed model was applied to a real earthmoving project of a large land development. It was found that the model showed approximately 14% improvement in average hauling distance compared to the actual design plan.

• Journal of Biosystems Engineering
• /
• v.19 no.2
• /
• pp.124-137
• /
• 1994

Visual features of a mushroom(Lentinus Edodes, L.) are critical in grading and sorting as most agricultural products are. Because of its complex and various visual features, grading and sorting of mushrooms have been done manually by the human expert. To realize the automatic handling and grading of mushrooms in real time, the computer vision system should be utilized and the efficient and robust processing of the camera captured visual information be provided. Since visual features of a mushroom are distributed over the front and back sides, recognizing sides and states of the stalk including the stalk orientation from the captured image is a prime process in the automatic task processing. In this paper, the efficient and robust recognition process identifying the front and back side and the state of the stalk was developed and its performance was compared with other recognition trials. First, recognition was tried based on the rule set up with some experimental heuristics using the quantitative features such as geometry and texture extracted from the segmented mushroom image. And the neural net based learning recognition was done without extracting quantitative features. For network inputs the segmented binary image obtained from the combined type automatic thresholding was tested first. And then the gray valued raw camera image was directly utilized. The state of the stalk seriously affects the measured size of the mushroom cap. When its effect is serious, the stalk should be excluded in mushroom cap sizing. In this paper, the stalk removal process followed by the boundary regeneration of the cap image was also presented. The neural net based gray valued raw image processing showed the successful results for our recognition task. The developed technology through this research may open the new way of the quality inspection and sorting especially for the agricultural products whose visual features are fuzzy and not uniquely defined.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.9
• /
• pp.4228-4247
• /
• 2018

Many methods have been developed for the vehicles to create clusters in vehicular ad hoc networks (VANETs). Usually, nodes are vehicles in the VANETs, and they are dynamic in nature. Clusters of vehicles are made for making the communication between the network nodes. Cluster Heads (CHs) are selected in each cluster for managing the whole cluster. This CH maintains the communication in the same cluster and with outside the other cluster. The lifetime of the cluster should be longer for increasing the performance of the network. Meanwhile, lesser the CH's in the network also lead to efficient communication in the VANETs. In this paper, a novel algorithm for clustering which is based on the social behavior of Gray Wolf Optimization (GWO) for VANET named as Intelligent Clustering using Gray Wolf Optimization (ICGWO) is proposed. This clustering based algorithm provides the optimized solution for smooth and robust communication in the VANETs. The key parameters of proposed algorithm are grid size, load balance factor (LBF), the speed of the nodes, directions and transmission range. The ICGWO is compared with the well-known meta-heuristics, Multi-Objective Particle Swarm Optimization (MOPSO) and Comprehensive Learning Particle Swarm Optimization (CLPSO) for clustering in VANETs. Experiments are performed by varying the key parameters of the ICGWO, for measuring the effectiveness of the proposed algorithm. These parameters include grid sizes, transmission ranges, and a number of nodes. The effectiveness of the proposed algorithm is evaluated in terms of optimization of number of cluster with respect to transmission range, grid size and number of nodes. ICGWO selects the 10% of the nodes as CHs where as CLPSO and MOPSO selects the 13% and 14% respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.4
• /
• pp.758-767
• /
• 2017

IoT paradigm which makes a information without direct intervention of a human and interworks with other objects, humans and systems is attracting attention. It will be expected the number of smart devices equipped with sensors and wireless communication capabilities is reached to about 260 billion by 2020. With the vast amount of sending data generated from rapidly increasing number of smart devices, it will bring up the traffic growth over internet and congestion in wireless networks. In this paper, we utilize the smart device as a sink node to collect and forward the sensing data periodically in IoT and propose a heuristic algorithm for a selection of sink nodes' set with each sink node satisfies the QoS its applications because a selection of optimal sink nodes' set is NP-hard problem. The complexity of proposed heuristic algorithm is $O(m^3)$ and faster than the optimal algorithm.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.40 no.2
• /
• pp.111-120
• /
• 2017

This paper proposes an improved standard genetic algorithm (GA) of making a near optimal schedule for integrated process planning and scheduling problem (IPPS) considering tool flexibility and tool related constraints. Process planning involves the selection of operations and the allocation of resources. Scheduling, meanwhile, determines the sequence order in which operations are executed on each machine. Due to the high degree of complexity, traditionally, a sequential approach has been preferred, which determines process planning firstly and then performs scheduling independently based on the results. The two sub-problems, however, are complicatedly interrelated to each other, so the IPPS tend to solve the two problems simultaneously. Although many studies for IPPS have been conducted in the past, tool flexibility and capacity constraints are rarely considered. Various meta-heuristics, especially GA, have been applied for IPPS, but the performance is yet satisfactory. To improve solution quality against computation time in GA, we adopted three methods. First, we used a random circular queue during generation of an initial population. It can provide sufficient diversity of individuals at the beginning of GA. Second, we adopted an inferior selection to choose the parents for the crossover and mutation operations. It helps to maintain exploitation capability throughout the evolution process. Third, we employed a modification of the hybrid scheduling algorithm to decode the chromosome of the individual into a schedule, which can generate an active and non-delay schedule. The experimental results show that our proposed algorithm is superior to the current best evolutionary algorithms at most benchmark problems.

• Journal of the Korea Society for Simulation
• /
• v.20 no.2
• /
• pp.67-76
• /
• 2011

Order picking in automotive service parts warehouses is considered to be the most labor-intensive operation. Such warehouses contain hundreds of thousands of items, but normally 20% of products contribute to about 80% of turnover according to Pareto's 80-20 principle. Therefore most fast moving items are located near an outbound area which is called the "Golden Zone". Order picking routing efficiency is related to productivity and labor cost. However, most companies use simple methods. In this paper, we describe a series of computational experiments over a set of test cases where, we compared various previously existing routing heuristics to an optimal algorithm. We focus on examining the influence of the golden zone on the performance and selection of routing methods. The results obtained show that the optimal routing method increases the productivity at least 17.2%, and all the routing methods have better performance as the pick up rate from the golden zone increases.

• Journal of the Ergonomics Society of Korea
• /
• v.30 no.6
• /
• pp.765-773
• /
• 2011

Objective: This study aims towards exploring a model of the HCI evaluation methods to improve the usability of mobile device, based on a case of a Mobile PDA system in a Museum context. Background: Mobile PDA systems in a Museum context is widely utilized for the educational purposes, but it is criticized for low usability that the device only play a role in textbooks on legs without any interactive educational activities. Therefore, the usability improvements on the mobile PDA system should be considered. Method 1: This model was developed with a combination of the expert review and the user testing, and with a combination of the qualitative and quantitative studies. In more details, first of all, a qualitative study was conducted as a combination of three different methods: 1) expert review with heuristics, 2) interviews with persons working in a museum, and 3) contextual enquiry. Results 1: The experts review provided with critical usability issues, and the semi-constructive interview helped to understand the background of the mobile device. Lastly, the contextual enquiry showed user experience problems and directions of improving the device from user's perspective. Method 2: Based on the results of the qualitative study, a questionnaire was designed. Results 2: The analysis of the quantitative study was conducted to generalize the problems, and prioritize the direction of improving the device within the limitation of the cost and time in a museum. Conclusion: This study has implications in developing an example of a HCI evaluation model to improve the user experience of the mobile device as well as finding problems and directions of how to improve the mobile PDA systems in the museum. Application: In fact, most of the studies related to the evaluation of the mobile device have been conducted in a laboratory context due to the cost and time. This paper, however, attempted to apply to various HCI research techniques from different constituents in real context.

• Journal of the Korea Society for Simulation
• /
• v.22 no.1
• /
• pp.63-75
• /
• 2013

The School Bus Routing Problem(SBRP) seeks to plan an efficient schedule of a fleet of school buses that must pick up student from various bus stops and deliver them by satisfying various constraints; maximum capacity of the bus, maximum riding time of students, arrival time between a school's time window. By extending the existing SBRP, we consider a case study of SBRP with allowance of mixed-loading and dynamic arrivals reflecting the school bus operation of university in Korea. Our solution procedure is based on constructing the initial solution using sweep algorithm and then improving solution within the framework of the evolutionary approach known as efficient meta-heuristics. By comparing the various scenarios through the constraints relaxation for reflecting the real operational strategies, we assess the merit of our proposed procedure.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.11
• /
• pp.153-161
• /
• 2011

As the problem of GOSST building belongs to NP compete domain, heuristics for the problem ask for immense amount execution time and computations in large scale inputs. In this paper, we propose an efficient mechanism for GOSST construction using space locality PTAS. For 40,000 input nodes with maximum weight 100, the proposed space locality PTAS GOSST with 16 unit areas can reduce about 4.00% of connection cost and 89.26% of execution time less than weighted minimum spanning tree method. Though the proposed method increases 0.03% of connection cost more, but cuts down 96.39% of execution time less than approximate GOSST method (SGOSST) without PTAS. Therefore the proposed space locality PTAS GOSST mechanism can work moderately well to many useful applications where a greate number of weighted inputs should be connected in short time with approximate minimum connection cost.