• Journal of Communications and Networks
• /
• v.14 no.5
• /
• pp.533-539
• /
• 2012

The performance analysis of wireless geolocation in a non-line-of-sight (NLOS) environment is a very important issue. Since Cramer-Rao lower bound (CRLB) determines the physical impossibility of the variance of an unbiased estimator being less than the bound, many studies presented the performance analysis in terms of CRLB. Several CRLBs for time-of-arrival (TOA), pseudo-range TOA, angle-of-arrival (AOA), and signal strength (SS) based positioning methods have been derived for NLOS environment. However, the performance analysis of time difference of arrival (TDOA) and TDOA/SS based geolocation techniques in a NLOS environment is still an opening issue. This paper derives the CRLBs of TDOA and TDOA/SS based positioning methods for NLOS environment. In addition, theoretical analysis proves that the derived CRLB for TDOA is the same as that of pseudo-range TOA and the TDOA/SS scheme has a lower CRLB than the TDOA (or SS) scheme.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.1
• /
• pp.31-35
• /
• 1999

In this paper, we consider the robust pole assignment and the upper bound of quadratic cost function for the linear systems with time-varying uncertainy. The considered uncertainties are both the norm bounded unstructured case and the structured case that has the matrix polytope type uncertain structure. We derve conditions that guarantee the robust pole assignment inside a disk in the L.H.P. and the robust stability. Also, we derive the upper bound of quadratic cost for thil pole assigned systems. Finally, we show the usefulness of our results by an example.

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.4
• /
• pp.448-458
• /
• 1999

This paper proposes sequential control charts with an upper bound on sample size. Existing sequential control charts have no restriction on the number of observations at a sampling point. For situations where sampling and testing an item is time-consuming or expensive, sequential control charts may not be directly applied. When the number of observations in a sampling point reaches the upper bound and there is no out-of-control signal, the proposed cumulative sequential control chart defers the decision to the next sampling point of which starting value is the value of the current statistic. Two Markov chains, inner and outer chains, are used to derive the formulas for evaluating the performance of the proposed chart. It is compared with $\bar{X}$ and cumulative sum control charts with fixed and variable sample sizes. The fast initial response (FIR) feature is studied. Guidelines for the design of the proposed charts are also given.

• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.3
• /
• pp.417-429
• /
• 1998

This paper considers two-sided (left and right side) assembly lines which are often used, especially in assembling large-sized products such as trucks and buses. A large number of exact algorithms and heuristics have been proposed to balance one-sided lines. However, little attention has been paid to balancing two-sided assembly lines. We present an efficient algorithm based on a branch and bound for balancing two-sided assembly lines. The algorithm involves a procedure for generating an enumeration tree. To efficiently search for the near optimal solutions to the problem, assignment rules are used in the method. New and existing bound strategies and dominance rules are else employed. The proposed algorithm can find a near optimal solution by enumerating feasible solutions partially. Extensive computational experiments are carried out to make the performance comparison between the proposed algorithm and existing ones. The computational results show that our algorithm is promising and robust in solution quality.

• Journal of the Korean Society for Precision Engineering
• /
• v.16 no.9
• /
• pp.89-95
• /
• 1999

The compression behavior of semi-solid materials in studied from a viewpoint of yield criteria and analysis methods. To describe the behavior of materials in semi-solid state, several theories have been proposed by extending the concept of plasticity of porous compressible materials. in the present work, the upper-bound method and the finite element method are used to model the simple compression process using yield criteria of Kuhn and Doraivelu. Segregation between solid and liquid which cause defect of product is analysed for Sn-15%Pb alloy is compared with the experimental result of Charreyron et al..

• Structural Engineering and Mechanics
• /
• v.51 no.4
• /
• pp.565-579
• /
• 2014

The pullout capacity of plate anchors has been studied extensively over the past 40 years. However, very few studies have attempted to calculate the pullout capacity of anchors in sandy slopes. In this paper, three upper bound approaches are used to study the effect of a sloping ground surface and friction angle on pullout capacity and failure of plate anchors. This includes the use of; simple upper bound mechanisms; the block set mechanism approach; and finite element upper bound limit analysis. The aim of this research is to better understand the various failure mechanisms and to develop a simple methodology for estimating the pullout capacity of anchors in sandy slopes.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.29 no.4
• /
• pp.34-42
• /
• 2006

This paper considers an assembly-type flowshop scheduling problem in which each job is assembled with two types of components. One type of the components is outsourced with positive lead time but the other type is fabricated in-house at the first stage. The two types of the components should be prepared at the first stage before starting the assembly operation for each job at the second stage. The objective is to schedule the jobs so that the makespan is minimized. Some solution properties and lower bounds are derived and incorporated into a branch and bound algorithm. Also, an efficient heuristic is developed. The performances of the proposed branch and bound algorithm and heuristic are evaluated through computational experiments.

• International journal of advanced smart convergence
• /
• v.7 no.4
• /
• pp.19-26
• /
• 2018

One of the distinct features of Wireless Sensor Networks (WSNs) is duty cycling mechanism, which is used to conserve energy and extend the network lifetime. Large duty cycle interval introduces lower energy consumption, meanwhile longer end-to-end (E2E) delay. In this paper, we introduce an energy consumption minimization problem for duty-cycled WSNs. We have applied Q-learning algorithm to obtain the maximum duty cycle interval which supports various delay requirements and given Delay Success ratio (DSR) i.e. the required probability of packets arriving at the sink before given delay bound. Our approach only requires sink to compute Q-leaning which makes it practical to implement. Nodes in the different group have the different duty cycle interval in our proposed method and nodes don't need to know the information of the neighboring node. Performance metrics show that our proposed scheme outperforms existing algorithms in terms of energy efficiency while assuring the required delay bound and DSR.

• Current Optics and Photonics
• /
• v.6 no.1
• /
• pp.10-14
• /
• 2022

Low-threshold optical bistability is essential for practical nonlinear optical applications. Many bistable optical devices based on high-quality-factor resonators have been proposed to reduce the threshold intensity. However, demonstrating high-quality-factor resonance requires complex fabrication techniques. In this work, we numerically demonstrate optical bistability with bound states in the continuum in a simple one-dimensional Si photonic crystal. The designed structure supports bound states in the continuum, producing an ultrahigh quality factor without tough fabrication conditions. The threshold intensity of the designed device is 150 MW/cm² at the optical communication wavelength. This scheme may lead to a new class of nonlinear photonics.

• Nuclear Engineering and Technology
• /
• v.54 no.4
• /
• pp.1195-1205
• /
• 2022

Recent developments on spectral diffusion algorithms, i.e., algorithms which exploit the projection of the solution on the eigenfunctions of the Laplacian operator, demonstrated their effective applicability in fast transient conditions. Nevertheless, the numerical error introduced by these algorithms, together with the uncertainties associated with model parameters, may impact the reliability of the predictions on short-lived volatile fission product release from nuclear fuel. In this work, we provide an upper bound on the numerical error introduced by the presented spectral diffusion algorithm, in both constant and time-varying conditions, depending on the number of modes and on the time discretization. The definition of this upper bound allows introducing a methodology to a priori bound the numerical error on short-lived volatile fission product retention.