• Title/Summary/Keyword: bound level

Search Result 351, Processing Time 0.061 seconds

The Performance of Chip Level Detection for DS/CDMA Operating in LEO Satellite Channel (저궤도 위성통신을 위한 칩레벨 DS/CDMA 시스템의 성능 평가에 관한 연구)

  • Jae-Hyung Kim;Seung-Wook Hwang
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.2 no.4
    • /
    • pp.553-558
    • /
    • 1998
  • We present in this paper the ture union bound of the performance of chip level detection for coded DS/CDMA system operating in Rician fading channels such as LEO satellite mobile radio where the maximum doppler frequency is very high. The main objective of this paper is to calculate the exact doe union bound of BER performance of different performance of different quadrature detectors and to find a optimum spreading factor as a function of fade rate. The rationale of using multiple chip detection is to reduce the effective fade rate or variation. We considered chip level differential detection, chip level maximum likelihood sequence estimation, noncoherent detection and coherent detection with perfect channel state information as a reference.

  • PDF

An Optimal Scheduling Method based upon the Lower Bound Cost Estimation (하한비용 추정에 바탕을 둔 최적 스케쥴링기법)

  • 엄성용;전주식
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.28A no.12
    • /
    • pp.73-87
    • /
    • 1991
  • This paper presents a new approach to the scheduling problem in the high level synthesis. In this approach, iterative rescheduling processes starting with ASAP(As Soon As Possible) scheduling result are performed in a branch-and-bound manner so to arrive at the scheduling result of the lowest hardware cost under the given timing constraint. At each iteration step, only the selected nodes are considered for rescheduling, and the lower bound cost estimation is performed to avoid the unnecessary attempts to search for an optimal result. This branch-and-bound method turns out to be effective in pruning the search space, and thus reducing run time considerably in many cases.

  • PDF

Factors Affecting Patient Moving for Medical Service Using Multi-level Analysis (환자이동에 영향을 미치는 개인 및 병원요인 분석)

  • Kim, Sun Hee;Lee, Hae Jong;Lee, Kwang Soo;Shin, Hyun Woung
    • Korea Journal of Hospital Management
    • /
    • v.19 no.4
    • /
    • pp.9-20
    • /
    • 2014
  • The purpose of this study is to find out factors affecting patient moving to receive medical service. This study is analyzed by multi-level model with patient and hospital level by using SAS 9.3. Total number of patients is 600,000 persons for inpatients and 550,000 patients for outpatients. The degree of the factors, which is combined with personnel factor and hospital factor, can be analyzed by Intra-Class Correlation (ICC). The percentage of group(hospital) level variance of the total variance for out-bound moving case are 30.6% at inpatients, and 28.3% at outpatients. And the percentage of hospital level variance of the total variance for moving distance, are 26.7%, 32,5% respectively. Conclusionally, although the main factor of moving is patient level, hospital is also very important factor to make decision to go out-bound. It contributed to about 1/3 for hospital choice. And, when the one make decision, he will consider the hospital type, number of bed, and training institute in hospital level. Through this study to find out hospital factors affecting patient moving for medical service, it must be continued to find out which factors have more influence to choice the hospital among disease type after this.

  • PDF

Approximate seismic displacement capacity of piles in marine oil terminals

  • Goel, Rakesh K.
    • Earthquakes and Structures
    • /
    • v.1 no.1
    • /
    • pp.129-146
    • /
    • 2010
  • This paper proposes an approximate procedure to estimate seismic displacement capacity - defined as yield displacement times the displacement ductility - of piles in marine oil terminals. It is shown that the displacement ductility of piles is relatively insensitive to most of the pile parameters within ranges typically applicable to most piles in marine oil terminals. Based on parametric studies, lower bound values of the displacement ductility of two types of piles commonly used in marine oil terminals - reinforced-concrete and hollow-steel - with either pin connection or full-moment-connection to the deck for two seismic design levels - Level 1 or Level 2 - and for two locations of the hinging in the pile - near the deck or below the ground - are proposed. The lower bound values of the displacement ductility are determined such that the material strain limits specified in the Marine Oil Terminal Engineering and Maintenance Standard (MOTEMS) are satisfied at each design level. The simplified procedure presented in this paper is intended to be used for preliminary design of piles or as a check on the results from the detailed nonlinear static pushover analysis procedure, with material strain control, specified in the MOTEMS.

Growth and characterization of CdTe single crystal by vertical Bridgman method (수직 Bridgman 법에 의한 CdTe 단결정 성장과 특성)

  • Hong, Myung-Seok;Hong, Kwang-Joon
    • Journal of Sensor Science and Technology
    • /
    • v.14 no.6
    • /
    • pp.369-373
    • /
    • 2005
  • High quality CdTe single crystal for the solar cell fabrication was grown by vertical Bridgman method. The etch pits patterns of (111) surfaces of CdTe etched by Nakagawa solution was observed the (111)A compesed of Cd atoms with typical triangle etch pits of pyramid mode. From the photoluminescence measurement on (111)A, we observed free exciton ($E_{x}$) existing only high quality crystal and neutal acceptor bound exciton ($A^{0}$,X) having very strong peak intensity. Then, the full width at half maximum and binding energy of neutral acceptor bound exciton were 7 meV and 5.9 meV, respectively. By Haynes rule, an activation enery of impurity was 59 meV. Therefore, the origins on impurity level acting as a neutral acceptor were associated Ag or Cu elements.

Multi-level Building Layout With Dimension Constraints On Departments (형태제약을 가지는 부서의 다층빌딩 설비배치)

  • Chae-Bogk Kim
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.26 no.4
    • /
    • pp.42-49
    • /
    • 2003
  • The branch and bound techniques based on cut tree and eigenvector have been Introduced in the literature [1, 2, 3, 6, 9, 12]. These techniques are used as a basis to allocate departments to floors and then to fit departments with unchangeable dimensions into floors. Grouping algorithms to allocate departments to each floor are developed and branch and bound forms the basis of optimizing using the criteria of rectilinear distance. The proposed branch and bound technique, in theory, will provide the optimal solution on two dimensional layout. If the runs are time and/or node limited, the proposed method is a strong heuristic The technique is made further practical by the fact that the solution is constrained such that the rectangular shape dimensions length and width are fixed and a perfect fit is generated if a fit is possible. Computational results obtained by cut tree-based algorithm and eigenvector-based algorithm are shown when the number of floors are two or three and there is an elevator.

A Branch and Bound Algorithm for the Hierarchical Transportation Network Design Problem in Directed Networks (유방향 네트워크에서 계층수송망 설계 문제에 대한 분지한계법)

  • Shim, Hyun-Taik;Park, Son-Dal
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.16 no.2
    • /
    • pp.86-102
    • /
    • 1991
  • The purpose of this paper is to present a branch and bound algorithm for the hierarchical transportation network design problem in 2-level directed networks. This problem is to find the least cost of hierarchical transportation networks which consist of a primary path and a secondary path. The primary path is a simple path from a prespecified orgin node to a prespecified terminal node. All nodes must be either a transsipment node on the primary path or connected to that path via secondary arcs. This problem is formulated to a 0-1 inter programming problem with assignment and illegal subtour elimination equations as constaints. We show that the subproblem relaxing subtour elimination constraints is transformed to a linear programming problem by means of the totally unimodularity. Optimal solutions of this subproblem are polynoially obtained by the assignment algorithm and complementary slackness conditions. Therefore, the optimal value of this subproblme is used as a lower bound. When an optimal solution of the subproblem has an illegal subtour, a better disjoint rule is adopted as the branching strategy for reducing the number of branched problems. The computational comparison between the least bound rule and the depth first rule for the search strategy is given.

  • PDF

Error analysis of acoustic target detection and localization using Cramer Rao lower bound (크래머 라오 하한을 이용한 음향 표적 탐지 및 위치추정 오차 분석)

  • Park, Ji Sung;Cho, Sungho;Kang, Donhyug
    • The Journal of the Acoustical Society of Korea
    • /
    • v.36 no.3
    • /
    • pp.218-227
    • /
    • 2017
  • In this paper, an algorithm to calculate both bearing and distance error for target detection and localization is proposed using the Cramer Rao lower bound to estimate the minium variance of their error in DOA (Direction Of Arrival) estimation. The performance of arrays in detection and localization depends on the accuracy of DOA, which is affected by a variation of SNR (Signal to Noise Ratio). The SNR is determined by sonar parameters such as a SL (Source Level), TL (Transmission Loss), NL (Noise Level), array shape and beam steering angle. For verification of the suggested method, a Monte Carlo simulation was performed to probabilistically calculate the bearing and distance error according to the SNR which varies with the relative position of the target in space and noise level.

A Study on Transmission System Expansion Planning on the Side of Highest Satisfaction Level of Decision Maker

  • Tran TrungTinh;Kang Sung-Rok;Choi Jae-Seok;Billinton Roy;El-keib A. A.
    • KIEE International Transactions on Power Engineering
    • /
    • v.5A no.1
    • /
    • pp.46-55
    • /
    • 2005
  • This paper proposes a new method for choice of the best transmission system expansion plan on the side of highest satisfaction level of decision maker using fuzzy integer programming. The proposed method considers the permissibility and ambiguity of the investment budget (economics) for constructing the new transmission lines and the delivery marginal rate (reliability criteria) of the system by modeling the transmission expansion problem as a fuzzy integer programming one. It solves the optimal strategy (reasonable as well as flexible) using a fuzzy set theory-based on branch and bound method that utilizes a network flow approach and the maximum flow-minimum cut set theorem. Under no or only a very small database for the evaluation of reliability indices, the proposed technique provides the decision maker with a valuable and practical tool to solve the transmission expansion problem considering problem uncertainties. Test results on the 63-bus test system show that the proposed method is practical and efficiently applicable to transmission expansion planning.