• Title/Summary/Keyword: Test Network

Search Result 3,531, Processing Time 0.035 seconds

A Measure of Electric Network Centrality Due to Multiple Contingencies (다중고장에 대한 전기 네트워크 구심성 척도)

  • Dosanoa, Rodel D.;Song, Hwa-Chang;Lee, Byong-Jun
    • Proceedings of the KIEE Conference
    • /
    • 2008.07a
    • /
    • pp.286-287
    • /
    • 2008
  • This paper proposes a power system blackout model and devises a method of identification and selection of higher-order contingencies that may threaten power system security. To study how failures spread in power grids, network observability based on topological concept is utilized which provide a means of monitoring network evolutions due to multiple contingencies. The simulations and results are presented using the IEEE 118-bus test system.

  • PDF

Method of Collecting Information and Setting Environment to Automate Performance Test in a Large Communication Server Platform (대규모 통신 서버 환경하에서의 성능시험 자동화를 위한 환경 설정 및 수집 방법)

  • Chun Jae-Kyu;Suk Seung-Hak;Yoo Jae-Hyoung
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2006.06c
    • /
    • pp.130-132
    • /
    • 2006
  • 해당 논문에서는 많은 수의 서버로 구성된 환경에서의 자동화된 성능카운터 설정 및 수집 방안에 대해서 제시하고 대규모 시스템일 경우 많은 시간이 소요되고 번거로운 작업에 대한 자동화 및 카운터 설정, 제어를 위한 스크립트 제시, 리포트 자동 생성 방안을 제시하여 효율적인 시험 및 분석방안에 대해서 설명한다.

  • PDF

Comparison of EKF and UKF on Training the Artificial Neural Network

  • Kim, Dae-Hak
    • Journal of the Korean Data and Information Science Society
    • /
    • v.15 no.2
    • /
    • pp.499-506
    • /
    • 2004
  • The Unscented Kalman Filter is known to outperform the Extended Kalman Filter for the nonlinear state estimation with a significance advantage that it does not require the computation of Jacobian but EKF has a competitive advantage to the UKF on the performance time. We compare both algorithms on training the artificial neural network. The validation data set is used to estimate parameters which are supposed to result in better fitting for the test data set. Experimental results are presented which indicate the performance of both algorithms.

  • PDF

Construction of Gene Interaction Networks from Gene Expression Data Based on Evolutionary Computation (진화연산에 기반한 유전자 발현 데이터로부터의 유전자 상호작용 네트워크 구성)

  • Jung Sung Hoon;Cho Kwang-Hyun
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.10 no.12
    • /
    • pp.1189-1195
    • /
    • 2004
  • This paper investigates construction of gene (interaction) networks from gene expression time-series data based on evolutionary computation. To illustrate the proposed approach in a comprehensive way, we first assume an artificial gene network and then compare it with the reconstructed network from the gene expression time-series data generated by the artificial network. Next, we employ real gene expression time-series data (Spellman's yeast data) to construct a gene network by applying the proposed approach. From these experiments, we find that the proposed approach can be used as a useful tool for discovering the structure of a gene network as well as the corresponding relations among genes. The constructed gene network can further provide biologists with information to generate/test new hypotheses and ultimately to unravel the gene functions.

Dynamic Network Loading Method and Its Application (동적 네트워크 로딩 방법 및 적용에 관한 연구)

  • 한상진
    • Journal of Korean Society of Transportation
    • /
    • v.20 no.1
    • /
    • pp.101-110
    • /
    • 2002
  • This study first explains general features of traffic assignment models and network loading methods, and investigates the relationship between them. Then it introduces a dynamic network loading method, which accounts far time variable additionally. First of all, this study suggests that it is important to consider some requirements for the dynamic network loading, such as causality, FIFO(First-In-First-Out) discipline, the flow propagation, and the flow conservation. The details of dynamic network loafing methods are explained in the form of algorithm, and numerical examples are shown in the test network by adopting deterministic queuing model for a link Performance function.

A Performance Evaluation for IPoIB Protocol in Channel based Network (채널기반형 네트웍에서의 IPoIB 프로토콜 성능평가)

  • Jeon, Ki-Man;Min, Soo-Young;Kim, Young-Wan
    • Proceedings of the KIEE Conference
    • /
    • 2004.11c
    • /
    • pp.687-689
    • /
    • 2004
  • As using of network increases rapidly, performance of system has been deteriorating because of the overhead and bottleneck. Nowadays, High speed I/O network standard, that is a sort of PCI Express, HyperTransport, InfiniBand, and so on, has come out to improve the limites of traditional I/O bus. The InfiniBand Architecture(IBA) provides some protocols to service the applications such as SDP, SRP and IPoIB. In our paper, We explain the architecture of IPoIB (IP over InfiniBand) and its features in channel based I/O network. And so we provide a performance evaluation result of IPoIB which is compared with current network protocol. Our experimental results also show that IPoIB is batter than TCP/IP protocol. For this test, We use the dual processor server systems and Linux Redhat 9.0 operating system.

  • PDF

Experimental Studies of neural Network Control Technique for Nonlinear Systems (신경회로망을 이용한 비선형 시스템 제어의 실험적 연구)

  • Jeong, Seul;Yim, Sun-Bin
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.7 no.11
    • /
    • pp.918-926
    • /
    • 2001
  • In this paper, intelligent control method using neural network as a nonlinear controller is presented. Simulation studies for three link rotary robot are performed. Neural network controller is implemented on DSP board in PC to make real time computing possible. On-line training algorithms for neural network control are proposed. As a test-bed, a large x-y table was build and interface with PC has been implemented. Experiments such as inverted pendulum control and large x-y table position control are performed. The results for different PD controller gains with neural network show excellent position tracking for circular trajectory compared with those for PD controller only. Neural control scheme also works better for controlling inverted pendulum on x-y table.

  • PDF

Experimental Studies on Neural Network Force Tracking Control Technique for Robot under Unknown Environment (미정보 환경 하에서 신경회로망 힘추종 로봇 제어 기술의 실험적 연구)

  • Jeong, Seul;Yim, Sun-Bin
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.8 no.4
    • /
    • pp.338-344
    • /
    • 2002
  • In this paper, neural network force tracking control is proposed. The conventional impedance function is reformulated to have direct farce tracking capability. Neural network is used to compensate for all the uncertainties such as unknown robot dynamics, unknown environment stiffness, and unknown environment position. On line training signal of farce error for neural network is formulated. A large x-y table is built as a test-bed and neural network loaming algorithm is implemented on a DSP board mounted in a PC. Experimental studies of farce tracking on unknown environment for x-y table robot are presented to confirm the performance of the proposed technique.

Heuristics for the Access Network Design Problem in UMTS Mobile Communication Networks (UMTS 이동통신망의 액세스망 설계 문제의 해법에 관한 연구)

  • Kim, Hu-Gon;Chung, Yong-Joo;Paik, Chun-Hyun
    • Korean Management Science Review
    • /
    • v.27 no.3
    • /
    • pp.1-14
    • /
    • 2010
  • In this paper we study the access network design problem in Universal Mobile Telecommunication Systems (UMTS) networks. Given the location of radio base stations (node-Bs), their traffic demands, and the candidate facility centers for locating radio network controllers (RNCs), the problem is to determine the configuration of access network, including the number and location of facility centers, the number of RNCs in each facility center, and the links between RNCs and node-Bs, with the objective being to design such a network at the minimum cost. We provide a mathematical formulation of the problem with constraints on RNC and node-B capacities, along with a lower bounding method. We develop a heuristic algorithm with two different initial solution methods designed to strengthen the solution quality. The computational efficacy of their procedures is then demonstrated on a number of test problems.

A Study on Distance Measurement using CSS and RSSI in WPAN (개인 무선네트워크에서 CSS 방식과 RSSI 를 이용한 거리측정에 관한 연구)

  • Kwon, Tai-Gil;Cho, Jin-Woong;Lim, Seung-Ok;Lee, Jang-Yeon;Lee, Hyeon-Seok;Won, Yun-Jae
    • Proceedings of the IEEK Conference
    • /
    • 2008.06a
    • /
    • pp.321-322
    • /
    • 2008
  • CSS(Chirp Spread Spectrum) technology adopt SDS-TWR algorithms of TOA(Time of Arrival) using velocity of specific medium and ToF(Time of Flight) to measure a distance, but this method always has a regular error on distance regardless of a real distance, as a result, in far distance, it decrease a error on distance relatively, but in near distance, it increase a error on distance relatively. in this paper, we propose and test new method measuring a distance more precisely in near distance using CSS and RSSI

  • PDF