• Journal of Sensor Science and Technology
• /
• v.16 no.1
• /
• pp.52-61
• /
• 2007

Networked embedded systems using the smart device and fieldbus technologies are now found in many industrial fields including process automation and automobiles. However the discrepancy between a node's view of current time and the rest of the system can cause many difficulties in the design and implementation of a networked system. To provide a networked system with a global reference time, the problem of clock synchronization has been intensively studied over the decades. However, many of the existing solutions, which are mainly developed for large scale distributed computer systems, cannot be directly applied to embedded systems. This paper presents a fault-tolerant clock synchronization technique that can be used for a low-cost embedded system using a CAN bus. The effectiveness of the proposed method is demonstrated with a set of microcontrollers and DC motor-based actuators.

• International Journal of Costume and Fashion
• /
• v.11 no.1
• /
• pp.53-61
• /
• 2011

This study examines the prati fashion style. prati fashion refers to a practical fashion, the most sought-after trend and newest fashion concept. This trend emerged as a response to the trio of minimalism, the recent economic downturn and the modern life style, and has led to powerful fashion lines and items. Therefore, this study is to understand and analyze the prati fashion style, with its focus on the 2010 modern fashion collection that embodied functional, economic, and minimal styles. First, the functional style realized by new materials provides comfort and allows multi-style changes. Second, the minimal style adds detailed changes to minimal silhouettes. Finally the economic style means easy to wear and easy to match items at affordable prices. The analyses stated above found that the prati fashion brought about a new paradigm to society, and influenced social, cultural and economic aspects of our daily life. It also helped find solutions to economic problems of this era. Drawing global attention, the prati fashion has functional, design and economic values, and thereby influences the shift of market paradigm.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.2
• /
• pp.157-167
• /
• 2005

This paper presents a new perturbation technique for developing efficient iterated local search procedures for the asymmetric traveling salesman problem(ATSP). This perturbation technique uses global information on ATSP instances to speed-up computation and to improve the quality of the tours found by heuristic method. The main idea is to escape from a local optima by introducing perturbations on the out-of-kilter arcs in the problem instance. For a local search heuristic, we use the Kwon which finds optimum or near-optimum solutions by applying the out-of-kilter algorithm to the ATSP. The performance of our algorithm has been tested and compared with known method perturbing on randomly chosen arcs. A number of experiments has been executed both on the well-known TSPLIB instances for which the optimal tour length is known, and on randomly generated Instances. for 27 TSPLIB instances, the presented algorithm has found optimal tours on all instances. And it has effectively found tours near AP lower bound on randomly generated instances.

• Journal of Ocean Engineering and Technology
• /
• v.21 no.2 s.75
• /
• pp.75-80
• /
• 2007

The design variables for structural systems, in most practical designs, are chosen from a list of discrete values, which are commercially available sizing. This paper presents the application of Genetic Algorithms for determining the optimum design for two-dimensional structures with discrete and pseudocontinuous design variables. Genetic Algorithms are heuristic search algorithms and are effective tools for finding global solutions for discrete optimization. In this paper, Genetic Algorithms are used as the method of Elitism and penalty parameters, in order to improve fitness in the reproduction process. Examples in this paper include: 10 bar planar truss and 1 bay 8-story frame. Truss with discrete and pseudoucontinuous design variables and steel frame with W-sections are used for the design of discrete optimization.

• Proceedings of the Korea Concrete Institute Conference
• /
• 2002.05a
• /
• pp.551-556
• /
• 2002

High-performance concrete is defined as concrete that meets special combinations of performance and uniformity requirements that cannot always be achieved routinely using conventional constituents and normal mixing, placing, and curing practices. Ever since the term high-performance concrete was introduced into the industry, it had widely used in large-scale concrete construction that demands high-strength, high-flowability, and high-durability. To obtain such performances that cannot be obtained from conventional concrete and by the current method, a large number of trial mixes are required to select the desired combination of materials that meets special performance. In this paper, therefore, using genetic algorithm which is a global optimization technique modeled on biological evolutionary process-natural selection and natural genetics-and can be used to find a near optimal solution to a problem that may have many solutions, the new design method for high-performance concrete mixtures is suggested to reduce the number of trial mixtures with desired properties in the field test. Experimental and analytic investigations were carried out to develop the design method for high-performance concrete mixtures and to verify the proposed mix design.

• Journal of Environmental Policy
• /
• v.2 no.2
• /
• pp.1-16
• /
• 2003

This paper focuses on examining environmental implications embedded in recent spatial expansion of the Asian megacities as well as exploring the potentials of planning practices in addressing urban environmental problems. Regardless what underlying forces of recent metropolitan expansion are, nearly all the Asian megacities suffer serious environmental problems as these cities rapidly grow in terms of population and geographical boundaries. Furthermore, the global environmental implication of urban expansion at Asian megacities implies that there must be intense endeavor to develop more innovative policy solution in order to tackle down the worsening urban environmental problems in Asian cities at a metropolitan scale. Given the situation that there has been little attention on environmental consequence of the Asian metropolitan expansion in spatial term, this paper presents the overview on the changing nature of urban environmental problems embedded in the spatial expansion of recent metropolitan area in Asia, along with exploring possible solutions from planning practices guiding sustainable urban development in Asia.

• Journal of the Korean Mathematical Society
• /
• v.48 no.6
• /
• pp.1101-1123
• /
• 2011

Numerical schemes are routinely used to predict the behavior of continuous dynamical systems. All such schemes transform flows into maps, which can possess dynamical behavior deviating from their continuous counterparts. Here the common bifurcations of scalar dynamical systems are transformed under a class of algorithms known as linearized one-point collocation methods. Through the use of normal forms, we prove that each such bifurcation in an originating flow gives rise to an exactly corresponding one in its discretization. The conditions for spurious period doubling behavior under this class of algorithm are derived. We discuss the global behavioral consequences of a singular set induced by the discretizing methods, including loss of monotonicity of solutions, intermittency, and distortion of attractor basins.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.50 no.11
• /
• pp.528-536
• /
• 2001

This paper proposes a method of solving a unit commitment problem using parallel tabu search(PTS) approach. Tabu search is a heuristic optimization method that has the tabu list to control the search process. To improve the searching ability of a global solution, we used a method of exchanging solutions among connected processors as a diversification strategy, and to reduce the computation time, a new evaluating method was proposed which evaluates only a changed par. To show the usefulness of the proposed method, we simulated for 10 units system and 110 units system. Numerical results show improvements in the generation costs and the computation time compared with other conventional methods.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.2
• /
• pp.217-228
• /
• 1994

This paper presents a new integer formulation (Type III ALB) for a single model assembly line balancing problem. The objective of the formulation is to minimize the total idle time, which is defined as the product of the number of work stations and the cycle times minus the total work content. This formulation considers currently existing Type I (minimizing the number of work stations for a given cycle time) and type II (minimizing the cycle time for a given number of work stations) formulations as its special cases and provides the global minimum solutions of the cycle time and the number of work stations. This information would be of great value to line designers involved in designing new assembly lines and rebalancing old lines under flexible conditions. Solution methods based on combination of Type I and Type II approaches are also suggested and compared.

• Management Science and Financial Engineering
• /
• v.12 no.1
• /
• pp.113-125
• /
• 2006

Bilevel programming problem is a two-stage optimization problem where the constraint region of the first level problem is implicitly determined by another optimization problem. In this paper we consider the bilevel quadratic/linear fractional programming problem in which the objective function of the first level is quasiconcave, the objective function of the second level is linear fractional and the feasible region is a convex polyhedron. Considering the relationship between feasible solutions to the problem and bases of the coefficient submatrix associated to variables of the second level, an enumerative algorithm is proposed which finds a global optimum to the problem.