Dados um espaço de medida (X;A;m) e números reais p,q>1 com 1/p+1/q=1, o Teorema de Representação de Riesz afirma que Lq(X;A;m) é o dual topológico de Lp(X;A;m) e que Loo(X;A; m) é o dual topológico de L1(X;A;m) se o espaço (X;A;m) for sigma-finito. Observamos que a sigma-finitude de (X;A;m) é condição suficiente mas não necessária para que Loo(X;A;m) seja o dual de L1(X;A;m). Os contra-exemplos tipicamente apresentados para essa última identificação são \"triviais\", no sentido de que desaparecem se \"consertarmos\" a medida , transformando-a numa medida perfeita. Neste trabalho apresentamos condições sufcientes mais fracas que sigma-finitude a fim de que Loo(X;A;m) e o dual de L1(X;A;m) possam ser isometricamente identificados. Além disso, introduzimos um invariante cardinal para espaços de medida que chamaremos a dimensão do espaço e mostramos que se o espaço (X;A;m) for de medida perfeita e tiver dimensão menor ou igual à cardinalidade do continuum então uma condição necessária e suficiente para Loo(X;A;m) seja o dual de L1(X;A;m) é que X admita uma decomposição. / Given a measure space (X;A;m) and real numbers p,q>1 with 1/p+1/q=1, the Riesz Representation Theorem states that Lq(X;A;m) is the topological dual space of Lp(X;A;m) and that Loo(X;A; m) is the topological dual space of L1(X;A;m) if (X;A; m) is sigma-finite. We observe that the sigma-finiteness of (X;A;m) is a suficient but not necessary condition for Loo(X;A;m) to be the dual of L1(X;A;m). The counter-examples that are typically presented for Loo(X;A;m) = L1(X;A;m)* are \"trivial\", in the sense that they vanish if we fix the measure , making it into a perfect measure. In this work we present suficient conditions weaker than sigma-finiteness in order that Loo(X;A; m) and L1(X;A;m)* can be isometrically identified. Moreover, we introduce a cardinal invariant for measure spaces which we call the dimension of the space and we show that if the space (X;A;m) has perfect measure and dimension less than or equal to the cardinal of the continuum then a necessary and suficient condition for Loo(X;A;m) = L1(X;A;m)* is that X admits a decomposition.

The aim of this paper is to investigate the known nonuniform version of Esseen''s inequality in the Lp-metric, to get a numerical bound for the appearing constant L. For a long time the results given by several authors constate the impossibility of a nonuniform estimation in the most interesting case δ=1, because the effect L=L(δ)=O(1/(1-δ)), δ->1-0, was observed, where 2+δ, 0<δ<1, is the order of the assumed moments of the considered independent random variables X_k, k=1,2,...,n. Again making use of the method of conjugated distributions, we improve the well-known technique to show in the most interesting case δ=1 the finiteness of the absolute constant L and to prove L=L(1)=<127,74*7,31^(1/p), p>1. In the case 0<δ<1 we only give the analytical structure of L but omit numerical calculations. Finally an example on normal approximation of sums of l_2-valued random elements demonstrates the application of the nonuniform mean central limit bounds obtained here.:1. Introduction S. 3 2. The nonuniform version of ESSEEN''s Inequality in the Lp-metrie S. 4 3. The partition of the domain of integration S. 5 4. The domain of moderate x S. 8 5. An error bound for large values of L2+δ,n S. 12 6. The proof of the inequality (2.1) S. 13 7. An application to normalapproximation of sums of l2-valued random elements S. 14 References S. 18 / Das Anliegen dieses Artikels besteht in der Untersuchung einer bekannten Variante der Esseen''schen Ungleichung in Form einer ungleichmäßigen Fehlerabschätzung in der Lp-Metrik mit dem Ziel, eine numerische Abschätzung für die auftretende absolute Konstante L zu erhalten. Längere Zeit erweckten die Ergebnisse, die von verschiedenen Autoren angegeben wurden, den Eindruck, dass die ungleichmäßige Fehlerabschätzung im interessantesten Fall δ=1 nicht möglich wäre, weil auf Grund der geführten Beweisschritte der Einfluss von δ auf L in der Form L=L(δ)=O(1/(1-δ)), δ->1-0, beobachtet wurde, wobei 2+δ, 0<δ<1, die Ordnung der vorausgesetzten Momente der betrachteten unabhängigen Zufallsgrößen X_k, k=1,2,...,n, angibt. Erneut wird die Methode der konjugierten Verteilungen angewendet und die gut bekannte Beweistechnik verbessert, um im interessantesten Fall δ=1 die Endlichkeit der absoluten Konstanten L nachzuweisen und um zu zeigen, dass L=L(1)=<127,74*7,31^(1/p), p>1, gilt. Im Fall 0<δ<1 wird nur die analytische Struktur von L herausgearbeitet, jedoch ohne numerische Berechnungen. Schließlich wird mit einem Beispiel zur Normalapproximation von Summen l_2-wertigen Zufallselementen die Anwendung der gewichteten Fehlerabschätzung im globalen zentralen Grenzwertsatz demonstriert.:1. Introduction S. 3 2. The nonuniform version of ESSEEN''s Inequality in the Lp-metrie S. 4 3. The partition of the domain of integration S. 5 4. The domain of moderate x S. 8 5. An error bound for large values of L2+δ,n S. 12 6. The proof of the inequality (2.1) S. 13 7. An application to normalapproximation of sums of l2-valued random elements S. 14 References S. 18

[pt] Esta dissertação versa sobre a teoria das soluções de viscosidadepara equações diferenciais parciais elípticas completamente não-lineares com ingredientes mensuráveis. Nosso principal objetivo é demonstrar o Princípio do Máximo de Aleksandrov-Bakelman-Pucci neste contexto. / [en] This dissertation deals with the theory of viscosity solutions for fully nonlinear elliptic partial differential equations with measurable ingredients. Our main objective is to demonstrate the Aleksandrov-Bakelman-Pucci Maximum Principle in this context.

No description available.

<p>Scheduling a set of jobs over a collection of machines to optimize a certain quality-of-service measure is one of the most important research topics in both computer science theory and practice. In this thesis, we design algorithms that optimize {\em flow-time} (or delay) of jobs for scheduling problems that arise in a wide range of applications. We consider the classical model of unrelated machine scheduling and resolve several long standing open problems; we introduce new models that capture the novel algorithmic challenges in scheduling jobs in data centers or large clusters; we study the effect of selfish behavior in distributed and decentralized environments; we design algorithms that strive to balance the energy consumption and performance. </p><p>The technically interesting aspect of our work is the surprising connections we establish between approximation and online algorithms, economics, game theory, and queuing theory. It is the interplay of ideas from these different areas that lies at the heart of most of the algorithms presented in this thesis.</p><p>The main contributions of the thesis can be placed in one of the following categories.</p><p>1. Classical Unrelated Machine Scheduling: We give the first polygorithmic approximation algorithms for minimizing the average flow-time and minimizing the maximum flow-time in the offline setting. In the online and non-clairvoyant setting, we design the first non-clairvoyant algorithm for minimizing the weighted flow-time in the resource augmentation model. Our work introduces iterated rounding technique for the offline flow-time optimization, and gives the first framework to analyze non-clairvoyant algorithms for unrelated machines.</p><p>2. Polytope Scheduling Problem: To capture the multidimensional nature of the scheduling problems that arise in practice, we introduce Polytope Scheduling Problem (\psp). The \psp problem generalizes almost all classical scheduling models, and also captures hitherto unstudied scheduling problems such as routing multi-commodity flows, routing multicast (video-on-demand) trees, and multi-dimensional resource allocation. We design several competitive algorithms for the \psp problem and its variants for the objectives of minimizing the flow-time and completion time. Our work establishes many interesting connections between scheduling and market equilibrium concepts, fairness and non-clairvoyant scheduling, and queuing theoretic notion of stability and resource augmentation analysis.</p><p>3. Energy Efficient Scheduling: We give the first non-clairvoyant algorithm for minimizing the total flow-time + energy in the online and resource augmentation model for the most general setting of unrelated machines.</p><p>4. Selfish Scheduling: We study the effect of selfish behavior in scheduling and routing problems. We define a fairness index for scheduling policies called {\em bounded stretch}, and show that for the objective of minimizing the average (weighted) completion time, policies with small stretch lead to equilibrium outcomes with small price of anarchy. Our work gives the first linear/ convex programming duality based framework to bound the price of anarchy for general equilibrium concepts such as coarse correlated equilibrium.</p> / Dissertation

For a compact, nowhere dense set X in the complex plane, C, define Rp(X) as the closure of the rational functions with poles off X in Lp(X, dA). It is well known that for 1 ≤ p < 2, Rp(X) = Lp(X) . Although density may not be achieved for p > 2, there exists a set X so that Rp(X) = Lp(X) for p up to a given number greater than 2 but not after. Additionally, when p > 2 we shall establish that the support of the annihiliating and representing measures for Rp(X) lies almost everywhere on the set of bounded point evaluations of X.

Gas phase kinetics of the reactions involving hydroxyl radical and hydrogen atom were studied using experimental and ab initio theoretical techniques. The rate constant for the H + H2S reaction has been measured from 298 to 598 K by the laser photolysis/resonance fluorescence (LP-RF) technique. The transition state theory (TST) analysis coupled with the measurements support the suggestion that the reaction shows significant curvature in the Arrhenius plot. The LP-RF technique was also used to measure the rate constant of the H + CH3Br reaction over the temperature range 400-813 K. TST and density functional theory (DFT) calculations show that the dominant reaction channel is Br-abstraction. The reaction H + CF2=CF-CF=CF2 was first studied by flash photolysis/resonance fluorescence (FP-RF) method. The experiments of this work revealed distinctly non-Arrhenius behavior, which was interpreted in terms of a change in mechanism. DFT calculations suggest that the adduct is CF2H-CF•-CF=CF2. At lower temperatures a mixture of this molecule and CF2•-CFH-CF=CF2 is likely. The theoretical calculations show that H atom migrates in the fluoroethyl radicals through a bridging intermediate, and the barrier height for this process is lower in the less fluorinated ethyl radical. High level computations were also employed in studies of the rate constants of OH + chloroethylenes reactions. VTST calculations indicate that, except the reaction of OH + C2Cl4, these reactions present a complex behavior. For OH + C2Cl4, conventional TST calculation shows a simple positive temperature-dependence behavior.

Each year the Railway Applications Section (RAS) of the Institution for Operations Research and the Management Sciences (INFORMS) posits a research problem to the world in the form of a competition. For 2012, the contest involved solving the Train Dispatching Problem (TDP) on a realistic 85 edge network for three different sets of input data. This work is an independent attempt to match or improve upon the results of the top three finishers in the contest using mixed integer programming (MIP) techniques while minimizing the use of heuristics. The primary focus is to partition the network in a manner that reduces the number of binary variables in the formulation as much as possible without compromising the ability to satisfy any of the contest requirements. This resulted in the ability to optimally solve this model for RAS Data Set 1 in 29 seconds without any problem-specific heuristics, variable restrictions, or variable fixing. Applying some assumptions about train movements allowed the same Data Set 1 solution to be found in 5.4 seconds. After breaking the larger Data Sets 2 and 3 into smaller sub-problems, solutions for Data Sets 2 and 3 were 28% and 1% better, respectively, than those of the competition winner. The time to obtain solutions for Data Sets 2 and 3 was 90 and 318 seconds, respectively.

Mémoire numérisé par la Direction des bibliothèques de l'Université de Montréal.

Given the ubiquity of time series data, and the exponential growth of databases, there has recently been an explosion of interest in time series data mining. Finding similar trends and patterns among time series data is critical for many applications ranging from financial planning, weather forecasting, stock analysis to policy making. With time series being high-dimensional objects, detection of similar trends especially at the granularity of subsequences or among time series of different lengths and temporal misalignments incurs prohibitively high computation costs. Finding trends using non-metric correlation measures further compounds the complexity, as traditional pruning techniques cannot be directly applied. My dissertation addresses these challenges while meeting the need to achieve near real-time responsiveness. First, for retrieving exact similarity results using Lp-norm distances, we design a two-layered time series index for subsequence matching. Time series relationships are compactly organized in a directed acyclic graph embedded with similarity vectors capturing subsequence similarities. Powerful pruning strategies leveraging the graph structure greatly reduce the number of time series as well as subsequence comparisons, resulting in a several order of magnitude speed-up. Second, to support a rich diversity of correlation analytics operations, we compress time series into Euclidean-based clusters augmented by a compact overlay graph encoding correlation relationships. Such a framework supports a rich variety of operations including retrieving positive or negative correlations, self correlations and finding groups of correlated sequences. Third, to support flexible similarity specification using computationally expensive warped distance like Dynamic Time Warping we design data reduction strategies leveraging the inexpensive Euclidean distance with subsequent time warped matching on the reduced data. This facilitates the comparison of sequences of different lengths and with flexible alignment still within a few seconds of response time. Comprehensive experimental studies using real-world and synthetic datasets demonstrate the efficiency, effectiveness and quality of the results achieved by our proposed techniques as compared to the state-of-the-art methods.