• 대한수학회보
• /
• 제55권6호
• /
• pp.1667-1690
• /
• 2018

We consider the minimum order of a graph G with a given lazy cop number $c_L(G)$. Sullivan, Townsend and Werzanski [7] showed that the minimum order of a connected graph with lazy cop number 3 is 9 and $k_3{\square}k_3$ is the unique graph on nine vertices which requires three lazy cops. They conjectured that for a graph G on n vertices with ${\Delta}(G){\geq}n-k^2$, $c_L(G){\leq}k$. We proved that the conjecture is true for k = 4. Furthermore, we showed that the Petersen graph is the unique connected graph G on 10 vertices with ${\Delta}(G){\leq}3$ having lazy cop number 3 and the minimum order of a connected graph with lazy cop number 4 is 16.

• Journal of Mechanical Science and Technology
• /
• 제18권5호
• /
• pp.838-846
• /
• 2004

Minimum ignition energies of hydrogen/air and methane/air mixtures have been investigated numerically by solving unsteady one-dimensional conservation equations with detailed chemical kinetic mechanisms. Initial kernel size needed for numerical calculation is a sensitive function of initial pressure of a mixture and should be estimated properly to obtain quantitative agreement with experimental results. A simple macroscopic model to determine minimum ignition energy has been proposed, where the initial kernel size is correlated with the quenching distance of a mixture and evaluated from the quenching distance determined from experiment. The simulation predicts minimum ignition energies of two sample mixtures successfully which are in a good agreement with the experimental data for the ranges of pressure and equivalence ratio.

• 전기학회논문지
• /
• 제57권9호
• /
• pp.1612-1617
• /
• 2008

Since most disturbance observer (DOB) approaches have been limited to minimum-phase systems (or systems having no zero dynamics), we propose a new DOB structure that can be applied to non-minimum phase systems. The new structure features an additional system, which is called as V-filter, whose role is to yield a minimum phase system when connected with the plant in parallel. In order to design the V-filter systematically we first consider a class of linear systems that can be stabilized via PID controller. By inverting the controller's transfer function, we can simply construct the filter. A convenient way of designing V-filter is presented by using an iterative linear matrix inequality (LMI) algorithm. With an illustrative example the simulation result shows that substantial improvement in the performance has been achieved compared with the control system without the DOB.

• 한국기계가공학회지
• /
• 제21권8호
• /
• pp.32-42
• /
• 2022

Asymptotic tracking of a non-minimum phase nonlinear system has been a popular topic in control theory and application. In this paper, we propose a new control scheme to achieve asymptotic output tracking in anon-minimum phase nonlinear system for periodic trajectories through an iterative learning control with the stable inversion. The proposed design method is robust to parameter uncertainties and periodic external disturbances since it is based on iterative learning. The performance of the proposed algorithm was demonstrated through the simulation results using a typical non-minimum nonlinear system of an inverted pendulum on a cart.

• Journal of Mechanical Science and Technology
• /
• 제18권1호
• /
• pp.82-91
• /
• 2004

This article deals with a minimum energy control law of S-CVT connected to a dc motor. The S-CVT can smoothly transit between the forward, neutral, and reverse states without any brakes or clutches, and its compact and simple design and its relatively simple control make it particularly effective for mechanical systems in which excessively large torques are not required. And such an S-CVT equipped power transmission has the advantage of being able to operate the power sources in their regions of maximum efficiency, thereby improving the energy efficiency of the transmission system. The S-CVT was intended to primarily for use in small power capacity transmissions, thus a dc motor was considered here as the power source. We first review the structure and operating principles of the S-CVT, including experimental results of its performance. And then we describe a minimum energy control law of S-CVT connected to a do motor. To do this, we describe the results of an analysis of the dynamics of an S-CVT equipped power transmission and the power efficiency of a DC motor. The minimum energy control design is carried out via B-spline parameterization. And we show numerical results obtained from simulations illustrate the validity of our minimum energy control design, benchmarked with a computed torque control algorithm for S-CVT.

• 노동경제논집
• /
• 제44권1호
• /
• pp.31-72
• /
• 2021

본 연구는 한국노동패널(12~21차)을 이용하여 최저임금 인상이 개인의 노동이동에 미친 영향을 다항로짓으로 추정한다. 특히 2018년 최저임금의 급격한 상승에 따른 특이한 효과가 있는지를 확인한다. 추정 결과, 첫째, 최저임금 인상은 임금근로자와 자영업자 모두 미취업 확률을 높여왔지만 2018년의 추가적인 영향은 크지 않은 것으로 나타났다. 둘째, 최저임금 인상은 자영업자가 상용직보다는 임시·일용직으로 입직할 확률을 높이는 것으로 나타났다. 셋째, 2018년 최저임금 인상은 고졸 이하 자영업자에 큰 타격을 주었으며, 청년 임금근로자의 자영업으로의 입직을 현저히 낮춘 것으로 나타났다. 본 연구 결과는 최저임금 인상이 우리나라 자영업 비중의 감소를 설명할 수 있는 단초를 제공하며, 임시·일용직으로의 입직을 늘리기 때문에 고용의 질에는 좋지 않은 영향을 줄 수 있음을 시사한다.

• Journal of applied mathematics & informatics
• /
• 제28권1_2호
• /
• pp.283-293
• /
• 2010

In this paper, inverse constrained minimum spanning tree problem under Hamming distance. Such an inverse problem is to modify the weights with bound constrains so that a given feasible solution becomes an optimal solution, and the deviation of the weights, measured by the weighted Hamming distance, is minimum. We present a strongly polynomial time algorithm to solve the inverse constrained minimum spanning tree problem under Hamming distance.

• 한국군사과학기술학회지
• /
• 제2권2호
• /
• pp.271-278
• /
• 1999

An alternative panel flutter approach utilizing minimum angle is presented. The minimum angle is the lowest value among the angles between modes i and j at a certain pressure condition. This method utilizes eigenvectors rather than eigenvalues. Cross-ply composite plates are considered in this study. A remarkable result of this investigation is that the angle always dropped gradually to zero for all presented examples

• Transactions on Control, Automation and Systems Engineering
• /
• 제4권2호
• /
• pp.130-139
• /
• 2002

In this paper, at first, we investigate existing algorithms for finding the minimum infinity-norm solution of consistent linear equations and then propose a new algorithm. The proposed algorithm is intended to includes the advantages of computational efficiency as well as geometric explicitness. As a practical application example, optimum trajectory planning for redundant robot manipulators is considered. Also, an efficient approach avoiding discontinuity in trajectory is proposed by resolving the non-uniqueness problem of minimum infinity-norm solution. To be specific, the proposed method for checking possible discontinuity does not need any other algorithms in checking the possibility of discontinuity while previous work needs specially designed checking courses. To show the usefulness of the proposed techniques, an example calculating minimum infinity-norm solution for comparing the computational efficiency as well as the trajectory planning for a redundant robot manipulator are included.

• Management Science and Financial Engineering
• /
• 제8권1호
• /
• pp.1-19
• /
• 2002

Ordering is used to reduce the amount of fill-ins in the Cholesky factor of a symmetric positive definite matrix. One of the most efficient ordering methods is the minimum degree ordering algorithm(MDO). In this paper, we provide a few techniques that improve the performance of MDO implemented with the clique storage scheme. First, the absorption of nodes in the cliques is developed which reduces the number of cliques and the amount of storage space required for MDO. Second, we present a modified minimum degree ordering algorithm of which the number of degree updates can be reduced by introducing the lower bounds of degrees. Third, using both the lower and upper bounds of degrees, we develop an approximate minimum degree ordering algorithm. Experimental results show that the proposed algorithm is competitive with the minimum degree ordering algorithm that uses quotient graphs from the points of the ordering time and the nonzeros in the Cholesky factor.