PENENTUAN ARAH LOKASI TUJUAN PENGUNJUNG DI RSUD ARIFIN ACHMAD

<div>AbstractHospital has several location point that are often visited by some people such as hospital personnel, patients, or visitors from outside. Each point of the location is interconnected by a path. To facilitate the visitors and residents of the hospital to finding the location point then used the shortest path, in addition to the shortest distance can also save time, especially in an emergency. In this research, Floyd-Warshall method is used to perform the shortest path calculation in Regional General Hospital Arifin Achmad and PHP programming languages as well as MySQL as data management into information. Floyd-Warshall is one of the search algorithms that can be used in calculating the shortest path, and is able to compare all possible paths in the graph for each side of all existing nodes. The data obtained shows that the RSUD consists of 40 points and 50 sides connecting each point. In the research will produce the shortest trajectory that will be passed based on from the starting point to the point of destination, the point that passed in the form of the name of the building and the distance that passed by visitors Arifin Achmad Hospital.Keywords: Location, Graph, Floyd-Warshall, PHP, MySql AbstrakRumah Sakit (RS) memiliki beberapa titik lokasi yang kerap dikunjungi oleh sebagian orang seperti petugas RS, pasien, maupun pengunjung dari luar. Setiap titik lokasi tersebut saling terhubung oleh suatu lintasan. Untuk memudahkan pengunjung dan penghuni RS dalam mencari titik lokasi maka digunakan lintasan terpendek, selain dapat menempuh jarak terpendek juga dapat menghemat waktu terutama dalam keadaan darurat. Pada penelitian ini digunakan metode Floyd-Warshall untuk melakukan perhitungan lintasan terpendek di Rumah Sakit Umum Daerah (RSUD) Arifin Achmad dan bahasa Pemograman PHP serta MySql sebagai pengelolaan data menjadi informasi. Floyd-Warshall merupakan salah satu algoritma pencarian yang dapat digunakan dalam menghitung lintasan terpendek, dan mampu membandingkan semua kemungkinan lintasan pada graf untuk setiap sisi dari semua simpul yang ada. Data yang diperoleh menunjukkan bahwa RSUD terdiri dari 40 titik dan 50 sisi yang menghubungkan setiap titik. Dalam penelitian ini menghasilkan pencarian lintasan terpendek yang akan di lewati berdasarkan dari titik awal ke titik tujuan, titik yang di lewati berupa nama gedung dan jarak yang dilewati pengunjungRSUD Arifin Achmad. Kata kunci : Lokasi, Graf, Floyd Warshall, PHP, MySql</div>

Download Full-text

PENERAPAN ALGORITMA DIJKSTRA DALAM PENENTUAN LINTASAN TERPENDEK MENUJU UPT. PUSKESMAS CILODONG KOTA DEPOK

JURNAL TEKNIK INFORMATIKA ◽

10.15408/jti.v14i1.18721 ◽

2021 ◽

Vol 14 (1) ◽

pp. 81-92

Author(s):

Cicih Sri Rahayu ◽

Windu Gata ◽

Sri Rahayu ◽

Agus Salim ◽

Arif Budiarto

Keyword(s):

Health Center ◽

Shortest Path ◽

Research Method ◽

Health Centers ◽

Test Results ◽

Dijkstra Algorithm ◽

Final Destination ◽

Shortest Distance ◽

Starting Point ◽

The Government

One of the government's efforts in providing health to the community is the construction of health centers in each sub-district, and the community is expected to be able to take advantage of the health facilities provided by the government. One of the problems that exist in the community is determining the shortest distance to the puskesmas. In Depok City, there are 26 routes that can be passed from the 38 nodes or vertices to the Cilodong Health Center with the starting point of the Depok mayor's office. This study uses a survey research method to calculate the actual distance at each node or vertex, the purpose of this study is to determine the shortest path taken by the starting point from the Depok mayor's office to get to the Cilodong Health Center by applying the dijkstra algorithm. This dijkstra algorithm works by visiting all existing points and making a route if there are 2 routes to the same 1 point then the route that has the lowest weight is chosen so that all points have an optimal route. This quest continues until the final destination point. After doing this research and testing using a simple application to calculate the distance by applying the djikstra algorithm, it was found that the shortest path taken to the destination is through the GDC Main Gate or on the test results in Iteration 26. From the results of this study, people can choose this closest route to save time when viewed from the distance of the existing track. For further research, it is expected to be able to compare two other algorithms and other parameters so that the closest route with the fastest time is obtained.

Download Full-text

TEACHER EDUCATION FOR INCLUSION - THE PREMISES FOR IMPLEMENTING A NEW INITIAL TEACHER TRAINING PROGRAMME / PRIELAIDOS ĮGYVENDINTI NAUJĄ MOKYTOJŲ RENGIMO PROGRAMĄ: INKLIUZINIS UGDYMAS MOKYKLOJE

SPECIALUSIS UGDYMAS / SPECIAL EDUCATION ◽

10.21277/se.v1i35.267 ◽

2017 ◽

Vol 1 (35) ◽

pp. 9

Author(s):

Elena Marin

Keyword(s):

Teacher Training ◽

Inclusive Education ◽

School System ◽

Policy Development ◽

National Level ◽

Training System ◽

Font Size ◽

Initial Teacher Training ◽

Starting Point ◽

Training Programmes

This paper attempts to highlight and examine the Romanian perspective regarding inclusive education by presenting some statistical data and the steps that have been made in order to make the switch from a school system lead by the segregation principle to a school system based on inclusive principles. Moreover, the attention focuses on schools` key actors, the teacher, more specifically on the initial teachers training programmes available in Romania. The starting point when it come to the initial teacher training programmes is based on the assumption that there is an acute need for training when it comes to the implementation of an inclusive educational system in Romania. Using a qualitative approach, we aimed at presenting specialists’ opinion on priority issues in policy development regarding the teacher training in the field of inclusive education, focusing on the premises for implementing a training system that is mandatory for every teacher in the inclusive education and on the aspects that relate to the rethinking of the teacher’s training process at a national level. Straipsnyje bandoma analizuoti inkliuzinio ugdymo diegimą Rumunijoje: pateikiama statistinių duomenų ir aprašoma, kokių veiksmų buvo imtasi pereinant nuo segregacijos principu pagrįstos ugdymo sistemos mokykloje prie inkliuzijos principais grindžiamos sistemos. Dėmesys kreipiamas į mokytojus ir mokytojų pirminio rengimo programas. Mokytojų pirminis rengimas Rumunijoje remiasi prielaida, kad, siekiant įdiegti inkliuzinio ugdymo sistemą, tokių mokytojų rengimo poreikis yra labai didelis. Kokybiniu tyrimu buvo siekiama pateikti specialistų nuomonę dėl inkliuzinio ugdymo mokytojų rengimo politikos prioritetų, atkreipiamas dėmesys į tokių specialistų rengimo, privalomo kiekvienam inkliuzinį ugdymą taikančiam mokytojui, sistemos įdiegimo sąlygas ir aspektus, susijusius su mokytojų rengimo proceso reformavimu nacionaliniu lygmeniu.

Download Full-text

Predicting Auditor Changes Using Financial Distress Variables And The Multiple Criteria Linear Programming (MCLP) And Other Data Mining Approaches

Journal of Applied Business Research (JABR) ◽

10.19030/jabr.v27i5.5597 ◽

2011 ◽

Vol 27 (5) ◽

pp. 73 ◽

Cited By ~ 2

Author(s):

Wikil Kwak ◽

Susan Eldridge ◽

Yong Shi ◽

Gang Kou

Keyword(s):

Data Mining ◽

Linear Programming ◽

Financial Distress ◽

Multiple Criteria ◽

Financial Statement ◽

Font Size ◽

Explanatory Variables ◽

Data Mining Approach ◽

Starting Point ◽

Accuracy Rates

<h1 style="margin: 0in 0.5in 0pt; text-align: justify; page-break-after: auto; mso-pagination: none;">Our study evaluates a multiple criteria linear programming (MCLP) and other data mining approaches to predict auditor changes using a portfolio of financial statement measures to capture financial distress. The results of the MCLP approach and the other data mining approaches show that these methods perform reasonably well to predict auditor changes using financial distress variables. Overall accuracy rates are more than 60 percent, and true positive rates exceed 80 percent. Our study is designed to establish a starting point for auditor-change prediction using financial distress variables. Further research should incorporate additional explanatory variables and a longer study period to improve prediction rates.</h1>

Download Full-text

Towards Autonomous Robot Operation: Path Map Generation of an Unknown Area by a New Trapezoidal Approximation Method Using a Self Guided Vehicle and Shortest Path Calculation by a Proposed SRS Algorithm

PRICAI 2008: Trends in Artificial Intelligence - Lecture Notes in Computer Science ◽

10.1007/978-3-540-89197-0_54 ◽

2008 ◽

pp. 593-602 ◽

Cited By ~ 1

Author(s):

K. Ahmed ◽

M. S. Munir ◽

A. S. M Shihavuddin ◽

M. A. Hoque ◽

K. K. Islam

Keyword(s):

Shortest Path ◽

Approximation Method ◽

Autonomous Robot ◽

Map Generation ◽

Unknown Area ◽

Path Calculation

Download Full-text

eDAR Algorithm for Continuous KNN Queries Based on Pine

Agent Technologies and Web Engineering ◽

10.4018/978-1-60566-618-1.ch009 ◽

2011 ◽

pp. 154-174

Author(s):

Maytham Safar ◽

Dariush Ebrahimi

Keyword(s):

Shortest Path ◽

Nearest Neighbor ◽

Query Point ◽

Spatial Network ◽

K Nearest Neighbor ◽

Network Expansion ◽

Shortest Distance ◽

Stationary Objects ◽

Split Point ◽

Euclidean Distances

The continuous K nearest neighbor (CKNN) query is an important type of query that finds continuously the KNN to a query point on a given path. We focus on moving queries issued on stationary objects in Spatial Network Database (SNDB) The result of this type of query is a set of intervals (defined by split points) and their corresponding KNNs. This means that the KNN of an object traveling on one interval of the path remains the same all through that interval, until it reaches a split point where its KNNs change. Existing methods for CKNN are based on Euclidean distances. In this paper we propose a new algorithm for answering CKNN in SNDB where the important measure for the shortest path is network distances rather than Euclidean distances. We propose DAR and eDAR algorithms to address CKNN queries based on the progressive incremental network expansion (PINE) technique. Our experiments show that the eDAR approach has better response time, and requires fewer shortest distance computations and KNN queries than approaches that are based on VN3 using IE.

Download Full-text

Shortest Path Calculation: A Comparative Study for Location-Based Recommender System

2016 World Symposium on Computer Applications & Research (WSCAR) ◽

10.1109/wscar.2016.16 ◽

2016 ◽

Cited By ~ 10

Author(s):

Hagar Mahmoud ◽

Nadine Akkari

Keyword(s):

Comparative Study ◽

Shortest Path ◽

Recommender System ◽

Path Calculation

Download Full-text

Routing Optimization Algorithms Based on Node Compression in Big Data Environment

Scientific Programming ◽

10.1155/2017/2056501 ◽

2017 ◽

Vol 2017 ◽

pp. 1-7

Author(s):

Lifeng Yang ◽

Liangming Chen ◽

Ningwei Wang ◽

Zhifang Liao

Keyword(s):

Big Data ◽

Shortest Path ◽

Optimization Algorithms ◽

Real Life ◽

Large Data ◽

Path Selection ◽

Shortest Path Problem ◽

Limited Time ◽

Starting Point ◽

Data Environment

Shortest path problem has been a classic issue. Even more so difficulties remain involving large data environment. Current research on shortest path problem mainly focuses on seeking the shortest path from a starting point to the destination, with both vertices already given; but the researches of shortest path on a limited time and limited nodes passing through are few, yet such problem could not be more common in real life. In this paper we propose several time-dependent optimization algorithms for this problem. In regard to traditional backtracking and different node compression methods, we first propose an improved backtracking algorithm for one condition in big data environment and three types of optimization algorithms based on node compression involving large data, in order to realize the path selection from the starting point through a given set of nodes to reach the end within a limited time. Consequently, problems involving different data volume and complexity of network structure can be solved with the appropriate algorithm adopted.

Download Full-text

Satisfaction survey in general hospital personnel involved in blood transfusion: implementation of the ISO 9001: 2000 standard

Transfusion Clinique et Biologique ◽

10.1016/j.tracli.2004.09.001 ◽

2004 ◽

Vol 11 (4) ◽

pp. 177-182 ◽

Cited By ~ 1

Author(s):

S. Chord-Auger ◽

E. Tron de Bouchony ◽

M.C. Moll ◽

D. Boudart ◽

G. Folléa

Keyword(s):

Blood Transfusion ◽

General Hospital ◽

Iso 9001 ◽

Satisfaction Survey ◽

Hospital Personnel

Download Full-text

Attitudes of American and Nigerian Psychiatric and General Hospital Personnel toward Older Persons

The Journal of Social Psychology ◽

10.1080/00224545.1985.9922907 ◽

1985 ◽

Vol 125 (3) ◽

pp. 403-404

Author(s):

Ona A. Pela

Keyword(s):

General Hospital ◽

Older Persons ◽

Hospital Personnel

Download Full-text

Identifying and Grouping Abnormalities in Medical Images using Shortest Path Algorithms

International Journal of Engineering and Advanced Technology - Regular Issue ◽

10.35940/ijeat.b4960.129219 ◽

2019 ◽

Vol 9 (2) ◽

pp. 4908-4913

Keyword(s):

Ct Scan ◽

Hierarchical Clustering ◽

Shortest Path ◽

Medical Images ◽

Shortest Path Algorithms ◽

Path Calculation

The majority of the patient conclusion rotates around in distinguishing variations from the norm in their particular restorative pictures. These pictures are of different kinds, likely Ultrasound, CT Scan, MRI and infinitesimal pictures like bio-synthetic slides, smaller scale organic slides and neurotic slides. Barely any irregularities are cracks, awful cells in blood, tumors, contagious recognizable proof and so on. Finding the unusual segments, abnormalities in these pictures needs aptitude by the doctor; this adept recognizable proof advances and ensures sound drug by the doctor or specialist to persistent. In medicinal infinitesimal pictures ordinary bits and strange segments are combined. None of the irregular segments are identified with strange and typical parts of picture for example deviations are dissipated among ordinary bits of picture. These deviations are absent in certain bits for explicit region in the pictures. None of these deviations are covered nor can be gathered into a solitary segment physically in the picture. Deviations can be segregated alongside typical segments of pictures. Recognizing such deviations incompletely goes under bunching. This venture recognizes deviations in Medical Microscopic pictures. These deviations can be distinguished outwardly which uncovers about the nearness of deviation however to know the level of deviation in an example picture is basic. So as to accomplish this all deviations must be associated. This task interfaces all deviations utilizing Shortest Path calculation and bunches utilizing Hierarchical Clustering calculations.

Download Full-text