Günümüzde fosil yakıt kökenli üretim yollarının kaynakları gittikçe tükenmekte ve çevre kirliliğine neden olmaktadır. Fosil kaynakların sınırlı olması, bizi yenilenebilir enerji kaynaklarına yöneltmektedir. Yenilebilir enerji kaynakları ile yapılan üretim ise değişen küresel iklim şartları problemini beraberinde getirmektedir. Güneş ve rüzgâr gibi yenilenebilir enerji kaynakları gün içerisinde farklı üretim değerlerine sahip oldukları için dalgalanan talebe hızlı ve güvenilir yanıt verememektedir. Bu da enerjiden daha verimli ve sürekli faydalanmak adına enerjinin depolanması konusunu beraberinde getirmektedir. Bu makalede 2 farklı güç değerlerindeki Enerji Depolama Sisteminin(EDS) güç sistemi kararlılığı üzerindeki etkileri ayrı ayrı incelenmiştir. Analiz için IEEE 14 baralı güç sistemi kullanılarak 2 farklı güçte enerji depolama sistemi, güneş ve rüzgar üretim birimleri entegre edilen test sistemleri oluşturulmuştur. Düşük ve yüksek güçteki depolama sistemleri ve yenilenebilir enerji kaynaklarıyla birlikte oluşturulan senaryolarda güç sistemlerinde yaşanması olası bir arıza oluşturularak bu arıza karşısında sistemin verdiği tepkiler incelenmiştir. Simülasyonlar Matlab programında; Hadi Saadat’ın kararlılık analizi için temel kabul edilen programı üzerinden geliştirilerek tasarlanan Enerji Depolama Sistemi üzerinden gerçek zamanlı üretim değerleri kullanılarak rotor açı, frekans ve gerilim kararlılığı analizleri gerçekleştirilmiştir. Enerji depolama sisteminin gücünün arttırılmasıyla sistemin arıza karşısında kararlı kalma süresinin düşük güçteki depolama sistemine göre genel olarak arttığı gözlemlenmiştir.
今天，化石燃料是化石燃料和污染的来源。Fosil kaynakların sınırlıolması，bizi yenilenebilir enerji kaynaklarına yöneltmektedir。可再生能源的生产带来了全球气候条件变化的问题。太阳能和风能等可再生能源的响应不快速可靠，因为它们在白天的生产价值不同。这意味着能量存储比能量更高效、更高效。本文分别研究了能量部署系统（EDS）对确定两个不同值的电力系统的影响。为了进行分析，IEEE 14电力系统创建了两个不同的储能系统，即集成到两个不同储能系统中的太阳能和风能生产单元。通过在电力系统中产生可能的误差以及系统对该问题的反应，已经对低功率和高功率存储系统以及可再生能源进行了研究。在Matlab程序中进行仿真；让我们对能量沉积系统使用转子开路、频率和反向测定分析进行实时生产分析，该系统旨在改进小时测定分析的计划程序。根据低功率存储系统，能量存储系统通常被认为在系统故障时增加其功率。
{"title":"Investigation of System Stability at Different Energy Storage Levels in Power Systems","authors":"Ayşe Acar, A. Kaygusuz","doi":"10.53070/bbd.1202024","DOIUrl":"https://doi.org/10.53070/bbd.1202024","url":null,"abstract":"Günümüzde fosil yakıt kökenli üretim yollarının kaynakları gittikçe tükenmekte ve çevre kirliliğine neden olmaktadır. Fosil kaynakların sınırlı olması, bizi yenilenebilir enerji kaynaklarına yöneltmektedir. Yenilebilir enerji kaynakları ile yapılan üretim ise değişen küresel iklim şartları problemini beraberinde getirmektedir. Güneş ve rüzgâr gibi yenilenebilir enerji kaynakları gün içerisinde farklı üretim değerlerine sahip oldukları için dalgalanan talebe hızlı ve güvenilir yanıt verememektedir. Bu da enerjiden daha verimli ve sürekli faydalanmak adına enerjinin depolanması konusunu beraberinde getirmektedir. Bu makalede 2 farklı güç değerlerindeki Enerji Depolama Sisteminin(EDS) güç sistemi kararlılığı üzerindeki etkileri ayrı ayrı incelenmiştir. Analiz için IEEE 14 baralı güç sistemi kullanılarak 2 farklı güçte enerji depolama sistemi, güneş ve rüzgar üretim birimleri entegre edilen test sistemleri oluşturulmuştur. Düşük ve yüksek güçteki depolama sistemleri ve yenilenebilir enerji kaynaklarıyla birlikte oluşturulan senaryolarda güç sistemlerinde yaşanması olası bir arıza oluşturularak bu arıza karşısında sistemin verdiği tepkiler incelenmiştir. Simülasyonlar Matlab programında; Hadi Saadat’ın kararlılık analizi için temel kabul edilen programı üzerinden geliştirilerek tasarlanan Enerji Depolama Sistemi üzerinden gerçek zamanlı üretim değerleri kullanılarak rotor açı, frekans ve gerilim kararlılığı analizleri gerçekleştirilmiştir. Enerji depolama sisteminin gücünün arttırılmasıyla sistemin arıza karşısında kararlı kalma süresinin düşük güçteki depolama sistemine göre genel olarak arttığı gözlemlenmiştir.","PeriodicalId":41917,"journal":{"name":"Computer Science-AGH","volume":" ","pages":""},"PeriodicalIF":0.5,"publicationDate":"2023-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43882314","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}
Pub Date : 2023-01-31DOI: 10.31294/coscience.v3i1.1566
Deliana Sianipar, Hendri Hendri
The best employees have the potential to increase a company's productivity, which in turn increases profits. However, the problem with PT. Steadfast Marine, a Pontianak-based company that designs and builds ships, has not done the best job of hiring the best employees. Therefore, human resource management, namely using the weighted product (WP) method to select the best employees and improve employee performance in order to remain competitive in the business world, is an important component of successful business operations. Using multiplication to relate the value of the criteria, where each criterion must be raised to the first rank, with the weight of the relevant criteria, taking into account the criteria and weights. To select the best employees accurately and computerized, DSS can help provide solutions. Research was conducted to see and prove the truth and develop pre-existing knowledge by using criteria and applying them to web applications. The employee who was selected as the best employee among the alternatives in the company can be seen from the calculation results. Leading the administration of selecting the best employees. The highest score of 0.0490 as an employee eligible for an award from the company was obtained on behalf of Sau Kong.
{"title":"Sistem Pendukung Keputusan Pemilihan Karyawan Terbaik Menggunakan Metode Weighted Product Pada PT.Steadfast Marine, Pontianak","authors":"Deliana Sianipar, Hendri Hendri","doi":"10.31294/coscience.v3i1.1566","DOIUrl":"https://doi.org/10.31294/coscience.v3i1.1566","url":null,"abstract":"The best employees have the potential to increase a company's productivity, which in turn increases profits. However, the problem with PT. Steadfast Marine, a Pontianak-based company that designs and builds ships, has not done the best job of hiring the best employees. Therefore, human resource management, namely using the weighted product (WP) method to select the best employees and improve employee performance in order to remain competitive in the business world, is an important component of successful business operations. Using multiplication to relate the value of the criteria, where each criterion must be raised to the first rank, with the weight of the relevant criteria, taking into account the criteria and weights. To select the best employees accurately and computerized, DSS can help provide solutions. Research was conducted to see and prove the truth and develop pre-existing knowledge by using criteria and applying them to web applications. The employee who was selected as the best employee among the alternatives in the company can be seen from the calculation results. Leading the administration of selecting the best employees. The highest score of 0.0490 as an employee eligible for an award from the company was obtained on behalf of Sau Kong.","PeriodicalId":41917,"journal":{"name":"Computer Science-AGH","volume":"227 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135395775","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}
Pub Date : 2023-01-31DOI: 10.31294/coscience.v3i1.1795
Euis Nurlaelasari, Eko Pramono
Desain dari sebuah produk akan sangat mempengaruhi ketertarikan seseorang pada produk tersebut, sekaligus akan memberikan gambaran mengenai kesan terhadap produk tersebut. Kansei Engineering merupakan sebuah metode penentuan desain produk berdasarkaan perasaan atau emosi. Desain dari produk akan diterjemahkan kedalam emosi yang dimiliki manusia. Sebuah piring berwarna cerah dengan bentuk bunga bisa diinterpretasikan sebagai emosi yang ceria. Hal tersebut membuat manusia memiliki keterikatan dengan produk karena hubungan emosi. Oleh karena itu, pada penelitian ini akan mengimplementasikan metode kansei engineering untuk produk di e-commerce. Tujuan tersebut dilatarbelakangi oleh tren e-commerce yang masih akan terus berkembang kedepannya. Hasil dari penelitian ini berupa rancangan sistem Kansei untuk melakukan pencarian produk pada katalog e-commerce berdasarkan emosi. Kesimpulan dari penelitian ini adalah dapat menyusun algorima pencarian produk terbaik berdasarkan emosi dan perancangan sistem Kansei dengan fungsi utama pencarian produk berdasarkan emosi. Berdasarkan hasil yang telah didapat, penelitian selanjutnya diharapkan dalam menggunakan suatu algoritma tertentu untuk meng-otomatisasi proses pengolahan knowledge base yang sangat dibutuhkan pada KES.
{"title":"Rancangan Kansei Engineering System (KES) untuk Optimasi Hasil Pencarian Berdasarkan Kategori Emosi","authors":"Euis Nurlaelasari, Eko Pramono","doi":"10.31294/coscience.v3i1.1795","DOIUrl":"https://doi.org/10.31294/coscience.v3i1.1795","url":null,"abstract":"Desain dari sebuah produk akan sangat mempengaruhi ketertarikan seseorang pada produk tersebut, sekaligus akan memberikan gambaran mengenai kesan terhadap produk tersebut. Kansei Engineering merupakan sebuah metode penentuan desain produk berdasarkaan perasaan atau emosi. Desain dari produk akan diterjemahkan kedalam emosi yang dimiliki manusia. Sebuah piring berwarna cerah dengan bentuk bunga bisa diinterpretasikan sebagai emosi yang ceria. Hal tersebut membuat manusia memiliki keterikatan dengan produk karena hubungan emosi. Oleh karena itu, pada penelitian ini akan mengimplementasikan metode kansei engineering untuk produk di e-commerce. Tujuan tersebut dilatarbelakangi oleh tren e-commerce yang masih akan terus berkembang kedepannya. Hasil dari penelitian ini berupa rancangan sistem Kansei untuk melakukan pencarian produk pada katalog e-commerce berdasarkan emosi. Kesimpulan dari penelitian ini adalah dapat menyusun algorima pencarian produk terbaik berdasarkan emosi dan perancangan sistem Kansei dengan fungsi utama pencarian produk berdasarkan emosi. Berdasarkan hasil yang telah didapat, penelitian selanjutnya diharapkan dalam menggunakan suatu algoritma tertentu untuk meng-otomatisasi proses pengolahan knowledge base yang sangat dibutuhkan pada KES.","PeriodicalId":41917,"journal":{"name":"Computer Science-AGH","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135395773","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}
Pub Date : 2023-01-31DOI: 10.31294/coscience.v3i1.1351
Wira Prasetyo, Eni Heni Hermaliani, Riyan Latifahul Hasanah
PT. Telkom Witel Kalbar currently has many employees but with so many employees, the selection of the best employees is made manually so that the company is still difficult to determine the best employees. With these problems, researchers are interested in conducting research in the form of a decision support system that can later help the company to determine the selection of the best employees in the form of an application. The Analytical Hierarchy Process (AHP) is a theory that contains measurements used to find the ratio scale by means of pairwise comparisons between factors. This study uses the Analytical Hierarchy Process method as an alternative solution to the decision support system for selecting the best employees at PT. Telkom Witel Kalbar. The application of the AHP method is considered capable of providing an initial value of personal problems and then becoming objective to increase the accuracy level in selecting the best employees.
PT. Telkom Witel Kalbar目前有很多员工，但有这么多员工，最好的员工的选择是手工制作的，所以公司仍然很难确定最好的员工。有了这些问题，研究人员有兴趣以决策支持系统的形式进行研究，该系统可以帮助公司以应用程序的形式确定最佳员工的选择。层次分析法(AHP)是一种理论，它包含了通过因素之间的两两比较来找到比例尺度的测量方法。本研究使用层次分析法作为PT. Telkom Witel Kalbar选择最佳员工的决策支持系统的替代解决方案。AHP方法的应用被认为能够提供个人问题的初始值，然后成为客观的，以提高选择最佳员工的准确性水平。
{"title":"Sistem Pendukung Keputusan Pemilihan Karyawan Terbaik Dengan Metode AHP Pada PT Telkom Witel Kalbar","authors":"Wira Prasetyo, Eni Heni Hermaliani, Riyan Latifahul Hasanah","doi":"10.31294/coscience.v3i1.1351","DOIUrl":"https://doi.org/10.31294/coscience.v3i1.1351","url":null,"abstract":"PT. Telkom Witel Kalbar currently has many employees but with so many employees, the selection of the best employees is made manually so that the company is still difficult to determine the best employees. With these problems, researchers are interested in conducting research in the form of a decision support system that can later help the company to determine the selection of the best employees in the form of an application. The Analytical Hierarchy Process (AHP) is a theory that contains measurements used to find the ratio scale by means of pairwise comparisons between factors. This study uses the Analytical Hierarchy Process method as an alternative solution to the decision support system for selecting the best employees at PT. Telkom Witel Kalbar. The application of the AHP method is considered capable of providing an initial value of personal problems and then becoming objective to increase the accuracy level in selecting the best employees.","PeriodicalId":41917,"journal":{"name":"Computer Science-AGH","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135395776","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}
Pub Date : 2023-01-31DOI: 10.31294/coscience.v3i1.1734
Sujiliani Heristian, Septiyan Dwi Cahyo
Seiring dengan meingkatnya kebutuhan manusia akan teknologi informasi, maka perkembangan teknologi informasi semakin terpacu. Perkembangan ini sejalan dengan kemajuan teknologi informasi dan jaringan komputer yang menggunakan teknologi yang menerapkan otomatisasi pada sistemnya. Koneksi internet pada Badan Pengelolaan Keuangan dan Aset Daerah Kab. Bogor menggunakan 2 Internet Service Provider. Ketika salah satu ISP mengalami gangguan maka layanan internet akan terganggu dan harus dikonfigurasi secara manual. Tujuan penulisan tugas akhir ini untuk menjaga koneksi internet tetap stabil dan tidak mengganggu kinerja pegawai. Penulisan tugas akhir ini menggunakan metode wawancara, observasi, dan studi pustaka. Maksud dari penelitian ini adalah bagaimana penulis menerapkan teknik load balancing yang dapat mengatasi permasalahan terkait jalur koneksi dari 2 ISP. Salah satu solusi untuk menangani masalah tersebut adalah menggunakan metode per connection classifier. Per connection classifier memungkinkan router mengingat jalur masuk dan keluarnya data yang telah dilewati di awal lalu lintas koneksi. Dengan penerapan teknik load balancing menggunakan metode per connection classifier, diharapkan koneksi internet menjadi stabil dan tidak menganggu kinerja dari para pegawai
{"title":"Analisis Load Balancing Menggunakan Metode Pcc (Per Connection Classifier) Pada Badan Pengelolaan Keuangan Dan Aset Daerah (Bpkad) Kabupaten Bogor","authors":"Sujiliani Heristian, Septiyan Dwi Cahyo","doi":"10.31294/coscience.v3i1.1734","DOIUrl":"https://doi.org/10.31294/coscience.v3i1.1734","url":null,"abstract":"Seiring dengan meingkatnya kebutuhan manusia akan teknologi informasi, maka perkembangan teknologi informasi semakin terpacu. Perkembangan ini sejalan dengan kemajuan teknologi informasi dan jaringan komputer yang menggunakan teknologi yang menerapkan otomatisasi pada sistemnya. Koneksi internet pada Badan Pengelolaan Keuangan dan Aset Daerah Kab. Bogor menggunakan 2 Internet Service Provider. Ketika salah satu ISP mengalami gangguan maka layanan internet akan terganggu dan harus dikonfigurasi secara manual. Tujuan penulisan tugas akhir ini untuk menjaga koneksi internet tetap stabil dan tidak mengganggu kinerja pegawai. Penulisan tugas akhir ini menggunakan metode wawancara, observasi, dan studi pustaka. Maksud dari penelitian ini adalah bagaimana penulis menerapkan teknik load balancing yang dapat mengatasi permasalahan terkait jalur koneksi dari 2 ISP. Salah satu solusi untuk menangani masalah tersebut adalah menggunakan metode per connection classifier. Per connection classifier memungkinkan router mengingat jalur masuk dan keluarnya data yang telah dilewati di awal lalu lintas koneksi. Dengan penerapan teknik load balancing menggunakan metode per connection classifier, diharapkan koneksi internet menjadi stabil dan tidak menganggu kinerja dari para pegawai","PeriodicalId":41917,"journal":{"name":"Computer Science-AGH","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135395931","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}
Pub Date : 2023-01-31DOI: 10.31294/coscience.v3i1.1527
Monica Honay Ng Cuar, Sulistianto Sutrisno Wanda
Penelitian ini bertujuan untuk membuat model pengambilan keputusan promosi jabatan dengan menggunakan metode profile matching, agar bisa Mengetahui proses penilaian secara objektif dan transparansi sesuai dengan ketentuan dalam promosi jabatan dan menerapkan metode profile matching di PT. United Tractors yang di gunakan dalam menentukan promosi jabatan. Metode yang digunakan kuantitatif karena data penelitian berupa angka-angka. Hasil penelitian menunjukan bahwa sistem pendukung keputusan kenaikan jabatan menggunakan metode profile matching dirancang dan dibangun melalui proses pengumpulan dan analisa data dan Proses penentuan ranking karyawan united tractors yang dihitung dengan menggunakan metode Profile Matching dimulai dengan menentukan Gap, bobot nilai Gap, pengelompokkan core factor dan secondary factor, perhitungan nilai total, dan terakhir penentuan ranking.
Kata kunci : Profile Matching, Gap Kompetensi
{"title":"Penerapan Metode Profile Matching Pada Promosi Jabatan Karyawan Di PT. United Tractors","authors":"Monica Honay Ng Cuar, Sulistianto Sutrisno Wanda","doi":"10.31294/coscience.v3i1.1527","DOIUrl":"https://doi.org/10.31294/coscience.v3i1.1527","url":null,"abstract":"Penelitian ini bertujuan untuk membuat model pengambilan keputusan promosi jabatan dengan menggunakan metode profile matching, agar bisa Mengetahui proses penilaian secara objektif dan transparansi sesuai dengan ketentuan dalam promosi jabatan dan menerapkan metode profile matching di PT. United Tractors yang di gunakan dalam menentukan promosi jabatan. Metode yang digunakan kuantitatif karena data penelitian berupa angka-angka. Hasil penelitian menunjukan bahwa sistem pendukung keputusan kenaikan jabatan menggunakan metode profile matching dirancang dan dibangun melalui proses pengumpulan dan analisa data dan Proses penentuan ranking karyawan united tractors yang dihitung dengan menggunakan metode Profile Matching dimulai dengan menentukan Gap, bobot nilai Gap, pengelompokkan core factor dan secondary factor, perhitungan nilai total, dan terakhir penentuan ranking.
 
 Kata kunci : Profile Matching, Gap Kompetensi","PeriodicalId":41917,"journal":{"name":"Computer Science-AGH","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135395777","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}
Graph structure is widely used to describe problems in different fields. Problems in many areas, such as security and transportation, are among them. The problems can be solved using approaches similar to the graph structure. The independent set problem, which is NP-Complete problem, is one of the main problems of graph theory and is used in modeling many problems. The implementation of the Independent set problem with the most significant possible number of nodes in the graph is called the Maximum Independent set. A lot of algorithm approach are proposed to solve the problem. This study proposes an effective approach for the maximum independent problem. This approach occurs two steps: computing the Malatya centrality value and determining the maximum independent set. In the first step, centrality values are computed for the nodes forming the graph structure using the Malatya algorithm. The Malatya centrality value of the nodes in any graph is the sum of the ratios of the node's degree to the neighboring nodes' degrees. The second step is to determine the nodes to be selected for the maximum independent set problem. Here, the node with the minimum Malatya centrality value is selected and added to the independent set. Then, the edges of this node, its adjacent nodes, and the edges of adjacent nodes are subtracted from the graph. By repeating the new graph structure calculations, all vertexes are deleted so that the maximum independent set is determined. It is observed on the sample graph that the proposed approach provides an effecient solution for the maximum independent set. Successful test results and analyzes denonstrate the effectiveness of the proposed approach.
{"title":"A New Approach Based on Centrality Value in Solving the Maximum Independent Set Problem: Malatya Centrality Algorithm","authors":"Selman Yakut, Furkan Öztemiz, A. Karcı","doi":"10.53070/bbd.1224520","DOIUrl":"https://doi.org/10.53070/bbd.1224520","url":null,"abstract":"Graph structure is widely used to describe problems in different fields. Problems in many areas, such as security and transportation, are among them. The problems can be solved using approaches similar to the graph structure. The independent set problem, which is NP-Complete problem, is one of the main problems of graph theory and is used in modeling many problems. The implementation of the Independent set problem with the most significant possible number of nodes in the graph is called the Maximum Independent set. A lot of algorithm approach are proposed to solve the problem. This study proposes an effective approach for the maximum independent problem. This approach occurs two steps: computing the Malatya centrality value and determining the maximum independent set. In the first step, centrality values are computed for the nodes forming the graph structure using the Malatya algorithm. The Malatya centrality value of the nodes in any graph is the sum of the ratios of the node's degree to the neighboring nodes' degrees. The second step is to determine the nodes to be selected for the maximum independent set problem. Here, the node with the minimum Malatya centrality value is selected and added to the independent set. Then, the edges of this node, its adjacent nodes, and the edges of adjacent nodes are subtracted from the graph. By repeating the new graph structure calculations, all vertexes are deleted so that the maximum independent set is determined. It is observed on the sample graph that the proposed approach provides an effecient solution for the maximum independent set. Successful test results and analyzes denonstrate the effectiveness of the proposed approach.","PeriodicalId":41917,"journal":{"name":"Computer Science-AGH","volume":" ","pages":""},"PeriodicalIF":0.5,"publicationDate":"2023-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45327957","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}
Finansal zaman serisi tahmini ile finansal varlıklar için doğru alım-satım kararları vererek karlılığın arttırılması amaçlanmaktadır. Finansal varlıkların fiyatları pek çok faktörden etkilenen kırılgan bir yapıdadır. Bu nedenle, finansal zaman serisi tahmini uzun yıllardır farklı disiplinlerden araştırmacılar tarafından ilgi gören oldukça zorlu bir görevdir. Bu çalışmada, günlük ons altın fiyat yönünün tahmini için 2007 – 2021 yıllarını kapsayan 15 yıllık tarihsel fiyat verisi kullanılmıştır. Altın fiyat verileri mum grafikleri ve teknik analiz göstergeleri yardımıyla grafik görüntülere dönüştürülmüştür. Bu sayede altın fiyat yön tahmini 2-sınıflı görüntü sınıflandırma problemine indirgenmiştir. Görüntülerin sınıflandırılması için öncü ön-eğitimli evrişimsel sinir ağı modellerinden AlexNet ince-ayarlanarak adapte edilmiştir. Gerçekleştirilen deney sonuçlarına göre, önerilen yaklaşımın sınıflandırma performansı doğruluk, duyarlılık, hassasiyet ve f-ölçütü performans metrikleri için sırasıyla %53,8, %66,97, %37,54 ve %42,05 olarak ölçülmüştür. Ayrıca önerilen yaklaşımın tahminlerine dayalı gerçekleştirilen ticaret stratejisinin karlılık analizleri de yapılmış ve yatırımcılar tarafından sıklıkla kullanılan Göreceli Güç Endeksi ve Al ve Tut yatırım stratejileri ile karşılaştırılmıştır. 3 yıllık vade boyunca gerçekleştirilen piyasa benzetim sonuçlarına göre önerilen yaklaşım %51,77 kar oranıyla diğer yatırım stratejilerinden daha iyi sonuç vermiştir.
财务时间序列旨在通过对金融资产做出正确的采购和销售决策来提高盈利能力。金融资产成本是一个受多种因素影响的破碎结构。因此，多年来，对不同学科的研究人员来说，估计财务时间序列一直是一项非常困难的任务。在这项研究中，使用了包括2007-2021年在内的15年历史价格数据来估计当前十年的价格方向。黄金数据已通过烟雾图和技术分析显示转换为图形图像。这导致了具有估计黄金价格方向的2度图像分类问题。为了对图像进行分类，AlexNet已经从受过教育的进化神经网络模型中提前进行了调整。根据实验结果，所提出的方法在精度、灵敏度、灵敏度和f维性能指标方面的测量结果分别为53.8%、66.97%、37.54%和42.05%。此外，基于该方法预测的商业策略的流行率分析已与投资者经常使用的Visible Power Endex和Al and Tut投资策略进行了比较。由于三年来市场的相似性，大约51.77%的拟议市场比其他投资策略取得了更好的结果。
{"title":"Evrişimsel Sinir Ağları ve Transfer Öğrenme Yaklaşımı Kullanılarak Altın Fiyat Yönünün Tahmini","authors":"Yahya Altuntaş, Fatih Okumuş, Fatih Kocamaz","doi":"10.53070/bbd.1205299","DOIUrl":"https://doi.org/10.53070/bbd.1205299","url":null,"abstract":"Finansal zaman serisi tahmini ile finansal varlıklar için doğru alım-satım kararları vererek karlılığın arttırılması amaçlanmaktadır. Finansal varlıkların fiyatları pek çok faktörden etkilenen kırılgan bir yapıdadır. Bu nedenle, finansal zaman serisi tahmini uzun yıllardır farklı disiplinlerden araştırmacılar tarafından ilgi gören oldukça zorlu bir görevdir. Bu çalışmada, günlük ons altın fiyat yönünün tahmini için 2007 – 2021 yıllarını kapsayan 15 yıllık tarihsel fiyat verisi kullanılmıştır. Altın fiyat verileri mum grafikleri ve teknik analiz göstergeleri yardımıyla grafik görüntülere dönüştürülmüştür. Bu sayede altın fiyat yön tahmini 2-sınıflı görüntü sınıflandırma problemine indirgenmiştir. Görüntülerin sınıflandırılması için öncü ön-eğitimli evrişimsel sinir ağı modellerinden AlexNet ince-ayarlanarak adapte edilmiştir. Gerçekleştirilen deney sonuçlarına göre, önerilen yaklaşımın sınıflandırma performansı doğruluk, duyarlılık, hassasiyet ve f-ölçütü performans metrikleri için sırasıyla %53,8, %66,97, %37,54 ve %42,05 olarak ölçülmüştür. Ayrıca önerilen yaklaşımın tahminlerine dayalı gerçekleştirilen ticaret stratejisinin karlılık analizleri de yapılmış ve yatırımcılar tarafından sıklıkla kullanılan Göreceli Güç Endeksi ve Al ve Tut yatırım stratejileri ile karşılaştırılmıştır. 3 yıllık vade boyunca gerçekleştirilen piyasa benzetim sonuçlarına göre önerilen yaklaşım %51,77 kar oranıyla diğer yatırım stratejilerinden daha iyi sonuç vermiştir.","PeriodicalId":41917,"journal":{"name":"Computer Science-AGH","volume":" ","pages":""},"PeriodicalIF":0.5,"publicationDate":"2022-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42764912","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}
Despite space, time, and financial limitations, people who want to receive education participate intensively in online education programs that have emerged with the development of technology. With the Covid-19 outbreak, this interest has increased exponentially. In today's societies, where online education, which is preferred for different reasons, has become essential, examining the factors affecting success in online learning is a very important research topic. The study examined the level of adaptation to online education in terms of demographic variables. Experimental studies and necessary analyzes were carried out on the open-access ‘Students Adaptability Level in Online Education’ dataset. The results obtained using association rules, among the most widely used data mining techniques, have provided remarkable results regarding factors affecting success in distance education. It is thought that the study and the reported results will be a guide in creating education plans suitable for the demographic characteristics of the students enrolled in the online education program.
{"title":"Adaptation to Online Education: An Educational Data Mining Application","authors":"Cengiz Hark, Hatice Okumuş, Taner Uçkan","doi":"10.53070/bbd.1199055","DOIUrl":"https://doi.org/10.53070/bbd.1199055","url":null,"abstract":"Despite space, time, and financial limitations, people who want to receive education participate intensively in online education programs that have emerged with the development of technology. With the Covid-19 outbreak, this interest has increased exponentially. In today's societies, where online education, which is preferred for different reasons, has become essential, examining the factors affecting success in online learning is a very important research topic. The study examined the level of adaptation to online education in terms of demographic variables. Experimental studies and necessary analyzes were carried out on the open-access ‘Students Adaptability Level in Online Education’ dataset. The results obtained using association rules, among the most widely used data mining techniques, have provided remarkable results regarding factors affecting success in distance education. It is thought that the study and the reported results will be a guide in creating education plans suitable for the demographic characteristics of the students enrolled in the online education program.","PeriodicalId":41917,"journal":{"name":"Computer Science-AGH","volume":" ","pages":""},"PeriodicalIF":0.5,"publicationDate":"2022-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47605052","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}
The graph is a data structures and models that used to describe many real-world problems. Many engineering problems, such as safety and transportation, have a graph-like structure and are based on a similar model. Therefore, these problems can be solved using similar methods to the graph data model. Vertex cover problem that is used in modeling many problems is one of the important NP-complete problems in graph theory. Vertex-cover realization by using minimum number of vertex is called Minimum Vertex Cover Problem (MVCP). Since MVCP is an optimization problem, many algorithms and approaches have been proposed to solve this problem. In this article, Malatya algorithm, which offers an effective solution for the vertex-cover problem, is proposed. Malatya algorithm offers a polynomial approach to the vertex cover problem. In the proposed approach, MVCP consists of two steps, calculating the Malatya centrality value and selecting the covering nodes. In the first step, Malatya centrality values are calculated for the nodes in the graph. These values are calculated using Malatya algorithm. Malatya centrality value of each node in the graph consists of the sum of the ratios of the degree of the node to the degrees of the adjacent nodes. The second step is a node selection problem for the vertex cover. The node with the maximum Malatya centrality value is selected from the nodes in the graph and added to the solution set. Then this node and its coincident edges are removed from the graph. Malatya centrality values are calculated again for the new graph, and the node with the maximum Malatya centrality value is selected from these values, and the coincident edges to this node are removed from the graph. This process is continued until all the edges in the graph are covered. It is shown on the sample graph that the proposed Malatya algorithm provides an effective solution for MVCP. Successful test results and analyzes show the effectiveness of Malatya algorithm.
{"title":"A New Approach Based on Centrality Value in Solving the Minimum Vertex Cover Problem: Malatya Centrality Algorithm","authors":"A. Karcı, Selman Yakut, Furkan Öztemiz","doi":"10.53070/bbd.1195501","DOIUrl":"https://doi.org/10.53070/bbd.1195501","url":null,"abstract":"The graph is a data structures and models that used to describe many real-world problems. Many engineering problems, such as safety and transportation, have a graph-like structure and are based on a similar model. Therefore, these problems can be solved using similar methods to the graph data model. Vertex cover problem that is used in modeling many problems is one of the important NP-complete problems in graph theory. Vertex-cover realization by using minimum number of vertex is called Minimum Vertex Cover Problem (MVCP). Since MVCP is an optimization problem, many algorithms and approaches have been proposed to solve this problem. In this article, Malatya algorithm, which offers an effective solution for the vertex-cover problem, is proposed. Malatya algorithm offers a polynomial approach to the vertex cover problem. In the proposed approach, MVCP consists of two steps, calculating the Malatya centrality value and selecting the covering nodes. In the first step, Malatya centrality values are calculated for the nodes in the graph. These values are calculated using Malatya algorithm. Malatya centrality value of each node in the graph consists of the sum of the ratios of the degree of the node to the degrees of the adjacent nodes. The second step is a node selection problem for the vertex cover. The node with the maximum Malatya centrality value is selected from the nodes in the graph and added to the solution set. Then this node and its coincident edges are removed from the graph. Malatya centrality values are calculated again for the new graph, and the node with the maximum Malatya centrality value is selected from these values, and the coincident edges to this node are removed from the graph. This process is continued until all the edges in the graph are covered. It is shown on the sample graph that the proposed Malatya algorithm provides an effective solution for MVCP. Successful test results and analyzes show the effectiveness of Malatya algorithm.","PeriodicalId":41917,"journal":{"name":"Computer Science-AGH","volume":" ","pages":""},"PeriodicalIF":0.5,"publicationDate":"2022-11-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49357991","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：