Efficient Minimum Distance Computation for Solids of Revolution

2020 ◽  
Vol 39 (2) ◽  
pp. 535-544
Author(s):  
S.‐H. Son ◽  
S.‐H. Yoon ◽  
M.‐S. Kim ◽  
G. Elber
Keyword(s):  
Minimum Distance ◽  
Distance Computation ◽  
Solids Of Revolution

scholarly journals A Fast K-prototypes Algorithm Using Partial Distance Computation

2017 ◽  
Author(s):  
Byoungwook KIM
Keyword(s):  
Minimum Distance ◽  
Clustering Algorithm ◽  
Cluster Center ◽  
Maximum Difference ◽  
Distance Computation ◽  
Computational Performance ◽  
Categorical Attributes ◽  
Data Objects ◽  
Numeric Data ◽  
Numeric Attributes

The k-means is one of the most popular and widely used clustering algorithm, however, it is limited to only numeric data. The k-prototypes algorithm is one of the famous algorithms for dealing with both numeric and categorical data. However, there have been no studies to accelerate k-prototypes algorithm. In this paper, we propose a new fast k-prototypes algorithm that gives the same answer as original k-prototypes. The proposed algorithm avoids distance computations using partial distance computation. Our k-prototypes algorithm finds minimum distance without distance computations of all attributes between an object and a cluster center, which allows it to reduce time complexity. A partial distance computation uses a fact that a value of the maximum difference between two categorical attributes is 1 during distance computations. If data objects have m categorical attributes, maximum difference of categorical attributes between an object and a cluster center is m. Our algorithm first computes distance with only numeric attributes. If a difference of the minimum distance and the second smallest with numeric attributes is higher than m, we can find minimum distance between an object and a cluster center without distance computations of categorical attributes. The experimental shows proposed k-prototypes algorithm improves computational performance than original k-prototypes algorithm in our dataset.

scholarly journals Minimum distance computation of linear codes via genetic algorithms with permutation encoding

2019 ◽  
Vol 52 (3) ◽  
pp. 71-74 ◽  
Author(s):  
José Gómez-Torrecillas ◽  
F. J. Lobillo ◽  
Gabriel Navarro
Keyword(s):  
Genetic Algorithms ◽  
Minimum Distance ◽  
Linear Codes ◽  
Distance Computation

Determining The Minimum Distance Between Centers of Two Parallel Tunnels to Apply The Law of Super Position in Order to Calculate Subsidence by Using The Software FLAC 3D

2015 ◽  
Vol 1 (1) ◽  
pp. 13-20
Author(s):  
Hamid Reza Samadi ◽  
Mohammad Reza Samadi
Keyword(s):  
Minimum Distance ◽  
Surface Subsidence ◽  
Urban Traffic ◽  
Underground Structures ◽  
Rapid Population Growth ◽  
The North ◽  
Flac 3D ◽  
The Law ◽  
3D Software ◽  
Twin Tunnels

Due to the development of cities as well as rapid population growth, urban traffic is increasing nowadays. Hence, to improve traffic flow, underground structures such as metro, especially in metropolises, are inevitable. This paper is a research on the twin tunnels Of Isfahan's metro between Shariaty station and Azadi station from the North towards the South. In this study, simultaneous drilling of subway's twin tunnels is simulated by means of Finite Difference Method (FDM) and FLAC 3D software. Moreover, the lowest distance between two tunnels is determined in a way that the Law of Super Position could be utilized to manually calculate the amount of surface subsidence, resulted by drilling two tunnels, by employing the results of the analysis of single tunnels without using simultaneous examination and simulation. In this paper, this distance is called "effective distance". For this purpose, first, the optimum dimensions of the model is chosen and then, five models with optimum dimensions will be analyzed separately, each of which in three steps. The results of analyses shows that the proportions (L/D) greater than or equal 2.80, the Law of Super Position can be applied for prediction of surface subsidence, caused by twin tunnels' construction

ENSURING THE PEDESTRIAN’S SAFETY DESIGN OF URBAN STREET CROSSWALKS

2019 ◽  
pp. 103-110
Author(s):  
Dmitriy Nemchinov
Keyword(s):  
Traffic Flow ◽  
Minimum Distance ◽  
Travel Speed ◽  
Vehicle Speed ◽  
Urban Street ◽  
Safety Design ◽  
Positive Practices ◽  
Time Required ◽  
Pedestrian Crossing ◽  
The City

The article presents an analysis of positive practices for ensuring the safety of pedestrians at the inter-section of the city streets carriageway, as well as a description of some innovations of regulatory and tech-nical documents, including an increased number of cases when a safety island can be arranged at a pedestri-an crossing. requirements for providing visibility at a pedestrian crossing to determine the minimum distance of visibility at a pedestrian crossing based on the time required pedestrians for crossing the roadway, recommended options for using ground unregulated pedestrian crossings on trapezoidal artificial irregularities according to GOST R 52605; traffic flow) and Z-shaped (also in the direction of the traffic flow), the requirements for the size of the securi-ty island have been established to allow put bicycle inside of safety island, a recommended set of measures to reduce the vehicle speed and describes the types of activities and describes a method of their application, describes methods zones device with reduced travel speed - residential and school zones, set requirements for turboroundabouts and methods of their design.

Sign in / Sign up

Export Citation Format

Share Document