5,219 research outputs found
A comparative study of angle dependent magnetoresistance in [001] and [110]
The angle dependent magnetoresistance study on [001] and [110] LaSrMnO thin films show that the anisotropy energy of [110]
films is higher when compared with a [001] oriented LaSrMnO film of similar thickness. The data has been analyzed in the light
of multidomain model and it is seen that this model correctly explains the
observed behavior.Comment: 8pages, 2 figure
Microelectromechanical systems vibration powered electromagnetic generator for wireless sensor applications
This paper presents a silicon microgenerator, fabricated using standard silicon micromachining techniques, which converts external ambient vibrations into electrical energy. Power is generated by an electromagnetic transduction mechanism with static magnets positioned on either side of a moving coil, which is located on a silicon structure designed to resonate laterally in the plane of the chip. The volume of this device is approximately 100 mm3. ANSYS finite element analysis (FEA) has been used to determine the optimum geometry for the microgenerator. Electromagnetic FEA simulations using Ansoft’s Maxwell 3D software have been performed to determine the voltage generated from a single beam generator design. The predicted voltage levels of 0.7–4.15 V can be generated for a two-pole arrangement by tuning the damping factor to achieve maximum displacement for a given input excitation. Experimental results from the microgenerator demonstrate a maximum power output of 104 nW for 0.4g (g=9.81 m s1) input acceleration at 1.615 kHz. Other frequencies can be achieved by employing different geometries or material
Quantum matchgate computations and linear threshold gates
The theory of matchgates is of interest in various areas in physics and
computer science. Matchgates occur in e.g. the study of fermions and spin
chains, in the theory of holographic algorithms and in several recent works in
quantum computation. In this paper we completely characterize the class of
boolean functions computable by unitary two-qubit matchgate circuits with some
probability of success. We show that this class precisely coincides with that
of the linear threshold gates. The latter is a fundamental family which appears
in several fields, such as the study of neural networks. Using the above
characterization, we further show that the power of matchgate circuits is
surprisingly trivial in those cases where the computation is to succeed with
high probability. In particular, the only functions that are
matchgate-computable with success probability greater than 3/4 are functions
depending on only a single bit of the input
Fiber-Flux Diffusion Density for White Matter Tracts Analysis: Application to Mild Anomalies Localization in Contact Sports Players
We present the concept of fiber-flux density for locally quantifying white
matter (WM) fiber bundles. By combining scalar diffusivity measures (e.g.,
fractional anisotropy) with fiber-flux measurements, we define new local
descriptors called Fiber-Flux Diffusion Density (FFDD) vectors. Applying each
descriptor throughout fiber bundles allows along-tract coupling of a specific
diffusion measure with geometrical properties, such as fiber orientation and
coherence. A key step in the proposed framework is the construction of an FFDD
dissimilarity measure for sub-voxel alignment of fiber bundles, based on the
fast marching method (FMM). The obtained aligned WM tract-profiles enable
meaningful inter-subject comparisons and group-wise statistical analysis. We
demonstrate our method using two different datasets of contact sports players.
Along-tract pairwise comparison as well as group-wise analysis, with respect to
non-player healthy controls, reveal significant and spatially-consistent FFDD
anomalies. Comparing our method with along-tract FA analysis shows improved
sensitivity to subtle structural anomalies in football players over standard FA
measurements
An exact quantification of backreaction in relativistic cosmology
An important open question in cosmology is the degree to which the
Friedmann-Lemaitre-Robertson-Walker (FLRW) solutions of Einstein's equations
are able to model the large-scale behaviour of the locally inhomogeneous
observable universe. We investigate this problem by considering a range of
exact n-body solutions of Einstein's constraint equations. These solutions
contain discrete masses, and so allow arbitrarily large density contrasts to be
modelled. We restrict our study to regularly arranged distributions of masses
in topological 3-spheres. This has the benefit of allowing straightforward
comparisons to be made with FLRW solutions, as both spacetimes admit a discrete
group of symmetries. It also provides a time-symmetric hypersurface at the
moment of maximum expansion that allows the constraint equations to be solved
exactly. We find that when all the mass in the universe is condensed into a
small number of objects (<10) then the amount of backreaction in dust models
can be large, with O(1) deviations from the predictions of the corresponding
FLRW solutions. When the number of masses is large (>100), however, then our
measures of backreaction become small (<1%). This result does not rely on any
averaging procedures, which are notoriously hard to define uniquely in general
relativity, and so provides (to the best of our knowledge) the first exact and
unambiguous demonstration of backreaction in general relativistic cosmological
modelling. Discrete models such as these can therefore be used as laboratories
to test ideas about backreaction that could be applied in more complicated and
realistic settings.Comment: 13 pages, 9 figures. Corrections made to Tables IV and
Distributed Drug Discovery, Part 3: Using D3 Methodology to Synthesize Analogs of an Anti-Melanoma Compound
Distributed Drug Discovery, Part 2: Global Rehearsal of Alkylating Agents for the Synthesis of Resin-Bound Unnatural Amino Acids and Virtual D3 Catalog Construction
Detecting and Characterizing Small Dense Bipartite-like Subgraphs by the Bipartiteness Ratio Measure
We study the problem of finding and characterizing subgraphs with small
\textit{bipartiteness ratio}. We give a bicriteria approximation algorithm
\verb|SwpDB| such that if there exists a subset of volume at most and
bipartiteness ratio , then for any , it finds a set
of volume at most and bipartiteness ratio at most
. By combining a truncation operation, we give a local
algorithm \verb|LocDB|, which has asymptotically the same approximation
guarantee as the algorithm \verb|SwpDB| on both the volume and bipartiteness
ratio of the output set, and runs in time
, independent of the size of the
graph. Finally, we give a spectral characterization of the small dense
bipartite-like subgraphs by using the th \textit{largest} eigenvalue of the
Laplacian of the graph.Comment: 17 pages; ISAAC 201
A Hypergraph Dictatorship Test with Perfect Completeness
A hypergraph dictatorship test is first introduced by Samorodnitsky and
Trevisan and serves as a key component in their unique games based \PCP
construction. Such a test has oracle access to a collection of functions and
determines whether all the functions are the same dictatorship, or all their
low degree influences are Their test makes queries and has
amortized query complexity but has an inherent loss of
perfect completeness. In this paper we give an adaptive hypergraph dictatorship
test that achieves both perfect completeness and amortized query complexity
.Comment: Some minor correction
- …