• 제목/요약/키워드: set-connected

검색결과 734건 처리시간 0.04초

위성 추적용 Monopulse L-Band Dipole Feed부의 제작 (Monopulse L-Band Dipole Feed For The Satellite Tracking)

  • 천병진;홍성용;이재현;나정웅
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1987년도 전기.전자공학 학술대회 논문집(I)
    • /
    • pp.82-85
    • /
    • 1987
  • Electromagnetic waves from the satellite may be utilized to direct the tracking antenna toward the satellite. We design and fabricate the feed appropriate to the monopulse tracking technique which derive angle-error information on the basis of a single pulse. The feed consists of five cavity-backed turnstile elements mounted on a common ground plane. The turnstile dipole are connected to a set of five quadrature hybrids which convert the dual linear polarization into dual circular polarization. The five feed outputs are then processed in the monopulse comparator which is constructed in microstrip for compactness.

  • PDF

A Nearly Optimal One-to-Many Routing Algorithm on k-ary n-cube Networks

  • Choi, Dongmin;Chung, Ilyong
    • 스마트미디어저널
    • /
    • 제7권2호
    • /
    • pp.9-14
    • /
    • 2018
  • The k-ary n-cube $Q^k_n$ is widely used in the design and implementation of parallel and distributed processing architectures. It consists of $k^n$ identical nodes, each node having degree 2n is connected through bidirectional, point-to-point communication channels to different neighbors. On $Q^k_n$ we would like to transmit packets from a source node to 2n destination nodes simultaneously along paths on this network, the $i^{th}$ packet will be transmitted along the $i^{th}$ path, where $0{\leq}i{\leq}2n-1$. In order for all packets to arrive at a destination node quickly and securely, we present an $O(n^3)$ routing algorithm on $Q^k_n$ for generating a set of one-to-many node-disjoint and nearly shortest paths, where each path is either shortest or nearly shortest and the total length of these paths is nearly minimum since the path is mainly determined by employing the Hungarian method.

영어 노래에서의 음절과 박, 음표의 관계 (A relevance of syllable, beat and note in English songs)

  • 손일권
    • 대한음성학회지:말소리
    • /
    • 제35_36호
    • /
    • pp.101-119
    • /
    • 1998
  • By analyses of lullabies, nursery rhymes, Christmas carols, and pop songs, the relevances of beat, syllable and note are set up as follows. (1) The relevance of beat to syllable a. A stressed syllable can occupy a strong beat. b. A monosyllabic word carrying a strong beat must have the syllabic structure of a strong syllable. (2) The note duration a. The duration of a note carrying a strong beat tends to be as long as or longer than that of a note carrying a weak beat. b. The note connected with the last position of phonological unit tends to be longer than that of other position without regard to the syllabic structure.

  • PDF

초정밀가공 시 임피던스 측정을 통한 시편 수평맞춤 및 공구의 기준위치 설정 (Workpiece Horizontality and Reference Positioning of Cutting Tool by Measuring Impedance in Ultra-Precision-Machining)

  • 이호철;김기대
    • 한국정밀공학회지
    • /
    • 제28권12호
    • /
    • pp.1366-1371
    • /
    • 2011
  • In ultra precision machining, it is necessary to adjust the horizontality and reference position of a workpiece in a noncontact manner. For this, a simple process by measuring impedance between a tool tip and a workpiece which are connected to impedance analyzer is proposed. As the distance between the tool and the workpiece gets closer, the reduction rate of impedance becomes higher over all frequency ranges. By setting threshold value of impedance reduction rate at specific frequencies through preliminary experiments, the distance between the tool and the workpiece can be predicted and it directly enables us to horizontalize the workpiece and to set the tool to the desired reference position.

Effect of Representation Methods on Time Complexity of Genetic Algorithm based Task Scheduling for Heterogeneous Network Systems

  • Kim, Hwa-Sung
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • 제1권1호
    • /
    • pp.35-53
    • /
    • 1997
  • This paper analyzes the time complexity of Genetic Algorithm based Task Scheduling (GATS) which is designed for the scheduling of parallel programs with diverse embedded parallelism types in a heterogeneous network systems. The analysis of time complexity is performed based on two representation methods (REIA, REIS) which are proposed in this paper to encode the scheduling information. And the heterogeneous network systems consist of a set of loosely coupled parallel and vector machines connected via a high-speed network. The objective of heterogeneous network computing is to solve computationally intensive problems that have several types of parallelism, on a suite of high performance and parallel machines in a manner that best utilizes the capabilities of each machine. Therefore, when scheduling in heterogeneous network systems, the matching of the parallelism characteristics between tasks and parallel machines should be carefully handled in order to obtain more speedup. This paper shows how the parallelism type matching affects the time complexity of GATS.

  • PDF

SOME PROPERTIES OF $D^n$-GROUPS

  • Kim, In-Su
    • 대한수학회보
    • /
    • 제26권1호
    • /
    • pp.1-9
    • /
    • 1989
  • In 1980 and 1983, it was proved that P $D^{2}$-groups are surface groups ([2], [3]). Since then, topologists have been positively studying about P $D^{n}$ -groups (or $D^{n}$ -groups). For example, let a topological space X have a right .pi.-action, where .pi. is a multiplicative group. If each x.memX has an open neighborhood U such that for each u.mem..pi., u.neq.1, U.cap. $U_{u}$ =.phi., this right .pi.-action is said to be proper. In this case, if X/.pi. is compact then (1) .pi.$_{1}$(X/.pi).iden..pi.(X:connected, .pi.$_{1}$: fundamental group) ([4]), (2) if X is a differentiable orientable manifold with demension n and .rho.X (the boundary of X)=.phi. then $H^{k}$ (X;Z).iden. $H_{n-k}$(X;Z), ([6]), where Z is the set of all integers.s.

  • PDF

한국형 고속전철 공조시스템 소음에 관한 연구 (Noise Characteristics of the HVAC System of Korea High Speed Train)

  • 하인수;박철희;이우식;한기흥
    • 한국철도학회:학술대회논문집
    • /
    • 한국철도학회 1998년도 추계학술대회 논문집
    • /
    • pp.379-387
    • /
    • 1998
  • HVAC systems are used to maintain comfort conditions in occupied spaces. Like rolling noise and aerodynamic noise, noise from the HVAC system of train increases interior noise level. For an appropriate interior noise level, it is necessary not to find noise sources and their propagation paths. Noise emission from the sources and propagation through the propagation paths should be regulated in order to reduce their effect to the interior noise level. In general, the main noise source in the HVAC system is blower which operates at high static pressure. This noise propagates through ducts which are directly connected to the residential area. Since the blower noise can be reduced only to some degree, it is necessary for the propagation paths to have enough noise attenuation. Acoustic properties of ducts are usually found by experimental methods but it is rather difficult and expensive to set up such test equipments. In this thesis, the design and the noise characteristics of TGV-K HVAC system are studied. Finite element method in accordance with experimental method is used to study the acoustic properties of TGV-K duct system.

  • PDF

EXISTENCE OF GLOBAL SOLUTIONS TO SOME NONLINEAR EQUATIONS ON LOCALLY FINITE GRAPHS

  • Chang, Yanxun;Zhang, Xiaoxiao
    • 대한수학회지
    • /
    • 제58권3호
    • /
    • pp.703-722
    • /
    • 2021
  • Let G = (V, E) be a connected locally finite and weighted graph, ∆p be the p-th graph Laplacian. Consider the p-th nonlinear equation -∆pu + h|u|p-2u = f(x, u) on G, where p > 2, h, f satisfy certain assumptions. Grigor'yan-Lin-Yang [24] proved the existence of the solution to the above nonlinear equation in a bounded domain Ω ⊂ V. In this paper, we show that there exists a strictly positive solution on the infinite set V to the above nonlinear equation by modifying some conditions in [24]. To the m-order differential operator 𝓛m,p, we also prove the existence of the nontrivial solution to the analogous nonlinear equation.

A Research on Stray-Current Corrosion Mechanism of High Voltage Cable Connector on Electrification Vehicles

  • Lee, Hwi Yong;Ahn, Seung Ho;Im, Hyun Taek
    • Corrosion Science and Technology
    • /
    • 제18권4호
    • /
    • pp.117-120
    • /
    • 2019
  • Considering the tendency of development of electrification vehicles, development and verification of new evaluation technology is needed because of new technology applications. Recently, as the battery package is set outdoors of an electric vehicle, such vehicles are exposed to corrosive environments. Among major components connected to the battery package, rust prevention of high-voltage cables and connectors is considered the most important issue. For example, if corrosion of high voltage cable connectors occurs, the corrosion durability assessment of using an electric vehicle will be different from general environmental corrosion phenomena. The purpose of this study is to investigate the corrosion mechanism of high voltage cable connectors of an electric vehicle under various driving environments (road surface vibration, corrosion environment, current conduction by stray current, etc.) and develop an optimal rust prevention solution. To improve our parts test method, we have proposed a realistic test method to reproduce actual electric vehicle corrosion issues based on the principle test.

Android Application for Connecting Cycling Routes on Strava Segments

  • Mulasastra, Intiraporn;Kao-ian, Wichpong
    • Journal of information and communication convergence engineering
    • /
    • 제17권2호
    • /
    • pp.142-148
    • /
    • 2019
  • Relatively few countries provide separate bicycle lanes for cyclists. Hence, tools for suggesting cycling routes are essential for a safe and pleasant cycling experience. This study aims to develop a mobile application to build cycling routes based on user preferences, specifically location, search radius, ride distance, and number of optimal routes. Our application calls the Strava API to retrieve Strava cycling segments crowdsourced from the cycling community. Then, it creates a graph consisting of the start and end points of these segments. Beginning from a user-specified location, the depth-first search algorithm (DFS) is applied to find routes that conform to the user's preferences. Next, a set of optimal routes is obtained by computing a trade-off ratio for every discovered route. This ratio is calculated from the lengths of all segments and the lengths of all connecting paths. The connected routes can be displayed on a map on an Android device or exported as a GPX file to a bike computer. Future work must be performed to improve the design of the user interface and user experience.