Junairiah Junairiah, T. Nurhariyati, Listijani Suhargo
{"title":"INNOVATION OF MEDICINE PLANTS PROPAGATION WITH VERTICULTURE TECHNIQUES IN EFFORTS TO OVERCOME LAND DYSFUNCTIONAL IN EAST SURABAYA AREA","authors":"Junairiah Junairiah, T. Nurhariyati, Listijani Suhargo","doi":"10.20473/DC.V2.I2.2020.58-61","DOIUrl":"https://doi.org/10.20473/DC.V2.I2.2020.58-61","url":null,"abstract":"Background: Keputih Village is located in eastern Surabaya. The boundary of this village is the river. Areas on the river banks are overgrown with wild plants and poorly maintained. One way to overcome the dysfunctional land around the river is by cultivating medicinal plants with verticulture techniques. Purpose: The implementation of this program is to overcome the dysfunctional land around the Keputih Village’s river by cultivating medicinal plants in verticulture techniques and provide training in the manufacture of herbal products from the cultivation of medicinal plants and provide financial management training to the local residents. Methods: This activity was carried out in 4 stages. Phase I was training in making pots and verticulture shelves as well as planting medicinal plants, Phase II was mentoring in the field, Phase III was training on making herbal products from plants and training on simple bookkeeping, Phase IV was product display. Results: Based on the results of this training showed that the knowledge of the participants related to the training material has increased which shown from the results of the posttest with average of 79,31 and product display. Conclusion: In this activity, beside gaining knowledge, participants can apply this knowledge to increase family income.","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"2 1","pages":"58-61"},"PeriodicalIF":1.3,"publicationDate":"2021-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48392982","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"ENHANCEMENT OF DIGITAL BASED BATIK CRAFT PRODUCTS IN KEREK DISTRICT, TUBAN DISTRICT","authors":"R. A. Prasetyo, S. Ariadi, Udji Asiyah","doi":"10.20473/DC.V2.I2.2020.62-65","DOIUrl":"https://doi.org/10.20473/DC.V2.I2.2020.62-65","url":null,"abstract":"Background: Gedog batik weaving in Kerek District to become one of the regional superior products that started local development. The MEA era and the industrial revolution 4.0 provide challenges for these creative economies to survive amid increasingly fierce global competition. One of them is by comparison with the shift of consumer tastes. UMKM are those who become Gedog batik weavers who do not understand customer satisfaction at present, which emphasizes the value of goods purchased according to the value used first. UMKM also specializes in mastering digital technology as a marketing medium. Purpose: For this reason, community adoption activities for training and mentoring for batik UMKM participants in making branding to respond to customer convenience and increasing marketing of digital-based products for solutions that support partnerships. Methods: Community service methods are carried out by providing training and practicum on product branding and digital-based marketing for business entrepreneurs or batik artisans. Results: The result of these activity participants who initially did not understand the transition of consumers became aware of the need to do the branding of a digital-based product and marketing. Conclusion: Partners get increased knowledge and skills in digital-based batik marketing to respond to shifting consumer tastes.","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"2 1","pages":"62-65"},"PeriodicalIF":1.3,"publicationDate":"2021-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45525311","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
N. K. Putri, Diansanto Prayoga, Syifa'ul Lailiyah, Ernawaty Ernawaty
{"title":"STUDENT-COMMUNITY PARTNERSHIP IN IMPROVING HEALTH LITERACY TOWARD NATIONAL HEALTH INSURANCE","authors":"N. K. Putri, Diansanto Prayoga, Syifa'ul Lailiyah, Ernawaty Ernawaty","doi":"10.20473/DC.V2.I2.2020.70-75","DOIUrl":"https://doi.org/10.20473/DC.V2.I2.2020.70-75","url":null,"abstract":"Background: As of December 2018, BPJS Kesehatan has received application from 4,909 people to be registered as non-contribution assistance beneficiary (PBPU) through Gandrung JKN. Number of people to be registered to BPJS as non-contribution assistance beneficiary (PBPU) tends to fluctuate every month and tends to be stagnant in several districts, including in Licin Subdistrict. Most of people in Licin Subdistrict also not familiar with Gandrung JKN program. Objective: This student-community partnership is carried out to minimize the gap in community knowledge about what JKN is and the procedure to be registered in JKN scheme. Method: The role of students in the effort to introduce and register the community in JKN was designed by bringing the community closer to the Banyuwangi Gandrung Program. This community service consists of three stages, including activities in provisioning the students and health cadres about JKN and Gandrung JKN, direct socialization by students in the Licin subdistrict community, and efforts to provide closer access of community to BPJS Kesehatan. Results: The debriefing in the first stage was given directly by the Banyuwangi Branch BPJS Kesehatan to increase students' knowledge of JKN. Students then successfully carried out direct socialization to the Licin subdistrict community. Three villages were successfully accompanied and performed a high level of participation in the socialization session. Community service has also succeeded in bringing people closer to BPJS Kesehatan. Conclusion: The information conveyed in this activity was well received by the community because it was tailor-made according to the information needed by each family. Student assistance sharpens students' ability to communicate and understand JKN. Although the assistance succeeded in increasing the community's knowledge, in the short term it did not significantly increase the desire to register to become a JKN participant.","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"2 1","pages":"70-75"},"PeriodicalIF":1.3,"publicationDate":"2021-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44908857","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Varsha Dani, Aayush Gupta, Thomas P. Hayes, S. Pettie
{"title":"Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks","authors":"Varsha Dani, Aayush Gupta, Thomas P. Hayes, S. Pettie","doi":"10.1007/s00446-022-00426-w","DOIUrl":"https://doi.org/10.1007/s00446-022-00426-w","url":null,"abstract":"","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"36 1","pages":"373 - 384"},"PeriodicalIF":1.3,"publicationDate":"2021-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45799846","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Broadcast and minimum spanning tree with o(m) messages in the asynchronous CONGEST model","authors":"A. Mashreghi, Valerie King","doi":"10.1007/s00446-020-00387-y","DOIUrl":"https://doi.org/10.1007/s00446-020-00387-y","url":null,"abstract":"","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"34 1","pages":"283 - 299"},"PeriodicalIF":1.3,"publicationDate":"2021-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00446-020-00387-y","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47814697","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"OPTIMASI PEMBAGIAN TUGAS KARYAWAN PADA BENGKEL INDOMOBIL NISSAN DATSUN KOMBOS DENGAN MENGGUNAKAN METODE HUNGARIAN","authors":"Dewi Permata Sari, M. Paendong, Y. Langi","doi":"10.35799/DC.9.2.2020.29186","DOIUrl":"https://doi.org/10.35799/DC.9.2.2020.29186","url":null,"abstract":"Sumber Daya Manusia adalah salah satu faktor yang sangat penting bahkan tidak dapat dilepaskan dari sebuah organisasi, institusi maupun perusahaan. Sumber Daya Manusia juga merupakan usaha yang dituntut kemampuannya dalam meningkatkan efisiensi dan mengefektifkan penggunaannya sehingga Sumber Daya Manusia merupakan kunci yang menentukan berkembangnya suatu perusahaan. Dalam Bengkel Indomobil Nissan Datsun Kombos, jenis pekerjaan yang dilakukan oleh karyawan berbeda-beda dikarenakan tingkat kemahiran atau produktifitasnya. Tujuan penelitian untuk mengetahui pembagian tugas karyawan pada Bengkel Indomobil Nissan Datsun Kombos sehingga mendapat waktu kerja yang optimal. Metode Hungarian dapat digunakan untuk mengetahui pembagian tugas karyawan sehingga mendapat waktu kerja yang optimal. Hasil pembagian tugas karyawan yang diperoleh dengan metode Hungarian jika dibandingkan dengan penempatan karyawan sebelumnya menunjukkan adanya efisiensi waktu sebanyak 191.4 menit per setiap 5 pekerja melakukan 5 pekerjaan. ","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"9 1","pages":"168"},"PeriodicalIF":1.3,"publicationDate":"2021-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44302294","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Analisis Portofolio Saham Model Mean – Variance Markowitz Menggunakan Metode Lagrange","authors":"I. N. W. Negara, Yohanes Langi, Tohap Manurung","doi":"10.35799/DC.9.2.2020.29656","DOIUrl":"https://doi.org/10.35799/DC.9.2.2020.29656","url":null,"abstract":"Investasi merupakan suatu bentuk penanaman modal baik yang dilakukan secara langsung maupun tidak langsung dalam jangka waktu tertentu dengan tujuan suatu saat akan mendapatkan keuntungan dari investasi tersebut. Investasi juga dapat dikatakan sebagai penundaan konsumsi masa kini untuk dimasukkan kedalam aset yang produktif selama periode waktu tertentu [1]. Dalam berinvestasi, investor pasti akan berusaha untuk meminimalisir segara risiko yang ada demi keberlangsungan investasi yang dijalankannya, baik investasi yang berjangka pendek maupun investasi jangka panjang. Dalam pasar modal, investor yang dapat berpikir logis pasti akan memilih saham yang efisien saat akan menanamkan modalnya. Saham efisien yang dimaksud adalah saham yang memberikan return maksimal pada risiko tertentu atau risiko minimum dengan return tertentu [2]. Saham efisien yang dimaksud adalah saham yang memberikan return maksimal pada risiko tertentu atau risiko minimum dengan return tertentu [2]. Harry Markowitz pernah mengemukakan bahwa untuk meminimalisir risiko dan tetap mendapatkan return yang besar dapat dilakukan dengan membentuk portofolio. Model portofolio yang menekankan pada hubungan antara return dan risiko portofolionya d’CartesiaN","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"9 1","pages":"173"},"PeriodicalIF":1.3,"publicationDate":"2021-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42313894","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Penerapan Analisis Multidimensional Scaling dalam Pemilihan Jalur Destinasi Wisata di Kabupaten Bolaang Mongondow Area Kecamatan Lolak dan Sekitarnya","authors":"Febrina Drike Simatupang, Hanny Komalig, Tohap Manurung","doi":"10.35799/DC.9.2.2020.29164","DOIUrl":"https://doi.org/10.35799/DC.9.2.2020.29164","url":null,"abstract":"Received : 12 July 2020 Received after revision : 29 August 2020 Available online : 6 January 2021","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"9 1","pages":"164"},"PeriodicalIF":1.3,"publicationDate":"2021-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47499739","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Fernando Yosua Solar, Jullia Titaley, Altien J. Rindengan
{"title":"Penerapan Geometri Fraktal Dalam Membuat Variasi Motif Batik Nusantara Berbasis Julia Set","authors":"Fernando Yosua Solar, Jullia Titaley, Altien J. Rindengan","doi":"10.35799/DC.9.2.2020.29968","DOIUrl":"https://doi.org/10.35799/DC.9.2.2020.29968","url":null,"abstract":"Diterima : 7 August 2020 Diterima setelah revisi : 31 August 2020 Tersedia online : 6 January 2021","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"9 1","pages":"189"},"PeriodicalIF":1.3,"publicationDate":"2021-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45876761","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Yohana Permata Hutapea, C. Montolalu, Hanny A. H. Komalig
{"title":"Dijkstra Algorithm for Determining the Shortest Path in the Case of Seven Hotels in Manado City Towards Manado’s Sam Ratulangi Airport.","authors":"Yohana Permata Hutapea, C. Montolalu, Hanny A. H. Komalig","doi":"10.35799/DC.9.2.2020.29146","DOIUrl":"https://doi.org/10.35799/DC.9.2.2020.29146","url":null,"abstract":"Manado city has many notable tourist sites, resulting in the increase of the number of tourists visiting every year. Tourists require hotels with adequate facilities for their stay, such as 4-star hotels. After visiting Manado, tourists go back to where they come from. One of the transportation mode being used is airplanes. They then need a path to go through and not the usual one; they need the shortest path to get to Sam Ratulangi airport. Based on previous research, the shortest path is modeled by Graph Theory. Hotels will be represented as vertices, and the path from each hotels and to the airport will be represented as edges. The shortest path are searched by using Dijkstra’s Algorithm then will see the difference to shortest path from google maps. Based on the analysis results, Dijkstra’s Algorithm selects the shortest path with the smallest weight. The difference between Dijkstra’s Algorithm and google maps can be concluded that, in determining the shortest path used for the trip from the 4-star hotel to the airport, Dijkstra’s Algorithm is emphasized towards short travel distance, whereas google maps is emphasized more in short travel time.","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"9 1","pages":"158"},"PeriodicalIF":1.3,"publicationDate":"2021-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44033723","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}