• Journal of Information Technology Applications and Management
• /
• v.9 no.1
• /
• pp.27-44
• /
• 2002

Performance evaluations of database algorithms are usually conducted on a set of queries for a given test database. For more detailed evaluation results, it is often necessary to use different query workloads several times. Each query workload should reflect the querying patterns of the application domain in real world, which are non-uniform in the usage frequencies of attributes in queries of the workload for a given database. It is not trivial to generate many different query workloads manually, while considering non-uniform distributions of attributes'usage frequencies. In this paper we propose a technique to generate non-uniform distributions, which will help construct query workloads more efficiently. The proposed algorithm generates a query-attribute usage distribution based on given constraints on usage frequencies of attributes and qreries. The algorithm first allocates as many attributes to queries as Possible. Then it corrects the distribution by considering attributes and queries which are not within the given frequency constraints. We have implemented and tested the performance of the proposed algorithm, and found that the algorithm works well for various input constraints. The result of this work could be extended to help automatically generate SQL queries for various database performance benchmarking.

• Journal of Industrial Technology
• /
• v.27 no.A
• /
• pp.69-76
• /
• 2007

The body of an excavator, one sort of the construction equipment, consists of mainframe part, track frame part, boom part and arm part. The all parts are manufactured in the body welding operation. The scheduling in the body welding operation of a construction equipment manufacturing is to take all the various constraints into consideration. The offset time, due date, daily capacity of operations, daily jig's capacity, precedence relation, outsourcing, alternative resource and all of the shop floor environment should be considered. An APS(Advanced Planning & Scheduling) system is a proper and efficient system in such circumstance. In this paper, we present an APS system, the optimal scheduling system for the construction equipment manufacturing specifically for the body welding operation, using ILOG Solver/Scheduler. ILOG Solver/Scheduler is a general purposed commercial software which supports to find a feasible or optimal solution using object oriented technique and constraints satisfaction programming, given constraints and objectives.

• Proceedings of the KIEE Conference
• /
• 2000.07d
• /
• pp.2495-2497
• /
• 2000

Level control in the steam generator of a nuclear power plant is important process. But, the low power operation of nuclear power plant causes nonlinear characteristics and non minimum phase characteristics (swell and shrink), change of delay. So, we can't lead good results with conventional PID controller. Particularly, the design of controller with constraints is necessary. This paper introduces MPC(Model Predictive Control) with constraints and designs a good performance MPC controller in spite of the input constraints and nonlinear characteristics, non-minimum phase characteristics

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.17 no.9
• /
• pp.2153-2161
• /
• 1993

Self-tuning control algorithms for an input-amplitude constrained system are developed and implemented. Magnitude of control input for small motors is generally restricted to narrow bound due to actuator saturation. The gain-adjusted control algorithm and the bounded-gain control algorithm proposed in this study yield smoother control input variations within the magnitude constraints comparing with the existing Clarke's suboptimal control algorithm. In the gain-adjusted control algorithm, the feedforward gain is adjusted using maximum gain, while in the bounded-gain control algorithm, the feedforward gain is bounded using weighting factor. For the DC servo motor control, the system performances of the proposed algorithms are compared with those of the existing algorithm by computer simulation and experiment. It is shown that the input variations of the proposed algorithms are smoother as compared with the existing algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• 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.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.1169-1172
• /
• 1996

A time-optimal control law for quick, strongly nonlinear systems has been developed and demonstrated. This procedure involves the utilization of neural networks as state feedback controllers that learn the time-optimal control actions by means of an iterative minimization of both the final time and the final state error for the known and unknown systems with constrained inputs and/or states. The nature of neural networks as a parallel processor would circumvent the problem of "curse of dimensionality". The control law has been demonstrated for a velocity input type motor identified by a genetic algorithm called GENOCOP.

• Proceedings of the KIEE Conference
• /
• 1989.11a
• /
• pp.445-449
• /
• 1989

Achievement of a straight line motion in the Cartesian space has a matter of great importance. Minimization of task execution time with linear interpolation in the joint space, accomplishing of a approximation of straight line motion in the Cartesian coordinate is considered as the prespecified task. Such determination yields minimum time joint-trajectory subject to input torque constraints. The applications of these results for joint-trajectory planning of a two-link manipulator with revolute joints are demonstrated by computer simulations.

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.83.4-83
• /
• 2002

$\bullet$ We present a state-feedback RHC for discrete-time TS fuzzy systems with input constriants. $\bullet$ The controller employ the current and one-step past information on the fuzzy weighting functions. $\bullet$ It is obtained from the finite horizon optimization problem with the invariant ellipsoid constraint $\bullet$ Under parameterized LMI conditions on the terminal weighting matrix $\bullet$ The closed-loop system stability is guaranteed. $\bullet$ The parameterized linear matrix inequalities are relaxed to a finite number of solvable LMIs.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.5
• /
• pp.753-761
• /
• 1987

Approximation of a Cartesian straight line motion with linear interpolation in the joint space has many desirable advantages and applications. But inappropriate determination of the corresponding subtravelling and transition times makes such joint-trajectories violate the input torque/force constraints. An approach that can overcome this difficult and yield the joint trajectories utilizing the allowable maximum input torque/force is established in this paper. The effectiveness of these results is demonstrated by using a three-joint revolute manipulator.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.6
• /
• pp.1148-1159
• /
• 1997

In the broadband integrated service digital networks (B-ISDN), ATM switches hould be abld to accommodate diverse types of applications ith different traffic characteristics and quality ddo services (QOS). Thus, in order to increase the utilization of switches and satisfy the QOS's of each traffic type, some types of priority control schemes are needed in ATM switches. In this paper, a nonblocking input and output queueing ATm switch with capacity C is considered in which two classes of traffics with different loss probability constraints are admitted. 'Partial push-out' algorithm is suggested as a loss priority control schemes, and the performance of this algorithm is analyzed when this is adopted in input buffers of the switch. The quque length distribution of input buffers and loss probabilities of each traffic are obtained using a matrix-geometric solution method. Numerical analysis and simulation indicate that the utilization of the switch with partial push-out algorithm satisfying the QOS's of each traffic is much higher than that of the switch without control. Also, the required buffer size is reduced while satisfying the same QOS's.