{"title":"A polynomial-time algorithm for the maximum clique problem","authors":"Z. Akbari","doi":"10.1109/ICIS.2013.6607889","DOIUrl":"https://doi.org/10.1109/ICIS.2013.6607889","url":null,"abstract":"After more than six decades of its introduction, the maximum clique problem, which is one of the most applicable problems in the graph theory, has still no polynomial-time solution. This paper presents a polynomial-time algorithm for this problem, which detects the maximum clique of a given graph through a recursive approach. This polynomial solution to the clique problem, as an NP-complete problem, causes every problem in NP to have a polynomial solution, which leads to the equality of P and NP complexity classes.","PeriodicalId":345020,"journal":{"name":"2013 IEEE/ACIS 12th International Conference on Computer and Information Science (ICIS)","volume":"68 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121006494","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":"An on-the-fly provenance tracking mechanism for stream processing systems","authors":"Watsawee Sansrimahachai, L. Moreau, M. Weal","doi":"10.1109/ICIS.2013.6607885","DOIUrl":"https://doi.org/10.1109/ICIS.2013.6607885","url":null,"abstract":"Applications that operate over streaming data with high-volume and real-time processing requirements are becoming increasingly important. These applications process streaming data in real-time and deliver instantaneous responses to support precise and on-time decisions. In such systems, traceability - the ability to verify and investigate the source of a particular output - in real-time is extremely important. This ability allows raw streaming data to be checked and processing steps to be verified and validated in timely manner. Therefore, it is crucial that stream systems have a mechanism for dynamically tracking provenance - the process that produced result data - at execution time, which we refer to as on-the-fly stream provenance tracking. In this paper, we propose a novel on-the-fly provenance tracking mechanism that enables provenance queries to be performed dynamically without requiring provenance assertions to be stored persistently. We demonstrate how our provenance mechanism works by means of an on-the-fly provenance tracking algorithm. The experimental evaluation shows that our provenance solution does not have a significant effect on the normal processing of stream systems given a 7% overhead. Moreover, our provenance solution offers low-latency processing (0.3 ms per additional component) with reasonable memory consumption.","PeriodicalId":345020,"journal":{"name":"2013 IEEE/ACIS 12th International Conference on Computer and Information Science (ICIS)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131119392","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":"A survey on the usability and effectiveness of web-based trust rating systems","authors":"I. Pranata, G. Skinner, R. Athauda","doi":"10.1109/ICIS.2013.6607882","DOIUrl":"https://doi.org/10.1109/ICIS.2013.6607882","url":null,"abstract":"In Today's online environment, it is hard to measure the trustworthiness of seller/product. However, such trustworthiness is crucial to be determined in order to generate buyer's confidence prior to transaction. There exist a number of web-based trust rating systems that assist buyers in determining the trust level of seller/product. These systems have been widely used in many e-commerce websites and in online forums. Further, they have varying types of trust measurements and user interfaces. Although many users have used these systems when performing online transactions or activities, the usability and effectiveness of these trust rating systems are still largely unknown. Thus, the major aim of this paper is to investigate these issues, in particular to discover the most and least preferred trust rating systems from user's perspective, the influence of ratings, and the effectiveness of these online trust rating systems.","PeriodicalId":345020,"journal":{"name":"2013 IEEE/ACIS 12th International Conference on Computer and Information Science (ICIS)","volume":"XLII 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131200473","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}
Motohiro Shibakawa, Takahiro Uchiya, I. Takumi, Tetsuo Kinoshita
{"title":"Design and implementation of multiagent-based distributed backup system","authors":"Motohiro Shibakawa, Takahiro Uchiya, I. Takumi, Tetsuo Kinoshita","doi":"10.1109/ICIS.2013.6607847","DOIUrl":"https://doi.org/10.1109/ICIS.2013.6607847","url":null,"abstract":"Recently, information recorded on paper has been changed rapidly to digital data. Backup systems emphasize prevention of data loss by disasters, mistakes of user operations, and so on. For robust backup, it is necessary that the data be distributed geographically. Using a distributed backup system, the possibility of all data becoming lost will definitely be low. However, several problems with distributed backup systems remain. First, preparing multiple computers is expensive. Second, the computational cost of encryption and redundancy is high. Third, user workloads necessary to manage and maintain the system are great. As described herein, to overcome those problems, we propose a distributed backup system using multiagent technology. The agents can work autonomously depending on the environment.","PeriodicalId":345020,"journal":{"name":"2013 IEEE/ACIS 12th International Conference on Computer and Information Science (ICIS)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133196870","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":"Collaborative filtering based spot recommendation seamlessly available in home and away areas","authors":"Takafumi Hasegawa, Takahiro Hayashi","doi":"10.1109/ICIS.2013.6607896","DOIUrl":"https://doi.org/10.1109/ICIS.2013.6607896","url":null,"abstract":"This paper proposes a collaborative filtering based spot recommendation system seamlessly available in user's home areas and away areas. The system recommends spots to a user which are highly evaluated by other users whose preference in spot genre selection is similar to the user's one and whose home areas cover the user's current location. As an application of the proposed system, we have implemented a restaurant recommendation system. Experimental results have shown that the superiority of the proposed system to an existing spot recommendation system.","PeriodicalId":345020,"journal":{"name":"2013 IEEE/ACIS 12th International Conference on Computer and Information Science (ICIS)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114285831","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}
Hiep Hoang-Van, Koki Mizutani, T. Miyoshi, Olivier Fourmaux
{"title":"P2P traffic localization by forcing packet loss","authors":"Hiep Hoang-Van, Koki Mizutani, T. Miyoshi, Olivier Fourmaux","doi":"10.1109/ICIS.2013.6607861","DOIUrl":"https://doi.org/10.1109/ICIS.2013.6607861","url":null,"abstract":"Recently, peer-to-peer (P2P) traffic is increasing rapidly in volume day by day. One of the main causes is that most of P2P applications including file sharing and streaming applications often form overlay networks for exchanging data that are oblivious to the underlay network topology. As a result, they generate a large amount of inter-domain traffic causing higher cost for Internet service providers (ISPs). This raises a problem of traffic localization. To optimize the cross-ISP/AS traffic, existing approaches focus on solving the problem on the application layer where each P2P application must be equipped with an additional protocol to obtain underlay network information from an “Oracle” server or an additional locality-aware procedure to estimate location by itself. Therefore some modifications of application software are required for these approaches. In this paper, we propose a novel solution for addressing the problem, called PLS, forcing packet loss to each P2P packet based on geographical location of each destination at the network layer. Since PLS is implemented at a network router, no software modification is required. This proposal can be applied to all types of P2P applications in order to localize the traffic. The experiment in this study evaluated on popular P2P streaming applications show that our proposed method significantly improves the performance of traffic localization problem.","PeriodicalId":345020,"journal":{"name":"2013 IEEE/ACIS 12th International Conference on Computer and Information Science (ICIS)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114354110","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}
W. Shen, Lianqiang Sun, D. Wei, Weimin Xu, Hui Wang, Xin Zhu
{"title":"A hybrid parallel algorithm for computer simulation of Electrocardiogram based on a CPU-GPU cluster","authors":"W. Shen, Lianqiang Sun, D. Wei, Weimin Xu, Hui Wang, Xin Zhu","doi":"10.1109/ICIS.2013.6607835","DOIUrl":"https://doi.org/10.1109/ICIS.2013.6607835","url":null,"abstract":"Biological computations like Electrocardiological modeling and simulation usually require high-performance computing environments. This paper introduces an implementation of parallel computation for computer simulation of Electrocardiograms (ECGs). We realized the parallel computation for computer simulation of ECGs on a CPU-GPU cluster using a hybrid parallel algorithm with the parallel program development tools-MPI, OpenMP, and CUDA. Furthermore, we proposed a load-prediction static scheduling and load-prediction dynamic scheduling to achieve efficient process-level and thread-level scheduling, respectively. Compared with traditional static and dynamic scheduling, our scheduling schemes are more efficient. In our research, we achieved a speedup of 55.1 using four PCs for the computer simulation of ECGs. This study demonstrates that the cluster can provide a cheap and efficient environment for parallel computations in biological modeling and simulation studies.","PeriodicalId":345020,"journal":{"name":"2013 IEEE/ACIS 12th International Conference on Computer and Information Science (ICIS)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117317721","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":"Model-based test generation for software product line","authors":"Xinying Cai, Hong-wei Zeng","doi":"10.1109/ICIS.2013.6607865","DOIUrl":"https://doi.org/10.1109/ICIS.2013.6607865","url":null,"abstract":"Taking advantage of the reusability of domain engineering artifacts and variability description, SPLE reduces greatly development costs and time-to-market. This paper presents a model-based approach to test generation for SPLs. Reusable domain test scenarios are generated from activity diagrams extended with variation points, and then test scenarios for a specific application are derived by specifying and banding variants according to variation points.","PeriodicalId":345020,"journal":{"name":"2013 IEEE/ACIS 12th International Conference on Computer and Information Science (ICIS)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121856665","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":"An approach to representing and utilizing specification pattern knowledge for computer-aided formalization of requirements","authors":"Xi Wang, Shaoying Liu","doi":"10.1109/ICIS.2013.6607887","DOIUrl":"https://doi.org/10.1109/ICIS.2013.6607887","url":null,"abstract":"Formalizing requirements in formal specifications usually requires high skills for abstraction and experience in using the formal notation in which the specification is written. This poses a challenge to many practitioners who have to deal with realistic systems within the required schedule and budget. To handle this challenge, a pattern system has been proposed for computer-aided construction of formal expressions. It organizes various inter-related patterns on computer, each of which deals with the formalization of a kind of informal ideas. But how to represent such knowledge to facilitate its automatic utilization and maintenance remains a problem. This paper presents an approach to representing and utilizing the pattern knowledge on the basis of a formal definition of the pattern system. The application process of the pattern system is described in HFSM (Hierarchical Finite State Machine) and treated as knowledge. By performing a proposed algorithm, necessary information can be retrieved from the HFSM for capturing informal requirements and automatically generating formal expressions. We also describe a prototype tool that implements the approach and present a case study on modeling a bank data management system.","PeriodicalId":345020,"journal":{"name":"2013 IEEE/ACIS 12th International Conference on Computer and Information Science (ICIS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131306480","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":"Reusable business tier architecture driven by a wide typed service","authors":"Ó. Pereira, R. Aguiar, M. Y. Santos","doi":"10.1109/ICIS.2013.6607830","DOIUrl":"https://doi.org/10.1109/ICIS.2013.6607830","url":null,"abstract":"Call Level Interfaces (CLI) are difficult to use mainly in intensive database applications with many Create, Read, Update and Delete (CRUD) expressions. As low level API, they are not suited to promote the development process of business tiers as reusable components, leading to the need of writing additional source code whenever a new CRUD expression is needed. To tackle this gap, this paper proposes an architecture for building reusable business tier components herein referred to as Reusable Business Tier Architecture (RBTA). It relies on a single customizable wide typed service to address a business area, such as accounting. The typed service is able to manage all the required CRUD expressions for that business are, which are deployed at runtime in accordance with the user's needs. The only constraint is that the required service to manage each CRUD expression must be a sub-set of the implemented wide typed service. A proof of concept based on Java Database Connectivity (JDBC) is also presented.","PeriodicalId":345020,"journal":{"name":"2013 IEEE/ACIS 12th International Conference on Computer and Information Science (ICIS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130162243","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}