• Structural Engineering and Mechanics
• /
• 제62권6호
• /
• pp.709-717
• /
• 2017

This paper develops a two-stage method for structural damage identification by using modal data. First, the Residual Force Vector (RFV) is introduced to detect any potentially damaged elements of structures. Second, data of the frequency domain are used to build up the objective function, and then the Imperialist Competitive Algorithm (ICA) is utilized to estimate damaged extents. ICA is a heuristic algorithm with simple structure, which is easy to be implemented and it is effective to deal with high-dimension nonlinear optimization problem. The advantages of this present method are: (1) Calculation complexity can be decreased greatly after eliminating many intact elements in the first step. (2) Robustness, ICA ensures the robustness of the proposed method. Various damaged cases and different structures are investigated in numerical simulations. From these results, anyone can point out that the present algorithm is effective and robust for structural damage identification and is also better than many other heuristic algorithms.

• 대한전기학회논문지:전력기술부문A
• /
• 제52권2호
• /
• pp.121-133
• /
• 2003

This paper presents a fault location algorithm for a single phase-to-ground fault on 3-terminal transmission systems. The method uses only the local end voltage and current signals. Other currents used for the algorithm are estimated by current distribution factors and the local end current. Negative sequence current is used to remove the effect of load current. Five distance equations based on Kirchhoff's voltage law are established for the location algorithm which can be applied to a parallel transmission line having a teed circuit. Separating the real and imaginary parts of each distance equation, final nonlinear equations that are functions of the fault location can be obtained. The Newton-Raphson method is then applied to calculate the estimated fault location. Among the solutions, a correct fault distance is selected by the conditions of the existence of solution. With the results of extensive S/W and H/W simulation tests, it was verified that the proposed algorithm can estimate an accurate fault distance in a 154kV model system.

• 한국정보통신학회논문지
• /
• 제22권11호
• /
• pp.1538-1543
• /
• 2018

원 상에 n개의 점들의 쌍 (a,b)이 존재할 때, 두 점 a와 b를 연결하는 직선 선분을 코드라고 한다. 이러한 n개의 코드들은 새로운 그래프 G를 정의한다. 각 코드는 G의 한 정점을 정의하고 두 코드가 교차하는 경우에 대응되는 정점들 간에 간선을 연결한다. 이렇게 만들어진 그래프 G를 원 그래프라고 부른다. 본 논문에서는 원 그래프에서 연결 요소를 찾는 문제를 다룬다. 연결 요소란 그래프 G의 부분 그래프 H로서 H안의 임의의 두 정점 간에 경로가 존재한다는 조건을 만족하는 최대 부분 그래프이다. 그래프 G가 인접 행렬로 주어지는 경우, 연결 요소를 찾는 문제는 깊이 우선 탐색 또는 너비 우선 탐색을 통해서 해결할 수 있다. 하지만 원 그래프의 경우에 코드들을 정의하는 n개의 점들의 쌍 정보만 입력으로 주어질 때, 인접 행렬을 구하는데 ${\Omega}(n^2)$ 시간이 소요됨을 알 수 있다. 본 논문에서는 인접 행렬을 만들지 않고 원 그래프의 연결 요소를 $O(n{\log}^2n)$시간에 찾는 알고리즘을 고안한다.

• 정보처리학회논문지A
• /
• 제15A권4호
• /
• pp.189-198
• /
• 2008

본 논문은 분지수가 상수인 네트워크들을 피터슨-토러스(PT) 네트워크에 임베딩 가능함을 보인다. 상호연결망 G가 H에 임베딩 되면 G에서 설계된 병렬 알고리즘을 상호연결망 H에 적용할 수 있다. 토러스(메쉬)를 PT에 연장율 5, 밀집율 5 그리고 확장율 1에 일대일 임베딩 하였고, 허니컴브 메쉬를 PT에 연장율 5, 밀집율 2 그리고 확장율 5/3에 일대일 임베딩 하였다. 추가로 평균 연장율을 분석하였다. 널리 알려진 토러스 와 허니컴브 메쉬 네트워크를 연장율과 밀집율을 5이하에 PT에 임베딩 함으로써 웜홀 라우팅 방식과 store-and-forward 방식 모두에서 임베딩 알고리즘이 사용 가능하고, 일대일 임베딩을 함으로써 시뮬레이션시 프로세서 작업 처리량을 최소화 하였다.

• Smart Structures and Systems
• /
• 제18권6호
• /
• pp.1251-1267
• /
• 2016

In this paper, Simple Adaptive Control (SAC) is used to enhance the seismic response of nonlinear tall buildings based on acceleration feedback. Semi-active MR dampers are employed as control actuator due to their reliability and well-known dynamic models. Acceleration feedback is used because of availability, cost-efficiency and reliable measurements of acceleration sensors. However, using acceleration feedback in the control loop causes the structure not to apparently meet some requirements of the SAC algorithm. In addition to defining an appropriate SAC reference model and using inherently stable MR dampers, a modification in the original structure of the SAC is proposed in order to improve its adaptability to the situation in which the plant does not satisfy the algorithm's stability requirements. To investigate the performance of the developed control system, a numerical study is conducted on the benchmark 20-story nonlinear building and the responses of the SAC-controlled structure are compared to an $H_2/LQG$ clipped-optimal controller under the effect of different seismic excitations. As indicated by the results, SAC controller effectively reduces the story drifts and hence the seismically-induced damage throughout the structural members despite its simplicity, independence of structural parameters and while using fewer number of dampers in contrast with the $H_2/LQG$ clipped-optimal controller.

• 설비공학논문집
• /
• 제19권7호
• /
• pp.500-511
• /
• 2007

The Optimal solutions of the design variables in internally finned tubes have been obtained for three-dimensional periodically fully developed turbulent flow and heat transfer. For a trapezoidal fin profile, performances of the heat exchanger are determined by considering the heat transfer rate and pressure drop, simultaneously, that are interdependent quantities. Therefore, Pareto frontier sets of a heat exchanger can be acquired by integrating CFD and a multi-objective optimization technique. The optimal values of fin widths $(d_1,\;d_2)$, fin height(h) and helix angle$(\gamma)$ are numerical1y obtained by minimizing the pressure loss and maximizing the heat transfer rate within ranges of $d_1=0.5\sim1.5mm$, $d_2=0.5\sim1.5mm$, $h=0.5\sim1.5mm$, and $\gamma=0\sim20^{\circ}$. For this, a general CFD code and a global genetic algorithm(GA) are used. The Pareto sets of the optimal solutions can be acquired after $30^{th}$ generation.

• 한국통신학회논문지
• /
• 제40권2호
• /
• pp.372-379
• /
• 2015

최근 동영상 압축 표준은 세밀한 움직임 정보를 확보하기 위해 1/4 화소 단위의 움직임 예측 알고리즘을 사용하고 있다. 일반적인 동영상 부호화기에서 사용하는 공간 영역에서의 움직임 예측은 부화소 단위 움직임 예측을 위한 보간 기술의 적용으로 인한 계산량 증가 문제가 발생한다. 본 논문에서는 주파수 영역에서 shifting matrix를 이용한 부화소 정밀도의 움직임 예측 알고리즘을 제안한다. 주파수 영역에서 shifting matrix 알고리즘을 사용함으로써 낮은 계산량으로 부화소 움직임 예측을 수행할 수 있었으며, 실험 결과 공간 영역에서의 움직임 예측 알고리즘에 비해 낮은 비트량과 높은 PSNR(peak signal-to-noise ratio)을 제공함을 확인하였다.

• Journal of information and communication convergence engineering
• /
• 제11권2호
• /
• pp.69-81
• /
• 2013

Maintaining connectivity is essential in multi-hop wireless networks since the network topology cannot be pre-determined due to mobility and environmental effects. To maintain the connectivity, a critical point in the network topology should be identified where the critical point is the link or node that partitions the network when it fails. In this paper, we propose a new critical point identification algorithm and also present numerical results that compare the critical points of the network and H-hop sub-network illustrating how effectively sub-network information can detect the network-wide critical points. Then, we propose two localized topological control resilient schemes that can be applied to both global and local H-hop sub-network critical points to improve the network connectivity and the network resilience. Numerical studies to evaluate the proposed schemes under node and link failure network conditions show that our proposed resilient schemes increase the probability of the network being connected in variety of link and node failure conditions.

• Journal of the Korean Statistical Society
• /
• 제15권1호
• /
• pp.31-45
• /
• 1986

It is often necessary to obtain some run orders in factorial designs which have a small number of factor level changes and a small linear time trend. In this paper we propose an algorithm to find optimal or near-optimal run orders for $2^4, 2^5, 3^2$ and $2\cdot 3^2$ factorial designs under the criterion that the number of factor level changes and the linear time trend should be simultaneously small.

• Management Science and Financial Engineering
• /
• 제4권2호
• /
• pp.1-13
• /
• 1998

The Shortest Path Problem in Time-dependent Networks, where the travel time of each link depends on the time interval, is not realistic since the model and its solution violate the Non-passing Property (NPP:often referred to as FIFO) of real phenomena. Furthermore, solving the problem needs much more computational and memory complexity than the general shortest path problem. A new model for Time-dependent Networks where the flow speeds of each link depend on time interval, is suggested. The model is more realistic since its solution maintains the NPP. Solving the problem needs just a little more computational complexity, and the same memory complexity, as the general shortest path problem. A solution algorithm modified from Dijkstra's label setting algorithm is presented. We extend this model to the problem of Minimum Expected Time Path in Time-dependent Stochastic Networks where flow speeds of each link change statistically on each time interval. A solution method using the Kth-shortest Path algorithm is presented.