• Journal of the Korean Mathematical Society
• /
• v.32 no.2
• /
• pp.171-181
• /
• 1995

Nielsen coincidence theory is concerned with the estimation of a lower bound for the number of coincidences of two maps $f,g: X \longrightarrow Y$. For this purpose the so-called Nielsen number N(f,g) is introduced, which is a lower bound for the number of coincidences ([1]). The relative Nielsen number N(f : X,A) in the fixed point theory is introduced in [3], which is a lower bound for the number of fixed points for all maps in the relative homotopy class of f:(X,A) $\longrightarrow$ (X,A), and its estimation is given in [5].

• Korean Journal of Optics and Photonics
• /
• v.29 no.2
• /
• pp.64-69
• /
• 2018

In this work, we derive a general lower bound to concurrence of an arbitrary mixture of two pure states, that is, rank-two multipartite quantum states. We show that the lower bound can tightly detect entanglement of rank-two states, and also can be implemented experimentally with present-day technologies, i.e. single-copy level measurement and classical post-processing.

• Journal of Arbitration Studies
• /
• v.27 no.3
• /
• pp.77-94
• /
• 2017

The United States has used legal theoretical constructions such as equitable estoppel and the third party beneficiary under which non-signatories of an arbitration agreement can be bound to the arbitration agreement of others. The third party beneficiary theory has been used when a signatory defendant argues that a non-signatory plaintiff is bound by an arbitration agreement, or a non-signatory defendant argues that a signatory plaintiff is required to arbitrate the plaintiff's claims against the non-signatory. On the other hand, equitable estoppel has developed as two distinct theories. According to the first theory, if a non-signatory party knowingly accepted the benefits of an agreement, it can be estopped from denying its obligation to arbitrate. The second theory compels a signatory to arbitrate because of the close relationship between the entities involved and the fact that the claims were intimately founded in and intertwined with the underlying contract obligations.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.26 no.4
• /
• pp.42-49
• /
• 2003

The branch and bound techniques based on cut tree and eigenvector have been Introduced in the literature [1, 2, 3, 6, 9, 12]. These techniques are used as a basis to allocate departments to floors and then to fit departments with unchangeable dimensions into floors. Grouping algorithms to allocate departments to each floor are developed and branch and bound forms the basis of optimizing using the criteria of rectilinear distance. The proposed branch and bound technique, in theory, will provide the optimal solution on two dimensional layout. If the runs are time and/or node limited, the proposed method is a strong heuristic The technique is made further practical by the fact that the solution is constrained such that the rectangular shape dimensions length and width are fixed and a perfect fit is generated if a fit is possible. Computational results obtained by cut tree-based algorithm and eigenvector-based algorithm are shown when the number of floors are two or three and there is an elevator.

• Journal of the Korean Society for Precision Engineering
• /
• v.24 no.8 s.197
• /
• pp.34-40
• /
• 2007

In this study, focusing on reducing a load in forming helical gears, the extrusion using two-step processes for manufacturing helical gear is proposed. The process is composed of the extrusion step in which spur gear to be used as a preform in next step is formed, and the torsion step in which the preform of spur gear is formed to helical gear. Upper-bound theory for the two-step process is applied and compared with the results of experiment. The result of upper-bound solution has a good agreement with that of the experiment and the FE analysis. The newly proposed method can be used as an advanced forming technique to remarkably reduce a forming load, to prolong a tool life, and to replace the conventional forming process of helical gears. Results obtained from the extrusion using two-step processes enable the designer and manufacturer of helical gear to be more efficient in this field.

• Proceedings of the Korean Geotechical Society Conference
• /
• 2002.03a
• /
• pp.93-100
• /
• 2002

Vertical reinforcement of soft soils using the deep mixing method has received increasing applications. In this study, the theory of elasticity and plasticity including the upper bound theorem of limit analysis were used to derive the equations for obtaining composite elastic properties and shear strength parameters. The developed equations were validated using the finite element computer program SAGE CRISP. The analysis involved 4 different cases-two different type of soil and replacement ratios. Tile results of the analysis show that the proposed equations could determine the properties of composite material for practical applications.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1993.10a
• /
• pp.218-223
• /
• 1993

An UBET(Upper Bound Elemental Technique) program has been developed to analyze forging load, die-cavity filling and effective strain distribution for flashless forging. To analyze the process easily, it is suggested that the deformation is divided into two different parts. Those are axisymmetric part in corner and plane-strain part in lateral. The total power consumption is minimized through combination of two deformation parts by building block method, from which the upper-bound forging load, the flow pattern, the grid pattern, the veocity distribution and the effective strain are determined. To show the merit of flashless forging, the result of flashless and flash forging processes are compared through theory and experiment. Experiments have been carried out with plasticine billets at room temperature. The theoretical predictions of the forging load and the flow pattern are in good agreement with the experimental results.

• Publications of The Korean Astronomical Society
• /
• v.30 no.2
• /
• pp.321-325
• /
• 2015

Determining the absolute neutrino mass scale and the neutrino mass hierarchy are central goals in particle physics, with important implications for the Standard Model. However, the final answer may come from cosmology, as laboratory experiments provide measurements for two of the squared mass differences and a stringent lower bound on the total neutrino mass - but the upper bound is still poorly constrained, even when considering forecasted results from future probes. Cosmological tracers are very sensitive to neutrino properties and their total mass, because massive neutrinos produce a specific redshift-and scale-dependent signature in the power spectrum of the matter and galaxy distributions. Stringent upper limits on ${\sum}m_v$ will be essential for understanding the neutrino sector, and will nicely complement particle physics results. To this end, we describe here a series of cosmological hydrodynamical simulations which include massive neutrinos, specifically designed to meet the requirements of the Baryon Acoustic Spectroscopic Survey (BOSS) and focused on the Lyman-${\alpha}$ ($Ly{\alpha}$) forest - also a useful theoretical ground for upcoming surveys such as SDSS-IV/eBOSS and DESI. We then briefly highlight the remarkable constraining power of the $Ly{\alpha}$ forest in terms of the total neutrino mass, when combined with other state-of-the-art cosmological probes, leaving to a stringent upper bound on ${\sum}m_v$.

• Korean Journal of Mathematics
• /
• v.26 no.4
• /
• pp.601-614
• /
• 2018

We consider the magnetic $Schr{\ddot{o}}dinger$ operator coupled with two different potentials. One of them is a harmonic oscillator and the other is a periodic potential. We give some periodic potential classes for which the operator has purely absolutely continuous spectrum. We also prove that for strong magnetic field or large coupling constant, there are open gaps in the spectrum and we give a lower bound on their number.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.9
• /
• pp.477-486
• /
• 2003

In combinatorial auctions buyers nay bid for arbitrary combinations of goods. But determining the winners of combinatorial auctions who maximize the profit of a seller is known to be NP-complete. A branch-and-bound method can be one of practical algorithm for winner determination. However, bid selection heuristics play a very important role in the efficiency of a branch-and-bound method. In this paper, we designed and implemented an algorithm which used a branch-and-bound method and Linear Programming for winner determination in combinatorial auctions. We propose new bid selection heuristics which consider a branching bid and conflicting bids simultaneously to select a branching bid in the algorithm. In addition, upper bounds are reused to reduce the running time in specific cases. We evaluated the performance of the algorithm by experiments with five data distributions and compared our method with others. The algorithm using heuristics showed a superior efficiency in two data distributions and a similar efficiency in three distributions.