Search results for "Node"
showing 10 items of 1701 documents
Anodic Electro Deposition of CeO2 and Co-Doped CeO2 Thin Films
2013
CeO2 and Co containing CeO2 thin films were deposited on indium tin oxide and stainless steel by anodic electrodeposition. Scanning electron microscopy showed that the films are flat and show globular morphology and cracks resulting from volume shrinking. According to XRD and Raman Spectroscopy pure ceria layers are crystalline, while the presence of Co induces the formation of amorphous films. The good adhesion and the compactness allowed the photoelectrochemical characterization of the films. A band gap value of 2.9 eV was estimated for CeO2, while slightly higher values (̃3.0 eV) were estimated for Co containing films. A mechanism for ceria anodic electrodeposition is proposed and discus…
Nanostructured CdO thin films for water treatments
2016
Abstract CdO was the very first transparent conducting metal oxide discovered. CdO thin films show electrical and optical properties of interest as photosensitive anode materials for photochemical cells, phototransistors, photodiodes, window electrodes in liquid crystal displays, IR detectors, antireflection coatings, gas sensors and in other solar energy applications. In the present study we report on the spectroscopic, microscopic, electrical and photo-catalytic properties of CdO thin films prepared by a metal organic chemical vapor method. The degenerate semiconducting CdO thin films are useful as photocatalysts for water treatments.
GRASP with path relinking heuristics for the antibandwidth problem
2010
This article proposes a linear integer programming formulation and several heuristics based on GRASP and path relinking for the antibandwidth problem. In the antibandwidth problem, one is given an undirected graph with n nodes and must label the nodes in a way that each node receives a unique label from the set {1, 2,…,n}, such that, among all adjacent node pairs, the minimum difference between the node labels is maximized. Computational results show that only small instances of this problem can be solved exactly (to optimality) with a commercial integer programming solver and that the heuristics find high-quality solutions in much less time than the commercial solver. © 2010 Wiley Periodic…
Field estimation in wireless sensor networks using distributed kriging
2012
In this paper, we tackle the problem of spatial interpolation for distributed estimation in Wireless Sensor Networks by using a geostatistical technique called kriging. We present a novel Distributed Iterative Kriging Algorithm (DIKA) which is composed of two main phases. First, the spatial dependence of the field is exploited by calculating semivariograms in an iterative way. Second, the kriging system of equations is solved by an initial set of nodes in a distributed manner, providing some initial interpolation weights to each node. In our algorithm, the estimation accuracy can be improved by iteratively adding new nodes and updating appropriately the weights, which leads to a reduction i…
The stacker crane problem and the directed general routing problem
2015
[EN] This article deals with the polyhedral description and the resolution of the directed general routing problem (DGRP) and the stacker crane problem (SCP). The DGRP contains a large number of important arc and node routing problems as special cases, including the SCP. Large families of facet-defining inequalities for the DGRP are described and a branch-and-cut algorithm for these problems is presented. Extensive computational experiments over different sets of DGRP and SCP instances are included.
Optimal Set Points Regulation of Distributed Generation Units in Micro-grids under Islanded Operation
2010
The present work studies the problem of optimizing the power production levels of dispersed generation units in islanded microgrids. The problem is intrinsically multi-objective with non linear objectives and constraints, thus the solution approach is based on evolutionary optimization and uses the Non dominated Sorting Genetic Algorithm II. The objectives are calculated based on the solution of the load flow problem. The latter problem is more complicated when in the considered system a physical node with a sufficiently large production capability is not available, because all the generation node of the systems have similar and limited generation capability. In this paper, the issue has be…
Multicell power allocation method based on game theory for inter-cell interference coordination
2009
As a new technology, coordinated multipoint (CoMP) transmission is included in LTE-Advanced study item. Moreover, the network architecture in LTE-Advanced system is modified to take into account coordinated transmission. Under this background, a novel power allocation game model is established to mitigate inter-cell interference with cellular coordination. In the light of cellular cooperation relationship and centralized control in eNodeB, the power allocation in each served antenna unit aims to make signal to interference plus noise ratio (SINR) balanced among inter-cells. Through the proposed power allocation game algorithm, the users' SINR can reach the Nash equilibrium, making it feasib…
GRASP for the uncapacitated r-allocation p-hub median problem
2014
In this paper we propose a heuristic for the Uncapacitated r-Allocation p-Hub Median Problem. In the classical p-hub location problem, given a set of nodes with pairwise traffic demands, we must select p of them as hub locations and route all traffics through them at a minimum cost. We target here an extension, called the r-allocation p-hub median problem, recently proposed by Yaman [19], in which every node is assigned to r of the p selected hubs (r@?p) and we are restricted to route the traffic of the nodes through their associated r hubs. As it is usual in this type of problems, our method has three phases: location, assignment and routing. Specifically, we propose a heuristic based on t…
Optimal Delay-Power Tradeoff in Sparse Delay Tolerant Networks: a preliminary study
2006
In this paper we present a first attempt to study analytically the tradeoff between delivery delay and resource consumption for epidemic routing in Delay Tolerant Networks. We assume that the nodes cooperate in order to minimize a common cost equal to a weighted sum of the packet delivery delay and the total number of copies, which is strongly related to the power consumption. In this framework we determine the best policy each node should deploy in a very simple scenario where all the nodes have perfect knowledge of the system status. The result is used as an ideal reference to evaluate the performance of some heuristics proposed, investigating potential performance improvements and config…
A new method for creating sparse design velocity fields
2006
We present a novel method for the computation of mesh node sensitivities with respect to the boundary node movement. The sensitivity field is sparse in a sense that movement of each boundary node affects only given amount of inner mesh nodes, which can result in considerable savings in the storage space. The method needs minimal control from the user, and it does not place any restrictions (such as block structure) on the mesh. Use of the method is demonstrated with a shape optimization problem using CAD-free parametrization. A solution to the classical die-swell free boundary problem by coupling the boundary node locations with the state variables is also presented. In that case, sparsity …