• 제목/요약/키워드: Mixed Network

검색결과 532건 처리시간 0.025초

전광 WDM 링 통신망에서 수요집적 및 광파장 경로설정 (Traffic Grooming and Wavelength Routing for All Optical WDM-Ring Network)

  • 윤문길
    • 한국경영과학회지
    • /
    • 제26권1호
    • /
    • pp.33-44
    • /
    • 2001
  • In this paper, we address a problem of traffic grooming and wavelength routing in all optical WDM ring networks. Given a traffic demand for each node pair, we should aggregate the traffic onto lightpaths between pairs of nodes to transport the demand, and set up the routing path for each lightpath with minimum number of wavelengths to be assigned to lightpaths. In this paper, we formulate our problem as a mixed Integer Programming model. Owing to the problem complexity, it is hard to find an optimal solution for our problem. hence, we develop a heuristic algorithm to solve our problem efficiently. From the computational experiments, we can find the proposed heuristic is very satisfactory in both the computation time and the solution quality generated.

  • PDF

상관계수와 뉴럴 네트워크를 이용한 뇌 유발 전위의 분류 (CLASSIFICATION OF BRAIN EVOKED POTENTIAL USING CORRELATION COEFFICIENTS AND NEURAL NETWORK)

  • 지영준;박광석
    • 대한의용생체공학회:학술대회논문집
    • /
    • 대한의용생체공학회 1995년도 추계학술대회
    • /
    • pp.189-192
    • /
    • 1995
  • In Visually Evoked Potentials(VEP) or Auditory Evoked Potentials(AEP), the components by the stimulation and the components which are irrelevant to the stimulation(noise or nonstationary spontaneous EEG) are mixed together. So one should average hundreds of EP waves to extract the components by the stimulation only. In this study, we have classified EP's, which are the responses of the different stimulations and different states of subjects. To classify the EP waves, the cross-correlation coefficients and neural network method(error back propagation) are used and compared.

  • PDF

Harmonic Elimination and Reactive Power Compensation with a Novel Control Algorithm based Active Power Filter

  • Garanayak, Priyabrat;Panda, Gayadhar
    • Journal of Power Electronics
    • /
    • 제15권6호
    • /
    • pp.1619-1627
    • /
    • 2015
  • This paper presents a power system harmonic elimination using the mixed adaptive linear neural network and variable step-size leaky least mean square (ADALINE-VSSLLMS) control algorithm based active power filter (APF). The weight vector of ADALINE along with the variable step-size parameter and leakage coefficient of the VSSLLMS algorithm are automatically adjusted to eliminate harmonics from the distorted load current. For all iteration, the VSSLLMS algorithm selects a new rate of convergence for searching and runs the computations. The adopted shunt-hybrid APF (SHAPF) consists of an APF and a series of 7th tuned passive filter connected to each phase. The performance of the proposed ADALINE-VSSLLMS control algorithm employed for SHAPF is analyzed through a simulation in a MATLAB/Simulink environment. Experimental results of a real-time prototype validate the efficacy of the proposed control algorithm.

Ad-hoc 망에서 채널의 부분정보를 이용한 스케줄링 기법 (A Scheduling Scheme using Partial Channel Information for Ad-hoc Networks)

  • 신수영;장영민
    • 한국통신학회논문지
    • /
    • 제28권11B호
    • /
    • pp.1031-1037
    • /
    • 2003
  • 본 논문에서는 Ad-hoc 망인 블루투스 시스템의 각 채널의 질 정보를 이용하여 대역폭을 효율적으로 사용하는 새로운 스케줄링 기법을 제시하였다. 특히 제시한 기법은 채널의 불균형한 환경과 여러 가지 특성의 데이터가 혼합되어 전송되는 경우, 특정한 채널에 데이터가 집중되는 경우에 효과적인 것으로 나타났다. 각 채널의 부분 정보를 이용하여 가중치를 계산하고 그 값을 GPS 알고리즘을 수정한 새로운 스케줄링 기법에 적용하였으며 NS-2와 블루학 시뮬레이션을 통해 제시한 기법의 효율성을 검증하였다.

무선 가입자를 포함한 회선교환망에서의 최적의 FCL (Frequently Called List) 테이블 크기에 관한 연구 (Research on optimal FCL (Frequently Called List) table sizes in a circuit-switched network including wireless subscribers)

  • 김재현;이종규
    • 전자공학회논문지A
    • /
    • 제31A권10호
    • /
    • pp.1-9
    • /
    • 1994
  • In this paper, we have studied optimal FCL(Frequently Called List) table sizes in a grid topology circuit-switched network including wireless subscribers. The FCL table gives the position information of a destination subscriber for a call. When the call is generated in a node, this call is routed by the referenced position information of the destination subscriber in FCL table. In this paper, we have proposed an efficient routing algorithm, mixed FSR(Flood Search Routing) and DAR(Dynamic Adaptive Routing), considering moving wireless subscribers. Also, we have simulated hit ratio and incorrect ratio as performance parameters, consequently proposed the object function composed of table search time, hit ratio, incorrect ratio, FSR time and DAR time, and derived the optimal FCL table size by using it.

  • PDF

홉필드 신경회로망을 이용한 배전계통계획의 최적 경로 탐색 (Optimal Routing of Distribution System Planning using Hopfield Neural Network)

  • 김대욱;이명환;김병섭;신중린;채명석
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1999년도 하계학술대회 논문집 C
    • /
    • pp.1117-1119
    • /
    • 1999
  • This paper presents a new approach for the optimal routing problem of distribution system planning using the well known Hopfield Neural Network(HNN) method. The optimal routing problem(ORP) in distribution system planning(DSP) is generally formulated as combinational mixed integer problem with various equality and inequality constraints. For the exceeding nonlinear characteristics of the ORP most of the conventional mathematical methods often lead to a local minimum. In this paper, a new approach was made using the HNN method for the ORP to overcome those disadvantages. And for this approach, a appropriately designed energy function suited for the ORP was proposed. The proposed algorithm has been evaluated through the sample distribution planning problem and the simulation results are presented.

  • PDF

Design and Configuration of Reconfigurable ATM Networks with Unreliable Links

  • Lee, Jong-Hyup
    • ETRI Journal
    • /
    • 제21권4호
    • /
    • pp.9-22
    • /
    • 1999
  • This paper considers a problem of configuring both physical backbone and logical virtual path (VP) networks in a reconfigurable asynchronous transfer mode (ATM) network where links are subject to failures. The objective is to determine jointly the VP assignment, the capacity assignment of physical links and the bandwidth allocation of VPs, and the routing assignment of traffic demand at least cost. The network cost includes backbone link capacity expansion cost and penalty cost for not satisfying the maximum throughput of the traffic due to link failures or insufficient link capacities. The problem is formulated as a zero-one non-linear mixed integer programming problem, for which an effective solution procedure is developed by using a Lagrangean relaxation technique for finding a lower bound and a heuristic method exploited for improving the upper bound of any intermediate solution. The solution procedure is tested for its effectiveness with various numerical examples.

  • PDF

On Finding the Maximum Capacity Flow in Networks

  • Lee, Chong-Hyung;Park, Dong-Ho;Lee, Seung-Min
    • 한국신뢰성학회:학술대회논문집
    • /
    • 한국신뢰성학회 2002년도 정기학술대회
    • /
    • pp.297-302
    • /
    • 2002
  • An efficient method is developed to obtain the maximum capacity flow for a network when its simple paths are known. Most of the existing techniques need to convert simple paths into minimal cuts, or to determine the order of simple paths to be applied in the process to reach the correct result. In this paper, we propose a method based on the concepts of signed simple path and signed flow defined in the text. Our method involves a fewer number of arithmetic operations at each iteration, and requires fewer iterations in the whole process than the existing methods. Our method can be easily extended to a mixed network with a slight modification. Furthermore, the correctness of our method does not depend on the order of simple paths to be applied in the process.

  • PDF

Fitness Sharing Particle Swarm Optimization Approach to FACTS Installation for Transmission System Loadability Enhancement

  • Chang, Ya-Chin
    • Journal of Electrical Engineering and Technology
    • /
    • 제8권1호
    • /
    • pp.31-39
    • /
    • 2013
  • Proper installation of Flexible AC Transmission Systems (FACTS) devices in existing transmission networks can enable power systems to accommodate more power transfer with less network expansion cost. The problem to maximize transmission system loadability by determining optimal locations and settings for installations of two types of FACTS devices, namely static var compensator (SVC) and thyristor controlled series compensator (TCSC), is formulated as a mixed discrete-continuous nonlinear optimization problem (MDCP). For solving the MDCP, in the paper, the proposed method with fitness sharing technique involved in the updating process of the particle swarm optimization (PSO) algorithm, can diversify the particles over the search regions as much as possible, making it possible to achieve the optimal solution with a big probability. The modified IEEE-14 bus network and a practical power system are used to validate the proposed method.

블록 암호 ARIA를 위한 고속 암호기/복호기 설계 (Design of High Speed Encryption/Decryption Hardware for Block Cipher ARIA)

  • 하성주;이종호
    • 전기학회논문지
    • /
    • 제57권9호
    • /
    • pp.1652-1659
    • /
    • 2008
  • With the increase of huge amount of data in network systems, ultimate high-speed network has become an essential requirement. In such systems, the encryption and decryption process for security becomes a bottle-neck. For this reason, the need of hardware implementation is strongly emphasized. In this study, a mixed inner and outer round pipelining architecture is introduced to achieve high speed performance of ARIA hardware. Multiplexers are used to control the lengths of rounds for 3 types of keys. Merging of encryption module and key initialization module increases the area efficiency. The proposed hardware architecture is implemented on reconfigurable hardware, Xilinx Virtex2-pro. The hardware architecture in this study shows that the area occupied 6437 slices and 128 BRAMs, and it is translated to throughput of 24.6Gbit/s with a maximum clock frequency of 192.9MHz.