Pub Date : 2015-12-12DOI: 10.1109/INTELCIS.2015.7397225
J. Aizpurua, V. Catterson
Prognostics aims to improve asset availability through intelligent maintenance actions. Up-to-date remaining useful life predictions enable the optimization of maintenance planning. Verification of prognostics techniques aims to analyze if the prognostics application meets the design requirements. Online prognostics applications depend on the data-gathering hardware architecture to perform correct prognostics predictions. Accordingly, when verifying prognostics requirements compliance, it is necessary to include the effect of hardware failures on prognostics predictions. In this paper we investigate the use of formal verification techniques for the integrated verification of prognostics applications including hardware and software components. Focusing on the probabilistic model-checking approach, a case study from the power industry shows the validity of the proposed framework.
{"title":"On the use of probabilistic model-checking for the verification of prognostics applications","authors":"J. Aizpurua, V. Catterson","doi":"10.1109/INTELCIS.2015.7397225","DOIUrl":"https://doi.org/10.1109/INTELCIS.2015.7397225","url":null,"abstract":"Prognostics aims to improve asset availability through intelligent maintenance actions. Up-to-date remaining useful life predictions enable the optimization of maintenance planning. Verification of prognostics techniques aims to analyze if the prognostics application meets the design requirements. Online prognostics applications depend on the data-gathering hardware architecture to perform correct prognostics predictions. Accordingly, when verifying prognostics requirements compliance, it is necessary to include the effect of hardware failures on prognostics predictions. In this paper we investigate the use of formal verification techniques for the integrated verification of prognostics applications including hardware and software components. Focusing on the probabilistic model-checking approach, a case study from the power industry shows the validity of the proposed framework.","PeriodicalId":6478,"journal":{"name":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","volume":"51 1","pages":"7-13"},"PeriodicalIF":0.0,"publicationDate":"2015-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84362298","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 : 2015-12-01DOI: 10.1109/INTELCIS.2015.7397236
Cheonin Oh, K. Han
This paper1 suggests a targeted advertising system using an audience recognition technique suitable for a Smart TV environment. The proposed system detects different viewers in front of a TV and provides different advertisements depending on the detection results. Audience recognition consists of procedures for detecting the face area and features, as well as an identification procedure; in addition, based on the results of the recognition, the viewing behaviors are extracted. In regard to the extraction of the face area and the facial features, algorithms for a fast and precisely trace even when the face is rotated, and for measuring the rotating angle of the face and the open-close status of the eyes, are described. All recognition procedures were designed by considering the viewing distance and changes in lighting. In addition, a practical targeted advertising service and various other measurement indexes related to advertising effectiveness, along with an example application used to control the equipment and content by applying identification information of the recognized audience and their viewing behavior information, are represented.
{"title":"Design and implementation of a targeted advertising system based on an audience recognition scheme for Smart TV","authors":"Cheonin Oh, K. Han","doi":"10.1109/INTELCIS.2015.7397236","DOIUrl":"https://doi.org/10.1109/INTELCIS.2015.7397236","url":null,"abstract":"This paper1 suggests a targeted advertising system using an audience recognition technique suitable for a Smart TV environment. The proposed system detects different viewers in front of a TV and provides different advertisements depending on the detection results. Audience recognition consists of procedures for detecting the face area and features, as well as an identification procedure; in addition, based on the results of the recognition, the viewing behaviors are extracted. In regard to the extraction of the face area and the facial features, algorithms for a fast and precisely trace even when the face is rotated, and for measuring the rotating angle of the face and the open-close status of the eyes, are described. All recognition procedures were designed by considering the viewing distance and changes in lighting. In addition, a practical targeted advertising service and various other measurement indexes related to advertising effectiveness, along with an example application used to control the equipment and content by applying identification information of the recognized audience and their viewing behavior information, are represented.","PeriodicalId":6478,"journal":{"name":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","volume":"17 1","pages":"293-299"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73907132","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 : 2015-12-01DOI: 10.1109/INTELCIS.2015.7397202
Timo Sigwarth, K. Loewe, Eberhard Beck, Lutz Pelchen, T. Schrader
Clinical processes tend to be highly complex which results in 5%-10% erroneous procedures. A process risk analysis through the medical risk management is mostly retrospectively, therefore it's commonly not suited to prevent errors before occurring. In technical domains prospective analysis methods, like Hazards & Operability study (HAZOP study), are widely used, but the adaption of these methods for medical processes is rather difficult.
{"title":"Conceptual ontology of prospective risk analysis in medical environments - the OPT-Model-Ontology","authors":"Timo Sigwarth, K. Loewe, Eberhard Beck, Lutz Pelchen, T. Schrader","doi":"10.1109/INTELCIS.2015.7397202","DOIUrl":"https://doi.org/10.1109/INTELCIS.2015.7397202","url":null,"abstract":"Clinical processes tend to be highly complex which results in 5%-10% erroneous procedures. A process risk analysis through the medical risk management is mostly retrospectively, therefore it's commonly not suited to prevent errors before occurring. In technical domains prospective analysis methods, like Hazards & Operability study (HAZOP study), are widely used, but the adaption of these methods for medical processes is rather difficult.","PeriodicalId":6478,"journal":{"name":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","volume":"23 1","pages":"88-93"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78247737","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 : 2015-12-01DOI: 10.1109/INTELCIS.2015.7397181
Hans-Dieter Burkhard
Robots will change our life dramatically. People are interested to know more about Robotics and AI. Teaching has to regard these developments. While learning by doing has great advantages, experimenting with real robots is limited by the available resources: Complex hardware is costly, and it needs time and experience for setup and maintenance. Simulated robots can be used as alternative. Our RoboNewbie project is a basic framework for experimenting with simulated robots. It serves as an inspiration for beginners, and it provides room for many challenging experiments. The RoboNewbie agents run in the simulation environment of SimSpark RCSS, the official RoboCup 3D simulator, where the simulated robots are models of the humanoid Robot NAO of the French Company Aldebaran. Different example agents provide easily understandable interfaces to simulated sensors and effectors of the robot as well as simple control structures. The framework has been successfully used at different courses where the participants needed only few hours to understand the usage of the framework and to develop own agents for different tasks.
{"title":"Simulated humanoid robots for e-learning","authors":"Hans-Dieter Burkhard","doi":"10.1109/INTELCIS.2015.7397181","DOIUrl":"https://doi.org/10.1109/INTELCIS.2015.7397181","url":null,"abstract":"Robots will change our life dramatically. People are interested to know more about Robotics and AI. Teaching has to regard these developments. While learning by doing has great advantages, experimenting with real robots is limited by the available resources: Complex hardware is costly, and it needs time and experience for setup and maintenance. Simulated robots can be used as alternative. Our RoboNewbie project is a basic framework for experimenting with simulated robots. It serves as an inspiration for beginners, and it provides room for many challenging experiments. The RoboNewbie agents run in the simulation environment of SimSpark RCSS, the official RoboCup 3D simulator, where the simulated robots are models of the humanoid Robot NAO of the French Company Aldebaran. Different example agents provide easily understandable interfaces to simulated sensors and effectors of the robot as well as simple control structures. The framework has been successfully used at different courses where the participants needed only few hours to understand the usage of the framework and to develop own agents for different tasks.","PeriodicalId":6478,"journal":{"name":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","volume":"47 1","pages":"1-1"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82980167","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 : 2015-12-01DOI: 10.1109/INTELCIS.2015.7397186
M. Nikitchenko
Summary form only given. Process of information system development consists of several phases including, in particular, system analysis, specification, design, and implementation. Each of these phases is based on some abstractions that can be roughly divided into two groups of general and specific abstractions respectively. In this talk we address to such general abstractions as intensionality, compositionality, and nominativity. Intensionality is understood in the traditional sense as a counterpart to extensionality that together complete each other and define the main aspects of notions in their integrity. Compositionality means that a system is constructed of smaller subsystems with the help of special construction operations called compositions. Nominativity emphasizes the importance of naming relations for system aspects description. We analyze and illustrate the use of the above mentioned abstractions in different phases of system development. Considering conventional mathematical formalisms we admit that they are based on the extensionality principle that restricts and complicates usage of such formalisms in system development. Therefore we construct formal mathematical structures based on the principles of intensionality, compositionality, and nominativity. These structures can be considered generalizations of traditional notions of algebras and logics for classes of "dynamic" data and functions. Introduction of such formalisms permits us to define also a special kind of intensionalized computability that better reflects specifics of executable components of information systems. We compare the constructed formalisms with the existing ones and demonstrate that they a rather expressive and more adequate for information system development.
{"title":"Intensionality, compositionality, and nominativity in information system development","authors":"M. Nikitchenko","doi":"10.1109/INTELCIS.2015.7397186","DOIUrl":"https://doi.org/10.1109/INTELCIS.2015.7397186","url":null,"abstract":"Summary form only given. Process of information system development consists of several phases including, in particular, system analysis, specification, design, and implementation. Each of these phases is based on some abstractions that can be roughly divided into two groups of general and specific abstractions respectively. In this talk we address to such general abstractions as intensionality, compositionality, and nominativity. Intensionality is understood in the traditional sense as a counterpart to extensionality that together complete each other and define the main aspects of notions in their integrity. Compositionality means that a system is constructed of smaller subsystems with the help of special construction operations called compositions. Nominativity emphasizes the importance of naming relations for system aspects description. We analyze and illustrate the use of the above mentioned abstractions in different phases of system development. Considering conventional mathematical formalisms we admit that they are based on the extensionality principle that restricts and complicates usage of such formalisms in system development. Therefore we construct formal mathematical structures based on the principles of intensionality, compositionality, and nominativity. These structures can be considered generalizations of traditional notions of algebras and logics for classes of \"dynamic\" data and functions. Introduction of such formalisms permits us to define also a special kind of intensionalized computability that better reflects specifics of executable components of information systems. We compare the constructed formalisms with the existing ones and demonstrate that they a rather expressive and more adequate for information system development.","PeriodicalId":6478,"journal":{"name":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","volume":"34 1","pages":"1-2"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78258562","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 : 2015-12-01DOI: 10.1109/INTELCIS.2015.7397276
Dr Noaman M. Ali, A. Gadallah, H. Hefny
Nowadays, users rely on the web for information gathering. Accordingly, web usage mining becomes one important subject of research. Such research area covers prediction of user near future intentions, web-based personalized services, customer profiling, and adaptive web sites. Web page prediction is strongly limited by the nature of web logs, the intrinsic complexity of the problem and the tight efficiency requirements. This paper proposes a hybrid page ranking model based on web usage mining technique by exploiting session data of users, to enhance the recommendations of the next candidate web page to be accessed. The proposed approach represents a combination between two page ranking approaches. The first one computes the frequency ratio indicating the number of occurrences of each page in the search result. On the other hand, the second approach computes the coverage ratio from similar behavior patterns. As a result of the proposed approach, a set of candidate pages are ranked and the page with highest rate is recommended. The proposed approach has been tested on real data collected and extracted from the web server log file of CTI main web server.
{"title":"A hybrid recommendation model for web navigation","authors":"Dr Noaman M. Ali, A. Gadallah, H. Hefny","doi":"10.1109/INTELCIS.2015.7397276","DOIUrl":"https://doi.org/10.1109/INTELCIS.2015.7397276","url":null,"abstract":"Nowadays, users rely on the web for information gathering. Accordingly, web usage mining becomes one important subject of research. Such research area covers prediction of user near future intentions, web-based personalized services, customer profiling, and adaptive web sites. Web page prediction is strongly limited by the nature of web logs, the intrinsic complexity of the problem and the tight efficiency requirements. This paper proposes a hybrid page ranking model based on web usage mining technique by exploiting session data of users, to enhance the recommendations of the next candidate web page to be accessed. The proposed approach represents a combination between two page ranking approaches. The first one computes the frequency ratio indicating the number of occurrences of each page in the search result. On the other hand, the second approach computes the coverage ratio from similar behavior patterns. As a result of the proposed approach, a set of candidate pages are ranked and the page with highest rate is recommended. The proposed approach has been tested on real data collected and extracted from the web server log file of CTI main web server.","PeriodicalId":6478,"journal":{"name":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","volume":"40 1","pages":"552-560"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78070584","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 : 2015-12-01DOI: 10.1109/INTELCIS.2015.7397290
Mahmoud Mounir, M. Hamdy
The problem of finding groups of co-regulated genes is considered one of the major challenges in the analysis of gene expression data. Biclustering may be considered as one of the main techniques to analyze these data. Biclustering is a non-supervised technique outperforms the traditional clustering techniques because it can group both genes and conditions in the same time. A gene or condition may belong to more than one bicluster and hence to more than biological function or process. In this survey, we introduced some definitions of the biclustering with its mathematical model after that we reviewed some biclustering techniques based on the type of biclusters they can find; finally a set of validation measures were introduced to validate the biclustering techniques emphasizing the biological measures.
{"title":"On biclustering of gene expression data","authors":"Mahmoud Mounir, M. Hamdy","doi":"10.1109/INTELCIS.2015.7397290","DOIUrl":"https://doi.org/10.1109/INTELCIS.2015.7397290","url":null,"abstract":"The problem of finding groups of co-regulated genes is considered one of the major challenges in the analysis of gene expression data. Biclustering may be considered as one of the main techniques to analyze these data. Biclustering is a non-supervised technique outperforms the traditional clustering techniques because it can group both genes and conditions in the same time. A gene or condition may belong to more than one bicluster and hence to more than biological function or process. In this survey, we introduced some definitions of the biclustering with its mathematical model after that we reviewed some biclustering techniques based on the type of biclusters they can find; finally a set of validation measures were introduced to validate the biclustering techniques emphasizing the biological measures.","PeriodicalId":6478,"journal":{"name":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","volume":"29 1","pages":"641-648"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82646571","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 : 2015-12-01DOI: 10.1109/INTELCIS.2015.7397271
R. Yasotha, E. Charles
During the last two decades the number of text documents in digital form has grown enormously. It is necessary to categorize documents into topics and sub topics for easy retrieval. Manual categorization of text documents can be done only by experts and it is a time consuming task. As a consequence, it is of great practical importance to be able to automatically organize and classify documents. There are two approaches, rule-based and machine learning-based, that are used to automate classification task. Both have some limitations. Rules may conflict each other and have to be reconstructed when a target domain changes, are such two limitations in the rule based approaches. Machine learning approaches require proper training data and they do not accountable with the classification results. Motivated by such limitations, this paper proposes a Latent Dirichlet Allocation (LDA) based approach to automatically classify text documents. In order to develop and test the proposed approach on a realistic set up, ACM (Association for Computing Machinery) Computing Classification System (CCS) is selected as the target platform and 9100 computer science related articles categorized under ACM-CCS were selected. The experimental results show that the proposed approach is effective for classifying text documents and is applicable to a domain with large number of categories in multiple levels.
{"title":"Automated text document categorization","authors":"R. Yasotha, E. Charles","doi":"10.1109/INTELCIS.2015.7397271","DOIUrl":"https://doi.org/10.1109/INTELCIS.2015.7397271","url":null,"abstract":"During the last two decades the number of text documents in digital form has grown enormously. It is necessary to categorize documents into topics and sub topics for easy retrieval. Manual categorization of text documents can be done only by experts and it is a time consuming task. As a consequence, it is of great practical importance to be able to automatically organize and classify documents. There are two approaches, rule-based and machine learning-based, that are used to automate classification task. Both have some limitations. Rules may conflict each other and have to be reconstructed when a target domain changes, are such two limitations in the rule based approaches. Machine learning approaches require proper training data and they do not accountable with the classification results. Motivated by such limitations, this paper proposes a Latent Dirichlet Allocation (LDA) based approach to automatically classify text documents. In order to develop and test the proposed approach on a realistic set up, ACM (Association for Computing Machinery) Computing Classification System (CCS) is selected as the target platform and 9100 computer science related articles categorized under ACM-CCS were selected. The experimental results show that the proposed approach is effective for classifying text documents and is applicable to a domain with large number of categories in multiple levels.","PeriodicalId":6478,"journal":{"name":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","volume":"22 1","pages":"522-528"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83471233","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 : 2015-12-01DOI: 10.1109/INTELCIS.2015.7397262
Aya Zaki, M. Attia, Doaa Hegazy, S. Amin
Research has focused on static large graph management. However, most of real-world networks evolve with time. Managing these evolving networks has attracted much attention in recent years. The networks' evolved data can be kept in a dynamic graph to improve the expressiveness and the quality of search queries as well as snapshot(s) retrieval. Storing the continuous evolution of the network in a dynamic graph makes its storage size grow. Existing dynamic graph models try to limit their storage by eliminating redundant data. However, their update time increases due to the elimination step. This illustrates that there is a tradeoff between the used storage and the update time. In this work, we address the problems of improving the update time of the networks' evolved data without increasing the storage redundancy as well as minimizing the needed memory storage. This paper merges the materialization technique with the distributed graph over servers. This merge reduces the update time and minimize the needed memory storage in an efficient manner as well as providing results with a better quality.
{"title":"Efficient distributed dynamic graph system","authors":"Aya Zaki, M. Attia, Doaa Hegazy, S. Amin","doi":"10.1109/INTELCIS.2015.7397262","DOIUrl":"https://doi.org/10.1109/INTELCIS.2015.7397262","url":null,"abstract":"Research has focused on static large graph management. However, most of real-world networks evolve with time. Managing these evolving networks has attracted much attention in recent years. The networks' evolved data can be kept in a dynamic graph to improve the expressiveness and the quality of search queries as well as snapshot(s) retrieval. Storing the continuous evolution of the network in a dynamic graph makes its storage size grow. Existing dynamic graph models try to limit their storage by eliminating redundant data. However, their update time increases due to the elimination step. This illustrates that there is a tradeoff between the used storage and the update time. In this work, we address the problems of improving the update time of the networks' evolved data without increasing the storage redundancy as well as minimizing the needed memory storage. This paper merges the materialization technique with the distributed graph over servers. This merge reduces the update time and minimize the needed memory storage in an efficient manner as well as providing results with a better quality.","PeriodicalId":6478,"journal":{"name":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","volume":"31 1","pages":"465-471"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87231396","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 : 2015-12-01DOI: 10.1109/INTELCIS.2015.7397229
Inete Ielite, G. Olevsky, Timurs Safiuļins
The article analyzes stakeholders in the city, conducted in order to identify organisations of particular value to the creation and delivery of the sustainable energy policy for smart cities i.e. enhanced Sustainable Energy Action Plan (SEAP). Using the information gathered in the stakeholder analysis, Riga, the capital of Republic of Latvia, has created a stakeholder engagement plan to gather and coordinate the key stakeholders' resources and knowledge for the benefit of the city, and for the development, implementation, monitoring and ongoing revision of the energy policy for the smart city i.e. SEAP. Different approaches to stakeholder communication and engagement planning have been used, based on specific city context, including history of engagement and current plans and ambitions. Riga stakeholders have been identified and prioritised using a matrix tool, allowing stakeholders to be grouped according to their importance for the enhanced SEAP and level of interest or engagement in the city. Riga has completed public consultation roundtables on its enhanced SEAP. Key stakeholders and their groups that have been identified include academia, local and regional administrations, industry and commerce, finance, energy suppliers and citizens. Riga working to engage all relevant stakeholder groups to help them move towards smart city status - including information and communication technology (ICT) partners, innovation bodies and international companies - in the process of developing and implementing the enhanced SEAP. As a result the city is making connections between players of energy, transport and ICT and increasing their role in CO2 emissions' reduction, and recognising opportunities of cross-sectoral actions and transfer of the best practice projects in synchrony with relevant local stakeholders, international companies and banks to roll out innovative sustainable energy solutions at a scale. Gaps in current stakeholder communication have also been identified, including insufficient recognition of job creation potential by engaging employment agencies, closer engagement with the transport sector companies, ensuring sufficient citizens' engagement, and building on existing relationships with ICT players. Riga has developed communication tools and stakeholder engagement plan based on analysis of the know-how and resources held by each of the stakeholders or their groups and their role in, and potential impact on the SEAP. With increasingly limited local authority resources for communication with stakeholders, usual methods and channels, based on ICT including newsletters, and emails, social media, have been prioritised in order to secure information flow and feedback from stakeholders.
{"title":"Identification and prioritization of stakeholders in the planning process of sustainable development of the smart city","authors":"Inete Ielite, G. Olevsky, Timurs Safiuļins","doi":"10.1109/INTELCIS.2015.7397229","DOIUrl":"https://doi.org/10.1109/INTELCIS.2015.7397229","url":null,"abstract":"The article analyzes stakeholders in the city, conducted in order to identify organisations of particular value to the creation and delivery of the sustainable energy policy for smart cities i.e. enhanced Sustainable Energy Action Plan (SEAP). Using the information gathered in the stakeholder analysis, Riga, the capital of Republic of Latvia, has created a stakeholder engagement plan to gather and coordinate the key stakeholders' resources and knowledge for the benefit of the city, and for the development, implementation, monitoring and ongoing revision of the energy policy for the smart city i.e. SEAP. Different approaches to stakeholder communication and engagement planning have been used, based on specific city context, including history of engagement and current plans and ambitions. Riga stakeholders have been identified and prioritised using a matrix tool, allowing stakeholders to be grouped according to their importance for the enhanced SEAP and level of interest or engagement in the city. Riga has completed public consultation roundtables on its enhanced SEAP. Key stakeholders and their groups that have been identified include academia, local and regional administrations, industry and commerce, finance, energy suppliers and citizens. Riga working to engage all relevant stakeholder groups to help them move towards smart city status - including information and communication technology (ICT) partners, innovation bodies and international companies - in the process of developing and implementing the enhanced SEAP. As a result the city is making connections between players of energy, transport and ICT and increasing their role in CO2 emissions' reduction, and recognising opportunities of cross-sectoral actions and transfer of the best practice projects in synchrony with relevant local stakeholders, international companies and banks to roll out innovative sustainable energy solutions at a scale. Gaps in current stakeholder communication have also been identified, including insufficient recognition of job creation potential by engaging employment agencies, closer engagement with the transport sector companies, ensuring sufficient citizens' engagement, and building on existing relationships with ICT players. Riga has developed communication tools and stakeholder engagement plan based on analysis of the know-how and resources held by each of the stakeholders or their groups and their role in, and potential impact on the SEAP. With increasingly limited local authority resources for communication with stakeholders, usual methods and channels, based on ICT including newsletters, and emails, social media, have been prioritised in order to secure information flow and feedback from stakeholders.","PeriodicalId":6478,"journal":{"name":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","volume":"25 1","pages":"251-257"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91088076","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
扫码关注我们
求助内容：
应助结果提醒方式：