• Applied Microscopy
• /
• v.46 no.1
• /
• pp.6-13
• /
• 2016

Fluorescence lifetime imaging microscopy (FLIM) has been considered an effective technique to investigate chemical properties of the specimens, especially of biological samples. Despite of this advantageous trait, researchers in this field have had difficulties applying FLIM to their systems because acquiring an image using FLIM consumes too much time. Although analog mean-delay (AMD) method was introduced to enhance the imaging speed of commonly used FLIM based on time-correlated single photon counting (TCSPC), a real-time image reconstruction using AMD method has not been implemented due to its data processing obstacles. In this paper, we introduce a real-time image restoration of AMD-FLIM through fast parallel data processing by using Threading Building Blocks (TBB; Intel) and octa-core processor (i7-5960x; Intel). Frame rate of 3.8 frames per second was achieved in $1,024{\times}1,024$ resolution with over 4 million lifetime determinations per second and measurement error within 10%. This image acquisition speed is 184 times faster than that of single-channel TCSPC and 9.2 times faster than that of 8-channel TCSPC (state-of-art photon counting rate of 80 million counts per second) with the same lifetime accuracy of 10% and the same pixel resolution.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.2
• /
• pp.459-466
• /
• 1999

I broadband ISDN every packet will show different result if it would be processed according to its usage by the server. That is, normal data won't show big differences if they would be processed at normal speed. But it will improve the quality of service to process some kinds of data - for example real time video or voice type data or some data for a bid to by something through the internet - more fast than the normal type data. solution for this problem was suggested - priority packets. But the analyses of them are under way. Son in this paper a switching system for an output queuing model in a single server was assumed and some packets were given priorities and analysed. And correlation, simulating real life situation, was given too. These packets were analysed through three cases, first packets having no correlation, second packets having only correlation and finally packets having priority three cases, first packets having no correlation, second packets having only correlation and finally packets having priority and correlation. The result showed that correlation doesn't affect the mean delay time and the high priority packets have improved mean delay time regardless of the arrival rate. Those packets were assumed to be fixed-sized like ATM fixed-sized cell and the contention strategy was assumed to be short bus contention method for the output queue, and the mean delay length and the maximum 버퍼 length not to lose any packets were analysed.

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.9B
• /
• pp.813-821
• /
• 2008

In recent year, several types of PON(Passive Optical Networks) have been adopted into the subscriber loops for the high speed subscriber lines to meet the needs of some applications based on the Internet and the rapid increase of the Internet users. GPON(Gigabit PON) is a typical access network technology of these PONs which adopt the DBA(Dynamic bandwidth Allocation) scheme in order to transmit upstream traffic efficiently. In this paper, we introduce the gated polling system with a two-stage queue in order to analyze the delay performance of the DBA scheme in a GPON. We use a continuous time queueing model for deriving the mean cycle time and for obtaining the mean packet delay. We give some numerical results to investigate the delay performance for the symmetric polling system with statistically identical stations.

• Proceedings of the IEEK Conference
• /
• 2003.07a
• /
• pp.65-68
• /
• 2003

3GPP's RLC protocol specification adopted an error control scheme based on selective repeat ARQ. In 3GPP ARQ, distinctive windows are provide at transmitting and receiving stations so that those stations are prohibited to send or receive data PDU's out of window. An increase in window size enhances delay performance. Such an increase, however, raises the occupancy at reordering buffer, which results in a long reordering time. Aiming at suppressing the occupancy at reordering buffer, we propose a occupancy control scheme in this paper. In this scheme, a threshold is created in the receiving station's window and a data PDU out of the threshold (but within the window) is treated according to go back N ARQ. By the employment of the occupancy control scheme, the occupancy at the reordering buffer is apparently reduced, while the delay performance may be degraded due to the properties of go back N ARQ. We, thus, investigate the peak occupancy and mean delay performance by a simulation method. From numerical examples, we observe a trade-off in both performance measures and conclude that the peak occupancy is effectively reduced by setting a proper threshold under a constraint on mean delay performance.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.2
• /
• pp.232-238
• /
• 2004

In this paper, radio propagation in a subway tunnel is investigated using fan beam antennas, circular polarization antennas and directional antennas at 2.4㎓ and 5.8㎓ band, respectively. The results of narrowband channel measurements show that received power level for NLOS(Non-Line-Of-Sight) path is decreased drastically as compared with LOS(Line-Of-Sight) path. Wideband channel measurements are obtained using a PN sliding correlation method. The parameters of the channel such as mean access delay and RMS delay spread are compared as to different types of directional beam at IEEE 802.11 WLAN(Wireless Local Area Network) band including 2.4㎓ and 5.8㎓ bands, respectively.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.8
• /
• pp.1420-1426
• /
• 2008

This paper derives medium access delay of each AC(Access Category) in a stationary station using inter-departure time of IEEE 802.11e WLAN(Wireless LAN). Inter-departure time of IEEE 802.11e WLAN is obtained using saturation throughput of IEEE 802.11e WLAN which was the topic of our prior work. By using a simple queueing model, we evaluate mean queue length and mean delay for each AC on stationary condition. We calculate performance of each AC using this simple model and validate results using simulation.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.39 no.1
• /
• pp.23-28
• /
• 2021

Data analysis research using deep learning has recently been studied in various field. In this paper, we conduct a GNSS (Global Navigation Satellite System)-based meteorological study applying deep learning by estimating the ZWD (Zenith tropospheric Wet Delay) through MLP (Multi-Layer Perceptron) and LSTM (Long Short-Term Memory) models. Deep learning models were trained with meteorological data and ZWD which is estimated using zenith tropospheric total delay and dry delay. We apply meteorological data not used for learning to the learned model to estimate ZWD with centimeter-level RMSE (Root Mean Square Error) in both models. It is necessary to analyze the GNSS data from coastal areas together and increase time resolution in order to estimate ZWD in various situations.

• Journal of The Korean Astronomical Society
• /
• v.49 no.6
• /
• pp.289-293
• /
• 2016

We investigate the long-term spatial drift of the center and the temporal variation of the shutter delay time map of Y4KCam mounted on the CTIO 1.0 m telescope. We have collected shutter delay time maps over eight years as a part of our long-term survey program. We find that the center of the shutter delay time map can drift up to $450{\mu}m$, equivalent to ${\approx}30pixels$, on the CCD. This effect can result in a small amount of error in integration time without the proper shutter delay time correction, but it does not appear to cause any significant problems in photometric measurements. We obtain a mean shutter delay time of $69.1{\pm}0.8$ ms and find no temporal variation of the shutter delay time of Y4KCam over eight years, indicative of the mechanical stability of the shutter. We suggest that using a master shutter delay time correction frame would be sufficient to achieve high precision photometry, which does not exceed photometric errors ${\approx}1.7mmag$ across the CCD frame for exposure times longer than 1 s.

• Proceedings of the KIEE Conference
• /
• 2008.10b
• /
• pp.462-463
• /
• 2008

This paper proposes a method for dynamic output-feedback controller design for stochastic time-delay systems. Based on recent results on time-delay systems control, a tractable and delay-dependent design condition is proposed, which provides a dynamic output-feedback controller to render the closed-loop stochastic time-delay systems to be asymptotically stable in the mean-square sense. The feasibility problem of the proposed condition is recast into a cone complementarity problem. An algorithm adopting cone complementarity linearization is presented to solve the resulting problem.