Search results for "RDW"
showing 10 items of 1401 documents
Transconductance Converters Based on Current Mirrors Applied to pH Measurement Using ISFET Sensors
2009
New transconductance circuits (V/I converters) are designed based on current mirrors and operational amplifiers. Their input/output characteristics and the influence of DC parameters are obtained. Experimental results were performed, comparing them with the simulated results. An electronic instrumentation circuit is designed based on one of the transconductance converters analyzed. The purpose of this circuit was to condition the response of an ion-sensitive field-effect transistor (ISFET) to measure pH. In the proposed application, the V/I converter presented provides the stability and accuracy of the ISFET operating point, making an easy characterization procedure and the design of multic…
CNT-based RFID passive gas sensor
2011
Summary form only given, as follows. Single-wall carbon nanotube (CNT) is examined for the design of a passive and maintenance-free wireless RFID sensor. CNT buckypaper is characterized from a dielectric and a sensitivity point of view, using an indirect way, by using antenna measurement and simulations in a controlled medium. A CNT-based prototype RFID tag is then described as the featured maintenance free sensor and experimentally verified for its applicability and sensitivity towards NH3.
A New Statistical Reconstruction Method for the Computed Tomography Using an X-Ray Tube with Flying Focal Spot
2021
Abstract This paper presents a new image reconstruction method for spiral cone- beam tomography scanners in which an X-ray tube with a flying focal spot is used. The method is based on principles related to the statistical model-based iterative reconstruction (MBIR) methodology. The proposed approach is a continuous-to-continuous data model approach, and the forward model is formulated as a shift-invariant system. This allows for avoiding a nutating reconstruction-based approach, e.g. the advanced single slice rebinning methodology (ASSR) that is usually applied in computed tomography (CT) scanners with X-ray tubes with a flying focal spot. In turn, the proposed approach allows for signific…
A group-theory method to find stationary states in nonlinear discrete symmetry systems
2010
In the field of nonlinear optics, the self-consistency method has been applied to searching optical solitons in different media. In this paper, we generalize this method to other systems, adapting it to discrete symmetry systems by using group theory arguments. The result is a new technique that incorporates symmetry concepts into the iterative procedure of the self-consistency method, that helps the search of symmetric stationary solutions. An efficient implementation of this technique is also presented, which restricts the computational work to a reduced section of the entire domain and is able to find different types of solutions by specifying their symmetry properties. As a practical ap…
Scatter search for the profile minimization problem
2014
We study the problem of minimizing the profile of a graph and develop a solution method by following the tenets of scatter search. Our procedure exploits the network structure of the problem and includes strategies that produce a computationally efficient and agile search. Among several mechanisms, our search includes path relinking as the basis for combining solutions to generate new ones. The profile minimization problem PMP is NP-Hard and has relevant applications in numerical analysis techniques that rely on manipulating large sparse matrices. The problem was proposed in the early 1970s but the state-of-the-art does not include a method that could be considered powerful by today's compu…
Iterative momentum relaxation for fast lattice-Boltzmann simulations
2001
Abstract Lattice-Boltzmann simulations are often used for studying steady-state hydrodynamics. In these simulations, however, the complete time evolution starting from some initial condition is redundantly computed due to the transient nature of the scheme. In this article we present a refinement of body-force driven lattice-Boltzmann simulations that may reduce the simulation time significantly. This new technique is based on an iterative adjustment of the local body-force. We validate this technique on three test cases, namely fluid flow around a spherical obstacle, flow in random fiber mats and flow in a static mixer reactor.
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…
An exact algorithm for the min-cost network containment problem
2004
A network design problem which arises in the distribution of a public utility provided by several competitive suppliers is studied. The problem addressed is that of determining minimum-cost (generalized) arc capacities in order to accommodate any demand between given source–sink pairs of nodes, where demands are assumed to fall within predetermined ranges. Feasible flows are initially considered as simply bounded by the usual arc capacity constraints. Then, more general linear constraints are introduced which may limit the weighted sum of the flows on some subsets of arcs. An exact cutting plane algorithm is presented for solving both of the above cases and some computational results are re…
A New Crowded Comparison Operator in Constrained Multiobjective Optimization for Capacitors Sizing and Siting in Electrical Distribution Systems
2005
This paper presents a new Crowded Comparison Operator (CCO) for NSGA-II to solve the Multiobjective and constrained problem of optimal capacitors placement in electrical distribution systems.
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.