发布求助
文献互助 智能选刊 最新文献

2015 12th International Symposium on Programming and Systems (ISPS)最新文献

筛选
英文 中文
Cluster based key management in VANET networks VANET网络中基于集群的密钥管理
2015 12th International Symposium on Programming and Systems (ISPS) Pub Date : 2015-04-28 DOI: 10.1109/ISPS.2015.7244961
B. Chaima, Farouvan Kamel Mohame, Bouki Hacene Sofiane
{"title":"Cluster based key management in VANET networks","authors":"B. Chaima, Farouvan Kamel Mohame, Bouki Hacene Sofiane","doi":"10.1109/ISPS.2015.7244961","DOIUrl":"https://doi.org/10.1109/ISPS.2015.7244961","url":null,"abstract":"Vehicular networks VANET announce as the communication networks of the future, where the mobility is the main idea. These networks should be able to interconnect vehicles. The optimal goal is that these networks will contribute to safer roads and more effective in the future by providing timely information to drivers and concerned authorities. They are therefore vulnerable to many types of attacks. Their success will undoubtedly confidence they bring to their users. The Traditional model does not meet with the new requirements of such networks where the characteristics resemble more of social models. In this paper, we present the various solutions proposed by different research teams working on the distribution of certificates and our proposal to adopt a new method of distributing certificates in VANET.","PeriodicalId":165465,"journal":{"name":"2015 12th International Symposium on Programming and Systems (ISPS)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124918611","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}
引用次数: 5
The teleoperation of a mobile robot in a network without a quality of service guaranteed 移动机器人在没有服务质量保证的网络中的远程操作
2015 12th International Symposium on Programming and Systems (ISPS) Pub Date : 2015-04-28 DOI: 10.1109/ISPS.2015.7244962
M. Masmoudi, L. K. El Boudadi, A. Loukil, Amine Dahane, M. Khelf
{"title":"The teleoperation of a mobile robot in a network without a quality of service guaranteed","authors":"M. Masmoudi, L. K. El Boudadi, A. Loukil, Amine Dahane, M. Khelf","doi":"10.1109/ISPS.2015.7244962","DOIUrl":"https://doi.org/10.1109/ISPS.2015.7244962","url":null,"abstract":"The fluctuation of the time delay in a communication network is one of the obstacles for many real-time applications such as teleoperation of mobile robots. To solve this problem, we propose in this paper an architecture that allows to predict in real-time the Round Trip Time (RTT) and an improved speed limit module (ISLM), in order to control the mobile robot speed and reach the desired destination successfully and safely. To overcome the long delays of video feedback from the slave site, we also used the virtual reality (VR) to simulate and monitor the current state of the teleoperated site in real-time and get a better control. We validate our work by implementing the proposed architecture in order to teleoperate our mobile robot, the pioneer 3AT, over various geographically distant locations. The obtained results confirm the robustness and effectiveness of the proposed architecture.","PeriodicalId":165465,"journal":{"name":"2015 12th International Symposium on Programming and Systems (ISPS)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122024203","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}
引用次数: 5
Dishonest recommendation attacks in wireless sensor networks: A survey 无线传感器网络中的不诚实推荐攻击研究
2015 12th International Symposium on Programming and Systems (ISPS) Pub Date : 2015-04-28 DOI: 10.1109/ISPS.2015.7244964
Farah Khedim, Nabila Labraoui, M. Lehsaini
{"title":"Dishonest recommendation attacks in wireless sensor networks: A survey","authors":"Farah Khedim, Nabila Labraoui, M. Lehsaini","doi":"10.1109/ISPS.2015.7244964","DOIUrl":"https://doi.org/10.1109/ISPS.2015.7244964","url":null,"abstract":"Trust and reputation models in wireless sensor networks (WSN) have been recently proposed by many researches as an innovative solution for guaranteeing an effective security mechanism. They play an important role in defending WSNs such as securing routing and data forwarding protocols, against insider attacks. However, despite of the advantages, reputation models face with several security issues, especially in the case of dishonest recommendation attacks, i.e. slandering, self-promoting and collusion where participants might give recommendations deviated from their real experience. In this paper we survey the current research related to dishonest recommendation attacks in WSNs. We have classified the schemes studied in two main categories: avoiding dishonest recommendations and dealing with dishonest recommendations. We provide an overview and a comparative study of these schemes and highlight the future research directions to address the drawbacks of existing protocols.","PeriodicalId":165465,"journal":{"name":"2015 12th International Symposium on Programming and Systems (ISPS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122241577","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 improved splat-based ray tracing for point-based objects 一个改进的基于飞溅的光线跟踪基于点的对象
2015 12th International Symposium on Programming and Systems (ISPS) Pub Date : 2015-04-28 DOI: 10.1109/ISPS.2015.7244984
A. Beddiaf, M. C. Babahenini
{"title":"An improved splat-based ray tracing for point-based objects","authors":"A. Beddiaf, M. C. Babahenini","doi":"10.1109/ISPS.2015.7244984","DOIUrl":"https://doi.org/10.1109/ISPS.2015.7244984","url":null,"abstract":"This paper aims to improve the process of photo-realistic images production in matter of quality of the point-based scenes rendered by splats using the ray tracing technique, where we exploit the intrinsic overlap of the splats to get per-pixel shading that is very close to Phong shading (in the case of polygonal meshes), without an additional preprocessing phase (no normal field computation for each splat). Moreover, this work is mainly introduced to have more accurate rendering on the edges and sharp regions. Note that our model does not require point cloud with high density, but they have to be hole-free and closed. The quality of the resulted images proves the efficiency of the proposed approach.","PeriodicalId":165465,"journal":{"name":"2015 12th International Symposium on Programming and Systems (ISPS)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127619931","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}
引用次数: 1
Social big data mining: A survey focused on opinion mining and sentiments analysis 社会大数据挖掘:一项侧重于意见挖掘和情绪分析的调查
2015 12th International Symposium on Programming and Systems (ISPS) Pub Date : 2015-04-28 DOI: 10.1109/ISPS.2015.7244976
Imene Guellil, K. Boukhalfa
{"title":"Social big data mining: A survey focused on opinion mining and sentiments analysis","authors":"Imene Guellil, K. Boukhalfa","doi":"10.1109/ISPS.2015.7244976","DOIUrl":"https://doi.org/10.1109/ISPS.2015.7244976","url":null,"abstract":"The emergence of social media and the huge amount of data generated by them, has lead researchers to study the possibility of their exploitation in order to identify hidden knowledge. Thus, two areas are attracting more and more interest in the research community, the opinion mining and sentiment analysis. The research papers in this field are increasing rapidly. However, few survey papers have been published in this area. The rare survey papers that have been published focusing on a particular aspect (for example, the sentiment classification techniques, the challenges and application of opinion mining and sentiment analysis, etc.) and don't concern the research work proposed this last two years. We propose, in this paper, a study of 60 recent papers (60 % published between 2013 and 2015) treating the social media mining. We compare this work regarding to several criteria. Finally, we present a table summarizing all studied work. Due to the richness of social media opinions, emotions and sentiments. We focus in this paper on opinion mining and sentiment analysis and show the position of this field in social media mining issues. Then, we describe them in detail by studying the research work on each task in these issues. We will finish by identifying a set of open issues that we will try to propose contributions in our future work.","PeriodicalId":165465,"journal":{"name":"2015 12th International Symposium on Programming and Systems (ISPS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127492455","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}
引用次数: 75
Accessing linked open data 访问链接的开放数据
2015 12th International Symposium on Programming and Systems (ISPS) Pub Date : 2015-04-01 DOI: 10.1109/ISPS.2015.7244956
Steffen Staab
{"title":"Accessing linked open data","authors":"Steffen Staab","doi":"10.1109/ISPS.2015.7244956","DOIUrl":"https://doi.org/10.1109/ISPS.2015.7244956","url":null,"abstract":"A core objective for linked data is the seamless mash-up of information from different data sources that serve data in an easy-to-deliver, resilient manner. The focus on the ease of serving data, however, puts significant burden on the consumer of linked open data. In particular, the consumer service must manage (i) data source discovery, (ii) data access, (iii) data source availability and (iv) data model and schema. In theory, querying, i.e. either federated querying of SPARQL 1.1 endpoints or link-traversal-based querying, is supposed to provide a layer of abstraction to facilitate data consumption. In practice, we will analyze and find that such querying is very useful, but using standards such as SPARQL 1.1 is far away from solving use case needs of data integration from linked data. We provide an analysis of the issues encountered when accessing linked open data and present our approach to tackle this problem. The approach includes effective and efficient capabilities for querying and programming against linked data sources indexing data in various ways, querying for objects represented in linked data and allowing for programming with them.","PeriodicalId":165465,"journal":{"name":"2015 12th International Symposium on Programming and Systems (ISPS)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134436919","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}
引用次数: 1
Parametric elliptic fourier descriptors for automated extraction of gait features for people identification 基于参数椭圆傅里叶描述子的步态特征自动提取
2015 12th International Symposium on Programming and Systems (ISPS) Pub Date : 2015-04-01 DOI: 10.1109/ISPS.2015.7244988
Imed Bouchrika
{"title":"Parametric elliptic fourier descriptors for automated extraction of gait features for people identification","authors":"Imed Bouchrika","doi":"10.1109/ISPS.2015.7244988","DOIUrl":"https://doi.org/10.1109/ISPS.2015.7244988","url":null,"abstract":"The interest in gait as a biometric is strongly motivated by the urgent necessity for automated recognition systems for surveillance applications and forensic analysis. Many studies have now shown that it is possible to recognize people by the way they walk i.e. Gait. As yet there has been little formal study of people recognition using the kinematic-related gait features. In this research study, we have investigated the use of Elliptic Fourier Descriptor for the temporal markerless extraction of human joints. We describe a model-based method whereby spatial model templates for the human motion are described in a parameterized form using the Elliptic Fourier Descriptors accounting for the different variations of scale and rotation. Gait features include the angular measurements of the legs as well as the spatial displacement of the body trunk. To further refine gait features based on their discriminability, a feature selection algorithm which is applied using a proposed validation-criterion based on the proximity of neighbors. Initial experiments have revealed that gait angular measurements derived from the joint motions mainly the ankle, knee and hip angles embed most of the discriminatory potency for gait identification.","PeriodicalId":165465,"journal":{"name":"2015 12th International Symposium on Programming and Systems (ISPS)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125287035","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}
引用次数: 12
A distributed foraging algorithm based on artificial potential field 一种基于人工势场的分布式觅食算法
2015 12th International Symposium on Programming and Systems (ISPS) Pub Date : 2015-04-01 DOI: 10.1109/ISPS.2015.7244986
Ouarda Zedadra, Hamid Seridi, Nicolas Jouandeau, G. Fortino
{"title":"A distributed foraging algorithm based on artificial potential field","authors":"Ouarda Zedadra, Hamid Seridi, Nicolas Jouandeau, G. Fortino","doi":"10.1109/ISPS.2015.7244986","DOIUrl":"https://doi.org/10.1109/ISPS.2015.7244986","url":null,"abstract":"Simple collections of agents that perform collectively and use distributed control algorithms constitute the interests of swarm robotics. A key issue to improve system performances is to effectively coordinate the team of agents. We present in this paper a multi-agent foraging algorithm called Cooperative-Color Marking Foraging Agents (C-CMFA). It uses the coordination rules of the S-MASA (Stigmergic Multi-Ant Search Area) algorithm to (i) speed up the search process and (ii) allow agents to build an optimal Artificial Potential Field (APF) simultaneously while exploring. To benefit from multiple robots, we add one cooperation rule in the algorithm to attract a large number of agents to the found food. This algorithm constitutes a distributed and synchronous version of the c-marking algorithm. Simulation results in comparison with the c-marking one show the superiority of C-CMFA in different environment configurations.","PeriodicalId":165465,"journal":{"name":"2015 12th International Symposium on Programming and Systems (ISPS)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131418158","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
首页 上一页
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学术文献互助群
群 号：604180095
Book学术官方微信