• Journal of the Korean Society for Precision Engineering
• /
• v.16 no.6
• /
• pp.148-159
• /
• 1999

A numerical method is presented for the dynamic analysis of spur gears rotating with very high angular speeds. For an efficient computation each gear is assumed to consist of a rotating rigid disk and an elastic tooth having mass, and finite element formulations are used for the equations of motion of the tooth. The geometric constraint is imposed between the rigid disk and the elastic tooth to fix them, and contact condition is imposed between the meshing teeth of the gears. At each iteration of each time step the Lagrange multiplier and contact force are revised by using the constraint error vector, and then the whole equations of motion are time integrated with the given Lagrange multiplier and contact force. For the accurate solution the velocity and acceleration constraints as well as the displacement constraint are satisfied by the monotone reductions of the constraint error vectors. Computing procedures associated with the iterative schemes are explained and numerical simulations are conducted with the spur gears.

• Industrial Engineering and Management Systems
• /
• v.12 no.4
• /
• pp.306-316
• /
• 2013

The semiconductor industry has grown rapidly, and subsequently production planning problems have raised many important research issues. The reentrant flow-shop (RFS) scheduling problem with time windows constraint for harddisk devices (HDD) manufacturing is one such problem of the expanded semiconductor industry. The RFS scheduling problem with the objective of minimizing the makespan of jobs is considered. Meeting this objective is directly related to maximizing the system throughput which is the most important of HDD industry requirements. Moreover, most manufacturing systems have to handle the quality of semiconductor material. The time windows constraint in the manufacturing system must then be considered. In this paper, we propose a hybrid genetic algorithm (HGA) for improving chromosomes/offspring by checking and repairing time window constraint and improving offspring by left-shift routines as a local search algorithm to solve effectively the RFS scheduling problem with time windows constraint. Numerical experiments on several problems show that the proposed HGA approach has higher search capability to improve quality of solutions.

• Journal of the Korean Geographical Society
• /
• v.30 no.2
• /
• pp.120-131
• /
• 1995

To analyze mobility patterns, this study used three Constraint (Capability Constraint, Coupling Constraint, Authority Constraint) models which were proposed in Dr. Hagerstrand's Time-space theory. This paper shows that three constraint models have some effects upon mobility by age. In this study, Capability Constraint means a certain special constraint that is what we can't do during proceeding basic natural urges like sleep, fare, etc. Coupling constraint is a physical one. Each person limits the action range for staying on a special place in special time. For instance, students have to stay in school so that they have mobility constraints. Authority Constraint is a social one. When we use urban facilities or traffic, we may be controlled by mobility sphere by an agreement or a social position. It is social agreement that the opening hour of a store, the time table of mass-transportation and a social positional control that the personal income, the standard of education. In this study it has been in a process of determination of the cluster number that degree of influences a social constraint to mobility. Considering the mobility constraint of characteristics of space divides urban and rural, people in urban area have higher mobility rate than in rural area. Resuets of determination of the cluster, show similar mobility pattern. People in urban area are connected verity of mobility which related to urban space structures with determination of cluste-number. That is to say, mobility patterns can be changed by space charactcristics. Constraints by sex and age are also social constraints and they are influenced by mobility patterns. For instance, females at the age of twenties have similar mobility pattern to the same age male but they have sudden changes after thirty's age. Male entertains a similar pattern without restriction of age. That is to say, management by sex as a social constraint affects mobility. To establish more realistic traffie policy, mobility formation should be reflected to the space in a view of social-behavioral science. To embody this, some problems should be investigated as follows. 1. As a problem of methodology, if sufficient samples ensured, we could subdivide clusters and could open up a new method of analyzing the mobility clusters by using the neuro-network. 2. Extracting actions connected with mobility and finding life cycle which is classified by daily cluste-characteristics, suitable counterproposal could be presented to the traific policy.

• Journal of the Society of Disaster Information
• /
• v.7 no.2
• /
• pp.161-171
• /
• 2011

This research puts the purpose in elucidating the effect of participation types of leisure activity and leisure restraints on life quality. To achieve research purpose, questionnaire survey was conducted on 200 subjects who are engaged in private guard companies with ages over 20. Using the collected data, frequency analysis was conducted in order to identify demographic characteristics with SPSS/WIN 17.0V program. In addition, multiple regression analysis was conducted for solving research questions. As a result, sports related participation type had a positive effect on time constraint factor. Meanwhile, hobby related participation type had a positive effect on time and cost constraint, participation type of watching has a positive effect on individual and social constraint. Tour and play related participation type had a positive effect on individual constraint factor. Meanwhile participation type of sociality had a positive effect on individual constraint and hobby factor, but had a negative effect on familial and social constraint. Sports related participation type had a positive effect on social relationship factor. Participation type of watching and play related participation type had a negative effect on family relationship. Finally, time constraint factor had a positive effect on family relationship, and cost constraint factor had a positive effect on entire quality of life. Individual and family constraint factors had a negative effect on leisure relationship factor. Also, social constraint factor had a positive effect on family relationship, but had a negative effect on leisure relationship.

• Structural Engineering and Mechanics
• /
• v.43 no.3
• /
• pp.311-320
• /
• 2012

The higher-order asymptotic C(t) - $A_2(t)$ approach was employed to investigate the crack-tip stress of two collinear cracks in a power-law creeping material under the plane strain conditions. A comprehensive calculation was made of the single crack, collinear crack model with S/a = 0.4 and 0.8, by using the C(t) - $A_2(t)$ approach, HRR-type field and the finite element analysis; the latter two methods were used to check the constraint significance and the calculation accuracy of the C(t) - $A_2(t)$ approach, respectively. With increasing the creep time, the constraint $A_2$ was exponentially increased in the small-scale creep stage, while no discernible dependency of the constraint $A_2$ on the creep time was found at the extensive creep state. In addition, the creep time and the mechanical loads have no distinct influence on accuracy of the results obtained from the higher-order asymptotic C(t) - $A_2(t)$ approach. In comparison with the HRR-type field, the higher-order asymptotic C(t) - $A_2(t)$ solution matches well with the finite element results for the collinear crack model.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.31 no.4
• /
• pp.134-139
• /
• 2008

Most approaches for continuous review inventory problem need tables for loss function and cumulative standard normal distribution. Furthermore, it is time-consuming to calculate order quantity (Q) and reorder point (r) iteratively until required values are converged. The purpose of this paper is to develop a direct method to get the solution without any tables. We used approximation approaches for loss function and cumulative standard normal distribution. The proposed method can get the solution directly without any iterative procedure for Q, r and without any tables. The performance of the proposed approach is tested by using numerical examples. The budget constraint of this paper assumes that purchasing costs are paid at the time an order is arrived. This constraint can be easily replaced by capacity constraint or budget constraint in which' purchasing costs are paid at the time an order is placed.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.9
• /
• pp.9-16
• /
• 2017

The course timetabling problem is a problem assigning a set of subjects to the given classrooms and different timeslots, while satisfying various hard constraints and soft constraints. This problem is defined as a constraint satisfaction optimization problem and is known as an NP-complete problem. Various methods has been proposed such as integer programming, constraint programming and local search methods to solve a variety of course timetabling problems. In this paper, we propose an iterative improvement search method to solve the problem based on constraint programming. First, an initial solution satisfying all the hard constraints is obtained by constraint programming, and then the solution is repeatedly improved using constraint programming again by adding new constraints to improve the quality of the soft constraints. Through experimental results, we confirmed that the proposed method can find far better solutions in a shorter time than the manual method.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.10
• /
• pp.1264-1274
• /
• 1999

본 논문에서는 분산된 클록들을 주기적으로 동기화 시키는 분산 실시간 시스템에서 시간적 제약을 만족시키기 위한 정적/동적 시간 제약(timing constraint) 변환 기법을 제안한다. 전형적인 이산클록동기화(discrete clock synchronization) 알고리즘은 클록의 값을 순간적으로 조정하여 클록의 시간이 불연속적으로 진행한다. 이러한 시간상의 불연속성은 시간적 이벤트를 잃어버리거나 다시 발생시키는 오류를 범하게 한다.클록 시간의 불연속성을 피하기 위해 일반적으로 연속클록동기화(continuous clock synchronization) 기법이 제안되고 있지만 소프트웨어적으로 구현되면 많은 오버헤드를 유발시키는 문제점이 있다. 본 논문에서는 시간적 제약을 동적으로 변환시키는 DCT (Dynamic Constraint Transformation) 기법을 제안하였으며, 이를 통해 기존의 이산클록동기화 알고리즘을 수정하지 않고서도 클록 시간의 불연속성에 의한 문제점들을 해결할 수 있도록 하였다. 아울러 DCT에 의해 이산클록동기화 하에서 생성된 태스크 스케쥴이 연속클록동기화에 의해 생성된 스케쥴과 동일함을 증명하여 DCT의 동작이 이론적으로 정확함을 증명하였다.또한 분산 실시간 시스템에서 지역 클록(local clock)이 기준 클록과 완벽하게 일치하지 않아서 발생하는 스케쥴링상의 문제점을 다루었다. 이를 위해 먼저 두 가지의 스케쥴링 가능성, 지역적 스케쥴링 가능성(local schedulability)과 전역적 스케쥴링 가능성(global schedulability)을 정의하고, 이를 위해 시간적 제약을 정적으로 변환시키는 SCT (Static Constraint Transformation) 기법을 제안하였다. SCT를 통해 지역적으로 스케쥴링 가능한 태스크는 전역적으로 스케쥴링이 가능하므로, 단지 지역적 스케쥴링 가능성만을 검사하면 스케쥴링 문제를 해결할 수 있도록 하였고 이를 수학적으로 증명하였다.Abstract In this paper, we present static and dynamic constraint transformation techniques for ensuring timing requirements in a distributed real-time system possessing periodically synchronized distributed local clocks. Traditional discrete clock synchronization algorithms that adjust local clocks instantaneously yield time discontinuities. Such time discontinuities lead to the loss or the gain of events, thus raising serious run-time faults.While continuous clock synchronization is generally suggested to avoid the time discontinuity problem, it incurs too much run-time overhead to be implemented in software. We propose a dynamic constraint transformation (DCT) technique which can solve the problem without modifying discrete clock synchronization algorithms. We formally prove the correctness of the DCT by showing that the DCT with discrete clock synchronization generates the same task schedule as the continuous clock synchronization.We also investigate schedulability problems that arise when imperfect local clocks are used in distributed real-time systems. We first define two notions of schedulability, global schedulability and local schedulability, and then present a static constraint transformation (SCT) technique. The SCT ensures that it is sufficient to check the schedulability of a task locally in a node with a local clock, since the global schedulability of the task is derived from its local schedulability through SCT. We formally prove the correctness of SCT.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.39 no.8
• /
• pp.84-91
• /
• 2002

In this paper, we proposed a CLB-based CPLD technology mapping algorithm for power minimization under time constraint in combinational circuit. The main idea of our algorithm is to exploit the "cut enumeration and feasible cluster" technique to generate possible mapping solutions for the sub-circuit rooted at each node. In our technology mapping algorithm conducted a low power by calculating TD and EP of each node and decomposing them on the circuit composed of DAG. It also takes the number of input, output, and OR-term into account on condition that mapping can be done up to the base of CLB, and so it generates the feasible clusters to meet the condition of time constraint. Of the feasible clusters, we should first be mapping the one that h3s the least output for technology mapping of power minimization and choose to map the other to meet the condition of time constraint afterwards. To demonstrate the efficiency of our approach, we applied our algorithm to MCNC benchmarks and compared the results with those of the exiting algorithms. The experimental results show that our approach is shown a decrease of 46.79% compared with DDMAP and that of 24.38% for TEMPLA in the power consumption.

• Journal of Institute of Control, Robotics and Systems
• /
• v.5 no.1
• /
• pp.62-68
• /
• 1999

The attitude of a vehicle can be precisely determined using GPS carrier phase measurements from more than two antennas attached to a vehicle and an efficient integer ambiguity resolution technique. Many methods utilizing the known baseline length as a constraint of independent elements of integer ambiguities are proposed to resolve integer ambiguity at real time. Three-dimensional search space is reduced to two-dimensional search space with this constraint. Thus the true integer ambiguity can be easily determined with less computational burden and fewer number of measurements. But there are still strong requirements for the real time integer ambiguity resolution, which uses single epoch measurement of long baseline. In this paper, a new constraint from the geometry of multiple baselines is derived. With this new constraint, two-dimensional search space is further reduced to one-dimensional search space. It makes possible to determine integer ambiguity with single epoch measurement. The proposed method is applied to real data to show its effectiveness.