• Journal of the Korean Institute of Intelligent Systems
• /
• v.24 no.5
• /
• pp.542-547
• /
• 2014

This paper describes the medical and IT convergence system using a smart phone and a heuristic method for the measurement of the dripping speed of the liquid in a drip chamber, which can estimate the remaining time using pattern recognition and difference image from video frame information based on Android technology. The video frames were first made using a smartphone camera and we calculated the difference image between the n image and the (n-1) image and then changed into binary images using the threshold value. At this point, it is very important to find an optimal threshold value using heuristic method to recognize the dripping of the liquids. In addition, the user can adjust the dripping speed according to the doctor's prescription, exactly like watching the progress bar of a mobile application. The experiment results show that our method using video processing technique accurately measures the dripping speed for a wide range of speeds that are sufficient for ordinary practice.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.9
• /
• pp.1689-1695
• /
• 2008

The development of low-power wireless communication and low-cost multi-functional smart sensor has enabled the sensor network that can perceive the status information in remote distance. Sensor nodes are sending the collected data to the node in the base station through temporary communication path using the low-cost RF communication module. Sensor nodes get the energy supply from small batteries, however, they are installed in the locations that are not easy to replace batteries, in general, so it is necessary to minimize the average power consumption of the sensor nodes. It is known that the RF modules used for wireless communication are consuming 20-60% of the total power for sensor nodes. This study suggests the probability inference heuristic based non-periodic transmission to send the collected information to the base station node, when the calculated value by probability is bigger than an optional random value, adapting real-time to the variation characteristics of sensing datain order to improve the energy consumption used in the transmission of sensed data. In this transmission method suggested, transmitting is decided after evaluation of the data sensed by the probability inference heuristic algorithm and the directly sensed data, and the coefficient that is needed for its algorithm is decided through the reappearance rate of the algorithm verification data.

• Industrial Engineering and Management Systems
• /
• v.12 no.1
• /
• pp.51-62
• /
• 2013

This paper considers a single machine rescheduling problem whose original (efficiency related) objective is minimizing makespan. We assume that disruptions such as order cancelations and newly arrived orders occur after the initial scheduling, and we reschedule this disrupted schedule with the objective of minimizing a disruption related objective while preserving the original objective. The disruption related objective measures the impact of the disruptions as difference of completion times in the remaining (uncanceled) jobs before and after the disruptions. The artificial due dates for the remaining jobs are set to completion times in the original schedule while newly arrived jobs do not have due dates. Then, the objective of the rescheduling is minimizing the maximum earliness without tardiness. In order to preserve the optimality of the original objective, we assume that no-idle time and no tardiness are allowed while rescheduling. We first define this new problem and prove that the general version of the problem is unary NP-complete. Then, we develop three simple but intuitive heuristics. For each of the three heuristics, we find a tight bound on the measure called modified z-approximation ratio. The best theoretical bound is found to be 0.5 - ${\varepsilon}$ for some ${\varepsilon}$ > 0, and it implies that the solution value of the best heuristic is at most around a half of the worst possible solution value. Finally, we empirically evaluate the heuristics and demonstrate that the two best heuristics perform much better than the other one.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.9 no.5
• /
• pp.1392-1398
• /
• 2008

This paper presents a Petri Net (PN) based disassembly sequence planning model with precedence operations. All feasible disassembly sequences are generated by a disassembly tree and a disassembly sequence is determined using the disassembly precedence and disassembly value matrix, The precedence of disassembly operations is determined through a disassembly tree and the value of disassembly is induced by economic analysis in the end-of-life phase. To solve the disassembly sequence planning model with precedence operations, a heuristic algorithm based on PNs is developed. The developed algorithm generates and searches a partial reachability graph to arrive at an optimal or near-optimal disassembly sequence based on the firing sequence of transitions of the PN model. A refrigerator is shown as an example to demonstrate the effectiveness of proposed model.

• Journal of the Korea Safety Management & Science
• /
• v.19 no.1
• /
• pp.203-210
• /
• 2017

Companies are pursuing the management of small quantity batch production or JIT(Just-in-time) system for improving the delivery response and LOB(Line Balancing) in order to satisfy consumers' increasing demands in the current global economic recession. And in order to improve the growth of production for reducing manufacturing cost, improvements of the Load Balancing have become an important reformation factor. Thus this paper is aimed at warehouse which procures materials on the assembly line in procurement logistics of automotive logistics and proceed with research on heuristic algorithm development which can increase the Load Balancing of workers. As a result of this study, when applied the primary target value, it was verified that the whole workers decreased from 28 to 24. Furthermore, when specified the secondary target value and applied algorithm once more, it was verified that the Load Balance Ratio was improved from 44.96% to 91.7%.

• Journal of Korean Society for Quality Management
• /
• v.30 no.4
• /
• pp.137-153
• /
• 2002

Viewed as a more systematic approach of creating high quality products and bringing them into market at a lower cost and in significantly less time, it attracts the attention of quality designers to quality function deployment (QFD) approach. In attempt to reduce the design cycle, the industry has responded with concurrent design effort. In a sense, concurrent engineering refers to the integration of various activities within the broad scope of the product life cycle ［17］. Over the last ten years, much has been written about QFD but little has been available in terms of the underlying guide methodology. The methodology of QFD is quite simple and many will say that they have done it in the past but just have not formalized it into the form that this discipline requires. QFD ties the product, user, value, and manufacturing viewpoints together in a continuous process of defining the product design and manufacturing requirements. The value viewpoint recognizes the cost to obtain certain functionality, and the manufacturing viewpoint addresses conformance to requirements, but in a broader sense, the variability in production. In this paper, the QFD system acquisitions are described, and two heuristic approaches solving for the complex design process, especially the size reduction of design process and precedence-constrained relationship in QFD are proposed, and the empirical example is illustrated.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.12
• /
• pp.1114-1125
• /
• 2013

License Plate Detection (LPD) is a key component in automatic license plate recognition system. Despite the success of License Plate Recognition (LPR) methods in the past decades, the problem is quite a challenge due to the diversity of plate formats and multiform outdoor illumination conditions during image acquisition. This paper aims at automatical detection of car license plates via image processing techniques. In this paper, we proposed a real-time and robust method for license plate detection using Heuristic Energy Map(HEM). In the vehicle image, the region of license plate contains many components or edges. We obtain the edge energy values of an image by using the box filter and search for the license plate region with high energy values. Using this energy value information or Heuristic Energy Map(HEM), we can easily detect the license plate region from vehicle image with a very high possibilities. The proposed method consists two main steps: Region of Interest (ROI) Detection and License Plate Detection. This method has better performance in speed and accuracy than the most of existing methods used for license plate detection. The proposed method can detect a license plate within 130 milliseconds and its detection rate is 99.2% on a 3.10-GHz Intel Core i3-2100(with 4.00 GB of RAM) personal computer.

• Journal of KIISE:Software and Applications
• /
• v.30 no.9
• /
• pp.862-866
• /
• 2003

Traveling Salesman Problem(TSP) is a combinational optimization problem, Genetic Algorithm(GA) and Lin-Kernighan(LK) Heuristic［1］that is Local Search Heuristic are one of the most commonly used methods to resolve TSP. In this paper, we introduce ACS(Ant Colony System) Algorithm as another approach to solve TSP and propose a new pheromone updating method. ACS uses pheromone information between cities in the Process where many ants make a tour, and is a method to find a optimal solution through recursive tour creation process. At the stage of Global Updating of ACS method, it updates pheromone of edges belonging to global best tour of created all edge. But we perform once more pheromone update about created all edges before global updating rule of original ACS is applied. At this process, we use the frequency of occurrence of each edges to update pheromone. We could offer stochastic value by pheromone about each edges, giving all edges' occurrence frequency as weight about Pheromone. This finds an optimal solution faster than existing ACS algorithm and prevent a local optima using more edges in next time search.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.10
• /
• pp.786-790
• /
• 2009

In this paper, we present a new heuristic search algorithm, HSCP, that can solve conditional/contingent planning problems with nondeterministic actions as well as partial observations. The algorithm repeats its AND-OR search trials until a complete solution graph can be found. However, unlike existing heuristic AND-OR search algorithms such as$AO^*$ and $LAO^*$, the AND-OR search trial conducted by HSCP concentrates on only a single candidate of solution subgraphs to expand it into a complete solution graph. Moreover, unlike real-time dynamic programming algorithms such as RTDP and LRTDP, the AND-OR search trial of HSCP finds a solution immediately when it possible without delaying it until the estimated value of every state converges. Therefore, the HSCP search algorithm has the advantage that it can find a sub-optimal conditional plan very efficiently.

• Communications of Mathematical Education
• /
• v.36 no.1
• /
• pp.23-38
• /
• 2022

The study provided a perspective on which readers can see Newton's proof heuristically in order to overcome the difficulty of proof showing 'QT²/QR converges to the latus rectum of ellipse' in the proof of the inverse square law of Newton's Principia. The heuristic perspective is as follows: The starting point of the proof is the belief that if we transform the denominators and numerators of QT²/QR into expression with respect to segments related to diameter and conjugate diameter, we may obtain some constant, the desired value, by their relationship PV × VG/QV² = PC²/CD² in Apollonius' Conic sections. The heuristic perspective proposed in this study is meaningful because it can help readers understand Newton's proof more easily by presenting the direction of transformation of QT²/QR.