Search results for "Computer Science::Databases"
showing 10 items of 183 documents
Current-induced domain wall motion in nanoscale ferromagnetic elements
2011
The manipulation of a magnetic domain wall (DW) by a spin polarized current in ferromagnetic nanowires has attracted tremendous interest during the last years due to fundamental questions in the fields of spin dependent transport phenomena and magnetization dynamics but also due to promising applications, such as DW based magnetic memory concepts and logic devices. We comprehensively review recent developments in the field of geometrically confined domain walls and in particular current induced DW dynamics. We focus on the influence of the magnetic and electronic transport properties of the materials on the spin transfer effect in DWs. After considering the different DW structures in ferrom…
Nonlinear pseudo-bosons
2011
In a series of recent papers the author has introduced the notion of (regular) pseudo-bosons showing, in particular, that two number-like operators, whose spectra are ${\Bbb N}_0:={\Bbb N}\cup\{0\}$, can be naturally introduced. Here we extend this construction to operators with rather more general spectra. Of course, this generalization can be applied to many more physical systems. We discuss several examples of our framework.
New Molecular-Based Materials for Enabling Electro-Optical Bistability in the Silicon Photonics Platform
2019
Electro-optical bistability is a functionality which can be crucial for a wide range of applications as it can enable non-volatile and ultra-low power switching performance. We investigate the integration of a molecular-based material presenting a Spin Crossover (SCO) effect in the silicon platform for enabling optical bistability. The SCO phenomenon involves a switching process between two molecular spin states. This spin transition comes along with a change in the optical refractive index that can be switched by different external stimuli such as a variation of temperature or light irradiation and which has a hysteretic behaviour. The SCO material can be synthetized as nanoparticles so th…
Grover’s Search with Faults on Some Marked Elements
2016
Grover's algorithm is a quantum query algorithm solving the unstructured search problem of size N using $$O\sqrt{N}$$ queries. It provides a significant speed-up over any classical algorithm [2]. The running time of the algorithm, however, is very sensitive to errors in queries. Multiple authors have analysed the algorithm using different models of query errors and showed the loss of quantum speed-up [1, 4]. We study the behavior of Grover's algorithm in the model where the search space contains both faulty and non-faulty marked elements. We show that in this setting it is indeed possible to find one of marked elements in $$O\sqrt{N}$$ queries.
Microrefrigeration by NIS tunnel junctions
1996
By using a normal metal-insulator-superconductor (NIS) tunnel junction one can manipulate the Fermi-Dirac distribution of the electrons in the normal electrode. If the junction is biased close to the superconducting gap, Δ, only “hot electrons” above Fermi level can tunnel from the normal electrode to the superconductor. Thus, due to the decoupling of the conduction electrons from the lattice at low temperatures, there exists a possibility to decrease the electronic temperature by this method. Because of the symmetry with bias voltage, two NIS tunnel junctions in series can form an efficient microrefrigerator. Temperature can be measured with two additional junctions by considering the vari…
Predicted very large thermoelectric effect in ferromagnet-superconductor junctions in the presence of a spin-splitting magnetic field.
2014
We show that a huge thermoelectric effect can be observed by contacting a superconductor whose density of states is spin split by a Zeeman field with a ferromagnet with a nonzero polarization. The resulting thermopower exceeds kB/e by a large factor, and the thermoelectric figure of merit ZT can far exceed unity, leading to heat engine efficiencies close to the Carnot limit. We also show that spin-polarized currents can be generated in the superconductor by applying a temperature bias. © 2014 American Physical Society.
Near‐field optical addressing of single molecules in coplanar geometry: a theoretical study
2001
Photonic transfer through elongated optical structures of submicrometre section microfabricated at the surface of dielectric or semiconductor samples can be enhanced by an appropriate structuring of the local refraction index. We show from computerized simulations that both the light localization and the spectroscopic properties of such structures can be used to selectively excite, in coplanar geometry, individuals molecules located in the near-field.
Particle Filtering for Tracking in 360 Degrees Videos Using Virtual PTZ Cameras
2019
360 degrees cameras are devices able to record spherical images of the environment. Such images can be used to generate views of the scene by projecting the spherical surface onto planes tangent to the sphere. Each of these views can be considered as the output of a virtual PTZ (vPTZ) camera with specific pan, tilt and zoom parameters. This paper proposes to formulate the visual tracking problem as the one of selecting, at each time, the vPTZ camera to foveate on the target from the unlimited set of simultaneously generated vPTZ camera views. Assuming that the selected vPTZ camera is a stochastic variable, the paper proposes to model the posterior distribution of the underlying stochastic p…
An improved quantum query algorithm for computing AND Boolean function
2010
We consider the quantum query model for computing Boolean functions. The definition of the function is known, but a black box contains the input X = (x 1 , x 2 , …, x n ). Black box can be accessed by querying x i values. The goal is to develop an algorithm, which would compute the function value for arbitrary input using as few queries to the black box as possible. We present two different quantum query algorithms for computing the basic Boolean function — logical AND of two bits. Both algorithms use only one query to determine the function value. Correct answer probability for the first algorithm is 80%, but for the second algorithm it is 90%. To compute this function with the same probab…
Efficient evaluation for a subset of recursive queries
1991
Abstract We consider the efficient evaluation of recursive queries in logic databases where the queries are expressed using a Datalog program (function-free Horn-clause program) that contains only regularly or linearly recursive predicates. Using well-known results on graph traversal, we develop an efficient algorithm for evaluating relations defined by a binary-chain program. We also present a transformation by which the evaluation of a subset of queries involving nonbinary relations can be reduced to the evaluation of binary-chain queries. This transformation is guided by the choice of bound arguments in the query, and the bindings are propagated through the program so that in the evaluat…