Informatics

Controlled Sink Mobility Algorithms for Wireless Sensor Networks
A wireless sensor network (WSN) consists of hundreds or thousands of sensor nodes organized in an ad hoc manner to achieve a predefined goal. Although WSNs have limitations in terms of memory and processors, the main constraint that makes WSNs different from traditional networks is the battery problem which limits the lifetime of a network. Different approaches are proposed in the literature fo...


Energy Consumption Evaluation for Wireless Sensor Network Nodes Based on Queuing Petri Net
Due to the large scale of wireless sensor networks (WSN) and the huge density of WSN nodes, classical performance evaluation techniques face new challenges in view of the complexity and diversity in WSN applications. This paper presents a “state-event-transition” formal description for WSN nodes and proposes an event-driven -based modeling technique to simulate the energy behaviors of nodes...
Towards a comprehensive model of the cognitive process and mechanisms of individual sensemaking
This review introduces a comprehensive model of the cognitive process and mechanisms of individual sensemaking to provide a theoretical basis for:empirical studies that improve our understanding of the cognitive process and mechanisms of sensemaking and integration of results of such studies;education in critical thinking and sensemaking skills;the design of sensemaking assistant tools that sup...


Provisioning of dynamic traffic in mixed-line-rate optical networks with launch power determination
In mixed-line-rate (MLR) networks, different line rates on different wavelengths can coexist on the same fiber. MLR architectures can be built over transparent optical networks, where the transmitted signals remain in the optical domain along the entire path. Along the transparent optical path, a signal experiences various physical layer impairments (PLIs), and its quality degrades as it travel...
Relaxed observer design of discrete-time T–S fuzzy systems via a novel multi-instant fuzzy observer
This paper is concerned with the design of observer for discrete-time Takagi–Sugeno fuzzy systems. Under the framework of multi-instant matrix, a novel fuzzy observer and a new Lyapunov function, which are parameter-dependent on m-steps normalized fuzzy weighting functions, are proposed for conceiving less conservative observer design conditions. In particular, some existing fuzzy Lyapunov fu...


Varieties of Analog and Digital Representation
The ‘received view’ of the analog–digital distinction holds that analog representations are continuous while digital representations are discrete. In this paper I first provide support for the received view by showing how it (1) emerges from the theory of computation, and explains engineering practices. Second, I critically assess several recently offered alternatives, arguing that to the...
Design of efficient packing system using genetic algorithm based on hyper heuristic approach
In practice the maximum usage of container space arises in many applications which is one of the crucial economical requirements that have a wide impact on good transportation. A huge amount of monetary infrastructure is spent by companies on packing and transportation. This study recommends that there exists a scope for further optimization which if implemented can lead to huge saving. In this...

Adaptive reversible data hiding with pyramidal structure
In this paper, we propose an adaptive algorithm for reversible data hiding by employing the characteristics and pyramidal relationships of original images. The major goal of reversible data hiding is to keep the reversibility of algorithm. By use of the pyramidal structure to explore the inherent characteristics of original images, regions with different smoothness levels can be determined, and...
Curve interpolation and shape modeling via probabilistic nodes combination
The proposed method, called probabilistic nodes combination (PNC), is the method of 2D curve interpolation and modeling using the set of key points (knots or nodes). Nodes can be treated as characteristic points of the object for modeling. The model of each individual symbol or data can be built by choice of probability distribution function and nodes combination. PNC modeling via nodes combina...

Cellular topology and topological coordinate systems on the hexagonal and on the triangular grids
In this paper we use symmetric coordinate systems for the hexagonal and the triangular grids (that are dual of each other). We present new coordinate systems by extending the symmetric coordinate systems that are appropriate to address elements (cells) of cell complexes. Coordinate triplets are used to address the hexagon/triangle pixels, their sides (the edges between the border of neighbour p...
Polynomial function intervals for floating-point software verification
The focus of our work is the verification of tight functional properties of numerical programs, such as showing that a floating-point implementation of Riemann integration computes a close approximation of the exact integral. Programmers and engineers writing such programs will benefit from verification tools that support an expressive specification language and that are highly automated. Our w...

The IBMAP approach for Markov network structure learning
In this work we consider the problem of learning the structure of Markov networks from data. We present an approach for tackling this problem called IBMAP, together with an efficient instantiation of the approach: the IBMAP-HC algorithm, designed for avoiding important limitations of existing independence-based algorithms. These algorithms proceed by performing statistical independence tests on...
Exploring fault types, detection activities, and failure severity in an evolving safety-critical software system
Many papers have been published on analysis and prediction of software faults and/or failures, but few established the links from software faults (i.e., the root causes) to (potential or observed) failures and addressed multiple attributes. This paper aims at filling this gap by studying types of faults that caused software failures, activities taking place when faults were detected or failures...
Probabilistic approach for QoS-aware recommender system for trustworthy web service selection
We present a QoS-aware recommender approach based on probabilistic models to assist the selection of web services in open, distributed, and service-oriented environments. This approach allows consumers to maintain a trust model for each service provider they interact with, leading to the prediction of the most trustworthy service a consumer can interact with among a plethora of similar services...
LS-VisionDraughts: improving the performance of an agent for checkers by integrating computational intelligence, reinforcement learning and a powerful search method
This paper presents LS-VisionDraughts: an efficient unsupervised evolutionary learning system for Checkers whose contribution is to automate the process of selecting an appropriate representation for the board states – by means of Evolutionary Computation – keeping a deep look-ahead (search depth) at the moment of choosing an adequate move. It corresponds to a player Multi Layer Perceptron ...