There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality.

Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

I and i

The discovery that mammalian cells generate nitric oxide, a gas previously considered to be merely an atmospheric pollutant, is providing important information about many biologic processes. Nitric oxide is synthesized from the amino acid L-arginine by a family of enzymes, the nitric oxide synthases, through a hitherto unrecognized metabolic route -- namely, the L-arginine-nitric oxide pathway1–8. The synthesis of nitric oxide by vascular endothelium is responsible for the vasodilator tone that is essential for the regulation of blood pressure. In the central nervous system nitric oxide is a neurotransmitter that underpins several functions, including the formation of memory. . . .

The L-Arginine-Nitric Oxide Pathway

/pdf/convex-analysisnoer-san-nojin-zhan-nituite-5dl2rbmoyr.pdf

Convex Analysisの二,三の進展について

Our growing dependence on increasingly complex computer and software systems necessitates the development of formalisms, techniques, and tools for assessing functional properties of these systems. One such technique that has emerged in the last twenty years is model checking, which systematically (and automatically) checks whether a model of a given system satisfies a desired property such as deadlock freedom, invariants, and request-response properties. This automated technique for verification and debugging has developed into a mature and widely used approach with many applications. Principles of Model Checking offers a comprehensive introduction to model checking that is not only a text suitable for classroom use but also a valuable reference for researchers and practitioners in the field. The book begins with the basic principles for modeling concurrent and communicating systems, introduces different classes of properties (including safety and liveness), presents the notion of fairness, and provides automata-based algorithms for these properties. It introduces the temporal logics LTL and CTL, compares them, and covers algorithms for verifying these logics, discussing real-time systems as well as systems subject to random phenomena. Separate chapters treat such efficiency-improving techniques as abstraction and symbolic manipulation. The book includes an extensive set of examples (most of which run through several chapters) and a complete set of basic results accompanied by detailed proofs. Each chapter concludes with a summary, bibliographic notes, and an extensive list of exercises of both practical and theoretical nature.

/pdf/principles-of-model-checking-249iimickz.pdf

Principles of Model Checking

ATS/ACCP statement on cardiopulmonary exercise testing.

Introduction: The Classical Decision Problem

We report on our first experiences with an access in video-assisted thoracoscopic surgery (VATS) which to the best of our knowledge has not yet been reported. One of the main problems in VATS is the absence of palpation which evidently plays an important role in tumor surgery. In three cases we therefore performed dorsolateral 8 cm incisions just beneath the scapula and resected a corresponding length on 6th or 7th rib to be able to insert one hand into the thorax. No rib-spreader was used in either case, the idea being that a small costotomy would be less painful and traumatic than a standard posterolateral thoracotomy. Visualization of the operative field was obtained by inserting a camera through the 9th intercostal space, one or two additional small incisions were made for the other instruments.

Costotomy and "hand inside": a useful adjunct to video-assisted thoracic surgery or just a silly idea?

In this paper we extend recent work about logical criteria for approximation properties of optimization problems. We focus on the relationship between logical expressibility and expected asymptotic growth of optimal solutions on random inputs. This further develops a probabilistic approach due to Behrendt, Compton and Gradel showing that expected optimal solutions for any problem in the class Max ⌆1 grows essentially like a polynomial. We show that there is a similar result for MinF+ II1, a syntactic class of minimization problems which provides a logical criterion for approximability. As a consequence, we show that some important problems do not belong to MinF+II1.

Approximable Minimization Problems and Optimal Solutions on Random Inputs

Tailoring Recursing for Complexity

Invited Talks.- Algebra for Tree Languages.- Forcing and Type Theory.- Functional Interpretations of Intuitionistic Linear Logic.- Fixed-Point Definability and Polynomial Time.- Special Invited Talk to Commemorate the Centenary of Stephen Cole Kleene.- Kleene's Amazing Second Recursion Theorem.- Contributed Papers.- Typed Applicative Structures and Normalization by Evaluation for System F ? .- Jumping Boxes.- Tree-Width for First Order Formulae.- Algorithmic Analysis of Array-Accessing Programs.- Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems.- Cardinality Quantifiers in MLO over Trees.- From Coinductive Proofs to Exact Real Arithmetic.- On the Relation between Sized-Types Based Termination and Semantic Labelling.- Expanding the Realm of Systematic Proof Theory.- EXPTIME Tableaux for the Coalgebraic ?-Calculus.- On the Word Problem for -Categories, and the Properties of Two-Way Communication.- Intersection, Universally Quantified, and Reference Types.- Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata.- Enriching an Effect Calculus with Linear Types.- Degrees of Undecidability in Term Rewriting.- Upper Bounds on Stream I/O Using Semantic Interpretations.- Craig Interpolation for Linear Temporal Languages.- On Model Checking Boolean BI.- Efficient Type-Checking for Amortised Heap-Space Analysis.- Deciding the Inductive Validity of ????* Queries.- On the Parameterised Intractability of Monadic Second-Order Logic.- Automatic Structures of Bounded Degree Revisited.- Nondeterminism and Observable Sequentiality.- A Decidable Spatial Logic with Cone-Shaped Cardinal Directions.- Focalisation and Classical Realisability.- Decidable Extensions of Church's Problem.- Nested Hoare Triples and Frame Rules for Higher-Order Store.- A Complete Characterization of Observational Equivalence in Polymorphic ?-Calculus with General References.- Non-Commutative First-Order Sequent Calculus.- Model Checking FO(R) over One-Counter Processes and beyond.- Confluence of Pure Differential Nets with Promotion.- Decision Problems for Nash Equilibria in Stochastic Games.- On the Complexity of Branching-Time Logics.- Nominal Domain Theory for Concurrency.- The Ackermann Award 2009.

/pdf/computer-science-logic-41t2wdyow2.pdf

Erich Grädel

Papers

Introduction: The Classical Decision Problem

Costotomy and "hand inside": a useful adjunct to video-assisted thoracic surgery or just a silly idea?

Approximable Minimization Problems and Optimal Solutions on Random Inputs

Tailoring Recursing for Complexity

Computer Science Logic