• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1997년도 한국자동제어학술회의논문집; 한국전력공사 서울연수원; 17-18 Oct. 1997
• /
• pp.199-202
• /
• 1997

In this paper, a novel disturbance observer is proposed in order to regulate the disturbance in motor systems. The proposed observer does not require the implementation of ideal derivative of the state since the inverse of the nominal model is not used in the design of the observer. The transfer gain from a disturbance to the output of the disturbance observer is one. So, there is no time-delay in the response due to the dynamics of the observer.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.1911-1916
• /
• 2003

Parameter set of an LPV system is divided into a number of subsets so that robust feedback gains may be designed for each subset of parameters. A concept of quasi-invariant set is introduced, which allows finite steps of delay in reentrance to the set. A feasible and positively invariant set with respect to a gain-scheduled state feedback control can be easily obtained from the quasi-invariant set. A receding horizon control strategy can be derived based on this feasible and invariant set.

• Journal of applied mathematics & informatics
• /
• 제2권2호
• /
• pp.21-46
• /
• 1995

Congestion and memory occupancy in computer system may be reduced further if new jobs are admitted only when the num-ber of jobs queued at CPU is below CPU run queue cutoff (RQ). In this paper we prove that response time of a job is invariant with respect to RQ if jobs do not communicate each other. We also demonstrate this invariance property numerically using marix-geometric methods and present an approximate method for the delay due to context switch-ing under time slicing. The approximation suggests that time slicing with constant overhead yields a throughput similar to an FCFS system without overhead.

• Journal of applied mathematics & informatics
• /
• 제28권1_2호
• /
• pp.275-282
• /
• 2010

This paper analyzes a discrete-time bulk-service queue with probabilistic bulk size, where the service process is interrupted by a Markov chain. We study the joint probability generating function of system occupancy and the state of the Markov chain. We derive several performance measures of interest, including average system occupancy and delay distribution.

• Journal of Communications and Networks
• /
• 제8권1호
• /
• pp.21-27
• /
• 2006

We present and analyze a class of limited sensing random access algorithms with powerful properties. The algorithms are implementable in wireless mobile environments and their operational properties are simple. Their throughput in the worst case of the limit Poisson user model is 0.4297, while this throughput degrades gracefully in the presence of channel feedback errors.

• 대한전기학회논문지
• /
• 제36권10호
• /
• pp.713-718
• /
• 1987

A new method for the modeling of non-ideal dc-dc converters whose switching times are finite is proposed. The effects of finite turn-on, turn-off times, delay time, storage time, reverse recovery process on the system stability, dc transfer function and efficiency are investigated. It is verified how system poles are changed and how dc transfer function and efficiency are decreased by non-ideal switching.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2001년도 하계종합학술대회 논문집(1)
• /
• pp.85-88
• /
• 2001

In this paper, we propose a retransmission based error control scheme in which a stop-and-wait ARQ is simultaneously performed in two adjacent layers for the node-to-node error control. We develop an analytical numerical method to calculate the probability of error remains and the moments of the high layer message delay time at steady state. Using the analytical method, we investigate the performance of double-layered ARQ scheme with respect to the properties of the employed CRC codes and the characteristics of the involved channel.

• Journal of applied mathematics & informatics
• /
• 제22권1_2호
• /
• pp.453-460
• /
• 2006

A discrete-time priority queueing system with place reservation discipline is studied, in which two different types of packets arrive according to batch geometric streams. It is assumed that there is a reserved place in the queue. Whenever a high-priority packet enters the queue, it will seize the reserved place and make a new reservation at the end of the queue. Low-priority arrivals take place at the end of the queue in the usual way. Using the probability generating function method, the joint distribution of system state and the delay distribution for each type are obtained.

• Journal of Communications and Networks
• /
• 제9권4호
• /
• pp.383-393
• /
• 2007

We present a new network-layer architecture that provides generalized addressing. The forwarding infrastructure is independent of the addressing architecture, so multiple addressing architectures can be used simultaneously. We compare our solution with the existing Internet protocols for unicast and multicast services, given the address assignment used in the Internet. By means of an extensive simulation study, we determine the range of parameters for which the overhead costs(delay, state, and network load) of our service are comparable to those of the Internet.

• 대한전기학회논문지
• /
• 제37권6호
• /
• pp.368-375
• /
• 1988

This paper is concerned with the design of the optimal gains of the controller in the speed control system for the induction motor controlled by the microprocessor. The system is modelled with the discrete-time state equation, considering the time delay, for the facility of the optimization techniques. Introducing the conjugate gradient descent method, as the optimization technique, are derived the optimal gains, the gains which give the best transient characteristics. At the optimal gains obtained, the theoretcal transient responses are verified by experimental ones on a 5HP induction motor drive system.