2019 Federated Conference on Computer Science and Information Systems (FedCSIS)最新文献_第4页

Towards fully Decentralized Multi-Objective Energy Scheduling 面向完全分散的多目标能量调度

2019 Federated Conference on Computer Science and Information Systems (FedCSIS) Pub Date : 2019-09-26 DOI: 10.15439/2019F160

Jörg Bremer, S. Lehnhoff

{"title":"Towards fully Decentralized Multi-Objective Energy Scheduling","authors":"Jörg Bremer, S. Lehnhoff","doi":"10.15439/2019F160","DOIUrl":"https://doi.org/10.15439/2019F160","url":null,"abstract":"Future demand for managing a huge number of individually operating small and often volatile energy resources within the smart grid is preponderantly answered by involving decentralized orchestration methods for planning and scheduling. Many plaiming and scheduling problems are of a multi-objective nature. For the single-objective case - e.g. predictive scheduling with the goal of jointly resembling a wanted target schedule -fully decentralized algorithms with self-organizing agents exist. We extend this paradigm towards fully decentralized agent-based multi-objective scheduling for energy resources e.g. in virtual power plants for which special local constraint-handling techniques are needed. We integrate algorithmic elements from the well-known S-metric selection evolutionary multi-objective algorithm into a gossiping-based combinatorial optimization heuristic that works with agents for the single-objective case and derive a number of challenges that have to be solved for fully decentralized multi-objective optimization. We present a first solution approach based on the combinatorial optimization heuristics for agents and demonstrate viability and applicability in several simulation scenarios.","PeriodicalId":168208,"journal":{"name":"2019 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116514521","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

An Efficient Exhaustive Search for the Discretizable Distance Geometry Problem with Interval Data 区间数据可离散距离几何问题的高效穷举搜索

2019 Federated Conference on Computer Science and Information Systems (FedCSIS) Pub Date : 2019-09-26 DOI: 10.15439/2019F62

A. Mucherino, Jung-Hsin Lin

{"title":"An Efficient Exhaustive Search for the Discretizable Distance Geometry Problem with Interval Data","authors":"A. Mucherino, Jung-Hsin Lin","doi":"10.15439/2019F62","DOIUrl":"https://doi.org/10.15439/2019F62","url":null,"abstract":"The Distance Geometry Problem (DGP) asks whether a simple weighted undirected graph can be realized in a given space (generally Euclidean) so that a given set of distance constraints (associated to the edges of the graph) is satisfied. The Discretizable DGP (DDGP) represents a subclass of instances where the search space can be reduced to a discrete domain having the structure of a tree. In the ideal case where all distances are precise, the tree is binary and one singleton, representing one possible position for a vertex of the graph, is associated to every tree node. When the distance information is however not precise, the uncertainty on the distance values implies that a three-dimensional region of the search space needs to be assigned to some nodes of the tree. By using a recently proposed coarse-grained representation for DDGP solutions, we extend in this work the branch-and-prune (BP) algorithm so that it can efficiently perform an exhaustive search of the search domain, even when the uncertainty on the distances is important. Instead of associating singletons to nodes, we consider a pair consisting of a box and of a most-likely position for the vertex in this box. Initial estimations of the vertex positions in every box can be subsequently refined by using local optimization. The aim of this paper is two-fold: (i) we propose a new simple method for the computation of the three-dimensional boxes to be associated to the nodes of the search tree; (ii) we introduce the resolution parameter ρ, with the aim of controling the similarity between pairs of solutions in the solution set. Some initial computational experiments show that our algorithm extension, differently from previously proposed variants of the BP algorithm, is actually able to terminate the enumeration of the solution set by providing solutions that dilrer from one another accordingly to the given resolution parameter.","PeriodicalId":168208,"journal":{"name":"2019 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"44 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116505380","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}

引用次数: 4

Using Blockchain to Access Cloud Services: A Case of Financial Service Application 使用区块链访问云服务:一个金融服务应用案例

2019 Federated Conference on Computer Science and Information Systems (FedCSIS) Pub Date : 2019-09-26 DOI: 10.15439/2019F296

Min-Han Tseng, S. Chang, Tzu-Yin Kuo

引用次数: 6

Identification of Heuristics for Assessing the Usability of Websites of Public Administration Units 公共行政单位网站可用性评估的启发式识别

2019 Federated Conference on Computer Science and Information Systems (FedCSIS) Pub Date : 2019-09-26 DOI: 10.15439/2019F307

Helena Dudycz, Lukasz Krawiec

{"title":"Identification of Heuristics for Assessing the Usability of Websites of Public Administration Units","authors":"Helena Dudycz, Lukasz Krawiec","doi":"10.15439/2019F307","DOIUrl":"https://doi.org/10.15439/2019F307","url":null,"abstract":"A very important aspect of modern websites is their usability. Thanks to modern, and constantly developing technologies it is possible to create user-friendly services for each user. The usefulness of online services may be considered in terms of their functionality, clarity, and accessibility. It is particularly important that these criteria are met by public administration websites. The aim of this paper is to present the most common usability errors identified on the websites of public administration units as well as to indicate the links between particular types of problems and traditional heuristics of Jakob Nielsen. The survey was conducted by evaluating the websites of the Public Information Bulletin in Poland (BIP, which stands for “Biuletyn Informacji Publicznej”), which are supposed to provide universal access to public information by the citizens of the country. A heuristic method (based on J. Nielsen’s heuristics) was used to evaluate 60 websites. The errors obtained were grouped into 14 categories. Each of the error groups was assessed by an expert in terms of its importance for the overall assessment of the website’s usefulness. The analysis of relations between the identified categories of errors and heuristics of Jakob Nielsen indicates a need for specifying heuristics in the context of evaluating the usability and availability of public administration websites.","PeriodicalId":168208,"journal":{"name":"2019 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132213700","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}

引用次数: 4

Spline-Wavelet Bent Robust Codes 样条-小波弯曲鲁棒编码

2019 Federated Conference on Computer Science and Information Systems (FedCSIS) Pub Date : 2019-09-26 DOI: 10.15439/2019F134

A. Levina, G. Ryaskin, I. Zikratov

引用次数: 2

Deep Learning Hyper-parameter Tuning for Sentiment Analysis in Twitter based on Evolutionary Algorithms 基于进化算法的Twitter情感分析深度学习超参数调优

2019 Federated Conference on Computer Science and Information Systems (FedCSIS) Pub Date : 2019-09-26 DOI: 10.15439/2019F183

Eugenio Martínez-Cámara, Nuria Rodríguez Barroso, A. R. Moya, José Alberto Fernández, Elena Romero, Francisco Herrera

引用次数: 9

Motivations for BPM Adoption: Initial Taxonomy based on Online Success Stories 采用BPM的动机:基于在线成功案例的初步分类

2019 Federated Conference on Computer Science and Information Systems (FedCSIS) Pub Date : 2019-09-26 DOI: 10.15439/2019F229

Renata Gabryelczyk, Aneta Biernikowicz

引用次数: 1

Using Relay Nodes in Wireless Sensor Networks: A Review 无线传感器网络中中继节点的应用综述

2019 Federated Conference on Computer Science and Information Systems (FedCSIS) Pub Date : 2019-09-26 DOI: 10.15439/2019F26

Mustapha Réda Senouci, Mostefa Zafer, M. Aissani

引用次数: 1

Factors Influencing the Intended Adoption of Digital Transformation: A South African Case Study 影响数字化转型预期采用的因素:一个南非案例研究

2019 Federated Conference on Computer Science and Information Systems (FedCSIS) Pub Date : 2019-09-26 DOI: 10.15439/2019F166

Jean-Paul Van Belle, R. Dyk

引用次数: 17

Ant Colony optimization Algorithm for Workforce Planning: Influence of the Evaporation Parameter 劳动力规划的蚁群优化算法:蒸发参数的影响

2019 Federated Conference on Computer Science and Information Systems (FedCSIS) Pub Date : 2019-09-26 DOI: 10.15439/2019F300

S. Fidanova, Gabriel Luque, O. Roeva, M. Ganzha

引用次数: 1