首页 > 最新文献

JEJARING : Jurnal Teknologi dan Manajemen Informatika最新文献

英文 中文
The Application of Searching Closest Distance (Travelling Salesmen Problem) Using Ant Colony Optimizatiton Algorithm (ACO) (A Case Study: PT. Nusantara Abadi) 蚁群优化算法(ACO)在搜索最近距离(旅行推销员问题)中的应用(以PT. Nusantara Abadi为例)
Pub Date : 2022-05-06 DOI: 10.25134/jejaring.v7i1.6743
Panji Novantara, Usep Sapari Septiana
Traveling from one place or city to another by considering the efficiency of time and costs requires accuracy in determining the path between the nearby cities. The results need speed and accuracy by using computers. Additionally the service application system is very supportive towards the mobility of users. This condition also happens in the distribution of mineral water. PT. Abadi Nusantara produces several sizes Nalala drinking water circulating in the community, including 19 liter gallon of bottled water, bottled water 500 milliliter, and bottled water 250 milliliter glass. The courier distributors that send the goods, have to consider the time and cost efficiencies when they conduct distribution activities, then sought the shortest distance from their distribution journey. There are various theories of algorithms that can be used to solve the problems of goods distribution or it is often called Travelling Salesmen Problem (TSP), such as brute force algorithm, greedy algorithm, ant colony algorithm, Djikstra, A *, etc. In this thesis, the author chooses one of the algorithms, it is ant colony algorithm to solve the problem of distribution.Keywords : Searching Closest Distance, Traveling Salesman Problem, Ant Colony Optimization Algorithm.
考虑到时间和成本的效率,从一个地方或城市旅行到另一个地方或城市需要准确地确定附近城市之间的路径。使用计算机计算结果需要速度和准确性。此外,服务应用系统非常支持用户的移动性。这种情况也发生在矿泉水的分布中。PT. Abadi Nusantara生产几种规格的纳拉拉饮用水,在社区循环使用,包括19升加仑的瓶装水,500毫升的瓶装水和250毫升的瓶装水。快递商在进行配送活动时,必须考虑时间和成本效益,然后在配送过程中寻求最短的距离。有各种各样的算法理论可以用来解决货物分配问题,或者通常被称为旅行推销员问题(TSP),如蛮力算法,贪婪算法,蚁群算法,Djikstra, A *等。在本文中,作者选择了其中的一种算法,即蚁群算法来解决分配问题。关键词:最近距离搜索,旅行商问题,蚁群优化算法。
{"title":"The Application of Searching Closest Distance (Travelling Salesmen Problem) Using Ant Colony Optimizatiton Algorithm (ACO) (A Case Study: PT. Nusantara Abadi)","authors":"Panji Novantara, Usep Sapari Septiana","doi":"10.25134/jejaring.v7i1.6743","DOIUrl":"https://doi.org/10.25134/jejaring.v7i1.6743","url":null,"abstract":"Traveling from one place or city to another by considering the efficiency of time and costs requires accuracy in determining the path between the nearby cities. The results need speed and accuracy by using computers. Additionally the service application system is very supportive towards the mobility of users. This condition also happens in the distribution of mineral water. PT. Abadi Nusantara produces several sizes Nalala drinking water circulating in the community, including 19 liter gallon of bottled water, bottled water 500 milliliter, and bottled water 250 milliliter glass. The courier distributors that send the goods, have to consider the time and cost efficiencies when they conduct distribution activities, then sought the shortest distance from their distribution journey. There are various theories of algorithms that can be used to solve the problems of goods distribution or it is often called Travelling Salesmen Problem (TSP), such as brute force algorithm, greedy algorithm, ant colony algorithm, Djikstra, A *, etc. In this thesis, the author chooses one of the algorithms, it is ant colony algorithm to solve the problem of distribution.Keywords : Searching Closest Distance, Traveling Salesman Problem, Ant Colony Optimization Algorithm.","PeriodicalId":265714,"journal":{"name":"JEJARING : Jurnal Teknologi dan Manajemen Informatika","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123976255","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Penerapan Customer Relationship Management Analitycal Menggunakan Query analyzer pada penjualan berbasis Online
Pub Date : 2022-05-03 DOI: 10.25134/jejaring.v7i1.6746
Dede Irawan, Putri Maulin Merdekawati
Kehadiran teknologi berbasis komputer diberbagai bidang sangat banyak memberikan kemudahan yang berarti. Sehingga setiap kegiatan yang berhubungan dengan jalannya usaha akan lebih cepat dan tepat. OutVin Store merupakan toko online yang menjual segala jenis fashion wanita yang penjulannya masih melalui aplikasi BBM sehingga pembelian dan penjualan terbatas serta penyimpanan data yang masih manual menuntut untuk dirancang dan dibuatkan toko online berbasis website dan penyimpanan data yang terkomputerisasi. Oleh karena itu diperlukan suatu sistem komputerisasi yang dapat menanggulangi proses penjualan dan pembelian serta penyimpanan data sehingga penjualan dan pembelian bisa mencakup wilayah yang lebih luas serta data lebih aman. Maka digunakan metode customer relationship management yaitu manajemen hubungan pelanggan yang mengatur dan mencari cara bagaimana agar bisa memuaskan konsumen sehingga konsumen lebih luas dan menerapkannya ke website yang bisa membuat proses jual beli lebih luas. Sistem dirancang dengan menggunakan diagam konteks, flowmap, DFD level 0, DFD level 1 dan ERD. Sistem ini mengelola data barang, data jual beli, dan data konsumen. Di dalam sistem, CRM Analitycal diterapkan dalam laporan order, lapoan fashion mana yang paling banyak dibeli, laporan wilayah yang paling banyak melakukan transaksi dan laporan konsumen mana saja yang paling banyak melakukan transaksi. Hasil perancangan diimplementasikan ke dalam bahasa pemrograman PHP dan MySQL. Sistem ini dapat memudahkan konsumen untuk berbelanja barang-barang di OutVin Store serta memudahkan pemiliknya untuk menyimpan dan mengolah data-data yang ada.Kata kunci : Customer Relationship Management, Customer Relationship Management Analatycal Teknologi, Penerapan, Manajemen Hubungan Pelanggan, Sistem Informasi.
以计算机为基础的技术在许多领域的存在提供了许多有意义的便利。因此,任何与业务相关的活动都将更快、更准确。OutVin Store是一个在线商店,它销售所有类型的女性时尚,这些女性的时尚仍然是通过燃料应用程序进行的,因此有限的购买和销售和手动存储数据要求设计和建立基于网站的在线商店和计算机数据存储。因此,需要计算机系统来处理销售、购买和存储数据的过程,以便销售和购买能够覆盖更大的区域和更安全的数据。这就是管理客户关系的方法,即管理客户关系管理,并寻求如何满足更广泛的消费者,并将其应用到一个可以使交易更广泛的网站上。系统的设计使用上下文,flowmap, DFD级0,DFD级1和ERD。它管理商品数据、买卖数据和消费者数据。在系统中,CRM分析应用于最广泛购买的时尚报告、交易最多的地区报告和交易最多的消费者报告。设计结果应用于PHP和MySQL编程语言。这一系统使消费者更容易在OutVin商店购买商品,也使所有者更容易存储和处理现有数据。关键词:客户关系管理,客户关系管理技术,应用,客户关系管理,信息系统。
{"title":"Penerapan Customer Relationship Management Analitycal Menggunakan Query analyzer pada penjualan berbasis Online","authors":"Dede Irawan, Putri Maulin Merdekawati","doi":"10.25134/jejaring.v7i1.6746","DOIUrl":"https://doi.org/10.25134/jejaring.v7i1.6746","url":null,"abstract":"Kehadiran teknologi berbasis komputer diberbagai bidang sangat banyak memberikan kemudahan yang berarti. Sehingga setiap kegiatan yang berhubungan dengan jalannya usaha akan lebih cepat dan tepat. OutVin Store merupakan toko online yang menjual segala jenis fashion wanita yang penjulannya masih melalui aplikasi BBM sehingga pembelian dan penjualan terbatas serta penyimpanan data yang masih manual menuntut untuk dirancang dan dibuatkan toko online berbasis website dan penyimpanan data yang terkomputerisasi. Oleh karena itu diperlukan suatu sistem komputerisasi yang dapat menanggulangi proses penjualan dan pembelian serta penyimpanan data sehingga penjualan dan pembelian bisa mencakup wilayah yang lebih luas serta data lebih aman. Maka digunakan metode customer relationship management yaitu manajemen hubungan pelanggan yang mengatur dan mencari cara bagaimana agar bisa memuaskan konsumen sehingga konsumen lebih luas dan menerapkannya ke website yang bisa membuat proses jual beli lebih luas. Sistem dirancang dengan menggunakan diagam konteks, flowmap, DFD level 0, DFD level 1 dan ERD. Sistem ini mengelola data barang, data jual beli, dan data konsumen. Di dalam sistem, CRM Analitycal diterapkan dalam laporan order, lapoan fashion mana yang paling banyak dibeli, laporan wilayah yang paling banyak melakukan transaksi dan laporan konsumen mana saja yang paling banyak melakukan transaksi. Hasil perancangan diimplementasikan ke dalam bahasa pemrograman PHP dan MySQL. Sistem ini dapat memudahkan konsumen untuk berbelanja barang-barang di OutVin Store serta memudahkan pemiliknya untuk menyimpan dan mengolah data-data yang ada.Kata kunci : Customer Relationship Management, Customer Relationship Management Analatycal Teknologi, Penerapan, Manajemen Hubungan Pelanggan, Sistem Informasi.","PeriodicalId":265714,"journal":{"name":"JEJARING : Jurnal Teknologi dan Manajemen Informatika","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115971494","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Aplikasi Perhitungan Biaya Pembuatan Bangunan Rumah Tinggal Pada CV. SANCITA 简历中的住宅成本计算应用。SANCITA
Pub Date : 2022-05-03 DOI: 10.25134/jejaring.v7i1.6747
Aji Permana, Heri Herwanto
Indonesia is a developing country with a large number of its Population and its fast growth each year. Therefore the needs of Houses and other public facility will simultaneously increase and become the most important needs. In addition, there are still a lot of Indonesian people that still can afford a decent place to live.The calculation of the budget plan (RAB) is needed both for its own architects and consumers who will build a place to live. With so architects can estimate the required budget plan in accordance with the type of House desired by consumers. Often in the execution of a job became inefficient, both in the use of labor and raw materials due to lack of preparation of the draft budget calculations of cost to make the dwelling. Thus we need to plan and determine the budget very carefully, to avoid wasteful expense, or even lack of funds. Key Words : The calculation of the budget plan (RAB)
印度尼西亚是一个发展中国家,人口众多,每年都在快速增长。因此,住宅和其他公共设施的需求将同时增加,并成为最重要的需求。此外,仍然有很多印尼人能够负担得起体面的住所。预算计划(RAB)的计算既需要自己的建筑师,也需要建造一个居住的地方的消费者。因此,建筑师可以根据消费者所需的房屋类型估算所需的预算计划。往往在一项工作的执行中变得效率低下,无论是在劳动力的使用上还是在原材料的使用上都由于编制预算草案的不足而无法计算出制作住宅的成本。因此,我们需要非常仔细地计划和确定预算,以避免浪费费用,甚至缺乏资金。关键词:预算方案的计算(RAB)
{"title":"Aplikasi Perhitungan Biaya Pembuatan Bangunan Rumah Tinggal Pada CV. SANCITA","authors":"Aji Permana, Heri Herwanto","doi":"10.25134/jejaring.v7i1.6747","DOIUrl":"https://doi.org/10.25134/jejaring.v7i1.6747","url":null,"abstract":"Indonesia is a developing country with a large number of its Population and its fast growth each year. Therefore the needs of Houses and other public facility will simultaneously increase and become the most important needs. In addition, there are still a lot of Indonesian people that still can afford a decent place to live.The calculation of the budget plan (RAB) is needed both for its own architects and consumers who will build a place to live. With so architects can estimate the required budget plan in accordance with the type of House desired by consumers. Often in the execution of a job became inefficient, both in the use of labor and raw materials due to lack of preparation of the draft budget calculations of cost to make the dwelling. Thus we need to plan and determine the budget very carefully, to avoid wasteful expense, or even lack of funds. Key Words : The calculation of the budget plan (RAB)","PeriodicalId":265714,"journal":{"name":"JEJARING : Jurnal Teknologi dan Manajemen Informatika","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124940215","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Implementasi Algoritma Floyd-Warshall pada Sistem Informasi Geografis Kampus UNIKU Berbasis Android Studi Kasus : (Universitas Kuningan)) 基于Android案例研究的UNIKU校园地理信息系统的部署算法:(一所黄铜大学)
Pub Date : 2021-11-03 DOI: 10.25134/jejaring.v6i2.6741
Nunu Nugraha, Desy Wulandari
Kebutuhan akan informasi mengenai lokasi kampus Universitas Kuningan menuntut ketersediaan sistem informasi geografis yang informatif serta memberi kemudahan bagi setiap orang yang membutuhkan informasi untuk menuju lokasi kampus Universitas Kuningan. Algoritma Floyd Warshall adalah salah satu yang sederhana dan mudah implementasinya. Algoritma tersebut memulai iterasi dari titik awalnya kemudian memperpanjang path atau jalur lintasan dengan mengevaluasi titik demi titik hingga mencapai titik tujuan dengan jumlah bobot yang seminimum mungkin. Pada penelitian ini, penulis melakukan suatu penerapan algoritma Floyd Warshal pada penentuan jalur terpendek dengan menggunakan graf berbobot untuk menghasilkan jalur terpendek menuju kampus Universitas Kuningan berdasarkan lokasi asal pengguna. Perhitungan akan diimplementasikan dengan menghitung bobot terkecil dari titik awal ke titik tujuan. Hasil perhitungan akan diterapkan kedalam perangkat lunak aplikasi dengan mengunakan IDE Eclipse berbasis android mobile sehingga user atau pengguna dapat mengakses aplikasi ini dimana dan kapanpun berada dengan memanfaatkan koneksi internet. Metode pengembangan sistem yang digunakan adalah Rational Unified Process (RUP). Perancangan sistem ini menggunakan perancangan berorientasi objek yaitu dengan metode Unified Modelling Language (UML). Tools perancangan yang digunakan adalah Rational Rose. Hasil penelitian ini berupa aplikasi pencarian rute terpendek menuju kampus Universitas Kuningan sebagai lokasi tujuan berdasarkan lokasi asal pengguna.Kata Kunci : Universitas Kuningan, Sistem Informasi Geografis, Algoritma Floyd Warshall, Jalur Terpendek, IDE Eclipse, UML, Rational Unified Process (RUP), Rational Rose.
对黄铜大学校园校园的信息需求需要提供内容丰富的地理信息系统,并使任何需要这些信息的人更容易进入黄铜大学校园。弗洛伊德•Warshall的算法是最简单、最容易实现的算法之一。该算法从一个起点开始重复,然后通过对一个点进行逐点评估,以尽可能低的重量达到目标点来延长路径或轨迹。在这项研究中,作者将Floyd Warshal的算法应用于根据用户的来源使用格拉夫重量来确定最短路径。计算将通过从起点计算到目的地的最小质量来实现。计算结果将应用到应用程序软件中,使用基于android移动的创意,使用户或用户能够利用互联网连接,在任何时候、任何时候访问该应用程序。使用的系统开发方法是理性的。该系统的设计采用了一种通用的模式模式(UML)。使用的设计工具是理性玫瑰。这项研究的结果是,根据用户的原产地,搜索通往库隆大学校园最短路线的应用程序。关键词:brass university,地理信息系统,Floyd Warshall算法,最短路径,Eclipse, UML,理性统一进程,理性Rose。
{"title":"Implementasi Algoritma Floyd-Warshall pada Sistem Informasi Geografis Kampus UNIKU Berbasis Android Studi Kasus : (Universitas Kuningan))","authors":"Nunu Nugraha, Desy Wulandari","doi":"10.25134/jejaring.v6i2.6741","DOIUrl":"https://doi.org/10.25134/jejaring.v6i2.6741","url":null,"abstract":"Kebutuhan akan informasi mengenai lokasi kampus Universitas Kuningan menuntut ketersediaan sistem informasi geografis yang informatif serta memberi kemudahan bagi setiap orang yang membutuhkan informasi untuk menuju lokasi kampus Universitas Kuningan. Algoritma Floyd Warshall adalah salah satu yang sederhana dan mudah implementasinya. Algoritma tersebut memulai iterasi dari titik awalnya kemudian memperpanjang path atau jalur lintasan dengan mengevaluasi titik demi titik hingga mencapai titik tujuan dengan jumlah bobot yang seminimum mungkin. Pada penelitian ini, penulis melakukan suatu penerapan algoritma Floyd Warshal pada penentuan jalur terpendek dengan menggunakan graf berbobot untuk menghasilkan jalur terpendek menuju kampus Universitas Kuningan berdasarkan lokasi asal pengguna. Perhitungan akan diimplementasikan dengan menghitung bobot terkecil dari titik awal ke titik tujuan. Hasil perhitungan akan diterapkan kedalam perangkat lunak aplikasi dengan mengunakan IDE Eclipse berbasis android mobile sehingga user atau pengguna dapat mengakses aplikasi ini dimana dan kapanpun berada dengan memanfaatkan koneksi internet. Metode pengembangan sistem yang digunakan adalah Rational Unified Process (RUP). Perancangan sistem ini menggunakan perancangan berorientasi objek yaitu dengan metode Unified Modelling Language (UML). Tools perancangan yang digunakan adalah Rational Rose. Hasil penelitian ini berupa aplikasi pencarian rute terpendek menuju kampus Universitas Kuningan sebagai lokasi tujuan berdasarkan lokasi asal pengguna.Kata Kunci : Universitas Kuningan, Sistem Informasi Geografis, Algoritma Floyd Warshall, Jalur Terpendek, IDE Eclipse, UML, Rational Unified Process (RUP), Rational Rose.","PeriodicalId":265714,"journal":{"name":"JEJARING : Jurnal Teknologi dan Manajemen Informatika","volume":"224 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129707388","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Implementasi Algoritma Euclides pada Model Pembelajaran Latihan FPB dan KPK Berbasis Android
Pub Date : 2021-11-03 DOI: 10.25134/jejaring.v6i2.6742
Panji Novantara, Anggun Apriani
Hasil Penelitian penulis tentang “Implementasi Algoritma Euclides Pada Model Pembelajaran Latihan FPB Dan KPK Berbasis Android” merupakan alternatif baru yang dapat diterapkan untuk menentukan FPB dan KPK dengan cara yang lebih efektif. Untuk memenuhi alternatif tersebut dirancang sebuah aplikasi yang bisa membantu siswa dalam mencari nilai FPB dan KPK dari sebuah bilangan. Seiring pesatnya perkembangan jaman tekhnologi-tekhnologi diciptakan untuk memenuhi kebutuhan anak-anak salah satunya kebutuhan dalam pembelajaran. Atas dasar inilah aplikasi yang saya rancang sudah bisa digunakan di Smartphone yang kebanyakan masyarakat mulai dari anak kecil, dewasa dan tua sudah menggunakanya, serta minat yang sangat tinggi dari anak-anak terhadap tekhnologi Smartphone menjadi suatu alasan penulis melakukan penelitian ini. Dengan syarat Smartphone tersebut sudah menggunakan System Operasi Android. Dengan harapan aplikasi ini bisa dimanfaatkan dengan baik oleh anak-anak.Kata Kunci : Algoritma Euclides, Aplikasi pembelajaran FPB dan KPK, Android
作者对“以Android为基础的FPB实践学习模式Euclides算法实施”的研究得出的结论是一种新的替代方案,可以用更有效的方式确定FPB和KPK。为了满足替代方案,它设计了一个应用程序,可以帮助学生从数字中查找FPB值和KPK。随着技术技术发展的迅速发展,旨在满足儿童的需求,这是一种学习需求。在此基础上,我设计的应用程序可以在智能手机上使用,这是大多数社会使用的手机,儿童对智能手机技术的巨大兴趣,也是作者进行这项研究的原因。智能手机只需要使用Android操作系统。希望孩子们能很好地利用这个应用。关键词:Euclides算法,FPB学习应用程序和KPK, Android
{"title":"Implementasi Algoritma Euclides pada Model Pembelajaran Latihan FPB dan KPK Berbasis Android","authors":"Panji Novantara, Anggun Apriani","doi":"10.25134/jejaring.v6i2.6742","DOIUrl":"https://doi.org/10.25134/jejaring.v6i2.6742","url":null,"abstract":"Hasil Penelitian penulis tentang “Implementasi Algoritma Euclides Pada Model Pembelajaran Latihan FPB Dan KPK Berbasis Android” merupakan alternatif baru yang dapat diterapkan untuk menentukan FPB dan KPK dengan cara yang lebih efektif. Untuk memenuhi alternatif tersebut dirancang sebuah aplikasi yang bisa membantu siswa dalam mencari nilai FPB dan KPK dari sebuah bilangan. Seiring pesatnya perkembangan jaman tekhnologi-tekhnologi diciptakan untuk memenuhi kebutuhan anak-anak salah satunya kebutuhan dalam pembelajaran. Atas dasar inilah aplikasi yang saya rancang sudah bisa digunakan di Smartphone yang kebanyakan masyarakat mulai dari anak kecil, dewasa dan tua sudah menggunakanya, serta minat yang sangat tinggi dari anak-anak terhadap tekhnologi Smartphone menjadi suatu alasan penulis melakukan penelitian ini. Dengan syarat Smartphone tersebut sudah menggunakan System Operasi Android. Dengan harapan aplikasi ini bisa dimanfaatkan dengan baik oleh anak-anak.Kata Kunci : Algoritma Euclides, Aplikasi pembelajaran FPB dan KPK, Android","PeriodicalId":265714,"journal":{"name":"JEJARING : Jurnal Teknologi dan Manajemen Informatika","volume":"119 9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116477565","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Implementasi Algoritma Genetika pada Tata Ruang Ibukota Kecamatan (Studi Kasus : Desa Hantara)
Pub Date : 2021-11-03 DOI: 10.25134/jejaring.v6i2.6739
Dadan Nugraha, I. Lesmana, Gian Megantara
Spatial planning is an obligation that must be carried out by each Regional Government. At present, spatial planning is still conventionally planned by the spatial planning company. Regarding with the object of research that the authors examined, namely Hantara Village, Hantara Village did not yet have a plan for how the future projection and development of Hantara Village. With a touch of information technology, for now spatial planning can be done using an application by implementing a method that is Genetic Algorithm into the application .Genetic Algorithm is an optimal search algorithm which is in its implementation the genetic algorithm will look for the most optimal points which is match with the constraints that have been determined based on law 26 of 2007 concerning Spatial Planning. Then the search results of the genetic algorithm data will be visualized by using the features of the mapbox, the online map provider. In software development, the author use the Rational Unified Process (RUP) method which has four stages, namely: Inception, Elaboration, Contruction, and Transition. This application is built use the python programming language, along with html and javascript for visualizing the data. Based on the results of this research the authors can conclude that this research can make a projection of residental area in Hantara village accordance with genetic algorithm and its constraint.Keywords— Sepatial Planning, Genetic Algorithm, Data Visualization, RUP, Python
空间规划是每个区域政府必须履行的义务。目前,空间规划仍是传统的由空间规划公司进行规划。对于笔者考察的研究对象,即汉塔拉村,汉塔拉村对于汉塔拉村未来如何规划和发展还没有一个规划。随着信息技术的发展,目前空间规划可以通过将遗传算法实施到应用程序中来使用应用程序来完成。遗传算法是一种优化搜索算法,在其实施过程中,遗传算法将寻找最优点,这些点与2007年关于空间规划的第26号法律确定的约束相匹配。然后利用在线地图提供商mapbox的特性将遗传算法数据的搜索结果可视化。在软件开发中,作者使用Rational统一过程(RUP)方法,它有四个阶段,即:先启、精化、构建和产品化。此应用程序是使用python编程语言构建的,以及用于可视化数据的html和javascript。根据本文的研究结果,作者可以得出结论:本研究可以根据遗传算法及其约束对汉塔拉村的居住面积进行投影。关键词:空间规划,遗传算法,数据可视化,RUP, Python
{"title":"Implementasi Algoritma Genetika pada Tata Ruang Ibukota Kecamatan (Studi Kasus : Desa Hantara)","authors":"Dadan Nugraha, I. Lesmana, Gian Megantara","doi":"10.25134/jejaring.v6i2.6739","DOIUrl":"https://doi.org/10.25134/jejaring.v6i2.6739","url":null,"abstract":"Spatial planning is an obligation that must be carried out by each Regional Government. At present, spatial planning is still conventionally planned by the spatial planning company. Regarding with the object of research that the authors examined, namely Hantara Village, Hantara Village did not yet have a plan for how the future projection and development of Hantara Village. With a touch of information technology, for now spatial planning can be done using an application by implementing a method that is Genetic Algorithm into the application .Genetic Algorithm is an optimal search algorithm which is in its implementation the genetic algorithm will look for the most optimal points which is match with the constraints that have been determined based on law 26 of 2007 concerning Spatial Planning. Then the search results of the genetic algorithm data will be visualized by using the features of the mapbox, the online map provider. In software development, the author use the Rational Unified Process (RUP) method which has four stages, namely: Inception, Elaboration, Contruction, and Transition. This application is built use the python programming language, along with html and javascript for visualizing the data. Based on the results of this research the authors can conclude that this research can make a projection of residental area in Hantara village accordance with genetic algorithm and its constraint.Keywords— Sepatial Planning, Genetic Algorithm, Data Visualization, RUP, Python","PeriodicalId":265714,"journal":{"name":"JEJARING : Jurnal Teknologi dan Manajemen Informatika","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117007927","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Implementasi Algoritma Digital Differential Analyzer dalam Penentuan Rute Pada Peta Topografi berbasis Android
Pub Date : 2021-11-03 DOI: 10.25134/jejaring.v6i2.6740
Panji Novantara, Tito Sugiharto, Elpan Januar
The route is direction that must be taken from the starting point to the destination point. Determination of the route is usually done for a reference trip that will be taken include the distance, time or slope of the terrain to be passed. In the implementation, the determination of the route is often used by agencies and organizations operating in the open nature where the activities require special expertise that can process geographic information systems. Although the tools and technology for route determination are sufficient, they are still less effective and efficient because to know the distance, time and slope of a terrain on topographic maps are still using conventional calculations, therefore the application of route determination's topographic maps based android and applying Digital Differential Analizer algorithm. The algorithm can be used as a line maker to display a slope picture of the field being traversed. This application was developed using the Rational Unified Process (RUP) method which has 4 stages: Inception, Elaboration, Contruction, and Transition. This application can be run at least on Android platform version 4.1.Keywords : Geographic Information Systems, Routes, Digital Differential Analizer Algorithm, Android, RUP
路线是从起点到终点必须走的方向。路线的确定通常是为了参考行程,包括要通过的距离、时间或地形的坡度。在实施过程中,在开放环境中开展活动的机构和组织经常使用确定路线的方法,因为这些活动需要能够处理地理信息系统的特殊专门知识。虽然确定路线的工具和技术是足够的,但由于在地形图上了解地形的距离、时间和坡度仍然是使用传统的计算方法,因此在基于android的地形图中应用路线确定并应用数字差分分析算法,其效果和效率仍然不高。该算法可以作为线条生成器来显示正在遍历的场的斜率图。这个应用程序是使用Rational统一过程(RUP)方法开发的,它有4个阶段:先启、精化、构建和产品化。此应用程序至少可以在Android平台4.1版本上运行。关键词:地理信息系统,路线,数字差分分析算法,Android, RUP
{"title":"Implementasi Algoritma Digital Differential Analyzer dalam Penentuan Rute Pada Peta Topografi berbasis Android","authors":"Panji Novantara, Tito Sugiharto, Elpan Januar","doi":"10.25134/jejaring.v6i2.6740","DOIUrl":"https://doi.org/10.25134/jejaring.v6i2.6740","url":null,"abstract":"The route is direction that must be taken from the starting point to the destination point. Determination of the route is usually done for a reference trip that will be taken include the distance, time or slope of the terrain to be passed. In the implementation, the determination of the route is often used by agencies and organizations operating in the open nature where the activities require special expertise that can process geographic information systems. Although the tools and technology for route determination are sufficient, they are still less effective and efficient because to know the distance, time and slope of a terrain on topographic maps are still using conventional calculations, therefore the application of route determination's topographic maps based android and applying Digital Differential Analizer algorithm. The algorithm can be used as a line maker to display a slope picture of the field being traversed. This application was developed using the Rational Unified Process (RUP) method which has 4 stages: Inception, Elaboration, Contruction, and Transition. This application can be run at least on Android platform version 4.1.Keywords : Geographic Information Systems, Routes, Digital Differential Analizer Algorithm, Android, RUP","PeriodicalId":265714,"journal":{"name":"JEJARING : Jurnal Teknologi dan Manajemen Informatika","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124049736","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Implementasi Algoritma PCA pada Pengenalan Pola Tanda Tangan dengan Menggunakan Bahasa Pemrograman Phyton 用蟒蛇编程语言实现了一个PCA算法的签名识别模式
Pub Date : 2021-05-10 DOI: 10.25134/jejaring.v6i1.6734
Dadan Nugraha, Panji Novantara, Alman Muhammad
ABSTRAK Tanda tangan adalah hasil dari proses menulis seseorang yang bersifat khusus sebagai substansi simbolik. Tanda tangan merupakan bentuk yang paling banyak digunakan untuk identifikasi seseorang. Fungsi tanda tangan sendiri adalah untuk pembuktikan. Dalam kehidupan sehari-hari, tanda tangan digunakan sebagai identifikasi dari pemilik tanda tangan. Keberadaan tanda tangan dalam sebuah dokumen menyatakan bahwa pihak yang menandatangani, mengetahui, dan menyetujui seluruh isi dari suatu dokumen. Dengan Metode Principal Component Analysis (PCA) atau dikenal juga dengan nama Karhunen-Loeve transformation (KLT), yang telah dikenal sejak 30 tahun dalam dunia pengenalan pola. PCA memberikan tranformasi orthogonal yang disebut dengan “eigenimage” yang mana sebuah image direpresentasikan kedalam bentuk proyeksi linier searah dengan eigenimage. Secara praktis eigenimage ini dibangun dari sekumpulan image training yang diambil dari berbagai obyek/kelas dan dibantu dengan metode Euclidean distance yang menyatakan jarak antara dua titik dalam suatu ruang. Dimana jarak antara dua titik adalah garis terpendek diantara semua garis yang menghubungkan kedua titik tersebut, kita bisa mengidentifikasi suatu tanda tangan berdasarkan data yang dimiliki. Dengan menggunakan bahasa pemrograman python dalam pengolahan matematisnya akan lebih mudah dalam penerapannya.Kata Kunci : Tanda Tangan, PCA, Eigenimage, Euclidean Distance dan python.
抽象签名是一个具有特殊象征意义的人写作过程的结果。签名是识别一个人最常用的形式。签名的功能是为了证明它。在日常生活中,签名被用来识别签名的所有者。在一份文件中签名的存在表明,签署人知道并批准了某一文件的全部内容。通过原则分析(PCA),也被称为Karhunen-Loeve转换(KLT),该方法在模式识别领域已经存在了30年。PCA提供了一种叫做“eigenimaal”的正规性变形,而该意象代表的是与eigenimas的线性投影。这张eigenimage实际上是由从多个物体/类中提取的一组培训图像组成的,并借助欧几里得距离的方法来表示空间中两点的距离。两点之间的距离是连接这两点的所有直线之间最短的距离,我们可以根据所拥有的数据识别签名。在工作中使用python的编程语言将使应用更加容易。关键词:签名、PCA、Eigenimage、欧几里得距离和python。
{"title":"Implementasi Algoritma PCA pada Pengenalan Pola Tanda Tangan dengan Menggunakan Bahasa Pemrograman Phyton","authors":"Dadan Nugraha, Panji Novantara, Alman Muhammad","doi":"10.25134/jejaring.v6i1.6734","DOIUrl":"https://doi.org/10.25134/jejaring.v6i1.6734","url":null,"abstract":"ABSTRAK Tanda tangan adalah hasil dari proses menulis seseorang yang bersifat khusus sebagai substansi simbolik. Tanda tangan merupakan bentuk yang paling banyak digunakan untuk identifikasi seseorang. Fungsi tanda tangan sendiri adalah untuk pembuktikan. Dalam kehidupan sehari-hari, tanda tangan digunakan sebagai identifikasi dari pemilik tanda tangan. Keberadaan tanda tangan dalam sebuah dokumen menyatakan bahwa pihak yang menandatangani, mengetahui, dan menyetujui seluruh isi dari suatu dokumen. Dengan Metode Principal Component Analysis (PCA) atau dikenal juga dengan nama Karhunen-Loeve transformation (KLT), yang telah dikenal sejak 30 tahun dalam dunia pengenalan pola. PCA memberikan tranformasi orthogonal yang disebut dengan “eigenimage” yang mana sebuah image direpresentasikan kedalam bentuk proyeksi linier searah dengan eigenimage. Secara praktis eigenimage ini dibangun dari sekumpulan image training yang diambil dari berbagai obyek/kelas dan dibantu dengan metode Euclidean distance yang menyatakan jarak antara dua titik dalam suatu ruang. Dimana jarak antara dua titik adalah garis terpendek diantara semua garis yang menghubungkan kedua titik tersebut, kita bisa mengidentifikasi suatu tanda tangan berdasarkan data yang dimiliki. Dengan menggunakan bahasa pemrograman python dalam pengolahan matematisnya akan lebih mudah dalam penerapannya.Kata Kunci : Tanda Tangan, PCA, Eigenimage, Euclidean Distance dan python.","PeriodicalId":265714,"journal":{"name":"JEJARING : Jurnal Teknologi dan Manajemen Informatika","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127406212","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Implementasi Watermarking pada Citra Digital dengan Metode Singular Value Decomposition (svd)
Pub Date : 2021-05-06 DOI: 10.25134/jejaring.v6i1.6720
Aah Sumiah, Yani Alfian
Today computers have been used in all aspects of life as a means of processing digital data. The Development of computer makes digital files mostly used because the computer is an electronic equipment used to process digital file. Moreover with network technology developments internet it enables file exchange and process the file.This ease impacts to copyright, so that needs to be considered the protection of copyrights. Such protection insertion namely with a proprietary identity against certain files.one of them is watermarking technique. There are several techniques of digital watermarking which have developed. One technique is digital watermark image on singular value decomposition (svd), ie insertion a singular image. Watermarking method using singular value decomposition (svd) leads the overall in scattered watermark image, so that when the slightest changes occurred on with easy image can be known. In addition itu resistant against different attacks, such as croping, rotation changes. The author discusses about the digital image watermarking based svd. In making application he uses delphi 7.Keywords: Digital Image, Watermarking, Singular Value Decomposition.
今天,计算机作为一种处理数字数据的手段已被应用于生活的各个方面。由于计算机是一种处理数字文件的电子设备,因此数字文件的应用越来越广泛。此外,随着网络技术的发展,互联网使文件交换和文件处理成为可能。这就容易对版权造成影响,因此需要考虑版权的保护。这种保护插入,即对某些文件具有专有身份。其中之一就是水印技术。数字水印技术已经发展到一定程度。其中一种技术是对数字水印图像进行奇异值分解(svd),即插入一幅奇异图像。采用奇异值分解(svd)的水印方法对分散的水印图像进行整体引导,使图像在发生微小变化时易于识别。此外还能抵抗不同的攻击,如播种、轮作等变化。讨论了基于svd的数字图像水印技术。在应用程序的编写中,他使用了delphi 7。关键词:数字图像,水印,奇异值分解
{"title":"Implementasi Watermarking pada Citra Digital dengan Metode Singular Value Decomposition (svd)","authors":"Aah Sumiah, Yani Alfian","doi":"10.25134/jejaring.v6i1.6720","DOIUrl":"https://doi.org/10.25134/jejaring.v6i1.6720","url":null,"abstract":"Today computers have been used in all aspects of life as a means of processing digital data. The Development of computer makes digital files mostly used because the computer is an electronic equipment used to process digital file. Moreover with network technology developments internet it enables file exchange and process the file.This ease impacts to copyright, so that needs to be considered the protection of copyrights. Such protection insertion namely with a proprietary identity against certain files.one of them is watermarking technique. There are several techniques of digital watermarking which have developed. One technique is digital watermark image on singular value decomposition (svd), ie insertion a singular image. Watermarking method using singular value decomposition (svd) leads the overall in scattered watermark image, so that when the slightest changes occurred on with easy image can be known. In addition itu resistant against different attacks, such as croping, rotation changes. The author discusses about the digital image watermarking based svd. In making application he uses delphi 7.Keywords: Digital Image, Watermarking, Singular Value Decomposition.","PeriodicalId":265714,"journal":{"name":"JEJARING : Jurnal Teknologi dan Manajemen Informatika","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133299941","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Perbandingan Metode Gaussian Filter dengan Median Filter dalam Mereduksi Noise Pada Citra Digital 高斯滤镜方法与数字图像还原声音的中间滤镜比较
Pub Date : 2021-05-04 DOI: 10.25134/jejaring.v6i1.6736
Panji Novantara, Jajang Mutiara
Basically all humans want something perfect as well as in a digital image. One problem that often occurs in the digital image is noise or damage on the image. Noise is an error that occurs in the process of shooting so that unwanted signals exist. Improvement of digital images containing noise is an important thing in digital image processing. In designing the applications, the writer uses two methods i.e. Gaussian filter and Median Filter methods. Gaussian filter method is a linear filter with a weighted value for each pixel members is selected based on the shape of the members’ function. While the median filter method is one of the non-linear filter methods that arranges a bunch of pixel intensity values then replaces the pixel values being processed with a median value. From the test results of a digital image that has a noise, it is known that the result of the median filter method is better than Gaussian filter to reduce noise in digital images.Key words: Image Filtering, Method Gaussian Filter, Median Filter
基本上,所有人都想在数字图像中看到完美的东西。数字图像中经常出现的一个问题是图像上的噪声或损坏。噪声是在射击过程中产生的一种误差,使不需要的信号存在。对含噪数字图像的处理是数字图像处理中的一个重要问题。在应用程序的设计中,作者使用了高斯滤波和中值滤波两种方法。高斯滤波方法是一种线性滤波方法,每个像素的加权值是根据成员函数的形状来选择的。而中值滤波方法是一种非线性滤波方法,它安排一堆像素强度值,然后用中值代替正在处理的像素值。从一幅带有噪声的数字图像的测试结果可知,中值滤波方法的降噪效果优于高斯滤波方法。关键词:图像滤波,高斯滤波,中值滤波
{"title":"Perbandingan Metode Gaussian Filter dengan Median Filter dalam Mereduksi Noise Pada Citra Digital","authors":"Panji Novantara, Jajang Mutiara","doi":"10.25134/jejaring.v6i1.6736","DOIUrl":"https://doi.org/10.25134/jejaring.v6i1.6736","url":null,"abstract":"Basically all humans want something perfect as well as in a digital image. One problem that often occurs in the digital image is noise or damage on the image. Noise is an error that occurs in the process of shooting so that unwanted signals exist. Improvement of digital images containing noise is an important thing in digital image processing. In designing the applications, the writer uses two methods i.e. Gaussian filter and Median Filter methods. Gaussian filter method is a linear filter with a weighted value for each pixel members is selected based on the shape of the members’ function. While the median filter method is one of the non-linear filter methods that arranges a bunch of pixel intensity values then replaces the pixel values being processed with a median value. From the test results of a digital image that has a noise, it is known that the result of the median filter method is better than Gaussian filter to reduce noise in digital images.Key words: Image Filtering, Method Gaussian Filter, Median Filter","PeriodicalId":265714,"journal":{"name":"JEJARING : Jurnal Teknologi dan Manajemen Informatika","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122236928","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
JEJARING : Jurnal Teknologi dan Manajemen Informatika
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1