{"title":"A Design Time Estimation Methodology for Spatial Databases","authors":"G. Polese, M. Sebillo","doi":"10.1145/2641483.2641513","DOIUrl":"https://doi.org/10.1145/2641483.2641513","url":null,"abstract":"We propose a design time methodology for estimating performances of spatial databases, which includes methods for estimating disk occupancy and performances of manipulation operations on alphanumeric, vector, and raster data.","PeriodicalId":438325,"journal":{"name":"Proceedings of the 2014 International C* Conference on Computer Science & Software Engineering","volume":"12 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114116638","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}
Jonathan Roy, Clément Contini, François Brodeur, Ndiack Diouf, W. Suryn
{"title":"Method for the Evaluation of Open Source Software Quality from an IT Untrained User Perspective","authors":"Jonathan Roy, Clément Contini, François Brodeur, Ndiack Diouf, W. Suryn","doi":"10.1145/2641483.2641525","DOIUrl":"https://doi.org/10.1145/2641483.2641525","url":null,"abstract":"The offering and adoption of open source software is growing and today it is an option for users, when they have to accomplish certain tasks, to do their own research on the web to find open source software they can download and install on their computer or use in the Cloud as a Software as a Service (SaaS). From the IT untrained user, no tools or guideline are available in order to evaluate or compare the quality of open source software. How to evaluate the quality of software is not a simple task and more often, the IT untrained user will be unaware of the quality of the software chosen to perform tasks and achieve a goal. This paper presents a basic method for the evaluation of the quality of open source software from an IT untrained user perspective.","PeriodicalId":438325,"journal":{"name":"Proceedings of the 2014 International C* Conference on Computer Science & Software Engineering","volume":"254 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":"132416063","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":"Classification and Generation of Grammatical Errors","authors":"Anthony Penniston, E. Harley","doi":"10.1145/2641483.2641527","DOIUrl":"https://doi.org/10.1145/2641483.2641527","url":null,"abstract":"The misuse of grammar is a common and natural nuisance, and a strategy for automatically detecting mistakes in grammatical syntax is warranted. This research defines and implements a unique approach that combines machine-learning and statistical natural language processing techniques. Several important methods are established: (1) the automated and systematic generation of grammatical errors and parallel error corpora; (2) the definition and extraction of over 150 features of a sentence; and (3) the application of various machine-learning classification algorithms on extracted feature data, in order to classify and predict the presence of grammatical errors in a sentence.","PeriodicalId":438325,"journal":{"name":"Proceedings of the 2014 International C* Conference on Computer Science & Software Engineering","volume":"46 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":"129258062","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}
Chongjie Li, T. Amagasa, H. Kitagawa, Gautam Srivastava
{"title":"Label-bag based Graph Anonymization via Edge Addition","authors":"Chongjie Li, T. Amagasa, H. Kitagawa, Gautam Srivastava","doi":"10.1145/2641483.2641516","DOIUrl":"https://doi.org/10.1145/2641483.2641516","url":null,"abstract":"Privacy-preserving publishing of graph data, such as social networks, has been gaining much public attention in recent years due to the growing demands for publishing graph data containing privacy information. Most of the existing approaches for graph anonymization deal with unlabeled graphs, while labeled graphs have useful real-life applications. However it is proven that k-anonymity problem edge-labeled graphs is computationally expensive. In this paper, we devise a greedy heuristic based approach for k-anonimity problem over edge-labeled graphs. More precisely, we deal with some utility metrics to achieve better anonymization results. To show the effectiveness of the proposed schemes, we conduct a set of experimental evaluations using synthetic and real datasets. The results reveal that our proposed scheme can successfully anonymize edge-labeled graphs. We also assess how the utility of the anonymized graphs is affected by the proposed algorithms.","PeriodicalId":438325,"journal":{"name":"Proceedings of the 2014 International C* Conference on Computer Science & Software Engineering","volume":"577 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":"122765634","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":"Adaptive composition of services in context-aware ambient intelligent systems","authors":"Chaib Aouatef, Boussebough Iman, Chaoui Allaoua","doi":"10.1145/2641483.2641535","DOIUrl":"https://doi.org/10.1145/2641483.2641535","url":null,"abstract":"An environment of ambient intelligence or an ambient environment is an environment with intelligent applications able to adapt their behavior with the change of context. The ambient environments use many communicating objects; each one offers different and specific services. The majority of these services can perform only one specific task. The composition of services is then proposed to resolve the complex tasks. Multi agent systems underline the social capacities such as the communication, the cooperation, the resolution of conflict, the negotiation, the argumentation, and the emotion. They thus quickly became the principal paradigm in the ambient intelligence. In this context, we propose an adaptive multi agent system for automatic composition of services in an ambient environment. For each device is associated an agent. The set of the agents coordinate their competences taking into account the context in order to perform an activity. The system suggested is based on the Contract Net Protocol in which the agents exchange their proposals in the form of call for proposal. JADE platform (Java Agent DEvelopment framework) is used to implement our system.","PeriodicalId":438325,"journal":{"name":"Proceedings of the 2014 International C* Conference on Computer Science & Software Engineering","volume":"325 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":"122216199","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":"Software Specification and Automatic Code Generation to Realize Homeostatic Adaptation in Unmanned Spacecraft","authors":"C. Insaurralde, Emil Vassev","doi":"10.1145/2641483.2641524","DOIUrl":"https://doi.org/10.1145/2641483.2641524","url":null,"abstract":"Long-term space missions are requiring more and more autonomy from Unmanned Space Vehicles (USVs). USV control architectures are required to support effective adaptation to unpredictable internal and external changes. Thus, continuous assurance of efficient management of resources is essential to realize such requirements. Inspiration on the self-regulation provided by the physiology of living systems is an attractive solution to achieve continuous adaptation to the environment by changing internal conditions. Physiological functions provided by nervous system reflexes at a very low control level are the foundations for self-regulatory mechanisms such as homeostasis. USVs can get highly-viable and ultra-stable by building artificial self-regulation in order to support very long missions. This paper presents aspects on how to endow USVs with Artificial Nervous Reflexes (ANRs) to the USV control architecture by means of applying physiological principles of self-regulation for operational resilience and persistence. The above homeostatic concept is applied to a composite orbiter (i.e. a USV) for the BepiColombo mission to Mercury. The ANRs studied are required to guarantee self-regulation of response time (latency), operation temperature (thermoregulation), and power consumption (energy balance). Results from experiments carried out based on the realization (software generation) of the above physiological paradigm from software specification are also presented.","PeriodicalId":438325,"journal":{"name":"Proceedings of the 2014 International C* Conference on Computer Science & Software Engineering","volume":"32 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":"124956041","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}
Touraj Laleh, Arash Khodadadi, Serguei A. Mokhov, J. Paquet, Yuhong Yan
{"title":"Toward Policy-Based Dynamic Context-Aware Adaptation Architecture for Web Service Composition","authors":"Touraj Laleh, Arash Khodadadi, Serguei A. Mokhov, J. Paquet, Yuhong Yan","doi":"10.1145/2641483.2641528","DOIUrl":"https://doi.org/10.1145/2641483.2641528","url":null,"abstract":"Dynamic service composition techniques are beneficial for better design, implementation, and deployment of distributed applications. These techniques address the complexity that comes with the significant growth of the number of web services on the Internet and their constantly changing adaptation requirements. However, the previous approaches do not provide a mechanism for a flexible adaptation or re-composition when availability is not the only requirement. There are other business-level or service-level requirement specifications that can be introduced at any time by business or system administrators. These requirements could be business or quality rules, which may adversely affect web service composition (WSC) without changing the definitions of the Web Services' specification (i.e., WSDL, SAWSDL) nor their availability. In this paper we define a new context-oriented graph planning policy-based architecture for dynamic web service composition, and a prototype implementation.","PeriodicalId":438325,"journal":{"name":"Proceedings of the 2014 International C* Conference on Computer Science & Software Engineering","volume":"24 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":"123231038","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":"Efficient and Robust Constraint Automaton-Based Genome Map Assembly","authors":"P. Revesz, Dipty Singh","doi":"10.1145/2641483.2641533","DOIUrl":"https://doi.org/10.1145/2641483.2641533","url":null,"abstract":"DNA sequences are cut into smaller fragments using restriction enzymes in order to facilitate analysis. Application of different restriction enzymes to multiple copies of a DNA sequence generates many overlapping fragments. To reconstruct the original DNA, these fragments need to be sequenced and assembled. This problem of finding the original order of the fragments is called the genome map assembly problem. We propose a constraint automaton solution to solve the genome map assembly problem for both error prone and error free data. Plasmid vectors puc57, pKLAC1-malE, pTXB1 and phage vector Adenovirus2, having a size in base pairs of 2710, 6706, 10153 and 35937 respectively, were used to prove that computational time for solving genome map assembly problem using constraint automaton solution is linear with both precise and approximate data.","PeriodicalId":438325,"journal":{"name":"Proceedings of the 2014 International C* Conference on Computer Science & Software Engineering","volume":"251 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":"125781879","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 new conceptual model for dynamic text clustering Using unstructured text as a case","authors":"Choukri Djellali","doi":"10.1145/2641483.2641538","DOIUrl":"https://doi.org/10.1145/2641483.2641538","url":null,"abstract":"In recent years, clustering has become a critical success factor for data analysis. Most clustering methods are sensitive to outliers, noise, presentation order, configuration architecture, Bellman's curse of dimensionality and complex shapes. They use the cost functions to reflect the general knowledge about internal structures and distributions of target data. There is no provided mechanism to reflect the dynamics of clustering environment on the data set. Hence, in the present study, an alternative numerical scheme (SC) was proposed to enhance the predictive accuracy of clustering. Our approach exploits variables selection techniques and Fuzzy Adaptive Resonance Theory to increase productivity of knowledge extraction.","PeriodicalId":438325,"journal":{"name":"Proceedings of the 2014 International C* Conference on Computer Science & Software Engineering","volume":"14 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":"126972563","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":"On the Dynamic Scheduling of Task Farm Patterns on a Heterogeneous CPU-GPGPU Environment","authors":"Wei Zhang, D. Goswami, B. Goodarzi","doi":"10.1145/2641483.2641530","DOIUrl":"https://doi.org/10.1145/2641483.2641530","url":null,"abstract":"Heterogeneous clusters and multi-core environments are gradually surpassing the homogeneous systems due to their high performance and flexibility. Task scheduling in these systems is an extensively studied subject. However, in a heterogeneous architecture consisting of multi-core CPUs and many-core GPGPUs (General Purpose Graphics Processor Units), task mapping becomes much more complex due to differences in architectures and programming models among the processors. Consequently, designing a scheduler which facilities a balanced distribution of loads by taking full advantage of the processing power of a CPU-GPGPU system is nontrivial. In this paper we discuss a multi-round scheduling algorithm and a scheduling framework for farm-pattern based applications on such a system. This is an important step towards designing a full-scale pattern-based scheduler to automatically and efficiently map the parallel tasks to the heterogeneous processors. As a proof of concept, we have designed a scheduling framework for the task-farm pattern based applications. The framework provides the necessary \"separation of concerns\" and hides the underlying complex scheduling details from the programmer. The experimental results demonstrate that our dynamic scheduling algorithm achieves better to similar performances as compared to some of the well-known scheduling algorithms for CPU-GPGPU systems.","PeriodicalId":438325,"journal":{"name":"Proceedings of the 2014 International C* Conference on Computer Science & Software Engineering","volume":"32 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":"131831108","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}