• Title/Summary/Keyword: minimum length

Search Result 1,197, Processing Time 0.023 seconds

Efficient Construction of Euclidean Steiner Minimum Tree Using Combination of Delaunay Triangulation and Minimum Spanning Tree (들로네 삼각망과 최소신장트리를 결합한 효율적인 유클리드 스타이너 최소트리 생성)

  • Kim, Inbum
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.1
    • /
    • pp.57-64
    • /
    • 2014
  • As Steiner minimum tree building belongs to NP-Complete problem domain, heuristics for the problem ask for immense amount execution time and computations in numerous inputs. In this paper, we propose an efficient mechanism of euclidean Steiner minimum tree construction for numerous inputs using combination of Delaunay triangulation and Prim's minimum spanning tree algorithm. Trees built by proposed mechanism are compared respectively with the Prim's minimum spanning tree and minimums spanning tree based Steiner minimum tree. For 30,000 input nodes, Steiner minimum tree by proposed mechanism shows about 2.1% tree length less and 138.2% execution time more than minimum spanning tree, and does about 0.013% tree length less and 18.9% execution time less than minimum spanning tree based Steiner minimum tree in experimental results. Therefore the proposed mechanism can work moderately well to many useful applications where execution time is not critical but reduction of tree length is a key factor.

DETERMINATION OF MINIMUM LENGTH OF SOME LINEAR CODES

  • Cheon, Eun Ju
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.26 no.1
    • /
    • pp.147-159
    • /
    • 2013
  • Hamada ([8]) and Maruta ([17]) proved the minimum length $n_3(6,\;d)=g_3(6,\;d)+1$ for some ternary codes. In this paper we consider such minimum length problem for $q{\geq}4$, and we prove that $n_q(6,\;d)=g_q(6,\;d)+1$ for $d=q^5-q^3-q^2-2q+e$, $1{\leq}e{\leq}q$. Combining this result with Theorem A in [4], we have $n_q(6,\;d)=g-q(6,\;d)+1$ for $q^5-q^3-q^2-2q+1{\leq}d{\leq}q^5-q^3-q^2$ with $q{\geq}4$. Note that $n_q(6,\;d)=g_q(6,\;d)$ for $q^5-q^3-q^2+1{\leq}d{\leq}q^5$ by Theorem 1.2.

Determination of Minimum Vertex Interval using Shoreline Characteristics (해안선 길이 특성을 이용한 일관된 최소 점간거리 결정 방안)

  • WOO, Hee-Sook;KIM, Byung-Guk;KWON, Kwang-Seok
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.22 no.4
    • /
    • pp.169-180
    • /
    • 2019
  • Shorelines should be extracted with consistency because they are the reference for determining the shape of a country. Even in the same area, inconsistent minimum vertex intervals cause inconsistencies in the coastline length, making it difficult to acquire reliable primary data for national policy decisions. As the shoreline length cannot be calculated consistently for shorelines produced by determining the arbitrary distance between points below 1m, a methodology to calculate consistent shoreline length using the minimum vertex interval is proposed herein. To compare our results with the shoreline length published by KHOA(Korea Hydrographic and Oceanographic Agency) and analyze the change in shoreline length according to the minimum vertex interval, target sites was selected and the grid overlap of the shoreline was determined. Based on the comparison results, minimum grid sizes and the minimum vertex interval can be determined by deriving a polynomial function that estimates minimum grid sizes for determining consistent shoreline lengths. By comparing public shoreline lengths with generalized shoreline lengths using various grid sizes and by analyzing the characteristics of the shoreline according to vertex intervals, the minimum vertex intervals required to achieve consistent shoreline lengths could be estimated. We suggest that the minimum vertex interval methodology by quantitative evaluation of the determined grid size may be useful in calculating consistent shoreline lengths. The proposed method by minimum vertex interval determination can help derive consistent shoreline lengths and increase the reliability of national shorelines.

Position Analysis of Cow Teats for Teat-cup Attachment System on Robotic Milking System (로봇 착유기의 착유컵 자동착탈을 위한 착유우의 유두위치 조사분석)

  • Kwon, D.J.;Kim, W.;Lee, D.W.
    • Journal of Animal Environmental Science
    • /
    • v.8 no.3
    • /
    • pp.159-164
    • /
    • 2002
  • The distance between teats of each head on twenty heads of holstein was measured in Nation Livestock Research Institute of Rural Development Administration to find design variables on the teat-cup attachment system of the auto-milking system before milking. The distance between teats was tested by the steps for milk producing in the morning and evening. The results from this study is summarized as follow. 1 The maximum and minimum length between front teats were 297mm and 112mm respectively, the maximum and minimum length between rear teats were 231mm and 36mm and the maximum and minimum length between left front and left rear were 220 and 84mm. And the maximum length of right front and right rear were 205mm and 90mm. A relative position of the each teats was asymmetric. 2. The size of teats, the length between front teats, and the length between rear teats by lactating period were very much changed for its milking. 3. The design variables on the teat-cup attachment system was found by the length between each teats tested. Since the position of teat-cup is changed by milking environment for a cow to milk, the design variables should be considered to be asymmetric area between four teat of COW.

  • PDF

Supersonic Plug Nozzle Design and Comparison to the Minimum Length Nozzle Configuration

  • Zebbiche, Toufik;Youbi, ZineEddine
    • International Journal of Aeronautical and Space Sciences
    • /
    • v.7 no.1
    • /
    • pp.27-42
    • /
    • 2006
  • A method to design the contour and conception of a plug nozzle of arbitrary shape, but specified exit flow conditions is presented. Severals shapes can be obtained for exit Mach number by changing the specific heats ratio. The characteristics of the nozzle in terms of length, weight and pressure force exerted on the wall are compared to the Minimum Length Nozzle and found to be better. Our field of study is limited to the supersonic mode to not to have the dissociation of the molecules. The design method is based on the use of the Prandtl Meyer function of a perfect gas. The flow is not axial at the throat, which may be advantageous for many propulsion applications. The performance benefits of the plug nozzle compared to the Minimum Length Nozzle are also presented.

Minimum Weight Design of Laminated Composite Panel under Combined Loading (조합하중이 작용하는 복합적층 패널의 최소중량화설계)

  • Lee Jong-Sun
    • Transactions of the Korean Society of Machine Tool Engineers
    • /
    • v.15 no.1
    • /
    • pp.95-101
    • /
    • 2006
  • Minimum weight design of laminated composite panel under combined loading was studied using linear and nonlinear deformation theories and by closed-form analysis and finite difference energy methods. Various buckling load factors are obatined for laminated composite panels with rectangular type longitudinal stiffeners and various longitudinal length to radius ratios, which are made from Carbon/Epoxy USNl25 prepreg and are simply-supported on four edges under combined loading, and then for them, minimum weight design analyses are carried out by the nonlinear search optimizer, ADS. This minimum weight design analyses are constructed with various process such as the simple design process, test simulation process and sensitivity analysis. Subseguently, the buckling mode shapes are obtained by buckling and minimum weight analyses.

A Minimum Expected Length Insertion Algorithm and Grouping Local Search for the Heterogeneous Probabilistic Traveling Salesman Problem (이종 확률적 외판원 문제를 위한 최소 평균거리 삽입 및 집단적 지역 탐색 알고리듬)

  • Kim, Seung-Mo;Choi, Ki-Seok
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.33 no.3
    • /
    • pp.114-122
    • /
    • 2010
  • The Probabilistic Traveling Salesman Problem (PTSP) is an important topic in the study of traveling salesman problem and stochastic routing problem. The goal of PTSP is to find a priori tour visiting all customers with a minimum expected length, which simply skips customers not requiring a visit in the tour. There are many existing researches for the homogeneous version of the problem, where all customers have an identical visiting probability. Otherwise, the researches for the heterogeneous version of the problem are insufficient and most of them have focused on search base algorithms. In this paper, we propose a simple construction algorithm to solve the heterogeneous PTSP. The Minimum Expected Length Insertion (MELI) algorithm is a construction algorithm and consists of processes to decide a sequence of visiting customers by inserting the one, with the minimum expected length between two customers already in the sequence. Compared with optimal solutions, the MELI algorithm generates better solutions when the average probability is low and the customers have different visiting probabilities. We also suggest a local search method which improves the initial solution generated by the MELI algorithm.

Minimum Message Length and Classical Methods for Model Selection in Univariate Polynomial Regression

  • Viswanathan, Murlikrishna;Yang, Young-Kyu;WhangBo, Taeg-Keun
    • ETRI Journal
    • /
    • v.27 no.6
    • /
    • pp.747-758
    • /
    • 2005
  • The problem of selection among competing models has been a fundamental issue in statistical data analysis. Good fits to data can be misleading since they can result from properties of the model that have nothing to do with it being a close approximation to the source distribution of interest (for example, overfitting). In this study we focus on the preference among models from a family of polynomial regressors. Three decades of research has spawned a number of plausible techniques for the selection of models, namely, Akaike's Finite Prediction Error (FPE) and Information Criterion (AIC), Schwartz's criterion (SCH), Generalized Cross Validation (GCV), Wallace's Minimum Message Length (MML), Minimum Description Length (MDL), and Vapnik's Structural Risk Minimization (SRM). The fundamental similarity between all these principles is their attempt to define an appropriate balance between the complexity of models and their ability to explain the data. This paper presents an empirical study of the above principles in the context of model selection, where the models under consideration are univariate polynomials. The paper includes a detailed empirical evaluation of the model selection methods on six target functions, with varying sample sizes and added Gaussian noise. The results from the study appear to provide strong evidence in support of the MML- and SRM- based methods over the other standard approaches (FPE, AIC, SCH and GCV).

  • PDF

Determination of minimum depth of prestressed concrete I-Girder bridge for different design truck

  • Atmaca, Barbaros
    • Computers and Concrete
    • /
    • v.24 no.4
    • /
    • pp.303-311
    • /
    • 2019
  • The depth of superstructure is the summation of the height of girders and the thickness of the deck floor. In this study, it is aim to determine the maximum span length of girders and minimum depth of the superstructure of prestressed concrete I-girder bridge. For this purpose the superstructure of the bridge with the width of 10m and the thickness of the deck floor of 0.175m, which the girders length was changed by two meter increments between 15m and 35m, was taken into account. Twelve different girders with heights of 60, 75, 90, 100, 110, 120, 130, 140, 150, 160, 170 and 180 cm, which are frequently used in Turkey, were chosen as girder type. The analyses of the superstructure of prestressed concrete I girder bridge was conducted with I-CAD software. In the analyses AASHTO LRFD (2012) conditions were taken into account a great extent. The dead loads of the structural and non-structural elements forming the bridge superstructure, prestressing force, standard truck load, equivalent lane load and pedestrian load were taken into consideration. HL93, design truck of AASHTO and also H30S24 design truck of Turkish Code were selected as vehicular live load. The allowable concrete stress limit, the number of prestressed strands, the number of debonded strands and the deflection parameters obtained from analyses were compared with the limit values found in AASHTO LRFD (2012) to determine the suitability of the girders. At the end of the study maximum span length of girders and equation using for calculation for minimum depth of the superstructure of prestressed concrete I-girder bridge were proposed.

Minimization of Crop Length by Sizing Press in Hot Rolling Mill (열간 조압연 공정에서 2단 사이징 프레스에 의한 크롭 최소화)

  • Heo, S.J.;Lee, S.H.;Lee, S.J.;Lee, J.B.;Kim, B.M.
    • Transactions of Materials Processing
    • /
    • v.17 no.8
    • /
    • pp.619-626
    • /
    • 2008
  • In this study, design methodology to determine optimal shape of the anvil in sizing press process has been proposed to minimize crop length of the AISI 1010 slab in horizontal rolling after width reduction. Shape of anvil were selected to 12 cases by design of experiment, and the dog-bone shapes and the crop length were determined by FE-analysis. Also, the anvil shape, which has minimum crop length, were determined by artificial neural network(ANN). As a result of FE-analysis, it can be seen that the crop length was increased with increasing center thickness in the dog-bone shape after width reduction. The anvil shape which has minimum crop length, was estimated to ${\theta}_{1}=21^{\circ}{\theta}_{2}=14^{\circ}$ by FE-analysis and ANN.