• 전기의세계
• /
• v.18 no.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.

• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• 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.

• Proceedings of the KSR Conference
• /
• 2008.06a
• /
• 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.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 2005.09a
• /
• 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.

• Journal of KIISE:Information Networking
• /
• v.36 no.1
• /
• pp.57-67
• /
• 2009

Packet forwarding in the Internet routers is to find out the longest prefix that matches the destination address of an input packet and to forward the input packet to the output port designated by the longest matched prefix. The IP address lookup is the key of the packet forwarding, and it is required to have efficient data structures and search algorithms to provide the high-speed lookup performance. In this paper, an efficient IP address lookup algorithm using binary search is investigated. Most of the existing binary search algorithms are not efficient in search performance since they do not provide a balanced search. The proposed binary search algorithm performs perfectly balanced binary search using switch pointers. The performance of the proposed algorithm is evaluated using actual backbone routing data and it is shown that the proposed algorithm provides very good search performance without increasing the memory amount storing the forwarding table. The proposed algorithm also provides very good scalability since it can be easily extended for multi-way search and for large forwarding tables

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.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.

• Journal of the Korean Academy of Esthetic Dentistry
• /
• v.22 no.1
• /
• pp.56-66
• /
• 2013

Nowadays, the various developments of the CAD/CAM have been coming to realization at an intimidating speed. However, in the field of the aesthetic dentistry, the extremely natural aesthetics must be realized eventually by human hands, and for this purpose, it is considered that the endless challenges and practitioners' own beliefs are necessary. While practitioners are normally exposed to surgical methods of aesthetic restorations via domestic and foreign books and lectures, it appears that there are not many of such necessary information that is summarized for easy understanding by dental technicians. Accordingly, as a result of pondering over this matter for years, the presenter has been devising the 'Esthetic Check List' that is a guideline for the aesthetic restoration practice, and the balanced and harmonious prostheses have been produced based on this guideline. In this presentation, this protocol is introduced.

• Korean Journal of Applied Biomechanics
• /
• v.23 no.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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.12C
• /
• pp.1642-1651
• /
• 2004

Advance of internet access technology requires more internet bandwidth and high-speed packet processing. IP address lookups in routers are essential elements which should be performed in real time for packets arriving tens-of-million packets per second. In this paper, we proposed a new architecture for efficient IP address lookup. The proposed scheme produces multiple balanced trees stored into a single SRAM. The proposed scheme performs sequential binary searches on multiple trees. Performance evaluation results show that p개posed architecture requires 301.7KByte SRAM to store about 40,000 prefix samples, and an address lookup is achieved by 11.3 memory accesses in average.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.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.