Estimating the Volume of Unknown Inclusions in an Electrically Conducting Body with Voltage Measurements

We propose a novel technique to estimate the total volume of unknown insulating inclusions in an electrically conducting body from voltage measurements. Unlike conventional Electrical Impedance Tomography (EIT) systems that usually exhibit low spatial resolution and accuracy, the proposed device is composed of a pair of driving electrodes which, supplied with a known sinusoidal voltage, create a current density field inside a region of interest. The electrodes are designed to generate a current density field in the region of interest that is uniform, to a good approximation, when the inclusions are not present. A set of electrodes with a polygonal geometry is used for four-wires resistance measurements. The proposed technique has been tested designing a low cost prototype, where all electrodes are on the bottom of the conducting body, showing good performances. Such a device may be used to monitor the volume of biological cells inside cell culture dishes or the volume of blood clots in micro-channels in lab-on-a-chip biosensor

On the Creation of the Universe out of Nothing

We explain how the Universe was created with no expenditure of energy or initial mass.Comment: To be presented at IWARA 2009 (4th International Workshop on Astronomy and Relativistic Astrophysics), to be held in Brazil, October 200

Analytical modeling of multipass welding process with distributed heat source

In the welding process, the most interesting regions for heat transfer analysis are the fusion zone (FZ) and the heat affected zone (HAZ), where high temperatures are reached. These high temperature levels cause phase transformations and alterations in the mechanical properties of the welded metal. The calculations to estimate the temperature distribution in multiple pass welding is more complex than in the single pass processes, due to superimposed thermal effects of one pass over the previous passes. In the present work, a comparison is made between thermal cycles obtained from analytical models regarding point (concentrated) and Gaussian (distributed) heat sources. The use of distributed heat source prevents infinite temperatures values near the fusion zone. The comparison shows that the thermal cycles obtained from the distributed heat source model are more reliable than those obtained from the concentrated heat source model.302305Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP

High rate locally-correctable and locally-testable codes with sub-polynomial query complexity

In this work, we construct the first locally-correctable codes (LCCs), and locally-testable codes (LTCs) with constant rate, constant relative distance, and sub-polynomial query complexity. Specifically, we show that there exist binary LCCs and LTCs with block length $n$, constant rate (which can even be taken arbitrarily close to 1), constant relative distance, and query complexity $\exp(\tilde{O}(\sqrt{\log n}))$. Previously such codes were known to exist only with $\Omega(n^{\beta})$ query complexity (for constant $\beta > 0$), and there were several, quite different, constructions known. Our codes are based on a general distance-amplification method of Alon and Luby~\cite{AL96_codes}. We show that this method interacts well with local correctors and testers, and obtain our main results by applying it to suitably constructed LCCs and LTCs in the non-standard regime of \emph{sub-constant relative distance}. Along the way, we also construct LCCs and LTCs over large alphabets, with the same query complexity $\exp(\tilde{O}(\sqrt{\log n}))$, which additionally have the property of approaching the Singleton bound: they have almost the best-possible relationship between their rate and distance. This has the surprising consequence that asking for a large alphabet error-correcting code to further be an LCC or LTC with $\exp(\tilde{O}(\sqrt{\log n}))$ query complexity does not require any sacrifice in terms of rate and distance! Such a result was previously not known for any $o(n)$ query complexity. Our results on LCCs also immediately give locally-decodable codes (LDCs) with the same parameters