• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 하계종합학술대회논문집
• /
• 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
• /
• 제19권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.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 추계종합학술대회 논문집
• /
• 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.

• 한국통신학회논문지
• /
• 제29권1B호
• /
• pp.18-28
• /
• 2004

라우터에서의 어드레스 검색은 일초에 수천만개 이상으로 입력되는 패킷에 대하여 실시간으로 처리되어야하기 때문에 인터넷 라우터는 효율적인 IP 어드레스 검색 구조를 갖도록 설계되어야 한다. 본 논문에서는 [1]에서 제안된 IP prefix의 binary tree에 기초한 효율적이면서 실용적인 IP 어드레스 검색 구조와 이를 구현하는 하드웨어 구조를 제안한다. 제안된 구조는 (1)에서 제안된 binary tree의 문제점들을 해결하는 구조로서 작은 수의 엔트리를 갖는 TCAM과 pipelined binary search를 적용하여 효율적인 하드웨어로 구현되었다. 구현된 하드웨어 구조의 성능을 평가하여 본 결과., 약 30,000 여개의 entry를 갖는 MAE-WEST 라우터 데이타의 경우, 2,000여개의 엔트리를 갖는 TCAM과 총 245 Kbyte의 SRAM을 사용하여 한번의 메모리 access를 통하여 어드레스 검색이 가능한 것으로 평가되었다. 또한 제한된 방식은 큰 데이터베이스나 IPv6를 위해서도 확장이 용이하다.

• 전자공학회논문지B
• /
• 제31B권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
• /
• 제12권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.

• 한국통신학회논문지
• /
• 제33권12B호
• /
• pp.1103-1111
• /
• 2008

라우터는 입력되는 패킷을 인터넷 주소 검색을 통하여 패킷의 목적지로 향하는 포트로 포워딩하는 역할을 하는데, 입력되는 속도와 같은 속도로 패킷을 포워딩하기 위해서는 매우 빠른 검색을 제공할 필요가 있다. 본 논문에서는 이진 검색을 이용한 IP 주소 검색구조에 대해 연구하였다. 대부분의 이진 검색 알고리즘들은 균형 이진 검색을 진행하지 않아 과도한 메모리 접근을 야기함으로써 검색속도가 느린 단점이 있다. 한편 영역분할을 이용한 이진 검색 알고리즘은 매우 빠른 검색 성능을 보이지만, 메모리 요구량이 크다는 단점이 있다. 본 논문에서는 영역분할 이진 검색에서 불필요한 엔트리와 항목을 삭제함으로써 라우팅 테이블의 크기를 최적화하여 메모리 요구량을 감소시키는 방법에 대하여 연구하였다. 이러한 최적화를 통하여 프리픽스의 개수와 비슷하거나 적은 수의 엔트리를 갖는 영역분할 이진 검색 라우팅 테이블을 구성할 수 있음을 보였다. 실제 사용되는 다양한 크기의 라우팅 테이블을 이용하여 영역분할 이진 검색의 원래 구조와 최적화된 구조의 검색 성능을 비교하였으며, 다른 여러가지 이진 검색 알고리즘과의 성능을 비교하였다.

• 전력전자학회:학술대회논문집
• /
• 전력전자학회 1999년도 전력전자학술대회 논문집
• /
• 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.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2005년도 학술대회 논문집 전문대학교육위원
• /
• 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.

• 한국조명전기설비학회지:조명전기설비
• /
• 제9권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.