• Title/Summary/Keyword: Deterministic algorithm

Search Result 331, Processing Time 0.031 seconds

A Study on the Parallel Routing in Hybrid Optical Networks-on-Chip (하이브리드 광학 네트워크-온-칩에서 병렬 라우팅에 관한 연구)

  • Seo, Jung-Tack;Hwang, Yong-Joong;Han, Tae-Hee
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.48 no.8
    • /
    • pp.25-32
    • /
    • 2011
  • Networks-on-chip (NoC) is emerging as a key technology to overcome severe bus traffics in ever-increasing complexity of the Multiprocessor systems-on-chip (MPSoC); however traditional electrical interconnection based NoC architecture would be faced with technical limits of bandwidth and power consumptions in the near future. In order to cope with these problems, a hybrid optical NoC architecture which use both electrical interconnects and optical interconnects together, has been widely investigated. In the hybrid optical NoCs, wormhole switching and simple deterministic X-Y routing are used for the electrical interconnections which is responsible for the setup of routing path and optical router to transmit optical data through optical interconnects. Optical NoC uses circuit switching method to send payload data by preset paths and routers. However, conventional hybrid optical NoC has a drawback that concurrent transmissions are not allowed. Therefore, performance improvement is limited. In this paper, we propose a new routing algorithm that uses circuit switching and adaptive algorithm for the electrical interconnections to transmit data using multiple paths simultaneously. We also propose an efficient method to prevent livelock problems. Experimental results show up to 60% throughput improvement compared to a hybrid optical NoC and 65% power reduction compared to an electrical NoC.

Research on Optimal Deployment of Sonobuoy for Autonomous Aerial Vehicles Using Virtual Environment and DDPG Algorithm (가상환경과 DDPG 알고리즘을 이용한 자율 비행체의 소노부이 최적 배치 연구)

  • Kim, Jong-In;Han, Min-Seok
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.15 no.2
    • /
    • pp.152-163
    • /
    • 2022
  • In this paper, we present a method to enable an unmanned aerial vehicle to drop the sonobuoy, an essential element of anti-submarine warfare, in an optimal deployment. To this end, an environment simulating the distribution of sound detection performance was configured through the Unity game engine, and the environment directly configured using Unity ML-Agents and the reinforcement learning algorithm written in Python from the outside communicated with each other and learned. In particular, reinforcement learning is introduced to prevent the accumulation of wrong actions and affect learning, and to secure the maximum detection area for the sonobuoy while the vehicle flies to the target point in the shortest time. The optimal placement of the sonobuoy was achieved by applying the Deep Deterministic Policy Gradient (DDPG) algorithm. As a result of the learning, the agent flew through the sea area and passed only the points to achieve the optimal placement among the 70 target candidates. This means that an autonomous aerial vehicle that deploys a sonobuoy in the shortest time and maximum detection area, which is the requirement for optimal placement, has been implemented.

Detecting Nonlinearity of Hydrologic Time Series by BDS Statistic and DVS Algorithm (BDS 통계와 DVS 알고리즘을 이용한 수문시계열의 비선형성 분석)

  • Choi, Kang Soo;Kyoung, Min Soo;Kim, Soo Jun;Kim, Hung Soo
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.29 no.2B
    • /
    • pp.163-171
    • /
    • 2009
  • Classical linear models have been generally used to analyze and forecast hydrologic time series. However, there is growing evidence of nonlinear structure in natural phenomena and hydrologic time series associated with their patterns and fluctuations. Therefore, the classical linear techniques for time series analysis and forecasting may not be appropriate for nonlinear processes. In recent, the BDS (Brock-Dechert-Scheinkman) statistic instead of conventional techniques has been used for detecting nonlinearity of time series. The BDS statistic was derived from the statistical properties of the correlation integral which is used to analyze chaotic system and has been effectively used for distinguishing nonlinear structure in dynamic system from random structures. DVS (Deterministic Versus Stochastic) algorithm has been used for detecting chaos and stochastic systems and for forecasting of chaotic system. This study showed the DVS algorithm can be also used for detecting nonlinearity of the time series. In this study, the stochastic and hydrologic time series are analyzed to detect their nonlinearity. The linear and nonlinear stochastic time series generated from ARMA and TAR (Threshold Auto Regressive) models, a daily streamflow at St. Johns river near Cocoa, Florida, USA and Great Salt Lake Volume (GSL) data, Utah, USA are analyzed, daily inflow series of Soyang dam and the results are compared. The results showed the BDS statistic is a powerful tool for distinguishing between linearity and nonlinearity of the time series and DVS plot can be also effectively used for distinguishing the nonlinearity of the time series.

Game Theory Based Coevolutionary Algorithm: A New Computational Coevolutionary Approach

  • Sim, Kwee-Bo;Lee, Dong-Wook;Kim, Ji-Yoon
    • International Journal of Control, Automation, and Systems
    • /
    • v.2 no.4
    • /
    • pp.463-474
    • /
    • 2004
  • Game theory is a method of mathematical analysis developed to study the decision making process. In 1928, Von Neumann mathematically proved that every two-person, zero-sum game with many pure finite strategies for each player is deterministic. In the early 50's, Nash presented another concept as the basis for a generalization of Von Neumann's theorem. Another central achievement of game theory is the introduction of evolutionary game theory, by which agents can play optimal strategies in the absence of rationality. Through the process of Darwinian selection, a population of agents can evolve to an Evolutionary Stable Strategy (ESS) as introduced by Maynard Smith in 1982. Keeping pace with these game theoretical studies, the first computer simulation of coevolution was tried out by Hillis. Moreover, Kauffman proposed the NK model to analyze coevolutionary dynamics between different species. He showed how coevolutionary phenomenon reaches static states and that these states are either Nash equilibrium or ESS in game theory. Since studies concerning coevolutionary phenomenon were initiated, there have been numerous other researchers who have developed coevolutionary algorithms. In this paper we propose a new coevolutionary algorithm named Game theory based Coevolutionary Algorithm (GCEA) and we confirm that this algorithm can be a solution of evolutionary problems by searching the ESS. To evaluate this newly designed approach, we solve several test Multiobjective Optimization Problems (MOPs). From the results of these evaluations, we confirm that evolutionary game can be embodied by the coevolutionary algorithm and analyze the optimization performance of our algorithm by comparing the performance of our algorithm with that of other evolutionary optimization algorithms.

A Self-Adaptive Agorithm for Optimizing Random Early Detection(RED) Dynamics (라우터 버퍼 관리 기반 체증 제어 방식의 최적화를 위한 자체 적응 알고리즘)

  • Hong, Seok-Won;Yu, Yeong-Seok
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.11
    • /
    • pp.3097-3107
    • /
    • 1999
  • Recently many studies have been done on the Random Early Detection(RED) algorithm as an active queue management and congestion avoidance scheme in the Internet. In this paper we first overview the characteristics of RED and the modified RED algorithms in order to understand the current status of these studies. Then we analyze the RED dynamics by investigating how RED parameters affect router queue behavior. We show the cases when RED fails since it cannot react to queue state changes aggressively due to the deterministic use of its parameters. Based on the RED parameter analysis, we propose a self-adaptive algorithm to cope with this RED weakness. In this algorithm we make two parameters be adjusted themselves depending on the queue states. One parameter is the maximum probability to drop or mark the packet at the congestion state. This parameter can be adjusted to react the long burst of traffic, consequently reducing the congestion disaster. The other parameter is the queue weight which is also adjusted aggressively in order for the average queue size to catch up with the current queue size when the queue moves from the congestion state to the stable state.

  • PDF

Practical Pinch Torque Detection Algorithm for Anti-Pinch Window Control System Application

  • Lee, Hye-Jin;Ra, Won-Sang;Yoon, Tae-Sung;Park, Jin-Bae
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.2526-2531
    • /
    • 2005
  • A practical pinch torque estimator based on the Kalman filter is proposed for low-cost anti-pinch window control systems. To obtain the accurate angular velocity from Hall-effect sensor measurements, the angular velocity calculation algorithm is executed with additional procedures for removing the measurement noises. Apart from the previous works using the angular velocity estimates and torque estimates for detecting the pinched condition, the torque rate is augmented to the system model and the proposed pinch estimator is derived by applying the steady-state Kalman filter recursion to the model. The motivation of this approach comes from the idea that the bias errors in torque estimates due to the motor parameter uncertainties can be almost eliminated by introducing the torque rate state. For detecting the pinched condition, a systematic way to determine the threshold level of the torque rate estimates is also suggested via the deterministic estimation error analysis. Simulation results are given to certify the pinch detection performance of the proposed algorithm and its robustness against the motor parameter uncertainties.

  • PDF

A Numerical Study of Smoke Movement In Atrium Space (아트리움 공간에 있어서 연기 유동에 관한 수치해석적 연구)

  • 노재성;유홍선;정연태;김충익;윤명오
    • Fire Science and Engineering
    • /
    • v.11 no.4
    • /
    • pp.3-14
    • /
    • 1997
  • The smoke filling process for the atrium space containing a fire source is simulated using two types of deterministic fire model : Zone model and Field model. The zone model used is the CFAST(version 1.6) model developed at the Building and Fire Research Laboratories, NIST in the USA. The field model is a self-developed frie field model based on Computational Fluid Dynamic (CFD) theories. This article is focused on finding out the smoke movement and temperature distribution in atrium space which is cubic in shape. For solving the liked set of velocity and pressure equation, the PISO algorithm, which strengthened the velocity-pressure coupling, was used. Since PISO algorithm is a time-marching procedure, computing time si very fast. A computational procedure for predicting velocity and temperature distribution in fire-induced flow is based on the solution, in finite volume method and non-staggered grid system, of 3-dimensional equations for the conservation of mass, momentum, energy, species and so forth. The fire model i.e Zone model and Field model predicted similar results for clear heights and the smoke layer temperature.

  • PDF

A MULTIOBJECTIVE MODEL OF WHOLESALER-RETAILERS' PROBLEM VIA GENETIC ALGORITHM

  • MAHAPATRA NIRMAL KUMAR;BHUNIA ASOKE KUMAR;MAITI MANORANJAN
    • Journal of applied mathematics & informatics
    • /
    • v.19 no.1_2
    • /
    • pp.397-414
    • /
    • 2005
  • In the existing literature, most of the purchasing models were developed only for retailers problem ignoring the constraint of storage capacity of retailers shop/showroom. In this paper, we have developed a deterministic model of wholesaler-retailers' problem of single product. The storage capacity of wholesaler's warehouse/showroom and retailers' showroom/shop are assumed to be finite. The items are transported from wholesaler's warehouse to retailers' Own Warehouse (OW) in a lot. The customer's demand is assumed to be displayed inventory level dependent. Demands are met from OW and that spaces of OW will immediately be filled by shifting the same amount from the Rented Warehouse (RW) till the RW is empty. The time duration between selling from OW and filling up its space by new ones from RW is negligible. According to relative size of the retailers' existing (own) warehouse capacity and the demand factors, different scenarios are identified. Our objectives are to optimize the cost functions of wholesaler and two retailers separately. To solve this problem, a real coded Genetic Algorithm (GA) with roulette wheel selection/reproduction, whole arithmetic crossover and non-uniform mutation is developed. Finally a numerical example is presented to illustrate the results for different scenarios. To compare the results of GA, Generalised Reduced Gradient Method has been used for the problem. Also, a sensitivity analysis has been performed to study the variations of the optimal average cost with respect to the different parameters.

Fast image stitching method for handling dynamic object problems in Panoramic Images

  • Abdukholikov, Murodjon;Whangbo, Taegkeun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.11
    • /
    • pp.5419-5435
    • /
    • 2017
  • The construction of panoramic images on smartphones and low-powered devices is a challenging task. In this paper, we propose a new approach for smoothly stitching images on mobile phones in the presence of moving objects in the scene. Our main contributions include handling moving object problems, reducing processing time, and generating rectangular panoramic images. First, unique and robust feature points are extracted using fast ORB method and a feature matching technique is applied to match the extracted feature points. After obtaining good matched feature points, we employ the non-deterministic RANSAC algorithm to discard wrong matches, and the hommography transformation matrix parameters are estimated with the algorithm. Afterward, we determine precise overlap regions of neighboring images and calculate their absolute differences. Then, thresholding operation and noise removal filtering are applied to create a mask of possible moving object regions. Sequentially, an optimal seam is estimated using dynamic programming algorithm, and a combination of linear blending with the mask information is applied to avoid seam transition and ghosting artifacts. Finally, image-cropping operation is utilized to obtain a rectangular boundary image from the stitched image. Experiments demonstrate that our method is able to produce panoramic images quickly despite the existence of moving objects.

A Regularized Mixed Norm Multi-Channel Image Restoration Algorithm (정규화 혼합 Norm을 이용한 다중 채널 영상 복원 방식)

  • 홍민철;신요안;이원철
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.2C
    • /
    • pp.272-282
    • /
    • 2004
  • This paper introduces a regularized mixed norm multi-channel image restoration algorithm using both within-and between- channel deterministic information. For each channel a functional which combines the least mean squares (LMS), the least mean fourth (LMF), and a smoothing functional is proposed. We introduce a mixed norm parameter that controls the relative contribution between the LMS and the LMF, and a regularization parameter defining the degree of smoothness of the solution, where both parameters are updated at each iteration according to the noise characteristics of each channel. The novelty of the proposed algorithm is that no knowledge of the noise distribution for each channel is required and that the parameters mentioned above are adjusted based on the partially restored image.