• Title/Summary/Keyword: Complete network

Search Result 514, Processing Time 0.032 seconds

Modeling of Arbitrary Shaped Power Distribution Network for High Speed Digital Systems

  • Park, Seong-Geun;Kim, Jiseong;Yook, Jong-Gwan;Park, Han-Kyu
    • Proceedings of the Korea Electromagnetic Engineering Society Conference
    • /
    • 2002.11a
    • /
    • pp.324-327
    • /
    • 2002
  • For the characterization of arbitrary shaped printed circuit board, lossy transmission line grid model based on SPICE netlist and analytical plane model based on the segmentation method are proposed in this paper. Two methods are compared with an arbitrary shaped power/ground plane. Furthermore, design considerations for the complete power distribution network structure are discussed to ensure the maximum value of the PDN impedance is low enough across the desired frequency range and to guide decoupling capacitor selection.

  • PDF

An algorithm for the preprocessing shortest path problem (최단경로문제의 사전처리 해법에 관한 연구)

  • 명영수
    • Korean Management Science Review
    • /
    • v.19 no.1
    • /
    • pp.55-66
    • /
    • 2002
  • Given a directed network, a designated arc, and lowers and upper bounds for the distance of each arc, the preprocessing shortest path problem Is a decision problem that decides whether there is some choice of distance vector such that the distance of each arc honors the given lower and upper bound restriction, and such that the designated arc is on some shortest path from a source node to a destination notre with respect to the chosen distance vector. The preprocessing shortest path problem has many real world applications such as communication and transportation network management and the problem is known to be NP-complete. In this paper, we develop an algorithm that solves the problem using the structural properties of shortest paths.

Using Animation Database Interactively on the Network

  • Tam, K.Y.;Sato, H.;Kondo, K.;Shimada, S.
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 1996.06b
    • /
    • pp.7-12
    • /
    • 1996
  • This research is on an interactive animation prototype which can be used by many users from different computers, that means a network with one server and many clients. In our research, a complete motion is represented by simple motion characteristics. We establish databases which contain all kinds of human motion characteristics. Using flexible connection and appropriate time control, we are able to recompose a sequential serial motion data. Moreover, an interactive application system is needed among the uses with a server from animator. In this research, we also investigate three methods of“connect motion database”. We are planing to use the method of connecting motion database under networks with a client-server application system.

  • PDF

Base Station Placement for Wireless Sensor Network Positioning System via Lexicographical Stratified Programming

  • Yan, Jun;Yu, Kegen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.11
    • /
    • pp.4453-4468
    • /
    • 2015
  • This paper investigates optimization-based base station (BS) placement. An optimization model is defined and the BS placement problem is transformed to a lexicographical stratified programming (LSP) model for a given trajectory, according to different accuracy requirements. The feasible region for BS deployment is obtained from the positioning system requirement, which is also solved with signal coverage problem in BS placement. The LSP mathematical model is formulated with the average geometric dilution of precision (GDOP) as the criterion. To achieve an optimization solution, a tolerant factor based complete stratified series approach and grid searching method are utilized to obtain the possible optimal BS placement. Because of the LSP model utilization, the proposed algorithm has wider application scenarios with different accuracy requirements over different trajectory segments. Simulation results demonstrate that the proposed algorithm has better BS placement result than existing approaches for a given trajectory.

Development of an Intelligent Station HMI in IEC 61850 Based Substation

  • Rim, Seong-Jeong;Zeng, Sheng-Wu;Lee, Seung-Jae
    • Journal of Electrical Engineering and Technology
    • /
    • v.4 no.1
    • /
    • pp.13-18
    • /
    • 2009
  • Because the existing Human-Machine Interface (HMI) for the conventional substation cannot dynamically indicate the configuration information of the Substation Automation System (SAS). In this paper, an intelligent station HMI is proposed for IEC 61850 based substation. The program of the proposed HMI not only can automatically generate the layout of single line diagram, but can also indicate the communication network and functions of IEDs by reading SCL files. It greatly helps monitor the operation status, communication network and each IED dynamically, such as failure detection in SAS. Furthermore, this paper presents the possibility of developing new software for SAS with the full use of IEC 61850-6. Once the software is complete, there is no need to change it when the substation is upgraded or when it is migrated to other IEC 61850 based substations, which is a cost-effective solution.

A Study on the Hopfield Neural Scheme for Data Association in Multi­Target Tracking (다중표적추적용 데이터 결합을 위한 홈필드 신경망 기법 연구)

  • Lee, Yang­-Weon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.8
    • /
    • pp.1840-1847
    • /
    • 2003
  • In this paper, we have developed the MHDA scheme for data association. This scheme is important in providing a computationally feasible alternative to complete enumeration of JPDA which is intractable. We have proved that given an artificial measurement and track's configuration, MHDA scheme converges to a proper plot in a finite number of iterations. Also, a proper plot which is not the global solution can be corrected by re­initializing one or more times. In this light, even if the performance is enhanced by using the MHDA, we also note that the difficulty in tuning the parameters of the MHDA is critical aspect of this scheme. The difficulty cat however, be overcome by developing suitable automatic instruments that will iteratively verify convergence as the network parameters vary.

Auto-Tuning of Reference Model Based PID Controller Using Immune Algorithm

  • Kim, Dong-Hwa;Park, Jin-Ill
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.12 no.3
    • /
    • pp.246-254
    • /
    • 2002
  • In this paper auto-tuning scheme of PID controller based on the reference model has been studied for a Process control system by immune algorithm. Up to this time, many sophisticated tuning algorithms have been tried in order to improve the PID controller performance under such difficult conditions. Also, a number of approaches have been proposed to implement mixed control structures that combine a PID controller with fuzzy logic. However, in the actual plant, they are manually tuned through a trial and error procedure, and the derivative action is switched off. Therefore, it is difficult to tune. Since the immune system possesses a self organizing and distributed memory, it is thus adaptive to its external environment and allows a PDP (Parallel Distributed Processing) network to complete patterns against the environmental situation. Simulation results reveal that reference model basd tuning by immune network suggested in this paper is an effective approach to search for optimal or near optimal process control.

A Study on Data Allocation Problems of Distributed Databases (분산 데이타 베이스 설계시의 자료 배정문제에 관한 연구)

  • Sin, Gi-Tae;Park, Jin-Woo
    • Asia pacific journal of information systems
    • /
    • v.1 no.1
    • /
    • pp.49-62
    • /
    • 1991
  • This paper examines the problems of database partitioning and file allocation in a fixed topology distributed computer network. The design objective is to make files as collections of attributes and to allocate these files to network nodes so that a minimum total transmission cost is achieved subject to storage capacity constraints. A mathematical model for solving the problem is formulated and, the resulting optimization problem is shown to fall in a class of NP-complete problems. A new heuristic algorithm is developed which uses the idea of allocating attributes according to the transaction requirements at each computer node and then making files using the allocated attributes. Numerical results indicate that the heuristic algorithm yields practicable low cost solutions in comparison with the existing methods which deal with the file allocation problems and database partitioning problems independently.

  • PDF

Performance Evaluation of Distributed MAC Protocol Algorithm for Efficient Multimedia Transmission (효율적인 멀티미디어 전송을 위한 분산방식 MAC 프로토콜 성능분석)

  • Kim, Jin Woo;Lee, Seong Ro
    • Journal of Korea Multimedia Society
    • /
    • v.17 no.5
    • /
    • pp.573-581
    • /
    • 2014
  • The salient features of UWB(Ultra WideBand) networks such as high-rate communications, low interference with other radio systems, and low power consumption bring many benefits to users, thus enabling several new applications such as wireless universal serial bus (WUSB) for connecting personal computers (PCs) to their peripherals and the consumer-electronics (CE) in people's living rooms. Because the size of multimedia data frame, WiMedia device must transmit the fragment of MSDU. However, when the fragment of MSDU is lost, WiMedia device maintains active mode for the time to complete the transmission MSDU, and there is a problem that unnecessary power consumption occurs. Therefore we propose new power management scheme to reduce unnecessary power consumption of WiMedia devices in the case that the fragment is lost.

Inverse optimization problem solver on use of multi-layer neural networks

  • Wang, Qianyi;Aoyama, Tomoo;Nagashima, Umpei;Kang, Eui-Sung
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.88.5-88
    • /
    • 2001
  • We propose a neural network solver for an inverse problem. The problem is that input data with complete teaching include defects and predict the defect value. The solver is constructed of a three layer neural network whose learning method is combined from BP and reconstruction learning. The input data for the defects are unknown; therefore, the circulation of an arithmetic progression replaces them; rightly, the learning procedure is not converged for the circulation data vut for the normal data. The learning is quitted after such a learning status id kept. Then, we search a minimum of the differences between teaching data and output of the circulation. Then, we search a minimum of the ...

  • PDF