Search results for " Applications"
showing 10 items of 4541 documents
An inductive charger for automotive applications
2016
The inductive charging represents a valid solution for the power transfer in automotive applications. Due to the Inductive Power Transfer (IPT), the wireless battery charging of Electric Vehicles (EVs) provides several benefits. In this paper, an inductive charger which is particularly suitable for electrical bicycles is proposed. A practical realization of the system has been carried out, and the system has been tested in terms of working and efficiency. Through a Phase Shift Modulation (PSM), a power regulation has been implemented. The target power is 100 W.
Battery characterization via eddy-current imaging with nitrogen-vacancy centers in diamond
2021
Sensitive and accurate diagnostic technologies with magnetic sensors are of great importance for identifying and localizing defects of rechargeable solid batteries in a noninvasive detection. We demonstrate a microwave-free AC magnetometry method with negatively charged NV centers in diamond based on a cross-relaxation feature between NV centers and individual substitutional nitrogen (P1) centers occurring at 51.2 mT. We apply the technique to non-destructive solid-state battery imaging. By detecting the eddy-current-induced magnetic field of the battery, we distinguish a defect on the external electrode and identify structural anomalies within the battery body. The achieved spatial resolut…
Rapid online solid-state battery diagnostics with optically pumped magnetometers
2020
Applied Sciences 10(21), 7864 (2020). doi:10.3390/app10217864
Coordination in a multi-cell multi-antenna multi-user W-CDMA system: a beamforming approach
2008
The problem of designing joint power control and optimal beamforming (JPCOB) algorithms for the downlink of a coordinated multi-cell WCDMA system is considered throughout this paper. In this case, the JPCOB design is formulated as the problem of minimizing the total transmitted power in the coordinated multi-cell system, subject to a certain quality of service requirement for each user. In this paper, the performance of two JPCOB algorithms based on different beamforming approaches is compared over the coordinated multi-cell system. The first one, obtains local beamformers by means of the well-known virtual uplink-downlink duality. In contrast, the second algorithm implements multi-base bea…
Isotopic Effect on the Kinetics of the Belousov-Zhabotinsky Reaction
2007
In this work we present results about the deuterium isotope effect on the global kinetics of a Belousov-Zhabotinsky reaction in batch conditions. A nonlinear dependence of the Induction Period upon the percentage of deuterated reactants was found. The isotopic effect on the bromination reaction of malonic acid was evaluated.
FASTA/Q data compressors for MapReduce-Hadoop genomics: space and time savings made easy
2021
Abstract Background Storage of genomic data is a major cost for the Life Sciences, effectively addressed via specialized data compression methods. For the same reasons of abundance in data production, the use of Big Data technologies is seen as the future for genomic data storage and processing, with MapReduce-Hadoop as leaders. Somewhat surprisingly, none of the specialized FASTA/Q compressors is available within Hadoop. Indeed, their deployment there is not exactly immediate. Such a State of the Art is problematic. Results We provide major advances in two different directions. Methodologically, we propose two general methods, with the corresponding software, that make very easy to deploy …
Computation of the area in the discrete plane: Green’s theorem revisited
2017
International audience; The detection of the contour of a binary object is a common problem; however, the area of a region, and its moments, can be a significant parameter. In several metrology applications, the area of planar objects must be measured. The area is obtained by counting the pixels inside the contour or using a discrete version of Green's formula. Unfortunately, we obtain the area enclosed by the polygonal line passing through the centers of the pixels along the contour. We present a modified version of Green's theorem in the discrete plane, which allows for the computation of the exact area of a two-dimensional region in the class of polyominoes. Penalties are introduced and …
A distance metric on binary trees using lattice-theoretic measures
1990
A so called height function which is a strictly antitone supervaluation is defined on binary trees. Via lattice-theoretic results and using the height function, we can define a distance metric on binary trees of size n which can be computed in expected time O(n 3/2 )
Efficient lower and upper bounds of the diagonal-flip distance between triangulations
2006
There remains today an open problem whether the rotation distance between binary trees or equivalently the diagonal-flip distance between triangulations can be computed in polynomial time. We present an efficient algorithm for computing lower and upper bounds of this distance between a pair of triangulations.
An efficient upper bound of the rotation distance of binary trees
2000
A polynomial time algorithm is developed for computing an upper bound for the rotation distance of binary trees and equivalently for the diagonal-flip distance of convex polygons triangulations. Ordinal tools are used.