6,409 research outputs found
Momentum Space Regularizations and the Indeterminacy in the Schwinger Model
We revisited the problem of the presence of finite indeterminacies that
appear in the calculations of a Quantum Field Theory. We investigate the
occurrence of undetermined mathematical quantities in the evaluation of the
Schwinger model in several regularization scenarios. We show that the
undetermined character of the divergent part of the vacuum polarization tensor
of the model, introduced as an {\it ansatz} in previous works, can be obtained
mathematically if one introduces a set of two parameters in the evaluation of
these quantities. The formal mathematical properties of this tensor and their
violations are discussed. The analysis is carried out in both analytical and
sharp cutoff regularization procedures. We also show how the Pauli Villars
regularization scheme eliminates the indeterminacy, giving a gauge invariant
result in the vector Schwinger model.Comment: 10 pages, no figure
Domain wall description of superconductivity
In the present work we shall address the issue of electrical conductivity in
superconductors in the perspective of superconducting domain wall solutions in
the realm of field theory. We take our set up made out of a dynamical complex
scalar field coupled to gauge field to be responsible for superconductivity and
an extra scalar real field that plays the role of superconducting domain walls.
The temperature of the system is interpreted through the fact that the soliton
following accelerating orbits is a Rindler observer experiencing a thermal
bath.Comment: 9 pages, 5 figures, Latex. Version to appear in PL
Distributed Optimization With Local Domains: Applications in MPC and Network Flows
In this paper we consider a network with nodes, where each node has
exclusive access to a local cost function. Our contribution is a
communication-efficient distributed algorithm that finds a vector
minimizing the sum of all the functions. We make the additional assumption that
the functions have intersecting local domains, i.e., each function depends only
on some components of the variable. Consequently, each node is interested in
knowing only some components of , not the entire vector. This allows
for improvement in communication-efficiency. We apply our algorithm to model
predictive control (MPC) and to network flow problems and show, through
experiments on large networks, that our proposed algorithm requires less
communications to converge than prior algorithms.Comment: Submitted to IEEE Trans. Aut. Contro
D-ADMM: A Communication-Efficient Distributed Algorithm For Separable Optimization
We propose a distributed algorithm, named Distributed Alternating Direction
Method of Multipliers (D-ADMM), for solving separable optimization problems in
networks of interconnected nodes or agents. In a separable optimization problem
there is a private cost function and a private constraint set at each node. The
goal is to minimize the sum of all the cost functions, constraining the
solution to be in the intersection of all the constraint sets. D-ADMM is proven
to converge when the network is bipartite or when all the functions are
strongly convex, although in practice, convergence is observed even when these
conditions are not met. We use D-ADMM to solve the following problems from
signal processing and control: average consensus, compressed sensing, and
support vector machines. Our simulations show that D-ADMM requires less
communications than state-of-the-art algorithms to achieve a given accuracy
level. Algorithms with low communication requirements are important, for
example, in sensor networks, where sensors are typically battery-operated and
communicating is the most energy consuming operation.Comment: To appear in IEEE Transactions on Signal Processin
Distributed Basis Pursuit
We propose a distributed algorithm for solving the optimization problem Basis
Pursuit (BP). BP finds the least L1-norm solution of the underdetermined linear
system Ax = b and is used, for example, in compressed sensing for
reconstruction. Our algorithm solves BP on a distributed platform such as a
sensor network, and is designed to minimize the communication between nodes.
The algorithm only requires the network to be connected, has no notion of a
central processing node, and no node has access to the entire matrix A at any
time. We consider two scenarios in which either the columns or the rows of A
are distributed among the compute nodes. Our algorithm, named D-ADMM, is a
decentralized implementation of the alternating direction method of
multipliers. We show through numerical simulation that our algorithm requires
considerably less communications between the nodes than the state-of-the-art
algorithms.Comment: Preprint of the journal version of the paper; IEEE Transactions on
Signal Processing, Vol. 60, Issue 4, April, 201
Modeling the influence of slurry concentration on Saccharomyces cerevisiae cake porosity and resistance during microfiltration
Filtration of an isotonic suspension of baker's yeast through a 0.45-μm membrane was studied at two different pressures, 40 and 80 kPa, for yeast concentrations ranging from 0.14 to 51 kg/m3 (dry weight). For a yeast volume fraction above 0.06 (∼21.8 kg/m3), the porosity of the yeast cake is less dependent on the suspension concentration. For highly diluted suspensions, the specific cake resistance approaches a minimum that depends on the filtration pressure. Correlation functions of cake porosity and specific cake resistance were obtained for the concentration range investigated showing that the Kozeny–Carman coefficient increases when the applied pressure increases. Both filtration pressure and slurry concentration can be process controlled. In the range of moderate yeast concentration, the filtrate flux may be increased by manipulating the filtration pressure and the slurry concentration, thereby improving the overall process efficiency. The complex behavior of yeast cakes at high slurry concentration can be described by a conventional model as long as part of yeast cells are assumed to form aggregates, which behave as single bigger particles. The aggregation effect may be accounted for using a binary mixture model.The authors acknowledge the grant given to Dr. Yelshin by Fundacao para a Ciencia e Tecnologia (FCT), without which this work would not be possible. The authors also acknowledge the FCT funding of the project POCTI/EQU/55837/2004, under which the present research was performed. This work is intended to render homage to Alexander Yelshin, a long-term partner who wrote several articles with the authors, who passed away suddenly, to our grief
Lamas activadas - sistema de mistura completa
O princípio do processo de lamas activadas consiste no fornecimento constante de matéria orgânica e oxigénio a uma comunidade de micro-organismos que se encontra num reactor. Os micro-organismos consomem a matéria orgânica e transformam-na através do metabolismo aeróbio, parte em nova biomassa microbiana e parte em CO2, H2O e minerais (processo de estabilização).
Os micro-organismos (lamas), que crescem em flocos, são constantemente removidos do reactor para o sedimentador, onde devido a sua densidade, se separam do efluente tratado por sedimentação. O efluente sai pela parte superior do sedimentador e os micro-organismos sedimentados siio removidos pela parte inferior. Parte desta lama e então recirculada para o reactor, com a finalidade de manter a concentração em microrganismos necessária a um tratamento eficiente e o excesso de lama e purgado. Num processo de lamas activadas a operar em estado estacionário, a quantidade de lama purgada representa a massa microbiana produzida no reactor arejado.
A mistura completa permite estabelecer uma concentração em sólidos uniforme e uma necessidade em oxigénio constante no tanque de arejamento. Este tipo de sistema e resistente a perturbações originadas por choques orgânicos e/ou hidráulicos.info:eu-repo/semantics/publishedVersio
On Y-Linked Genes and Bisexual Branching Processes
2000 Mathematics Subject Classification: 60J80.In this paper we survey the results concerning the extinction problem for a two-allele Y-linked gene in a two-sex monogamic population, with a preference of females for males carrying one of the two alleles of the gene. First we give the mathematical definition of the Y-linked bisexual branching process to model this situation and study some of its relevant properties. Then, we research the extinction of the population and also the survival of each genotype depending on the behaviour of the other genotype. Finally, we simulate the evolution of the population and conjecture its long term behaviour, for some critical situations.This research was supported by the Ministerio de Educacion y Ciencia and the FEDER through the Plan Nacional de Investigaci´on Cient´ıfica, Desarrollo e Innovaci´on Tecnologica, grant MTM2006-08891
- …