An Environment-Visualization System with Image-Based Retrieval and Distance Calculation Method

The availability of drugs at any pharmacy vary different so make customers is not easy get drugs that needed when we comes to pharmacy. We need a system to assist search for drugs. This study use ssimulation of three pharmacy integrated to web server for synchronize drug stocks. This system needed the coordinates pharmacy and the coordinates customers to perform distance calculations. A data coordinates pharmacy contained in web server while the customer location input to system later request to google map for get the coordinates. Distance calculation method use calculation function code program google map is open source based on the coordinates pharmacy and the coordinates customers who later produce distance is 7,1 Km, 2,1 Km, and 5,8 Km. Than we get produce shortest distance using min method in math object provided the carrier object javascript with percentace is 43,3%, 14%, and 36,6%, and than shortest distance is 2,1 Km with percentace is 14%.

Download Full-text

An Approach to Dynamic Distance Calculations for Obstacle Avoidance Problems

3rd Conference on Flexible Assembly Systems ◽

10.1115/detc1991-0165 ◽

1991 ◽

Author(s):

C. Y. Liu ◽

W. R. Chen ◽

R. W. Mayne

Keyword(s):

Motion Planning ◽

Calculation Method ◽

Two Dimensional ◽

Robot Path Planning ◽

Distance Calculation ◽

Approach Distance ◽

Quadratic Programming Method ◽

Swept Volume ◽

Planning Problems ◽

Robot Path

Abstract This paper presents a distance calculation method which can be used in machine motion planning optimizations where interference is a concern. Dynamic distance calculations are discussed which use the quadratic programming method combined with an approximate swept volume approach. Distance-to-contact calculations can be obtained for both interference and non-interference situations. The swept volume of a moving polygon is constructed through a series of overlapped swept volume segments. Each of the swept volume segments is efficiently developed by checking the inner products of polygon outward boundary normals with velocity vectors for polygon vertices. Two dimensional examples of distance-to-contact computations and robot path planning problems are presented for a sample three link robot with three rotational joints.

Download Full-text

FIXED VOTERS CLUSTERING TO DETERMINE THE LEVEL OF BEGINNER VOTERS USING DATA MINING TECHNIQUES

Engineering and Technology Journal ◽

10.47191/etj/v5i11.02 ◽

2020 ◽

Vol 5 (11) ◽

Author(s):

Ummul Hairah ◽

Keyword(s):

Data Mining ◽

Decision Making ◽

Error Rate ◽

Calculation Method ◽

Manhattan Distance ◽

Minkowski Distance ◽

Distance Calculation ◽

Distance Model ◽

Calculation Results ◽

Using Data

Data mining clustering technique is used to classify the level of beginner voters using the K-Means method. Fixed voter clusters are used for decision making for stakeholders regarding information on beginner voters in each district and sub-district. The error calculation method is used to measure the level of error value for each distance calculation used, the distance calculation method used ie Euclidean, Manhattan, and Minkowski Distance with the Means Square Error (MSE) approach to measure the level of the error value. The calculation results show that the lowest error occurs in the calculation of the Minkowski Distance model 3 cluster, where the error rate is 11%, while the highest error rate occurs in the calculation of the Manhattan Distance model 5 cluster, which is 38%.

Download Full-text