• 한국콘크리트학회:학술대회논문집
• /
• 한국콘크리트학회 2002년도 봄 학술발표회 논문집
• /
• pp.233-238
• /
• 2002

This study presents failure mechanisms for the pull-out strength of headed reinforcement for upper bound solution based on the limit theorem. The failure mechanisms to be presented follow the failure surface pattern of punching shear failure found in the joints of slab with a column. Several failure surfaces of the mechanisms have different characteristics for dissipation works and these mechanisms are able to interpret the role of bar details surrounding headed reinforcement.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1986년도 한국자동제어학술회의논문집; 한국과학기술대학, 충남; 17-18 Oct. 1986
• /
• pp.356-361
• /
• 1986

This paper presents robustness properties of LQ regulators for input-delayed systems. Using frequency-domain representations, the Kalman inequality concerning the return-difference matrix is derived. The stability margins of LQ regulators are investigated using the Kalman inequality when the open-loop system is stable. In order to obtain stability margins a upper bound of the solution of LQ Riccati equations is derived. Finally, the LQG/LTR method to improve the robustness of LQG regulators is obtained and illustrated with an example.

• 대한수학회보
• /
• 제38권1호
• /
• pp.129-136
• /
• 2001

We consider a solution process of stochastic differential equation(SDE) driven by S'($R^d$)-valued Wiener process and study a large deviation type of estimates for the process. We get an upper bound in exit probability for such a process to leave a ball of radius $\tau$ before a finite time t. We apply the Ito formula to the SDE under the structure of nuclear space.

• 한국경영과학회지
• /
• 제26권3호
• /
• pp.95-104
• /
• 2001

In this paper, we consider a maximin version of the linear programming knapsack problem with extended generalized upper bound (GUB) constraints. We solve the problem efficiently by exploiting its special structure without transforming it into a standard linear programming problem. We present an O(n$^3$) algorithm for deriving the optimal solution where n is the total number of problem variables. We illustrate a numerical example.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 통신소사이어티 추계학술대회논문집
• /
• pp.140-144
• /
• 2003

A sensor network consists of many low-cost, low-power, and multi-functional sensor nodes. One of most important issues in of sensor networks is to increase network lifetime, and there have been researches on the problem. In this paper, we propose a routing mechanism to prolong network lifetime, in which each node adjusts its transmission power to send data to its neighbors. We model the energy efficient routing with power control and present an algorithm to obtain the optimal flow solution for maximum network lifetime. Then, we derive an upper bound on the network lifetime for specific network topologies.

• 한국항행학회논문지
• /
• 제21권6호
• /
• pp.608-613
• /
• 2017

본 논문에서는 시변 지연시간이 있는 선형 이산 구간 시변 시스템의 지연 상태변수에 존재하는 불확실성 안정범위에 관한 것을 다룬다. 고려된 시스템은 지연 없는 상태변수에 대한 시스템 행렬이 구간범위에서 시변으로 변동하고, 지연 시간이 구간범위 내에서 시변인 지연 상태변수에 대하여 비구조화된 불확실성이 시변으로 존재하는 시스템이다. 기존의 많은 연구들이 시변에 대한 부분을 고려하지 못하고 시불변 경우에 대하여 얻어진 것에 반하여, 본 논문에서는 모든 요소를 시변으로 고려하여 새로운 안정범위를 도출하였다. 새로운 안정범위는 적용 가능한 시스템에 대한 제한이 없는 것으로 그 효용성이 기존의 결과 보다 우수하다. 제안된 범위는 복잡한 선형행렬부등식 혹은 리아프노프 방정식의 상한 해 한계를 이용하는 복잡한 과정이 필요하지 않다. 수치예제를 통하여 제안된 결과가 기존의 결과들을 포함할 수 있음을 보이고, 이들 보다 확장성과 효용성이 우수함을 확인한다.

• 한국경영과학회지
• /
• 제13권2호
• /
• pp.9-17
• /
• 1988

This vehicle scheduling problem with multiple depots and multiple vehicle types (VMM) is to determine the optimal vehicle routes to minimize the total travel costs. The object of this paper is to develope an exact algorithm for the VMM. In this paper the VMM is transformed into a mathematical model of the vehicle problem with multiple depots. Then an efficient branch and bound algorithm is developed to obtain an exact solution for this model. In order to enhance the efficiency, this algorithm emphasizes the follows; First, a heuristic algorithm is developed to get a good initial upper bound. Second, an primal-dual approach is used to solve subproblems which are called the quasi-assignment problem, formed by branching strategy is presented to reduce the number of the candidate subproblems.

• Journal of Communications and Networks
• /
• 제5권2호
• /
• pp.174-183
• /
• 2003

Space-Time (ST) codes are known to provide high transmission rates, diversity and coding gains. In this paper, a tight upper bound on the error probability of ST codes over rapid fading channels is presented. Moreover, ST codes suitable for rapid fading channels are presented. These codes are designed using the QPSK and 16-QAM signal constellations. The proposed codes are based on two different encoding schemes. The first scheme uses a single trellis encoder, whereas the second scheme uses the I-Q encoding technique. Code design is achieved via partitioning the signal space such that the design criteria are maximized. As a solution for the decoding problem of I-Q ST codes, the paper introduces a low-complexity decoding algorithm. Results show that the I-Q ST codes using the proposed decoding algorithm outperform singleencoder ST codes with equal complexity. The proposed codes are tested over fading channels with different interleaving conditions, where it is shown that the new codes are robust under such imperfect interleaving conditions.

• 한국경영과학회지
• /
• 제20권3호
• /
• pp.31-41
• /
• 1995

The maximum Origin-Destination Flow Path Problem (MODFP) in an Acyclic Network has known as NP-hard. K. S. Sung has suggested on Optimal Algorithm for MODFP based on the Pseudo flo or arc and the K-th shortest path algorithm. When we try to solve MODFP problem by general Branch and Bound Method (BBM), the upper and lower bounds of subproblems are so weak that the BBM become very inefficient. Here we utilized the Pseudo flow of arc' for the tight bounds of subproblems so that it can produce an efficient BBM for MODFP problem.

• 한국통신학회논문지
• /
• 제34권4C호
• /
• pp.460-468
• /
• 2009

OFDM(Orthogonal Frequency Division Multiplexing)이 적용된 MIMO(Multiple-input Multiple-output) 기술은 추가적인 주파수 자원의 할당 없이 채널 용량을 증가시키기 위한 방법으로 주목 받고 있으나, MIMO-OFDM 수신단에서 다른 안테나로부터 동시에 전송된 독립적인 데이터 스트림을 분리할 수 있는 낮은 복잡도의 검출 알고리즘을 개발해야 하는 문제점이 있다. 이 논문에서 제안하는 ULBC QRD-M (Upper-Lower Bounded-Complexity QRD-M) 알고리즘은 최대 복잡도 즉, 복잡도의 상한(upper bound)을 기존의 QRD-M 알고리즘과 동일한 값으로 고정시킴으로써 SD(Sphere Decoding) 알고리즘에서 순시적으로 매우 높은 복잡도를 가지는 문제를 해결하는 동시에, 불필요한 Hypothesis를 제거하여 필요한 계산양을 현저하게 낮출 수 있는 장점이 있다. 분석과 모의실험 결과를 통하여 제안된 알고리즘이 기존의 QRD-M 알고리즘에 비하여 단지 26%의 계산양 만으로도 동일한 BER 성능을 가질 수 있음을 보인다.