scholarly journals PENCARIAN OBAT PADA APOTEK TERDEKAT DENGAN MEMANFAATKAN GOOGLE MAP

Compiler ◽  
2014 ◽  
Vol 3 (2) ◽  
Author(s):  
Digga Anggriawan ◽  
Nurcahyani Dewi Retnowati
Keyword(s):  
Open Source ◽  
Calculation Method ◽  
Web Server ◽  
Distance Calculation ◽  
Shortest Distance ◽  
Function Code

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%.

An Improved Fast Algorithm of Spacecraft Separation Distance Calculation

2013 ◽  
Vol 774-776 ◽  
pp. 1560-1566
Author(s):  
Zi Long Hao ◽  
Xin Jian Liu
Keyword(s):  
Fast Algorithm ◽  
Simulation Analysis ◽  
Separation Distance ◽  
Separation Process ◽  
Distance Calculation ◽  
Shortest Distance ◽  
Spatial Bodies

A faster algorithm for calculating the shortest distance between two spatial bodies based on existing algorithms was presented. A simulation analysis of missile models separation process was built by using this algorithm. The simulation proved that this algorithm has the same precision and faster speed compared with other existing algorithms.

scholarly journals Clustering of Synthetic Routes Using Tree Edit Distance

2020 ◽  
Author(s):  
Samuel Genheden ◽  
Ola Engkvist ◽  
Esben Jannik Bjerrum
Keyword(s):  
Open Source ◽  
Edit Distance ◽  
Prediction Tool ◽  
Tree Edit Distance ◽  
Distance Calculation ◽  
Time Prediction ◽  
Synthesis Routes ◽  
Synthetic Routes ◽  
Novel Algorithm

<div>We present a novel algorithm to compute the distance between synthesis routes based on a tree edit distance calculation. Such distances can be used to cluster synthesis routes from a retrosynthesis prediction tool. We show that the clustering of routes from a retrosynthesis analysis is performed in less than ten seconds on average, and only constitutes seven percent of the total time (prediction + clustering). Furthermore, we are able to show that representative routes from each cluster can be used to reduce the set of predicted routes. Finally, we show with a number of examples that the algorithm gives intuitive clusters that can be easily rationalized. The algorithm is included in the latest version of the open-source AiZynthFinder software.</div>

scholarly journals STUDI PENYELENGGARAAN JARINGAN SEKOLAH

2019 ◽  
Vol 8 (14) ◽  
pp. 005
Author(s):  
Nurdin Ibrahim ◽  
Purwanto Purwanto ◽  
Oos M. Anwas
Keyword(s):  
Focus Group ◽  
Open Source ◽  
Search Engine ◽  
Focus Group Discussion ◽  
Group Discussion ◽  
Web Server ◽  
User Friendly ◽  
E Mail

Penelitian ini bertujuan untuk mengetahui faktor pendukung dan penghambat dalam penyelengaraan jaringan sekolah, terutama dalam tahapan penyediaan, pelayanan, dan pembinaan jaringan. Metode pengumpulan data menggunakan Focus Group Discussion (FGD) terhadap pakar dan praktisi yang telah menyelenggarakan jaringan sekolah. Hasil analisis data diketahui bahwa faktor pendukung aspek penyediaan jaringan adalah SDM yang terstruktur dengan tugas, fungsi dan tanggung jawab yang jelas; dan adanya berbagai alternatif aplikasi web server open source. Faktor penghambatnya adalah: kurang dukungan pengambil kebijakan seperti pimpinan, kurang kerjasama pihak terkait, penyedia jasa internet dan lain-lain. Dalam aspek pelayanan faktor pendukung adalah content, kemudahan akses, registrasi, discount pulsa internet, jaminan keamanan, tidak adanya tagihan, dan lain-lain. Situs yang berbasis teks, user friendly, fasilitas link, FAQ, download, helpdesk, space, dan promosi langsung kepada user untuk menjaga loyalitasnya. Faktor penghambat adalah belum tersedianya fasilitas search engine content yang memadai dan menyulitkan provider untuk promosi; kurangnya insentif bagi user, kesinambungan pelayanan, e-mail gratis, dan target yang akan dicapai.

What Makes Free/Libre Open Source Software (FLOSS) Projects Successful?

2011 ◽  
pp. 87-98 ◽  
Author(s):  
Nicholas P. Radtke ◽  
Marco A. Janssen ◽  
James S. Collofello
Keyword(s):  
Open Source ◽  
Open Source Software ◽  
Scenario Analysis ◽  
Web Server ◽  
Agent Based Model ◽  
Agent Based ◽  
Future Developments ◽  
Insight Into

The last few years have seen a rapid increase in the number of Free/Libre Open Source Software (FLOSS) projects. Some of these projects, such as Linux and the Apache web server, have become phenomenally successful. However, for every successful FLOSS project there are dozens of FLOSS projects which never succeed. These projects fail to attract developers and/or consumers and, as a result, never get off the ground. The aim of this research is to better understand why some FLOSS projects flourish while others wither and die. This article presents a simple agent-based model that is calibrated on key patterns of data from SourceForge, the largest online site hosting open source projects. The calibrated model provides insight into the conditions necessary for FLOSS success and might be used for scenario analysis of future developments of FLOSS.

Open Source Software and International Outsourcing

2011 ◽  
pp. 791-798
Author(s):  
Kirk Amant ◽  
Brian Still
Keyword(s):  
Operating System ◽  
Open Source ◽  
Open Source Software ◽  
Web Server ◽  
The Internet ◽  
Business Practices ◽  
International Outsourcing ◽  
Global Business ◽  
International Growth ◽  
Future Business

The popularity of open source software (OSS) has exploded among consumers and software developers. For example, today, the most popular Web server on the Internet is Apache, an open source product. Additionally, Linux (often considered one of the perfect examples of OSS) is now contesting Microsoft’s dominance over the operating system market. OSS’ flexibility, moreover, has allowed it to become a key international technology that could affect developments in global business practices. Despite these beneficial aspects, there are those who would claim it is difficult to implement and its core developers are undependable hobbyists. The purpose of this paper is to provide the reader with an overview of what OSS is, to present some of the benefits and limitations of using OSS, and to examine how international growth in OSS use could affect future business practices. By understanding these factors, readers will gain a better understanding of it and how OSS can be integrated into their organizational computing activities.

An Approach to Dynamic Distance Calculations for Obstacle Avoidance Problems

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.

An Approach to Detect Similar Script Functions in Web Applications Based on Calling Information

2012 ◽  
Vol 263-266 ◽  
pp. 1593-1599 ◽  
Author(s):  
Jung Il Kim ◽  
Eun Joo Lee
Keyword(s):  
Open Source ◽  
System Performance ◽  
Web Applications ◽  
Structural Similarity ◽  
The Other ◽  
Novel Approach ◽  
System Maintenance ◽  
Key Issues ◽  
Function Code ◽  
Maintenance Problem

Cloned code might exacerbate a system maintenance problem, so it is important to remove duplicate code to improve system performance. In web development, script code can often be duplicated as a unit of a script function. Previous research for detecting similar script functions forecasted candidates of similar script functions based on the name of the function and classified the detected candidates into four similarity levels by comparing factors contained within the script functions. There are two key issues that need to be considered to detect similar script functions when using that method. One was that a pair of similar script functions needs to have the same name to be detected. The other was that some modifications particularly such as adding or removing calling statements were not identified after detecting. Adding or removing calling statements might prevent identification for duplicate script function. In this paper, we propose a novel approach to detect similar script functions that can determine the similarity of a script function by evaluating the structural similarity of function code and the calling structure. The evaluation for detecting the structural similarity of code and the calling structure is performed based on a similarity metric, FSIM, which we have defined. We showed the usefulness of FSIM by applying it to three open source projects.

scholarly journals The relevance of Open Source to hydroinformatics

2002 ◽  
Vol 4 (4) ◽  
pp. 219-234 ◽  
Author(s):  
Hamish Harvey ◽  
Dawei Han
Keyword(s):  
Operating System ◽  
Software Development ◽  
Open Source ◽  
Open Source Software ◽  
Rapid Development ◽  
Source Code ◽  
Web Server ◽  
High Profile ◽  
History Of ◽  
Closed Approach

Open Source, in which the source code to software is freely shared and improved upon, has recently risen to prominence as an alternative to the more usual closed approach to software development. A number of high profile projects, such as the Linux operating system kernel and the Apache web server, have demonstrated that Open Source can be technically effective, and companies such as Cygnus Solutions (now owned by Red Hat) and Zope Corporation have demonstrated that it is possible to build successful companies around open source software. Open Source could have significant benefits for hydroinformatics, encouraging widespread interoperability and rapid development. In this paper we present a brief history of Open Source, a summary of some reasons for its effectiveness, and we explore how and why Open Source is of particular interest in the field of hydroinformatics. We argue that for technical, scientific and business reasons, Open Source has a lot to offer.

Sign in / Sign up

Export Citation Format

Share Document