ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010最新文献_第9页

Generate secure mobile agent by using SMS to protect Hosts 通过短信方式生成安全移动代理，保护主机安全

ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010 Pub Date : 2010-05-16 DOI: 10.1109/AICCSA.2010.5586947

T. M. Ahmed

引用次数: 4

A component and aspect-based platform for simulating Real-Time Databases 一个用于模拟实时数据库的组件和基于方面的平台

ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010 Pub Date : 2010-05-16 DOI: 10.1109/AICCSA.2010.5586941

L. Baccouche, S. Limam

引用次数: 0

A framework for real time communication in sensor networks 传感器网络中的实时通信框架

ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010 Pub Date : 2010-05-16 DOI: 10.1109/AICCSA.2010.5587046

M. Aalsalem, J. Taheri, Albert Y. Zomaya

{"title":"A framework for real time communication in sensor networks","authors":"M. Aalsalem, J. Taheri, Albert Y. Zomaya","doi":"10.1109/AICCSA.2010.5587046","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5587046","url":null,"abstract":"The introduction of real time communication has created additional challenges in the wireless networks area with different communication constraints. Sensor nodes spend most of their lifetime functioning as a small router to deliver packets from one node to another until the packet reaches the sink. Since sensor networks represent a new generation of time-critical applications, it is often necessary for communication to meet real time constraints as well as other constrains. Nevertheless, research dealing with providing QoS guarantees for real time traffic in sensor networks is still in its infancy. This paper presents a novel packet delivery mechanism, namely Multiple Level Stateless Protocol (MLSP), as a real time protocol for sensor networks to guarantee the quality of traffic in wireless Sensor Networks. MLSP improves the packet loss rate and handles holes in sensor networks. This paper also introduces the k-limited polling model. This model is used in a sensor network by the implementation of two queues served according to a 2-limited polling model in a sensor node. Here, two different classes of traffic are considered and the exact packet delay for each corresponding class is calculated. The analytical results are validated through an extensive simulation study.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128268375","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

A design approach for numerical libraries in large scale distributed systems 大型分布式系统中数字库的设计方法

ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010 Pub Date : 2010-05-16 DOI: 10.1109/AICCSA.2010.5586951

N. Emad, O. Delannoy, Makarem Dandouna

{"title":"A design approach for numerical libraries in large scale distributed systems","authors":"N. Emad, O. Delannoy, Makarem Dandouna","doi":"10.1109/AICCSA.2010.5586951","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5586951","url":null,"abstract":"Nowadays, large scale distributed systems gather thousands of nodes with hierarchical memory models. They are heterogeneous, volatile and geographically distributed. The efficient exploitation of such systems requires the conception and adaptation of appropriate numerical methods, the definition of new programming paradigms, new metrics for performance prediction, etc. The modern hybrid numerical methods are well adapted to this kind of systems. This is particularly because of their multi-level parallelism and fault tolerance property. However the programming of these methods for these architectures requires concurrent reuse of sequential and parallel code. But the currently existing numerical libraries aren't able to exploit the multi-level parallelism offered by theses methods. A few linear algebra numerical libraries make use of object oriented approach allowing modularity and extensibility. Nevertheless, those which offer modularity,sequential and parallel code reuse are almost non-existent. In this paper, we analyze the lacks in existing libraries and propose a design based on a component approach and the strict separation between computation operations, data management and communication control of an application. We present then an application of this design using YML scientific workflow environment (http://yml.prism.uvsq.fr/) jointly with the object oriented LAKe (Linear Algebra Kernel) library. Some numerical experiments on GRID5000 platform validate our approach and show its efficiency.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131117720","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

A cluster based secure architecture for vehicular ad hoc networks 基于集群的车辆自组织网络安全体系结构

ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010 Pub Date : 2010-05-16 DOI: 10.1109/AICCSA.2010.5586996

Tahani Gazdar, A. Belghith, A. Benslimane

引用次数: 7

Control for continuous-time Markovian Jumps Linear Systems associated with a finite number of jump times 具有有限跳变次数的连续马尔可夫跳变线性系统的控制

ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010 Pub Date : 2010-05-16 DOI: 10.1109/AICCSA.2010.5586975

C. Nespoli

引用次数: 0

A dynamic barriers implementation in Bayesian-based bow tie diagrams for risk analysis 用于风险分析的基于贝叶斯的领结图中的动态屏障实现

ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010 Pub Date : 2010-05-16 DOI: 10.1109/AICCSA.2010.5587003

Ahmed Badreddine, N. B. Amor

引用次数: 11

The open Capacitated Arc Routing Problem: Complexity and algorithms 开放电容电弧布线问题:复杂性与算法

ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010 Pub Date : 2010-05-16 DOI: 10.1109/AICCSA.2010.5586978

Paulo Morelato França, F. Usberti, A.L.M. França

{"title":"The open Capacitated Arc Routing Problem: Complexity and algorithms","authors":"Paulo Morelato França, F. Usberti, A.L.M. França","doi":"10.1109/AICCSA.2010.5586978","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5586978","url":null,"abstract":"The Capacitated Arc Routing Problem (CARP) [1] is a well-known combinatorial optimization problem in which, given an undirected graph G(V ;E) with non-negative costs and demands associated to the edges, we have M identical vehicles with capacity D that must traverse all edges with positive demand. The vehicles must start and finish their tours at a depot node, without transgressing their capacity. The objective is to search for a solution of minimum cost. The CARP was shown to be NP-hard [1], which means that an exact polynomial algorithm for this problem is most unlikely. Nevertheless, there are several heuristics that tackle this problem and which perform very well in most cases. Some of these are path-scanning [2], [3], augment-merge [1], augment-insert [4], among other heuristics [5], [6]. Even better solutions were obtained through meta-heuristics such as the tabu search [7], as well as a genetic algorithm [8], a hybrid tabu-scatter search algorithm [9], and a guided local search [10]. There is also an exact algorithm for the CARP based upon a branch-and-bound strategy [11] which, however, can solve only small size instances (up to 20 required edges). Furthermore, there are algorithms that can determine upper and lower bounds for the CARP [12].","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129394991","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

Efficient sender authentication and signing of multicast streams over lossy channels 在有损信道上有效的发送方身份验证和多播流签名

ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010 Pub Date : 2010-05-16 DOI: 10.1109/AICCSA.2010.5586962

Hamdi Eltaief, H. Youssef

引用次数: 6

A multi-agent based decision mechanism for incident reaction in telecommunication network 基于多智能体的电信网络事件反应决策机制

ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010 Pub Date : 2010-05-16 DOI: 10.1109/AICCSA.2010.5587036

C. Bonhomme, C. Feltus, D. Khadraoui

引用次数: 9