• 제목/요약/키워드: minimum order

검색결과 2,749건 처리시간 0.032초

OPTIMAL RADIOCOLORING OF TREES

  • Zhang, Xiaoling
    • Korean Journal of Mathematics
    • /
    • 제27권4호
    • /
    • pp.831-841
    • /
    • 2019
  • A Radiocoloring (RC) of a graph G is a function f from the vertex set V (G) to the set of all non-negative integers (labels) such that |f(u) - f(v)| ≥ 2 if d(u, v) = 1 and |f(u) - f(v)| ≥ 1 if d(u, v) = 2. The number of discrete labels and the range of labels used are called order and span, respectively. In this paper, we concentrate on the minimum order span Radiocoloring Problem (RCP) of trees. The optimization version of the minimum order span RCP that tries to find, from all minimum order assignments, one that uses the minimum span. We provide attainable lower and upper bounds for trees. Moreover, a complete characterization of caterpillars (as a subclass of trees) with the minimum order span is given.

ON THE MINIMUM ORDER OF 4-LAZY COPS-WIN GRAPHS

  • Sim, Kai An;Tan, Ta Sheng;Wong, Kok Bin
    • 대한수학회보
    • /
    • 제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.

최소차 하천의 임계면적에 따른 유역 지형매개변수의 변화특성 (Change characteristic of basin topographical parameters according to the threshold area of minimum order stream)

  • 안승섭;박노삼;김종호;임기석;송시훈
    • 한국환경과학회지
    • /
    • 제14권1호
    • /
    • pp.33-40
    • /
    • 2005
  • The size of minimum order stream has a very sensitive effect on runoff analysis model using the divergence characteristic of stream. Therefore, in this study, the threshold area of minimum order stream has been examined the change characteristic of topographical parameters. The subject basin of the research was the upper basin of the Kumho water gage station which is located in the middle of the Kumho river. The 1:25,000 numerical geography which was constructed $10{\times}10m$ mesh was used. The range of investigation of topographical parameters are number of stream order, length, area, slope, basin relief, sinuosity ratio, drainage density and total stream length etc. It was found from the result of analysis that the threshold value of minimum order stream has a very big effect on topographical parameters of basin. It was found that the threshold area of minimum ord er stream revealed under $0.10km^{2}.$ Furthermore, the parameters showed a serious change except for over $0.10km^{2}.$

최소계수 양자화 오차를 갖는 2차 디지틀 필터의 설계 (Design of the 2nd order Digital Filter with Minimum Coefficient Quatization Error)

  • 문용선;박종안
    • 한국통신학회논문지
    • /
    • 제15권5호
    • /
    • pp.364-373
    • /
    • 1990
  • 디지틀 필터를 전용 하드웨어나 범용 계산기에 의해서 實現할 때 有限 語長 實現에 기인해서 量子化 誤差(演算, 誤差, 係數 量子化 誤差)가 필연적으로 발생하며, 또한 이러한 量子化 誤差의 最小化를 위한 等價 變換 行列이 연구되었다. 본 논문에서는 演算 誤差 最小 實現과 係數 量子化 誤差 最小 實現과의 상호 등가 변환할 수 있는 等價 變換行列을 유도하고 유도된 等價 變換 行列의 유효성을 나타내기 위해서 演算 誤差 最小型 2차 디지틀 필터로부터 係數 量子化 誤差 最小型 2차 디지틀 필터를 설계하고 시뮬레이션하였다.

  • PDF

진동절삭법을 이용한 절삭깊이의 최소화 (The Minimizing of Cutting Depth using Vibration Cutting)

  • 손성민;안중환
    • 한국정밀공학회지
    • /
    • 제21권11호
    • /
    • pp.38-45
    • /
    • 2004
  • This paper discusses the minimum cutting thickness with a continuous chip in sub-micrometer order precision diamond cutting. An ultra precision cutting model is proposed, in which the tool edge radius and the friction coefficient are the principal factors determining the minimum cutting thickness. The experimental results verify the proposed model and provide various supporting evidence. In order to reduce the minimum cutting thickness a vibration cutting method is applied, and the effects are investigated through a series of experiments under the same conditions as conventional cutting method.

Optimal Minimum Bias Designs for Model Discrimination

  • Park, Joong-Yang
    • Communications for Statistical Applications and Methods
    • /
    • 제5권2호
    • /
    • pp.339-351
    • /
    • 1998
  • Designs for discriminating between two linear regression models are studied under $\Lambda$-type optimalities maximizing the measure for the lack of fit for the designs with fixed model inadequacy. The problem of selecting an appropriate $\Lambda$-type optimalities is shown to be closely related to the estimation method. $\Lambda$-type optimalities for the least squares and minimum bias estimation methods are considered. The minimum bias designs are suggested for the designs invariant with respect to the two estimation methods. First order minimum bias designs optimal under $\Lambda$-type optimalities are then derived. Finally for the case where the lack of fit test is significant, an approach to the construction of a second order design accommodating the optimal first order minimum bias design is illustrated.

  • PDF

최소 차수 확장 칼만 필터를 이용한 속도센서 없는 유도전동기 벡터제어 (Speed Sensorless Vector Control of Induction Motors Using a Minimum-order Extended Kalman Filter)

  • 이승현;정교범
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1998년도 추계학술대회 논문집 학회본부A
    • /
    • pp.171-175
    • /
    • 1998
  • This paper proposes a speed sensorless vector control of induction motor using a minimum-order EKF(extended kalman filter). Minimum-order EKF has the advantage of reducing the computational estimation cost because the stator current is not estimated. EKF does not deteriorate the performance of the overall speed control system, even though the measurements are relatively noisy. The estimated rotor speed is used for vector control and overall speed control. Computer simulations of the speed sensorless vector control are carried out to test the usefulness of the minimum-order EKF algorithm.

  • PDF

비최소 위상 플랜트의 최소 위상 플랜트로의 균형 모델 저차화 (Balanced model reduction of non-minimum phase plant into minimum phase plant)

  • 구세완;권혁성;서병설
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
    • /
    • pp.1205-1208
    • /
    • 1996
  • This paper proposes balanced model reduction of non-minimum phase plant. The algorithm presented in this paper is to convert high-order non-minimum phase plant into low-oder minimum phase plant using balanced model reduction. Balanced model reduction requires the error bound that Hankel singular value produces. This algorithm shows the tolerance that admits the method of this paper.

  • PDF

A Global Optimal Sliding-Mode Control for the Minimum Time Trajectory Tracking with Bounded Inputs

  • Choi, Hyeung-sik
    • Journal of Mechanical Science and Technology
    • /
    • 제15권4호
    • /
    • pp.433-440
    • /
    • 2001
  • A new design of the sliding mode control is proposed for the uncertain linear time-varying second order system. The proposed control drives system states to the target point in the minimum time with specified ranges of parametric uncertainties and disturbances. One of the advantages of the proposed control scheme is that the control inputs do not go beyond saturation limits of the actuators. The other advantage is that the minimum arrival time and the acceleration of the second order actuators system can be estimated with given parametric bounds and can be expressed in the closed from; conversely, the designer can select actuators based on the condition of the minimum arrival time to the target point. The superior performance of the proposed control scheme to other sliding mode controllers is validated by computer simulations.

  • PDF

컨베이어 상의 이동 물체 획득을 위한 로봇의 최소시간 알고리즘 (Minimum time Algorithm for intercepting a Moving Object on Conveyor System)

  • 신익상;문승빈
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2004년도 학술대회 논문집 정보 및 제어부문
    • /
    • pp.526-528
    • /
    • 2004
  • This paper focuses on planning strategies for object interception, especially with minimum time. Herein, the goal is for robot to intercept object with minimum time on a conveyor line that flows to x-axis with respect to world coordinate system. In order to do it, conveyor system needs the algorithms for minimizing time. This objective is achieved by solving about two problems: selection of a minimum-time interception point and planning of an optimal robot trajectory. Herein, the first problem is formulated a minimization of the robot-object interception time.

  • PDF