• Title/Summary/Keyword: Compact

Search Result 5,506, Processing Time 0.027 seconds

Compact Hybrid Branch-line Couplers and Rat-Race Couplers with Periodic Stepped Stubs (주기적인 계단형 스터브를 갖는 소형화된 하이브리드 Branch-Line 결합기와 Rat-Race 결합기)

  • Lee Chang On;Kim Won-Ki;Kim Sang-Tae;Shin Chull-Chai
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.41 no.12
    • /
    • pp.115-124
    • /
    • 2004
  • In this paper, we introduce the advanced compact transmission line with periodic stepped stubs. They are more effective than normal stubs in ATL. The short stepped stubs loading of transmission line work as effective shunt capacitance and that was proved by equivalent circuit based on transmission line theory and quasi-static analysis. And the compact branch-line coupler and the compact rat-race coupler via proposed compact microstrip line were designed at 1.8 ㎓. They have 677 ㎟ and 913 ㎟, respectively, and they are 62% and 45% of normal design.

Basic Research for Sustainable Development of the Compact City -Focusing on the Characteristics Analysis for City/ Society/Residence of Europe/USA/Japan- (지속가능한 콤팩트도시 개발을 위한 기초 연구 -유럽, 미국, 일본의 도시, 사회, 거주 특징분석을 중심으로-)

  • Baek, Seung-Kwan
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.17 no.8
    • /
    • pp.595-604
    • /
    • 2016
  • This study discusses the sustainable development of the compact city. The problems of urban sprawl have long been recognized. Urban sprawl results from the confluence of several factors: the lure of cheap open land outside the city, advances in transportation, the ready availability of capital to buy property, the increase in the number of real estate developers and the mass production of housing. The term compact city has the opposite connotation to urban sprawl. Compact cities provide a more energy efficient and less polluting environment, because dwellers within them live closer to shops and work and can easily walk, bike or take public transport. In other words, the compact city has the objective of facilitating the integration of the different functions through the intensive development of various facilities, such as residences, commerce, businesses and of improving the efficiency of urban energy usage by decreasing the volume of traffic.

DC Motor Drive System Using Model Based Cotroller Design of LabVIEW and Compact RIO (LabVIEW의 모델기반 제어기 설계와 Compact RIO를 이용한 직류전동기 구동 시스템)

  • Ji, Jun-Keun
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.9 no.2
    • /
    • pp.352-359
    • /
    • 2008
  • This paper presents a controller implementation using model based controller design programs-System Identification Toolkit, Control Design Toolkit, Simulation module. This method is easier and simpler than conventional controller design method. To implement speed control system of DC motor, a CompactRIO, Real-Time(RT) cntroller provided by NI(National Instruments), is used as hardware equipment. Firstly transfer function of DC motor drive system, which was a control target plant, can be acquired through System Identification Toolkit by using test input signal applied to motor and output signal from motor. And designing of pole-zero compensator satisfying desired control response performance through Control Design Toolkit, designed speed control response can be tested through Simulation Module. Finally LabVIEW program is converted to real-time program and downloaded to CompactRIO real-time controller Through experimental results to real DC motor drive system, designed speed control response is compared to simulation results.

A Study on Small-sized Index Structure and Fast Retrieval Method Using The RCB trio (RCB트라이를 이용한 빠른 검색과 소용량 색인 구조에 관한 연구)

  • Jung, Kyu-Cheol
    • Journal of the Korea Society of Computer and Information
    • /
    • v.12 no.4
    • /
    • pp.11-19
    • /
    • 2007
  • This paper proposes RCB(Reduced Compact Binary) tie to correct faults of both CB(Compact Binary) tie and HCB(Hierarchical Compact Binary) trie. First, in the case of CB trie, a compact structure was tried for the first time, but as the amount of data was increasing, that of inputted data gained and much difficulty was experienced in insertion due to the dummy nods used in balancing trees. On the other hand, if the HCB trie realized hierarchically, given certain depth to prevent the map from increasing on the right, reached the depth, the method for making new trees and connecting to them was used. Eventually, fast progress could be made in the inputting and searching speed, but this had a disadvantage of the storage space becoming bigger because of the use of dummy nods like CB trie and of many tree links. In the case of RCB trie in this thesis, the tree-map could be reduced by about 35% by completely cutting down dummy nods and the whole size by half, compared with the HCB trie.

  • PDF

An Impact of Addressing Schemes on Routing Scalability

  • Ma, Huaiyuan;Helvik, Bjarne E.;Wittner, Otto J.
    • Journal of Communications and Networks
    • /
    • v.13 no.6
    • /
    • pp.602-611
    • /
    • 2011
  • The inter-domain routing scalability issue is a major challenge facing the Internet. Recent wide deployments of multihoming and traffic engineering urge for solutions to this issue. So far, tunnel-based proposals and compact routing schemes have been suggested. An implicit assumption in the routing community is that structured address labels are crucial for routing scalability. This paper first systematically examines the properties of identifiers and address labels and their functional differences. It develops a simple Internet routing model and shows that a binary relation T defined on the address label set A determines the cardinality of the compact label set L. Furthermore, it is shown that routing schemes based on flat address labels are not scalable. This implies that routing scalability and routing stability are inherently related and must be considered together when a routing scheme is evaluated. Furthermore, a metric is defined to measure the efficiency of the address label coding. Simulations show that given a 3000-autonomous system (AS) topology, the required length of address labels in compact routing schemes is only 9.12 bits while the required length is 10.64 bits for the Internet protocol (IP) upper bound case. Simulations also show that the ${\alpha}$ values of the compact routing and IP routing schemes are 0.80 and 0.95, respectively, for a 3000-AS topology. This indicates that a compact routing scheme with necessary routing stability is desirable. It is also seen that using provider allocated IP addresses in multihomed stub ASs does not significantly reduce the global routing size of an IP routing system.

THE TRANSFORMATION GROUPS AND THE ISOMETRY GROUPS

  • Kim, Young-Wook
    • Bulletin of the Korean Mathematical Society
    • /
    • v.26 no.1
    • /
    • pp.47-52
    • /
    • 1989
  • Methods of Riemannian geometry has played an important role in the study of compact transformation groups. Every effective action of a compact Lie group on a differential manifold leaves a Riemannian metric invariant and the study of such actions reduces to the one involving the group of isometries of a Riemannian metric on the manifold which is, a priori, a Lie group under the compact open topology. Once an action of a compact Lie group is given an invariant metric is easily constructed by the averaging method and the Lie group is naturally imbedded in the group of isometries as a Lie subgroup. But usually this invariant metric has more symmetries than those given by the original action. Therefore the first question one may ask is when one can find a Riemannian metric so that the given action coincides with the action of the full group of isometries. This seems to be a difficult question to answer which depends very much on the orbit structure and the group itself. In this paper we give a sufficient condition that a subgroup action of a compact Lie group has an invariant metric which is not invariant under the full action of the group and figure out some aspects of the action and the orbit structure regarding the invariant Riemannian metric. In fact, according to our results, this is possible if there is a larger transformation group, containing the oringnal action and either having larger orbit somewhere or having exactly the same orbit structure but with an orbit on which a Riemannian metric is ivariant under the orginal action of the group and not under that of the larger one. Recently R. Saerens and W. Zame showed that every compact Lie group can be realized as the full group of isometries of Riemannian metric. [SZ] This answers a question closely related to ours but the situation turns out to be quite different in the two problems.

  • PDF

Performances Comparison of Compact Network RTK User Based on Modelling of Multiple Reference Station Corrections (다중 기준국 보정정보 모델링 방식에 따른 Compact Network RTK 사용자 성능 비교)

  • Song, June-Sol;Park, Byung-Woon;Kee, Chang-Don
    • Journal of Advanced Navigation Technology
    • /
    • v.17 no.5
    • /
    • pp.475-483
    • /
    • 2013
  • In this paper, the performances of modeling methods for combining corrections from multiple reference stations for network user were compared and analyzed. The longer the distance between reference station and user is, the more the GPS errors are decorrelated. Based on this point, multiple corrections from reference stations which is constituting a network should be combined properly to be applied for user observation to eliminate GPS errors. There are many widely used conventional modeling methods and they are applied for Compact Network RTK users and user position accuracy is predicted by using residual errors in observation of user. Compact Network RTK is a technique of generating corrections which was developed by Seoul National University. As a result, the horizontal and vertical accuracies were within about 5 cm and 7 cm respectively with 95 % probability for all conventional modeling methods. In addition, we analyzed condition for reference station constellation for modeling method using height information.