• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.289-292
• /
• 1998

Trees are the underlying structure for divide-and-conquer algorithms and the graphs that provide the solution spaces for NP-complete problems. Complete binary trees are the basic structure among trees. Therefore, if complete binary trees can be embedded in binomial trees, the algorithms which are provided by complete binary trees can be performed efficiently on the interconnection networks which have binomial trees as their subgraphs or in which binomial trees can be embedded easily. In this paper, we present dilation 2 embedding of complete binary trees in binomial trees.

• Journal of the Korean Data and Information Science Society
• /
• v.19 no.2
• /
• pp.413-420
• /
• 2008

This paper suggests a marginal logit mixed-effects for analyzing repeated binary response data. Since binary repeated measures are obtained over time from each subject, observations will have a certain covariance structure among them. As a plausible covariance structure, 1st order auto-regressive correlation structure is assumed for analyzing data. Generalized estimating equations(GEE) method is used for estimating fixed effects in the model.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.479-482
• /
• 1998

Whether a given tree is a subgraph of the interconnection network topology is one of the important problem in parallel computing. Trees are used as the underlying structure for divide and conquer algorithms and provide the solution spaces for NP-complete problems. Complete binary trees are the basic structure among those trees. Binomial trees play an important role in broadcasting messages in parallel networks. If binomial trees can be efficiently embedded in complex binary trees, broadcasting algorithms can be effeciently performed on the interconnection networks. In this paper, we present average dilation 2 embedding of binomial trees in complete binary trees.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.1B
• /
• pp.18-28
• /
• 2004

Efficient hardware implementation of address lookup is one of the most important design issues of internet routers. Address lookup significantly impacts router performance since routers need to process tens-to-hundred millions of packets per second in real time. In this paper, we propose a practical IP address lookup structure based on the binary tree of prefixes of different lengths. The proposed structure produces multiple balanced trees, and hence it solve the issues due to the unbalanced binary prefix tree of the existing scheme. The proposed structure is implemented using pipelined binary search combined with a small size TCAM. Performance evaluation results show that the proposed architecture requires a 2000-entry TCAM and total 245 kbyte SRAMs to store about 30,000 prefix samples from MAE-WEST router, and an address lookup is achieved by a single memory access. The proposed scheme scales very well with both of large databases and longer addresses as in IPv6.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.12
• /
• pp.100-107
• /
• 1994

This article describes the hardware design scheme of Hamming MAXNET algorithm which is appropriate for binary pattern classification with minimum HD measurement between stimulus vector and storage vector. Circuit integration is profitable to Hamming MAXNET because the structure of hamming network have a few connection nodes over the similar neuro-algorithms. Designed hardware is the two-layered structure composed of hamming network and MAXNET which enable the characteristics of low power consumption and fast operation with biline volgate sensing scheme. Proposed Hamming MAXNET hardware was designed as quantize-level converter for simulation, resulting in the expected binary pattern convergence property.

• Geomechanics and Engineering
• /
• v.12 no.4
• /
• pp.639-655
• /
• 2017

The binary mixture consists of two types of granular media with different physical attributes and sizes, which can be characterized by the percentage of large granules by weight (P) and the particle size ratio (${\alpha}$). Researchers determine that two thresholds ($P_S$ and $P_L$) exist for the peak shear strength of binary mixtures, i.e., at $P{\leq}P_S$, the peak shear strength is controlled by the small granules; at $P{\leq}P_L$, the peak shear strength is controlled by the large granules; at $P_S{\leq}P{\leq}P_L$, the peak shear strength is governed by both the large and small granules. However, the thresholds of binary mixtures with different ${\alpha}$ values, and the explanation related to the inner details of binary mixtures to account for why these thresholds exist, require further confirmation. This paper considers the mechanical behavior of binary mixtures with DEM analysis. The thresholds of binary mixtures are found to be strongly related to their coordination numbers $Z_L$ for all values of ${\alpha}$, where $Z_L$ denotes the partial coordination number only between the large particles. The arrangement structure of the large particles is examined when P approaches the thresholds, and a similar arrangement structure of large particles is formed in both 2D and 3D particle systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.12B
• /
• pp.1103-1111
• /
• 2008

Internet routers forward an incoming packet to an output port toward its final destination through IP address lookup. Since each incoming packet should be forwarded in wire-speed, it is essential to provide the high-speed search performance. In this paper, IP address lookup algorithms using binary search are studied. Most of the binary search algorithms do not provide a balanced search, and hence the required number of memory access is excessive so that the search performance is poor. On the other hand, binary-search-on-range algorithm provides high-speed search performance, but it requires a large amount of memory. This paper shows an optimized binary-search-on-range structure which reduces the memory requirement by deleting unnecessary entries and an entry field. By this optimization, it is shown that the binary-search-on-range can be performed in a routing table with a similar or lesser number of entries than the number of prefixes. Using real backbone routing data, the optimized structure is compared with the original binary-search-on-range algorithm in terms of search performance. The performance comparison with various binary search algorithms is also provided.

• Proceedings of the KIPE Conference
• /
• 1999.07a
• /
• pp.18-21
• /
• 1999

This paper presents a speed and position sensorless control of permanent magnet synchronous motors using an integral binary observer. In order to improve the steady state performance of the binary observer, the binary observer is formed by adding extra integral dynamics to the switching hyperplane equation. The observer structure and its deign method are described. The experimetntal results of the proposed algorithm are presented to demonstrate the effectiveness of the approach.

• Proceedings of the KIEE Conference
• /
• 2005.10a
• /
• pp.161-164
• /
• 2005

In this paper, a new estimation algorithm for the rotor speed for SRM drives is described. The algorithm is implemented by the binary observer. The stability and robustness of the binary observer for the parameter variations of the SRM are proved by variable structure control theory. Variable speed control of the SRM is accomplished by the estimated speed. Experiment results verify that the binary observer is able to estimate the speed.

• The Proceedings of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.9 no.4
• /
• pp.55-61
• /
• 1995

Variable structure control (VSC) can be used for the control of power plants required stability and robustness such as elevator control. It has no overshoot and is insensitive to parameter variations and disturbances in the sliding mode where the system structure is changed with the sliding surface in the center. But in the real system, VSC has a high frequency chattering which has a bad influence upon the control system proformances. In this paper, to alleviate the high frequency chattering, a binary controller (BC) with inertial type external loop is implemented by DSP and applied to position control of brushless DC motor. Binary controller has external loop to generate the continuous control input with the flexible variation of primary loop gain. Thus it has the property of chattering alleviation in addition to advantages of the conventional variable structure control.