• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.7
• /
• pp.422-430
• /
• 2002

For a time-multiplexed FPGA, a circuit is partitioned into several subcircuits, so that they temporally share the same physical FPGA device by hardware reconfiguration. In these architectures, all the hardware reconfiguration information called contexts are generated and downloaded into the chip, and then the pre-scheduled context switches occur properly and timely. Since the maximum number of the LUT's required in the same time determines the size of the chip used in the synthesis, it needs to be minimized, if possible. Many previous work use their own approaches, which are very similar to either scheduling method in high level synthesis or multi-way circuit partitioning method, to solve the problem. In this paper, we propose a method which estimates the lower bound on the number of LUT's without performing any actual synthesis. The estimated lower bounds help to evaluate the results of the previous work. If the estimated lower bound on the number of LUT's exactly matches the number of LUT's of the result from the previous work, the result must be optimal. In contrast, if they do not match, the following two cases are expected : the more exact lower bound may exist, or we might find the new synthesis result better than the result from the previous work. Experimental results show that our lower bound estimation method is very accurate. In almost al] cases experimented, the estimated lower bounds on the number of LUT's exactly match those of the previous synthesis results respectively, implying that the best results from the previous work are optimal as well as our method predicted the exact lower bound for those examples.

• Journal of the Korean Statistical Society
• /
• v.18 no.1
• /
• pp.26-37
• /
• 1989

When we select the t best out of k populations in the indifference zone formulation, a lower confidence bound on the probability of a correct selection is derived for families with monotone likelihood ratio. The result is applied to the normal means problem when the variance is common, and to the normal variances problem. Tables to implement the confidence bound for the normal variances problem are provided.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.635-638
• /
• 1998

This paper proposes a simple method to measure system's performance in target tracking problems. Essentially employing the Cramer-Rao lower bound (CRLB) on trakcing accuracy, an algorithm of predicting system's performance under various scenarios is developed. The input data is a collection of measurements over time fromsensors embedded in gaussian noise. The target of interest may not maneuver over the processing time interval while the own ship observing platform may maneuver in an arbitrary fashion. Th eproposed approach is demonstrated and discussed through simulation results.

• Industrial Engineering and Management Systems
• /
• v.3 no.2
• /
• pp.100-115
• /
• 2004

The network representation and branch and bound algorithm with efficient lower and upper bounding procedures are developed to determine a global optimal production schedule on a machine that minimizes sequence-dependent setup cost and earliness/tardiness penalties. Lower bounds are obtained based on heuristic and Lagrangian relaxation. Priority dispatching rule with local improvement procedure is used to derive an initial upper bound. Two dominance criteria are incorporated in a branch and bound procedure to reduce the search space and enhance computational efficiency. The computational results indicate that the proposed procedure could optimally solve the problem with up to 40 jobs in a reasonable time using a personal computer.

• Bulletin of the Korean Mathematical Society
• /
• v.54 no.3
• /
• pp.1081-1094
• /
• 2017

For a poset $P=(X,{\leq}_P)$, the linear discrepancy of P is the minimum value of maximal differences of all incomparable elements for all possible labelings. In this paper, we find a lower bound and an upper bound of the linear discrepancy of a product of two posets. In order to give a lower bound, we use the known result, $ld({\mathbf{m}}{\times}{\mathbf{n}})={\lceil}{\frac{mn}{2}}{\rceil}-2$. Next, we use Dilworth's chain decomposition to obtain an upper bound of the linear discrepancy of a product of a poset and a chain. Finally, we give an example touching this upper bound.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.38 no.4
• /
• pp.132-141
• /
• 2015

We focus on the fire scheduling problem (FSP), the problem of determining the sequence of targets to be fired at, for the objective of minimizing makespan to achieve tactical goals. In this paper, we assume that there are m available weapons to fire at n targets (> m) and the weapons are already allocated to targets. One weapon or multiple weapons can fire at one target and these fire operations should start simultaneously while the finish time of them may be different. We develop several dominance properties and a lower bound for the problem, and suggest a branch and bound algorithm implementing them. Also, In addition, heuristic algorithms that can be used for obtaining an initial upper bound in the B&B algorithm and for obtaining good solutions in a short time were developed. Computational experiments are performed on randomly generated test problems and results show that the suggested algorithm solves problems of a medium size in a reasonable amount of computation time. The proposed lower bound, the dominance properties, and the heuristics for upper bound are tested in B&B respectively, and the result showed that lower bound is effective to fathoming nodes and the dominance properties and heuristics also worked well. Also, it is showed that the CPU time required by this algorithm increases rapidly as the problem size increases. Therefore, the suggested B&B algorithm would be limited to solve large size problems. However, the employed heuristic algorithms can be effectively used in the B&B algorithm and can give good solutions for large problems within a few seconds.

• Bulletin of the Korean Mathematical Society
• /
• v.37 no.3
• /
• pp.451-459
• /
• 2000

In this paper, we observe the relation between the attainability of contingent claims and solutions of associated difference-differential equations. And we find the lower bound estimate of fair price using the minimax statistical approach.

• Journal of the Chungcheong Mathematical Society
• /
• v.23 no.4
• /
• pp.629-633
• /
• 2010

In this paper we provide a sharp lower bound of the first Neumann eigenvalue of a compact hypersurface $\Sigma$ inside a convex set C in a Riemannian manifold under the assumption that ${\partial}{\Sigma}$ meets ${\partial}C$ orthogonally.

• Korean Journal of Mathematics
• /
• v.18 no.4
• /
• pp.465-472
• /
• 2010

In this paper, we investigate the extent of the set on which the modulus of a meromorphic function is lower bounded by a term related to some Nevanlinna Theory functionals. A. I. Shcherba estimate the size of the set on which the modulus of an entire function is lower bounded by 1. Our theorem in this paper shows that the same result holds in the case that the lower bound is replaced by$lT(r,f)$, $0{\leq}l$ < 1, which improves Shcherba's result. We also give a similar estimation for meromorphic functions.

• Steel and Composite Structures
• /
• v.5 no.1
• /
• pp.1-15
• /
• 2005

Important characteristics of the previously proposed reduced stiffness method and a summery of its design curves for the buckling of the axially loaded sandwich cylindrical shells is presented. Comparison of the lower bound obtained with FEM analysis with that from the reduced stiffness analysis shows that the proposed reduced stiffness method can provide safe lower bounds for the buckling of geometrically imperfect, axially loaded sandwich cylindrical shells. One of the attractive features of the reduced stiffness elastic lower bound analysis is that it provides safe estimates of buckling loads that do not depend on the specification of the precise magnitude of the imperfection spectra. As a result, designers can readily apply this method without being worried about possible geometrical imperfections that might be generated during fabrication and construction of sandwich cylindrical shells.