Approximate information on the location of nodes in a sensor network is essential to many types of sensor network applications and algorithms. In many cases, using symbolic coordinates is an attractive alternative to the use of geographic coordinates due to lower costs and lower requirements on the available location information during coordinate assignment. In this paper, we investigate differ...

This paper presents a novel approach to solve channel assignment problems by using clustering technique with Fuzzy Hopfield neural network (FHNN). Channels are regarded as data sample and cells are taken as clusters. Channels are adequately distributed to the dedicated cells while satisfying the interference constraints. The goal is to avoid the interference and serve the expected traffic with ...

In wavelength division multiplexed all optical networks; lightpath establishes a connection between sending and receiving nodes bypassing the electronic processing at intermediate nodes. One of the prime objectives of Routing and Wavelength Assignment (RWA) problem is to maximize the number of connections efficiently by choosing the best routes. Although there are several algorithms available, ...

The automatic metric analysis (commonly referred to as scansion ) of Spanish poetry is not a trivial problem since it combines the nuances language, different poetic traditions related melodic patterns, and personal stylistic preferences intentions author. In this paper, we explore two alternative algorithmic approaches tailored applications scenarios. first approach, Rantanplan, rule-based met...

In survivable optical networks, wavelength assignment is a major concern than assigning routes to the light path requests. Earlier wavelength assignment algorithm suffers from unbalanced utilization of wavelengths that leads to blocking probability for any connection request. This paper analyzes the performance of the wavelength assignment strategies to reduce the network block rate of the requ...

The single machine scheduling problem with two types of controllable parameters, job processing times and release dates, is studied. It is assumed that the cost of compressing processing times and release dates from their initial values is a linear function of the compression amounts. The objective is to minimize the sum of the total completion time of the jobs and the total compression cost. F...

This paper addresses embedded multiprocessor implementation of iterative, real-time applications, such as digital signal and image processing, that are specified as dataflow graphs. Scheduling dataflow graphs on multiple processors involves assigning tasks to processors (processor assignment), ordering the execution of tasks within each processor (task ordering), and determining when each task ...

Climate change in recent years has produced viable shipping routes the Arctic. However, critical uncertainties related to maritime operations Arctic make it difficult predict ship speeds ice and, thus, voyage time and fuel costs. Cost–benefit analysis of alternative based on accurate environmental condition modeling is required. In this context, paper presents a holistic approach that considers...

Transformations of hand movements by tools such as levers or electronic input devices can invoke performance costs compared to untransformed movements. This study investigated by means of the Psychological Refractory Period (PRP) paradigm at which stage of information processing such tool-transformation costs arise. We used an inversion transformation, that is, the movement of the operating han...