• Title/Summary/Keyword: Time-deterministic

Search Result 536, Processing Time 0.035 seconds

A Few Applications of Polarity Correlation Method in a Frame of Deterministic Signals

  • Kim, io-Sasaki;Mariko Ikeda
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2002.10a
    • /
    • pp.86.1-86
    • /
    • 2002
  • Polarity correlation is a simplified version of the usual, having a possibility of real-time processing without any reduction of precision. In this paper, its applicability in deterministic signals is first explored generally, by theoretical or numerical analysis of four kinds of the typical signals. Then, based on the results, its two applications are proposed, that are detection and demodulation of FSK signals in digital communication, and time delay estimasion in ultrasonic A-mode measurement. The effectiveness of the proposed applications is confirmed by its superior implementation ability and the results of numerical experiments under practical circumstances.

  • PDF

A Development of SDS Algorithm for the Improvement of Convergence Simulation (실시간 계산에서 수령속도 개선을 위한 SDS 알고리즘의 개발)

  • Lee, Young-J.;Jang, Yong-H.;Lee, Kwon-S.
    • Proceedings of the KIEE Conference
    • /
    • 1997.07b
    • /
    • pp.699-701
    • /
    • 1997
  • The simulated annealing(SA) algorithm is a stochastic strategy for search of the ground state and a powerful tool for optimization, based on the annealing process used for the crystallization in physical systems. It's main disadvantage is the long convergence time. Therefore, this paper proposes a stochastic algorithm combined with conventional deterministic optimization method to reduce the computation time, which is called SDS(Stochastic-Deterministic-Stochastic) method.

  • PDF

Validation of time domain seakeeping codes for a destroyer hull form operating in steep stern-quartering seas

  • Van Walree, Frans;Carette, Nicolas F.A.J.
    • International Journal of Naval Architecture and Ocean Engineering
    • /
    • v.3 no.1
    • /
    • pp.9-19
    • /
    • 2011
  • The paper describes the validation of two time domain methods to simulate the behaviour of a destroyer operating in steep, stern-quartering seas. The significance of deck-edge immersion and water on deck on the capsize risk is shown as well as the necessity to account for the wave disturbances caused by the ship. A method is described to reconstruct experimental wave trains and finally two deterministic validation cases are shown.

Deterministic Disturbance Rejection for Model Reference Adaptive Control (결정론적 외란에 대한 적응제어 알고리즘의 연구)

  • Kim, Yong-Sei;Feng, G.;Lee, Kwon-S.
    • Proceedings of the KIEE Conference
    • /
    • 1993.07a
    • /
    • pp.341-344
    • /
    • 1993
  • This paper presents the general MRAC algorithm design, it's real time implementation and investigates the effect of purely deterministic disturbances to adaptive control algorithm. The design of adaptive control algorithm to reject the disturbances properly is also presented. In real time application, adaptive control algorithm is considered to investigate its performance by using DC motor. Disturbance rejection algorithm is investigated in simulation.

  • PDF

Optimization Algorithm for Real-time Load Dispatch Problem Using Shut-off and Swap Method (발전정지와 교환방법을 적용한 실시간급전문제 최적화 알고리즘)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.4
    • /
    • pp.219-224
    • /
    • 2017
  • In facing the lack of a deterministic algorithm for economic load dispatch optimization problem, only non-deterministic heuristic algorithms have been suggested. Worse still, there is a near deficiency of research devoted to real-time load dispatch optimization algorithm. In this paper, therefore, I devise a shut-off and swap algorithm to solve real-time load dispatch optimization problem. With this algorithm in place, generators with maximum cost-per-unit generation power are to be shut off. The proposed shut-off criteria use only quadratic function in power generation cost function without valve effect nonlinear absolute function. When applied to the most prevalent economic load dispatch benchmark data, the proposed algorithm is proven to largely reduce the power cost of known algorithms.

Baleen Whale Sound Synthesis using a Modified Spectral Modeling (수정된 스펙트럴 모델링을 이용한 수염고래 소리 합성)

  • Jun, Hee-Sung;Dhar, Pranab K.;Kim, Cheol-Hong;Kim, Jong-Myon
    • The KIPS Transactions:PartB
    • /
    • v.17B no.1
    • /
    • pp.69-78
    • /
    • 2010
  • Spectral modeling synthesis (SMS) has been used as a powerful tool for musical sound modeling. This technique considers a sound as a combination of a deterministic plus a stochastic component. The deterministic component is represented by the series of sinusoids that are described by amplitude, frequency, and phase functions and the stochastic component is represented by a series of magnitude spectrum envelopes that functions as a time varying filter excited by white noise. These representations make it possible for a synthesized sound to attain all the perceptual characteristics of the original sound. However, sometimes considerable phase variations occur in the deterministic component by using the conventional SMS for the complex sound such as whale sounds when the partial frequencies in successive frames differ. This is because it utilizes the calculated phase to synthesize deterministic component of the sound. As a result, it does not provide a good spectrum matching between original and synthesized spectrum in higher frequency region. To overcome this problem, we propose a modified SMS that provides good spectrum matching of original and synthesized sound by calculating complex residual spectrum in frequency domain and utilizing original phase information to synthesize the deterministic component of the sound. Analysis and simulation results for synthesizing whale sounds suggest that the proposed method is comparable to the conventional SMS in both time and frequency domain. However, the proposed method outperforms the SMS in better spectrum matching.

A stochastic optimal time-delay control for nonlinear structural systems

  • Ying, Z.G.;Zhu, W.Q.
    • Structural Engineering and Mechanics
    • /
    • v.31 no.5
    • /
    • pp.621-624
    • /
    • 2009
  • The time delay in active and semi-active controls is an important research subject. Many researches on the time-delay control for deterministic systems have been made (Hu and Wang 2002, Yang et al. 1990, Abdel-Mooty and Roorda 1991, Pu 1998, Cai and Huang 2002), while the study on that for stochastic systems is very limited. The effects of the time delay on the control of nonlinear systems under Gaussian white noise excitations have been studied by Bilello et al. (2002). The controlled linear systems with deterministic and random time delay subjected to Gaussian white noise excitations have been treated by Grigoriu (1997). Recently, a stochastic averaging method for quasi-integrable Hamiltonian systems with time delay has been proposed (Liu and Zhu 2007). In the present paper, a stochastic optimal time-delay control method for stochastically excited nonlinear structural systems is proposed based on the stochastic averaging method for quasi Hamiltonian systems with time delay and the stochastic dynamical programming principle. An example of stochastically excited and controlled hysteretic column is given to illustrate the proposed control method.

Semi-deterministic Sparse Matrix for Low Complexity Compressive Sampling

  • Quan, Lei;Xiao, Song;Xue, Xiao;Lu, Cunbo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.5
    • /
    • pp.2468-2483
    • /
    • 2017
  • The construction of completely random sensing matrices of Compressive Sensing requires a large number of random numbers while that of deterministic sensing operators often needs complex mathematical operations. Thus both of them have difficulty in acquiring large signals efficiently. This paper focuses on the enhancement of the practicability of the structurally random matrices and proposes a semi-deterministic sensing matrix called Partial Kronecker product of Identity and Hadamard (PKIH) matrix. The proposed matrix can be viewed as a sub matrix of a well-structured, sparse, and orthogonal matrix. Only the row index is selected at random and the positions of the entries of each row are determined by a deterministic sequence. Therefore, the PKIH significantly decreases the requirement of random numbers, which has a complex generating algorithm, in matrix construction and further reduces the complexity of sampling. Besides, in order to process large signals, the corresponding fast sampling algorithm is developed, which can be easily parallelized and realized in hardware. Simulation results illustrate that the proposed sensing matrix maintains almost the same performance but with at least 50% less random numbers comparing with the popular sampling matrices. Meanwhile, it saved roughly 15%-35% processing time in comparison to that of the SRM matrices.

M/PH/1 QUEUE WITH DETERMINISTIC IMPATIENCE TIME

  • Kim, Jerim;Kim, Jeongsim
    • Communications of the Korean Mathematical Society
    • /
    • v.28 no.2
    • /
    • pp.383-396
    • /
    • 2013
  • We consider an M/PH/1 queue with deterministic impatience time. An exact analytical expression for the stationary distribution of the workload is derived. By modifying the workload process and using Markovian structure of the phase-type distribution for service times, we are able to construct a new Markov process. The stationary distribution of the new Markov process allows us to find the stationary distribution of the workload. By using the stationary distribution of the workload, we obtain performance measures such as the loss probability, the waiting time distribution and the queue size distribution.

Optimal Man-machine Assignment for Sequential Dependent Multi Different Machines Under Deterministic Cycle Time (확정적 주기시간을 갖는 다기종 Line설비의 최적담당 기계대수 결정)

  • 이근희;김홍국
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.11 no.17
    • /
    • pp.39-46
    • /
    • 1988
  • This Paper is concerned with a man-multi machine assignment problem to minimize idle time. Assuming different types of semi-automatic machines with deterministic service-processing time, the problem approaches by sequential dependent one operator can handle several machines, where determine optimal range the cost of idle labor and machine time is to be minimized in preparing a work schedule. The Procedure, to establish man-machine assignment model, and it's results are: (1) Objective function to minimize opportunity loss cost, which is happened by idle time, is verified recursive process through heuristic method. (2) The algorithm, is programmed by BASIC language for personal computer, and a numerical example is given to illustrate the heuristic algorithm. This study will be helpful to enhance productivity of Shopflooras a result of increasing the efficiencies of both operator and machine.

  • PDF