• The KIPS Transactions:PartC
• /
• v.14C no.2
• /
• pp.155-162
• /
• 2007

WFQ (Weighted Fair Queuing) is the most popular fair queuing algorithm, but it had the inherent drawback of a poor bandwidth utilization, particularly under the traffic requiring a low rate but tight delay bound such as internet phone, It was recently identified that the poor utilization is mainly due to non optimized latency of a flow and then LOFQ(Latency-Optimized Fair Queuing) to overcome the drawback was introduced, LOFQ was also improved through introducing an occupied resource optimization function and the implementation complexity of recursive resource transformation was reduced with revising the transformation scheme. However, the performance of LOFQ has been evaluated by means of simulation, so that there are some difficulties in evaluating the performance in the terms of the accuracy and evaluation time, In this paper, we develop how to analytically compute the bandwidth utilization in LOFQ.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.2
• /
• pp.29-46
• /
• 1998

In this paper, we develop detailed algorithms for implementing the so-called Limited Column Generation procedure for Local Access Telecommunication Network(LATN) design problem. We formulate the problem into a tree-partitioning problem with an exponential number of variables. Its linear programming relaxation has all integral vertices, and can be solved by the Limited Column Generation procedure in just n pivots, where n is the number of nodes in the network. Prior to each pivot. an entering variable is selected by detecting the Locally Most Violated(LMV) reduced cost, which can be obtained by solving a subproblem in pseudo-polynomial time. A critical step in the Limited Column Generation is to find all the LMV reduced costs. As dual variables are updated at each pivot, the reduced costs have to be computed in an on-line fashion. An efficient implementation is developed to execute such a task so that the LATN design problem can be solved in O(n$^2$H), where H is the maximum concentrator capacity. Our computational experiments indicate that our algorithm delivers an outstanding performance. For instance, the LATN design problem with n＝150 and H＝1000 can be solved in approximately 67 seconds on a SUN SPARC 1000 workstation.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.24 no.3
• /
• pp.365-371
• /
• 2016

The electromechanical brake (EMB) is one of future brake systems due to its many advantages. For implementation of the EMB, the correct feed back about clamping force is necessary. Keeping commercialization of the EMB in mind, it is strongly demanded that an expensive load cell measuring the clamping force is replaced with an estimation algorithm. In addition, an estimation of the kissing point where the brake pads start to come into contact with a disk wheel is proposed in this paper. With these estimation algorithms, the clamping force can be expressed as a polynomial characteristic curve versus the motor angle. Also, a method for calibration of measured values by the load cell is proposed and used for an actual characteristic curve. Lastly, the performance of the proposed algorithms is evaluated in comparison with the actual curve on a developed EMB test bench.

• Smart Structures and Systems
• /
• v.10 no.4_5
• /
• pp.313-329
• /
• 2012

A challenging issue in design and implementation of an effective structural health monitoring (SHM) system is to determine where a number of sensors are properly installed. In this paper, research on the optimal sensor placement (OSP) is carried out on the Canton Tower (formerly named Guangzhou New Television Tower) of 610 m high. To avoid the intensive computationally-demanding problem caused by tens of thousands of degrees of freedom (DOFs) involved in the dynamic analysis, the three dimension finite element (FE) model of the Canton Tower is first simplified to a system with less DOFs. Considering that the sensors can be physically arranged only in the translational DOFs of the structure, but not in the rotational DOFs, a new method of taking the horizontal DOF as the master DOF and rotational DOF as the slave DOF, and reducing the slave DOF by model reduction is proposed. The reduced model is obtained by IIRS method and compared with the models reduced by Guyan, Kuhar, and IRS methods. Finally, the OSP of the Canton Tower is obtained by a kind of dual-structure coding based generalized genetic algorithm (GGA).

• Journal of the Korea Computer Industry Society
• /
• v.5 no.3
• /
• pp.337-344
• /
• 2004

ITS(Intelligent transportation system) provides users with realtime traffic information based on technologies such as advanced information ＆ telecommunication, electronic control and transportation engineering. To operate efficient ITS, it is necessary to quickly identify and take actions for incidents(accidents, broken vehicles, public functions, traffic control, etc.). However, there have been few reliable incident detection algorithms developed so far. The algorithm presented in this study greatly resolved the problems in the existing incident detection algorithms, which determine incidents according to the input of constant values, by defining ranges based on the concept of pseudo level of service. With this improvement, operators can determine the incident detection parameters more accurately.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.12
• /
• pp.1775-1784
• /
• 2002

Fingerprint recognition technology is used in many biometrics field accordingly essential feature of fingerprint image and the study is progressing. However development is not perfect in performance of the fingerprint recognition and application of the usual life. In the paper, we study various necessity of preprocessing according to algorithm and circumstances of authentication system in automatic information machine. We prove that system circumstance and optation of fingerprints image effectively is the important factor by using optical fingerprint input device and scanning the fingerprint in ID card. And then we present correct and fast computation method for improving image and feature extraction of fingerprint. Also we study effective algorithm implementation of total system.

• Journal of the Korea Computer Industry Society
• /
• v.4 no.4
• /
• pp.647-660
• /
• 2003

The present of state is situation that is realized by necessity of maintenance of public security about great many information is real condition been increasing continually in knowledge info-age been situating in wide field of national defense, public peace, banking, politics, education etc. Also, loss or forgetfulness, and peculation by ID for individual information and number increase of password in Internet called that is sea of information is resulting various social problem. By alternative about these problem, including Biometrics, several authentication systems through sign(Signature), Smart Card, Watermarking technology are developed. Therefore, This paper shows that extract factor that efficiency can get into peculiar feature in physical features for good fingerprint recognition algorithm implementation with old study finding that take advantage of special quality of these fingerprint.

• Journal of Biomedical Engineering Research
• /
• v.30 no.4
• /
• pp.279-287
• /
• 2009

Magnetic resonance electrical impedance tomography (MREIT) is a new medical imaging modality providing cross-sectional images of a conductivity distribution inside an electrically conducting object. MREIT has rapidly progressed in its theory, algorithm and experimental technique and now reached the stage of in vivo animal and human experiments. Conductivity image reconstructions in MREIT require various steps of carefully implemented numerical computations. To facilitate MREIT research, there is a pressing need for an MREIT software package with an efficient user interface. In this paper, we present an example of such a software, called CoReHA which stands for conductivity reconstructor using harmonic algorithms. It offers various computational tools including preprocessing of MREIT data, identification of boundary geometry, electrode modeling, meshing and implementation of the finite element method. Conductivity image reconstruction methods based on the harmonic $B_z$ algorithm are used to produce cross-sectional conductivity images. After summarizing basics of MREIT theory and experimental method, we describe technical details of each data processing task for conductivity image reconstructions. We pay attention to pitfalls and cautions in their numerical implementations. The presented software will be useful to researchers in the field of MREIT for simulation as well as experimental studies.

• Journal of Advanced Navigation Technology
• /
• v.6 no.2
• /
• pp.97-103
• /
• 2002

A recent technology trends in synthetic aperture radar(SAR) requires the ultra high resolution performance in detecting and precisely identifying the targets. In this paper, as a technique for enhancing the radar range resolution, the wide band chirp connection algorithm is presented by stitching the several chirp modules with unit bandwidth based on the linear frequency modulated chirp signal waveform. The principles of the digital chirp signal generation and its architecture for implementation is described with the wide band chirp signal generator, modulator, and demodulator. The performance analysis for the presented algorithm is given with the simulation results.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.10
• /
• pp.2760-2765
• /
• 2009

Pfair scheduling algorithm, which is an optimal scheduling algorithm in the hard real-time multiprocessor environments, is based on the fixed quantum size. Recently, several methods that determine the maximum quantum size dynamically were proposed in the mode change environments. But these methods considered the case in which the period of a task can only be decreased. In this paper, we consider the case in which the period of a task can be decreased or increased, and propose an improved method that determine the maximum quantum size dynamically in the mode change environments. A simulation shows that the proposed method is effective.