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.
{"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}
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.
{"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}
Most cloud providers use centralized servers to manage data. However, centralized servers still suffer the risks of single point of failure and data theft. We add a blockchain to the cloud service and propose a new architecture to manage data. Using blockchain as a connector to utilize the tamperproof, traceable, and data-sharing features of the blockchain to ensure that the transaction data are properly stored in each node. We use the stock simulation trading service to extend and divide the research design into two levels, namely, system and application services. First, we directly write the data into the blockchain. Second, we alternatively store the data in the cloud and then write it into the blockchain. Finally, the two versions are compared and analyzed to investigate their feasibility and performance. At the application service, we implement the smart contract for the existing stock transaction process to achieve real-time settlement.
{"title":"Using Blockchain to Access Cloud Services: A Case of Financial Service Application","authors":"Min-Han Tseng, S. Chang, Tzu-Yin Kuo","doi":"10.15439/2019F296","DOIUrl":"https://doi.org/10.15439/2019F296","url":null,"abstract":"Most cloud providers use centralized servers to manage data. However, centralized servers still suffer the risks of single point of failure and data theft. We add a blockchain to the cloud service and propose a new architecture to manage data. Using blockchain as a connector to utilize the tamperproof, traceable, and data-sharing features of the blockchain to ensure that the transaction data are properly stored in each node. We use the stock simulation trading service to extend and divide the research design into two levels, namely, system and application services. First, we directly write the data into the blockchain. Second, we alternatively store the data in the cloud and then write it into the blockchain. Finally, the two versions are compared and analyzed to investigate their feasibility and performance. At the application service, we implement the smart contract for the existing stock transaction process to achieve real-time settlement.","PeriodicalId":168208,"journal":{"name":"2019 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"65 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":"132671477","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}
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.
现代网站的一个非常重要的方面是可用性。由于现代和不断发展的技术，有可能为每个用户创建用户友好的服务。在线服务的有用性可以根据其功能、清晰度和可访问性来考虑。特别重要的是，公共行政网站必须符合这些标准。本文的目的是介绍公共行政单位网站上最常见的可用性错误，并指出特定类型的问题与Jakob Nielsen的传统启发式之间的联系。这项调查是通过评估波兰公共信息公报(BIP，即“Biuletyn Informacji Publicznej”)的网站进行的，这些网站本应为该国公民提供普遍获取公共信息的途径。采用启发式方法(基于J. Nielsen’s heuristics)对60个网站进行评价。得到的误差分为14类。每个错误组都由专家根据其对网站有用性的总体评估的重要性进行评估。对Jakob Nielsen的错误分类与启发式方法之间关系的分析表明，在评估公共行政网站的可用性和可用性的背景下，需要指定启发式方法。
{"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}
In the classic algorithm, palmprint recognition requires extraction of palmprint features before classification and recognition, which will affect the recognition rate. To solve this problem, this paper uses the convolutional neural network (CNN) structure Alexnet to realize palmprint recognition. First, according to the characteristics of the geometric shape of palmprint, the ROI area of palmprint was cut out. Then the ROI area after processing is taken as input of convolutional neural network. Next the PRelu activation function is used to train the network to select the best learning rate and super parameters. Finally, the palmprint was classified and identified. The method was applied to PolyU Multi-Spectral Palmprint Image Database and PolyU 2D+3D Palmprint Database, and the recognition rate of a single spectrum was up to 99.99%.
{"title":"Palmprint Recognition Based on Convolutional Neural Network-Alexnet","authors":"Weiyong Gong, Xinman Zhang, Bohua Deng, Xuebin Xu","doi":"10.15439/2019F248","DOIUrl":"https://doi.org/10.15439/2019F248","url":null,"abstract":"In the classic algorithm, palmprint recognition requires extraction of palmprint features before classification and recognition, which will affect the recognition rate. To solve this problem, this paper uses the convolutional neural network (CNN) structure Alexnet to realize palmprint recognition. First, according to the characteristics of the geometric shape of palmprint, the ROI area of palmprint was cut out. Then the ROI area after processing is taken as input of convolutional neural network. Next the PRelu activation function is used to train the network to select the best learning rate and super parameters. Finally, the palmprint was classified and identified. The method was applied to PolyU Multi-Spectral Palmprint Image Database and PolyU 2D+3D Palmprint Database, and the recognition rate of a single spectrum was up to 99.99%.","PeriodicalId":168208,"journal":{"name":"2019 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"16 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":"134608241","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}
Road networks exist in the form of polylines with attributes within the GIS databases. Such a representation renders the geographic data impracticable for 3D road traffic simulation. In this work, we propose a method to transform raw GIS data into a realistic, operational model for real-time road traffic simulation. For instance, the proposed raw to simulation ready data transformation is achieved through several curvature estimation, interpolation/approximation, and clustering schemes. The obtained results show the performance of our approach and prove its adequacy to real traffic simulation scenario as can be seen in this video1.
{"title":"A GIS Data Realistic Road Generation Approach for Traffic Simulation","authors":"Yacine Amara, Abdenour Amamra, Yasmine Daheur, Lamia Saichi","doi":"10.15439/2019F223","DOIUrl":"https://doi.org/10.15439/2019F223","url":null,"abstract":"Road networks exist in the form of polylines with attributes within the GIS databases. Such a representation renders the geographic data impracticable for 3D road traffic simulation. In this work, we propose a method to transform raw GIS data into a realistic, operational model for real-time road traffic simulation. For instance, the proposed raw to simulation ready data transformation is achieved through several curvature estimation, interpolation/approximation, and clustering schemes. The obtained results show the performance of our approach and prove its adequacy to real traffic simulation scenario as can be seen in this video1.","PeriodicalId":168208,"journal":{"name":"2019 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"32 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":"132034274","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}
In this paper we present the results of an opinion survey among 52 agile practitioners who evaluated the importance of 26 selected elements of the agile mindset to the effectiveness of an agile team. In total, we have identified 70 unique agile mindset elements based on 11 literature sources and 5 interviews with industry experts. 7 elements belonged to the “support for business goals” category, 20 to the “relationships within the team” category, 24 to the “individual features” category, and 19 to the “organization of work” category. Our survey shows the relative importance of the selected 26 agile mindset elements according to our respondents which is not fully consistent with the principles behind the Agile Manifesto.
{"title":"On the Agile Mindset of an Effective Team – An Industrial Opinion Survey","authors":"J. Miler, Paulina Gaida","doi":"10.15439/2019F198","DOIUrl":"https://doi.org/10.15439/2019F198","url":null,"abstract":"In this paper we present the results of an opinion survey among 52 agile practitioners who evaluated the importance of 26 selected elements of the agile mindset to the effectiveness of an agile team. In total, we have identified 70 unique agile mindset elements based on 11 literature sources and 5 interviews with industry experts. 7 elements belonged to the “support for business goals” category, 20 to the “relationships within the team” category, 24 to the “individual features” category, and 19 to the “organization of work” category. Our survey shows the relative importance of the selected 26 agile mindset elements according to our respondents which is not fully consistent with the principles behind the Agile Manifesto.","PeriodicalId":168208,"journal":{"name":"2019 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"266 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":"116042051","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}
Support Vector Regression (SVR) is a powerful supervised machine learning model especially well suited to the normalized or binarized data. However, its quadratic complexity in the number of training examples eliminates it from training on large datasets, especially high dimensional with frequent retraining requirement. We propose a simple two-stage greedy selection of training data for SVR to maximize its validation set accuracy at the minimum number of training examples and illustrate the performance of such strategy in the context of Clash Royale Challenge 2019, concerned with efficient decks’ win rate prediction. Hundreds of thousands of labelled data examples were reduced to hundreds, optimized SVR was trained on to maximize the validation R2 score. The proposed model scored the first place in the Cash Royale 2019 challenge, outperforming over hundred of competitive teams from around the world.
{"title":"Greedy Incremental Support Vector Regression","authors":"D. Ruta, Ling Cen, Q. Vu","doi":"10.15439/2019F364","DOIUrl":"https://doi.org/10.15439/2019F364","url":null,"abstract":"Support Vector Regression (SVR) is a powerful supervised machine learning model especially well suited to the normalized or binarized data. However, its quadratic complexity in the number of training examples eliminates it from training on large datasets, especially high dimensional with frequent retraining requirement. We propose a simple two-stage greedy selection of training data for SVR to maximize its validation set accuracy at the minimum number of training examples and illustrate the performance of such strategy in the context of Clash Royale Challenge 2019, concerned with efficient decks’ win rate prediction. Hundreds of thousands of labelled data examples were reduced to hundreds, optimized SVR was trained on to maximize the validation R2 score. The proposed model scored the first place in the Cash Royale 2019 challenge, outperforming over hundred of competitive teams from around the world.","PeriodicalId":168208,"journal":{"name":"2019 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"31 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":"123760817","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 main aim of this research in progress is to develop an initial taxonomy of motivations underlying BPM (Business Process Management) adoption in organizations. This initial study is based on the analysis of 75 customer cases and success stories published on-line by BPM system vendors and BPM consulting companies. We used the mixed conceptual/empirical approach to taxonomy development basing the empirical analysis on descriptive data-coding canon. As the result of our research we present an initial taxonomy of the motivations for the adoption and use of BPM that consists of three dimensions: the organizational scope of a BPM initiative (enterprise-wide, process-focused or task oriented); presence (or not) of the information technology component; and, the importance of external versus internal drivers motivating a BPM initiative. Proposed initial taxonomy will be developed in further research and will serve to link the motivation to change with the expected benefits of BPM adoption.
{"title":"Motivations for BPM Adoption: Initial Taxonomy based on Online Success Stories","authors":"Renata Gabryelczyk, Aneta Biernikowicz","doi":"10.15439/2019F229","DOIUrl":"https://doi.org/10.15439/2019F229","url":null,"abstract":"The main aim of this research in progress is to develop an initial taxonomy of motivations underlying BPM (Business Process Management) adoption in organizations. This initial study is based on the analysis of 75 customer cases and success stories published on-line by BPM system vendors and BPM consulting companies. We used the mixed conceptual/empirical approach to taxonomy development basing the empirical analysis on descriptive data-coding canon. As the result of our research we present an initial taxonomy of the motivations for the adoption and use of BPM that consists of three dimensions: the organizational scope of a BPM initiative (enterprise-wide, process-focused or task oriented); presence (or not) of the information technology component; and, the importance of external versus internal drivers motivating a BPM initiative. Proposed initial taxonomy will be developed in further research and will serve to link the motivation to change with the expected benefits of BPM adoption.","PeriodicalId":168208,"journal":{"name":"2019 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"18 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":"123985839","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}
This study is a part research on the effect of information and communication technologies (ICT) adoption on sustainable development in the enterprises’ context [1][3]. Its main purpose is to identify parameters stimulating the progress of ICT adoption and sustainable development and assess the two constructs based on these parameters. The identified parameters of ICT adoption are grouped into four categories i.e., ICT outlay, information culture, ICT management, and ICT quality, whereas the parameters of sustainable development are classified into ecological, economic, sociocultural, and political sustainability categories. This study employs a quantitative approach and descriptive statistics are employed to evaluate the levels of ICT adoption and sustainable development. The survey questionnaire was used and data collected from 394 enterprises were analyzed. The research findings reveal that digital and socio-cultural competences of employees and managers, financial capabilities ensuring ICT projects as well as law regulations associated with ICT adoption, and information security were at the highest level within enterprises. However, the lowest level was specific for BI and ERP system adoption as well as the adoption of latest management concepts and the exploitation of synergies between national ICT projects and own ones. Moreover, the improvement of efficiency and effectiveness of customer services, better and more efficient organization of work, the enhancement of customer satisfaction and loyalty and the acquirement of new customers and markets were at the highest level within enterprises. However, the lowest level was specific for enterprises’ participation in the democratic public decision-making as well as energy savings and environmental protection. This study advances ongoing research on ICT adoption and sustainable development by exploring parameters which can be used to describe and assess the levels of ICT adoption and sustainable development in the context of enterprises. Moreover, these parameters help clarify areas that need further improvement and stimulate the progress of ICT adoption and sustainable development.
{"title":"Exploring Levels of ICT Adoption and Sustainable Development - The Case of Polish Enterprises","authors":"E. Ziemba","doi":"10.15439/2019F145","DOIUrl":"https://doi.org/10.15439/2019F145","url":null,"abstract":"This study is a part research on the effect of information and communication technologies (ICT) adoption on sustainable development in the enterprises’ context [1][3]. Its main purpose is to identify parameters stimulating the progress of ICT adoption and sustainable development and assess the two constructs based on these parameters. The identified parameters of ICT adoption are grouped into four categories i.e., ICT outlay, information culture, ICT management, and ICT quality, whereas the parameters of sustainable development are classified into ecological, economic, sociocultural, and political sustainability categories. This study employs a quantitative approach and descriptive statistics are employed to evaluate the levels of ICT adoption and sustainable development. The survey questionnaire was used and data collected from 394 enterprises were analyzed. The research findings reveal that digital and socio-cultural competences of employees and managers, financial capabilities ensuring ICT projects as well as law regulations associated with ICT adoption, and information security were at the highest level within enterprises. However, the lowest level was specific for BI and ERP system adoption as well as the adoption of latest management concepts and the exploitation of synergies between national ICT projects and own ones. Moreover, the improvement of efficiency and effectiveness of customer services, better and more efficient organization of work, the enhancement of customer satisfaction and loyalty and the acquirement of new customers and markets were at the highest level within enterprises. However, the lowest level was specific for enterprises’ participation in the democratic public decision-making as well as energy savings and environmental protection. This study advances ongoing research on ICT adoption and sustainable development by exploring parameters which can be used to describe and assess the levels of ICT adoption and sustainable development in the context of enterprises. Moreover, these parameters help clarify areas that need further improvement and stimulate the progress of ICT adoption and sustainable development.","PeriodicalId":168208,"journal":{"name":"2019 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"30 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":"127956882","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
扫码关注我们
求助内容：
应助结果提醒方式：