• Journal of the Optical Society of Korea
• /
• 제14권1호
• /
• pp.22-27
• /
• 2010

Bit error rate (BER) monitoring is the ultimate goal of performance monitoring in all digital transmission systems as well as optical fiber transmission systems. To achieve this goal, optimization of the decision threshold must also be considered because BER is dependent on the level of decision threshold. In this paper, we analyze a pseudo-error counting scheme and propose an algorithm to achieve both BER monitoring and adaptive decision threshold optimization in optical fiber transmission systems. To verify the effectiveness of the proposed algorithm, we conduct computer simulations in both Gaussian and non-Gaussian distribution cases. According to the simulation results, BER and the optimum decision threshold can be estimated with the errors of < 20% and < 10 mV, respectively, within 0.1-s processing time in > 40-Gb/s transmission systems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권6호
• /
• pp.2504-2526
• /
• 2016

Wireless sensors are always deployed in brutal environments, but as we know, the nodes are powered only by non-replaceable batteries with limited energy. Sending, receiving and transporting information require the supply of energy. The essential problem of wireless sensor network (WSN) is to save energy consumption and prolong network lifetime. This paper presents a new communication protocol for WSN called Dynamical Threshold Control Algorithm with three-parameter Particle Swarm Optimization and Ant Colony Optimization based on residual energy (DPA). We first use the state of WSN to partition the region adaptively. Moreover, a three-parameter of particle swarm optimization (PSO) algorithm is proposed and a new fitness function is obtained. The optimal path among the CHs and Base Station (BS) is obtained by the ant colony optimization (ACO) algorithm based on residual energy. Dynamical threshold control algorithm (DTCA) is introduced when we re-select the CHs. Compared to the results obtained by using APSO, ANT and I-LEACH protocols, our DPA protocol tremendously prolongs the lifecycle of network. We observe 48.3%, 43.0%, and 24.9% more percentages of rounds respectively performed by DPA over APSO, ANT and I-LEACH.

• ETRI Journal
• /
• 제31권2호
• /
• pp.121-128
• /
• 2009

In this paper, we describe a fixed-threshold sequential minimal optimization (FSMO) for structured SVM problems. FSMO is conceptually simple, easy to implement, and faster than the standard support vector machine (SVM) training algorithms for structured SVM problems. Because FSMO uses the fact that the formulation of structured SVM has no bias (that is, the threshold b is fixed at zero), FSMO breaks down the quadratic programming (QP) problems of structured SVM into a series of smallest QP problems, each involving only one variable. By involving only one variable, FSMO is advantageous in that each QP sub-problem does not need subset selection. For the various test sets, FSMO is as accurate as an existing structured SVM implementation (SVM-Struct) but is much faster on large data sets. The training time of FSMO empirically scales between O(n) and O($n^{1.2}$), while SVM-Struct scales between O($n^{1.5}$) and O($n^{1.8}$).

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 추계종합학술대회 논문집
• /
• pp.1155-1158
• /
• 1999

In this paper, we consider the optimal control of detection threshold to minimize the conditional mean-square state estimation error for the probabilistic data association (PDA) filter. Earlier works on this problem involved the cumbersome graphical optimization algorithm or time-consuming numerical optimization algorithm. Using the numerical approximation of information reduction factor, we obtained the closed-form optimal detection threshold. This results are very useful for real-time implemenation.

• ETRI Journal
• /
• 제32권1호
• /
• pp.120-128
• /
• 2010

In this paper, we describe a modified fixed-threshold sequential minimal optimization (FSMO) for 1-slack structural support vector machine (SVM) problems. Because the modified FSMO uses the fact that the formulation of 1-slack structural SVMs has no bias, it breaks down the quadratic programming (QP) problems of 1-slack structural SVMs into a series of smallest QP problems, each involving only one variable. For various test sets, the modified FSMO is as accurate as existing structural SVM implementations (n-slack and 1-slack SVM-struct) but is faster on large data sets.

• International Journal of Reliability and Applications
• /
• 제3권4호
• /
• pp.165-171
• /
• 2002

An optimization of the M/M/1 queue with impatient customers is studied. The impatient customer does not enter the system if his or her virtual waiting time exceeds the threshold K ＞ 0. After assigning three costs to the system, a cost proportional to the virtual waiting time, a penalty to each impatient customer, and also a penalty to each unit of the idle period of the server, we show that there exists a threshold K which minimizes the long-run average cost per unit time.

• 한국군사과학기술학회지
• /
• 제21권2호
• /
• pp.141-146
• /
• 2018

The Ground Moving Target Indication(GMTI) technique can detect the moving targets on land using its Doppler returns. Also, the GMTI system can work in night regardless of the weather condition because it is an active sensor that uses the electromagnetic waves as its source. In order to develop the GMTI system, Constant False Alarm Rate(CFAR) threshold optimization is important because the main performances like detection probability, false alarm rate and Minimum Detectable Velocity(MDV) are related deeply with CFAR threshold. These key variables are used to calculate CFAR threshold and then trade-off between the variables is performed. In this paper, CFAR threshold optimization procedures are introduced, and the optimization results are demonstrated.

• 한국군사과학기술학회지
• /
• 제20권2호
• /
• pp.187-196
• /
• 2017

The size of raw data has dramatically increased due to the recent trend of Synthetic Aperture Radar(SAR) development plans for high resolution and high definition image acquisition. The large raw data has an impact on satellite operability due to the limitations of storage and transmission capacity. To improve the SAR operability, the SAR raw data shall be compressed before transmission to the ground station. The Block Adaptive Quantization (BAQ) algorithm is one of the data compression algorithm and has been used for a long time in the spaceborne SAR system. In this paper, an optimization method of BAQ threshold table is introduced using real SAR raw data to prevent the degradation of signal quality caused by data compression. In this manner, a new variation estimation strategy and a new threshold method for block type decision are introduced.

• 한국정보컨버전스학회논문지
• /
• 제7권2호
• /
• pp.7-12
• /
• 2014

정확한 신호의 검출을 위해서 많은 필터들이 만들어지고 있다. 필터의 성능은 잡음을 효과적으로 제거하는 것으로 평가한다. 필터의 정확한 평가를 위해서 문턱치 값을 효과적으로 결정할 필요가 있다. 본 연구에서는 문턱치 값의 최적화에 대해 연구하였다. 신호는 삼각파와 전원잡음을 이용하였다. 샘플 개수에 따른 SNR 변화를 연구하였다. 샘플 개수가 증가함에 따라 SNR도 안정화가 되었다.

• 대한기계학회논문집A
• /
• 제30권6호
• /
• pp.722-727
• /
• 2006

Bone fracture healing is one of the important topics in biomechanics, demanding computation simulations due to the difficulty of obtaining experimental or clinical results. In this study, we adopt the design space optimization method which was established by the authors as a tool for the simulation of bone growth using its evolutionary characteristics. As the mechanical stimulus, strain energy density is used. We assume that bone tissues over a threshold strain energy density will be differentiated and bone tissues below another threshold will be resorbed. Under compression and torsion as loadings, the filling process of the defect is well illustrated following the given mechanical criterion. It is shown that the design space optimization is an excellent tool for simulating the evolutionary process of bone growth, which has not been possible otherwise.