By Topic

Computer Systems and Applications (AICCSA), 2010 IEEE/ACS International Conference on

Date 16-19 May 2010

Filter Results

Displaying Results 1 - 25 of 123
  • AICCSA 2010 - Table of contents

    Publication Year: 2010 , Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (9702 KB)  
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2010 , Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (22 KB)  
    Freely Available from IEEE
  • [Front cover]

    Publication Year: 2010 , Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (343 KB)  
    Freely Available from IEEE
  • AICSSA 2010 - organizing committee

    Publication Year: 2010 , Page(s): 1 - 2
    Save to Project icon | Request Permissions | PDF file iconPDF (123 KB)  
    Freely Available from IEEE
  • Cloud Computing - an IT paradigm changer

    Publication Year: 2010 , Page(s): 1
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (62 KB) |  | HTML iconHTML  

    Cloud Computing is an emerging computing paradigm envisioned to change all IT landscape facets including technology, business, services and human resources. It is a consumer/delivery model that offers IT capabilities as services, billed based on usage. Many such cloud services can be envisioned, but the leading ones are IaaS (Infrastructure-as-a-Service), PaaS (Platform-as-a-Service), and SaaS (Software-as-a-Service). View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Wireless multimedia sensor and actuator system: A necessary public security and safety testbed for an urban emergency preparedness class of applications

    Publication Year: 2010 , Page(s): 1
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (63 KB) |  | HTML iconHTML  

    This talk will consist in an overview about the majore search projects related to wireless multimedia, context aware computing and wireless ad hoc and sensor networks, distributed and collaborative virtual environment, which we are currently investigating at PARADISE Research Laboratory, uOttawa. Next, we shall focus upon the design of large-scale distributed and mobile system for critical conditions monitoring class of applications using both location/context aware computing and wireless multimedia sensor and actor technologies. Then, we shall focus upon the security and localization problems in mobile and wireless multimedia sensor networks. Finally, if time permits, we will talk about LIVE testbed, a convergence of Wireless sensors, wireless multimedia and virtual environment technologies we are developing at PARADISE Research Laboratory for an emergency preparedness and response class of applications as well as SWiMNet, a high performance testbed we have developed which allows very detailed and realistic model specifications. It will facilitate and enable us to evaluate and design new protocols and applications for future generations of wireless sensor and vehicular network technologies. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Advances in e-Infrastructures for computational sciences and engineering

    Publication Year: 2010 , Page(s): 1
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (67 KB) |  | HTML iconHTML  

    Summary form only: Over the last 50 years, computational sciences and engineering have advanced the development of new and ever faster and better computers, algorithms, and software tools, and vice versa, computers have advanced sciences. But the better the technologies the more demanding our computational science applications. This progress is everywhere, at the level of technologies and computer architectures, at the middleware level, at the algorithm and application level, and even at the level of computing paradigms, where we evolved from mainframes, to vector and parallel computers, to grids and clouds, recently. We successfully optimized our algorithms and mapped them to the underlying architecture, e.g. with overlapping communication with computation, better load balancing through domain decomposition into parallel processes, or using library routines optimized for the specific architecture and processors. In our presentation, we will concentrate on the use of grid and cloud technologies for HPC, focusing on the European EU-funded DEISA Distributed European Infrastructure for Supercomputing Applications project, analyzing different HPC loads and their suitability for grids and for clouds, and taking a closer look at lessons learned and recommendations on how to build sustainable e-Infrastructures for computational sciences and engineering in the future. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A more efficient MOPSO for optimization

    Publication Year: 2010 , Page(s): 1 - 7
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (175 KB) |  | HTML iconHTML  

    Swarm-inspired optimization has become very popular in recent years. The multiple criteria nature of most real world problems has boosted research on multi-objective algorithms that can tackle such problems effectively, with the computational burden and colonies. Particle Swarm Optimization (PSO) and Ant colony Optimization (ACO) have attracted the interest of researchers due to its simplicity, effectiveness and efficiency in solving optimization problems. We use the notion of multi-objective Particle Swarm Optimization (MOPSO) for few methods; and we find in most of the results; more the number of the swarm increases more the accuracy of object is achieved with greater accuracy. Performance of the basic swarm for small problems with moderate dimensions and searching space is satisfactory. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A framework for real time communication in sensor networks

    Publication Year: 2010 , Page(s): 1 - 7
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (457 KB) |  | HTML iconHTML  

    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. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A hybrid performance modeling approach for adaptive algorithm selection on hierarchical clusters

    Publication Year: 2010 , Page(s): 1 - 8
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (467 KB) |  | HTML iconHTML  

    Recent advances in parallel and distributed computing have made it very challenging for programmers to reach the performance potential of current systems. In addition, recent advances in numerical algorithms and software optimizations have tremendously increased the number of alternatives for solving a problem, which further complicates the software tuning process. Indeed, no single algorithm can represent the universal best choice for efficient solution of a given problem on all compute substrates. In this paper, we develop a framework that addresses the design of efficient parallel algorithms in hierarchical computing environments. More specifically, given multiple choices for solving a particular problem, the framework uses a judicious combination of analytical performance models and empirical approaches to automate the algorithm selection by determining the most suitable execution scheme expected to perform the best at the specific setting. Preliminary experimental results obtained by implementing two different numerical kernels demonstrated the interest of the hybrid performance modeling approach integrated in the framework. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Predictive multi-hop stable routing in Vehicular Ad Hoc Networks

    Publication Year: 2010 , Page(s): 1 - 6
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (93 KB) |  | HTML iconHTML  

    The past few years have observed vehicular networks becoming increasingly important in order to exchange information between stationary or moving vehicles. The information exchanged can range from warning messages in case of accidents that have occurred on the road and traffic jams to guiding the vehicles about the most efficient path to reach their destination. The biggest challenge, a vehicular network routing protocol faces, is providing a stable packet delivery mechanism. The proposed PMH protocol aims at providing a high packet delivery ratio by selecting each next node (vehicle) in the path from the source to the destination based on a parameter called the Disconnection Probability Metric (DPM). The DPM mainly represents the link breakage probability between nodes and the node with the least DPM is selected as the next node. Moreover, the PMH protocol also calculates the predicted link lifetime based on which it initiates the route selection algorithm before the weakest link actually breaks. This mechanism further enhances the usefulness of the algorithm as there is lesser control overhead to overcome link breakage. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data analyzer based on data mining for Honeypot Router

    Publication Year: 2010 , Page(s): 1 - 6
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (318 KB) |  | HTML iconHTML  

    Honeypot is an effective security tool, which is intended to be attacked and compromised to gain more information about the attacker and his attack techniques. To study these attacks, the honeypot must capture and log large amounts of data which are very difficult to process manually. So, the analysis of these logs has become a very difficult and time consuming task. To resolve this problem, several researchers have proposed the use of data mining techniques in order to classify logged traffic and extract useful information. In this paper, we present a data analysis tool for our Honeypot Router. This tool is based on data mining clustering. The main idea is to extract useful features from data captured by the Honeypot Router. These data will be then clustered by using the DBSCAN clustering algorithm in order to classify the captured packets and extract those that are suspicious. Suspicious packets will be then verified by a human expert. This solution is very useful to detect novel routing attacks. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Empirical performance evaluation of a fast authentication scheme in wireless access networks

    Publication Year: 2010 , Page(s): 1 - 6
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1214 KB) |  | HTML iconHTML  

    Wireless access using contributed access points is fast becoming a reality. Technological means are now available for realizing this “anywhere anytime” low-cost wireless access whereby un-utilized wireless resources can be harnessed to form a collaborative network for public access. The success of such access facilities depend largely on the provisioning of fast authentication among the access points. This is crucial for supporting real-time applications such as Voice Over IP (VoIP). In our earlier work, we had developed an inter-domain fast authentication scheme based on the concept of “trust-clouds”. A trust-cloud is formed among neighbouring access points based on a relationship among the owners of the access points. Fast authentication among these inter-domain sites is achieved through cooperation among the trust-cloud members. In previous work, we theoretically formulated the concept of trust-clouds. In this paper we report on the implementation and experimental results of the “trust-clouds” fast authentication concept on legacy hardware. The experimental results verify that the trust-cloud framework can yield significant delay gains for the authentication process when handing off between administrative domains. It is also shown that no special computing platform is needed to achieve these benefits, indeed our testbed was implemented on low end hardware. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Classifying bags of keypoints using HMMs

    Publication Year: 2010 , Page(s): 1 - 2
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (220 KB) |  | HTML iconHTML  

    In this paper, we use a Hidden Markov Models (HMM) to classify bags of SURF keypoints descriptors of a given class. The performance of this technique is compared to that of others, by testing it on various multi-class datasets. We also describe a prospective of expanding our application to include the detection and classification of moving objects in a video stream using optical flow and Self Organizing Maps (SOM). View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A component based testing technique for a MANET routing protocol

    Publication Year: 2010 , Page(s): 1 - 7
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (156 KB) |  | HTML iconHTML  

    This paper deals with the crucial challenging issue of testing the conformance of the MANET routing protocols. Indeed, because of the inherent constraints of such networks such as a dynamic topology, to formally test these protocols becomes a tough problem. Most of the studies taking into account a formal model of the protocol is faced to the combinatorial state space explosion issue when deploying and analyzing that model. In our work we present how to cope with that problem by drawing inspiration of the model-checker research domain and an integration of a component-based testing algorithm dedicated to the automatic generation of OLSR test sequences from a formal model written in Promela. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Path computation with multiple constraints QoS in multi-domain

    Publication Year: 2010 , Page(s): 1 - 8
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (481 KB) |  | HTML iconHTML  

    The interest for providing services with performance guarantees across different connected networks has given new technical solutions allowing the computation of constrained inter-domain paths. Thus, the present paper treats the problem of computing inter-domain paths subject to multiple constraints. We study here existing algorithms for inter-domain computations, and describe new approach approximating exact solutions. Some previous study proposed an exact solution, named pID-MCP, allowing the pre computation of path segments in the domains. We propose a novel algorithm named ID-MCPAA that treats the computational complexity of the problem, can find a feasible path not found by previous solutions and ameliorate existing techniques. Our algorithm is compatible with existing techniques and fulfills the multi constraints requirements after proving the correctness and the complexity of exact solutions, we evaluate by simulation the performance of the algorithm. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A novel Geocast technique with hole detection in underwater sensor networks

    Publication Year: 2010 , Page(s): 1 - 8
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (263 KB) |  | HTML iconHTML  

    Most of the work on geocasting has been done for mobile ad-hoc networks and vehicular ad-hoc networks. This paper presents a novel Geocast technique with the hole detection in the geocast region for underwater environment. The proposed model named as Routing and Multicast Tree based Geocasting (RMTG) has been designed for underwater sensor networks. Here we propose a theoretical model for underwater geocasting RMTG that uses greedy forwarding and previous hop handshaking to route the packets towards the geocast region. This technique further disseminates the data within the geocast region by creating a multicast shortest path tree. The technique also proposes a method of hole detection inside the geocast region and a virtual area based routing around the boundaries of the geocast region to reach the geocast region from opposite side. This model provides an efficient geocast technique in terms of node mobility handling, lesser memory utilization, lesser calculations and a better end to end latency. In addition to this the proposed model does not use flooding inside the geocast region that is used in most of the geocasting techniques and also for guaranteed data delivery inside the geocast region, the proposed model does not use the planarization graph concepts. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Feedback architecture for multimedia systems

    Publication Year: 2010 , Page(s): 1 - 8
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1585 KB) |  | HTML iconHTML  

    Multimedia applications usually manage large quantities of data in the form of frames of certain types. To ensure a flowing traffic of these frames through the network, temporal constraints must be respected when sending and receiving these frames. If the temporal constraints are not met, then the quality of service (QoS) provided to users decreases. In this paper, we exploit some results obtained in QoS management in Real-Time Databases Systems (RTDBSs), and we apply them to multimedia applications, because of similarities existing between these two fields. We propose a new method allowing to control the QoS provided to clients according to the system congestion. To this purpose, we implement a feedback architecture into a master server, allowing us to adapt the quality of service in the distributed multimedia system according to the network state. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A multi-agent based decision mechanism for incident reaction in telecommunication network

    Publication Year: 2010 , Page(s): 1 - 2
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (397 KB) |  | HTML iconHTML  

    The paper provides a global architectural and decision support solution for a reaction after alert detection mechanisms in the frame of information systems security applied to telecom infrastructures. Therefore, the architecture is developed in a distributed perspective and is composed of three basic layers: the low level that constitutes the interface between the architecture and the infrastructure. The intermediate level that is responsible of correlating the alerts coming from different domains of the infrastructure and to deploy the reaction actions. The architecture is elaborated using a MAS associated to the OntoBayes model for decision mechanism. This model helps agents to make decisions according to preference values and is built upon ontology based knowledge sharing, Bayesian networks based uncertainty management and influence diagram. The major novelty of this Decision Support System is the layered view of the infrastructure thanks to MAS architecture, which enables the decision making with different levels of knowledge. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Managing conversational streams by explorative mind-maps

    Publication Year: 2010 , Page(s): 1 - 4
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (288 KB) |  | HTML iconHTML  

    In this paper, we introduce an explorative but adaptive-associative information management system in the presence of a natural conversation. We take advantage of explorative mind-maps, which have been demonstrated in [10] and which are altogether a management framework that emerges automatically from the data input stream it gets. An explorative mind-map is a non-verificative but dynamic system that basis on the natural paradigm: it changes its complexity continuously and fosters symbolic cells according to internal activation states. Generally, the structure mirrors a mental state where the oblivion of associated facts arrive once the stimulation decreases. Considering two mind-maps A1,2 and B1,2 for two conversational partners A and B, the mind-map *1 represents the self-conversation and *2 the conversational stream of the conversational partner. If we merge these mind-maps, we may apply the out-coming results for the computation of trust. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An agent-based approach for vertical handover in heterogeneous wireless networks

    Publication Year: 2010 , Page(s): 1 - 8
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1283 KB) |  | HTML iconHTML  

    One of the vision of next generation networks is an all-IP network supporting heterogeneous access technologies for the purpose of providing the mobile user with roaming capability across different networks. To enable this type of mobility known as vertical handover (VHO), an intelligent technique is needed in order to perform the service continuity. This paper presents a multi-agent based approach for the VHO. We propose to introduce the agents in the mobile nodes (MNs) and Access Points (APs) to collect the necessary information from the environment. Based on this information, agents will anticipate the handover in order to reduce the handover latency. We have defined three behaviors (Network Monitoring, Decision, and Network Selection) for the agents that will assist us in anticipating the handover. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluations of the strong ground motion parameter by neural computing and microtremor measurement

    Publication Year: 2010 , Page(s): 1 - 7
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (528 KB) |  | HTML iconHTML  

    In this study, a new weight-based neural network model was developed in accordance with a series of historical seismic records to estimate peak ground acceleration at a total of 33 train stations in the Kaohsiung mass rapid transit system of Taiwan. The performance of this model was compared with a simple distribution model and an available ambient vibration survey. The comparison of results showed that the neural network models exhibit a variation tendency similar to the microtremor measurements for all the train stations. The results also showed that over 90% of estimations by the weight-based neural network model were smaller than that of the simple distribution model, and the former model proved to perform better, as the estimations were closer to the survey data for most of the cases. This type of weight-based neural network model might capture the actual response at a construction site more closely, and the results obtained confirm that all train stations comply with the seismic requirement of the building code. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • State of art and practice of COTS components search engines

    Publication Year: 2010 , Page(s): 1 - 8
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1438 KB) |  | HTML iconHTML  

    COTS-Based Software Development has emerged as an approach aiming to improve a number of drawbacks found in the software development industry. The main idea is the reuse of well-tested software products, known as Commercial-Off-The-Shelf (COTS) components, that will be assembled together in order to develop larger systems. The potential benefits of this approach are mainly its reduced costs and shorter development time, while ensuring the quality. One of the most critical activities in COTS-based development is the identification of the COTS candidates to be integrated into the system under development. Nowadays, the Web is the most used means to find COTS candidates. Thus, the use of search engines turns out to be crucial. This paper deals with existing search engines especially proposed to find COTS components satisfying some needs on the Web. It presents a state of the art and practice of search engines followed by a study assessing to which extent they are able to accomplish their objectives. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some side effects of FHSS on Bluetooth networks distributed algorithms

    Publication Year: 2010 , Page(s): 1 - 8
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1090 KB) |  | HTML iconHTML  

    We present, in this paper, two case studies showing the substantial impact of some features in the Bluetooth specifications on Bluetooth networks distributed algorithms. These features were often neglected in previous research studies, and are related to the Frequency Hopping Spread Spectrum (FHSS) technique used in Bluetooth. The first case study shows that some small changes in the specifications of Bluetooth can have a substantial positive impact static Bluetooth Scatternet Formation (BSF) algorithms but not the dynamic BSF algorithms. The second case shows that a small change in the implementation of the Bluetooth specifications can have a substantial negative impact on static BSF algorithms. This study calls for more research on the side-effects of using the FHSS technique in Bluetooth and calls for more publishing of similar results to help to understand more distributed algorithms running over Bluetooth networks. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An improved genetic algorithm for efficient scheduling on distributed memory parallel systems

    Publication Year: 2010 , Page(s): 1 - 8
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (212 KB) |  | HTML iconHTML  

    A key issue related to the distributed memory multiprocessors architecture for achieving high performance computing is the efficient scheduling of heavily communicated parallel applications such that the total execution time is minimized. Therefore, this paper provides a genetic algorithm based on task clustering techniques for scheduling parallel applications with large communication delays on distributed memory parallel systems. The genetic algorithm is improved with the introduction of some extra knowledge about the scheduling problem. This knowledge is represented by a class of clustering heuristic which is based on structural properties of the parallel application. The major feature of the proposed algorithm is that it takes advantage of the effectiveness of task clustering for reducing communication delays combined with the ability of the genetic algorithms for exploring and exploiting information of the search space of the scheduling problem. The algorithm is assessed by simulation run on some families of traced graphs which represents some of the numerical parallel application programs, and a set of randomly generated applications. Simulation results showed that this algorithm significantly improves the performance of related approaches. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.