Many real-world data warehouse applications involve navigation of large highly connected hierarchies e.g. web pages, product catalogs, and document hot topics hierarchies. Quite often users are confused and overwhelmed with many complex displays. This paper discusses a new invisible link technique for linking a large highly connected graph in a hyperbolic space without cluttering the display. O...

In wireless sensor network to make reliable path connectivity and packet exchange will take more time and also need more power. Two techniques are analysed here to reduce time and maintain power consumption. One of the techniques is Continuous Neighbor Discovery, It will find neighbor node and also continuously maintain a immediate neighbour node view. Another one is Link Assessment Method, It ...

This paper addresses a method to analyze the covert social network foundation hidden behind the terrorism disaster. It is to solve a node discovery problem, which means to discover a node, which functions relevantly in a social network, but escaped from monitoring on the presence and mutual relationship of nodes. The method aims at integrating the expert investigator’s prior understanding, insi...

We demonstrate that the self-similarity of some scale-free networks with respect to a simple degree-thresholding renormalization scheme finds a natural interpretation in the assumption that network nodes exist in hidden metric spaces. Clustering, i.e., cycles of length three, plays a crucial role in this framework as a topological reflection of the triangle inequality in the hidden geometry. We...

Hidden nodes are a basic problem that can potentially influence any multi-hop wireless networks where nodes cannot hear each other. Even though the hidden node problem is well known, its effects have not been quantified so well in a comprehensive manner up to now. This paper presents a novel framework for the queuing analysis towards getting a quantitative insight into the impact of hidden node...

In multimodal biometric system, the effective fusion method is necessary for combining information from various modality systems. In this study a new approach to overcome the limitations by using multiple pieces of evidence of the same identity: iris and fingerprint, by combining ELM and Genetic Algorithm. According to ELM theory: “The hidden node / neuron parameters are not only independent of...

In this paper, we propose a novel game-theoretical solution to the multi-path routing problem in wireless ad hoc networks comprising selfish nodes with hidden information and actions. By incorporating a suitable traffic allocation policy, the proposed mechanism results in Nash equilibria where each node honestly reveals its true cost, and forwarding subgame perfect equilibrium in which each nod...

We present a new implementation of TDMA communication protocol for wireless sensor networks. The ITEM (Integrated TDMA E-ASAP Module) is a TinyOS 1.x module primarily determined for TelosB platform. It provides a TDMA (Time Division Multiple Access) communication protocol integrated with slot assignment protocol E-ASAP (Extended Adaptive Slot Assignment Protocol). The ITEM module deals with a c...

Computational intelligence is a powerful tool for game development. In this paper, an algorithm of playing the game Tic-Tac-Toe with computational intelligence is developed. This algorithm is learned by a Neural Network with Double Transfer functions (NNDTF), which is trained by genetic algorithm (GA). In the NNDTF, the neuron has two transfer functions and exhibits a node-to-node relationship ...

A discrete-time random process is described, which can generate bursty sequences of events. A Bernoulli process, where the probability of an event occurring at time t is given by a fixed probability x, is modified to include a memory effect where the event probability is increased proportionally to the number of events that occurred within a given amount of time preceding t. For small values of...