• Journal of Power Electronics
• /
• v.2 no.2
• /
• pp.139-145
• /
• 2002

Because conventional switching converters have been usually using unbalanced circuit topologies, parasitice between the drain/collertor of an active switch and frame ground through its heat sink may generate the commom-mode conducted noise. We have proposed a balanced switching converter circuit, whitch is an effective way to reduce the commom-mode converter version of the balanced switching converter was presented and the mechanism of the commom-mode noise reduction was explained using equivalent circuits. This paper extends the concept of the balanced switch converter circuit and presents a buck-boost converter version of the blanced switching converter. The feature of common-mode niose reduction is confirmed by experimental resuits and the mechanisem of the commom-mode niose reduction is explained using equivalent circuits.

• Bulletin of the Korean Mathematical Society
• /
• v.46 no.1
• /
• pp.183-198
• /
• 2009

In this paper, we derive a characterization of orthonormal balanced multiwavelets of order p in terms of the continuous moments of the multiscaling function $\phi$. As a result, the continuous moments satisfy the discrete polynomial preserving properties of order p (or degree p - 1) for orthonormal balanced multiwavelets. We derive polynomial reproduction formula of degree p - 1 in terms of continuous moments for orthonormal balanced multiwavelets of order p. Balancing of order p implies that the series of scaling functions with the discrete-time monomials as expansion coefficients is a polynomial of degree p - 1. We derive an algorithm for computing the polynomial of degree p - 1.

• Bulletin of the Korean Mathematical Society
• /
• v.58 no.6
• /
• pp.1387-1400
• /
• 2021

Suppose that $T=\(\array{A&0\\U&B}\)$ is a formal triangular matrix ring, where A and B are rings and U is a (B, A)-bimodule. Let ℭ₁ and ℭ₂ be two classes of left A-modules, 𝔇₁ and 𝔇₂ be two classes of left B-modules. We prove that (ℭ₁, ℭ₂) and (𝔇₁, 𝔇₂) are admissible balanced pairs if and only if (p(ℭ₁, 𝔇₁), h(ℭ₂, 𝔇₂) is an admissible balanced pair in T-Mod. Furthermore, we describe when ($P^{C_1}_{D_1}$, $I^{C_2}_{D_2}$) is an admissible balanced pair in T-Mod. As a consequence, we characterize when T is a left virtually Gorenstein ring.

• Bulletin of the Korean Mathematical Society
• /
• v.59 no.6
• /
• pp.1327-1337
• /
• 2022

Zero-difference balanced (ZDB) functions can be applied to many areas like optimal constant composition codes, optimal frequency hopping sequences etc. Moreover, it has been shown that the image set of some ZDB functions is a regular partial difference set, and hence provides strongly regular graphs. Besides, perfect nonlinear functions are zero-difference balanced functions. However, the converse is not true in general. In this paper, we use the decomposition of cyclotomic polynomials into irreducible factors over 𝔽_p, where p is an odd prime to generalize some recent results on ZDB functions. Also we extend a result introduced by Claude et al. [3] regarding zero-difference-p-balanced functions over 𝔽_pⁿ. Eventually, we use these results to construct some optimal constant composition codes.

• Food Science of Animal Resources
• /
• v.43 no.2
• /
• pp.374-381
• /
• 2023

In a previous study, 'response surface methodology (RSM) using a fullest balanced model' was proposed to improve the optimization of food processing when a standard second-order model has a significant lack of fit. However, that methodology can be used when each factor of the experimental design has five levels. In response surface experiments for optimization, not only five-level designs, but also three-level designs are used. Therefore, the present study aimed to improve the optimization of food processing when the experimental factors have three levels through a new approach to RSM. This approach employs three-step modeling based on a second-order model, a balanced higher-order model, and a balanced highest-order model. The dataset from the experimental data in a three-level, two-factor central composite design in a previous research was used to illustrate three-step modeling and the subsequent optimization. The proposed approach to RSM predicted improved results of optimization, which are different from the predicted optimization results in the previous research.

• Communications for Statistical Applications and Methods
• /
• v.15 no.2
• /
• pp.235-244
• /
• 2008

Balanced arrays which are generalized orthogonal arrays, introduced by Chakravarti (1956) can be used to construct the fractional factorial designs. Especially for 2-level factorials, balanced arrays with strength 4 are identical to the resolution-V fractional designs. In this paper criteria for evaluation the degree of the orthogonality of balanced arrays of 2-levels with strength 4 are developed and some application methods of the suggested criteria are discussed. As a result, in this paper, we introduce the constructing methods of near orthogonal saturated balanced resolution-V fractional 2-level factorial designs.

• Journal of the Korean Society for Library and Information Science
• /
• v.42 no.2
• /
• pp.277-294
• /
• 2008

This study has proposed the balanced scorecard for the development of BSC of school library; this study has thus analyzed the forerunners of similar research on the balanced scorecard. For the hierarchial process analysis of the balanced scorecard, librarians and experts of related fields were polled using the AHP method. Some of the major categories for the balanced scorecard(36 categories total) are disposition of librarians, development of user-demand reflecting system, user education, adequacy of faculty-education aid accommodation, location of library, etc.

• Journal of Biosystems Engineering
• /
• v.35 no.5
• /
• pp.302-309
• /
• 2010

Aerial application using an unmanned agricultural helicopter would allow precise and timely spraying. The attitude of a helicopter depends on a number of dynamic variables for roll-balanced flight. Laterally tilting behavior of a helicopter is a physically intrinsic phenomenon while hovering and forwarding. In order to balance the fuselage, the rotor should be counter-tilted, resulting in the biased down-wash. The biased spraying toward right side causes uneven spray pattern. In this study, a raised tail rotor system for the roll-balanced helicopter was studied. Thrust of the tail rotor system was measured and theoretically estimated for the fundamental database of the roll-balanced helicopter design. The estimated tail thrust and roll-moment would be used to design the raising height of tail rotor and roll balancing dynamics. The unmanned agricultural helicopter required the tail rotor thrust of about 39.2 N (4.0 kgf) during hovering with a payload of 235.4 N (24 kgf). A raised tail rotor system would compensate for the physical tilt phenomena. A further attitude control system of helicopter would assist roll-balanced aerial spray application.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.15 no.4
• /
• pp.143-152
• /
• 2016

In this paper, a MMIC double balanced mixer that can be applied to the tele-communication band is designed and LO power optimization for the mixer is discussed. The chip of the MMIC double-balanced mixer is fabricated on GaAs substrate with the size of $4{\times}4mm^2$. Optimization study of LO power for the MMIC double-balanced mixer proposed in this paper is conducted for the Input IP3 (IIP3) regarding on the linearity of the input signal. When LO power level of+16 dBm is applied to the mixer, IIP3 is obtained to be approximately 23.2 dBm, which is the most outstanding characteristic.

• Journal of IKEEE
• /
• v.22 no.3
• /
• pp.850-853
• /
• 2018

In this paper, we propose a decoding method using a balanced binary tree and a canonical Huffman tree for efficient decoding of Huffman codes. The balanced binary tree scheme reduces the number of searches by lowering the height of the tree and binary search. However, constructing a tree based on the value of the code instead of frequency of symbol is a drawback of the balanced binary tree. In order to overcome these drawbacks, a balanced binary tree is reconstructed according to the occurrence probability of symbols at each level of the tree and binary search is performed for each level. We minimize the number of searches using a canonical Huffman tree to find level of code to avoid searching sequentially from the top level to bottom level.