O fim do subsídio do trigo e a utilização de farinhas mistas.

bitstream/item/119471/1/FOL-04309.pdfTrabalho apresentado na I Jornada Estadual de Tecnologia de Alimentos e Nutrição Humana, Passo Fundo, 1988

Partonic Energy Loss and the Drell-Yan Process

We examine the current status of the extraction of the rate of partonic energy loss in nuclei from A dependent data. The advantages and difficulties of using the Drell-Yan process to measure the energy loss of a parton traversing a cold nuclear medium are discussed. The prospects of using relatively low energy proton beams for a definitive measurement of partonic energy loss are presented.Comment: 12 pages, 2 figure

Maximizing the Conditional Expected Reward for Reaching the Goal

The paper addresses the problem of computing maximal conditional expected accumulated rewards until reaching a target state (briefly called maximal conditional expectations) in finite-state Markov decision processes where the condition is given as a reachability constraint. Conditional expectations of this type can, e.g., stand for the maximal expected termination time of probabilistic programs with non-determinism, under the condition that the program eventually terminates, or for the worst-case expected penalty to be paid, assuming that at least three deadlines are missed. The main results of the paper are (i) a polynomial-time algorithm to check the finiteness of maximal conditional expectations, (ii) PSPACE-completeness for the threshold problem in acyclic Markov decision processes where the task is to check whether the maximal conditional expectation exceeds a given threshold, (iii) a pseudo-polynomial-time algorithm for the threshold problem in the general (cyclic) case, and (iv) an exponential-time algorithm for computing the maximal conditional expectation and an optimal scheduler.Comment: 103 pages, extended version with appendices of a paper accepted at TACAS 201

A Component-oriented Framework for Autonomous Agents

The design of a complex system warrants a compositional methodology, i.e., composing simple components to obtain a larger system that exhibits their collective behavior in a meaningful way. We propose an automaton-based paradigm for compositional design of such systems where an action is accompanied by one or more preferences. At run-time, these preferences provide a natural fallback mechanism for the component, while at design-time they can be used to reason about the behavior of the component in an uncertain physical world. Using structures that tell us how to compose preferences and actions, we can compose formal representations of individual components or agents to obtain a representation of the composed system. We extend Linear Temporal Logic with two unary connectives that reflect the compositional structure of the actions, and show how it can be used to diagnose undesired behavior by tracing the falsification of a specification back to one or more culpable components

Quantitative multi-objective verification for probabilistic systems

We present a verification framework for analysing multiple quantitative objectives of systems that exhibit both nondeterministic and stochastic behaviour. These systems are modelled as probabilistic automata, enriched with cost or reward structures that capture, for example, energy usage or performance metrics. Quantitative properties of these models are expressed in a specification language that incorporates probabilistic safety and liveness properties, expected total cost or reward, and supports multiple objectives of these types. We propose and implement an efficient verification framework for such properties and then present two distinct applications of it: firstly, controller synthesis subject to multiple quantitative objectives; and, secondly, quantitative compositional verification. The practical applicability of both approaches is illustrated with experimental results from several large case studies

Phenomenology of Jet Quenching in Heavy Ion Collisions

We derive an analytical expression for the quenching factor in the strong quenching limit where the $p_T$ spectrum of hard partons is dominated by surface emission. We explore the phenomenological consequences of different scaling laws for the energy loss and calculate the additional suppression of the away-side jet.Comment: Substantially modified manuscrip

On finitely ambiguous B\"uchi automata

Unambiguous B\"uchi automata, i.e. B\"uchi automata allowing only one accepting run per word, are a useful restriction of B\"uchi automata that is well-suited for probabilistic model-checking. In this paper we propose a more permissive variant, namely finitely ambiguous B\"uchi automata, a generalisation where each word has at most $k$ accepting runs, for some fixed $k$. We adapt existing notions and results concerning finite and bounded ambiguity of finite automata to the setting of $\omega$-languages and present a translation from arbitrary nondeterministic B\"uchi automata with $n$ states to finitely ambiguous automata with at most $3^n$ states and at most $n$ accepting runs per word

Calculating Quenching Weights

We calculate the probability (``quenching weight'') that a hard parton radiates an additional energy fraction due to scattering in spatially extended QCD matter. This study is based on an exact treatment of finite in-medium path length, it includes the case of a dynamically expanding medium, and it extends to the angular dependence of the medium-induced gluon radiation pattern. All calculations are done in the multiple soft scattering approximation (Baier-Dokshitzer-Mueller-Peign\'e-Schiff--Zakharov ``BDMPS-Z''-formalism) and in the single hard scattering approximation (N=1 opacity approximation). By comparison, we establish a simple relation between transport coefficient, Debye screening mass and opacity, for which both approximations lead to comparable results. Together with this paper, a CPU-inexpensive numerical subroutine for calculating quenching weights is provided electronically. To illustrate its applications, we discuss the suppression of hadronic transverse momentum spectra in nucleus-nucleus collisions. Remarkably, the kinematic constraint resulting from finite in-medium path length reduces significantly the transverse momentum dependence of the nuclear modification factor, thus leading to consistency with the data measured at the Relativistic Heavy Ion Collider (RHIC).Comment: 45 pages LaTeX, 20 eps-figure

Automated detection of time-dependent cross-correlation clusters in nonstationary time series

A novel method for the detection of cross-correlation clusters in multivariate time series is suggested. It is based on linear combinations of the eigenvectors corresponding to the largest eigenvalues of the equal-time cross-correlation matrix. The linear combinations are found in a systematic way by maximizing an appropriate distance measure. The performance of the algorithm is evaluated with a flexible time-series$\hbox{--}$based test framework for cluster algorithms. Attribution errors are investigated quantitatively in model data and a comparison with three alternative approaches is made. As the algorithm is suitable for unsupervised online application we demonstrate its time-resolved use in the example of cluster detection in time series from human electroencephalogram