• Proceedings of the KIEE Conference
• /
• 2004.05a
• /
• pp.59-61
• /
• 2004

Researches about scheduling distributed real-time systems have some weak points, not scheduling both sporadic and periodic tasks and messages or being unable to guaranteeing the end-to-end constraints due to omitting precedence relations between sporadic tasks. This paper describes the application model of sporadic tasks with precedence constraints in a distributed real-time system. It is shown that existing scheduling methods such as Rate Monotonic scheduling are not proper to be applied to the system having sporadic tasks with precedence constraints. So this paper proposes an end-to-end laxity-based priority assignment algorithm which considers the practical laxity of a task and allocates a proper priority to a task.

• Journal of the Korean Society for Precision Engineering
• /
• v.15 no.11
• /
• pp.108-120
• /
• 1998

In this paper, a new control system design algorithm, which has the advantages of the existing LQR and eigenstrcture assignment methods, is proposed. The method of the transformation matrix via block controller is utilized to develop the scheme. Using the proposed algorithm, LQR weighting matrices q and R, which satisfy the desired closed-loop eigenvalues and eigenvectors, can be achieved using only simple matrix computations. The usefulness of the proposed scheme is verified by applying to a numerical example and an automotive active suspension control system design.

• Journal of the Korean Society for Precision Engineering
• /
• v.20 no.3
• /
• pp.210-220
• /
• 2003

This work presents a method of point to surface assignment fur 3D metrology of solder pastes on PCB. A bounding box enclosing the solder paste tightly on all sides is introduced to avoid incorrect assignment. The shape of bounding box fur solder paste brick is variable according to geometry of measured points. The surface geometry of bounding box is obtained by using five peaks selected in the histogram of normalized gradient vectors. By using the bounding box enclosing the solder pastes, the task of point-to-surface assignment has been successfully conducted, then geometrical features are obtained through the task of surface fitting.

• Journal of the Korean Society for Precision Engineering
• /
• v.16 no.11
• /
• pp.81-88
• /
• 1999

A conventional quarter-car suspension system is a single input system with one actuator. Thus, the performance enhancement for ride quality could be limited. In this paper, we propose a novel automotive suspension system for a quarter-car with two independent actuators to improve the control performance. The left eigenstructure assignment method for multi-variable systems has been applied to the proposed novel quarter-car model.

• Nuclear Engineering and Technology
• /
• v.42 no.4
• /
• pp.414-425
• /
• 2010

In this paper, a procedure is developed for identifying a number of representative solutions manageable for decision-making in a multiobjective optimization problem concerning the test intervals of the components of a safety system of a nuclear power plant. Pareto Front solutions are identified by a genetic algorithm and then clustered by subtractive clustering into "families". On the basis of the decision maker's preferences, each family is then synthetically represented by a "head of the family" solution. This is done by introducing a scoring system that ranks the solutions with respect to the different objectives: a fuzzy preference assignment is employed to this purpose. Level Diagrams are then used to represent, analyze and interpret the Pareto Fronts reduced to the head-of-the-family solutions.

• Proceedings of the KOR-KST Conference
• /
• 2000.02a
• /
• pp.89-115
• /
• 2000

Traffic signal setting policies and traffic assignment procedures are mutually dependent. The combined signal control and traffic assignment problem deals with this interaction. With the total travel time minimization objective, gradient based local search methods are implemented. Deterministic user equilibrium is the selected user route choice rule, Webster's delay curve is the link performance function, and green time per cycle ratios are decision variables. Three implemented solution codes resulting in six variations include intersections operating under multiphase operation with overlapping traffic movements. For reference, the iterative approach is also coded and all codes are tested in four example networks at five demand levels. The results show the numerical gradient estimation procedure performs best although the simplified local searches show reducing the large network computational burden. Demand level as well as network size affects the relative performance of the local and iterative approaches. As demand level becomes higher, (1) in the small network, the local search tends to outperform the iterative search and (2) in the large network, vice versa.

• ETRI Journal
• /
• v.43 no.3
• /
• pp.471-482
• /
• 2021

Several code-division multiple access (CDMA)-based interconnect schemes have been recently proposed as alternatives to the conventional time-division multiplexing bus in multicore systems-on-chip. CDMA systems with a dynamic assignment of spreading codewords are particularly attractive because of their potential for higher bandwidth efficiency compared with the systems in which the codewords are statically assigned to processing elements. In this paper, we propose a novel distributed arbitration scheme for dynamic CDMA-bus-based systems, which solves the complexity and scalability issues associated with commonly used centralized arbitration schemes. The proposed arbitration unit is decomposed into multiple simple arbitration elements, which are connected in a ring. The arbitration ring implements a token-passing algorithm, which both resolves destination conflicts and assigns the codewords to processing elements. Simulation results show that the throughput reduction in an optimally configured dynamic CDMA bus due to arbitration-related overheads does not exceed 5%.

• Journal of Korean Society of Transportation
• /
• v.25 no.6
• /
• pp.19-31
• /
• 2007

When estimating the benefits from an investment project in the transportation sector, errors caused by many factors may exist. This study focuses on user equilibrium traffic assignment methods and stopping criteria. According to previous studies, when using a user equilibrium assignment model, the benefits of travel time savings can be effected by the relative gap value. As the stopping criteria decreases, the time needed for traffic assignment increases, so that lowering the criteria cannot be the best solution. Therefore, an effort is necessary to reduce this change rate and thus improve reliability. This paper considers three methods: reducing the links subject to benefit calculation, extracting sub-area O/D tables and networks, and applying the mean value of successive traffic assignment results. The results of the analysis show that the method using the mean value of five results is more proper than the other methods. Using the sub-area analysis method, if the study area is small the benefits of a project might be over- or under-estimated. This paper used a nationwide O/D table and network at peak time as a case study. The resulting patterns can differ according to basic data to be used in analysis. So further analysis using the data from metropolitan areas are needed.

• Journal of Korean Society of Transportation
• /
• v.22 no.7 s.78
• /
• pp.99-106
• /
• 2004

This paper presents some comparisons between Cournot-Nash and Stackelberg game in bi-level program, composed of both upper level program and lower level one. The upper level can be formulated to optimize a specific objective function, while the lower formulated to express travelers' behavior patterns corresponding to the design parameter of upper level problem. This kind of hi-level program is to determine a design parameter, which leads the road network to an optimal state. Bi-level program includes traffic signal control, traffic information provision, congestion charge and new transportation mode introduction as well as road expansion. From the view point of game theory, many existing algorithms for bi-level program such as IOA (Iterative Optimization Assignment) or IEA (Iterative Estimation Assignment) belong to Cournot-Nash game. But sensitivity-based algorithms belongs to Stackelberg one because they consider the reaction of the lower level program. These two game models would be compared by using an example network and show some results that there is no superiority between the models in deterministic case, but in stochastic case Stackelberg approach is better than that of Cournot-Nash one as we expect.

• Journal of Korean Society of Transportation
• /
• v.21 no.2
• /
• pp.95-105
• /
• 2003

Because the basic assumptions of deterministic user equilibrium assignment that all network users have perfect information of network condition and determine their routes without errors are known to be unrealistic, several stochastic assignment models have been proposed to relax this assumption. However. it is not easy to solve such stochastic assignment models due to the probability distribution they assume. Also. in order to avoid all path enumeration they restrict the number of feasible path set, thereby they can not preciously explain the travel behavior when the travel cost is varied in a network loading step. Another problem of the stochastic assignment models is stemmed from that they use heuristic approach in attaining optimal moving size, due to the difficulty for evaluation of their objective function. This paper presents a logit-based stochastic assignment model and its solution algorithm to cope with the problems above. We also provide a stochastic user equilibrium condition of the model. The model is based on path where all feasible paths are enumerated in advance. This kind of method needs a more computing demand for running the model compared to the link-based one. However, there are same advantages. It could describe the travel behavior more exactly, and too much computing time does not require than we expect, because we calculate the path set only one time in initial step Two numerical examples are also given in order to assess the model and to compare it with other methods.