• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2003.06a
• /
• pp.181-184
• /
• 2003

Recently, the fieldbus becomes an indispensable component for many automated systems. In the fieldbus system, realtime data containing sensor values and control commands has a tendency to rapidly lose its value as time elapses after its creation. In order to deliver these data in time, the fieldbus network should be designed to have short delay compared to the maximum allowable delay. Because the communication delay is affected by performance parameters such as target rotation timer of token passing protocol, it is necessary to select proper parameter settings to satisfy the real-time requirement for communication delay. This paper presents the timer selection method for Profibus token passing networks using genetic algorithm (GA) to meet the delay requirements.

• Korean Journal of Child Studies
• /
• v.17 no.2
• /
• pp.221-233
• /
• 1996

The purpose of the present study was to investigate the effects of age, sex, cognitive style and reward presentation on delay of gratification. The subjects of this study were 120 children 4, 6 and 8 years of age attending preschool and an elementary school in Pusan. They were identified as impulsive or reflective according to their performance on Kagan's Matching Familiar Figures Test. The levels of reward presentation consisted of the reward which was presented physically and the reward which wasn't presented physically. Length of waiting time was recorded as the measure of maintenance of delay of gratification. The data of this study were analyzed with Two-way ANOVA, Duncan's Multiple Range Test. The major finding were as follows: (1) Delay time increased with age. (2) No sex difference is found in delay time. (3) Reflective children delayed longer than impulsive children in all age groups. (4) The reward which wasn't physically presented produced loner delay time than the reward which was physically presented in all age groups.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.12
• /
• pp.4099-4113
• /
• 2022

In this paper, we propose improved maximum access delay time, noise variance, and power delay profile (PDP) estimation schemes for orthogonal frequency division multiplexing (OFDM) system in multipath fading channels. To this end, we adopt the approximate maximum likelihood (ML) estimation strategy. For the first step, the log-likelihood function (LLF) of the received OFDM symbols is derived by utilizing only the cyclic redundancy induced by cyclic prefix (CP) without additional information. Then, the set of the initial path powers is sub-optimally obtained to maximize the derived LLF. In the second step, we can select a subset of the initial path power set, i.e. the maximum access delay time, so as to maximize the modified LLF. Through numerical simulations, the benefit of the proposed method is verified by comparison with the existing methods in terms of normalized mean square error, erroneous detection, and good detection probabilities.

• Journal of the Korean Society of Radiology
• /
• v.13 no.2
• /
• pp.305-311
• /
• 2019

In this study, present the most useful delay scan time by statistical analysis of SUVm data for 30 suspected pancreatic cancer patients. Two statistical analysis and a mathematical model was applied to the theoretical formula by glucose and insulin mechanics, and a mathematical model was created. Statistical analysis was performed via Metlab p/g. Optimal delay scan time was suggested by Metlab p/g for the change of SUV value over time.In this study, for diagnosis pancreatic cancer by dual time point PET/CT, propose optimal delay scan time 131.5 minuts. The proposed delay scan time showed statistical reliability applicable to the diagnosis of pancreatic cancer (p<0.05). Delayed scanning with the suggested delay scan time of 131.5 minutes is considered to be useful for the diagnosis of pancreatic cancer compared to general PET / CT scan.hen the delayed test is performed with the proposed delay scan time 131.5 minuts, Compared with general PET/CT scans.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.4
• /
• pp.1063-1075
• /
• 2012

To locate an object accurately in the wireless sensor networks, the distance measure based on time-delay plays an important role. In this paper, we propose a maximum likelihood (ML) time-delay estimation algorithm in multi-path wireless propagation channel. We get the joint probability density function after sampling the frequency domain response of the multi-path channel, which could be obtained by the vector network analyzer. Based on the ML criterion, the time-delay values of different paths are estimated. Considering the ML function is non-linear with respect to the multi-path time-delays, we first obtain the coarse values of different paths using the subspace fitting algorithm, then take them as an initial point, and finally get the ML time-delay estimation values with the pattern searching optimization method. The simulation results show that although the ML estimation variance could not reach the Cramer-Rao lower bounds (CRLB), its performance is superior to that of subspace fitting algorithm, and could be seen as a fine algorithm.

• ETRI Journal
• /
• v.30 no.2
• /
• pp.227-237
• /
• 2008

In this paper, an algorithm that provides absolute and proportional differentiation of packet delays is proposed with the objective of enhancing quality of service in future packet networks. It features an adaptive scheme that adjusts the target delay for every time slot to compensate the deviation from the target delay, which is caused by prediction error on the traffic to arrive at the next time slot. It predicts the traffic to arrive at the beginning of a time slot and measures the actual arrived traffic at the end of the time slot. The difference between them is utilized by the delay control operation for the next time slot to offset it. Because the proposed algorithm compensates the prediction error continuously, it shows superior adaptability to bursty traffic and exponential traffic. Through simulations we demonstrate that the algorithm meets the quantitative delay bounds and is robust to traffic fluctuation in comparison with the conventional non-adaptive mechanism. The algorithm is implemented with VHDL on a Xilinx Spartan XC3S1500 FPGA, and the performance is verified under the test board based on the XPC860P CPU.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.1C
• /
• pp.54-60
• /
• 2005

In this Paper, an adaptive microphone array system with self-delay estimator is proposed. By showing that the adaptive blocking matrix (ABM) of the generalized sidelobe canceller (GSC) can estimate the relative time delay between each sensor, the proposed system utilizes the ABM not only for blocking target components in the blocked signal path, but also for estimating the relative time delay. Therefore, the proposed system requires only the GSC structure while maintaining the system performance similar to the conventional system using an additional time delay estimator as a preprocessor. Simulation results show that the performance of the proposed system is identical to the conventional system that uses an additional time delay estimation module.

• Smart Structures and Systems
• /
• v.14 no.6
• /
• pp.1269-1289
• /
• 2014

With the sub-stepping technique, the numerical analysis in real-time dynamic hybrid testing is split into the response analysis and signal generation tasks. Two target computers that operate in real-time may be assigned to implement these two tasks, respectively, for fully extending the simulation scale of the numerical substructure. In this case, the integration time-step of solving the dynamic response of the numerical substructure can be dozens of times bigger than the sampling time-step of the controller. The time delay between the real and desired feedback forces becomes more striking, which challenges the well-developed delay compensation methods in real-time dynamic hybrid testing. This paper focuses on displacement prediction and force correction for delay compensation in the real-time dynamic hybrid testing with a large integration time-step. A new displacement prediction scheme is proposed based on recently-developed explicit integration algorithms and compared with several commonly-used prediction procedures. The evaluation of its prediction accuracy is carried out theoretically, numerically and experimentally. Results indicate that the accuracy and effectiveness of the proposed prediction method are of significance.

• Explosives and Blasting
• /
• v.32 no.3
• /
• pp.18-25
• /
• 2014

Ground vibration and noise from blasting operation are known to be the most representative constituents which can cause human and material damage. In this study, the effect of delay time on ground vibration is investigated by adopting seven different delay times in bench blasting. For each delay time, three blasting operations were performed. The prediction equations for blasting vibration are derived from 50 sets of measurement and the time theory of Langefors is evoked in the analysis of the blasting vibrations and frequencies. For the delay times of 8 ms and 28 ms, the average values of ground vibration are 5.76 cm/sec and 5.75 cm/sec, respectively, which are considerably low. Also the cyclic variation in the vibration measurements with the delay time confirms the interference effect. From the application of the measurements of blasting vibration and frequency to the time theory of Langefors, it is concluded that the optimum delay times are 8 ms and 24 ms for the test site.

• The KIPS Transactions:PartC
• /
• v.12C no.3 s.99
• /
• pp.437-442
• /
• 2005

The measurement of RTT (Round Trip Time) can be used for the analysis of Internet congestion. However, simple measuring of RTT which measures only hun around time of a packet can not infer a packet forward/backward delay variation. In this thesis, we present a new algorithm which can be used for the estimation of forward/backward delay variation of packets. These delay variations are implication of network congestion state. In this algorithm, the reference forward/backward delay can be determined based on the minimum RTT value. The delay variation of each packet can be calculated by comparing reference delay with the packet delay. We verified our proposed algorithm by NS-2 simulation and delay measuring in a real network.