309 resultados para minimum order observers
Resumo:
We present experimental validation of a new reconstruction method for off-axis digital holographic microscopy (DHM). This method effectively suppresses the object autocorrelation,namely, the zero-order term,from holographic data,thereby improving the reconstruction bandwidth of complex wavefronts. The algorithm is based on nonlinear filtering and can be applied to standard DHM setups with realistic recording conditions.We study the robustness of the technique under different experimental configurations,and quantitatively demonstrate its enhancement capabilities on phase signals.
Resumo:
Gadolinium strontium manganite single crystals of the composition Gd0.5Sr0.5MnO3 were grown using the optical float zone method. We report here the magnetic and magnetotransport properties of these crystals. A large magnetoresistance similar to 10(9)% was observed at 45 K under the application of a 110 kOe field. We have observed notable thermomagnetic anomalies such as open hysteresis loops across the broadened first-order transition between the charge order insulator and the ferromagnetic metallic phase while traversing the magnetic field-temperature (H-T) plane isothermally or isomagnetically. In order to discern the cause of these observed anomalies, the H-T phase diagram for Gd0.5Sr0.5MnO3 is formulated using the magnetization-field (M-H), magnetization-temperature (M-T) and resistance-temperature (R-T) measurements. The temperature dependence of the critical field (i.e. H-up, the field required for transformation to the ferromagnetic metallic phase) is non-monotonic. We note that the non-monotonic variation of the supercooling limit is anomalous according to the classical concepts of the first-order phase transition. Accordingly, H-up values below similar to 20 K are unsuitable to represent the supercooling limit. It is possible that the nature of the metastable states responsible for the observed open hysteresis loops is different from that of the supercooled ones.
Resumo:
In this paper, we present numerical evidence that supports the notion of minimization in the sequence space of proteins for a target conformation. We use the conformations of the real proteins in the Protein Data Bank (PDB) and present computationally efficient methods to identify the sequences with minimum energy. We use edge-weighted connectivity graph for ranking the residue sites with reduced amino acid alphabet and then use continuous optimization to obtain the energy-minimizing sequences. Our methods enable the computation of a lower bound as well as a tight upper bound for the energy of a given conformation. We validate our results by using three different inter-residue energy matrices for five proteins from protein data bank (PDB), and by comparing our energy-minimizing sequences with 80 million diverse sequences that are generated based on different considerations in each case. When we submitted some of our chosen energy-minimizing sequences to Basic Local Alignment Search Tool (BLAST), we obtained some sequences from non-redundant protein sequence database that are similar to ours with an E-value of the order of 10(-7). In summary, we conclude that proteins show a trend towards minimizing energy in the sequence space but do not seem to adopt the global energy-minimizing sequence. The reason for this could be either that the existing energy matrices are not able to accurately represent the inter-residue interactions in the context of the protein environment or that Nature does not push the optimization in the sequence space, once it is able to perform the function.
Resumo:
It is shown that a magnetic-pressure-dominated, supersonic jet which expands (or contracts) in response to variations in the confining external pressure can dissipate magnetic energy through field-line reconnection as it relaxes to a minimum-energy configuration. In order for a continuous dissipation to take place, the effective reconnection time must be a fraction ɛ ⪉ 1 of the expansion time. The amount of energy dissipation is calculated, and it is concluded that magnetic energy dissipation could, in principle, power the observed synchrotron emission in extragalactic radio jets such as NGC 6251. However, this mechanism is only viable if the reconnection time is substantially shorter than the nominal resistive tearing time in the jet.
Resumo:
In this paper we have proposed and implemented a joint Medium Access Control (MAC) -cum- Routing scheme for environment data gathering sensor networks. The design principle uses node 'battery lifetime' maximization to be traded against a network that is capable of tolerating: A known percentage of combined packet losses due to packet collisions, network synchronization mismatch and channel impairments Significant end-to-end delay of an order of few seconds We have achieved this with a loosely synchronized network of sensor nodes that implement Slotted-Aloha MAC state machine together with route information. The scheme has given encouraging results in terms of energy savings compared to other popular implementations. The overall packet loss is about 12%. The battery life time increase compared to B-MAC varies from a minimum of 30% to about 90% depending on the duty cycle.
Resumo:
Dielectric measurements on the charge-ordered insulators, Y1-xCaxMnO3 (x = 0.4. 0.45 and 0.5), show maxima in the dielectric constant around the charge ordering transition temperature while magnetic measurements show the presence of weak ferromagnetic interactions at low temperatures. Besides the magnetic field dependence of the dielectric constant, these manganites also exhibit second harmonic generation. Thus, the charge-ordered Y1-xCaxMnO3 compositions are multiferroic and magnetoelectric, in accordance with theoretical predictions. Magnetoelectric properties are retained in small particles of Y0.5Ca0.5MnO3. (C) 2008 Elsevier Ltd. All rights reserved.
Resumo:
Experimental characterization of high dimensional dynamic systems sometimes uses the proper orthogonal decomposition (POD). If there are many measurement locations and relatively fewer sensors, then steady-state behavior can still be studied by sequentially taking several sets of simultaneous measurements. The number required of such sets of measurements can be minimized if we solve a combinatorial optimization problem. We aim to bring this problem to the attention of engineering audiences, summarize some known mathematical results about this problem, and present a heuristic (suboptimal) calculation that gives reasonable, if not stellar, results.
Resumo:
Two decision versions of a combinatorial power minimization problem for scheduling in a time-slotted Gaussian multiple-access channel (GMAC) are studied in this paper. If the number of slots per second is a variable, the problem is shown to be NP-complete. If the number of time-slots per second is fixed, an algorithm that terminates in O (Length (I)N+1) steps is provided.
Resumo:
Barrierless chemical reactions have often been modeled as a Brownian motion on a one-dimensional harmonic potential energy surface with a position-dependent reaction sink or window located near the minimum of the surface. This simple (but highly successful) description leads to a nonexponential survival probability only at small to intermediate times but exponential decay in the long-time limit. However, in several reactive events involving proteins and glasses, the reactions are found to exhibit a strongly nonexponential (power law) decay kinetics even in the long time. In order to address such reactions, here, we introduce a model of barrierless chemical reaction where the motion along the reaction coordinate sustains dispersive diffusion. A complete analytical solution of the model can be obtained only in the frequency domain, but an asymptotic solution is obtained in the limit of long time. In this case, the asymptotic long-time decay of the survival probability is a power law of the Mittag−Leffler functional form. When the barrier height is increased, the decay of the survival probability still remains nonexponential, in contrast to the ordinary Brownian motion case where the rate is given by the Smoluchowski limit of the well-known Kramers' expression. Interestingly, the reaction under dispersive diffusion is shown to exhibit strong dependence on the initial state of the system, thus predicting a strong dependence on the excitation wavelength for photoisomerization reactions in a dispersive medium. The theory also predicts a fractional viscosity dependence of the rate, which is often observed in the reactions occurring in complex environments.
Resumo:
An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a'(G). It was conjectured by Alon, Suclakov and Zaks (and earlier by Fiamcik) that a'(G) <= Delta+2, where Delta = Delta(G) denotes the maximum degree of the graph. Alon et al. also raised the question whether the complete graphs of even order are the only regular graphs which require Delta+2 colors to be acyclically edge colored. In this article, using a simple counting argument we observe not only that this is not true, but in fact all d-regular graphs with 2n vertices and d>n, requires at least d+2 colors. We also show that a'(K-n,K-n) >= n+2, when n is odd using a more non-trivial argument. (Here K-n,K-n denotes the complete bipartite graph with n vertices on each side.) This lower bound for Kn,n can be shown to be tight for some families of complete bipartite graphs and for small values of n. We also infer that for every d, n such that d >= 5, n >= 2d+3 and dn even, there exist d-regular graphs which require at least d+2-colors to be acyclically edge colored. (C) 2009 Wiley Periodicals, Inc. J Graph Theory 63: 226-230, 2010.
Resumo:
A modified form of Green's integral theorem is employed to derive the energy identity in any water wave diffraction problem in a single-layer fluid for free-surface boundary condition with higher-order derivatives. For a two-layer fluid with free-surface boundary condition involving higher-order derivatives, two forms of energy identities involving transmission and reflection coefficients for any wave diffraction problem are also derived here by the same method. Based on this modified Green's theorem, hydrodynamic relations such as the energy-conservation principle and modified Haskind–Hanaoka relation are derived for radiation and diffraction problems in a single as well as two-layer fluid.
Resumo:
We discuss a technique for solving the Landau-Zener (LZ) problem of finding the probability of excitation in a two-level system. The idea of time reversal for the Schrodinger equation is employed to obtain the state reached at the final time and hence the excitation probability. Using this method, which can reproduce the well-known expression for the LZ transition probability, we solve a variant of the LZ problem, which involves waiting at the minimum gap for a time t(w); we find an exact expression for the excitation probability as a function of t(w). We provide numerical results to support our analytical expressions. We then discuss the problem of waiting at the quantum critical point of a many-body system and calculate the residual energy generated by the time-dependent Hamiltonian. Finally, we discuss possible experimental realizations of this work.
Resumo:
The linear spin-1/2 Heisenberg antiferromagnet with exchanges J(1) and J(2) between first and second neighbors has a bond-order wave (BOW) phase that starts at the fluid-dimer transition at J(2)/J(1)=0.2411 and is particularly simple at J(2)/J(1)=1/2. The BOW phase has a doubly degenerate singlet ground state, broken inversion symmetry, and a finite-energy gap E-m to the lowest-triplet state. The interval 0.4 < J(2)/J(1) < 1.0 has large E-m and small finite-size corrections. Exact solutions are presented up to N = 28 spins with either periodic or open boundary conditions and for thermodynamics up to N = 18. The elementary excitations of the BOW phase with large E-m are topological spin-1/2 solitons that separate BOWs with opposite phase in a regular array of spins. The molar spin susceptibility chi(M)(T) is exponentially small for T << E-m and increases nearly linearly with T to a broad maximum. J(1) and J(2) spin chains approximate the magnetic properties of the BOW phase of Hubbard-type models and provide a starting point for modeling alkali-tetracyanoquinodimethane salts.
Resumo:
We address the longstanding problem of recovering dynamical information from noisy acoustic emission signals arising from peeling of an adhesive tape subject to constant traction velocity. Using the phase space reconstruction procedure we demonstrate the deterministic chaotic dynamics by establishing the existence of correlation dimension as also a positive Lyapunov exponent in a midrange of traction velocities. The results are explained on the basis of the model that also emphasizes the deterministic origin of acoustic emission by clarifying its connection to stick-slip dynamics.
Resumo:
We consider the problem of computing an approximate minimum cycle basis of an undirected edge-weighted graph G with m edges and n vertices; the extension to directed graphs is also discussed. In this problem, a {0,1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of the weights of the cycles is minimum is called a minimum cycle basis of G. Cycle bases of low weight are useful in a number of contexts, e.g. the analysis of electrical networks, structural engineering, chemistry, and surface reconstruction. We present two new algorithms to compute an approximate minimum cycle basis. For any integer k >= 1, we give (2k - 1)-approximation algorithms with expected running time 0(kmn(1+2/k) + mn((1+1/k)(omega-1))) and deterministic running time 0(n(3+2/k)), respectively. Here omega is the best exponent of matrix multiplication. It is presently known that omega < 2.376. Both algorithms are o(m(omega)) for dense graphs. This is the first time that any algorithm which computes sparse cycle bases with a guarantee drops below the Theta(m(omega)) bound. We also present a 2-approximation algorithm with O(m(omega) root n log n) expected running time, a linear time 2-approximation algorithm for planar graphs and an O(n(3)) time 2.42-approximation algorithm for the complete Euclidean graph in the plane.