{"title":"Inconsistency-Tolerant Belief Revision for Distributed Decision Support","authors":"H. Decker, R. D. Juan-Marín","doi":"10.1109/3PGCIC.2013.66","DOIUrl":"https://doi.org/10.1109/3PGCIC.2013.66","url":null,"abstract":"Decision support is the main objective of business intelligence. The facts and rules of knowledge bases at the back end of decision support systems represent beliefs that are subject to revision. Belief revision is called for whenever an inconsistency occurs. Inconsistency may be due to an update that contradicts extant beliefs, or may have remained hidden before being uncovered. In particular, inconsistency is likely to appear in decision support systems based on distributed, mutually independent knowledge sources. If consistency is modeled by business rules, in the form of integrity constraints, then inconsistency can be measured, by sizing either the violated instances of constraints or the beliefs that cause constraint violations. Measures that quantify inconsistency enable a distinction of different degrees of integrity violations, and thus a relaxation of the intolerant all-or-nothing attitude of classical logic toward consistency. They also provide a logical foundation and justification of maintaining and reasoning with beliefs that possibly are inconsistent, without risking to lead to decisions that suffer too much from contradictory sources.","PeriodicalId":209674,"journal":{"name":"2013 Eighth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116790334","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}
L. Coppolino, S. D'Antonio, Alessia Garofalo, L. Romano
{"title":"Applying Data Mining Techniques to Intrusion Detection in Wireless Sensor Networks","authors":"L. Coppolino, S. D'Antonio, Alessia Garofalo, L. Romano","doi":"10.1109/3PGCIC.2013.43","DOIUrl":"https://doi.org/10.1109/3PGCIC.2013.43","url":null,"abstract":"Wireless Sensor Networks (WSNs) have become a hot research topic in recent years. They have many potential applications for both civil and military tasks. However, the unattended nature of WSNs and the limited computational and energy resources of their nodes make them susceptible to many types of attacks. Intrusion detection is one of the major and efficient defence methods against attacks in a network infrastructure. Intrusion Detection Systems can be seen as the second line of defence and they complement the security primitives that are adopted in order to prevent attacks against the computer network being protected. The peculiar features of a wireless sensor network pose stringent requirements to the design of intrusion detection systems. In this paper, we propose a hybrid, lightweight, distributed Intrusion Detection System (IDS) for wireless sensor networks. This IDS uses both misuse-based and anomaly-based detection techniques. It is composed of a Central Agent, which performs highly accurate intrusion detection by using data mining techniques, and a number of Local Agents running lighter anomaly-based detection techniques on the motes. Decision trees have been adopted as classification algorithm in the detection process of the Central Agent and their behaviour has been analysed in selected attacks scenarios. The accuracy of the proposed IDS has been measured and validated through an extensive experimental campaign. This paper presents the results of these experimental tests.","PeriodicalId":209674,"journal":{"name":"2013 Eighth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"2019 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127173615","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}
{"title":"Experimental Study on Camera Setting for Tele-communication Environment with Tiled Display Wall","authors":"Yasuo Ebara","doi":"10.1109/3PGCIC.2013.97","DOIUrl":"https://doi.org/10.1109/3PGCIC.2013.97","url":null,"abstract":"To realize ultra-realistic tele-communication via the Internet, we consider that displaying of the video with the large-scale screen in remote sites by transmission of ultra quality video streaming is effective. In past research, we have constructed tele-immersive environment with tiled display wall to realize high-realistic tele-communication. However, the video image captured by a single small camera is difficult to display as video streaming with realistic high-resolution on tiled display wall, because there is a limit in the display resolution of video image captured by a single camera. In response to these issues, we have constructed the tele-communication environment to display a ultra-resolution video image on tiled display wall by multi-transmitting each video which captured by four cameras with tiled display wall. However, the adjustment of each camera position is necessary to display a high-resolution video by combination of boundary area between each captured video, the effective camera setting is not make clear. In this paper, we have conducted experimental study the effect of position setting of multiple cameras on a high-resolution video in telecommunication environment with tiled display wall.","PeriodicalId":209674,"journal":{"name":"2013 Eighth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123710276","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}
{"title":"Scalable Distributed Branch and Bound for the Permutation Flow Shop Problem","authors":"Samia Kouki, M. Jemni, T. Ladhari","doi":"10.1109/3PGCIC.2013.86","DOIUrl":"https://doi.org/10.1109/3PGCIC.2013.86","url":null,"abstract":"The study of the Permutation Flow Shop Problem (PFSP) is still of great interest in the community. Reducing the execution time of some very costly instances and/or solving new unresolved instances remain a challenge. The PFSP consists on scheduling n jobs in m machines with make span criterion. Our approach to resolve this problem is based on a parallel distributed solution based on Branch and Bound method. In a previous work, we proposed a first algorithm called GAUUB that distributes the tasks among all processors while updating the new current better Upper Bound (UB). This algorithm GAUUB allowed us, in one hand, to reduce significantly the run times of several benchmark instances and on the other hand, to resolve new instances. In this work, we propose another version of this algorithm (called GALB) that improves the load balancing of tasks among the available processors. Our objective is to have all processors terminating at almost the same time and such that improving run time. In this paper, we will present detailed description of GALB as well as an exhaustive evaluation study based on the well known Tail lard's Benchmarks and performed on the French national grid (Grid'5000).","PeriodicalId":209674,"journal":{"name":"2013 Eighth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115072483","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}
{"title":"Enabling Proactive Data Management in Virtualized Hadoop Clusters Based on Predicted Data Activity Patterns","authors":"George Kousiouris, G. Vafiadis, T. Varvarigou","doi":"10.1109/3PGCIC.2013.8","DOIUrl":"https://doi.org/10.1109/3PGCIC.2013.8","url":null,"abstract":"Hadoop clusters are gaining more and more in popularity based on their ability to parallelize and complete large scale computational tasks on big data. Service offerings of this type have appeared in the recent years, covering a need for dynamic and on-demand creation of such data analytics frameworks. The aim of this paper is to provide a mechanism for offering such virtual clusters as a service, with built-in intelligence functionalities for efficient management. The target of these mechanisms is to predict future demand of the files in the HDFS cluster and dynamically manipulate the according replication factor for availability purposes, in order to improve performance and minimize storage overhead. To this end, real data have been utilized as a dataset input to the prediction framework, based on Fourier series analysis, due to the latter's ability to capture different periodicities that can influence service usage. Multiple time-step ahead prediction is performed in order to enable proactive management (e.g. suitable replication strategy). We describe the framework's architecture, necessary modifications to the client side of Apache Hadoop for data logging and the results of the applied method on two real world datasets.","PeriodicalId":209674,"journal":{"name":"2013 Eighth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128223561","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}
Andrew M. Thomas, J. Parkinson, P. Moore, A. Goodman, F. Xhafa, L. Barolli
{"title":"Nudging through Technology: Choice Architectures and the Mobile Information Revolution","authors":"Andrew M. Thomas, J. Parkinson, P. Moore, A. Goodman, F. Xhafa, L. Barolli","doi":"10.1109/3PGCIC.2013.44","DOIUrl":"https://doi.org/10.1109/3PGCIC.2013.44","url":null,"abstract":"The information revolution has radically changed the way we make decisions and has expanded into mobile devices capable of informing choices at the point at which they are made. However, it is arguable whether the explosion of available information helps or hinders decision making, including in important domains such as healthcare and sustainability. Improving on that is the domain of choice architecture, intended to provide decision-knowledge through understanding choice-implications and so guiding actions in effective and ethical directions (i.e. 'nudging'). Social media has largely evolved as the significant means of choice architecture, but the question remains as to whether decisions based on it are truly effective and ethical, or attracted toward social norms that reinforce poor judgment. This paper explores those issues, including how technologies can be shaped to improve decision-making, and how academic models can be used to nudge toward improved norms.","PeriodicalId":209674,"journal":{"name":"2013 Eighth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129065755","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}
{"title":"Determining the Performance of the Databases in the Context of Cloud Governance","authors":"Adrian Copie, Teodor-Florin Fortiş, V. Munteanu","doi":"10.1109/3PGCIC.2013.40","DOIUrl":"https://doi.org/10.1109/3PGCIC.2013.40","url":null,"abstract":"The maturation of Cloud Computing technologies, cumulated with the opportunities for Small and Medium Enterprises to migrate their activities into the Cloud, have led to new marketplaces where the competition with the large enterprises can be sustained through Platform-as-a-Service solutions combined with cloud Governance. Having a Cloud Governance solution that offers support for the services lifecycle, it creates the framework for a reliable and complex persistence layer that will store the data produced and consumed during the cloud governance processes. Choosing the appropriate databases for the data stores implementations is a very important step in designing a reliable cloud governance system. This paper focuses on establishing the requirements for the subsystems composing the data stores and determining the performances of two representative database types that are candidates to be used in various data stores.","PeriodicalId":209674,"journal":{"name":"2013 Eighth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126685830","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}
Christodoulos Fragoudakis, Markos Karampatsis, P. Potikas
{"title":"Towards a \"Cloud Enabled\" University Computer Center","authors":"Christodoulos Fragoudakis, Markos Karampatsis, P. Potikas","doi":"10.1109/3PGCIC.2013.35","DOIUrl":"https://doi.org/10.1109/3PGCIC.2013.35","url":null,"abstract":"An educational environment must constantly keep up with ever-changing Information Technologies. Therefore, computer center administrators of universities must overcome the increasingly expensive effort of providing up to date facilities. National Technical University of Athens (NTUA), is a technical university, where students gain hands-on practical experience in computer laboratories as an essential complement to lectures they attend. NTUA's computer laboratories have to be highly flexible and configurable for a variety of applications: from the implementation of a wide range of computer networks, to the incorporation of computer-aided engineering/manufacturing(CAE/CAM) software. Traditional system and network administration practices are usually complicated in terms of configuration and maintenance and generally lack flexibility and scalability. We discuss the architecture of a personalized cloud-based solution for the specific needs of educational institutions. The goals are high utilization of resources and minimization of the administration effort needed to maintain physical laboratories, achieved by the centralized integration of computing, storage, network and application facilities. Such a centralized integration utilizes the high-speed network interconnections of the university campus and takes advantage of the broadband technologies that are globally available outside of it. We introduce NTUA's \"Central Cloud Front\" (CCF) to prove the concept of the proposed architecture.","PeriodicalId":209674,"journal":{"name":"2013 Eighth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127038873","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}
{"title":"Principal Component Analysis in Business Intelligence Applications","authors":"A. Sevcenco, K. F. Li","doi":"10.1109/3PGCIC.2013.68","DOIUrl":"https://doi.org/10.1109/3PGCIC.2013.68","url":null,"abstract":"With the enormous amount of information available on the web, many innovative applications in the domain of business intelligence have emerged. Information regarding market trends, consumer profile, competitors, etc., enables a firm to chart its direction and formulate strategies. However, in this big data era, getting the right information is not an easy task. In this work, we introduce business intelligence (BI) applications in general, and examine the use of principal component analysis (PCA) in these applications. A study case reveals how PCA can be used for identification of relevant keywords as prominent features, as well as reducing the search space for an individual's specific requests, in the context of a BI recommender.","PeriodicalId":209674,"journal":{"name":"2013 Eighth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123979136","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}
{"title":"Using Ontologies for Monitoring Knowledge Evolution in Communities of Practice","authors":"J. Barthès, G. Y. Sato","doi":"10.1109/3PGCIC.2013.122","DOIUrl":"https://doi.org/10.1109/3PGCIC.2013.122","url":null,"abstract":"Social networks gather people exchanging information continuously and building knowledge. Knowing what goes on in such groups is difficult. However, the social Web is in part organized around communities of practice (CoP) and it could benefit from some advances in the CoP area. In a CoP a given person describes a trajectory into and within the CoP, starting from an outside circle with little interaction, and progressing towards an inner circle where one finds people actually supporting the community. One of the problems for the people in the inner circle is to monitor what is going on, i.e. to follow the major discussions and to keep track of new appearing concepts, in order to influence the choice of the topics and to keep the community under some level of control. Using an ontology to classify the exchanged messages and to process them allows building two-dimensional maps of the discussed concepts, to analyze possible drifts or detect the appearance of new topics. The same approach, described in this paper, could be applied to social networks.","PeriodicalId":209674,"journal":{"name":"2013 Eighth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121179823","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}