Literatura académica sobre el tema "Minimum entropy coupling"

This paper reports an analytical study of the second law in the case of gas absorption into a laminar falling viscous incompressible liquid film. Velocity, temperature, and concentration profiles are determined and used for the entropy generation calculation. Irreversibilities due to heat transfer, fluid friction, and coupling effects between heat and mass transfer are derived. The obtained results show that entropy generation is mainly due to coupling effects between heat and mass transfer near the gas-liquid interface. Total irreversibility is minimum at the diffusion film thickness. On approaching the liquid film thickness, entropy generation is mainly due to viscous irreversibility.

In this work, the distance between a quark-antiquark pair is analyzed through both the confinement potential and the hadronic total cross- section. Using the Helmholtz free energy, the entropy is calculated near the minimum of the total cross-section through the confinement potential. A fitting procedure for the proton-proton total cross- section is carried out, defining the fit parameters. Therefore, the only remaining free parameter in the model is the mass-scale к used to define the running coupling constant of the light-front the approach to QCD. The mass scale controls the distance r between the quark-antiquark pair and, under some conditions, allows the appearance of free quarks even within the confinement regime of QCD.

We scrutinize the available (seemingly disparate) theories of protein folding and propose a new concept which brings them under one roof. First, we single out dipole–dipole coupling within protein backbone as the main reason for intrinsic double-well nature of the protein potential. Then, protein folding as a whole ought to be (at least) a two-stage process, namely: (a) both amino-acid side chains and solvent enslave the dynamics of the backbone to reach the folding transition state with the help of stochastic resonance, and (b) the backbone funnels the whole protein into the global potential energy minimum by enslaving the dynamics of the amino-acid side chains plus solvent, and simultaneously arresting the stochastic resonance prerequisites to lock the protein in its folded state. The latter is accomplished owing to the concerted action of the protein compactization (enthalpic contribution) and thermal motion intensification (entropic contribution), which is, in fact, a physical hallmark of enthalpy–entropy compensation.

The need for cooling is more and more important in current applications, as environmental constraints become more and more restrictive. Therefore, the optimization of reverse cycle machines is currently required. This optimization could be split in two parts, namely, (1) the design optimization, leading to an optimal dimensioning to fulfill the specific demand (static or nominal steady state optimization); and (2) the dynamic optimization, where the demand fluctuates, and the system must be continuously adapted. Thus, the variability of the system load (with or without storage) implies its careful control-command. The topic of this paper is concerned with part (1) and proposes a novel and more complete modeling of an irreversible Carnot refrigerator that involves the coupling between sink (source) and machine through a heat transfer constraint. Moreover, it induces the choice of a reference heat transfer entropy, which is the heat transfer entropy at the source of a Carnot irreversible refrigerator. The thermodynamic optimization of the refrigerator provides new results regarding the optimal allocation of heat transfer conductances and minimum energy consumption with associated coefficient of performance (COP) when various forms of entropy production owing to internal irreversibility are considered. The reported results and their consequences represent a new fundamental step forward regarding the performance upper bound of Carnot irreversible refrigerator.

Unmanned aerial vehicle borne frequency modulated continuous wave synthetic aperture radars are attracting more and more attention due to their low cost and flexible operation capacity, including the ability to capture images at different elevation angles for precise target identification. However, small unmanned aerial vehicles suffer from large trajectory deviation and severe range-azimuth coupling due to their simple navigational control and susceptibility to air turbulence. In this paper, we utilize the squint minimization technique to reduce this coupling while simultaneously eliminating intra-pulse motion-induced effects with an additional spectrum scaling. After which, the modified range doppler algorithm is derived for second order range compression and block-wise range cell migration correction. Raw data-based motion compensation is carried out with a doppler tracker. Squinted azimuth dependent phase gradient algorithm is employed to deal with azimuth dependent parameters and inexact deramping, with minimum entropy-based autofocusing algorithms. Finally, azimuth nonlinear chirp scaling is used for azimuth compression. Simulation and real data experiment results presented verify the effectiveness of the above signal processing approach.

Translational motion compensation and azimuth compression are two essential processes in inverse synthetic aperture radar (ISAR) imaging. The anterior process recovers coherence between pulses, during which the phase autofocus algorithm is usually used. For ISAR imaging of maneuvering targets, conventional phase autofocus methods cannot effectively eliminate the phase error due to the adverse influence of the quadratic phase terms caused by the target’s maneuvering motion, which leads to the blurring of ISAR images. To address this problem, an iterative phase autofocus approach for ISAR imaging of maneuvering targets is proposed in this paper. Considering the coupling between translational phase errors and quadratic phase terms, minimum entropy-based autofocus (MEA) method and adaptive modified Fourier transform (MFT) are performed iteratively to realize better imaging results. In this way, both the translational phase error and quadratic phase terms induced by target’s maneuvering motion can be compensated effectively, and the globally optimal ISAR image is obtained. Comparison ISAR imaging results indicates that the new approach achieves stable and better ISAR image under a simple procedure. Experimental results show that the image entropy of the proposed approach is 0.2 smaller than the MEA method, which validates the effectiveness of the new approach.

AbstractOne zone modeling of the irregular variability of red super-giants is intended with regard to the nonlinear coupling of finite amplitude pulsation with convection. The nonlocal mixing length is employed for the evaluation of the convective flux, the turbulent pressure and the turbulent power of temperature fluctuations. The radial pulsation and the Boussinesq convection are assumed for simplicity. The one zone is defined as the layer having the entropy maximum and the minimum at the bottom and at the top, respectively. The quasi-adiabatic approximation is consistent with this definition in fixing the zone to the same mass range. The spatial derivatives are evaluated under the assumption of homologous changes with the equilibrium homologous parameters. Then, a set of 6 simultaneous first order nonlinear ordinary differential equations are obtained as the one zone representation of the irregular variability of the convective envelope.

Abstract. The deterministic chaotic behaviour of magnetosphere was analyzed, using AE index time series. The significant chaotic quantifiers like, Lyapunov exponent, spatio-temporal entropy and nonlinear prediction error for AE index time series under various physical conditions were estimated and compared. During high solar activity (1991), the values of Lyapunov exponent for AE index time series representing quiet conditions (yearly mean = 0.5±0.1 min−1) have no significant difference from those values for corresponding storm conditions (yearly mean = 0.5±0.17 min−1). This implies that, for the cases considered here, geomagnetic storms may not be an additional source to increase or decrease the deterministic chaotic aspects of magnetosphere, especially during high solar activity. During solar minimum period (1994), the seasonal mean value of Lyapunov exponent for AE index time series belong to quiet periods in winter (0.7±0.11 min−1) is higher compared to corresponding value of storm periods in winter (0.36±0.09 min−1). This may be due to the fact that, stochastic part, which is Dst dependent could be more prominent during storms, thereby increasing fluctuations/stochasticity and reducing determinism in AE index time series during storms. It is observed that, during low solar active period (1994), the seasonal mean value of entropy for time series representing storm periods of equinox is greater than that for quiet periods. However, significant difference is not observed between storm and quiet time values of entropy during high solar activity (1991), which is also true for nonlinear prediction error for both low and high solar activities. In the case of both high and low solar activities, the higher standard deviations of yearly mean Lyapunov exponent values for AE index time series for storm periods compared to those for quiet periods might be due to the strong interplay between stochasticity and determinism during storms. It is inferred that, the external driving forces, mainly due to solar wind, make the solar-magnetosphere-ionosphere coupling more complex, which generates many active degrees of freedom with various levels of coupling among them, under various physical conditions. Hence, the superposition of a large number of active degrees of freedom can modify the stability/instability conditions of magnetosphere.

Abstract The Cohen-Kaplan-Nelson bound is imposed on the grounds of logical consistency (with classical General Relativity) upon local quantum field theories. This paper puts the bound into the context of a thermodynamic principle applicable to a field with a particular equation of state in an expanding universe. This is achieved without overtly appealing to either a decreasing density of states or a minimum coupling requirement, though they might still be consistent with the results described. We do so by defining an appropriate Helmholtz free energy which when extremized relative to a key parameter (the Hubble radius L) provides a scaling formula for the entropy with the Hubble radius (an exponent r used in the text). We deduce that the CKN bound is one possible solution to this extremization problem (with ), but there are others consistent with r = 2. The paper establishes that the holographic principle applied to cosmology is consistent with minimizing the free energy of the universe in the canonical ensemble, upon the assumption that the ultraviolet cutoff is a function of the causal horizon scale.

In recent years, the production of sequential data has been rapidly increasing. This requires solving challenging problems about how to represent information, how to retrieve information, and how to extract knowledge, from sequential data. These questions belong to the areas of coding, indexing, and mining, respectively. In this thesis, we investigate problems from those three areas. Coding refers to the way in which information is represented. Coding aims at generating optimal codes, that are codes having a minimum expected length. Codes can be generated for different purposes, from data compression to error detection/correction. The Lempel-Ziv 77 parsing produces an asymptotically optimal code in terms of compression. We study algorithms to efficiently decompress strings from the Lempel-Ziv 77 parsing, using memory proportional to the size of the parsing itself. We provide the first implementation of an algorithm by Bille et al., the only work we are aware of on this problem. We present a practical evaluation of this approach and several optimizations which improve the performance on all datasets we tested. Through the Ulam-R{'e}nyi game, it is possible to provide optimal adaptive error-correcting codes. The game consists of discovering an unknown $m$-bit number by asking membership questions the answers to which can be erroneous. Questions are formulated knowing the answers to all previous ones. We want to find an optimal strategy, i.e., a strategy that can identify any $m$-bit number using the theoretical minimum number of questions. We studied the case where questions are a union of up to a fixed number of intervals, and up to three answers can be erroneous. We first show that for any sufficiently large $m$, there exists a strategy to identify an initially unknown $m$-bit number which uses at most four intervals per question. We further refine our main tool to turn the above asymptotic result into a complete characterization of those instances of the Ulam-R{'e}nyi game that admit optimal strategies. Indexing refers to the way in which information is retrieved. An index for texts permits finding all occurrences of any substring, without traversing the whole text. Many applications require to look for approximate substrings. One of these is the problem of jumbled pattern matching, where two strings match if one is a permutation of the other. We study combinatorial aspects of prefix normal words, a class of binary words introduced in this context. These words can be used as indices for the Indexed Binary Jumbled Pattern Matching problem. We present a new recursive generation algorithm for prefix normal words that is competitive with the previous one but allows to list all prefix normal words sharing the same prefix. This sheds lights on novel insights that may help solving the problem of counting the number of prefix normal words of a given length. We then introduce infinite prefix normal words, and we show that one of the operations used by the algorithm, when repeatedly applied to extend a word, produces an infinite prefix normal word. This motivates the seeking for other operations that produce infinite prefix normal words. We found that one of these operations establishes a connection between prefix normal words and Sturmian words. We also explored the relationship between prefix normal words and Abelian complexity, as well as between prefix normal words and lexicographic order. Mining refers to the way in which information is converted into knowledge. The process of knowledge discovery covers several processing steps, including knowledge extraction. We analyze the problem of mining assertions for an embedded system from its simulation traces. This problem can be modeled as a pattern discovery problem on colored strings. We present two problems of pattern discovery on colored strings: patterns for one color only, or for all colors at the same time. We present two suffix tree-based algorithms. The first algorithm solves both the one color problem and the all colors problem. We then, introduce modifications which improve performance of the algorithm both on synthetic and on real data. We implemented and evaluated the proposed approaches, highlighting time trade-offs that can be obtained. A different way of knowledge extraction is based on the information-theoretic perspective of Pearl's model of causality. It has been postulated that the true causality direction between two phenomena A and B is related to the problem of finding the minimum entropy joint distribution between A and B. This problem is known to be NP-hard, and greedy algorithms have recently been proposed. We provide a novel analysis of one of the proposed heuristic showing that this algorithm guarantees an additive approximation of 1 bit. We then, provide a general criterion for guaranteeing an additive approximation factor of 1. This criterion may be of independent interest in other contexts where couplings are used.

Grid systems provide mechanisms for single sign-on, and uniform APIs for job submission and data transfer, in order to allow the coupling of distributed resources in a seamless manner. However, new users face a daunting barrier of entry due to the high cost of deployment and maintenance. They are often required to learn complex concepts relative to Grid infrastructures (credential management, scheduling systems, data staging, etc). To most scientific users, running their applications with minimal changes and yet getting results faster is highly desirable, without having to know much about how the resources are used. Hence, a higher level of abstraction must be provided for the underlying infrastructure to be used effectively. For this purpose, we have developed the Opal toolkit for exposing applications on Grid resources as simple Web services. Opal provides a basic set of Application Programming Interfaces (APIs) that allows users to execute their deployed applications, query job status, and retrieve results. Opal also provides a mechanism to define command-line arguments and automatically generates user interfaces for the Web services dynamically. In addition, Opal services can be hooked up to a Metascheduler such as CSF4 to leverage a distributed set of resources, and accessed via a multitude of interfaces such as Web browsers, rich desktop environments, workflow tools, and command-line clients.