• 한국ITS학회:학술대회논문집
• /
• 2002.11a
• /
• pp.67-71
• /
• 2002

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.11
• /
• pp.5455-5475
• /
• 2016

In this article, we model the distributed relay assignment network as a many-to-one matching market with peer effects. We discuss two scenarios for throughput optimization of relay networks: the scenario of aggregate throughput optimization and the scenario of fairness performance optimization. For the first scenario, we propose a Mutual Benefit-based Deferred Acceptance (MBDA) algorithm to increase the aggregate network throughput. For the second scenario, instead of using the alternative matching scheme, a non-substitution matching algorithm (NSA) is designed to solve the fairness problem. The NSA improves the fairness performance. We prove that both two algorithms converge to a globally stable matching, and discuss the practical implementation. Simulation results show that the performance of MBDA algorithm outperforms existing schemes and is almost the same with the optimal solution in terms of aggregate throughput. Meanwhile, the proposed NSA improves fairness as the scale of the relay network expands.

• Korean Journal of Computational Design and Engineering
• /
• v.18 no.3
• /
• pp.224-233
• /
• 2013

For the scheduling and the job assignment of the ship hull production design which is a process-based work, we suggest the simulation-based scheduling using the discrete-event-based business process simulation. First, we analyze the ship hull production design process from the perspective of a job assignment to make it into the simulation model using DEVS (Discrete Event System Specification) which is the representative modeling method for a discrete-event simulation. Based on the APIs of the open-source discrete-event simulation engine, we implement the simulation using the Groovy script. We develop the scenario generator in which the user defines detail information of the construction drawing and its member blocks, and design engineers information, and the various setting for the simulation including the job assignment strategy. We use the XML files from this scenario generator as inputs of simulation so that we can get simulation result in forms of Gantt chart without changes of the simulation model.

• Smart Structures and Systems
• /
• v.8 no.2
• /
• pp.205-217
• /
• 2011

This article describes the research work involving the implementation of an Active Bracing System aimed at the modification of the initial dynamics of a laboratorial building structure to a new desired dynamics. By means of an adequate control force it is possible to assign an entirely new dynamics to a system by moving its natural frequencies and damping ratios to different values with the purpose of achieving a better overall structural response to external loads. In Civil Engineering applications, the most common procedures for controlling vibrations in structures include changing natural frequencies in order to avoid resonance phenomena and increasing the damping ratios of the critical vibration modes. In this study, the actual implementation of an active system is demonstrated, which is able to perform such modifications in a wide frequency range; to this end, a plane frame physical model with 4 degrees-of-freedom is used. The Active Bracing System developed is actuated by a linear motor controlled by an algorithm based on pole assignment strategy. The efficiency of this control system is verified experimentally by analyzing the control effect obtained with the modification of the initial dynamic parameters of the plane frame and observing the subsequent structural response.

• Journal of Institute of Control, Robotics and Systems
• /
• v.10 no.2
• /
• pp.145-152
• /
• 2004

In this paper, an S(stochastic)-eigenvalue and its corresponding S-eigenvector concept for linear continuous-time systems with probabilistic uncertainties are proposed. The proposed concept is concerned with the perturbation of eigenvalues due to the stochastic variable parameters in the dynamic model of a plant. An S-eigenstructure assignment scheme via the Sylvester equation approach based on the S-eigenvalue/-eigenvector concept is also proposed. The proposed control design scheme based on the proposed concept is applied to a longitudinal dynamics of an open-loop-unstable aircraft with possible uncertainties in aerodynamic and thrust effects as well as separate dynamic pressure effects. These results explicitly characterize how S-eigenvalues in the complex plane may impose stability on the system.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.7-12
• /
• 2003

In this paper, S(stochastic)-eigenvalue concept and its S-eigenvector for linear continuous-time systems with probabilistic uncertainties are proposed. The proposed concept is concerned with the perturbation of eigenvalues due to the probabilistic variable parameters in the dynamic model of a plant. S-eigenstructure assignment scheme via the Sylvester equation approach based on the S-eigenvalue concept is also proposed. The proposed design scheme is applied to the longitudinal dynamics of open-loop-unstable aircraft with possible uncertainties in aerodynamic and thrust effects as well as separate dynamic pressure.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.3
• /
• pp.492-504
• /
• 1994

In ATM network was two QOS bearer services for flexible bandwidth assignment, various priority assignment buffer access mechanisms have been sugested. In this paper, a performance model with 3 state discrete time Markov proess in explicit priority assignment is suggested and cell loss probability is analytically derived. Also flexible space priority control mechanism with partial buffer sharing is studied and verified by simulation with OPNET.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.2
• /
• pp.628-646
• /
• 2016

This paper proposes a novel channel assignment scheme that is based on finite projective plane (FPP) theory. The proposed scheme involves using a Markov chain model to allocate N channels to N users through intermixed channel group arrangements, particularly when channel resources are idle because of inefficient use. The intermixed FPP-based channel group arrangements successfully related Markov chain modeling to punch through ratio formulations proposed in this study, ensuring fair resource use among users. The simulation results for the proposed FPP scheme clearly revealed that the defined throughput increased, particularly under light traffic load conditions. Nevertheless, if the proposed scheme is combined with successive interference cancellation techniques, considerably higher throughput is predicted, even under heavy traffic load conditions.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.11 no.17
• /
• pp.39-46
• /
• 1988

This Paper is concerned with a man-multi machine assignment problem to minimize idle time. Assuming different types of semi-automatic machines with deterministic service-processing time, the problem approaches by sequential dependent one operator can handle several machines, where determine optimal range the cost of idle labor and machine time is to be minimized in preparing a work schedule. The Procedure, to establish man-machine assignment model, and it's results are: (1) Objective function to minimize opportunity loss cost, which is happened by idle time, is verified recursive process through heuristic method. (2) The algorithm, is programmed by BASIC language for personal computer, and a numerical example is given to illustrate the heuristic algorithm. This study will be helpful to enhance productivity of Shopflooras a result of increasing the efficiencies of both operator and machine.

• 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.