2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)最新文献

筛选
英文 中文
A community-based, Graph API framework to integrate and orchestrate cloud-based services 基于社区的图形API框架,用于集成和编排基于云的服务
Iosif Alvertis, Michael Petychakis, Fenareti Lampathaki, D. Askounis, T. Kastrinogiannis
{"title":"A community-based, Graph API framework to integrate and orchestrate cloud-based services","authors":"Iosif Alvertis, Michael Petychakis, Fenareti Lampathaki, D. Askounis, T. Kastrinogiannis","doi":"10.1109/AICCSA.2014.7073238","DOIUrl":"https://doi.org/10.1109/AICCSA.2014.7073238","url":null,"abstract":"The ever-accelerating growth of cloud-based services (CBS) and the prevalence of multi-sided business models have distributed users' data across different data silos that hinder mobile applications development and sustainability. The present paper aims at describing an open framework that abstracts functionality from CBSs through a common Graph, RESTful API, which manages calls among various CBS APIs and syndicates responses under a common standardized format. Combining this conceptual framework with semantically enriched modeling, the implemented platform allows a community of developers to govern, extend and maintain the Graph API and consequently, applications to access a plethora of CBSs through a single point of access. Building on the experience of third-party solutions that mash-up data from different services in their API, the proposed approach goes beyond the state-of-the art through its community-orientation, the API extensibility-by-design and the advanced context awareness and sophistication it provides to developers.","PeriodicalId":412749,"journal":{"name":"2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)","volume":"263 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123736781","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}
引用次数: 6
A Computer Aided Pronunciation Learning system for teaching the holy quran Recitation rules 教古兰经诵读规则的计算机辅助发音学习系统
Sherif M. Abdou, M. Rashwan
{"title":"A Computer Aided Pronunciation Learning system for teaching the holy quran Recitation rules","authors":"Sherif M. Abdou, M. Rashwan","doi":"10.1109/AICCSA.2014.7073246","DOIUrl":"https://doi.org/10.1109/AICCSA.2014.7073246","url":null,"abstract":"This paper describes a speech-enabled Computer Aided Pronunciation Learning (CAPL) system. This system was developed for teaching Arabic pronunciations to non-native speakers. A challenging application of that system is teaching the correct recitation of the Holy Qur'an. This system uses a state of the art speech recognizer to detect errors in the user recitation. To increase accuracy of the speech recognizer, only probable pronunciation variants, that cover all common types of recitation errors, are examined by the speech decoder. A module for the automatic generation of pronunciation hypotheses is built as a component of the system. A phoneme duration classification algorithm is implemented to detect recitation errors related to phoneme durations. The decision reached by the recognizer is accompanied by a confidence score to reduce effect of misleading system feedbacks to unpredictable speech inputs. Assessment results for the performance of HAFSS system in three different countries are introduced.","PeriodicalId":412749,"journal":{"name":"2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121898182","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}
引用次数: 11
An authentication scheme to protect the location privacy of femtocell users 一种保护移动基站用户位置隐私的认证方案
M. Hussain
{"title":"An authentication scheme to protect the location privacy of femtocell users","authors":"M. Hussain","doi":"10.1109/AICCSA.2014.7073261","DOIUrl":"https://doi.org/10.1109/AICCSA.2014.7073261","url":null,"abstract":"Femtocells are small cellular base-stations, suitable for residential units or business offices. Femtocells are cost-effective solution for areas where deploying traditional base-stations is costly. Femtocells inherits security and privacy threats of GSM, and UMTS networks such as location privacy and tracking. These threats are even more severe, since the deployment of femtocells, which covers areas as small as an office, allows for an unprecedented tracking of mobile users location. This paper presents an authentication scheme, which allows a mobile user to use an open femtocell, while making it hard for its mobile operator to know the exact location of that mobile user. The scheme complements the privacy protection of UMTS. Further, the scheme enables mobile operators to reward owners of open femtocells. The paper discusses the security of the presented scheme. The simulation of the authentication scheme shows the feasibility of our work.","PeriodicalId":412749,"journal":{"name":"2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121182427","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}
引用次数: 0
ConProve: A conceptual prover system ConProve:一个概念性的证明系统
S. Elloumi, A. Jaoua, B. Boulifa, M. Saleh, Jameela Al Otaibi
{"title":"ConProve: A conceptual prover system","authors":"S. Elloumi, A. Jaoua, B. Boulifa, M. Saleh, Jameela Al Otaibi","doi":"10.1109/AICCSA.2014.7073260","DOIUrl":"https://doi.org/10.1109/AICCSA.2014.7073260","url":null,"abstract":"ConProve is an automated prover for propositional logic. It takes, as an input, a set of propositional formulas and proves whether a goal holds or not. ConProve converts each formula to its corresponding Truth Table Binary Relation (TTBR) considered also as a formal context (FC). The objects in FC correspond to all possible formulas interpretations (in terms of their truth value assignments), and the properties in FC correspond to the terms. When the function the 'BuildContext' function, ConProve starts the new goal proving. Firstly, it adds the goal negation to the set of formulas and constructs the formal contexts (FCs) relating formulas to terms. Secondly, it makes the FCs grouping and deduces, based on the conceptual reasoning, if the goal holds. The tool offers a user-friendly interface allowing the editing of the set of formulas as well as the visualization of the reasoning steps. Besides the tool, the paper illustrates the importance of the conceptual reasoning in deriving new conclusions as well as in discovering new, possibly implications by applying the extended Galois Connection.","PeriodicalId":412749,"journal":{"name":"2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)","volume":"222 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116836170","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}
引用次数: 2
A Fast Multipath Routing Protocol for wireless sensor networks 无线传感器网络的快速多径路由协议
I. Jemili, Ghazi Tekaya, A. Belghith
{"title":"A Fast Multipath Routing Protocol for wireless sensor networks","authors":"I. Jemili, Ghazi Tekaya, A. Belghith","doi":"10.1109/AICCSA.2014.7073275","DOIUrl":"https://doi.org/10.1109/AICCSA.2014.7073275","url":null,"abstract":"Multipath routing has been widely used in wireless sensor networks to improve mainly the network performance by providing the load balancing capabilities. However, high correlated paths can throttle data transfer and can cancel the benefits of using multiple routes for data forwarding towards the sink. In this context, we propose a Fast Multipath Routing Protocol (FMRP), a query based multipath routing protocol which provides a simple mechanism during the discovery phase to construct node-disjoint paths while minimizing the impact of collision and interference. Thus, selecting less correlated paths allows a fluent data transfer and an efficient resources use. The good performance of our protocol in terms of more energy saving and better network throughput is witnessed by extensive simulations under various traffic loads and adopting different scenarios.","PeriodicalId":412749,"journal":{"name":"2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116511546","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}
引用次数: 10
An original approach for processing public open data with MapReduce: A case study 使用MapReduce处理公共开放数据的原始方法:案例研究
Billel Arres, N. Kabachi, F. Bentayeb, Omar Boussaïd
{"title":"An original approach for processing public open data with MapReduce: A case study","authors":"Billel Arres, N. Kabachi, F. Bentayeb, Omar Boussaïd","doi":"10.1109/AICCSA.2014.7073190","DOIUrl":"https://doi.org/10.1109/AICCSA.2014.7073190","url":null,"abstract":"Nowadays, many governments and states are involved in an opening strategy of their public data. However, the volume of these opened data is constantly increasing, and will reach in the near future limitations of current treatment and storage capacity. On the other hand, the MapReduce paradigm is one of the most used parallel programming models. With a master-slave architecture, it allows parallel processing of very large data sets. In this paper, we propose a parallel approach based on Mapreduce to process public open data. Applied, as a case study, to the official data sets from the French Ministry of Communication. We implement a parallel algorithm as a solution to define a ranking of national museums and galleries according to the accessibility degrees for people with disabilities. We studied the feasibility of our approach in two main parts: The performance in terms of execution time, and, the visualization of the obtained results in order to integrate them into solutions such as geographic BI. This work can be applied to other cases with very large data sets.","PeriodicalId":412749,"journal":{"name":"2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114460688","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}
引用次数: 0
A novel framework for supporting the exponential worldwide adoption of electronic transactions 一个支持全球电子交易指数采用的新框架
R. Righi, V. F. Rodrigues, C. Costa, L. D. Chiwiacowsky, D. Kreutz, A. Andrade
{"title":"A novel framework for supporting the exponential worldwide adoption of electronic transactions","authors":"R. Righi, V. F. Rodrigues, C. Costa, L. D. Chiwiacowsky, D. Kreutz, A. Andrade","doi":"10.1109/AICCSA.2014.7073199","DOIUrl":"https://doi.org/10.1109/AICCSA.2014.7073199","url":null,"abstract":"Electronic transactions have become the mainstream mechanism for performing commerce activities in our daily lives. Aiming at processing them, the most common approach addresses the use of a switch that dispatches transactions to processing machines using the so-called Round-Robin scheduler. Considering this electronic funds transfer (EFT) scenario, we developed a framework model denoted GetLB which comprises not only a new and efficient scheduler, but also a cooperative communication infrastructure for handling heterogeneous and dynamic environments. The GetLB scheduler uses a scheduling heuristic that combines static data from transactions and dynamic information from the processing nodes to overcome the limitations of the Round-Robin based schedulinperiodic interactiong approaches. Scheduling efficiency takes place thanks to the periodic interaction between the switching node and processing machines, enabling local decision making with up-to-date information about the environment. Besides the description of the aforementioned model in detail, this article also presents a prototype evaluation by using both traces and configurations obtained with a real EFT company. The results show improvements in transaction makespan when comparing our approach with the traditional one over homogeneous and heterogeneous clusters.","PeriodicalId":412749,"journal":{"name":"2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114952575","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}
引用次数: 0
Context-based ontology to describe System-of-Systems Interoperability 基于上下文的本体描述系统的互操作性
H. Benali, Narjès Bellamine Ben Saoud, M. Ahmed
{"title":"Context-based ontology to describe System-of-Systems Interoperability","authors":"H. Benali, Narjès Bellamine Ben Saoud, M. Ahmed","doi":"10.1109/AICCSA.2014.7073180","DOIUrl":"https://doi.org/10.1109/AICCSA.2014.7073180","url":null,"abstract":"The concept of System-of-Systems (SoS) presents a high level perspective that explains the interactions between independent subsystems. In the context of SoS, the issue of interoperability is crucial especially when integrating multiple heterogeneous and independently governed systems. Any solution is naturally applied to resolve a problem in a precise context, where context specificities are implicitly or explicitly processed. In the scope of this paper, we tackle the problem of SoS interoperability knowledge description taking into account the notion of context. To structure this description, we propose ontology design patterns (ODPs) that describe the notion of “context” in the field of SoS Interoperability. These ODPs was defined based on a Foundational Ontology (FO) for “Context” description. An example in the field of Traffic management is given to illustrate the practical usefulness of the proposed ontology.","PeriodicalId":412749,"journal":{"name":"2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128265293","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}
引用次数: 8
An ontology based digital preservation system for enterprise collaboration 基于本体的企业协作数字保存系统
M. Naeem, N. Moalla, Y. Ouzrout, Abdelaziz Bouras
{"title":"An ontology based digital preservation system for enterprise collaboration","authors":"M. Naeem, N. Moalla, Y. Ouzrout, Abdelaziz Bouras","doi":"10.1109/AICCSA.2014.7073267","DOIUrl":"https://doi.org/10.1109/AICCSA.2014.7073267","url":null,"abstract":"The structures of product design, process development, manufacturing, sales, product utilization, after sale service and product retirement are becoming more and more complex due to the underlying reasons of newly introduced rules as well as constraints of the respective stakeholders. On the other hand, these complexities are also appending up the organizational assets. The configuration of the state of art and introduction of an architecture which can convert this organizational asset into an action such as \"to introduce an added value\" in the product life cycle is an interesting but challenging task. We in this study have discussed the issues related to enterprise collaboration for the purpose of assessment of an enterprise's capability. Moreover, we have also proposed the solution for how we can utilize the structural knowledge of ontological modeling to address this issue along with the emerging technological advances. It's flexible as well as useful to utilize the state of the art digital preservation model to store, reuse and access the ontologies.","PeriodicalId":412749,"journal":{"name":"2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117051611","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}
引用次数: 8
Feature based link prediction 基于特征的链路预测
Saoussen Aouay, Salma Jamoussi, F. Gargouri
{"title":"Feature based link prediction","authors":"Saoussen Aouay, Salma Jamoussi, F. Gargouri","doi":"10.1109/AICCSA.2014.7073243","DOIUrl":"https://doi.org/10.1109/AICCSA.2014.7073243","url":null,"abstract":"Under the different searches performed to analyzing social networks, much attention has been devoted to the problem of predicting links. It is a key technique in many applications such as recommendation systems which provide suggestions of potential links between nodes. Traditional link prediction methods use a single proximity metric. In this paper, we study link prediction as a supervised learning task where we try to combine multiple features as input data for classification. To improve the accuracy of prediction, we have been applying a select attributes algorithm. Experiments have been performed on two co-authorship data sets. Results demonstrate that Random Forest, k-nearest neighbors and Principal Component Analysis yield the best performances.","PeriodicalId":412749,"journal":{"name":"2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124544040","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}
引用次数: 10
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信