• 대한안전경영과학회:학술대회논문집
• /
• 대한안전경영과학회 2009년도 춘계학술대회
• /
• pp.185-192
• /
• 2009

The research contributes extending and reviewing of restricted (constrained) and unrestricted (unconstrained) models in GLM(Generalized Linear Models). The paper includes the methodology for finding EMS(Expected Mean Square) and $F_0$ ratio. The results can be applied to the gauge R&R(Reproducibility and Repeatability) in MSA(Measurement System Analysis).

• 대한안전경영과학회지
• /
• 제11권3호
• /
• pp.209-216
• /
• 2009

A development in method of evaluating the measurement precisions using approximate F tests and variance components from expected mean square (EMS) is investigated. The research proposes three-factor mixed measurement models with the fixed and random factors. Unrestricted and unconstrained design work was rarely studied, while restricted and constrained designs have been significantly discussed. The unrestricted and unconstrained designs assume to be an independence of interaction. The proposed evaluation method about the measurement precisions can be extended to four-factor random measurement model or mixed measurement model. The study also presents the three evaluation indexes of precisions such as R&RTR (Reproducibility & Repeatability-To-Total Precision Ratio), PTR (Precision-To-Tolerance Ratio), and SNR (Signal-To-Noise Ratio). Numerical examples are proposed to evaluate the approximate F tests with Satterthwaite degrees of freedom and three indexes using the measurement precisions from EMS.

• 대한수학회지
• /
• 제56권3호
• /
• pp.689-701
• /
• 2019

We study the recovery results of ${\ell}_p$-constrained compressive sensing (CS) with $p{\geq}1$ via robust width property and determine conditions on the number of measurements for standard Gaussian matrices under which the property holds with high probability. Our paper extends the existing results in Cahill and Mixon from ${\ell}_2$-constrained CS to ${\ell}_p$-constrained case with $p{\geq}1$ and complements the recovery analysis for robust CS with ${\ell}_p$ loss function.

• Journal of the Korean Statistical Society
• /
• 제36권3호
• /
• pp.335-347
• /
• 2007

Two new types of positive biasedness, which are closely related to Type III positive biasedness (Yanagimoto and Sibuya, 1972), are proposed. We call these near Type III positive biasedness. Though no implication between Type II and near Type III biasedness exists, near Type III seems to be less restrictive than Type II biasedness. Constrained maximum likelihood estimates of distribution functions under near Type III positive bisedness are obtained. The likelihood ratio tests of symmetry against new positive biasedness restrictions are proposed. A small simulation study is conducted to compare the performance of the tests.

• 한국경영과학회지
• /
• 제28권4호
• /
• pp.191-198
• /
• 2003

The generalized knapsack problem or gknap is the combinatorial optimization problem of optimizing a nonnegative linear function over the integral hull of the intersection of a polynomially separable 0-1 polytope and a knapsack constraint. The knapsack, the restricted shortest path, and the constrained spanning tree problem are a partial list of gknap. More interesting1y, all the problem that are known to have a fully polynomial approximation scheme, or FPTAS are gknap. We establish some necessary and sufficient conditions for a gknap to admit an FPTAS. To do so, we recapture the standard scaling and approximate binary search techniques in the framework of gknap. This also enables us to find a weaker sufficient condition than the strong NP-hardness that a gknap does not have an FPTAS. Finally, we apply the conditions to explore the fully polynomial approximability of the constrained spanning problem whose fully polynomial approximability is still open.

• Journal of Electrical Engineering and Technology
• /
• 제4권3호
• /
• pp.301-309
• /
• 2009

A simple and efficient Lambda logic (${\lambda}-logic$) based algorithm is proposed for the solution of the generator constrained economic dispatch problem when the generating units having prohibited zones. The proposed method solves the economic dispatch (ED) problem that takes into account ramprate limits, transmission losses and prohibited operating zones in the power system operation. The proposed method uses a simple heuristic rule based on average power of prohibited operating zones which produces the feasibility of solution for the restricted operating units. The effectiveness of the algorithm is tested on five different test systems and the performance compared with other relevant methods reported in the literature. In all the cases, the proposed algorithm performs better than the previous existing algorithms with a less computational burden.

• 산업공학
• /
• 제12권3호
• /
• pp.362-373
• /
• 1999

Resource Constrained Dynamic Multi-Projects Scheduling (RCDMPS) is intended to schedule activities of two or more projects sequentially arriving at die shop under restricted resources. The aim of this paper is to develop a new problem solving method for RCDMPS to make an effect schedule based by constraint programming. The constraint-based scheduling method employs ILOG Solver which is C++ constraint reasoning library for solving complex resource management problems and ILOG Schedule which is a add-on library to ILOG Solver dedicated to solving scheduling problems. And this method interfaces with ILOG Views so that the result of scheduling displays with Gantt chart. The scheduling method suggested in this paper was applied to a company scheduling problem and compared with the other heuristic methods, and then it shows that the new scheduling system has more preference.

• 한국정밀공학회지
• /
• 제27권12호
• /
• pp.48-58
• /
• 2010

In this study, position tracking and force reflection control of a master-slave manipulator which will be used for handling objects contaminated by radioactivity has been addressed. Since available measurements concerning on dynamic motion of the master-slave manipulator are restricted, a simple constrained control structure was suggested. In the consideration of the uncertain dynamic behaviors of the slave manipulator which is dependent upon mass and shape of work pieces grasped and dynamic properties of the environment contacted, a simple structured sliding mode control was suggested to guarantee robustness with respect to parameter uncertainties and external disturbances. The proposed control was applied to a 1-DOF master-slave link system. The control performances were verified along with some computer simulation results.

• 드라이브 ㆍ 컨트롤
• /
• 제9권3호
• /
• pp.29-36
• /
• 2012

The hydraulic cylinder is used for actuating the roller-link type rotating floodgate which controls the volume of water in the reservoir. The locating points of hydraulic cylinder are restricted to the limited space and determined to minimize the cylinder force necessary for actuating the floodgate. Generally, the head end point of cylinder is fixed at underground and the rod end point of cylinder is connected to the support link. Therefore there exist three design variables to be determined to minimize the cylinder force within the rotating range of floodgate. First, the mathematical model of the roller-link type rotating floodgate is derived to find the cylinder force corresponding to the floodgate angle. Then, the optimal locating point of hydraulic cylinder is searched using the complex method that is one kind of constrained direct search method.

• 산업경영시스템학회지
• /
• 제22권52호
• /
• pp.297-309
• /
• 1999

Resource Constrained Dynamic Multi-Projects Scheduling(RCDMPS) is intended to minimize the total processing time(makespan) of two or more projects sequentially arriving at the shop under restricted resources. The aim of this paper is to develop the new Tabu Search heuristic for RCDMPS to minimize makespan. We propose the insertion method to generate the neighborhood solutions in applying the Tabu Search for the RCDMPS and the diversification strategy to search the solution space diversely. The proposed diversification strategy apply the dynamic tabu list that the tabu list size is generated and renewed at each iteration by the complexity of the project, and change the proposed tabu attribute. In this paper, We use the dynamic tabu list for the diversification strategy and intensification strategy in the tabu search, and compare with other dispatching heuristic method to verify that the new heuristic method minimize the makespan of the problem.