88 resultados para Weakly Linearly Convex Domain
Resumo:
We study under which conditions the core of a game involved in a convex decomposition of another game turns out to be a stable set of the decomposed game. Some applications and numerical examples, including the remarkable Lucas¿ five player game with a unique stable set different from the core, are reckoning and analyzed.
Resumo:
The oxidation of solutions of glucose with methylene-blue as a catalyst in basic media can induce hydrodynamic overturning instabilities, termed chemoconvection in recognition of their similarity to convective instabilities. The phenomenon is due to gluconic acid, the marginally dense product of the reaction, which gradually builds an unstable density profile. Experiments indicate that dominant pattern wavenumbers initially increase before gradually decreasing or can even oscillate for long times. Here, we perform a weakly nonlinear analysis for an established model of the system with simple kinetics, and show that the resulting amplitude equation is analogous to that obtained in convection with insulating walls. We show that the amplitude description predicts that dominant pattern wavenumbers should decrease in the long term, but does not reproduce the aforementioned increasing wavenumber behavior in the initial stages of pattern development. We hypothesize that this is due to horizontally homogeneous steady states not being attained before pattern onset. We show that the behavior can be explained using a combination of pseudo-steady-state linear and steady-state weakly nonlinear theories. The results obtained are in qualitative agreement with the analysis of experiments.
Resumo:
We discuss the dynamics of the transient pattern formation process corresponding to the splay Fréedericksz transition. The emergence and subsequent evolution of the spatial periodicity is here described in terms of the temporal dependence of the wave numbers corresponding to the maxima of the structure factor. Situations of perpendicular as well as oblique field-induced stripes relative to the initial orientation of the director are both examined with explicit indications of the time scales needed for their appearance and posterior development.
Resumo:
We study the dynamics of the late stages of the Fréedericksz transition in which a periodic transient pattern decays to a final homogeneous state. A stability analysis of an unstable stationary pattern is presented, and equations for the evolution of the domain walls are obtained. Using results of previous theories, we analyze the effect that the specific dynamics of the problem, incorporating hydrodynamic couplings, has on the expected logarithmic domain growth law.
Resumo:
Long-lived states (LLS) are relaxation-favoured eigenstates of J-coupled magnetic nuclei. LLS were measured, along with classical 1H and 15 N relaxation rate constants, in aminoacids of the N-terminal Unique domain of the c-Src kinase (USrc), which is disordered in vitro under physiological conditions. The relaxation rates of LLS are a probe for motions and interactions in biomolecules. LLS of the aliphatic protons of glycines, with lifetimes ca. four times longer than their spin-lattice relaxation times, are reported for the first time in an intrinsically disordered protein domain (IDP). LLS relaxation experiments were integrated with 2D spectroscopy methods, further adapting them for studies on proteins.
Resumo:
The development of shear instabilities of a wave-driven alongshore current is investigated. In particular, we use weakly nonlinear theory to investigate the possibility that such instabilities, which have been observed at various sites on the U.S. coast and in the laboratory, can grow in linearly stable flows as a subcritical bifurcation by resonant triad interaction, as first suggested by Shrira eta/. [1997]. We examine a realistic longshore current profile and include the effects of eddy viscosity and bottom friction. We show that according to the weakly nonlinear theory, resonance is possible and that these linearly stable flows may exhibit explosive instabilities. We show that this phenomenon may occur also when there is only approximate resonance, which is more likely in nature. Furthermore, the size of the perturbation that is required to trigger the instability is shown in some circumstances to be consistent with the size of naturally occurring perturbations. Finally, we consider the differences between the present case examined and the more idealized case of Shrira et a/. [ 1997]. It is shown that there is a possibility of coupling between triads, due to the richer modal structure in more realistic flows, which may act to stabilize the flow and act against the development of subcritical bifurcations. Extensive numerical tests are called for.
Resumo:
We present a study of binary mixtures of Bose-Einstein condensates confined in a double-well potential within the framework of the mean field Gross-Pitaevskii (GP) equation. We re-examine both the single component and the binary mixture cases for such a potential, and we investigate what are the situations in which a simpler two-mode approach leads to an accurate description of their dynamics. We also estimate the validity of the most usual dimensionality reductions used to solve the GP equations. To this end, we compare both the semi-analytical two-mode approaches and the numerical simulations of the one-dimensional (1D) reductions with the full 3D numerical solutions of the GP equation. Our analysis provides a guide to clarify the validity of several simplified models that describe mean-field nonlinear dynamics, using an experimentally feasible binary mixture of an F = 1 spinor condensate with two of its Zeeman manifolds populated, m = ±1.
Resumo:
We present a study of binary mixtures of Bose-Einstein condensates confined in a double-well potential within the framework of the mean field Gross-Pitaevskii (GP) equation. We re-examine both the single component and the binary mixture cases for such a potential, and we investigate what are the situations in which a simpler two-mode approach leads to an accurate description of their dynamics. We also estimate the validity of the most usual dimensionality reductions used to solve the GP equations. To this end, we compare both the semi-analytical two-mode approaches and the numerical simulations of the one-dimensional (1D) reductions with the full 3D numerical solutions of the GP equation. Our analysis provides a guide to clarify the validity of several simplified models that describe mean-field nonlinear dynamics, using an experimentally feasible binary mixture of an F = 1 spinor condensate with two of its Zeeman manifolds populated, m = ±1.
Resumo:
A fluctuation relation for aging systems is introduced and verified by extensive numerical simulations. It is based on the hypothesis of partial equilibration over phase-space regions in a scenario of entropy-driven relaxation. The relation provides a simple alternative method, amenable of experimental implementation, to measure replica symmetry breaking parameters in aging systems. The connection with the effective temperatures obtained from the fluctuation-dissipation theorem is discussed
Resumo:
This paper proposes a novel high capacity robust audio watermarking algorithm by using the high frequency band of the wavelet decomposition at which the human auditory system (HAS) is not very sensitive to alteration. The main idea is to divide the high frequency band into frames and, for embedding, to change the wavelet samples depending on the average of relevant frame¿s samples. The experimental results show that the method has a very high capacity (about 11,000 bps), without significant perceptual distortion (ODG in [¿1 ,0] and SNR about 30dB), and provides robustness against common audio signal processing such as additive noise, filtering, echo and MPEG compression (MP3).
Resumo:
Many audio watermarking schemes divide the audio signal into several blocks such that part of the watermark is embedded into each of them. One of the key issues in these block-oriented watermarking schemes is to preserve the synchronisation, i.e. to recover the exact position of each block in the mark recovery process. In this paper, a novel time domain synchronisation technique is presented together with a new blind watermarking scheme which works in the Discrete Fourier Transform (DFT or FFT) domain. The combined scheme provides excellent imperceptibility results whilst achieving robustness against typical attacks. Furthermore, the execution of the scheme is fast enough to be used in real-time applications. The excellent transparency of the embedding algorithm makes it particularly useful for professional applications, such as the embedding of monitoring information in broadcast signals. The scheme is also compared with some recent results of the literature.
Resumo:
The World Wide Web, the world¿s largest resource for information, has evolved from organizing information using controlled, top-down taxonomies to a bottom up approach that emphasizes assigning meaning to data via mechanisms such as the Social Web (Web 2.0). Tagging adds meta-data, (weak semantics) to the content available on the web. This research investigates the potential for repurposing this layer of meta-data. We propose a multi-phase approach that exploits user-defined tags to identify and extract domain-level concepts. We operationalize this approach and assess its feasibility by application to a publicly available tag repository. The paper describes insights gained from implementing and applying the heuristics contained in the approach, as well as challenges and implications of repurposing tags for extraction of domain-level concepts.
Resumo:
Background: Protein domains represent the basic units in the evolution of proteins. Domain duplication and shuffling by recombination and fusion, followed by divergence are the most common mechanisms in this process. Such domain fusion and recombination events are predicted to occur only once for a given multidomain architecture. However, other scenarios may be relevant in the evolution of specific proteins, such as convergent evolution of multidomain architectures. With this in mind, we study glutaredoxin (GRX) domains, because these domains of approximately one hundred amino acids are widespread in archaea, bacteria and eukaryotes and participate in fusion proteins. GRXs are responsible for the reduction of protein disulfides or glutathione-protein mixed disulfides and are involved in cellular redox regulation, although their specific roles and targets are often unclear. Results: In this work we analyze the distribution and evolution of GRX proteins in archaea,bacteria and eukaryotes. We study over one thousand GRX proteins, each containing at least one GRX domain, from hundreds of different organisms and trace the origin and evolution of the GRX domain within the tree of life. Conclusion: Our results suggest that single domain GRX proteins of the CGFS and CPYC classes have, each, evolved through duplication and divergence from one initial gene that was present in the last common ancestor of all organisms. Remarkably, we identify a case of convergent evolution in domain architecture that involves the GRX domain. Two independent recombination events of a TRX domain to a GRX domain are likely to have occurred, which is an exception to the dominant mechanism of domain architecture evolution.
Resumo:
Random problem distributions have played a key role in the study and design of algorithms for constraint satisfaction and Boolean satisfiability, as well as in ourunderstanding of problem hardness, beyond standard worst-case complexity. We consider random problem distributions from a highly structured problem domain that generalizes the Quasigroup Completion problem (QCP) and Quasigroup with Holes (QWH), a widely used domain that captures the structure underlying a range of real-world applications. Our problem domain is also a generalization of the well-known Sudoku puz- zle: we consider Sudoku instances of arbitrary order, with the additional generalization that the block regions can have rectangular shape, in addition to the standard square shape. We evaluate the computational hardness of Generalized Sudoku instances, for different parameter settings. Our experimental hardness results show that we can generate instances that are considerably harder than QCP/QWH instances of the same size. More interestingly, we show the impact of different balancing strategies on problem hardness. We also provide insights into backbone variables in Generalized Sudoku instances and how they correlate to problem hardness.