Advances inWireless,Mobile Networks and Applications (WiMoA 2011 and ICCSEA 2011)

An Efficient Mining of Dominant Entity Based Association Rules in Multi-databases (WiMoA 2011 and ICCSEA 2011)

Abstract Today, we have a large collection of data that is organized in the form of a set of relations which is partitioned into several databases. There could be implicit associations among various parts of this data. In this paper, we give a scheme for retrieving these associations using the notion of dominant entity. We […]

Mitigation of Transient Loops in IGP Networks (WiMoA 2011 and ICCSEA 2011) Part 1

Abstract Routing loops have recently re-emerged as an important issue in new carrier class Ethernet technologies such as IEEE 802.1aq. While they can waste resources through full link utilization, routing loops were originally mitigated in IP networks by TTL expiration, resulting in wasted resources before packets were dropped after a few seconds. In this paper […]

Mitigation of Transient Loops in IGP Networks (WiMoA 2011 and ICCSEA 2011) Part 2

Implementations and Results TTL Relaxation Fig 4 shows the utilization of the link containing the loop for all six cases, for varying loop durations, and without consideration of EPD. In the first four cases (1-4),utilization increases with the duration of the loop in a linear fashion until it reaches 100% when the loop duration is […]

An Efficient Algorithm to Create a Loop Free Backup Routing Table (WiMoA 2011 and ICCSEA 2011)

Abstract Traditional routing protocols schemes allow traffic to pass via the single shortest path. Pre-computing an alternative aims to route the traffic through it when the primary path goes down. A new algorithm schema has been proposed in this paper to find an alternative and disjoint path with primary one by creating a new backup […]

A Low Cost Moving Object Detection Method Using Boundary Tracking (WiMoA 2011 and ICCSEA 2011)

Abstract Moving object detection techniques have been studied extensively for such purposes as video content analysis as well as for remote surveillance. Video surveillance systems rely on the ability to detect moving objects in the video stream which is a relevant information extraction step in a wide range of computer vision applications. There are many […]

Mitigating Soft Error Risks through Protecting Critical Variables and Blocks (WiMoA 2011 and ICCSEA 2011)

Abstract Down scaling of CMOS technologies has resulted in high clock frequencies, smaller features sizes and low power consumption. But it reduces the soft error tolerance of the VLSI circuits. Safety critical systems are very sensitive to soft errors. A bit flip due to soft error can change the value of critical variable and consequently […]

Animations and Simulations: Learning and Practice of Algorithmic (WiMoA 2011 and ICCSEA 2011)

Abstract We try to show in this paper that animations and simulations are often presented as how learning tools, even though all the animations are not really able to fulfill this role. We define what a graphic animation and simulation to show that, in education systems, they should only be used if they have something […]

Dynamic Task Allocation in Networks-on-Chip (WiMoA 2011 and ICCSEA 2011) Part 1

Abstract The run-time strategy for allocating the application tasks to platform resources in homogeneous Networks-on-Chip (NoCs) is enhanced with respect to minimising the communication energy consumption. As novel contribution, the entity Life-Time (LT) is incorporated to a node of an application characteristics graph (ACG), used for describing an incoming application. Several algorithms are then modified […]

Dynamic Task Allocation in Networks-on-Chip (WiMoA 2011 and ICCSEA 2011) Part 2

Solving the Region Selection Sub-problem (P3) The main goal of this sub-problem is to select a near convex region of resources to minimize the external contention. The solution of problem P3 is same as [9]. Solving the Application Mapping Sub-problem (P4) Here, the main goal is to map the application tasks in ACG to the […]

Congruence Results of Weak Equivalence for a Graph Rewriting Model of Concurrent Programs with Higher-Order Communication (WiMoA 2011 and ICCSEA 2011)

Abstract This paper presents congruence results of a weak equivalence on a graph rewriting model of concurrent processes with higher-order communication. A bipartite directed acyclic graph represents a concurrent system that consists of a number of processes and messages in our model. The model presented here makes it possible to represent local names that their […]

← Previous Entries

Next Entries →