Symplectic geometry,minors and graph Laplacians

In my talk, I will present some works done in the nineties on Laplacians on graphs: from eigenvalue problems to inverse problem for resistor networks. I will focus on the motivations and the main results as well as on the main ideas:

• •A differential topology point of view on the minor relation: a nice stratification associated to a finite graph Γ whose strata are associated to the minors of Γ
• •“Discrete” (graphs) versus “continuous” (Riemannian manifolds)
• •Stability of spectra with respect to singular limits: a finite dimensional theory of operators with domains (Von Neumann theory).

The link with topology will appear in some results about my graph parameter μ, in particular the planarity and the linkless embedding properties.     

Free energy and solutions of the Vlasov-Poisson-Fokker-Planck system: external potential and confinement (Large time behavior and steady states)

This paper is devoted to the characterization of external electrostatic potentials for which the Vlasov-Poisson-Fokker-Planck system satisfies one of the following properties:

• (i) the system admits stationary solutions,
• (ii) any solution to the evolution problem converges to a stationary solution, or, equivalently, no mass vanishes for large times,
• (iii) the free energy is bounded from below, We give conditions under which these different notions of confinement are equivalent.

     

Dynamic graph models

Research in graph theory has focused on studying the structure of graphs with the assumption that they are static. However, in many applications, the graphs that arise change with time, i.e., they are dynamic in nature. This is especially true of applications involving graph models in computer science. We present an expository study of dynamic graphs with the main driving force being practical applications. We first develop a formal classification of dynamic graphs. This taxonomy in the form of generalizations and extensions will in turn suggest new areas of application. Next, we discuss areas where dynamic graphs arise in computer science such as compilers, databases, fault-tolerance, artificial intelligence, and computer networks. Finally, we propose approaches that can be used for studying dynamic graphs. The main objective in any study of dynamic graphs should be to

• 1.(i) extend results developed for static graph theory to dynamic graphs,
• 2.(ii) study the properties that describe how a dynamic graph changes,
• 3.(iii) investigate problems and issues in dynamic graph theory that are raised by practical applications of dynamic graphs in computer science.

     

Analysis of performance of an iron-bath reactor using computational fluid dynamics

The performance of an iron-bath reactor has been studied using a comprehensive numerical model that combines a computational fluid dynamics approach for the gas phase and a heat and mass balance model for the bath. The model calculates:

• •coal, ore, flux and oxygen consumption;
• •post-combustion ratio (PCR);
• •heat-transfer efficiency (HTE);
• •off-gas temperature and composition;
• •heat transfer and chemical reactions between gas and iron and slag droplets; and
• •heat transfer between gas and bath, refractories and lance.

The model was validated with data reported by the Nippon Steel Corporation for a 100 t pilot plant, and the calculated and measured data are in good agreement. Modelling results showed that the dominant mechanisms of heat transfer from the gas to the bath are radiation to the slag surface and convection heat transfer to droplets.     

A Note on Old Babylonian Computational Techniques

Analysis of the errors in two Old Babylonian “algebraic” problems shows

• •that the computations were performed on a device where additive contributions were no longer identifiable once they had entered the computation;
• •that this device must have been some kind of counting board or abacus where numbers were represented as collections of calculi;
• •that units and tens were represented in distinct ways, perhaps by means of different calculi.

© 2002 Elsevier Science (USA).Eine Analyse der Rechenfehler in zwei altbabylonischen “algebraischen” Aufgaben läßt mehrere Rückschlüsse auf ein Hilfsmittel zu, das zur Durchführung von Rechnungen benutzt worden sein kann:

• •Additive Beiträge waren nach ihrer Eintragung in die Rechnung nicht länger identifizierbar.
• •Das Gerät war eine Art Rechenbrett, auf welchem Zahlen als Haufen von Rechensteinen erschienen.
• •Einer und Zehner wurden in verschiedener Weise, evtl. mittels verschiedener Rechensteine repräsentiert.

© 2002 Elsevier Science (USA).MSC subject classification: 01A17.     

An optimal time to sleep for an auto-sleep system considering multi-usage states

An auto-sleep system is defined by the following two properties:

• 1.(i) a call for the system occurs randomly and intermittently
• 2.(ii) the system automatically goes to sleep if there occurs no call during a prespecified time T.

It considers four states:

• 1.(a) sleep
• 2.(b) warm-up
• 3.(c) nonusage
• 4.(d) usage.

For such a system, the time to sleep has been discussed based on suitable criteria. This study extends the model for an auto-sleep system so that the model can deal with multi-usage states. With a view to determining an optimal time to sleep under the extended model, the expected energy consumed per unit time is formulated as a criterion to be minimized. The existence of an optimal time to sleep is examined under a general call distribution. Numerical examples are also provided for a Weibull as well as a log-normal call distribution.     

Chirurgies d'indice un et isotopies de sphères dans les variétés de contact tendues

We prove the following theorems:

• 1)Any surgery of index one on u tight contact manifold (of dimension three) gives rise to a manifold which carries a natural tight contact structure.
• 2)In a tight contact manifold, any two isotopic spheres which carry the same characteristic foliation are isotopic through a contact isolopy.
• 3)In a tight contact manifold, any two isotopic spheres have isomorphic complements.

     

All Lobsters with Perfect Matchings are Graceful

Given a tree, T, consider one of its longest paths, P_T, not necessarily unique. We define T to be m–distant if no vertices of T are a distance greater than m away from P_T. We will show that all 3–distant graphs are graceful, providing they satisfy the following properties.

• 1.They have perfect matchings.
• 2.They can be constructed by attaching paths of length 2 to the vertices of a 1–distant tree (caterpillar), by the identification of their end vertices.

A consequence of this is that all 2–distant trees (lobsters) having perfect matchings are graceful.     

Maximizing profit of a food retailing chain by targeting and promoting valuable customers using Loyalty Card and Scanner Data

In this paper, we set up a House of Profit Model, an approach of maximizing profit of a food retailing chain by targeting and promoting valuable customers. Our model combines

• •segmentation analysis of households using Loyalty Card and Scanner Data,
• •price and promotion elasticity analysis,
• •simulation of effects of pricing and promotion,
• •price and promotion optimization to maximize profit.

These components are well-known in the literature and each of them has received considerable independent study. However, in this study we combine each of these components into one consistent, application-orientated model. We then demonstrate using panel data that the combination has a synergic effect on the efficiency of estimation and the maximization of profit (e.g., price and promotion elasticity estimation is improved by conducting it within market segments rather than across an entire hetereogeneous population). These estimates are further improved by incorporating “pass through”—a functional relationship between a retailer’s unit prices and unit costs.     

Common knowledge revisited

We consider the common-knowledge paradox raised by Halpern and Moses: common knowledge is necessary for agreement and coordination, but common knowledge is unattainable in the real world because of temporal imprecision. We discuss two solutions to this paradox:

• 1.(1) modeling the world with a coarser granularity, and
• 2.(2) relaxing the requirements for coordination.

     

Softness of hypercoherences and MALL full completeness

We prove a full completeness theorem for multiplicative–additive linear logic (i.e. MALL) using a double gluing construction applied to Ehrhard’s *-autonomous category of hypercoherences. This is the first non-game-theoretic full completeness theorem for this fragment. Our main result is that every dinatural transformation between definable functors arises from the denotation of a cut-free MALL proof.Our proof consists of three steps. We show:

• •Dinatural transformations on this category satisfy Joyal’s softness property for products and coproducts.
• •Softness, together with multiplicative full completeness, guarantees that every dinatural transformation corresponds to a Girard MALL proof-structure.
• •The proof-structure associated with any dinatural transformation is a MALL proof-net, hence a denotation of a proof. This last step involves a detailed study of cycles in additive proof-structures.

The second step is a completely general result, while the third step relies on the concrete structure of a double gluing construction over hypercoherences.     

Multiparametric demand transportation problem

In some applications a minimum cost transportation model arises where supplies are fixed while demands may simultaneously vary. In this paper we analyse the structure of such a model and propose several techniques to describe its behaviour. Our approach is founded on the concept of optimal region, i.e., the subset of demand vectors where a given basic tree is optimal. The proposed algorithm consists in different pivoting strategies designed to:

• 1.build up a minimal list of basic trees such that the associated optimal regions cover the set of feasible demand vectors;
• 2.analyse the effects of either opening a new supplier or closing an existing one;
• 3.suitably treat the dual degenerate case by building up a minimal representation of every maximal region where the optimal value is linear in the demand vector.

Computational complexity is discussed and numerical examples are given.     

Modelling the motion of a three-link manipulator based on a plane with a time-dependent inclination

This work deals with the modelling of a three-link manipulator mounted on a plane with a time-dependent inclination. Two cases are considered.

• (i)The plane is part of a rigid body.
• (ii)The plane is in a moored ship.

     

System dynamics and feedback control problem formulations for real time dynamic traffic routing

This paper formulates the Dynamic Traffic Routing (DTR) problem as a real-time feedback control problem. Three different forms of the formulation are presented:

• 1.(1) distributed parameter system form derived from the conservation law;
• 2.(2) space discretized continuous lumped parameter form;
• 3.(3) space and time discretized lumped parameter form.

These formulations can be considered as the starting points for development of feedback control laws for the different control problems stated in this paper. This paper presents the feedback control problems, and does not discuss in detail the methodology of solution techniques which could be used to solve these problems. However, for the sake of completeness a brief treatment of the three forms are included in this paper to show possible ways to design the controllers.     

Survey of mathematical programming models in air pollution management

This paper surveys the current state of the literature in management science/operations research approaches to air pollution management. After introducing suitable background we provide some of the institutional and legal framework needed to understand the continuing regulatory efforts in United States. Attention is then turned to mathematical programming models ranging from fairly simple deterministic linear programs to quite sophisticated stochastic models which have appeared in the literature dealing with these topics. This is followed by extensions reflecting some of the work we have undertaken in association with the Texas Natural Resource Conservation Commission, a regulatory agency in Texas. Application and potential use of models is the central theme of this survey. Issues for future research are presented at the end and an extensive list of publications is provided in the references at the end of the article.Principal air quality issues of local, national, and international concern are listed below in increasing order of difficulty based on the number of different types of pollutants and problems in quantification of the risks the pollutants pose:

• 1.1. Stratospheric ozone depletion: one relatively easily controllable class of trace gases - ozone depleting chemicals, or ODCs, principally chloroflurocarbons (CFCs) — with relatively well quantified risks;
• 2.2. Criteria pollutants: six common pollutants — ozone (O₃), carbon monoxide (CO), sulfur dioxide (SO₂), nitrogen dioxide (NO₂), lead (Pb), and particulate matter less than 10 microns in size (PM10) — regulated since 1970 in the U.S. and presenting relatively well quantified risks;
• 3.3. Acid precipitation: two relatively easily controllable classes of trace gases — oxides of nitrogen (NO_x) and oxides of sulfur (SO_x) with relatively well quantified risks;
• 4.4. Global warming/climate change: a few difficult to control trace gases — principally carbon dioxide (CO₂), methane (CH₄), nitrous oxide (N₂O), and CFCs — with highly uncertain risks;
• 5.5. Toxics or HAPS (hazardous air pollutants): hundreds of types of gaseous chemicals and particles with uncertain risks;
• 6.6. Somewhat dated, but nevertheless useful, is the following reference: Glossary on Air Pollution (Copenhagen, World Health Organization, 1980).

     

Probabilistic inequalities and remarks

The authors use their recently proved integral inequality to obtain bounds for the covariance of two random variables

• 1.in a general setup and
• 2.for a class of special joint distributions.

The same inequality is also used to estimate the difference of the expectations of two random variables. Finally, the authors study the attainability of a related inequality.     

Stability and boundedness of a kind of third-order delay differential system

The paper studies equation (1.1) in two cases:

• •(i)p ≡ 0,
• •(ii)p ≠ 0.

In Case (i), the asymptotic stability of the solution x = 0 is studied; in Case (ii), the uniform boundedness and uniform ultimate boundedness of all solutions of (1.1) are proved.