Proceedings of the 2014 International C* Conference on Computer Science & Software Engineering最新文献

{"title":"Binary Linear Programming-based Release Planning for Multi-tenant Business SaaS","authors":"Mubarak Alrashoud, Lubaid Ahmed, A. Abhari","doi":"10.1145/2641483.2641542","DOIUrl":"https://doi.org/10.1145/2641483.2641542","url":null,"abstract":"In multi-tenant Software as a Service (SaaS) business software, the degree of tenants' satisfaction is a significant indicator of the success of the SaaS system. Tenants' satisfaction can be achieved by continuously fulfilling their evolving needs. Usually, SaaS providers frequently deliver new releases of the application. Each release contains new or enhanced features. However, SaaS providers have limited resources, which makes it difficult to them to incorporate all of the tenants' requests in the next release. Therefore, some requirements shall be postponed to later releases. In order to achieve the highest possible level of tenets' satisfaction, SaaS providers shall include the most common requirements in the next release, which guarantee the satisfaction of highest possible number of tenants with less effort. Additionally, tenants' priorities and preferences about the requirements must be considered. Besides maximizing tenants' satisfaction, it is crucial to meet different types of constraints such as resource, technical, and contractual constraints. This paper identifies the factors that govern the release planning process for multi-tenant business software, which are contractual constraints, commonality of requirements, tenants' preferences and decision weights, risk, technical constraints. The first two factors are suggested by this paper, while the remaining factors are inherited from the traditional release planning process. Moreover, this paper proposes a framework that deals with the uniqueness of the release planning process in multi-tenant SaaS system. In this framework, Binary Linear Programming (BLP) is employed to optimize the selection process of the requirements that will be implemented in the next release. An experiments section is provided to illustrate the degree of satisfaction that can be achieved using the proposed framework.","PeriodicalId":438325,"journal":{"name":"Proceedings of the 2014 International C* Conference on Computer Science & Software Engineering","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125062881","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":"Formalizing eMobility with KnowLang","authors":"Emil Vassev, N. Hoch, H. Bensler, M. Hinchey","doi":"10.1145/2641483.2641523","DOIUrl":"https://doi.org/10.1145/2641483.2641523","url":null,"abstract":"eMobility is a transportation concept based on a network of electrical vehicles and offering new benefits to both society and business. Due to CO2-emission reduction, legislation and decreasing oil availability, electric (e-) vehicles increasingly gain a greater share of the auto market. An eMobility system is composed of ensembles of cooperating e-vehicles, taking into account numerous requirements and restrictions of global traffic situation and individual drivers as well as infrastructure and operational requirements like parking availabilities, re-charging stations, battery life-time etc. The development of such systems is a very challenging task, which is mainly due to their non-deterministic behavior, driven by objectives that must be achieved despite the dynamic changes in the surrounding environment. This paper presents a formal approach to modeling self-adaptive behavior for eMobility. The approach relies on the KnowLang language, a formal language dedicated to knowledge representation for self-adaptive systems. A case study is presented to demonstrate the formalization of eMobility.","PeriodicalId":438325,"journal":{"name":"Proceedings of the 2014 International C* Conference on Computer Science & Software Engineering","volume":"418 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117330926","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":"Graph Data Transformations and Querying","authors":"M. Pabón, C. Roncancio, M. Millán","doi":"10.1145/2641483.2641521","DOIUrl":"https://doi.org/10.1145/2641483.2641521","url":null,"abstract":"Many application domains require data stored in heterogeneous SQL and NoSQL data sources. Improving applications and end-user access to such heterogeneous data is now more important than ever. Our work contributes to this objective by facilitating complex data exploration. We adopt a graph data model to depict, in an integrated view, the data available in the sources and to represent a conceptual schema of that data. Our purpose is to provide a conceptual query language to facilitate end-users (e.g. medical domain experts), retrieving data from those sources through ad hoc queries. As part of this study, in this paper we propose a set of high-level operators to query data by transforming graphs. These operators allow successive graph transformations to facilitate generation of graphs with filtered data, and with new relationships deriving information that is implicit or that is sparse from the data.","PeriodicalId":438325,"journal":{"name":"Proceedings of the 2014 International C* Conference on Computer Science & Software Engineering","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127644596","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 Robust Daily Human Activity Recognition and Prediction System","authors":"Md. Zia Uddin","doi":"10.1145/2641483.2641537","DOIUrl":"https://doi.org/10.1145/2641483.2641537","url":null,"abstract":"In this work, a system is proposed for Human Activity Prediction (HAP) using activity sequence spanning tree constructed from a life-log created via a depth video camera-based daily Human Activity Recognition (HAR) approach using time-sequential augmented Local Binary pattern (LBP) and Enhanced Independent Component (EIC)-based depth silhouette features with Hidden Markov Models (HMMs). Regarding the daily HAR, the augmented local features are extracted first from the collection of the depth silhouettes containing various daily human activities such as walking, sitting, lying, cooking, neutral etc. Using these features, HMMs are used to model the time sequential information and recognize several activities. The depth silhouette-based activity recognition results show superior performance over the traditionally used binary silhouette-based approaches, The depth silhouette-based human activity recognition system can be used to recognize the activities automatically, which can be utilized to create life-log. In this regard, an easy prediction method is also proposed for predicting of activity in next few frames while testing a small video which may consist of multiple activities. It can save recognition time and help us to assign a long-time activity annotation for fast life-log construction. After building a life-log consisting of activity sequences, furthermore, a method for human activity prediction in long video is proposed using activity sequence spanning tree built from the activity sequence database. Based on the consecutive activities recorded in an activity sequence database (i.e. life-log) for a specific period of time of each day over a long time such as a month, the spanning tree can be constructed for the sequences starting with each activity where the leaf nodes contain the frequency of the consecutive activity sequences. Once the tree is constructed, to predict an activity after a sequence of activities, traverse the spanning tree until a path up to the previous node of the leaf nodes is matched with the testing pattern and finally, prediction of the next activity is done based on the highest frequency of the leaf nodes along the matched path. The prediction experiments over computer simulated data shows satisfactory results. The proposed video sensor-based human activity recognition and prediction systems can be utilized for important practical applications such as smart healthcare, proactive computing etc.","PeriodicalId":438325,"journal":{"name":"Proceedings of the 2014 International C* Conference on Computer Science & Software Engineering","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131720277","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 Category Theory and Data Flow Analysis for Modeling and Verifying Properties of Communications in the Process-Oriented Language Erasmus","authors":"Ming-Yuan Zhu, P. Grogono, O. Ormandjieva, Pankaj Kamthan","doi":"10.1145/2641483.2641529","DOIUrl":"https://doi.org/10.1145/2641483.2641529","url":null,"abstract":"The increasing significance of concurrency and the need to address the challenges presented by concurrency motivate its formalization. In this paper, a methodology for modeling and verifying communications in a concurrent system developed in Erasmus, a process-oriented programming language, is proposed. The innovative aspects of this methodology include the use of category theory to model and verify properties of communications in Erasmus, and the use of data flow to analyze and abstract an implementation of Erasmus. The methodology is illustrated by a simple example.","PeriodicalId":438325,"journal":{"name":"Proceedings of the 2014 International C* Conference on Computer Science & Software Engineering","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134041908","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":"New Properties for Broadcasting in KG2k","authors":"Sirma C. Altay, Hovhannes A. Harutyunyan","doi":"10.1145/2641483.2641532","DOIUrl":"https://doi.org/10.1145/2641483.2641532","url":null,"abstract":"Broadcasting is an information dissemination problem described by a group of entities, nodes, connected through an interconnection network. It finds its main application in the field of interconnection networks for parallel architecture. Broadcasting in a graph is the process of transmitting a message from one vertex, the originator, to all other vertices. We will consider the classical model in which an informed vertex informs one of its uninformed neighbours during each time unit. A broadcast graph on n vertices is a graph in which broadcasting can finish in [log2n] time units from any originator. In this paper, we will study new broadcasting properties of Knödel graphs on 2k vertices that we will denote by KG2k. KG2k is known to be a broadcast graph. KG2k may be constructed recursively. Although its different dimensions show some similarities with the dimensions of hypercube topology, KG2k is not edge transitive hence is not as symmetric as hypercube. Moreover, KG2k has the smallest diameter among all known k-regular graphs on 2k vertices. Our study shows new broadcasting properties of KG2k and how to construct new broadcast graphs by deleting some sub-graphs of KG2k. The last property is also characteristic of hypercube.","PeriodicalId":438325,"journal":{"name":"Proceedings of the 2014 International C* Conference on Computer Science & Software Engineering","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129610362","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":"Open Source CRM Systems for SMEs","authors":"M. Tereso, Jorge Bernardino","doi":"10.1145/2641483.2641526","DOIUrl":"https://doi.org/10.1145/2641483.2641526","url":null,"abstract":"Globalization, increasing competition and advances in information and communication technology has forced companies to focus on managing customer relationships in order to efficiently maximize revenues. Customer relationship management (CRM) is the key competitive strategy businesses need to stay focused on the needs of the customers and to integrate a customer-facing approach throughout the organization. By using information and communication technology, businesses are trying to get closer to the customer so that they can create long-term relationships. This is crucial to maintain enterprise competitiveness especially for small and medium enterprises (SMEs). The highly competitive market forces small business to find and define new strategies, particularly technological new strategies, which enable their endurance and Open Source CRM systems represent a great opportunity for SMEs. To enhance business management we describe and compare four top open source CRM systems and study its applicability to fit SMEs requirements.","PeriodicalId":438325,"journal":{"name":"Proceedings of the 2014 International C* Conference on Computer Science & Software Engineering","volume":"1992 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128606144","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":"Proceedings of the 2014 International C* Conference on Computer Science & Software Engineering","authors":"","doi":"10.1145/2641483","DOIUrl":"https://doi.org/10.1145/2641483","url":null,"abstract":"","PeriodicalId":438325,"journal":{"name":"Proceedings of the 2014 International C* Conference on Computer Science & Software Engineering","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114824644","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}