• Title/Summary/Keyword: network optimization

Search Result 2,239, Processing Time 0.034 seconds

A Dynamical N-Queen Problem Solver using Hysteresis Neural Networks

  • Yamamoto, Takao;Jin′no, Kenya;Hirose, Haruo
    • Proceedings of the IEEK Conference
    • /
    • 2002.07a
    • /
    • pp.254-257
    • /
    • 2002
  • In previous study about combinatorial optimization problem solver by using neural network, since Hopfield method, to converge into the optimum solution sooner and certainer is regarded as important. Namely, only static states are considered as the information. However, from a biological point of view, the dynamical system has lately attracted attention. Then we propose the "dynamical" combinatorial optimization problem solver using hysteresis neural network. In this article, the proposal system is evaluated by the N-Queen problem.

  • PDF

Pre-layout Clock Analysis with Static Timing Analysis Algorithm to Optimize Clock Tree Synthesis (Static Timing Analysis (STA) 기법을 이용한 Clock Tree Synthesis (CTS) 최적화에 관한 연구)

  • Park, Joo-Hyun;Ryu, Seong-Min;Jang, Myung-Soo;Choi, Sea-Hawon;Choi, Kyu-Myung;Cho, Jun-Dong;Kong, Jeong-Taek
    • Proceedings of the KIEE Conference
    • /
    • 2004.11c
    • /
    • pp.391-393
    • /
    • 2004
  • For performance and stability of a synchronized system, we need an efficient Clock Tree Synthesis(CTS) methodology to design clock distribution networks. In a system-on-a-chip(SOC) design environment, CTS effectively distributes clock signals from clock sources to synchronized points on layout design. In this paper, we suggest the pre-layout analysis of the clock network including gated clock, multiple clock, and test mode CTS optimization. This analysis can help to avoid design failure with potential CTS problems from logic designers and supply layout constraints so as to get an optimal clock distribution network. Our new design flow including pre-layout CTS analysis and structural violation checking also contributes to reduce design time significantly.

  • PDF

A Boolean Logic Extraction for Multiple-level Logic Optimization (다변수 출력 함수에서 공통 논리식 추출)

  • Kwon, Oh-Hyeong
    • Journal of the Korea Computer Industry Society
    • /
    • v.7 no.5
    • /
    • pp.473-480
    • /
    • 2006
  • Extraction is tile most important step in global minimization. Its approache is to identify and extract subexpressions, which are multiple-cubes or single-cubes, common to two or more expressions which can be used to reduce the total number of literals in a Boolean network. Extraction is described as either algebraic or Boolean according to the trade-off between run-time and optimization. Boolean extraction is capable of providing better results, but difficulty in finding common Boolean divisors arises. In this paper, we present a new method for Boolean extraction to remove the difficulty. The key idea is to identify and extract two-cube Boolean subexpression pairs from each expression in a Boolean network. Experimental results show the improvements in the literal counts over the extraction in SIS for some benchmark circuits.

  • PDF

Multiresolution Image Browsing Techniques and Optimization for Image Retrieval System (영상 검색 시스템을 위한 다해상도 영상 검색 브라우징 방법과 최적화)

  • 박대철
    • Journal of Broadcast Engineering
    • /
    • v.1 no.2
    • /
    • pp.96-107
    • /
    • 1996
  • In case of remote image retrieval via shared network or low speed link in order to make a decision for target image problems such as transmission delay are encountered. In this paper browsing and optimization techniques are proposed for fast retrieval of Image by the multiresolution representation and progressive transmission. The proposed network model was analyzed and evaluated for system's performance improvement. Interactive user-system using several multiresolution representation has shown better performance in transmission delay minimization over the single resolution image retrieval system.

  • PDF

A Combined Model of Trip Distribution, Mode Choice and Traffic Assignment (교통분포, 수단선택 및 교통할당의 결합모형)

  • Park, Tae-Hyung
    • IE interfaces
    • /
    • v.15 no.4
    • /
    • pp.474-482
    • /
    • 2002
  • In this paper, we propose a parametric optimization approach to simultaneously determining trip distribution, mode choice, and user-equilibrium assignment. In our model, mode choice decisions are based on a binomial logit model and passenger and cargo demands are divided into appropriate mode according to the user equilibrium minimum travel time. Underlying network consists of road and rail networks combined and mode choice available is auto, bus, truck, passenger rail, and cargo rail. We provide an equivalent convex optimization problem formulation and efficient algorithm for solving this problem. The proposed algorithm was applied to a large scale network examples derived from the National Intermodal Transportation Plan (2000-2019).

Noise Optimization of the Cooling Fan in an Engine Room by using Neural Network (신경망이론을 적용한 엔진룸내의 냉각팬 소음 최적화 연구)

  • Chung, Ki-Hoon;Choi, Han-Lim;Kim, Bum-Sub;Kim, Jae-Seung;Lee, Duck-Joo
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2002.11b
    • /
    • pp.116-121
    • /
    • 2002
  • Axial fans are widely used in heavy machines due to their ability to produce high flow rate for cooling of engines. At the same time, the noise generated by these fans causes one of the most serious problems. This work is concerned with the low noise technique of discrete frequency noise. To calculate the unsteady resultant force over the fan blade in an unsymmetric engine room. Time-Marching Free-Wake Method is used. From the calculations of unsteady force on fan blades, noise signal of an engine cooling fan is calculated by using an acoustic similarity law. Noise optimization is obtained from Neural Network which is constructed based on the calculated flow rate and noise spectrum.

  • PDF

Scheduling and Power Control Framework for Ad hoc Wireless Networks

  • Casaquite, Reizel;Yoon, Myung-Hyun;Hwang, Won-Joo
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.6
    • /
    • pp.745-753
    • /
    • 2007
  • The wireless medium is known to be time-varying which could affect and result to a poor network's performance. As a solution, an opportunistic scheduling and power control algorithm based on IEEE 802.11 MAC protocol is proposed in this paper. The algorithm opportunistically exploits the channel condition for better network performance. Convex optimization problems were also formulated i.e. the overall transmission power of the system is minimized and the "net-utility" of he system is maximized. We have proven that an optimal transmission power vector may exist, satisfying the maximum power and SINR constraints at all receivers, thereby minimizing overall transmission power and maximizing net-utility of the system.

  • PDF

Optimal Planning of Multiple Routes in Flexible Manufacturing System (유연생산 시스템의 최적 복수 경로 계획)

  • Kim Jeongseob
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.29 no.4
    • /
    • pp.175-187
    • /
    • 2004
  • We consider the simultaneous selection of part routes for multiple part types in Flexible Manufacturing Systems (FMSs). Using an optimization framework we investigate two alternative route assignment policies. The one, called routing mix policy in the literature, specifies the optimal proportion of each part type to be produced along its alternative routes, assuming that the proportions can be kept during execution. The other one, which we propose and call pallet allocation policy, partitions the pallets assigned to each part type among the routes. The optimization framework used is a nonlinear programming superimposed on a closed queueing network model of an FMS which produces multiple part types with distinct repeated visits to certain workstations. The objective is to maximize the weighted throughput. Our study shows that the simultaneous use of multiple routes leads to reduced bottleneck utilization, improved workload balance, and a significant increase in the FMS's weighted throughput, without any additional capital investments. Based on numerical work, we also conjecture that pallet allocation policy is more robust than routing mix policy, operationally easier to implement, and may yield higher revenues.

Development of a Modified Random Signal-based Learning using Simulated Annealing

  • Han, Chang-Wook;Lee, Yeunghak
    • Journal of Multimedia Information System
    • /
    • v.2 no.1
    • /
    • pp.179-186
    • /
    • 2015
  • This paper describes the application of a simulated annealing to a random signal-based learning. The simulated annealing is used to generate the reinforcement signal which is used in the random signal-based learning. Random signal-based learning is similar to the reinforcement learning of neural network. It is poor at hill-climbing, whereas simulated annealing has an ability of probabilistic hill-climbing. Therefore, hybridizing a random signal-based learning with the simulated annealing can produce better performance than before. The validity of the proposed algorithm is confirmed by applying it to two different examples. One is finding the minimum of the nonlinear function. And the other is the optimization of fuzzy control rules using inverted pendulum.

Using Genetic Algorithms to Support Artificial Neural Networks for the Prediction of the Korea stock Price Index

  • Kim, Kyoung-jae;Ingoo han
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2000.04a
    • /
    • pp.347-356
    • /
    • 2000
  • This paper compares four models of artificial neural networks (ANN) supported by genetic algorithms the prediction of stock price index. Previous research proposed many hybrid models of ANN and genetic algorithms(GA) in order to train the network, to select the feature subsets, and to optimize the network topologies. Most these studies, however, only used GA to improve a part of architectural factors of ANN. In this paper, GA simultaneously optimized multiple factors of ANN. Experimental results show that GA approach to simultaneous optimization for ANN (SOGANN3) outperforms the other approaches.

  • PDF