An approximate mathematical model for solidification of a flowing liquid in a microchannel

A mathematical model is developed to analyse the combined flow and solidification of a liquid in a small pipe or two-dimensional channel. In either case the problem reduces to solving a single equation for the position of the solidification front. Results show that for a large range of flow rates the closure time is approximately constant, and the value depends primarily on the wall temperature and channel width. However, the ice shape at closure will be very different for low and high fluxes. As the flow rate increases the closure time starts to depend on the flow rate until the closure time increases dramatically, subsequently the pipe will never close.

A Many-to-many 'rural hospital theorem'

We show that the full version of the so-called 'rural hospital theorem' (Roth, 1986) generalizes to many-to-many matching where agents on both sides of the market have separable and substitutable preferences.

A non-possibility theorem for joint-stability in interindustry models

Joint-stability in interindustry models relates to the mutual simultaneous consistency of the demand-driven and supply-driven models of Leontief and Ghosh, respectively. Previous work has claimed joint-stability to be an acceptable assumption from the empirical viewpoint, provided only small changes in exogenous variables are considered. We show in this note, however, that the issue has deeper theoretical roots and offer an analytical demonstration that shows the impossibility of consistency between demand-driven and supply-driven models.

An approximate solution method for boundary layer flow of a power law fluid over a flat plate

The work in this paper deals with the development of momentum and thermal boundary layers when a power law fluid flows over a flat plate. At the plate we impose either constant temperature, constant flux or a Newton cooling condition. The problem is analysed using similarity solutions, integral momentum and energy equations and an approximation technique which is a form of the Heat Balance Integral Method. The fluid properties are assumed to be independent of temperature, hence the momentum equation uncouples from the thermal problem. We first derive the similarity equations for the velocity and present exact solutions for the case where the power law index n = 2. The similarity solutions are used to validate the new approximation method. This new technique is then applied to the thermal boundary layer, where a similarity solution can only be obtained for the case n = 1.

A lower bound in Nehari's theorem on the polydisc

"Vegeu el resum a l'inici del document del fitxer adjunt"

A Folk Theorem for Games when Frequent Monitoring Decreases Noise

This paper studies frequent monitoring in an infinitely repeated game with imperfect public information and discounting, where players observe the state of a continuous time Brownian process at moments in time of length _. It shows that a limit folk theorem can be achieved with imperfect public monitoring when players monitor each other at the highest frequency, i.e., _. The approach assumes that the expected joint output depends exclusively on the action profile simultaneously and privately decided by the players at the beginning of each period of the game, but not on _. The strong decreasing effect on the expected immediate gains from deviation when the interval between actions shrinks, and the associated increase precision of the public signals, make the result possible in the limit. JEL: C72/73, D82, L20. KEYWORDS: Repeated Games, Frequent Monitoring, Public Monitoring, Brownian Motion.

The curvature of the conical intersection seam: an approximate second-order analysis

We present a method for analyzing the curvature (second derivatives) of the conical intersection hyperline at an optimized critical point. Our method uses the projected Hessians of the degenerate states after elimination of the two branching space coordinates, and is equivalent to a frequency calculation on a single Born-Oppenheimer potential-energy surface. Based on the projected Hessians, we develop an equation for the energy as a function of a set of curvilinear coordinates where the degeneracy is preserved to second order (i.e., the conical intersection hyperline). The curvature of the potential-energy surface in these coordinates is the curvature of the conical intersection hyperline itself, and thus determines whether one has a minimum or saddle point on the hyperline. The equation used to classify optimized conical intersection points depends in a simple way on the first- and second-order degeneracy splittings calculated at these points. As an example, for fulvene, we show that the two optimized conical intersection points of C2v symmetry are saddle points on the intersection hyperline. Accordingly, there are further intersection points of lower energy, and one of C2 symmetry - presented here for the first time - is found to be the global minimum in the intersection space

Parallel scheduling of multiclass M/M/m queues: Approximate and heavy-traffic optimization of achievable performance

We address the problem of scheduling a multiclass $M/M/m$ queue with Bernoulli feedback on $m$ parallel servers to minimize time-average linear holding costs. We analyze the performance of a heuristic priority-index rule, which extends Klimov's optimal solution to the single-server case: servers select preemptively customers with larger Klimov indices. We present closed-form suboptimality bounds (approximate optimality) for Klimov's rule, which imply that its suboptimality gap is uniformly bounded above with respect to (i) external arrival rates, as long as they stay within system capacity;and (ii) the number of servers. It follows that its relativesuboptimality gap vanishes in a heavy-traffic limit, as external arrival rates approach system capacity (heavy-traffic optimality). We obtain simpler expressions for the special no-feedback case, where the heuristic reduces to the classical $c \mu$ rule. Our analysis is based on comparing the expected cost of Klimov's ruleto the value of a strong linear programming (LP) relaxation of the system's region of achievable performance of mean queue lengths. In order to obtain this relaxation, we derive and exploit a new set ofwork decomposition laws for the parallel-server system. We further report on the results of a computational study on the quality of the $c \mu$ rule for parallel scheduling.

Exact and approximate stepdown methods for multiple hypothesis testing

Consider the problem of testing k hypotheses simultaneously. In this paper,we discuss finite and large sample theory of stepdown methods that providecontrol of the familywise error rate (FWE). In order to improve upon theBonferroni method or Holm's (1979) stepdown method, Westfall and Young(1993) make eective use of resampling to construct stepdown methods thatimplicitly estimate the dependence structure of the test statistics. However,their methods depend on an assumption called subset pivotality. The goalof this paper is to construct general stepdown methods that do not requiresuch an assumption. In order to accomplish this, we take a close look atwhat makes stepdown procedures work, and a key component is a monotonicityrequirement of critical values. By imposing such monotonicity on estimatedcritical values (which is not an assumption on the model but an assumptionon the method), it is demonstrated that the problem of constructing a validmultiple test procedure which controls the FWE can be reduced to the problemof contructing a single test which controls the usual probability of a Type 1error. This reduction allows us to draw upon an enormous resamplingliterature as a general means of test contruction.

Noether's theorem and gauge transformations. Application to the bosonic string and CP(2,n-1) model

New results on the theory of constrained systems are applied to characterize the generators of Noethers symmetry transformations. As a byproduct, an algorithm to construct gauge transformations in Hamiltonian formalism is derived. This is illustrated with two relevant examples.

Lee HWA Chung theorem for presympectic manifolds. Canonical transformations for constrained systems

We generalize the analogous of Lee Hwa Chungs theorem to the case of presymplectic manifolds. As an application, we study the canonical transformations of a canonical system (M, S, O). The role of Dirac brackets as a test of canonicity is clarified.