Computer Science-AGH最新文献_第2页

Investigation of System Stability at Different Energy Storage Levels in Power Systems 电力系统不同储能水平下系统稳定性研究

IF 0.5

Computer Science-AGH Pub Date : 2023-02-02 DOI: 10.53070/bbd.1202024

Ayşe Acar, A. Kaygusuz

{"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":null,"pages":null},"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}

引用次数: 0

Sistem Pendukung Keputusan Pemilihan Karyawan Terbaik Menggunakan Metode Weighted Product Pada PT.Steadfast Marine, Pontianak 最佳员工选择系统采用的是PT.踏实海军、Pontianak的方法

Computer Science-AGH Pub Date : 2023-01-31 DOI: 10.31294/coscience.v3i1.1566

Deliana Sianipar, Hendri Hendri

{"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":null,"pages":null},"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}

引用次数: 0

Rancangan Kansei Engineering System (KES) untuk Optimasi Hasil Pencarian Berdasarkan Kategori Emosi 设计 Kansei 工程系统 (KES)，优化基于情感类别的搜索结果

Computer Science-AGH Pub Date : 2023-01-31 DOI: 10.31294/coscience.v3i1.1795

Euis Nurlaelasari, Eko Pramono

{"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":null,"pages":null},"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}

引用次数: 0

Sistem Pendukung Keputusan Pemilihan Karyawan Terbaik Dengan Metode AHP Pada PT Telkom Witel Kalbar 支持选举最佳员工决策系统，使用PT telcom Witel Kalbar的AHP方法

Computer Science-AGH Pub Date : 2023-01-31 DOI: 10.31294/coscience.v3i1.1351

Wira Prasetyo, Eni Heni Hermaliani, Riyan Latifahul Hasanah

引用次数: 0

Analisis Load Balancing Menggunakan Metode Pcc (Per Connection Classifier) Pada Badan Pengelolaan Keuangan Dan Aset Daerah (Bpkad) Kabupaten Bogor 茂物地区金融和资产管理局（Bpkad）使用 Pcc（每个连接分类器）方法进行负载平衡分析

Computer Science-AGH Pub Date : 2023-01-31 DOI: 10.31294/coscience.v3i1.1734

Sujiliani Heristian, Septiyan Dwi Cahyo

{"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":null,"pages":null},"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}

引用次数: 0

Penerapan Metode Profile Matching Pada Promosi Jabatan Karyawan Di PT. United Tractors 该方法以匹配方式应用于PT. United Tractors的员工晋升

Computer Science-AGH Pub Date : 2023-01-31 DOI: 10.31294/coscience.v3i1.1527

Monica Honay Ng Cuar, Sulistianto Sutrisno Wanda

引用次数: 0

A New Approach Based on Centrality Value in Solving the Maximum Independent Set Problem: Malatya Centrality Algorithm 一种基于中心值求解最大独立集问题的新方法：Malatya中心算法

IF 0.5

Computer Science-AGH Pub Date : 2023-01-25 DOI: 10.53070/bbd.1224520

Selman Yakut, Furkan Öztemiz, A. Karcı

{"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":null,"pages":null},"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}

引用次数: 0

Evrişimsel Sinir Ağları ve Transfer Öğrenme Yaklaşımı Kullanılarak Altın Fiyat Yönünün Tahmini

IF 0.5

Computer Science-AGH Pub Date : 2022-11-30 DOI: 10.53070/bbd.1205299

Yahya Altuntaş, Fatih Okumuş, Fatih Kocamaz

{"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":null,"pages":null},"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}

引用次数: 0

Adaptation to Online Education: An Educational Data Mining Application 适应在线教育：一个教育数据挖掘应用

IF 0.5

Computer Science-AGH Pub Date : 2022-11-30 DOI: 10.53070/bbd.1199055

Cengiz Hark, Hatice Okumuş, Taner Uçkan

引用次数: 0

A New Approach Based on Centrality Value in Solving the Minimum Vertex Cover Problem: Malatya Centrality Algorithm 一种基于中心值求解最小顶点覆盖问题的新方法：Malatya中心算法

IF 0.5

Computer Science-AGH Pub Date : 2022-11-27 DOI: 10.53070/bbd.1195501

A. Karcı, Selman Yakut, Furkan Öztemiz

{"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":null,"pages":null},"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}

引用次数: 1