• 전기의세계
• /
• 제18권4호
• /
• pp.7-15
• /
• 1969

In this method the condenser excite winding has the phase angle of 90 electrical degree, with the load winding in stator. The condenser excite wing is connected with the condenser while the load winding is with the full rectifer. Direct and quardrature axis components of rotating field winding are composed, of balanced two phase winding, and each one of them is connected with half wave rectifiers. Initically, small amount of lead current can be induced at the condenser excite winding by residual magnetism of rotor. The induced lead current forces the rotating field winding to be excited by synchronous alternating magnetic field. The speed electromotive force, there for, induced in rotating field winding shall electro magnetize the rotating field pole by rotating half wave rectifiers. In the case of the charging generator directly coupled with engines at the operation of wide range speed, the generated region, such as vehicles, aircraft, ships etc, is occured. In conclusion, we can take the advantage of, omitting of voltage regurator and current limiter for charging load and reducing the consumption of fuel using the generated region which can be devided in to Impossible generated region, Generated region, and suspension generated region.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2006년 학술대회 논문집 정보 및 제어부문
• /
• pp.476-478
• /
• 2006

A prescaler is an essential building block for PLL-based frequency synthesizers and must satisfy high-speed and low-power characteristics. The design of D-flip flips used in the prescaler implementation is thus critical. In this paper a 64/65, 128/129 dual-modulus prescaler is designed using a $0.25{\mu}m$ CMOS process. In the design a new dynamic D-flip flop is employed, where glitches are minimized using discharge suppression scheme, speed is improved by making balanced propagation delay, and low power consumption is achieved by removing unnecessary discharge. The designed prescaler operates up to 2.5GHz and consumes 3.1mA at 2.5GHz operation.

• 한국철도학회:학술대회논문집
• /
• 한국철도학회 2008년도 춘계학술대회 논문집
• /
• pp.1182-1187
• /
• 2008

In this research, studied were performance improvements of the power conversion system for the high speed EMU. The object of this research is separated into two parts ; the one is the analysis of the designed transformer and the other is the switching improvement of a parallel PWM converter. The multi-outputs of a transformer must be balanced. However, the output of transformer is interfered and unbalanced in practical operation. To solve these problems, the electromagnetic analyzing model of a transformer is used to minimize the output interference. Also, the improvement of converter switching can reduce the unbalanced output and harmonics.

• 한국소성가공학회:학술대회논문집
• /
• 한국소성가공학회 2005년도 금형가공,미세가공,플라스틱가공 공동 심포지엄
• /
• pp.132-140
• /
• 2005

It is well known that the family-mold has an advantage to reduce the cost for production and mold. However, defects are frequently occurred by over packing the smaller volume cavity during molding, especially whorl the family-mold has a volumetric difference between two cavities. In this study, we confirmed the cavity-filling imbalance by the temperature and the pressure sensors, and developed a variable-runner system for the cavity-filling balance. We carried out experiments fur balancing the cavity filling in the family-mold with the variable-runner system, and confirmed a balanced cavity-filing through analyzing the temperature and pressure change in each cavity as the cross-sectional area of the runner changed. We also examined the influence of the injection-speed to the balancing-capability of the variable-runner system in the experiment.

• 한국정보과학회논문지:정보통신
• /
• 제36권1호
• /
• pp.57-67
• /
• 2009

인터넷 라우터에서의 패킷 포워딩은 라우팅 테이블에 저장되어 있는 다양한 길이의 프리픽스들 중, 입력된 패킷의 목적지 주소와 가장 길게 일치하는 프리픽스를 찾아 그 프리픽스가 지정하는 출력 포트로 입력된 패킷을 내 보내주는 일련의 과정을 말한다. 패킷 포워딩 속도의 관건은 IP 주소 검색 성능이라 할 수 있는데, 고속의 IP 주소 검색을 제공하기 위해서는 포워딩 테이블을 저장하기 위한 효율적인 데이타 구조 및 우수한 검색 알고리즘이 필수적이라 할 수 있다. 본 논문에서는 이진 검색 트리를 이용한 주소 검색 알고리즘에 주목한다. 기존에 나와 있는 모든 이진 검색 알고리즘은 균형 검색을 제공하지 못하여 효율적이지 못하고, 프리픽스 영역에 대한 이진 검색 알고리즘은 균형 검색을 제공하나 프리픽스 개수보다 많은 수의 포워딩 엔트리를 저장하여 또한 효율적이지 못하다. 본 논문에서는 효율적인 IP 주소 검색을 위하여 완전 균형 트리 구조를 만들어 이진 검색을 수행하는 알고리즘을 제안하고, 그 성능을 평가하여 기존의 다른 주소 검색 알고리즘과 비교한다. 성능 평가 결과 본 논문에서 제안하는 알고리즘은 메모리 요구량의 증가 없이 검색 속도가 매우 향상됨을 보았다.

• 한국컴퓨터정보학회논문지
• /
• 제22권4호
• /
• pp.25-32
• /
• 2017

Recently, the use of NAND flash memory is being increased as a secondary device to displace conventional magnetic disk. NAND flash memory, as one among non-volatile memories, has many advantages such as low power, high reliability, low access latency, and so on. However, NAND flash memory has disadvantages such as erase-before-write, unbalanced operation speed, and limited P/E cycles, unlike conventional magnetic disk. To solve these problems, NAND flash memory mainly adopted FTL (Flash Translation Layer). In particular, garbage collection technique in FTL tried to improve the system lifetime. However, previous garbage collection techniques have a sensitive property of the system lifetime according to write pattern. To solve this problem, we propose BSGC (Balanced Selection-based Garbage Collection) technique. BSGC efficiently selects a victim block using all intervals from the past information to the current information. In this work, SFL (Search First linked List), as the proposed block allocation policy, prolongs the system lifetime additionally. In our experiments, SFL and BSGC prolonged the system lifetime about 12.85% on average and reduced page migrations about 22.12% on average. Moreover, SFL and BSGC reduced the average response time of 16.88% on average.

• 대한심미치과학회지
• /
• 제22권1호
• /
• pp.56-66
• /
• 2013

현재 CAD/CAM의 다양한 발전이 무서운 속도로 우리들에 게 다가오고 있다. 하지만 우리 치과영역에서 극도의 자연스러운 심미에 관해서는 결국 사람 손에 의해 극복이 되어야 하고 그것을 위해 우리는 끝없는 도전과 자신만의 신념이 필요하다고 생각한다. 그래서 사람들은 심미보철에 관한 술식을 국내외 서적이나 강의를 통해 많이 접하게 되는데 치과기공사에게 필요하고 쉽게 이해할 수 있게 요약해 놓은 것은 많지 않은 것 같다. 이에 대해 고민하다 심미보철작업을 위한 지침인 Esthetic Check List를 생각하여 수년전부터 조금씩 정리해 보았고 이 지침을 통해 균형 있고 조화로운 보철을 제작해 오고 있는데 이 해법을 본 연구에서 소개하고자 한다.

• 한국운동역학회지
• /
• 제23권4호
• /
• pp.319-326
• /
• 2013

The objective of this study is to help golfers to select adequate putters and to provide golfers basic scientific data for improving athletic performance by showing differences of kinematic variables according to the shape of putter head. In this research three right-handed male pro-golfer who are listed at KPGA were studied and three video camera (GR-HD1KR, JVC, Japan) were used and recording speed was 60 frame/sec during the research. In this study kinematic variables were calculated using Kwon3D XP program and analysed on the 4 events and 3 phases. This study showed the following results : (1) The swing of heel-toe putter showed longer time than that of face balanced putter, and there are statistical significant difference of kinematic variables of each objective (2) As of the trajectory of putter head, heel-toe putter showed more approximating curve trajectory than that of in-between, face balanced putter on the X-axis (3) heel-toe putter showed longer distance follow-through than that of other putters by statistically significant difference on the Y-axis (4) Heel-toe putter showed longer distance swing trajectory over the ground than that of other putters by statistically significant difference on the Z-axis.

• 한국통신학회논문지
• /
• 제29권12C호
• /
• pp.1642-1651
• /
• 2004

인터넷 접근 기술의 발달은 보다 큰 인터넷 bandwidth를 필요로 하게 되었고 라우터에서의 빠른 패킷 처리를 요구하게 되었다. 라우터에서의 어드레스 경색은 일초에 수천만개 이상으로 입력되는 패킷에 대하여 실시간으로 처리되어야 하는 중요한 기능이다. 본 논문에서는 효율적인 어드레스 검색을 위한 소프트웨어에 기반한 새로운 검색 구조를 제안한다. 라우팅 테이블을 여러 개의 밸런스 트리들로 구성하여 하나의 SRAM에 저장하고 각각의 트리에 대해 순차적으로 바이너리 검색을 수행하는 방식이다. 본 논문에서 제안하는 구조는 약 40,000 여개의 프리픽스를 갖는 라우팅 테이블을 저장하기 위하여 301.7KByte의 작은 사이즈 SRAM을 사용하고 평균 11.3번의 메모리 접근으로 주소 검색이 가능한 구조이다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권1호
• /
• pp.133-151
• /
• 2019

In order to achieve faster content distribution speed and stronger fault tolerance, a P2P peer can connect to multiple peers in parallel and receive chunks of the data simultaneously. A critical issue in this environment is selecting a set of nodes participating in swarming sessions. Previous related researches only focus on performance metrics, such as downloading time or the round-trip time, but in this paper, we consider a new performance metric which is closely related to the network and propose a peer selection algorithm that produces the set of peers generating optimal worst link stress. We prove that the optimal algorithm is practicable and has the advantages with the experiments on PlanetLab. The algorithm optimizes the congestion level of the bottleneck link. It means the algorithm can maximize the affordable throughput. Second, the network load is well balanced. A balanced network improves the utilization of resources and leads to the fast content distribution. We also notice that if every client follows our algorithm in selecting peers, the probability is high that all sessions could benefit. We expect that the algorithm in this paper can be used complementary to existing methods to derive new and valuable insights in peer-to-peer networking.