• Journal of Korean Institute of Industrial Engineers
• /
• v.19 no.3
• /
• pp.51-57
• /
• 1993

This paper develops 0($n^3$) algorithm to construct a cut-tree generated by Gomory-Hu algorithm. The algorithm only requires node sets defined by the minimal cut in each of the (n-1) maximal flow determinations. Merging computerized facility layout procedure that uses cut-tree concept to generate design skeletons with our algorithm requires less storage space than merging it with Gomory-Hu algorithm. Also, the cut-tree can easily be modified when the (n-1) minimal cut-sets are updated due to changes on arc capacities.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.39.2-39
• /
• 2001

This paper describes the design of an output-feedback controller based on an adaptive fuzzy observer for uncertain single-input single-output nonlinear dynamical systems. Especially, we have focused on the realization of minimal dynamic order of the adaptive fuzzy observer. For the purpose, we propose a new method in which no strictly positive real(SPR) condition is needed and combine dynamic rule activation scheme with on-line estimation of fuzzy parameters. By using proposed scheme, we can reduce computation time, storage space, and dynamic order of the adaptive fuzzy observer ...

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• pp.264-267
• /
• 1991

In this paper, a new application method of the Kalman filter to desigin a gyro is proposed. The role of a gyro is the estimation of an input rate with minimal error covariance. The size of the error covariance depends on gyro's parameters, which makes it possible to use the parameters of gyro to minimze the estimation error covariance. Numerical analysis shows that the error covariance becomes smaller as the spin axis momentum becomes larger and the damping coefficient smaller, but production cost must be considered. Through numerical analysis the parameter set for an acceptable - performance gyro with small cost can be selected.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.7 no.3
• /
• pp.95-99
• /
• 2008

This paper proposes a new minimal resource high-level synthesis algorithm for low power design automation. The proposed algorithm executes an efficient approach to minimize the power consumption of the functional units in a circuit during the high level synthesis. In this paper, we visit all control steps one by one to reduce the switching activity in CDFG. The register sharing algorithm determines the minimum register after the life time analysis of all variable. According to property of input signal for functional unit, the proposed method visits all control step one by one and determines the resource allocation with minimal power consumption at each control step in a greedy fashion. The effect of the proposed algorithm has been proved through various filter benchmark to adopt a new scheduling and allocation algorithm considering the low rover.

• Proceedings of the Korean Institute Of Construction Engineering and Management
• /
• 2004.11a
• /
• pp.170-173
• /
• 2004

The law about floor impact sound goes into effect from March 23th in 2004 and is applying to new designs. According to the new law, the minimal of slab thickness is 180mm by standard floor structure and the new law presents about the minimal standard about heavy-weight impact sound. Also, It presents about classification of light-weight sound separate the minimal standard, so demand of consumers can be accepted. But a working plan of classification about light-weight sound is not presented in accordance with field test, so the problem that design can't be achieved although the aim of design is formed. This study shows contents to investigate for working of classification and will be helpful to designers and construction corporations.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.25 no.10
• /
• pp.1077-1086
• /
• 2014

We propose a design method of a Rotman lens for curved array antenna applicable to conformal array. In this paper, design equations are derived to obtain an array curve, transmission line lengths of a Rotman lens in conjunction with a curved array antenna, and the phase error of a Rotman lens based on these design equations is minimized through the beam curve optimization procedure and the refocusing procedure. Rotman lenses designed by the proposed design equations and design procedures still maintain 3 focal points, can feed a convex or concave array antenna with circular curve, parabolic curve, V-shaped curve, etc as well as a straight line array antenna, and have minimal phase error.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.655-658
• /
• 2005

Due to reduced device sizes and threshold voltages, leakage current becomes an important issue in CMOS design. In a CMOS combinational logic circuit, the leakage current in the standby state depends on the state of the inputs and thus can be minimized by applying an optimal input when the circuit is idling. In this paper, we present a New Input Vector Control algorithm, called Leakage Minimization by Input vector Control (LMIC) for minimal leakage power. This algorithm finds the minimal leakage vector and reduces leakage current up to 22.% on the average, for TSMC 0.18um process parameters. Minimal leakage vectors are very useful in reducing leakage currents in standby mode of operation.

• Journal of the Korean Data and Information Science Society
• /
• v.3 no.1
• /
• pp.47-63
• /
• 1992

Bechhofer and Tamhane(1981) proposed Balanced Treatment Incomplete Block (BTIB) desings for comparing p test treatments with a control treatment in blocks of size ${\kappa}$. Notz and Tamhane(1983) solved the problem about determination of the minimal complete class for ${\kappa}=3$. However there are a number of design parameters for which BTIB designs do not exist. We suggest a new class of designs called Group Divisible Treatment Desings(GDTD's) that is a larger class including BTIB designs as a subclass. In this paper we give the minimal complete classes of generator designs for GDTD's with ${\kappa}=2,\;p{\geq}4(except\;prime\;number)\;and\;{\kappa}=3,\;p=4(2)6$.

• Journal of the Korean Statistical Society
• /
• v.32 no.3
• /
• pp.235-244
• /
• 2003

In unreplicated factorial or fractional factorial experiments, the presence of one or more outliers can seriously affect the analysis of variance. Using the normal plot of t residuals to identify outliers in factorial or fractional factorial is an easy method to find these dubious points. In some cases, the t residuals form the identical pairs. One can not tell from the plot which is doubtful. This phenomenon occurs for all minimal designs of resolution IV, which fits the model containing all main effects and some two-factor interactions, whether it is orthogonal or not. In these kinds of models, when we drop one point or two points (not foldover pair) from the fraction, the phenomenon of identical pairs of t residuals may still occur. In this paper, the theoretical background of the phenomenon and its sequences will be investigated in detail.

• Journal of information and communication convergence engineering
• /
• v.21 no.4
• /
• pp.300-305
• /
• 2023

Audience reactions in response to remote virtual performances must be compressed before being transmitted to the server. The server, which aggregates these data for group insights, requires a distribution code for the transfer. Recently, distributed learning algorithms such as federated learning have gained attention as alternatives that satisfy both the information security and efficiency requirements. In distributed learning, no individual user has access to complete information, and the objective is to achieve a learning effect similar to that achieved with the entire information. It is therefore important to distribute interdependent information among users and subsequently aggregate this information following training. In this paper, we present a new extension technique for minimal code that allows a new minimal code with a different length and Hamming weight to be generated through the product of any vector and a given minimal code. Thus, the proposed technique can generate minimal codes with previously unknown parameters. We also present a scenario wherein these combined methods can be applied.