Stable sequential Kuhn-Tucker theorem in iterative form or a regularized Uzawa algorithm in a regular nonlinear programming problem

NASA Astrophysics Data System (ADS)

Sumin, M. I.

2015-06-01

A parametric nonlinear programming problem in a metric space with an operator equality constraint in a Hilbert space is studied assuming that its lower semicontinuous value function at a chosen individual parameter value has certain subdifferentiability properties in the sense of nonlinear (nonsmooth) analysis. Such subdifferentiability can be understood as the existence of a proximal subgradient or a Fréchet subdifferential. In other words, an individual problem has a corresponding generalized Kuhn-Tucker vector. Under this assumption, a stable sequential Kuhn-Tucker theorem in nondifferential iterative form is proved and discussed in terms of minimizing sequences on the basis of the dual regularization method. This theorem provides necessary and sufficient conditions for the stable construction of a minimizing approximate solution in the sense of Warga in the considered problem, whose initial data can be approximately specified. A substantial difference of the proved theorem from its classical same-named analogue is that the former takes into account the possible instability of the problem in the case of perturbed initial data and, as a consequence, allows for the inherited instability of classical optimality conditions. This theorem can be treated as a regularized generalization of the classical Uzawa algorithm to nonlinear programming problems. Finally, the theorem is applied to the "simplest" nonlinear optimal control problem, namely, to a time-optimal control problem.

Reasoning by analogy as an aid to heuristic theorem proving.

NASA Technical Reports Server (NTRS)

Kling, R. E.

1972-01-01

When heuristic problem-solving programs are faced with large data bases that contain numbers of facts far in excess of those needed to solve any particular problem, their performance rapidly deteriorates. In this paper, the correspondence between a new unsolved problem and a previously solved analogous problem is computed and invoked to tailor large data bases to manageable sizes. This paper outlines the design of an algorithm for generating and exploiting analogies between theorems posed to a resolution-logic system. These algorithms are believed to be the first computationally feasible development of reasoning by analogy to be applied to heuristic theorem proving.

Research in advanced formal theorem-proving techniques. [design and implementation of computer languages

NASA Technical Reports Server (NTRS)

Raphael, B.; Fikes, R.; Waldinger, R.

1973-01-01

The results are summarised of a project aimed at the design and implementation of computer languages to aid in expressing problem solving procedures in several areas of artificial intelligence including automatic programming, theorem proving, and robot planning. The principal results of the project were the design and implementation of two complete systems, QA4 and QLISP, and their preliminary experimental use. The various applications of both QA4 and QLISP are given.

Decision-making and problem-solving methods in automation technology

NASA Technical Reports Server (NTRS)

Hankins, W. W.; Pennington, J. E.; Barker, L. K.

1983-01-01

The state of the art in the automation of decision making and problem solving is reviewed. The information upon which the report is based was derived from literature searches, visits to university and government laboratories performing basic research in the area, and a 1980 Langley Research Center sponsored conferences on the subject. It is the contention of the authors that the technology in this area is being generated by research primarily in the three disciplines of Artificial Intelligence, Control Theory, and Operations Research. Under the assumption that the state of the art in decision making and problem solving is reflected in the problems being solved, specific problems and methods of their solution are often discussed to elucidate particular aspects of the subject. Synopses of the following major topic areas comprise most of the report: (1) detection and recognition; (2) planning; and scheduling; (3) learning; (4) theorem proving; (5) distributed systems; (6) knowledge bases; (7) search; (8) heuristics; and (9) evolutionary programming.

Existence and discrete approximation for optimization problems governed by fractional differential equations

NASA Astrophysics Data System (ADS)

Bai, Yunru; Baleanu, Dumitru; Wu, Guo-Cheng

2018-06-01

We investigate a class of generalized differential optimization problems driven by the Caputo derivative. Existence of weak Carathe ´odory solution is proved by using Weierstrass existence theorem, fixed point theorem and Filippov implicit function lemma etc. Then a numerical approximation algorithm is introduced, and a convergence theorem is established. Finally, a nonlinear programming problem constrained by the fractional differential equation is illustrated and the results verify the validity of the algorithm.

Adaptive Probabilistic Protocols for Advanced Networks/Assuring the Integrity of Highly Decentralized Communications Systems

DTIC Science & Technology

2005-03-01

to obtain a protocol customized to the needs of a specific setting, under control of an automated theorem proving system that can guarantee...new “compositional” method for protocol design and implementation, in which small microprotocols are combined to obtain a protocol customized to the...and Network Centric Enterprise (NCES) visions. This final report documents a wide range of contributions and technology transitions, including: A

Optimal no-go theorem on hidden-variable predictions of effect expectations

NASA Astrophysics Data System (ADS)

Blass, Andreas; Gurevich, Yuri

2018-03-01

No-go theorems prove that, under reasonable assumptions, classical hidden-variable theories cannot reproduce the predictions of quantum mechanics. Traditional no-go theorems proved that hidden-variable theories cannot predict correctly the values of observables. Recent expectation no-go theorems prove that hidden-variable theories cannot predict the expectations of observables. We prove the strongest expectation-focused no-go theorem to date. It is optimal in the sense that the natural weakenings of the assumptions and the natural strengthenings of the conclusion make the theorem fail. The literature on expectation no-go theorems strongly suggests that the expectation-focused approach is more general than the value-focused one. We establish that the expectation approach is not more general.

Riemannian and Lorentzian flow-cut theorems

NASA Astrophysics Data System (ADS)

Headrick, Matthew; Hubeny, Veronika E.

2018-05-01

We prove several geometric theorems using tools from the theory of convex optimization. In the Riemannian setting, we prove the max flow-min cut (MFMC) theorem for boundary regions, applied recently to develop a ‘bit-thread’ interpretation of holographic entanglement entropies. We also prove various properties of the max flow and min cut, including respective nesting properties. In the Lorentzian setting, we prove the analogous MFMC theorem, which states that the volume of a maximal slice equals the flux of a minimal flow, where a flow is defined as a divergenceless timelike vector field with norm at least 1. This theorem includes as a special case a continuum version of Dilworth’s theorem from the theory of partially ordered sets. We include a brief review of the necessary tools from the theory of convex optimization, in particular Lagrangian duality and convex relaxation.

A Minimum Path Algorithm Among 3D-Polyhedral Objects

NASA Astrophysics Data System (ADS)

Yeltekin, Aysin

1989-03-01

In this work we introduce a minimum path theorem for 3D case. We also develop an algorithm based on the theorem we prove. The algorithm will be implemented on the software package we develop using C language. The theorem we introduce states that; "Given the initial point I, final point F and S be the set of finite number of static obstacles then an optimal path P from I to F, such that PA S = 0 is composed of straight line segments which are perpendicular to the edge segments of the objects." We prove the theorem as well as we develop the following algorithm depending on the theorem to find the minimum path among 3D-polyhedral objects. The algorithm generates the point Qi on edge ei such that at Qi one can find the line which is perpendicular to the edge and the IF line. The algorithm iteratively provides a new set of initial points from Qi and exploits all possible paths. Then the algorithm chooses the minimum path among the possible ones. The flowchart of the program as well as the examination of its numerical properties are included.

An Integrated Environment for Efficient Formal Design and Verification

NASA Technical Reports Server (NTRS)

1998-01-01

The general goal of this project was to improve the practicality of formal methods by combining techniques from model checking and theorem proving. At the time the project was proposed, the model checking and theorem proving communities were applying different tools to similar problems, but there was not much cross-fertilization. This project involved a group from SRI that had substantial experience in the development and application of theorem-proving technology, and a group at Stanford that specialized in model checking techniques. Now, over five years after the proposal was submitted, there are many research groups working on combining theorem-proving and model checking techniques, and much more communication between the model checking and theorem proving research communities. This project contributed significantly to this research trend. The research work under this project covered a variety of topics: new theory and algorithms; prototype tools; verification methodology; and applications to problems in particular domains.

Generalized quantum no-go theorems of pure states

NASA Astrophysics Data System (ADS)

Li, Hui-Ran; Luo, Ming-Xing; Lai, Hong

2018-07-01

Various results of the no-cloning theorem, no-deleting theorem and no-superposing theorem in quantum mechanics have been proved using the superposition principle and the linearity of quantum operations. In this paper, we investigate general transformations forbidden by quantum mechanics in order to unify these theorems. First, we prove that any useful information cannot be created from an unknown pure state which is randomly chosen from a Hilbert space according to the Harr measure. And then, we propose a unified no-go theorem based on a generalized no-superposing result. The new theorem includes the no-cloning theorem, no-anticloning theorem, no-partial-erasure theorem, no-splitting theorem, no-superposing theorem or no-encoding theorem as a special case. Moreover, it implies various new results. Third, we extend the new theorem into another form that includes the no-deleting theorem as a special case.

Abel's theorem in the noncommutative case

NASA Astrophysics Data System (ADS)

Leitenberger, Frank

2004-03-01

We define noncommutative binary forms. Using the typical representation of Hermite we prove the fundamental theorem of algebra and we derive a noncommutative Cardano formula for cubic forms. We define quantized elliptic and hyperelliptic differentials of the first kind. Following Abel we prove Abel's theorem.

Slowly changing potential problems in Quantum Mechanics: Adiabatic theorems, ergodic theorems, and scattering

DOE Office of Scientific and Technical Information (OSTI.GOV)

Fishman, S., E-mail: fishman@physics.technion.ac.il; Soffer, A., E-mail: soffer@math.rutgers.edu

2016-07-15

We employ the recently developed multi-time scale averaging method to study the large time behavior of slowly changing (in time) Hamiltonians. We treat some known cases in a new way, such as the Zener problem, and we give another proof of the adiabatic theorem in the gapless case. We prove a new uniform ergodic theorem for slowly changing unitary operators. This theorem is then used to derive the adiabatic theorem, do the scattering theory for such Hamiltonians, and prove some classical propagation estimates and asymptotic completeness.

On Mathematical Proving

NASA Astrophysics Data System (ADS)

Stefaneas, Petros; Vandoulakis, Ioannis M.

2015-12-01

This paper outlines a logical representation of certain aspects of the process of mathematical proving that are important from the point of view of Artificial Intelligence. Our starting-point is the concept of proof-event or proving, introduced by Goguen, instead of the traditional concept of mathematical proof. The reason behind this choice is that in contrast to the traditional static concept of mathematical proof, proof-events are understood as processes, which enables their use in Artificial Intelligence in such contexts, in which problem-solving procedures and strategies are studied. We represent proof-events as problem-centered spatio-temporal processes by means of the language of the calculus of events, which captures adequately certain temporal aspects of proof-events (i.e. that they have history and form sequences of proof-events evolving in time). Further, we suggest a "loose" semantics for the proof-events, by means of Kolmogorov's calculus of problems. Finally, we expose the intented interpretations for our logical model from the fields of automated theorem-proving and Web-based collective proving.

Deductive Synthesis of the Unification Algorithm,

DTIC Science & Technology

1981-06-01

DEDUCTIVE SYNTHESIS OF THE I - UNIFICATION ALGORITHM Zohar Manna Richard Waldinger I F? Computer Science Department Artificial Intelligence Center...theorem proving," Artificial Intelligence Journal, Vol. 9, No. 1, pp. 1-35. Boyer, R. S. and J S. Moore [Jan. 19751, "Proving theorems about LISP...d’Intelligence Artificielle , U.E.R. de Luminy, Universit6 d’ Aix-Marseille II. Green, C. C. [May 1969], "Application of theorem proving to problem

Formal Modeling and Analysis of a Preliminary Small Aircraft Transportation System (SATS)Concept

NASA Technical Reports Server (NTRS)

Carrreno, Victor A.; Gottliebsen, Hanne; Butler, Ricky; Kalvala, Sara

2004-01-01

New concepts for automating air traffic management functions at small non-towered airports raise serious safety issues associated with the software implementations and their underlying key algorithms. The criticality of such software systems necessitates that strong guarantees of the safety be developed for them. In this paper we present a formal method for modeling and verifying such systems using the PVS theorem proving system. The method is demonstrated on a preliminary concept of operation for the Small Aircraft Transportation System (SATS) project at NASA Langley.

[ ] or SUCCESS is Not Enough: Current Technology and Future Directions in Proof Presentation

NASA Technical Reports Server (NTRS)

Schumann, Johann; Robinson, Peter; Clancy, Daniel (Technical Monitor)

2001-01-01

Automated theorem provers for first order logic are now around for several decades. Over the last few years, their deductive power to solve hard problems has increased tremendously. The annual CASC system competitions [Se97] give a clear picture of this situation. However, today's automated theorem provers are restricted "more by general usability than by raw deductive power." As a result of this, there are only very few serious applications of automated theorem provers. There are numerous features which a theorem prover lacks for real-world applicability. An automated theorem prover (as it is currently seen) is nothing more than a fast and elaborate search procedure. In that sense, an ATP can compared to a formulated race car, cool and fast, but virtually unusable for shopping groceries around the corner. Many important features are missing, or are optimized for speed rather than for applicability. [Schol] identifies important features which are needed for practical usability like detection of non-theorems, handling of modal/inductive proof tasks, control of the prover, and proof output. In this paper, we will focus solely on the last point, the presentation of the ATP's result to the user. In the rest of this paper, we will first discuss the general importance of providing feedback to the user, then we will describe the system ExplainIt!, a part of the deductive synthesis system AMPHION/NAV. In the conclusions we will relate proof presentation to other ways of post-processing a proof found by an ATP and stress their role in the future of automated deduction.

Decision Engines for Software Analysis Using Satisfiability Modulo Theories Solvers

NASA Technical Reports Server (NTRS)

Bjorner, Nikolaj

2010-01-01

The area of software analysis, testing and verification is now undergoing a revolution thanks to the use of automated and scalable support for logical methods. A well-recognized premise is that at the core of software analysis engines is invariably a component using logical formulas for describing states and transformations between system states. The process of using this information for discovering and checking program properties (including such important properties as safety and security) amounts to automatic theorem proving. In particular, theorem provers that directly support common software constructs offer a compelling basis. Such provers are commonly called satisfiability modulo theories (SMT) solvers. Z3 is a state-of-the-art SMT solver. It is developed at Microsoft Research. It can be used to check the satisfiability of logical formulas over one or more theories such as arithmetic, bit-vectors, lists, records and arrays. The talk describes some of the technology behind modern SMT solvers, including the solver Z3. Z3 is currently mainly targeted at solving problems that arise in software analysis and verification. It has been applied to various contexts, such as systems for dynamic symbolic simulation (Pex, SAGE, Vigilante), for program verification and extended static checking (Spec#/Boggie, VCC, HAVOC), for software model checking (Yogi, SLAM), model-based design (FORMULA), security protocol code (F7), program run-time analysis and invariant generation (VS3). We will describe how it integrates support for a variety of theories that arise naturally in the context of the applications. There are several new promising avenues and the talk will touch on some of these and the challenges related to SMT solvers. Proceedings

Deductive Evaluation: Formal Code Analysis With Low User Burden

NASA Technical Reports Server (NTRS)

Di Vito, Ben. L

2016-01-01

We describe a framework for symbolically evaluating iterative C code using a deductive approach that automatically discovers and proves program properties. Although verification is not performed, the method can infer detailed program behavior. Software engineering work flows could be enhanced by this type of analysis. Floyd-Hoare verification principles are applied to synthesize loop invariants, using a library of iteration-specific deductive knowledge. When needed, theorem proving is interleaved with evaluation and performed on the fly. Evaluation results take the form of inferred expressions and type constraints for values of program variables. An implementation using PVS (Prototype Verification System) is presented along with results for sample C functions.

Some functional limit theorems for compound Cox processes

NASA Astrophysics Data System (ADS)

Korolev, Victor Yu.; Chertok, A. V.; Korchagin, A. Yu.; Kossova, E. V.; Zeifman, Alexander I.

2016-06-01

An improved version of the functional limit theorem is proved establishing weak convergence of random walks generated by compound doubly stochastic Poisson processes (compound Cox processes) to Lévy processes in the Skorokhod space under more realistic moment conditions. As corollaries, theorems are proved on convergence of random walks with jumps having finite variances to Lévy processes with variance-mean mixed normal distributions, in particular, to stable Lévy processes.

Some functional limit theorems for compound Cox processes

DOE Office of Scientific and Technical Information (OSTI.GOV)

Korolev, Victor Yu.; Institute of Informatics Problems FRC CSC RAS; Chertok, A. V.

2016-06-08

An improved version of the functional limit theorem is proved establishing weak convergence of random walks generated by compound doubly stochastic Poisson processes (compound Cox processes) to Lévy processes in the Skorokhod space under more realistic moment conditions. As corollaries, theorems are proved on convergence of random walks with jumps having finite variances to Lévy processes with variance-mean mixed normal distributions, in particular, to stable Lévy processes.

AfterMath: the work of proof in the age of human-machine collaboration.

PubMed

Dick, Stephanie

2011-09-01

During the 1970s and 1980s, a team of Automated Theorem Proving researchers at the Argonne National Laboratory near Chicago developed the Automated Reasoning Assistant, or AURA, to assist human users in the search for mathematical proofs. The resulting hybrid humans+AURA system developed the capacity to make novel contributions to pure mathematics by very untraditional means. This essay traces how these unconventional contributions were made and made possible through negotiations between the humans and the AURA at Argonne and the transformation in mathematical intuition they produced. At play in these negotiations were experimental practices, nonhumans, and nonmathematical modes of knowing. This story invites an earnest engagement between historians of mathematics and scholars in the history of science and science studies interested in experimental practice, material culture, and the roles of nonhumans in knowledge making.

Using Pictures to Enhance Students' Understanding of Bayes' Theorem

ERIC Educational Resources Information Center

Trafimow, David

2011-01-01

Students often have difficulty understanding algebraic proofs of statistics theorems. However, it sometimes is possible to prove statistical theorems with pictures in which case students can gain understanding more easily. I provide examples for two versions of Bayes' theorem.

Combining Automated Theorem Provers with Symbolic Algebraic Systems: Position Paper

NASA Technical Reports Server (NTRS)

Schumann, Johann; Koga, Dennis (Technical Monitor)

1999-01-01

In contrast to pure mathematical applications where automated theorem provers (ATPs) are quite capable, proof tasks arising form real-world applications from the area of Software Engineering show quite different characteristics: they usually do not only contain much arithmetic (albeit often quite simple one), but they also often contain reasoning about specific structures (e.g. graphics, sets). Thus, an ATP must be capable of performing reasoning together with a fair amount of simplification, calculation and solving. Therefore, powerful simplifiers and other (symbolic and semi-symbolic) algorithms seem to be ideally suited to augment ATPs. In the following we shortly describe two major points of interest in combining SASs (symbolic algebraic systems) with top-down automated theorem provers (here: SETHEO [Let92, GLMS94]).

Logical errors on proving theorem

NASA Astrophysics Data System (ADS)

Sari, C. K.; Waluyo, M.; Ainur, C. M.; Darmaningsih, E. N.

2018-01-01

In tertiary level, students of mathematics education department attend some abstract courses, such as Introduction to Real Analysis which needs an ability to prove mathematical statements almost all the time. In fact, many students have not mastered this ability appropriately. In their Introduction to Real Analysis tests, even though they completed their proof of theorems, they achieved an unsatisfactory score. They thought that they succeeded, but their proof was not valid. In this study, a qualitative research was conducted to describe logical errors that students made in proving the theorem of cluster point. The theorem was given to 54 students. Misconceptions on understanding the definitions seem to occur within cluster point, limit of function, and limit of sequences. The habit of using routine symbol might cause these misconceptions. Suggestions to deal with this condition are described as well.

The geometric Mean Value Theorem

NASA Astrophysics Data System (ADS)

de Camargo, André Pierro

2018-05-01

In a previous article published in the American Mathematical Monthly, Tucker (Amer Math Monthly. 1997; 104(3): 231-240) made severe criticism on the Mean Value Theorem and, unfortunately, the majority of calculus textbooks also do not help to improve its reputation. The standard argument for proving it seems to be applying Rolle's theorem to a function like Although short and effective, such reasoning is not intuitive. Perhaps for this reason, Tucker classified the Mean Value Theorem as a technical existence theorem used to prove intuitively obvious statements. Moreover, he argued that there is nothing obvious about the Mean Value Theorem without the continuity of the derivative. Under so unfair discrimination, we felt the need to come to the defense of this beautiful theorem in order to clear up these misunderstandings.

Cooperation Among Theorem Provers

NASA Technical Reports Server (NTRS)

Waldinger, Richard J.

1998-01-01

This is a final report, which supports NASA's PECSEE (Persistent Cognizant Software Engineering Environment) effort and complements the Kestrel Institute project "Inference System Integration via Logic Morphism". The ultimate purpose of the project is to develop a superior logical inference mechanism by combining the diverse abilities of multiple cooperating theorem provers. In many years of research, a number of powerful theorem-proving systems have arisen with differing capabilities and strengths. Resolution theorem provers (such as Kestrel's KITP or SRI's, SNARK) deal with first-order logic with equality but not the principle of mathematical induction. The Boyer-Moore theorem prover excels at proof by induction but cannot deal with full first-order logic. Both are highly automated but cannot accept user guidance easily. The PVS system (from SRI) in only automatic within decidable theories, but it has well-designed interactive capabilities: furthermore, it includes higher-order logic, not just first-order logic. The NuPRL system from Cornell University and the STeP system from Stanford University have facilities for constructive logic and temporal logic, respectively - both are interactive. It is often suggested - for example, in the anonymous "QED Manifesto"-that we should pool the resources of all these theorem provers into a single system, so that the strengths of one can compensate for the weaknesses of others, and so that effort will not be duplicated. However, there is no straightforward way of doing this, because each system relies on its own language and logic for its success. Thus. SNARK uses ordinary first-order logic with equality, PVS uses higher-order logic. and NuPRL uses constructive logic. The purpose of this project, and the companion project at Kestrel, has been to use the category-theoretic notion of logic morphism to combine systems with different logics and languages. Kestrel's SPECWARE system has been the vehicle for the implementation.

Deductive Evaluation: Implicit Code Verification With Low User Burden

NASA Technical Reports Server (NTRS)

Di Vito, Ben L.

2016-01-01

We describe a framework for symbolically evaluating C code using a deductive approach that discovers and proves program properties. The framework applies Floyd-Hoare verification principles in its treatment of loops, with a library of iteration schemes serving to derive loop invariants. During evaluation, theorem proving is performed on-the-fly, obviating the generation of verification conditions normally needed to establish loop properties. A PVS-based prototype is presented along with results for sample C functions.

Unified quantum no-go theorems and transforming of quantum pure states in a restricted set

NASA Astrophysics Data System (ADS)

Luo, Ming-Xing; Li, Hui-Ran; Lai, Hong; Wang, Xiaojun

2017-12-01

The linear superposition principle in quantum mechanics is essential for several no-go theorems such as the no-cloning theorem, the no-deleting theorem and the no-superposing theorem. In this paper, we investigate general quantum transformations forbidden or permitted by the superposition principle for various goals. First, we prove a no-encoding theorem that forbids linearly superposing of an unknown pure state and a fixed pure state in Hilbert space of a finite dimension. The new theorem is further extended for multiple copies of an unknown state as input states. These generalized results of the no-encoding theorem include the no-cloning theorem, the no-deleting theorem and the no-superposing theorem as special cases. Second, we provide a unified scheme for presenting perfect and imperfect quantum tasks (cloning and deleting) in a one-shot manner. This scheme may lead to fruitful results that are completely characterized with the linear independence of the representative vectors of input pure states. The upper bounds of the efficiency are also proved. Third, we generalize a recent superposing scheme of unknown states with a fixed overlap into new schemes when multiple copies of an unknown state are as input states.

Theorem Proving In Higher Order Logics

NASA Technical Reports Server (NTRS)

Carreno, Victor A. (Editor); Munoz, Cesar A.; Tahar, Sofiene

2002-01-01

The TPHOLs International Conference serves as a venue for the presentation of work in theorem proving in higher-order logics and related areas in deduction, formal specification, software and hardware verification, and other applications. Fourteen papers were submitted to Track B (Work in Progress), which are included in this volume. Authors of Track B papers gave short introductory talks that were followed by an open poster session. The FCM 2002 Workshop aimed to bring together researchers working on the formalisation of continuous mathematics in theorem proving systems with those needing such libraries for their applications. Many of the major higher order theorem proving systems now have a formalisation of the real numbers and various levels of real analysis support. This work is of interest in a number of application areas, such as formal methods development for hardware and software application and computer supported mathematics. The FCM 2002 consisted of three papers, presented by their authors at the workshop venue, and one invited talk.

Summer Research Program (1992). High School Apprenticeship Program (HSAP) Reports. Volume 14. Rome Laboratory.

DTIC Science & Technology

1992-12-28

analysis. Marvin Minsky , carefully applying mathematical techniques, developed rigo.,ous theorems regarding netwcrk operation. His research led to the...electrical circuits but was later convened to computer simulation, which is still commonly used today. Early success by - Marvirn Minsky , Frank...publication of the book Perceptrons ( Minsky and Papert 1969), in which he and Seymore Papert proved that the single-layer networks then in use were

A Benes-like theorem for the shuffle-exchange graph

NASA Technical Reports Server (NTRS)

Schwabe, Eric J.

1992-01-01

One of the first theorems on permutation routing, proved by V. E. Beness (1965), shows that given a set of source-destination pairs in an N-node butterfly network with at most a constant number of sources or destinations in each column of the butterfly, there exists a set of paths of lengths O(log N) connecting each pair such that the total congestion is constant. An analogous theorem yielding constant-congestion paths for off-line routing in the shuffle-exchange graph is proved here. The necklaces of the shuffle-exchange graph play the same structural role as the columns of the butterfly in Beness' theorem.

The Formal Semantics of PVS

NASA Technical Reports Server (NTRS)

Owre, Sam; Shankar, Natarajan

1999-01-01

A specification language is a medium for expressing what is computed rather than how it is computed. Specification languages share some features with programming languages but are also different in several important ways. For our purpose, a specification language is a logic within which the behavior of computational systems can be formalized. Although a specification can be used to simulate the behavior of such systems, we mainly use specifications to state and prove system properties with mechanical assistance. We present the formal semantics of the specification language of SRI's Prototype Verification System (PVS). This specification language is based on the simply typed lambda calculus. The novelty in PVS is that it contains very expressive language features whose static analysis (e.g., typechecking) requires the assistance of a theorem prover. The formal semantics illuminates several of the design considerations underlying PVS, the interaction between theorem proving and typechecking.

Hiproofs

NASA Technical Reports Server (NTRS)

Denney, Ewen; Power, John

2003-01-01

We introduce a hierarchical notion of formal proof, useful in the implementation of theorem provers, which we call highproofs. Two alternative definitions are given, motivated by existing notations used in theorem proving research. We define transformations between these two forms of hiproof, develop notions of underlying proof, and give a suitable definition of refinement in order to model incremental proof development. We show that our transformations preserve both underlying proofs and refinement. The relationship of our theory to existing theorem proving systems is discussed, as is its future extension.

A note on generalized Weyl's theorem

NASA Astrophysics Data System (ADS)

Zguitti, H.

2006-04-01

We prove that if either T or T* has the single-valued extension property, then the spectral mapping theorem holds for B-Weyl spectrum. If, moreover T is isoloid, and generalized Weyl's theorem holds for T, then generalized Weyl's theorem holds for f(T) for every . An application is given for algebraically paranormal operators.

Strong converse theorems using Rényi entropies

NASA Astrophysics Data System (ADS)

Leditzky, Felix; Wilde, Mark M.; Datta, Nilanjana

2016-08-01

We use a Rényi entropy method to prove strong converse theorems for certain information-theoretic tasks which involve local operations and quantum (or classical) communication between two parties. These include state redistribution, coherent state merging, quantum state splitting, measurement compression with quantum side information, randomness extraction against quantum side information, and data compression with quantum side information. The method we employ in proving these results extends ideas developed by Sharma [preprint arXiv:1404.5940 [quant-ph] (2014)], which he used to give a new proof of the strong converse theorem for state merging. For state redistribution, we prove the strong converse property for the boundary of the entire achievable rate region in the (e, q)-plane, where e and q denote the entanglement cost and quantum communication cost, respectively. In the case of measurement compression with quantum side information, we prove a strong converse theorem for the classical communication cost, which is a new result extending the previously known weak converse. For the remaining tasks, we provide new proofs for strong converse theorems previously established using smooth entropies. For each task, we obtain the strong converse theorem from explicit bounds on the figure of merit of the task in terms of a Rényi generalization of the optimal rate. Hence, we identify candidates for the strong converse exponents for each task discussed in this paper. To prove our results, we establish various new entropic inequalities, which might be of independent interest. These involve conditional entropies and mutual information derived from the sandwiched Rényi divergence. In particular, we obtain novel bounds relating these quantities, as well as the Rényi conditional mutual information, to the fidelity of two quantum states.

Strong converse theorems using Rényi entropies

DOE Office of Scientific and Technical Information (OSTI.GOV)

Leditzky, Felix; Datta, Nilanjana; Wilde, Mark M.

We use a Rényi entropy method to prove strong converse theorems for certain information-theoretic tasks which involve local operations and quantum (or classical) communication between two parties. These include state redistribution, coherent state merging, quantum state splitting, measurement compression with quantum side information, randomness extraction against quantum side information, and data compression with quantum side information. The method we employ in proving these results extends ideas developed by Sharma [preprint http://arxiv.org/abs/1404.5940 [quant-ph] (2014)], which he used to give a new proof of the strong converse theorem for state merging. For state redistribution, we prove the strong converse property for themore » boundary of the entire achievable rate region in the (e, q)-plane, where e and q denote the entanglement cost and quantum communication cost, respectively. In the case of measurement compression with quantum side information, we prove a strong converse theorem for the classical communication cost, which is a new result extending the previously known weak converse. For the remaining tasks, we provide new proofs for strong converse theorems previously established using smooth entropies. For each task, we obtain the strong converse theorem from explicit bounds on the figure of merit of the task in terms of a Rényi generalization of the optimal rate. Hence, we identify candidates for the strong converse exponents for each task discussed in this paper. To prove our results, we establish various new entropic inequalities, which might be of independent interest. These involve conditional entropies and mutual information derived from the sandwiched Rényi divergence. In particular, we obtain novel bounds relating these quantities, as well as the Rényi conditional mutual information, to the fidelity of two quantum states.« less

Heuristic analogy in Ars Conjectandi: From Archimedes' De Circuli Dimensione to Bernoulli's theorem.

PubMed

Campos, Daniel G

2018-02-01

This article investigates the way in which Jacob Bernoulli proved the main mathematical theorem that undergirds his art of conjecturing-the theorem that founded, historically, the field of mathematical probability. It aims to contribute a perspective into the question of problem-solving methods in mathematics while also contributing to the comprehension of the historical development of mathematical probability. It argues that Bernoulli proved his theorem by a process of mathematical experimentation in which the central heuristic strategy was analogy. In this context, the analogy functioned as an experimental hypothesis. The article expounds, first, Bernoulli's reasoning for proving his theorem, describing it as a process of experimentation in which hypothesis-making is crucial. Next, it investigates the analogy between his reasoning and Archimedes' approximation of the value of π, by clarifying both Archimedes' own experimental approach to the said approximation and its heuristic influence on Bernoulli's problem-solving strategy. The discussion includes some general considerations about analogy as a heuristic technique to make experimental hypotheses in mathematics. Copyright © 2018 Elsevier Ltd. All rights reserved.

The Application of Mechanics to Geometry. Popular Lectures in Mathematics.

ERIC Educational Resources Information Center

Kogan, B. Yu

Presented in this translation are three chapters. Chapter I discusses the composition of forces and several theorems of geometry are proved using the fundamental concepts and certain laws of statics. Chapter II discusses the perpetual motion postulate; several geometric theorems are proved using the postulate that perpetual motion is impossible.…

A Dilemma That Underlies an Existence Proof in Geometry

ERIC Educational Resources Information Center

Samper, Carmen; Perry, Patricia; Camargo, Leonor; Sáenz-Ludlow, Adalira; Molina, Óscar

2016-01-01

Proving an existence theorem is less intuitive than proving other theorems. This article presents a semiotic analysis of significant fragments of classroom meaning-making which took place during the class-session in which the existence of the midpoint of a line-segment was proven. The purpose of the analysis is twofold. First follow the evolution…

Developing Formal Correctness Properties from Natural Language Requirements

NASA Technical Reports Server (NTRS)

Nikora, Allen P.

2006-01-01

This viewgraph presentation reviews the rationale of the program to transform natural language specifications into formal notation.Specifically, automate generation of Linear Temporal Logic (LTL)correctness properties from natural language temporal specifications. There are several reasons for this approach (1) Model-based techniques becoming more widely accepted, (2) Analytical verification techniques (e.g., model checking, theorem proving) significantly more effective at detecting types of specification design errors (e.g., race conditions, deadlock) than manual inspection, (3) Many requirements still written in natural language, which results in a high learning curve for specification languages, associated tools and increased schedule and budget pressure on projects reduce training opportunities for engineers, and (4) Formulation of correctness properties for system models can be a difficult problem. This has relevance to NASA in that it would simplify development of formal correctness properties, lead to more widespread use of model-based specification, design techniques, assist in earlier identification of defects and reduce residual defect content for space mission software systems. The presentation also discusses: potential applications, accomplishments and/or technological transfer potential and the next steps.

From Einstein's theorem to Bell's theorem: a history of quantum non-locality

NASA Astrophysics Data System (ADS)

Wiseman, H. M.

2006-04-01

In this Einstein Year of Physics it seems appropriate to look at an important aspect of Einstein's work that is often down-played: his contribution to the debate on the interpretation of quantum mechanics. Contrary to physics ‘folklore’, Bohr had no defence against Einstein's 1935 attack (the EPR paper) on the claimed completeness of orthodox quantum mechanics. I suggest that Einstein's argument, as stated most clearly in 1946, could justly be called Einstein's reality locality completeness theorem, since it proves that one of these three must be false. Einstein's instinct was that completeness of orthodox quantum mechanics was the falsehood, but he failed in his quest to find a more complete theory that respected reality and locality. Einstein's theorem, and possibly Einstein's failure, inspired John Bell in 1964 to prove his reality locality theorem. This strengthened Einstein's theorem (but showed the futility of his quest) by demonstrating that either reality or locality is a falsehood. This revealed the full non-locality of the quantum world for the first time.

A new blackhole theorem and its applications to cosmology and astrophysics

NASA Astrophysics Data System (ADS)

Wang, Shouhong; Ma, Tian

2015-04-01

We shall present a blackhole theorem and a theorem on the structure of our Universe, proved in a recently published paper, based on 1) the Einstein general theory of relativity, and 2) the cosmological principle that the universe is homogeneous and isotropic. These two theorems are rigorously proved using astrophysical dynamical models coupling fluid dynamics and general relativity based on a symmetry-breaking principle. With the new blackhole theorem, we further demonstrate that both supernovae explosion and AGN jets, as well as many astronomical phenomena including e.g. the recent reported are due to combined relativistic, magnetic and thermal effects. The radial temperature gradient causes vertical Benard type convection cells, and the relativistic viscous force (via electromagnetic, the weak and the strong interactions) gives rise to a huge explosive radial force near the Schwarzschild radius, leading e.g. to supernovae explosion and AGN jets.

Recurrence theorems: A unified account

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wallace, David, E-mail: david.wallace@balliol.ox.ac.uk

I discuss classical and quantum recurrence theorems in a unified manner, treating both as generalisations of the fact that a system with a finite state space only has so many places to go. Along the way, I prove versions of the recurrence theorem applicable to dynamics on linear and metric spaces and make some comments about applications of the classical recurrence theorem in the foundations of statistical mechanics.

Computer Algebra Systems and Theorems on Real Roots of Polynomials

ERIC Educational Resources Information Center

Aidoo, Anthony Y.; Manthey, Joseph L.; Ward, Kim Y.

2010-01-01

A computer algebra system is used to derive a theorem on the existence of roots of a quadratic equation on any bounded real interval. This is extended to a cubic polynomial. We discuss how students could be led to derive and prove these theorems. (Contains 1 figure.)

Four Theorems on the Psychometric Function

PubMed Central

May, Keith A.; Solomon, Joshua A.

2013-01-01

In a 2-alternative forced-choice (2AFC) discrimination task, observers choose which of two stimuli has the higher value. The psychometric function for this task gives the probability of a correct response for a given stimulus difference, . This paper proves four theorems about the psychometric function. Assuming the observer applies a transducer and adds noise, Theorem 1 derives a convenient general expression for the psychometric function. Discrimination data are often fitted with a Weibull function. Theorem 2 proves that the Weibull “slope” parameter, , can be approximated by , where is the of the Weibull function that fits best to the cumulative noise distribution, and depends on the transducer. We derive general expressions for and , from which we derive expressions for specific cases. One case that follows naturally from our general analysis is Pelli's finding that, when , . We also consider two limiting cases. Theorem 3 proves that, as sensitivity improves, 2AFC performance will usually approach that for a linear transducer, whatever the actual transducer; we show that this does not apply at signal levels where the transducer gradient is zero, which explains why it does not apply to contrast detection. Theorem 4 proves that, when the exponent of a power-function transducer approaches zero, 2AFC performance approaches that of a logarithmic transducer. We show that the power-function exponents of 0.4–0.5 fitted to suprathreshold contrast discrimination data are close enough to zero for the fitted psychometric function to be practically indistinguishable from that of a log transducer. Finally, Weibull reflects the shape of the noise distribution, and we used our results to assess the recent claim that internal noise has higher kurtosis than a Gaussian. Our analysis of for contrast discrimination suggests that, if internal noise is stimulus-independent, it has lower kurtosis than a Gaussian. PMID:24124456

A Deductive Approach to Computer Programming.

DTIC Science & Technology

1986-01-01

82] K. L. (’lark and S.-A. Thrnlund (editors). Logic Programming, Academic Press (1982). A.R.(’. Studies in Data Processing No. 16. : .(;Goguen and...Tiii Siiillii’>>- oftlie t ralnSforunatloll rukisi 5 (v ielt Since e’ach prodite’ ani (’xjpl’ssiill equliv- * ~ Llil i t’qi ii (ilk t it(’ theo’try...S. Boyer and J S. Moore, A Computational Logic, Academic Press, New York, N.Y., 1979. Brand [751 D. Brand, Proving theorems with the modification

Elementary solutions of coupled model equations in the kinetic theory of gases

NASA Technical Reports Server (NTRS)

Kriese, J. T.; Siewert, C. E.; Chang, T. S.

1974-01-01

The method of elementary solutions is employed to solve two coupled integrodifferential equations sufficient for determining temperature-density effects in a linearized BGK model in the kinetic theory of gases. Full-range completeness and orthogonality theorems are proved for the developed normal modes and the infinite-medium Green's function is constructed as an illustration of the full-range formalism. The appropriate homogeneous matrix Riemann problem is discussed, and half-range completeness and orthogonality theorems are proved for a certain subset of the normal modes. The required existence and uniqueness theorems relevant to the H matrix, basic to the half-range analysis, are proved, and an accurate and efficient computational method is discussed. The half-space temperature-slip problem is solved analytically, and a highly accurate value of the temperature-slip coefficient is reported.

Differentiability of correlations in realistic quantum mechanics

DOE Office of Scientific and Technical Information (OSTI.GOV)

Cabrera, Alejandro; Faria, Edson de; Pujals, Enrique

2015-09-15

We prove a version of Bell’s theorem in which the locality assumption is weakened. We start by assuming theoretical quantum mechanics and weak forms of relativistic causality and of realism (essentially the fact that observable values are well defined independently of whether or not they are measured). Under these hypotheses, we show that only one of the correlation functions that can be formulated in the framework of the usual Bell theorem is unknown. We prove that this unknown function must be differentiable at certain angular configuration points that include the origin. We also prove that, if this correlation is assumedmore » to be twice differentiable at the origin, then we arrive at a version of Bell’s theorem. On the one hand, we are showing that any realistic theory of quantum mechanics which incorporates the kinematic aspects of relativity must lead to this type of rough correlation function that is once but not twice differentiable. On the other hand, this study brings us a single degree of differentiability away from a relativistic von Neumann no hidden variables theorem.« less

A no-hair theorem for stars in Horndeski theories

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lehébel, A.; Babichev, E.; Charmousis, C., E-mail: antoine.lehebel@th.u-psud.fr, E-mail: eugeny.babichev@th.u-psud.fr, E-mail: christos.charmousis@th.u-psud.fr

We consider a generic scalar-tensor theory involving a shift-symmetric scalar field and minimally coupled matter fields. We prove that the Noether current associated with shift-symmetry vanishes in regular, spherically symmetric and static spacetimes. We use this fact to prove the absence of scalar hair for spherically symmetric and static stars in Horndeski and beyond theories. We carefully detail the validity of this no-hair theorem.

Implementing Metamathematics as an Approach to Automatic Theorem Proving

DTIC Science & Technology

1989-01-01

study of artifcial intelligence . Prominent pioneers in theic ranks are the likes of Allen Newel, Herbert Simon, and John McCarthy. On the other hand, the...researchers of diverse interests. There are those interested in studying intelligence , espe- cially reasoning. They argue that reasoning and problem solving...are critical to integce and that proving theorems is intelligent behavior. People with those interests will usually associate themselves with the

A Maximal Element Theorem in FWC-Spaces and Its Applications

PubMed Central

Hu, Qingwen; Miao, Yulin

2014-01-01

A maximal element theorem is proved in finite weakly convex spaces (FWC-spaces, in short) which have no linear, convex, and topological structure. Using the maximal element theorem, we develop new existence theorems of solutions to variational relation problem, generalized equilibrium problem, equilibrium problem with lower and upper bounds, and minimax problem in FWC-spaces. The results represented in this paper unify and extend some known results in the literature. PMID:24782672

Model Checking Failed Conjectures in Theorem Proving: A Case Study

NASA Technical Reports Server (NTRS)

Pike, Lee; Miner, Paul; Torres-Pomales, Wilfredo

2004-01-01

Interactive mechanical theorem proving can provide high assurance of correct design, but it can also be a slow iterative process. Much time is spent determining why a proof of a conjecture is not forthcoming. In some cases, the conjecture is false and in others, the attempted proof is insufficient. In this case study, we use the SAL family of model checkers to generate a concrete counterexample to an unproven conjecture specified in the mechanical theorem prover, PVS. The focus of our case study is the ROBUS Interactive Consistency Protocol. We combine the use of a mechanical theorem prover and a model checker to expose a subtle flaw in the protocol that occurs under a particular scenario of faults and processor states. Uncovering the flaw allows us to mend the protocol and complete its general verification in PVS.

Discovering Theorems in Abstract Algebra Using the Software "GAP"

ERIC Educational Resources Information Center

Blyth, Russell D.; Rainbolt, Julianne G.

2010-01-01

A traditional abstract algebra course typically consists of the professor stating and then proving a sequence of theorems. As an alternative to this classical structure, the students could be expected to discover some of the theorems even before they are motivated by classroom examples. This can be done by using a software system to explore a…

Bell's Theorem and Einstein's "Spooky Actions" from a Simple Thought Experiment

ERIC Educational Resources Information Center

Kuttner, Fred; Rosenblum, Bruce

2010-01-01

In 1964 John Bell proved a theorem allowing the experimental test of whether what Einstein derided as "spooky actions at a distance" actually exist. We will see that they "do". Bell's theorem can be displayed with a simple, nonmathematical thought experiment suitable for a physics course at "any" level. And a simple, semi-classical derivation of…

Liftings and stresses for planar periodic frameworks

PubMed Central

Borcea, Ciprian; Streinu, Ileana

2015-01-01

We formulate and prove a periodic analog of Maxwell’s theorem relating stressed planar frameworks and their liftings to polyhedral surfaces with spherical topology. We use our lifting theorem to prove deformation and rigidity-theoretic properties for planar periodic pseudo-triangulations, generalizing features known for their finite counterparts. These properties are then applied to questions originating in mathematical crystallography and materials science, concerning planar periodic auxetic structures and ultrarigid periodic frameworks. PMID:26973370

Investigation, Development, and Evaluation of Performance Proving for Fault-tolerant Computers

NASA Technical Reports Server (NTRS)

Levitt, K. N.; Schwartz, R.; Hare, D.; Moore, J. S.; Melliar-Smith, P. M.; Shostak, R. E.; Boyer, R. S.; Green, M. W.; Elliott, W. D.

1983-01-01

A number of methodologies for verifying systems and computer based tools that assist users in verifying their systems were developed. These tools were applied to verify in part the SIFT ultrareliable aircraft computer. Topics covered included: STP theorem prover; design verification of SIFT; high level language code verification; assembly language level verification; numerical algorithm verification; verification of flight control programs; and verification of hardware logic.

Topology and the Lay of the Land: A Mathematician on the Topographer's Turf.

ERIC Educational Resources Information Center

Shubin, Mikhail

1992-01-01

Presents a proof of Euler's Theorem on polyhedra by relating the theorem to the field of modern topology, specifically to the topology of relief maps. An analogous theorem involving the features of mountain summits, basins, and passes on a terrain is proved and related to the faces, vertices, and edges on a convex polyhedron. (MDH)

Weak Compactness and Control Measures in the Space of Unbounded Measures

PubMed Central

Brooks, James K.; Dinculeanu, Nicolae

1972-01-01

We present a synthesis theorem for a family of locally equivalent measures defined on a ring of sets. This theorem is then used to exhibit a control measure for weakly compact sets of unbounded measures. In addition, the existence of a local control measure for locally strongly bounded vector measures is proved by means of the synthesis theorem. PMID:16591980

Numerical solution of linear and nonlinear Fredholm integral equations by using weighted mean-value theorem.

PubMed

Altürk, Ahmet

2016-01-01

Mean value theorems for both derivatives and integrals are very useful tools in mathematics. They can be used to obtain very important inequalities and to prove basic theorems of mathematical analysis. In this article, a semi-analytical method that is based on weighted mean-value theorem for obtaining solutions for a wide class of Fredholm integral equations of the second kind is introduced. Illustrative examples are provided to show the significant advantage of the proposed method over some existing techniques.

Characterization of Generalized Young Measures Generated by Symmetric Gradients

NASA Astrophysics Data System (ADS)

De Philippis, Guido; Rindler, Filip

2017-06-01

This work establishes a characterization theorem for (generalized) Young measures generated by symmetric derivatives of functions of bounded deformation (BD) in the spirit of the classical Kinderlehrer-Pedregal theorem. Our result places such Young measures in duality with symmetric-quasiconvex functions with linear growth. The "local" proof strategy combines blow-up arguments with the singular structure theorem in BD (the analogue of Alberti's rank-one theorem in BV), which was recently proved by the authors. As an application of our characterization theorem we show how an atomic part in a BD-Young measure can be split off in generating sequences.

Common fixed point theorems for maps under a contractive condition of integral type

NASA Astrophysics Data System (ADS)

Djoudi, A.; Merghadi, F.

2008-05-01

Two common fixed point theorems for mapping of complete metric space under a general contractive inequality of integral type and satisfying minimal commutativity conditions are proved. These results extend and improve several previous results, particularly Theorem 4 of Rhoades [B.E. Rhoades, Two fixed point theorems for mappings satisfying a general contractive condition of integral type, Int. J. Math. Math. Sci. 63 (2003) 4007-4013] and Theorem 4 of Sessa [S. Sessa, On a weak commutativity condition of mappings in fixed point considerations, Publ. Inst. Math. (Beograd) (N.S.) 32 (46) (1982) 149-153].

Four theorems on the psychometric function.

PubMed

May, Keith A; Solomon, Joshua A

2013-01-01

In a 2-alternative forced-choice (2AFC) discrimination task, observers choose which of two stimuli has the higher value. The psychometric function for this task gives the probability of a correct response for a given stimulus difference, Δx. This paper proves four theorems about the psychometric function. Assuming the observer applies a transducer and adds noise, Theorem 1 derives a convenient general expression for the psychometric function. Discrimination data are often fitted with a Weibull function. Theorem 2 proves that the Weibull "slope" parameter, β, can be approximated by β(Noise) x β(Transducer), where β(Noise) is the β of the Weibull function that fits best to the cumulative noise distribution, and β(Transducer) depends on the transducer. We derive general expressions for β(Noise) and β(Transducer), from which we derive expressions for specific cases. One case that follows naturally from our general analysis is Pelli's finding that, when d' ∝ (Δx)(b), β ≈ β(Noise) x b. We also consider two limiting cases. Theorem 3 proves that, as sensitivity improves, 2AFC performance will usually approach that for a linear transducer, whatever the actual transducer; we show that this does not apply at signal levels where the transducer gradient is zero, which explains why it does not apply to contrast detection. Theorem 4 proves that, when the exponent of a power-function transducer approaches zero, 2AFC performance approaches that of a logarithmic transducer. We show that the power-function exponents of 0.4-0.5 fitted to suprathreshold contrast discrimination data are close enough to zero for the fitted psychometric function to be practically indistinguishable from that of a log transducer. Finally, Weibull β reflects the shape of the noise distribution, and we used our results to assess the recent claim that internal noise has higher kurtosis than a Gaussian. Our analysis of β for contrast discrimination suggests that, if internal noise is stimulus-independent, it has lower kurtosis than a Gaussian.

Trace theorem for quasi-Fuchsian groups

NASA Astrophysics Data System (ADS)

Connes, A.; Sukochev, F. A.; Zanin, D. V.

2017-10-01

We complete the proof of the Trace Theorem in the quantized calculus for quasi-Fuchsian groups which was stated and sketched, but not fully proved, on pp. 322-325 of the book Noncommutative geometry of the first author. Bibliography: 34 titles.

Special ergodic theorems and dynamical large deviations

NASA Astrophysics Data System (ADS)

Kleptsyn, Victor; Ryzhov, Dmitry; Minkov, Stanislav

2012-11-01

Let f : M → M be a self-map of a compact Riemannian manifold M, admitting a global SRB measure μ. For a continuous test function \\varphi\\colon M\\to R and a constant α > 0, consider the set Kφ,α of the initial points for which the Birkhoff time averages of the function φ differ from its μ-space average by at least α. As the measure μ is a global SRB one, the set Kφ,α should have zero Lebesgue measure. The special ergodic theorem, whenever it holds, claims that, moreover, this set has a Hausdorff dimension less than the dimension of M. We prove that for Lipschitz maps, the special ergodic theorem follows from the dynamical large deviations principle. We also define and prove analogous result for flows. Applying the theorems of Young and of Araújo and Pacifico, we conclude that the special ergodic theorem holds for transitive hyperbolic attractors of C2-diffeomorphisms, as well as for some other known classes of maps (including the one of partially hyperbolic non-uniformly expanding maps) and flows.

A Converse of Fermat's Little Theorem

ERIC Educational Resources Information Center

Bruckman, P. S.

2007-01-01

As the name of the paper implies, a converse of Fermat's Little Theorem (FLT) is stated and proved. FLT states the following: if p is any prime, and x any integer, then x[superscript p] [equivalent to] x (mod p). There is already a well-known converse of FLT, known as Lehmer's Theorem, which is as follows: if x is an integer coprime with m, such…

The Great Emch Closure Theorem and a combinatorial proof of Poncelet's Theorem

NASA Astrophysics Data System (ADS)

Avksentyev, E. A.

2015-11-01

The relations between the classical closure theorems (Poncelet's, Steiner's, Emch's, and the zigzag theorems) and some of their generalizations are discussed. It is known that Emch's Theorem is the most general of these, while the others follow as special cases. A generalization of Emch's Theorem to pencils of circles is proved, which (by analogy with the Great Poncelet Theorem) can be called the Great Emch Theorem. It is shown that the Great Emch and Great Poncelet Theorems are equivalent and can be derived one from the other using elementary geometry, and also that both hold in the Lobachevsky plane as well. A new closure theorem is also obtained, in which the construction of closure is slightly more involved: closure occurs on a variable circle which is tangent to a fixed pair of circles. In conclusion, a combinatorial proof of Poncelet's Theorem is given, which deduces the closure principle for an arbitrary number of steps from the principle for three steps using combinatorics and number theory. Bibliography: 20 titles.

A contracting-interval program for the Danilewski method. Ph.D. Thesis - Va. Univ.

NASA Technical Reports Server (NTRS)

Harris, J. D.

1971-01-01

The concept of contracting-interval programs is applied to finding the eigenvalues of a matrix. The development is a three-step process in which (1) a program is developed for the reduction of a matrix to Hessenberg form, (2) a program is developed for the reduction of a Hessenberg matrix to colleague form, and (3) the characteristic polynomial with interval coefficients is readily obtained from the interval of colleague matrices. This interval polynomial is then factored into quadratic factors so that the eigenvalues may be obtained. To develop a contracting-interval program for factoring this polynomial with interval coefficients it is necessary to have an iteration method which converges even in the presence of controlled rounding errors. A theorem is stated giving sufficient conditions for the convergence of Newton's method when both the function and its Jacobian cannot be evaluated exactly but errors can be made proportional to the square of the norm of the difference between the previous two iterates. This theorem is applied to prove the convergence of the generalization of the Newton-Bairstow method that is used to obtain quadratic factors of the characteristic polynomial.

Formalizing Probabilistic Safety Claims

NASA Technical Reports Server (NTRS)

Herencia-Zapana, Heber; Hagen, George E.; Narkawicz, Anthony J.

2011-01-01

A safety claim for a system is a statement that the system, which is subject to hazardous conditions, satisfies a given set of properties. Following work by John Rushby and Bev Littlewood, this paper presents a mathematical framework that can be used to state and formally prove probabilistic safety claims. It also enables hazardous conditions, their uncertainties, and their interactions to be integrated into the safety claim. This framework provides a formal description of the probabilistic composition of an arbitrary number of hazardous conditions and their effects on system behavior. An example is given of a probabilistic safety claim for a conflict detection algorithm for aircraft in a 2D airspace. The motivation for developing this mathematical framework is that it can be used in an automated theorem prover to formally verify safety claims.

On Pythagoras Theorem for Products of Spectral Triples

NASA Astrophysics Data System (ADS)

D'Andrea, Francesco; Martinetti, Pierre

2013-05-01

We discuss a version of Pythagoras theorem in noncommutative geometry. Usual Pythagoras theorem can be formulated in terms of Connes' distance, between pure states, in the product of commutative spectral triples. We investigate the generalization to both non-pure states and arbitrary spectral triples. We show that Pythagoras theorem is replaced by some Pythagoras inequalities, that we prove for the product of arbitrary (i.e. non-necessarily commutative) spectral triples, assuming only some unitality condition. We show that these inequalities are optimal, and we provide non-unital counter-examples inspired by K-homology.

Quantum Mechanics, Can It Be Consistent with Locality?

NASA Astrophysics Data System (ADS)

Nisticò, Giuseppe; Sestito, Angela

2011-07-01

We single out an alternative, strict interpretation of the Einstein-Podolsky-Rosen criterion of reality, and identify the implied extensions of quantum correlations. Then we prove that the theorem of Bell, and the non-locality theorems without inequalities, fail if the new extensions are adopted. Therefore, these theorems can be interpreted as arguments against the wide interpretation of the criterion of reality rather than as a violation of locality.

Specification Improvement Through Analysis of Proof Structure (SITAPS): High Assurance Software Development

DTIC Science & Technology

2016-02-01

proof in mathematics. For example, consider the proof of the Pythagorean Theorem illustrated at: http://www.cut-the-knot.org/ pythagoras / where 112...methods and tools have made significant progress in their ability to model software designs and prove correctness theorems about the systems modeled...assumption criticality” or “ theorem root set size” SITAPS detects potentially brittle verification cases. SITAPS provides tools and techniques that

C formal verification with unix communication and concurrency

NASA Technical Reports Server (NTRS)

Hoover, Doug N.

1990-01-01

The results of a NASA SBIR project are presented in which CSP-Ariel, a verification system for C programs which use Unix system calls for concurrent programming, interprocess communication, and file input and output, was developed. This project builds on ORA's Ariel C verification system by using the system of Hoare's book, Communicating Sequential Processes, to model concurrency and communication. The system runs in ORA's Clio theorem proving environment. The use of CSP to model Unix concurrency and sketch the CSP semantics of a simple concurrent program is outlined. Plans for further development of CSP-Ariel are discussed. This paper is presented in viewgraph form.

Critical Behavior of the Annealed Ising Model on Random Regular Graphs

NASA Astrophysics Data System (ADS)

Can, Van Hao

2017-11-01

In Giardinà et al. (ALEA Lat Am J Probab Math Stat 13(1):121-161, 2016), the authors have defined an annealed Ising model on random graphs and proved limit theorems for the magnetization of this model on some random graphs including random 2-regular graphs. Then in Can (Annealed limit theorems for the Ising model on random regular graphs, arXiv:1701.08639, 2017), we generalized their results to the class of all random regular graphs. In this paper, we study the critical behavior of this model. In particular, we determine the critical exponents and prove a non standard limit theorem stating that the magnetization scaled by n^{3/4} converges to a specific random variable, with n the number of vertices of random regular graphs.

Subleading soft graviton theorem for loop amplitudes

NASA Astrophysics Data System (ADS)

Sen, Ashoke

2017-11-01

Superstring field theory gives expressions for heterotic and type II string loop amplitudes that are free from ultraviolet and infrared divergences when the number of non-compact space-time dimensions is five or more. We prove the subleading soft graviton theorem in these theories to all orders in perturbation theory for S-matrix elements of arbitrary number of finite energy external states but only one external soft graviton. We also prove the leading soft graviton theorem for arbitrary number of finite energy external states and arbitrary number of soft gravitons. Since our analysis is based on general properties of one particle irreducible effective action, the results are valid in any theory of quantum gravity that gives finite result for the S-matrix order by order in perturbation theory without violating general coordinate invariance.

Research on Quantum Algorithms at the Institute for Quantum Information

DTIC Science & Technology

2009-10-17

accuracy threshold theorem for the one-way quantum computer. Their proof is based on a novel scheme, in which a noisy cluster state in three spatial...detected. The proof applies to independent stochastic noise but (in contrast to proofs of the quantum accuracy threshold theorem based on concatenated...proved quantum threshold theorems for long-range correlated non-Markovian noise, for leakage faults, for the one-way quantum computer, for postselected

QA4, a language for artificial intelligence.

NASA Technical Reports Server (NTRS)

Derksen, J. A. C.

1973-01-01

Introduction of a language for problem solving and specifically robot planning, program verification, and synthesis and theorem proving. This language, called question-answerer 4 (QA4), embodies many features that have been found useful for constructing problem solvers but have to be programmed explicitly by the user of a conventional language. The most important features of QA4 are described, and examples are provided for most of the material introduced. Language features include backtracking, parallel processing, pattern matching, set manipulation, and pattern-triggered function activation. The language is most convenient for use in an interactive way and has extensive trace and edit facilities.

On Kronecker-Capelli type theorems for infinite systems

NASA Astrophysics Data System (ADS)

Fedorov, Foma M.; Potapova, Sargylana V.

2017-11-01

On the basis of the new concept of the decrement of an infinite matrices and determinants, we studied the inconsistency of a general infinite systems of linear algebraic equations. We proved the theorem on inconsistency of a infinite system when the decrement of its matrix is nonzero.

A THEOREM OF BOURGIN-YANG TYPE FOR \\mathbb{Z}_p^n-ACTION

NASA Astrophysics Data System (ADS)

Volovikov, A. Yu

1993-02-01

A theorem of Bourgin-Yang type is proved for maps of spaces with \\mathbb{Z}_p^n-action into manifolds. The results are applied to the problem of Knaster for maps of spheres into the line and the plane.Bibliography: 44 titles.

Central Limit Theorem for Exponentially Quasi-local Statistics of Spin Models on Cayley Graphs

NASA Astrophysics Data System (ADS)

Reddy, Tulasi Ram; Vadlamani, Sreekar; Yogeshwaran, D.

2018-04-01

Central limit theorems for linear statistics of lattice random fields (including spin models) are usually proven under suitable mixing conditions or quasi-associativity. Many interesting examples of spin models do not satisfy mixing conditions, and on the other hand, it does not seem easy to show central limit theorem for local statistics via quasi-associativity. In this work, we prove general central limit theorems for local statistics and exponentially quasi-local statistics of spin models on discrete Cayley graphs with polynomial growth. Further, we supplement these results by proving similar central limit theorems for random fields on discrete Cayley graphs taking values in a countable space, but under the stronger assumptions of α -mixing (for local statistics) and exponential α -mixing (for exponentially quasi-local statistics). All our central limit theorems assume a suitable variance lower bound like many others in the literature. We illustrate our general central limit theorem with specific examples of lattice spin models and statistics arising in computational topology, statistical physics and random networks. Examples of clustering spin models include quasi-associated spin models with fast decaying covariances like the off-critical Ising model, level sets of Gaussian random fields with fast decaying covariances like the massive Gaussian free field and determinantal point processes with fast decaying kernels. Examples of local statistics include intrinsic volumes, face counts, component counts of random cubical complexes while exponentially quasi-local statistics include nearest neighbour distances in spin models and Betti numbers of sub-critical random cubical complexes.

Thermal transport in the Falicov-Kimball model

NASA Astrophysics Data System (ADS)

Freericks, J. K.; Zlatić, V.

2001-12-01

We prove the Jonson-Mahan theorem for the thermopower of the Falicov-Kimball model by solving explicitly for correlation functions in the large dimensional limit. We prove a similar result for the thermal conductivity. We separate the results for thermal transport into the pieces of the heat current that arise from the kinetic energy and those that arise from the potential energy. Our method of proof is specific to the Falicov-Kimball model, but illustrates the near cancellations between the kinetic- and potential-energy pieces of the heat current implied by the Jonson-Mahan theorem.

Mathematical analysis on the cosets of subgroup in the group of E-convex sets

NASA Astrophysics Data System (ADS)

Abbas, Nada Mohammed; Ajeena, Ruma Kareem K.

2018-05-01

In this work, analyzing the cosets of the subgroup in the group of L – convex sets is presented as a new and powerful tool in the topics of the convex analysis and abstract algebra. On L – convex sets, the properties of these cosets are proved mathematically. Most important theorem on a finite group of L – convex sets theory which is the Lagrange’s Theorem has been proved. As well as, the mathematical proof of the quotient group of L – convex sets is presented.

Combining Symbolic Computation and Theorem Proving: Some Problems of Ramanujan

DTIC Science & Technology

1994-01-01

1994 CMU-CS--94- 103 ¶ DTIC MAY 0e o99 c -rnepe Combining symbolic computation and theorem proving: some problems of Ramanujan Edmund Clarke Xudong Zhao...Research and Development Center, Aeronautical Systems Division (AFSC), U.S. Air Force, Wright-Patterson AFB, Ohio 45433-6543 under Contract F33615-90- C ...Availability Codes n n = f Avail and Ior7. k= f(k) = _L k~of(nk Dist Special 8. =I f (k + c ) =_k=,+ I f (k) A .[ 3. List of problems The list of challenge

Generalized Browder's and Weyl's theorems for Banach space operators

NASA Astrophysics Data System (ADS)

Curto, Raúl E.; Han, Young Min

2007-12-01

We find necessary and sufficient conditions for a Banach space operator T to satisfy the generalized Browder's theorem. We also prove that the spectral mapping theorem holds for the Drazin spectrum and for analytic functions on an open neighborhood of [sigma](T). As applications, we show that if T is algebraically M-hyponormal, or if T is algebraically paranormal, then the generalized Weyl's theorem holds for f(T), where f[set membership, variant]H((T)), the space of functions analytic on an open neighborhood of [sigma](T). We also show that if T is reduced by each of its eigenspaces, then the generalized Browder's theorem holds for f(T), for each f[set membership, variant]H([sigma](T)).

Analytic boosted boson discrimination

DOE PAGES

Larkoski, Andrew J.; Moult, Ian; Neill, Duff

2016-05-20

Observables which discriminate boosted topologies from massive QCD jets are of great importance for the success of the jet substructure program at the Large Hadron Collider. Such observables, while both widely and successfully used, have been studied almost exclusively with Monte Carlo simulations. In this paper we present the first all-orders factorization theorem for a two-prong discriminant based on a jet shape variable, D 2, valid for both signal and background jets. Our factorization theorem simultaneously describes the production of both collinear and soft subjets, and we introduce a novel zero-bin procedure to correctly describe the transition region between thesemore » limits. By proving an all orders factorization theorem, we enable a systematically improvable description, and allow for precision comparisons between data, Monte Carlo, and first principles QCD calculations for jet substructure observables. Using our factorization theorem, we present numerical results for the discrimination of a boosted Z boson from massive QCD background jets. We compare our results with Monte Carlo predictions which allows for a detailed understanding of the extent to which these generators accurately describe the formation of two-prong QCD jets, and informs their usage in substructure analyses. In conclusion, our calculation also provides considerable insight into the discrimination power and calculability of jet substructure observables in general.« less

DOE Office of Scientific and Technical Information (OSTI.GOV)

Larkoski, Andrew J.; Moult, Ian; Neill, Duff

Observables which discriminate boosted topologies from massive QCD jets are of great importance for the success of the jet substructure program at the Large Hadron Collider. Such observables, while both widely and successfully used, have been studied almost exclusively with Monte Carlo simulations. In this paper we present the first all-orders factorization theorem for a two-prong discriminant based on a jet shape variable, D 2, valid for both signal and background jets. Our factorization theorem simultaneously describes the production of both collinear and soft subjets, and we introduce a novel zero-bin procedure to correctly describe the transition region between thesemore » limits. By proving an all orders factorization theorem, we enable a systematically improvable description, and allow for precision comparisons between data, Monte Carlo, and first principles QCD calculations for jet substructure observables. Using our factorization theorem, we present numerical results for the discrimination of a boosted Z boson from massive QCD background jets. We compare our results with Monte Carlo predictions which allows for a detailed understanding of the extent to which these generators accurately describe the formation of two-prong QCD jets, and informs their usage in substructure analyses. In conclusion, our calculation also provides considerable insight into the discrimination power and calculability of jet substructure observables in general.« less

Guided discovery of the nine-point circle theorem and its proof

NASA Astrophysics Data System (ADS)

Buchbinder, Orly

2018-01-01

The nine-point circle theorem is one of the most beautiful and surprising theorems in Euclidean geometry. It establishes an existence of a circle passing through nine points, all of which are related to a single triangle. This paper describes a set of instructional activities that can help students discover the nine-point circle theorem through investigation in a dynamic geometry environment, and consequently prove it using a method of guided discovery. The paper concludes with a variety of suggestions for the ways in which the whole set of activities can be implemented in geometry classrooms.

Fluctuation theorem: A critical review

NASA Astrophysics Data System (ADS)

Malek Mansour, M.; Baras, F.

2017-10-01

Fluctuation theorem for entropy production is revisited in the framework of stochastic processes. The applicability of the fluctuation theorem to physico-chemical systems and the resulting stochastic thermodynamics were analyzed. Some unexpected limitations are highlighted in the context of jump Markov processes. We have shown that these limitations handicap the ability of the resulting stochastic thermodynamics to correctly describe the state of non-equilibrium systems in terms of the thermodynamic properties of individual processes therein. Finally, we considered the case of diffusion processes and proved that the fluctuation theorem for entropy production becomes irrelevant at the stationary state in the case of one variable systems.

The Geometric Mean Value Theorem

ERIC Educational Resources Information Center

de Camargo, André Pierro

2018-01-01

In a previous article published in the "American Mathematical Monthly," Tucker ("Amer Math Monthly." 1997; 104(3): 231-240) made severe criticism on the Mean Value Theorem and, unfortunately, the majority of calculus textbooks also do not help to improve its reputation. The standard argument for proving it seems to be applying…

A generalization of Bertrand's theorem to surfaces of revolution

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zagryadskii, Oleg A; Kudryavtseva, Elena A; Fedoseev, Denis A

We prove a generalization of Bertrand's theorem to the case of abstract surfaces of revolution that have no 'equators'. We prove a criterion for exactly two central potentials to exist on this type of surface (up to an additive and a multiplicative constant) for which all bounded orbits are closed and there is a bounded nonsingular noncircular orbit. We prove a criterion for the existence of exactly one such potential. We study the geometry and classification of the corresponding surfaces with the aforementioned pair of potentials (gravitational and oscillatory) or unique potential (oscillatory). We show that potentials of the requiredmore » form do not exist on surfaces that do not belong to any of the classes described. Bibliography: 33 titles.« less

Quantum Field Theory on Spacetimes with a Compactly Generated Cauchy Horizon

NASA Astrophysics Data System (ADS)

Kay, Bernard S.; Radzikowski, Marek J.; Wald, Robert M.

1997-02-01

We prove two theorems which concern difficulties in the formulation of the quantum theory of a linear scalar field on a spacetime, (M,g_{ab}), with a compactly generated Cauchy horizon. These theorems demonstrate the breakdown of the theory at certain base points of the Cauchy horizon, which are defined as 'past terminal accumulation points' of the horizon generators. Thus, the theorems may be interpreted as giving support to Hawking's 'Chronology Protection Conjecture', according to which the laws of physics prevent one from manufacturing a 'time machine'. Specifically, we prove: Theorem 1. There is no extension to (M,g_{ab}) of the usual field algebra on the initial globally hyperbolic region which satisfies the condition of F-locality at any base point. In other words, any extension of the field algebra must, in any globally hyperbolic neighbourhood of any base point, differ from the algebra one would define on that neighbourhood according to the rules for globally hyperbolic spacetimes. Theorem 2. The two-point distribution for any Hadamard state defined on the initial globally hyperbolic region must (when extended to a distributional bisolution of the covariant Klein-Gordon equation on the full spacetime) be singular at every base point x in the sense that the difference between this two point distribution and a local Hadamard distribution cannot be given by a bounded function in any neighbourhood (in M 2 M) of (x,x). In consequence of Theorem 2, quantities such as the renormalized expectation value of J2 or of the stress-energy tensor are necessarily ill-defined or singular at any base point. The proof of these theorems relies on the 'Propagation of Singularities' theorems of Duistermaat and Hörmander.

Scribing: A Technology-Based Instructional Strategy

ERIC Educational Resources Information Center

Harless, Patrick

2011-01-01

In this article, the author presents one instructional strategy--scribing--tailored to the Tablet PC. He illustrates the role of the scribe during discussion through two classroom examples: (1) generalizing the polygon sum theorem; and (2) proving the third angle theorem. Then he analyzes scribing as an instructional strategy as well as students'…

De Finetti representation theorem for infinite-dimensional quantum systems and applications to quantum cryptography.

PubMed

Renner, R; Cirac, J I

2009-03-20

We show that the quantum de Finetti theorem holds for states on infinite-dimensional systems, provided they satisfy certain experimentally verifiable conditions. This result can be applied to prove the security of quantum key distribution based on weak coherent states or other continuous variable states against general attacks.

Student Research Project: Goursat's Other Theorem

ERIC Educational Resources Information Center

Petrillo, Joseph

2009-01-01

In an elementary undergraduate abstract algebra or group theory course, a student is introduced to a variety of methods for constructing and deconstructing groups. What seems to be missing from contemporary texts and syllabi is a theorem, first proved by Edouard Jean-Baptiste Goursat (1858-1936) in 1889, which completely describes the subgroups of…

Possible Potentials Responsible for Stable Circular Relativistic Orbits

ERIC Educational Resources Information Center

Kumar, Prashant; Bhattacharya, Kaushik

2011-01-01

Bertrand's theorem in classical mechanics of the central force fields attracts us because of its predictive power. It categorically proves that there can only be two types of forces which can produce stable, circular orbits. In this paper an attempt has been made to generalize Bertrand's theorem to the central force problem of relativistic…

Perturbative description of the fermionic projector: Normalization, causality, and Furry's theorem

NASA Astrophysics Data System (ADS)

Finster, Felix; Tolksdorf, Jürgen

2014-05-01

The causal perturbation expansion of the fermionic projector is performed with a contour integral method. Different normalization conditions are analyzed. It is shown that the corresponding light-cone expansions are causal in the sense that they only involve bounded line integrals. For the resulting loop diagrams we prove a generalized Furry theorem.

Simultaneous Generalizations of the Theorems of Ceva and Menelaus for Field Planes

ERIC Educational Resources Information Center

Houston, Kelly B.; Powers, Robert C.

2009-01-01

In 1992, Klamkin and Liu proved a very general result in the Extended Euclidean Plane that contains the theorems of Ceva and Menelaus as special cases. In this article, we extend the Klamkin and Liu result to projective planes "PG"(2, F) where F is a field. (Contains 2 figures.)

A Spectral Approach for Quenched Limit Theorems for Random Expanding Dynamical Systems

NASA Astrophysics Data System (ADS)

Dragičević, D.; Froyland, G.; González-Tokman, C.; Vaienti, S.

2018-06-01

We prove quenched versions of (i) a large deviations principle (LDP), (ii) a central limit theorem (CLT), and (iii) a local central limit theorem for non-autonomous dynamical systems. A key advance is the extension of the spectral method, commonly used in limit laws for deterministic maps, to the general random setting. We achieve this via multiplicative ergodic theory and the development of a general framework to control the regularity of Lyapunov exponents of twisted transfer operator cocycles with respect to a twist parameter. While some versions of the LDP and CLT have previously been proved with other techniques, the local central limit theorem is, to our knowledge, a completely new result, and one that demonstrates the strength of our method. Applications include non-autonomous (piecewise) expanding maps, defined by random compositions of the form {T_{σ^{n-1} ω} circ\\cdotscirc T_{σω}circ T_ω}. An important aspect of our results is that we only assume ergodicity and invertibility of the random driving {σ:Ω\\toΩ} ; in particular no expansivity or mixing properties are required.

A Spectral Approach for Quenched Limit Theorems for Random Expanding Dynamical Systems

NASA Astrophysics Data System (ADS)

Dragičević, D.; Froyland, G.; González-Tokman, C.; Vaienti, S.

2018-01-01

We prove quenched versions of (i) a large deviations principle (LDP), (ii) a central limit theorem (CLT), and (iii) a local central limit theorem for non-autonomous dynamical systems. A key advance is the extension of the spectral method, commonly used in limit laws for deterministic maps, to the general random setting. We achieve this via multiplicative ergodic theory and the development of a general framework to control the regularity of Lyapunov exponents of twisted transfer operator cocycles with respect to a twist parameter. While some versions of the LDP and CLT have previously been proved with other techniques, the local central limit theorem is, to our knowledge, a completely new result, and one that demonstrates the strength of our method. Applications include non-autonomous (piecewise) expanding maps, defined by random compositions of the form {T_{σ^{n-1} ω} circ\\cdotscirc T_{σω}circ T_ω} . An important aspect of our results is that we only assume ergodicity and invertibility of the random driving {σ:Ω\\toΩ} ; in particular no expansivity or mixing properties are required.

Republication of: A theorem on Petrov types

NASA Astrophysics Data System (ADS)

Goldberg, J. N.; Sachs, R. K.

2009-02-01

This is a republication of the paper “A Theorem on Petrov Types” by Goldberg and Sachs, Acta Phys. Pol. 22 (supplement), 13 (1962), in which they proved the Goldberg-Sachs theorem. The article has been selected for publication in the Golden Oldies series of General Relativity and Gravitation. Typographical errors of the original publication were corrected by the editor. The paper is accompanied by a Golden Oldie Editorial containing an editorial note written by Andrzej Krasiński and Maciej Przanowski and Goldberg’s brief autobiography. The editorial note explains some difficult parts of the proof of the theorem and discusses the influence of results of the paper on later research.

Quantum voting and violation of Arrow's impossibility theorem

NASA Astrophysics Data System (ADS)

Bao, Ning; Yunger Halpern, Nicole

2017-06-01

We propose a quantum voting system in the spirit of quantum games such as the quantum prisoner's dilemma. Our scheme enables a constitution to violate a quantum analog of Arrow's impossibility theorem. Arrow's theorem is a claim proved deductively in economics: Every (classical) constitution endowed with three innocuous-seeming properties is a dictatorship. We construct quantum analogs of constitutions, of the properties, and of Arrow's theorem. A quantum version of majority rule, we show, violates this quantum Arrow conjecture. Our voting system allows for tactical-voting strategies reliant on entanglement, interference, and superpositions. This contribution to quantum game theory helps elucidate how quantum phenomena can be harnessed for strategic advantage.

Model Checking JAVA Programs Using Java Pathfinder

NASA Technical Reports Server (NTRS)

Havelund, Klaus; Pressburger, Thomas

2000-01-01

This paper describes a translator called JAVA PATHFINDER from JAVA to PROMELA, the "programming language" of the SPIN model checker. The purpose is to establish a framework for verification and debugging of JAVA programs based on model checking. This work should be seen in a broader attempt to make formal methods applicable "in the loop" of programming within NASA's areas such as space, aviation, and robotics. Our main goal is to create automated formal methods such that programmers themselves can apply these in their daily work (in the loop) without the need for specialists to manually reformulate a program into a different notation in order to analyze the program. This work is a continuation of an effort to formally verify, using SPIN, a multi-threaded operating system programmed in Lisp for the Deep-Space 1 spacecraft, and of previous work in applying existing model checkers and theorem provers to real applications.

Research and applications: Artificial intelligence

NASA Technical Reports Server (NTRS)

Raphael, B.; Fikes, R. E.; Chaitin, L. J.; Hart, P. E.; Duda, R. O.; Nilsson, N. J.

1971-01-01

A program of research in the field of artificial intelligence is presented. The research areas discussed include automatic theorem proving, representations of real-world environments, problem-solving methods, the design of a programming system for problem-solving research, techniques for general scene analysis based upon television data, and the problems of assembling an integrated robot system. Major accomplishments include the development of a new problem-solving system that uses both formal logical inference and informal heuristic methods, the development of a method of automatic learning by generalization, and the design of the overall structure of a new complete robot system. Eight appendices to the report contain extensive technical details of the work described.

A Proof of the Occupancy Principle and the Mean-Transit-Time Theorem for Compartmental Models

PubMed Central

RAMAKRISHNAN, RAJASEKHAR; LEONARD, EDWARD F.; DELL, RALPH B.

2012-01-01

The occupancy principle and the mean-transit-time theorem are derived for the passage of a tracer through a system that can be described by a general pool model. It is proved, using matrix theory, that if (and only if) tracer entering the system labels equally all tracee fluxes into the system, then the integral of the tracer concentration is the same in all the pools. It is also proved that if, in addition, all flow out of the system is through the observation point, the first moment of the tracer concentration at the observation point can be used to calculate the total amount of trace in the system. The necessity of this condition is analyzed. Examples are given of models in which the occupancy principle and the mean-transit-time theorem hold or do not hold. PMID:22328793

Non-algebraic integrability of the Chew-Low reversible dynamical system of the Cremona type and the relation with the 7th Hilbert problem (non-resonant case)

NASA Astrophysics Data System (ADS)

Rerikh, K. V.

A smooth reversible dynamical system (SRDS) and a system of nonlinear functional equations, defined by a certain rational quadratic Cremona mapping and arising from the static model of the dispersion approach in the theory of strong interactions (the Chew-Low equations for p- wave πN- scattering) are considered. This SRDS is splitted into 1- and 2-dimensional ones. An explicit Cremona transformation that completely determines the exact solution of the two-dimensional system is found. This solution depends on an odd function satisfying a nonlinear autonomous 3-point functional equation. Non-algebraic integrability of SRDS under consideration is proved using the method of Poincaré normal forms and the Siegel theorem on biholomorphic linearization of a mapping at a non-resonant fixed point. The proof is based on the classical Feldman-Baker theorem on linear forms of logarithms of algebraic numbers, which, in turn, relies upon solving the 7th Hilbert problem by A.I. Gel'fond and T. Schneider and new powerful methods of A. Baker in the theory of transcendental numbers. The general theorem, following from the Feldman-Baker theorem, on applicability of the Siegel theorem to the set of the eigenvalues λ ɛ Cn of a mapping at a non-resonant fixed point which belong to the algebraic number field A is formulated and proved. The main results are presented in Theorems 1-3, 5, 7, 8 and Remarks 3, 7.

The noncommutative family Atiyah-Patodi-Singer index theorem

NASA Astrophysics Data System (ADS)

Wang, Yong

2016-12-01

In this paper, we define the eta cochain form and prove its regularity when the kernel of a family of Dirac operators is a vector bundle. We decompose the eta form as a pairing of the eta cochain form with the Chern character of an idempotent matrix and we also decompose the Chern character of the index bundle for a fibration with boundary as a pairing of the family Chern-Connes character for a manifold with boundary with the Chern character of an idempotent matrix. We define the family b-Chern-Connes character and then we prove that it is entire and give its variation formula. By this variation formula, we prove another noncommutative family Atiyah-Patodi-Singer index theorem. Thus, we extend the results of Getzler and Wu to the family case.

A Hybrid Common Fixed Point Theorem under Certain Recent Properties

PubMed Central

Imdad, Mohammad

2014-01-01

We prove a common fixed point theorem for a hybrid pair of occasionally coincidentally idempotent mappings via common limit range property. Our result improves some results from the existing literature, especially the ones contained in Sintunavarat and Kumam (2009). Some illustrative and interesting examples to highlight the realized improvements are also furnished. PMID:24592191

DRS: Derivational Reasoning System

NASA Technical Reports Server (NTRS)

Bose, Bhaskar

1995-01-01

The high reliability requirements for airborne systems requires fault-tolerant architectures to address failures in the presence of physical faults, and the elimination of design flaws during the specification and validation phase of the design cycle. Although much progress has been made in developing methods to address physical faults, design flaws remain a serious problem. Formal methods provides a mathematical basis for removing design flaws from digital systems. DRS (Derivational Reasoning System) is a formal design tool based on advanced research in mathematical modeling and formal synthesis. The system implements a basic design algebra for synthesizing digital circuit descriptions from high level functional specifications. DRS incorporates an executable specification language, a set of correctness preserving transformations, verification interface, and a logic synthesis interface, making it a powerful tool for realizing hardware from abstract specifications. DRS integrates recent advances in transformational reasoning, automated theorem proving and high-level CAD synthesis systems in order to provide enhanced reliability in designs with reduced time and cost.

Out-of-time-order fluctuation-dissipation theorem

NASA Astrophysics Data System (ADS)

Tsuji, Naoto; Shitara, Tomohiro; Ueda, Masahito

2018-01-01

We prove a generalized fluctuation-dissipation theorem for a certain class of out-of-time-ordered correlators (OTOCs) with a modified statistical average, which we call bipartite OTOCs, for general quantum systems in thermal equilibrium. The difference between the bipartite and physical OTOCs defined by the usual statistical average is quantified by a measure of quantum fluctuations known as the Wigner-Yanase skew information. Within this difference, the theorem describes a universal relation between chaotic behavior in quantum systems and a nonlinear-response function that involves a time-reversed process. We show that the theorem can be generalized to higher-order n -partite OTOCs as well as in the form of generalized covariance.

Regularity and Tresse's theorem for geometric structures

NASA Astrophysics Data System (ADS)

Sarkisyan, R. A.; Shandra, I. G.

2008-04-01

For any non-special bundle P\\to X of geometric structures we prove that the k-jet space J^k of this bundle with an appropriate k contains an open dense domain U_k on which Tresse's theorem holds. For every s\\geq k we prove that the pre-image \\pi^{-1}(k,s)(U_k) of U_k under the natural projection \\pi(k,s)\\colon J^s\\to J^k consists of regular points. (A point of J^s is said to be regular if the orbits of the group of diffeomorphisms induced from X have locally constant dimension in a neighbourhood of this point.)

SAGA: A project to automate the management of software production systems

NASA Technical Reports Server (NTRS)

Campbell, R. H.

1983-01-01

The current work in progress for the SAGA project are described. The highlights of this research are: a parser independent SAGA editor, design for the screen editing facilities of the editor, delivery to NASA of release 1 of Olorin, the SAGA parser generator, personal workstation environment research, release 1 of the SAGA symbol table manager, delta generation in SAGA, requirements for a proof management system, documentation for and testing of the cyber pascal make prototype, a prototype cyber-based slicing facility, a June 1984 demonstration plan, SAGA utility programs, summary of UNIX software engineering support, and theorem prover review.

Formal Safety Certification of Aerospace Software

NASA Technical Reports Server (NTRS)

Denney, Ewen; Fischer, Bernd

2005-01-01

In principle, formal methods offer many advantages for aerospace software development: they can help to achieve ultra-high reliability, and they can be used to provide evidence of the reliability claims which can then be subjected to external scrutiny. However, despite years of research and many advances in the underlying formalisms of specification, semantics, and logic, formal methods are not much used in practice. In our opinion this is related to three major shortcomings. First, the application of formal methods is still expensive because they are labor- and knowledge-intensive. Second, they are difficult to scale up to complex systems because they are based on deep mathematical insights about the behavior of the systems (t.e., they rely on the "heroic proof"). Third, the proofs can be difficult to interpret, and typically stand in isolation from the original code. In this paper, we describe a tool for formally demonstrating safety-relevant aspects of aerospace software, which largely circumvents these problems. We focus on safely properties because it has been observed that safety violations such as out-of-bounds memory accesses or use of uninitialized variables constitute the majority of the errors found in the aerospace domain. In our approach, safety means that the program will not violate a set of rules that can range for the simple memory access rules to high-level flight rules. These different safety properties are formalized as different safety policies in Hoare logic, which are then used by a verification condition generator along with the code and logical annotations in order to derive formal safety conditions; these are then proven using an automated theorem prover. Our certification system is currently integrated into a model-based code generation toolset that generates the annotations together with the code. However, this automated formal certification technology is not exclusively constrained to our code generator and could, in principle, also be integrated with other code generators such as RealTime Workshop or even applied to legacy code. Our approach circumvents the historical problems with formal methods by increasing the degree of automation on all levels. The restriction to safety policies (as opposed to arbitrary functional behavior) results in simpler proof problems that can generally be solved by fully automatic theorem proves. An automated linking mechanism between the safety conditions and the code provides some of the traceability mandated by process standards such as DO-178B. An automated explanation mechanism uses semantic markup added by the verification condition generator to produce natural-language explanations of the safety conditions and thus supports their interpretation in relation to the code. It shows an automatically generated certification browser that lets users inspect the (generated) code along with the safety conditions (including textual explanations), and uses hyperlinks to automate tracing between the two levels. Here, the explanations reflect the logical structure of the safety obligation but the mechanism can in principle be customized using different sets of domain concepts. The interface also provides some limited control over the certification process itself. Our long-term goal is a seamless integration of certification, code generation, and manual coding that results in a "certified pipeline" in which specifications are automatically transformed into executable code, together with the supporting artifacts necessary for achieving and demonstrating the high level of assurance needed in the aerospace domain.

Diffusion Maps and Geometric Harmonics for Automatic Target Recognition (ATR). Volume 2. Appendices

DTIC Science & Technology

2007-11-01

of the Perron - Frobenius theorem, it suffices to prove that the chain is irreducible and aperiodic. • The irreducibility is a mere consequence of the...of each atom; this is due to the linear programming constraint that the coefficients be nonnegative 4. Chen et al. [20, 21] describe two algorithms for...projection of x onto the convex cone spanned by Ψ(t) with the origin at the apex; we provide details on computing x̃(t) in Section 4.1.3. Let x̃ (t) H

Four Proofs of the Converse of the Chinese Remainder Theorem

ERIC Educational Resources Information Center

Dobbs, D. E.

2008-01-01

Four proofs, designed for classroom use in varying levels of courses on abstract algebra, are given for the converse of the classical Chinese Remainder Theorem over the integers. In other words, it is proved that if m and n are integers greater than 1 such that the abelian groups [double-struck z][subscript m] [direct sum] [double-struck…

The spectral method and the central limit theorem for general Markov chains

NASA Astrophysics Data System (ADS)

Nagaev, S. V.

2017-12-01

We consider Markov chains with an arbitrary phase space and develop a modification of the spectral method that enables us to prove the central limit theorem (CLT) for non-uniformly ergodic Markov chains. The conditions imposed on the transition function are more general than those by Athreya-Ney and Nummelin. Our proof of the CLT is purely analytical.

Calculation of the Centre of Gravity of the Cone Utilizing the Method of Archimedes

ERIC Educational Resources Information Center

Magnaghi, C. P.; Assis, A. K. T.

2012-01-01

Archimedes calculated the centre of gravity of the cone but the proof of this theorem is not extant in his works. Knorr made a reconstruction of this proof utilizing geometrical arguments. This paper proves this theorem by means of a physical demonstration utilizing the law of the lever, and by adapting from Archimedes the method of mechanical…

On the Accuracy and Parallelism of GPGPU-Powered Incremental Clustering Algorithms.

PubMed

Chen, Chunlei; He, Li; Zhang, Huixiang; Zheng, Hao; Wang, Lei

2017-01-01

Incremental clustering algorithms play a vital role in various applications such as massive data analysis and real-time data processing. Typical application scenarios of incremental clustering raise high demand on computing power of the hardware platform. Parallel computing is a common solution to meet this demand. Moreover, General Purpose Graphic Processing Unit (GPGPU) is a promising parallel computing device. Nevertheless, the incremental clustering algorithm is facing a dilemma between clustering accuracy and parallelism when they are powered by GPGPU. We formally analyzed the cause of this dilemma. First, we formalized concepts relevant to incremental clustering like evolving granularity. Second, we formally proved two theorems. The first theorem proves the relation between clustering accuracy and evolving granularity. Additionally, this theorem analyzes the upper and lower bounds of different-to-same mis-affiliation. Fewer occurrences of such mis-affiliation mean higher accuracy. The second theorem reveals the relation between parallelism and evolving granularity. Smaller work-depth means superior parallelism. Through the proofs, we conclude that accuracy of an incremental clustering algorithm is negatively related to evolving granularity while parallelism is positively related to the granularity. Thus the contradictory relations cause the dilemma. Finally, we validated the relations through a demo algorithm. Experiment results verified theoretical conclusions.

Solution of Tikhonov's Motion-Separation Problem Using the Modified Newton-Kantorovich Theorem

NASA Astrophysics Data System (ADS)

Belolipetskii, A. A.; Ter-Krikorov, A. M.

2018-02-01

The paper presents a new way to prove the existence of a solution of the well-known Tikhonov's problem on systems of ordinary differential equations in which one part of the variables performs "fast" motions and the other part, "slow" motions. Tikhonov's problem has been the subject of a large number of works in connection with its applications to a wide range of mathematical models in natural science and economics. Only a short list of publications, which present the proof of the existence of solutions in this problem, is cited. The aim of the paper is to demonstrate the possibility of applying the modified Newton-Kantorovich theorem to prove the existence of a solution in Tikhonov's problem. The technique proposed can be used to prove the existence of solutions of other classes of problems with a small parameter.

Normal forms for Poisson maps and symplectic groupoids around Poisson transversals

NASA Astrophysics Data System (ADS)

Frejlich, Pedro; Mărcuț, Ioan

2018-03-01

Poisson transversals are submanifolds in a Poisson manifold which intersect all symplectic leaves transversally and symplectically. In this communication, we prove a normal form theorem for Poisson maps around Poisson transversals. A Poisson map pulls a Poisson transversal back to a Poisson transversal, and our first main result states that simultaneous normal forms exist around such transversals, for which the Poisson map becomes transversally linear, and intertwines the normal form data of the transversals. Our second result concerns symplectic integrations. We prove that a neighborhood of a Poisson transversal is integrable exactly when the Poisson transversal itself is integrable, and in that case we prove a normal form theorem for the symplectic groupoid around its restriction to the Poisson transversal, which puts all structure maps in normal form. We conclude by illustrating our results with examples arising from Lie algebras.

Normal forms for Poisson maps and symplectic groupoids around Poisson transversals.

PubMed

Frejlich, Pedro; Mărcuț, Ioan

2018-01-01

Poisson transversals are submanifolds in a Poisson manifold which intersect all symplectic leaves transversally and symplectically. In this communication, we prove a normal form theorem for Poisson maps around Poisson transversals. A Poisson map pulls a Poisson transversal back to a Poisson transversal, and our first main result states that simultaneous normal forms exist around such transversals, for which the Poisson map becomes transversally linear, and intertwines the normal form data of the transversals. Our second result concerns symplectic integrations. We prove that a neighborhood of a Poisson transversal is integrable exactly when the Poisson transversal itself is integrable, and in that case we prove a normal form theorem for the symplectic groupoid around its restriction to the Poisson transversal, which puts all structure maps in normal form. We conclude by illustrating our results with examples arising from Lie algebras.

A Theorem on the Rank of a Product of Matrices with Illustration of Its Use in Goodness of Fit Testing.

PubMed

Satorra, Albert; Neudecker, Heinz

2015-12-01

This paper develops a theorem that facilitates computing the degrees of freedom of Wald-type chi-square tests for moment restrictions when there is rank deficiency of key matrices involved in the definition of the test. An if and only if (iff) condition is developed for a simple rule of difference of ranks to be used when computing the desired degrees of freedom of the test. The theorem is developed exploiting basics tools of matrix algebra. The theorem is shown to play a key role in proving the asymptotic chi-squaredness of a goodness of fit test in moment structure analysis, and in finding the degrees of freedom of this chi-square statistic.

The spectral theorem for quaternionic unbounded normal operators based on the S-spectrum

DOE Office of Scientific and Technical Information (OSTI.GOV)

Alpay, Daniel, E-mail: dany@math.bgu.ac.il; Kimsey, David P., E-mail: dpkimsey@gmail.com; Colombo, Fabrizio, E-mail: fabrizio.colombo@polimi.it

In this paper we prove the spectral theorem for quaternionic unbounded normal operators using the notion of S-spectrum. The proof technique consists of first establishing a spectral theorem for quaternionic bounded normal operators and then using a transformation which maps a quaternionic unbounded normal operator to a quaternionic bounded normal operator. With this paper we complete the foundation of spectral analysis of quaternionic operators. The S-spectrum has been introduced to define the quaternionic functional calculus but it turns out to be the correct object also for the spectral theorem for quaternionic normal operators. The lack of a suitable notion ofmore » spectrum was a major obstruction to fully understand the spectral theorem for quaternionic normal operators. A prime motivation for studying the spectral theorem for quaternionic unbounded normal operators is given by the subclass of unbounded anti-self adjoint quaternionic operators which play a crucial role in the quaternionic quantum mechanics.« less

The mechanical problems on additive manufacturing of viscoelastic solids with integral conditions on a surface increasing in the growth process

NASA Astrophysics Data System (ADS)

Parshin, D. A.; Manzhirov, A. V.

2018-04-01

Quasistatic mechanical problems on additive manufacturing aging viscoelastic solids are investigated. The processes of piecewise-continuous accretion of such solids are considered. The consideration is carried out in the framework of linear mechanics of growing solids. A theorem about commutativity of the integration over an arbitrary surface increasing in the solid growing process and the time-derived integral operator of viscoelasticity with a limit depending on the solid point is proved. This theorem provides an efficient way to construct on the basis of Saint-Venant principle solutions of nonclassical boundary-value problems for describing the mechanical behaviour of additively formed solids with integral satisfaction of boundary conditions on the surfaces expanding due to the additional material influx to the formed solid. The constructed solutions will retrace the evolution of the stress-strain state of the solids under consideration during and after the processes of their additive formation. An example of applying the proved theorem is given.

The noncommutative index theorem and the periodic table for disordered topological insulators and superconductors

NASA Astrophysics Data System (ADS)

Katsura, Hosho; Koma, Tohru

2018-03-01

We study a wide class of topological free-fermion systems on a hypercubic lattice in spatial dimensions d ≥ 1. When the Fermi level lies in a spectral gap or a mobility gap, the topological properties, e.g., the integral quantization of the topological invariant, are protected by certain symmetries of the Hamiltonian against disorder. This generic feature is characterized by a generalized index theorem which is a noncommutative analog of the Atiyah-Singer index theorem. The noncommutative index defined in terms of a pair of projections gives a precise formula for the topological invariant in each symmetry class in any dimension (d ≥ 1). Under the assumption on the nonvanishing spectral or mobility gap, we prove that the index formula reproduces Bott periodicity and all of the possible values of topological invariants in the classification table of topological insulators and superconductors. We also prove that the indices are robust against perturbations that do not break the symmetry of the unperturbed Hamiltonian.

Influence of dispatching rules on average production lead time for multi-stage production systems.

PubMed

Hübl, Alexander; Jodlbauer, Herbert; Altendorfer, Klaus

2013-08-01

In this paper the influence of different dispatching rules on the average production lead time is investigated. Two theorems based on covariance between processing time and production lead time are formulated and proved theoretically. Theorem 1 links the average production lead time to the "processing time weighted production lead time" for the multi-stage production systems analytically. The influence of different dispatching rules on average lead time, which is well known from simulation and empirical studies, can be proved theoretically in Theorem 2 for a single stage production system. A simulation study is conducted to gain more insight into the influence of dispatching rules on average production lead time in a multi-stage production system. We find that the "processing time weighted average production lead time" for a multi-stage production system is not invariant of the applied dispatching rule and can be used as a dispatching rule independent indicator for single-stage production systems.

Limit Theorems for Dispersing Billiards with Cusps

NASA Astrophysics Data System (ADS)

Bálint, P.; Chernov, N.; Dolgopyat, D.

2011-12-01

Dispersing billiards with cusps are deterministic dynamical systems with a mild degree of chaos, exhibiting "intermittent" behavior that alternates between regular and chaotic patterns. Their statistical properties are therefore weak and delicate. They are characterized by a slow (power-law) decay of correlations, and as a result the classical central limit theorem fails. We prove that a non-classical central limit theorem holds, with a scaling factor of {sqrt{nlog n}} replacing the standard {sqrt{n}} . We also derive the respective Weak Invariance Principle, and we identify the class of observables for which the classical CLT still holds.

Central Limit Theorems for Linear Statistics of Heavy Tailed Random Matrices

NASA Astrophysics Data System (ADS)

Benaych-Georges, Florent; Guionnet, Alice; Male, Camille

2014-07-01

We show central limit theorems (CLT) for the linear statistics of symmetric matrices with independent heavy tailed entries, including entries in the domain of attraction of α-stable laws and entries with moments exploding with the dimension, as in the adjacency matrices of Erdös-Rényi graphs. For the second model, we also prove a central limit theorem of the moments of its empirical eigenvalues distribution. The limit laws are Gaussian, but unlike the case of standard Wigner matrices, the normalization is the one of the classical CLT for independent random variables.

Theorem Proving in Intel Hardware Design

NASA Technical Reports Server (NTRS)

O'Leary, John

2009-01-01

For the past decade, a framework combining model checking (symbolic trajectory evaluation) and higher-order logic theorem proving has been in production use at Intel. Our tools and methodology have been used to formally verify execution cluster functionality (including floating-point operations) for a number of Intel products, including the Pentium(Registered TradeMark)4 and Core(TradeMark)i7 processors. Hardware verification in 2009 is much more challenging than it was in 1999 - today s CPU chip designs contain many processor cores and significant firmware content. This talk will attempt to distill the lessons learned over the past ten years, discuss how they apply to today s problems, outline some future directions.

Exploiting structure: Introduction and motivation

NASA Technical Reports Server (NTRS)

Xu, Zhong Ling

1994-01-01

This annual report summarizes the research activities that were performed from 26 Jun. 1993 to 28 Feb. 1994. We continued to investigate the Robust Stability of Systems where transfer functions or characteristic polynomials are affine multilinear functions of parameters. An approach that differs from 'Stability by Linear Process' and that reduces the computational burden of checking the robust stability of the system with multilinear uncertainty was found for low order, 2-order, and 3-order cases. We proved a crucial theorem, the so-called Face Theorem. Previously, we have proven Kharitonov's Vertex Theorem and the Edge Theorem by Bartlett. The detail of this proof is contained in the Appendix. This Theorem provides a tool to describe the boundary of the image of the affine multilinear function. For SPR design, we have developed some new results. The third objective for this period is to design a controller for IHM by the H-infinity optimization technique. The details are presented in the Appendix.

A Scalable Analysis Toolkit

NASA Technical Reports Server (NTRS)

Aiken, Alexander

2001-01-01

The Scalable Analysis Toolkit (SAT) project aimed to demonstrate that it is feasible and useful to statically detect software bugs in very large systems. The technical focus of the project was on a relatively new class of constraint-based techniques for analysis software, where the desired facts about programs (e.g., the presence of a particular bug) are phrased as constraint problems to be solved. At the beginning of this project, the most successful forms of formal software analysis were limited forms of automatic theorem proving (as exemplified by the analyses used in language type systems and optimizing compilers), semi-automatic theorem proving for full verification, and model checking. With a few notable exceptions these approaches had not been demonstrated to scale to software systems of even 50,000 lines of code. Realistic approaches to large-scale software analysis cannot hope to make every conceivable formal method scale. Thus, the SAT approach is to mix different methods in one application by using coarse and fast but still adequate methods at the largest scales, and reserving the use of more precise but also more expensive methods at smaller scales for critical aspects (that is, aspects critical to the analysis problem under consideration) of a software system. The principled method proposed for combining a heterogeneous collection of formal systems with different scalability characteristics is mixed constraints. This idea had been used previously in small-scale applications with encouraging results: using mostly coarse methods and narrowly targeted precise methods, useful information (meaning the discovery of bugs in real programs) was obtained with excellent scalability.

Security Modeling and Correctness Proof Using Specware and Isabelle

DTIC Science & Technology

2008-12-01

proving requires substantial knowledge and experience in logical calculus . 15. NUMBER OF PAGES 146 14. SUBJECT TERMS Formal Method, Theorem...although the actual proving requires substantial knowledge and experience in logical calculus . vi THIS PAGE INTENTIONALLY LEFT BLANK vii TABLE OF...formal language and provides tools for proving those formulas in a logical calculus ” [5]. We are demonstrating in this thesis that a specification in

The Steep Nekhoroshev's Theorem

NASA Astrophysics Data System (ADS)

Guzzo, M.; Chierchia, L.; Benettin, G.

2016-03-01

Revising Nekhoroshev's geometry of resonances, we provide a fully constructive and quantitative proof of Nekhoroshev's theorem for steep Hamiltonian systems proving, in particular, that the exponential stability exponent can be taken to be {1/(2nα_1\\cdotsα_{n-2}}) ({α_i}'s being Nekhoroshev's steepness indices and {n ≥ 3} the number of degrees of freedom). On the base of a heuristic argument, we conjecture that the new stability exponent is optimal.

From the necessary to the possible: the genesis of the spin-statistics theorem

NASA Astrophysics Data System (ADS)

Blum, Alexander

2014-12-01

The spin-statistics theorem, which relates the intrinsic angular momentum of a single particle to the type of quantum statistics obeyed by a system of many such particles, is one of the central theorems in quantum field theory and the physics of elementary particles. It was first formulated in 1939/40 by Wolfgang Pauli and his assistant Markus Fierz. This paper discusses the developments that led up to this first formulation, starting from early attempts in the late 1920s to explain why charged matter particles obey Fermi-Dirac statistics, while photons obey Bose-Einstein statistics. It is demonstrated how several important developments paved the way from such general philosophical musings to a general (and provable) theorem, most notably the use of quantum field theory, the discovery of new elementary particles, and the generalization of the notion of spin. It is also discussed how the attempts to prove a spin-statistics connection were driven by Pauli from formal to more physical arguments, culminating in Pauli's 1940 proof. This proof was a major success for the beleaguered theory of quantum field theory and the methods Pauli employed proved essential for the renaissance of quantum field theory and the development of renormalization techniques in the late 1940s.

About the best approximations with trigonometric polynomials on the class W0Hω¯ of the space L, part II

NASA Astrophysics Data System (ADS)

Nikolova, Yanka

2013-12-01

In this paper we obtain estimation for the best approximation En(W0Hω¯) in the L-metric, where W0Hω¯ is the conjugate of the class W0Hω, i.e. W0Hω¯ =def {f¯,f∈W0Hω}. Our results concern evaluations of the function Φ(\\overlineG\\overline;x), where Φ(G;x) is the so-called ∑-representation of the function G, as defined in [2, p.144], and \\overlineG\\overline(x) denotes the conjugate of the function G(x). After some preliminaries, we formulate three basic theorems (Theorems 2, 3, 4) from the first part of this work [9], necessary for the estimation of the functional Fω(g¯) = supf∈Hω ∫ 02πf(t)ṡg¯(t)dt. Specially, in Theorem 4 we prove an inequality for this functional and show that the estimation is exact, i.e. the inequality becomes equality for some specific conjugate functions. Next, the new results in this paper are given as Theorems 5 and 6, with detailed proofs. Furthermore, in our work we prove the following estimation: f¯n,0‖L≤En(W0Hω¯)L≤2f¯n,0‖L.

On the Accuracy and Parallelism of GPGPU-Powered Incremental Clustering Algorithms

PubMed Central

He, Li; Zheng, Hao; Wang, Lei

2017-01-01

Incremental clustering algorithms play a vital role in various applications such as massive data analysis and real-time data processing. Typical application scenarios of incremental clustering raise high demand on computing power of the hardware platform. Parallel computing is a common solution to meet this demand. Moreover, General Purpose Graphic Processing Unit (GPGPU) is a promising parallel computing device. Nevertheless, the incremental clustering algorithm is facing a dilemma between clustering accuracy and parallelism when they are powered by GPGPU. We formally analyzed the cause of this dilemma. First, we formalized concepts relevant to incremental clustering like evolving granularity. Second, we formally proved two theorems. The first theorem proves the relation between clustering accuracy and evolving granularity. Additionally, this theorem analyzes the upper and lower bounds of different-to-same mis-affiliation. Fewer occurrences of such mis-affiliation mean higher accuracy. The second theorem reveals the relation between parallelism and evolving granularity. Smaller work-depth means superior parallelism. Through the proofs, we conclude that accuracy of an incremental clustering algorithm is negatively related to evolving granularity while parallelism is positively related to the granularity. Thus the contradictory relations cause the dilemma. Finally, we validated the relations through a demo algorithm. Experiment results verified theoretical conclusions. PMID:29123546

Surrogate-Assisted Genetic Programming With Simplified Models for Automated Design of Dispatching Rules.

PubMed

Nguyen, Su; Zhang, Mengjie; Tan, Kay Chen

2017-09-01

Automated design of dispatching rules for production systems has been an interesting research topic over the last several years. Machine learning, especially genetic programming (GP), has been a powerful approach to dealing with this design problem. However, intensive computational requirements, accuracy and interpretability are still its limitations. This paper aims at developing a new surrogate assisted GP to help improving the quality of the evolved rules without significant computational costs. The experiments have verified the effectiveness and efficiency of the proposed algorithms as compared to those in the literature. Furthermore, new simplification and visualisation approaches have also been developed to improve the interpretability of the evolved rules. These approaches have shown great potentials and proved to be a critical part of the automated design system.

Tree-oriented interactive processing with an application to theorem-proving, appendix E

NASA Technical Reports Server (NTRS)

Hammerslag, David; Kamin, Samuel N.; Campbell, Roy H.

1985-01-01

The concept of unstructured structure editing and ted, an editor for unstructured trees, is described. Ted is used to manipulate hierarchies of information in an unrestricted manner. The tool was implemented and applied to the problem of organizing formal proofs. As a proof management tool, it maintains the validity of a proof and its constituent lemmas independently from the methods used to validate the proof. It includes an adaptable interface which may be used to invoke theorem provers and other aids to proof construction. Using ted, a user may construct, maintain, and verify formal proofs using a variety of theorem provers, proof checkers, and formatters.

Batch Proving and Proof Scripting in PVS

NASA Technical Reports Server (NTRS)

Munoz, Cesar A.

2007-01-01

The batch execution modes of PVS are powerful, but highly technical, features of the system that are mostly accessible to expert users. This paper presents a PVS tool, called ProofLite, that extends the theorem prover interface with a batch proving utility and a proof scripting notation. ProofLite enables a semi-literate proving style where specification and proof scripts reside in the same file. The goal of ProofLite is to provide batch proving and proof scripting capabilities to regular, non-expert, users of PVS.

Generalized Dandelin’s Theorem

NASA Astrophysics Data System (ADS)

Kheyfets, A. L.

2017-11-01

The paper gives a geometric proof of the theorem which states that in case of the plane section of a second-order surface of rotation (quadrics of rotation, QR), such conics as an ellipse, a hyperbola or a parabola (types of conic sections) are formed. The theorem supplements the well-known Dandelin’s theorem which gives the geometric proof only for a circular cone and applies the proof to all QR, namely an ellipsoid, a hyperboloid, a paraboloid and a cylinder. That’s why the considered theorem is known as the generalized Dandelin’s theorem (GDT). The GDT proof is based on a relatively unknown generalized directrix definition (GDD) of conics. The work outlines the GDD proof for all types of conics as their necessary and sufficient condition. Based on the GDD, the author proves the GDT for all QR in case of a random position of the cutting plane. The graphical stereometric structures necessary for the proof are given. The implementation of the structures by 3d computer methods is considered. The article shows the examples of the builds made in the AutoCAD package. The theorem is intended for the training course of theoretical training of elite student groups of architectural and construction specialties.

Infinite flag varieties and conjugacy theorems

PubMed Central

Peterson, Dale H.; Kac, Victor G.

1983-01-01

We study the orbit of a highest-weight vector in an integrable highest-weight module of the group G associated to a Kac-Moody algebra [unk](A). We obtain applications to the geometric structure of the associated flag varieties and to the algebraic structure of [unk](A). In particular, we prove conjugacy theorems for Cartan and Borel subalgebras of [unk](A), so that the Cartan matrix A is an invariant of [unk](A). PMID:16593298

Verification of the FtCayuga fault-tolerant microprocessor system. Volume 2: Formal specification and correctness theorems

NASA Technical Reports Server (NTRS)

Bickford, Mark; Srivas, Mandayam

1991-01-01

Presented here is a formal specification and verification of a property of a quadruplicately redundant fault tolerant microprocessor system design. A complete listing of the formal specification of the system and the correctness theorems that are proved are given. The system performs the task of obtaining interactive consistency among the processors using a special instruction on the processors. The design is based on an algorithm proposed by Pease, Shostak, and Lamport. The property verified insures that an execution of the special instruction by the processors correctly accomplishes interactive consistency, providing certain preconditions hold, using a computer aided design verification tool, Spectool, and the theorem prover, Clio. A major contribution of the work is the demonstration of a significant fault tolerant hardware design that is mechanically verified by a theorem prover.

Quantum Experimental Data in Psychology and Economics

NASA Astrophysics Data System (ADS)

Aerts, Diederik; D'Hooghe, Bart; Haven, Emmanuel

2010-12-01

We prove a theorem which shows that a collection of experimental data of probabilistic weights related to decisions with respect to situations and their disjunction cannot be modeled within a classical probabilistic weight structure in case the experimental data contain the effect referred to as the ‘disjunction effect’ in psychology. We identify different experimental situations in psychology, more specifically in concept theory and in decision theory, and in economics (namely situations where Savage’s Sure-Thing Principle is violated) where the disjunction effect appears and we point out the common nature of the effect. We analyze how our theorem constitutes a no-go theorem for classical probabilistic weight structures for common experimental data when the disjunction effect is affecting the values of these data. We put forward a simple geometric criterion that reveals the non classicality of the considered probabilistic weights and we illustrate our geometrical criterion by means of experimentally measured membership weights of items with respect to pairs of concepts and their disjunctions. The violation of the classical probabilistic weight structure is very analogous to the violation of the well-known Bell inequalities studied in quantum mechanics. The no-go theorem we prove in the present article with respect to the collection of experimental data we consider has a status analogous to the well known no-go theorems for hidden variable theories in quantum mechanics with respect to experimental data obtained in quantum laboratories. Our analysis puts forward a strong argument in favor of the validity of using the quantum formalism for modeling the considered psychological experimental data as considered in this paper.

A Formally-Verified Decision Procedure for Univariate Polynomial Computation Based on Sturm's Theorem

NASA Technical Reports Server (NTRS)

Narkawicz, Anthony J.; Munoz, Cesar A.

2014-01-01

Sturm's Theorem is a well-known result in real algebraic geometry that provides a function that computes the number of roots of a univariate polynomial in a semiopen interval. This paper presents a formalization of this theorem in the PVS theorem prover, as well as a decision procedure that checks whether a polynomial is always positive, nonnegative, nonzero, negative, or nonpositive on any input interval. The soundness and completeness of the decision procedure is proven in PVS. The procedure and its correctness properties enable the implementation of a PVS strategy for automatically proving existential and universal univariate polynomial inequalities. Since the decision procedure is formally verified in PVS, the soundness of the strategy depends solely on the internal logic of PVS rather than on an external oracle. The procedure itself uses a combination of Sturm's Theorem, an interval bisection procedure, and the fact that a polynomial with exactly one root in a bounded interval is always nonnegative on that interval if and only if it is nonnegative at both endpoints.

Verifying the Modal Logic Cube Is an Easy Task (For Higher-Order Automated Reasoners)

NASA Astrophysics Data System (ADS)

Benzmüller, Christoph

Prominent logics, including quantified multimodal logics, can be elegantly embedded in simple type theory (classical higher-order logic). Furthermore, off-the-shelf reasoning systems for simple type type theory exist that can be uniformly employed for reasoning within and about embedded logics. In this paper we focus on reasoning about modal logics and exploit our framework for the automated verification of inclusion and equivalence relations between them. Related work has applied first-order automated theorem provers for the task. Our solution achieves significant improvements, most notably, with respect to elegance and simplicity of the problem encodings as well as with respect to automation performance.

An extension of the Laplace transform to Schwartz distributions

NASA Technical Reports Server (NTRS)

Price, D. R.

1974-01-01

A characterization of the Laplace transform is developed which extends the transform to the Schwartz distributions. The class of distributions includes the impulse functions and other singular functions which occur as solutions to ordinary and partial differential equations. The standard theorems on analyticity, uniqueness, and invertibility of the transform are proved by using the characterization as the definition of the Laplace transform. The definition uses sequences of linear transformations on the space of distributions which extends the Laplace transform to another class of generalized functions, the Mikusinski operators. It is shown that the sequential definition of the transform is equivalent to Schwartz' extension of the ordinary Laplace transform to distributions but, in contrast to Schwartz' definition, does not use the distributional Fourier transform. Several theorems concerning the particular linear transformations used to define the Laplace transforms are proved. All the results proved in one dimension are extended to the n-dimensional case, but proofs are presented only for those situations that require methods different from their one-dimensional analogs.

Bell - Kochen - Specker theorem for any finite dimension ?

NASA Astrophysics Data System (ADS)

Cabello, Adán; García-Alcaine, Guillermo

1996-03-01

The Bell - Kochen - Specker theorem against non-contextual hidden variables can be proved by constructing a finite set of `totally non-colourable' directions, as Kochen and Specker did in a Hilbert space of dimension n = 3. We generalize Kochen and Specker's set to Hilbert spaces of any finite dimension 0305-4470/29/5/016/img2, in a three-step process that shows the relationship between different kinds of proofs (`continuum', `probabilistic', `state-specific' and `state-independent') of the Bell - Kochen - Specker theorem. At the same time, this construction of a totally non-colourable set of directions in any dimension explicitly solves the question raised by Zimba and Penrose about the existence of such a set for n = 5.

The Penrose dodecahedron revisited

NASA Astrophysics Data System (ADS)

Massad, Jordan E.; Aravind, P. K.

1999-07-01

This paper gives an elementary account of the "Penrose dodecahedron," a set of 40 states of a spin-3/2 particle used by Zimba and Penrose [Stud. Hist. Phil. Sci. 24, 697-720 (1993)] to give a proof of Bell's nonlocality theorem. The Penrose rays are constructed here from the rotation operator of a spin-3/2 particle and the geometry of a dodecahedron, and their orthogonality properties are derived and illustrated from a couple of different viewpoints. After recalling how the proof of Bell's theorem can be reduced to a coloring problem on the Penrose rays, a "proof-tree" argument is used to establish the noncolorability of the Penrose rays and hence prove Bell's theorem.

Wave function for harmonically confined electrons in time-dependent electric and magnetostatic fields.

PubMed

Zhu, Hong-Ming; Chen, Jin-Wang; Pan, Xiao-Yin; Sahni, Viraht

2014-01-14

We derive via the interaction "representation" the many-body wave function for harmonically confined electrons in the presence of a magnetostatic field and perturbed by a spatially homogeneous time-dependent electric field-the Generalized Kohn Theorem (GKT) wave function. In the absence of the harmonic confinement - the uniform electron gas - the GKT wave function reduces to the Kohn Theorem wave function. Without the magnetostatic field, the GKT wave function is the Harmonic Potential Theorem wave function. We further prove the validity of the connection between the GKT wave function derived and the system in an accelerated frame of reference. Finally, we provide examples of the application of the GKT wave function.

ON THE UNIQUENESS OF HAAR SERIES CONVERGENT IN THE METRICS OF L_p\\lbrack0,\\,1\\rbrack, 0, AND IN MEASURE

NASA Astrophysics Data System (ADS)

Talalyan, A. A.

1986-02-01

It is established that if the partial sums S_n(x) of a Haar series \\sum a_n\\chi_n(x) converge to f(x)\\in L_p\\lbrack0,\\,1\\rbrack, 0, at the rate \\int_0^1\\vert S_n-f\\vert^p dx=o(1/n^{1/p}), then f(x) is A-integrable and a_n=(A)\\int_0^1 f(x)\\chi_n(x)dx, for n=1,\\,2,\\,\\dots. Analogous theorems are proved also for the case where Haar series converge in the metric of L_p\\lbrack0,\\,1\\rbrack, 0, over some subsequences of partial sums. The sharpness of these theorems is also proved.Bibliography: 10 titles.

An elementary tutorial on formal specification and verification using PVS

NASA Technical Reports Server (NTRS)

Butler, Ricky W.

1993-01-01

A tutorial on the development of a formal specification and its verification using the Prototype Verification System (PVS) is presented. The tutorial presents the formal specification and verification techniques by way of specific example - an airline reservation system. The airline reservation system is modeled as a simple state machine with two basic operations. These operations are shown to preserve a state invariant using the theorem proving capabilities of PVS. The technique of validating a specification via 'putative theorem proving' is also discussed and illustrated in detail. This paper is intended for the novice and assumes only some of the basic concepts of logic. A complete description of user inputs and the PVS output is provided and thus it can be effectively used while one is sitting at a computer terminal.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Diaz, J. I.; Henry, J.; Ramos, A. M.

We prove the approximate controllability of several nonlinear parabolic boundary-value problems by means of two different methods: the first one can be called a Cancellation method and the second one uses the Kakutani fixed-point theorem.

Nonuniform sampling theorems for random signals in the linear canonical transform domain

NASA Astrophysics Data System (ADS)

Shuiqing, Xu; Congmei, Jiang; Yi, Chai; Youqiang, Hu; Lei, Huang

2018-06-01

Nonuniform sampling can be encountered in various practical processes because of random events or poor timebase. The analysis and applications of the nonuniform sampling for deterministic signals related to the linear canonical transform (LCT) have been well considered and researched, but up to now no papers have been published regarding the various nonuniform sampling theorems for random signals related to the LCT. The aim of this article is to explore the nonuniform sampling and reconstruction of random signals associated with the LCT. First, some special nonuniform sampling models are briefly introduced. Second, based on these models, some reconstruction theorems for random signals from various nonuniform samples associated with the LCT have been derived. Finally, the simulation results are made to prove the accuracy of the sampling theorems. In addition, the latent real practices of the nonuniform sampling for random signals have been also discussed.

Sharp Contradiction for Local-Hidden-State Model in Quantum Steering.

PubMed

Chen, Jing-Ling; Su, Hong-Yi; Xu, Zhen-Peng; Pati, Arun Kumar

2016-08-26

In quantum theory, no-go theorems are important as they rule out the existence of a particular physical model under consideration. For instance, the Greenberger-Horne-Zeilinger (GHZ) theorem serves as a no-go theorem for the nonexistence of local hidden variable models by presenting a full contradiction for the multipartite GHZ states. However, the elegant GHZ argument for Bell's nonlocality does not go through for bipartite Einstein-Podolsky-Rosen (EPR) state. Recent study on quantum nonlocality has shown that the more precise description of EPR's original scenario is "steering", i.e., the nonexistence of local hidden state models. Here, we present a simple GHZ-like contradiction for any bipartite pure entangled state, thus proving a no-go theorem for the nonexistence of local hidden state models in the EPR paradox. This also indicates that the very simple steering paradox presented here is indeed the closest form to the original spirit of the EPR paradox.

Adiabatic Theorem for Quantum Spin Systems

NASA Astrophysics Data System (ADS)

Bachmann, S.; De Roeck, W.; Fraas, M.

2017-08-01

The first proof of the quantum adiabatic theorem was given as early as 1928. Today, this theorem is increasingly applied in a many-body context, e.g., in quantum annealing and in studies of topological properties of matter. In this setup, the rate of variation ɛ of local terms is indeed small compared to the gap, but the rate of variation of the total, extensive Hamiltonian, is not. Therefore, applications to many-body systems are not covered by the proofs and arguments in the literature. In this Letter, we prove a version of the adiabatic theorem for gapped ground states of interacting quantum spin systems, under assumptions that remain valid in the thermodynamic limit. As an application, we give a mathematical proof of Kubo's linear response formula for a broad class of gapped interacting systems. We predict that the density of nonadiabatic excitations is exponentially small in the driving rate and the scaling of the exponent depends on the dimension.

Analytical study of bound states in graphene nanoribbons and carbon nanotubes: The variable phase method and the relativistic Levinson theorem

DOE Office of Scientific and Technical Information (OSTI.GOV)

Miserev, D. S., E-mail: d.miserev@student.unsw.edu.au, E-mail: erazorheader@gmail.com

2016-06-15

The problem of localized states in 1D systems with a relativistic spectrum, namely, graphene stripes and carbon nanotubes, is studied analytically. The bound state as a superposition of two chiral states is completely described by their relative phase, which is the foundation of the variable phase method (VPM) developed herein. Based on our VPM, we formulate and prove the relativistic Levinson theorem. The problem of bound states can be reduced to the analysis of closed trajectories of some vector field. Remarkably, the Levinson theorem appears as the Poincaré index theorem for these closed trajectories. The VPM equation is also reducedmore » to the nonrelativistic and semiclassical limits. The limit of a small momentum p{sub y} of transverse quantization is applicable to an arbitrary integrable potential. In this case, a single confined mode is predicted.« less

Common fixed points in best approximation for Banach operator pairs with Ciric type I-contractions

NASA Astrophysics Data System (ADS)

Hussain, N.

2008-02-01

The common fixed point theorems, similar to those of Ciric [Lj.B. Ciric, On a common fixed point theorem of a Gregus type, Publ. Inst. Math. (Beograd) (N.S.) 49 (1991) 174-178; Lj.B. Ciric, On Diviccaro, Fisher and Sessa open questions, Arch. Math. (Brno) 29 (1993) 145-152; Lj.B. Ciric, On a generalization of Gregus fixed point theorem, Czechoslovak Math. J. 50 (2000) 449-458], Fisher and Sessa [B. Fisher, S. Sessa, On a fixed point theorem of Gregus, Internat. J. Math. Math. Sci. 9 (1986) 23-28], Jungck [G. Jungck, On a fixed point theorem of Fisher and Sessa, Internat. J. Math. Math. Sci. 13 (1990) 497-500] and Mukherjee and Verma [R.N. Mukherjee, V. Verma, A note on fixed point theorem of Gregus, Math. Japon. 33 (1988) 745-749], are proved for a Banach operator pair. As applications, common fixed point and approximation results for Banach operator pair satisfying Ciric type contractive conditions are obtained without the assumption of linearity or affinity of either T or I. Our results unify and generalize various known results to a more general class of noncommuting mappings.

Extrapolation of operators acting into quasi-Banach spaces

NASA Astrophysics Data System (ADS)

Lykov, K. V.

2016-01-01

Linear and sublinear operators acting from the scale of L_p spaces to a certain fixed quasinormed space are considered. It is shown how the extrapolation construction proposed by Jawerth and Milman at the end of 1980s can be used to extend a bounded action of an operator from the L_p scale to wider spaces. Theorems are proved which generalize Yano's extrapolation theorem to the case of a quasinormed target space. More precise results are obtained under additional conditions on the quasinorm. Bibliography: 35 titles.

The Penrose dodecahedron and the Witting polytope are identical in CP3

NASA Astrophysics Data System (ADS)

Waegell, Mordecai; Aravind, P. K.

2017-06-01

The 40 states of a spin-3/2 particle used by Zimba and Penrose to prove the Kochen-Specker and Bell theorems are shown to be identical (i.e., unitarily equivalent) in CP3 to the 40 rays that follow from the vertices of the Witting polytope. The Witting polytope also gives rise to 120 rays in RP7 that give rise to well over a billion parity proofs of the Kochen-Specker theorem. The implications of these results are discussed.

A Note on the Geometry of Kullback-Leibler Information Numbers.

DTIC Science & Technology

1983-04-01

distributions, certain analogies exist between the properties of distributions and Zaclidean *’ geometry. Zn particular, he proved an analogue of Pythagoras ...8217 theorem . Zn this note we extend these geometrical properties by defining the "shortest line" between two distributions and the "aid-pointu of the line...P,R) A similar result holds if both signs are replaced with U signs. 4. Main reslts We •oa pcyv our main theorem , which says that the romential

Area-angular-momentum inequality for axisymmetric black holes.

PubMed

Dain, Sergio; Reiris, Martin

2011-07-29

We prove the local inequality A≥8π|J|, where A and J are the area and angular momentum of any axially symmetric closed stable minimal surface in an axially symmetric maximal initial data. From this theorem it is proved that the inequality is satisfied for any surface on complete asymptotically flat maximal axisymmetric data. In particular it holds for marginal or event horizons of black holes. Hence, we prove the validity of this inequality for all dynamical (not necessarily near equilibrium) axially symmetric black holes.

Constraints on the symmetry noninheriting scalar black hole hair

NASA Astrophysics Data System (ADS)

Smolić, Ivica

2017-01-01

Any recipe to grow black hole hair has to circumvent no-hair theorems by violating some of their assumptions. Recently discovered hairy black hole solutions exist due to the fact that their scalar fields don't inherit the symmetries of the spacetime metric. We present here a general analysis of the constraints which limit the possible forms of such a hair, for both the real and the complex scalar fields. These results can be taken as a novel piece of the black hole uniqueness theorems or simply as a symmetry noninheriting Ansätze guide. In addition, we introduce new classification of the gravitational field equations which might prove useful for various generalizations of the theorems about spacetimes with symmetries.

A Meinardus Theorem with Multiple Singularities

NASA Astrophysics Data System (ADS)

Granovsky, Boris L.; Stark, Dudley

2012-09-01

Meinardus proved a general theorem about the asymptotics of the number of weighted partitions, when the Dirichlet generating function for weights has a single pole on the positive real axis. Continuing (Granovsky et al., Adv. Appl. Math. 41:307-328, 2008), we derive asymptotics for the numbers of three basic types of decomposable combinatorial structures (or, equivalently, ideal gas models in statistical mechanics) of size n, when their Dirichlet generating functions have multiple simple poles on the positive real axis. Examples to which our theorem applies include ones related to vector partitions and quantum field theory. Our asymptotic formula for the number of weighted partitions disproves the belief accepted in the physics literature that the main term in the asymptotics is determined by the rightmost pole.

A Geometrical Approach to Bell's Theorem

NASA Technical Reports Server (NTRS)

Rubincam, David Parry

2000-01-01

Bell's theorem can be proved through simple geometrical reasoning, without the need for the Psi function, probability distributions, or calculus. The proof is based on N. David Mermin's explication of the Einstein-Podolsky-Rosen-Bohm experiment, which involves Stern-Gerlach detectors which flash red or green lights when detecting spin-up or spin-down. The statistics of local hidden variable theories for this experiment can be arranged in colored strips from which simple inequalities can be deduced. These inequalities lead to a demonstration of Bell's theorem. Moreover, all local hidden variable theories can be graphed in such a way as to enclose their statistics in a pyramid, with the quantum-mechanical result lying a finite distance beneath the base of the pyramid.

Bell's Theorem and Einstein's `Spooky Actions' from a Simple Thought Experiment

NASA Astrophysics Data System (ADS)

Kuttner, Fred; Rosenblum, Bruce

2010-02-01

In 1964 John Bell proved a theorem2 allowing the experimental test of whether what Einstein derided as "spooky actions at a distance" actually exist. We will see that they do. Bell's theorem can be displayed with a simple, nonmathematical thought experiment suitable for a physics course at any level. And a simple, semi-classical derivation of the quantum theory result can be given for physics students. These entanglement phenomena are today applied in industrial laboratories and are increasingly discussed in the popular literature. Unfortunately, they are also misappropriated by the purveyors of pseudoscience, something physicists have a responsibility to address.3 Students can be intrigued by the quantum strangeness physics has encountered at a boundary of our discipline.

A Perron-Frobenius type of theorem for quantum operations

NASA Astrophysics Data System (ADS)

Lagro, Matthew

Quantum random walks are a generalization of classical Markovian random walks to a quantum mechanical or quantum computing setting. Quantum walks have promising applications but are complicated by quantum decoherence. We prove that the long-time limiting behavior of the class of quantum operations which are the convex combination of norm one operators is governed by the eigenvectors with norm one eigenvalues which are shared by the operators. This class includes all operations formed by a coherent operation with positive probability of orthogonal measurement at each step. We also prove that any operation that has range contained in a low enough dimension subspace of the space of density operators has limiting behavior isomorphic to an associated Markov chain. A particular class of such operations are coherent operations followed by an orthogonal measurement. Applications of the convergence theorems to quantum walks are given.

A sharp interpolation between the Hölder and Gaussian Young inequalities

NASA Astrophysics Data System (ADS)

da Pelo, Paolo; Lanconelli, Alberto; Stan, Aurel I.

2016-03-01

We prove a very general sharp inequality of the Hölder-Young-type for functions defined on infinite dimensional Gaussian spaces. We begin by considering a family of commutative products for functions which interpolates between the pointwise and Wick products; this family arises naturally in the context of stochastic differential equations, through Wong-Zakai-type approximation theorems, and plays a key role in some generalizations of the Beckner-type Poincaré inequality. We then obtain a crucial integral representation for that family of products which is employed, together with a generalization of the classic Young inequality due to Lieb, to prove our main theorem. We stress that our main inequality contains as particular cases the Hölder inequality and Nelson’s hyper-contractive estimate, thus providing a unified framework for two fundamental results of the Gaussian analysis.

The new electromagnetic tetrads, infinite tetrad nesting and the non-trivial emergence of complex numbers in real theories of gravitation

NASA Astrophysics Data System (ADS)

Garat, Alcides

How complex numbers get into play in a non-trivial way in real theories of gravitation is relevant since in a unified structure they should be able to relate in a natural way with quantum theories. For a long time this issue has been lingering on both relativistic formulations and quantum theories. We will analyze this fundamental subject under the light of new group isomorphism theorems linking local internal groups of transformations and local groups of spacetime transformations. The bridge between these two kinds of transformations is represented by new tetrads introduced previously. It is precisely through these local tetrad structures that we will provide a non-trivial answer to this old issue. These new tetrads have two fundamental building components, the skeletons and the gauge vectors. It is these constructive elements that provide the mathematical support that allows to prove group isomorphism theorems. In addition to this, we will prove a unique new property, the infinite tetrad nesting, alternating the nesting with non-Abelian tetrads in the construction of the tetrad gauge vectors. As an application we will demonstrate an alternative proof of a new group isomorphism theorem.

KinoHaptics: An Automated, Wearable, Haptic Assisted, Physio-therapeutic System for Post-surgery Rehabilitation and Self-care.

PubMed

Rajanna, Vijay; Vo, Patrick; Barth, Jerry; Mjelde, Matthew; Grey, Trevor; Oduola, Cassandra; Hammond, Tracy

2016-03-01

A carefully planned, structured, and supervised physiotherapy program, following a surgery, is crucial for the successful diagnosis of physical injuries. Nearly 50 % of the surgeries fail due to unsupervised, and erroneous physiotherapy. The demand for a physiotherapist for an extended period is expensive to afford, and sometimes inaccessible. Researchers have tried to leverage the advancements in wearable sensors and motion tracking by building affordable, automated, physio-therapeutic systems that direct a physiotherapy session by providing audio-visual feedback on patient's performance. There are many aspects of automated physiotherapy program which are yet to be addressed by the existing systems: a wide classification of patients' physiological conditions to be diagnosed, multiple demographics of the patients (blind, deaf, etc.), and the need to pursue patients to adopt the system for an extended period for self-care. In our research, we have tried to address these aspects by building a health behavior change support system called KinoHaptics, for post-surgery rehabilitation. KinoHaptics is an automated, wearable, haptic assisted, physio-therapeutic system that can be used by a wide variety of demographics and for various physiological conditions of the patients. The system provides rich and accurate vibro-haptic feedback that can be felt by the user, irrespective of the physiological limitations. KinoHaptics is built to ensure that no injuries are induced during the rehabilitation period. The persuasive nature of the system allows for personal goal-setting, progress tracking, and most importantly life-style compatibility. The system was evaluated under laboratory conditions, involving 14 users. Results show that KinoHaptics is highly convenient to use, and the vibro-haptic feedback is intuitive, accurate, and has shown to prevent accidental injuries. Also, results show that KinoHaptics is persuasive in nature as it supports behavior change and habit building. The successful acceptance of KinoHaptics, an automated, wearable, haptic assisted, physio-therapeutic system proves the need and future-scope of automated physio-therapeutic systems for self-care and behavior change. It also proves that such systems incorporated with vibro-haptic feedback encourage strong adherence to the physiotherapy program; can have profound impact on the physiotherapy experience resulting in higher acceptance rate.

Proceedings of the First NASA Formal Methods Symposium

NASA Technical Reports Server (NTRS)

Denney, Ewen (Editor); Giannakopoulou, Dimitra (Editor); Pasareanu, Corina S. (Editor)

2009-01-01

Topics covered include: Model Checking - My 27-Year Quest to Overcome the State Explosion Problem; Applying Formal Methods to NASA Projects: Transition from Research to Practice; TLA+: Whence, Wherefore, and Whither; Formal Methods Applications in Air Transportation; Theorem Proving in Intel Hardware Design; Building a Formal Model of a Human-Interactive System: Insights into the Integration of Formal Methods and Human Factors Engineering; Model Checking for Autonomic Systems Specified with ASSL; A Game-Theoretic Approach to Branching Time Abstract-Check-Refine Process; Software Model Checking Without Source Code; Generalized Abstract Symbolic Summaries; A Comparative Study of Randomized Constraint Solvers for Random-Symbolic Testing; Component-Oriented Behavior Extraction for Autonomic System Design; Automated Verification of Design Patterns with LePUS3; A Module Language for Typing by Contracts; From Goal-Oriented Requirements to Event-B Specifications; Introduction of Virtualization Technology to Multi-Process Model Checking; Comparing Techniques for Certified Static Analysis; Towards a Framework for Generating Tests to Satisfy Complex Code Coverage in Java Pathfinder; jFuzz: A Concolic Whitebox Fuzzer for Java; Machine-Checkable Timed CSP; Stochastic Formal Correctness of Numerical Algorithms; Deductive Verification of Cryptographic Software; Coloured Petri Net Refinement Specification and Correctness Proof with Coq; Modeling Guidelines for Code Generation in the Railway Signaling Context; Tactical Synthesis Of Efficient Global Search Algorithms; Towards Co-Engineering Communicating Autonomous Cyber-Physical Systems; and Formal Methods for Automated Diagnosis of Autosub 6000.

Formalization of the Integral Calculus in the PVS Theorem Prover

NASA Technical Reports Server (NTRS)

Butler, Ricky W.

2004-01-01

The PVS Theorem prover is a widely used formal verification tool used for the analysis of safety-critical systems. The PVS prover, though fully equipped to support deduction in a very general logic framework, namely higher-order logic, it must nevertheless, be augmented with the definitions and associated theorems for every branch of mathematics and Computer Science that is used in a verification. This is a formidable task, ultimately requiring the contributions of researchers and developers all over the world. This paper reports on the formalization of the integral calculus in the PVS theorem prover. All of the basic definitions and theorems covered in a first course on integral calculus have been completed.The theory and proofs were based on Rosenlicht's classic text on real analysis and follow the traditional epsilon-delta method. The goal of this work was to provide a practical set of PVS theories that could be used for verification of hybrid systems that arise in air traffic management systems and other aerospace applications. All of the basic linearity, integrability, boundedness, and continuity properties of the integral calculus were proved. The work culminated in the proof of the Fundamental Theorem Of Calculus. There is a brief discussion about why mechanically checked proofs are so much longer than standard mathematics textbook proofs.

Automated Decellularization of Intact, Human-Sized Lungs for Tissue Engineering

PubMed Central

Price, Andrew P.; Godin, Lindsay M.; Domek, Alex; Cotter, Trevor; D'Cunha, Jonathan; Taylor, Doris A.

2015-01-01

We developed an automated system that can be used to decellularize whole human-sized organs and have shown lung as an example. Lungs from 20 to 30 kg pigs were excised en bloc with the trachea and decellularized with our established protocol of deionized water, detergents, sodium chloride, and porcine pancreatic DNase. A software program was written to control a valve manifold assembly that we built for selection and timing of decellularization fluid perfusion through the airway and the vasculature. This system was interfaced with a prototypic bioreactor chamber that was connected to another program, from a commercial source, which controlled the volume and flow pressure of fluids. Lung matrix that was decellularized by the automated method was compared to a manual method previously used by us and others. Automation resulted in more consistent acellular matrix preparations as demonstrated by measuring levels of DNA, hydroxyproline (collagen), elastin, laminin, and glycosaminoglycans. It also proved highly beneficial in saving time as the decellularization procedure was reduced from days down to just 24 h. Developing a rapid, controllable, automated system for production of reproducible matrices in a closed system is a major step forward in whole-organ tissue engineering. PMID:24826875

A no-go theorem for monodromy inflation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Andriot, David, E-mail: david.andriot@aei.mpg.de

2016-03-01

We study the embedding of the monodromy inflation mechanism by E. Silverstein and A. Westphal (2008) in a concrete compactification setting. To that end, we look for an appropriate vacuum of type IIA supergravity, corresponding to the minimum of the inflaton potential. We prove a no-go theorem on the existence of such a vacuum, using ten-dimensional equations of motion. Anti-de Sitter and Minkowski vacua are ruled out; de Sitter vacua are not excluded, but have a lower bound on their cosmological constant which is too high for phenomenology.

The generalized Lyapunov theorem and its application to quantum channels

NASA Astrophysics Data System (ADS)

Burgarth, Daniel; Giovannetti, Vittorio

2007-05-01

We give a simple and physically intuitive necessary and sufficient condition for a map acting on a compact metric space to be mixing (i.e. infinitely many applications of the map transfer any input into a fixed convergency point). This is a generalization of the 'Lyapunov direct method'. First we prove this theorem in topological spaces and for arbitrary continuous maps. Finally we apply our theorem to maps which are relevant in open quantum systems and quantum information, namely quantum channels. In this context, we also discuss the relations between mixing and ergodicity (i.e. the property that there exists only a single input state which is left invariant by a single application of the map) showing that the two are equivalent when the invariant point of the ergodic map is pure.

On the divergence of triangular and eccentric spherical sums of double Fourier series

DOE Office of Scientific and Technical Information (OSTI.GOV)

Karagulyan, G A

We construct a continuous function on the torus with almost everywhere divergent triangular sums of double Fourier series. We also prove an analogous theorem for eccentric spherical sums. Bibliography: 14 titles.

Photoelectric effect from observer's mathematics point of view

NASA Astrophysics Data System (ADS)

Khots, Boris; Khots, Dmitriy

2014-12-01

When we consider and analyze physical events with the purpose of creating corresponding models we often assume that the mathematical apparatus used in modeling is infallible. In particular, this relates to the use of infinity in various aspects and the use of Newton's definition of a limit in analysis. We believe that is where the main problem lies in contemporary study of nature. This work considers Physical aspects in a setting of arithmetic, algebra, geometry, analysis, topology provided by Observer's Mathematics (see www.mathrelativity.com). Certain results and communications pertaining to solution of these problems are provided. In particular, we prove the following Theorems, which give Observer's Mathematics point of view on Einstein photoelectric effect theory and Lamb-Scully and Hanbury-Brown-Twiss experiments: Theorem 1. There are some values of light intensity where anticorrelation parameter A ∈ [0,1). Theorem 2. There are some values of light intensity where anticorrelation parameter A = 1. Theorem 3. There are some values of light intensity where anticorrelation parameter A > 1.

Sharp Contradiction for Local-Hidden-State Model in Quantum Steering

PubMed Central

Chen, Jing-Ling; Su, Hong-Yi; Xu, Zhen-Peng; Pati, Arun Kumar

2016-01-01

In quantum theory, no-go theorems are important as they rule out the existence of a particular physical model under consideration. For instance, the Greenberger-Horne-Zeilinger (GHZ) theorem serves as a no-go theorem for the nonexistence of local hidden variable models by presenting a full contradiction for the multipartite GHZ states. However, the elegant GHZ argument for Bell’s nonlocality does not go through for bipartite Einstein-Podolsky-Rosen (EPR) state. Recent study on quantum nonlocality has shown that the more precise description of EPR’s original scenario is “steering”, i.e., the nonexistence of local hidden state models. Here, we present a simple GHZ-like contradiction for any bipartite pure entangled state, thus proving a no-go theorem for the nonexistence of local hidden state models in the EPR paradox. This also indicates that the very simple steering paradox presented here is indeed the closest form to the original spirit of the EPR paradox. PMID:27562658

Sharp Contradiction for Local-Hidden-State Model in Quantum Steering

NASA Astrophysics Data System (ADS)

Chen, Jing-Ling; Su, Hong-Yi; Xu, Zhen-Peng; Pati, Arun Kumar

2016-08-01

In quantum theory, no-go theorems are important as they rule out the existence of a particular physical model under consideration. For instance, the Greenberger-Horne-Zeilinger (GHZ) theorem serves as a no-go theorem for the nonexistence of local hidden variable models by presenting a full contradiction for the multipartite GHZ states. However, the elegant GHZ argument for Bell’s nonlocality does not go through for bipartite Einstein-Podolsky-Rosen (EPR) state. Recent study on quantum nonlocality has shown that the more precise description of EPR’s original scenario is “steering”, i.e., the nonexistence of local hidden state models. Here, we present a simple GHZ-like contradiction for any bipartite pure entangled state, thus proving a no-go theorem for the nonexistence of local hidden state models in the EPR paradox. This also indicates that the very simple steering paradox presented here is indeed the closest form to the original spirit of the EPR paradox.

On Nash Equilibrium and Evolutionarily Stable States That Are Not Characterised by the Folk Theorem

PubMed Central

Li, Jiawei; Kendall, Graham

2015-01-01

In evolutionary game theory, evolutionarily stable states are characterised by the folk theorem because exact solutions to the replicator equation are difficult to obtain. It is generally assumed that the folk theorem, which is the fundamental theory for non-cooperative games, defines all Nash equilibria in infinitely repeated games. Here, we prove that Nash equilibria that are not characterised by the folk theorem do exist. By adopting specific reactive strategies, a group of players can be better off by coordinating their actions in repeated games. We call it a type-k equilibrium when a group of k players coordinate their actions and they have no incentive to deviate from their strategies simultaneously. The existence and stability of the type-k equilibrium in general games is discussed. This study shows that the sets of Nash equilibria and evolutionarily stable states have greater cardinality than classic game theory has predicted in many repeated games. PMID:26288088

An innovative approach to compensator design

NASA Technical Reports Server (NTRS)

Mitchell, J. R.

1972-01-01

The primary goal is to present for a control system a computer-aided-compensator design technique from a frequency domain point of view. The thesis for developing this technique is to describe the open loop frequency response by n discrete frequency points which result in n functions of the compensator coefficients. Several of these functions are chosen so that the system specifications are properly portrayed; then mathematical programming is used to improve all of these functions which have values below minimum standards. In order to do this several definitions in regard to measuring the performance of a system in the frequency domain are given. Next, theorems which govern the number of compensator coefficients necessary to make improvements in a certain number of functions are proved. After this a mathematical programming tool for aiding in the solution of the problem is developed. Then for applying the constraint improvement algorithm generalized gradients for the constraints are derived. Finally, the necessary theory is incorporated in a computer program called CIP (compensator improvement program).

Natural differential operations on manifolds: an algebraic approach

NASA Astrophysics Data System (ADS)

Katsylo, P. I.; Timashev, D. A.

2008-10-01

Natural algebraic differential operations on geometric quantities on smooth manifolds are considered. A method for the investigation and classification of such operations is described, the method of IT-reduction. With it the investigation of natural operations reduces to the analysis of rational maps between k-jet spaces, which are equivariant with respect to certain algebraic groups. On the basis of the method of IT-reduction a finite generation theorem is proved: for tensor bundles \\mathscr{V},\\mathscr{W}\\to M all the natural differential operations D\\colon\\Gamma(\\mathscr{V})\\to\\Gamma(\\mathscr{W}) of degree at most d can be algebraically constructed from some finite set of such operations. Conceptual proofs of known results on the classification of natural linear operations on arbitrary and symplectic manifolds are presented. A non-existence theorem is proved for natural deformation quantizations on Poisson manifolds and symplectic manifolds.Bibliography: 21 titles.

Quantum steganography with large payload based on entanglement swapping of χ-type entangled states

NASA Astrophysics Data System (ADS)

Qu, Zhi-Guo; Chen, Xiu-Bo; Luo, Ming-Xing; Niu, Xin-Xin; Yang, Yi-Xian

2011-04-01

In this paper, we firstly propose a new simple method to calculate entanglement swapping of χ-type entangled states, and then present a novel quantum steganography protocol with large payload. The new protocol adopts entanglement swapping to build up the hidden channel within quantum secure direct communication with χ-type entangled states for securely transmitting secret messages. Comparing with the previous quantum steganographies, the capacity of the hidden channel is much higher, which is increased to eight bits. Meanwhile, due to the quantum uncertainty theorem and the no-cloning theorem its imperceptibility is proved to be great in the analysis, and its security is also analyzed in detail, which is proved that intercept-resend attack, measurement-resend attack, ancilla attack, man-in-the-middle attack or even Dos(Denial of Service) attack couldn't threaten it. As a result, the protocol can be applied in various fields of quantum communication.

On classical mechanical systems with non-linear constraints

NASA Astrophysics Data System (ADS)

Terra, Gláucio; Kobayashi, Marcelo H.

2004-03-01

In the present work, we analyze classical mechanical systems with non-linear constraints in the velocities. We prove that the d'Alembert-Chetaev trajectories of a constrained mechanical system satisfy both Gauss' principle of least constraint and Hölder's principle. In the case of a free mechanics, they also satisfy Hertz's principle of least curvature if the constraint manifold is a cone. We show that the Gibbs-Maggi-Appell (GMA) vector field (i.e. the second-order vector field which defines the d'Alembert-Chetaev trajectories) conserves energy for any potential energy if, and only if, the constraint is homogeneous (i.e. if the Liouville vector field is tangent to the constraint manifold). We introduce the Jacobi-Carathéodory metric tensor and prove Jacobi-Carathéodory's theorem assuming that the constraint manifold is a cone. Finally, we present a version of Liouville's theorem on the conservation of volume for the flow of the GMA vector field.

No-go theorem for passive single-rail linear optical quantum computing.

PubMed

Wu, Lian-Ao; Walther, Philip; Lidar, Daniel A

2013-01-01

Photonic quantum systems are among the most promising architectures for quantum computers. It is well known that for dual-rail photons effective non-linearities and near-deterministic non-trivial two-qubit gates can be achieved via the measurement process and by introducing ancillary photons. While in principle this opens a legitimate path to scalable linear optical quantum computing, the technical requirements are still very challenging and thus other optical encodings are being actively investigated. One of the alternatives is to use single-rail encoded photons, where entangled states can be deterministically generated. Here we prove that even for such systems universal optical quantum computing using only passive optical elements such as beam splitters and phase shifters is not possible. This no-go theorem proves that photon bunching cannot be passively suppressed even when extra ancilla modes and arbitrary number of photons are used. Our result provides useful guidance for the design of optical quantum computers.

About the best approximations with trigonometric polynomials on the class W0Hω¯ of the space L, part I

NASA Astrophysics Data System (ADS)

Nikolova, Yanka

2012-11-01

In this paper we obtain estimation for the best approximation En(W0Hω)¯ in the L-metric, where W0Hω¯ is the conjugate of the class W0Hω, i.e. W0Hω¯def = {f¯,f∈W0Hω}. Our results concern evaluations of the function Φ(Ḡ; x) where Φ(G; x) is the so-called Σ-representation of the function G, as defined in [2, p. 144], and Ḡ(x) denotes the conjugate of the function G(x). We prove three theorems, necessary for the estimation of the functional Fω(ḡ) = sup/f∈Hω ∫ 02πf(t).ḡ(t)dt. Specially, in Theorem 4 we prove an inequality for this functional and show that estimation is exact, i.e. the inequality becomes equality for some specific conjugate functions.

Theoretical and Empirical Studies on Using Program Mutation to Test the Functional Correctness of Programs.

DTIC Science & Technology

1980-02-01

implemented to test ANSI FORTRAN set D3. Using theorem 6 we then have programs. In building real testing tools for Theorem 18 : The recursion constructors...constants, scalar in theorems 10, 15, 16, and 18 , then Q must be variables, and array references) times the number equivalent to P. of unique data...for j,,rd1s longer thlan a fixed .1; 0. erot 2., .12.’Ie 1). Ullman2. li21122 arnd isolates and plrints each telegram along hI 2 .. 222.2.J~12.2.1 It

'Einselection' of pointer observables: The new H-theorem?

NASA Astrophysics Data System (ADS)

Kastner, Ruth E.

2014-11-01

In attempting to derive irreversible macroscopic thermodynamics from reversible microscopic dynamics, Boltzmann inadvertently smuggled in a premise that assumed the very irreversibility he was trying to prove: 'molecular chaos'. The program of 'einselection' (environmentally induced superselection) within Everettian approaches faces a similar 'Loschmidt's Paradox': the universe, according to the Everettian picture, is a closed system obeying only unitary dynamics, and it therefore contains no distinguishable environmental subsystems with the necessary 'phase randomness' to effect einselection of a pointer observable. The theoretically unjustified assumption of distinguishable environmental subsystems is the hidden premise that makes the derivation of einselection circular. In effect, it presupposes the 'emergent' structures from the beginning. Thus the problem of basis ambiguity remains unsolved in Everettian interpretations.

Geometrical and quantum mechanical aspects in observers' mathematics

NASA Astrophysics Data System (ADS)

Khots, Boris; Khots, Dmitriy

2013-10-01

When we create mathematical models for Quantum Mechanics we assume that the mathematical apparatus used in modeling, at least the simplest mathematical apparatus, is infallible. In particular, this relates to the use of "infinitely small" and "infinitely large" quantities in arithmetic and the use of Newton Cauchy definitions of a limit and derivative in analysis. We believe that is where the main problem lies in contemporary study of nature. We have introduced a new concept of Observer's Mathematics (see www.mathrelativity.com). Observer's Mathematics creates new arithmetic, algebra, geometry, topology, analysis and logic which do not contain the concept of continuum, but locally coincide with the standard fields. We prove that Euclidean Geometry works in sufficiently small neighborhood of the given line, but when we enlarge the neighborhood, non-euclidean Geometry takes over. We prove that the physical speed is a random variable, cannot exceed some constant, and this constant does not depend on an inertial coordinate system. We proved the following theorems: Theorem A (Lagrangian). Let L be a Lagrange function of free material point with mass m and speed v. Then the probability P of L = m 2 v2 is less than 1: P(L = m 2 v2) < 1. Theorem B (Nadezhda effect). On the plane (x, y) on every line y = kx there is a point (x0, y0) with no existing Euclidean distance between origin (0, 0) and this point. Conjecture (Black Hole). Our space-time nature is a black hole: light cannot go out infinitely far from origin.

Discrete Jordan curve theorem

NASA Astrophysics Data System (ADS)

Chen, Li

1999-09-01

According to a general definition of discrete curves, surfaces, and manifolds (Li Chen, 'Generalized discrete object tracking algorithms and implementations, ' In Melter, Wu, and Latecki ed, Vision Geometry VI, SPIE Vol. 3168, pp 184 - 195, 1997.). This paper focuses on the Jordan curve theorem in 2D discrete spaces. The Jordan curve theorem says that a (simply) closed curve separates a simply connected surface into two components. Based on the definition of discrete surfaces, we give three reasonable definitions of simply connected spaces. Theoretically, these three definition shall be equivalent. We have proved the Jordan curve theorem under the third definition of simply connected spaces. The Jordan theorem shows the relationship among an object, its boundary, and its outside area. In continuous space, the boundary of an mD manifold is an (m - 1)D manifold. The similar result does apply to regular discrete manifolds. The concept of a new regular nD-cell is developed based on the regular surface point in 2D, and well-composed objects in 2D and 3D given by Latecki (L. Latecki, '3D well-composed pictures,' In Melter, Wu, and Latecki ed, Vision Geometry IV, SPIE Vol 2573, pp 196 - 203, 1995.).

A grounded theory of abstraction in artificial intelligence.

PubMed

Zucker, Jean-Daniel

2003-07-29

In artificial intelligence, abstraction is commonly used to account for the use of various levels of details in a given representation language or the ability to change from one level to another while preserving useful properties. Abstraction has been mainly studied in problem solving, theorem proving, knowledge representation (in particular for spatial and temporal reasoning) and machine learning. In such contexts, abstraction is defined as a mapping between formalisms that reduces the computational complexity of the task at stake. By analysing the notion of abstraction from an information quantity point of view, we pinpoint the differences and the complementary role of reformulation and abstraction in any representation change. We contribute to extending the existing semantic theories of abstraction to be grounded on perception, where the notion of information quantity is easier to characterize formally. In the author's view, abstraction is best represented using abstraction operators, as they provide semantics for classifying different abstractions and support the automation of representation changes. The usefulness of a grounded theory of abstraction in the cartography domain is illustrated. Finally, the importance of explicitly representing abstraction for designing more autonomous and adaptive systems is discussed.

Computer programming in the UK undergraduate mathematics curriculum

NASA Astrophysics Data System (ADS)

Sangwin, Christopher J.; O'Toole, Claire

2017-11-01

This paper reports a study which investigated the extent to which undergraduate mathematics students in the United Kingdom are currently taught to programme a computer as a core part of their mathematics degree programme. We undertook an online survey, with significant follow-up correspondence, to gather data on current curricula and received replies from 46 (63%) of the departments who teach a BSc mathematics degree. We found that 78% of BSc degree courses in mathematics included computer programming in a compulsory module but 11% of mathematics degree programmes do not teach programming to all their undergraduate mathematics students. In 2016, programming is most commonly taught to undergraduate mathematics students through imperative languages, notably MATLAB, using numerical analysis as the underlying (or parallel) mathematical subject matter. Statistics is a very popular choice in optional courses, using the package R. Computer algebra systems appear to be significantly less popular for compulsory first-year courses than a decade ago, and there was no mention of logic programming, functional programming or automatic theorem proving software. The modal form of assessment of computing modules is entirely by coursework (i.e. no examination).

The scalar glueball operator, the a-theorem, and the onset of conformality

NASA Astrophysics Data System (ADS)

Nunes da Silva, T.; Pallante, E.; Robroek, L.

2018-03-01

We show that the anomalous dimension γG of the scalar glueball operator contains information on the mechanism that leads to the onset of conformality at the lower edge of the conformal window in a non-Abelian gauge theory. In particular, it distinguishes whether the merging of an UV and an IR fixed point - the simplest mechanism associated to a conformal phase transition and preconformal scaling - does or does not occur. At the same time, we shed light on new analogies between QCD and its supersymmetric version. In SQCD, we derive an exact relation between γG and the mass anomalous dimension γm, and we prove that the SQCD exact beta function is incompatible with merging as a consequence of the a-theorem; we also derive the general conditions that the latter imposes on the existence of fixed points, and prove the absence of an UV fixed point at nonzero coupling above the conformal window of SQCD. Perhaps not surprisingly, we then show that an exact relation between γG and γm, fully analogous to SQCD, holds for the massless Veneziano limit of large-N QCD. We argue, based on the latter relation, the a-theorem, perturbation theory and physical arguments, that the incompatibility with merging may extend to QCD.

The precautionary principle is incoherent.

PubMed

Peterson, Martin

2006-06-01

This article argues that no version of the precautionary principle can be reasonably applied to decisions that may lead to fatal outcomes. In support of this strong claim, a number of desiderata are proposed, which reasonable rules for rational decision making ought to satisfy. Thereafter, two impossibility theorems are proved, showing that no version of the precautionary principle can satisfy the proposed desiderata. These theorems are directly applicable to recent discussions of the precautionary principle in medicine, biotechnology, environmental management, and related fields. The impossibility theorems do not imply, however, that the precautionary principle is of no relevance at all in policy discussions. Even if it is not a reasonable rule for rational decision making, it is possible to interpret the precautionary principle in other ways, e.g., as an argumentative tool or as an epistemic principle favoring a reversed burden of proof.

The automatic human

NASA Technical Reports Server (NTRS)

Billings, Charles

1991-01-01

An overview is presented of the growth and role of automation in civil aircraft operations for both cockpit management and ground control. NASA has initiated a research program centered on furthering automation and developing a consistent and rational philosophy of human centered aircraft and air traffic control automation. Introduction of the NASA Aviation Safety Reporting System (ASRS) has proved successful in bringing together pilots and ground controllers to report incidents of operational anomalies that can then be analyzed, leading to corrective action to prevent similar reoccurrences. Attention is given to the growing trend of extensive automation in the cockpit that appears to be leading to a diminution of management control of the aircraft by the decreasing number of flight crew members. A majority of reports indicate that there is a serious mismatch between new aircraft capabilities and ATC procedures, which were designed for older aircraft. ASRS has also kept research oriented toward real problems and community needs.

Instrumentation Analysis: An Automated Method for Producing Numeric Abstractions of Heap-Manipulating Programs

DTIC Science & Technology

2010-11-29

Arbib and Suad Alagic. Proof rules for gotos. Acta Informatica , pages 139–148, 1979. 6.3 T. Ball, R. Majumdar, T. Millstein, and S. Rajamani...Press, January 1999. ISBN 0262032708. 3, 3.1, 3.3 323 B Bibliography M. Clint and C.A.R. Hoare. Program proving: Jumps and functions. Acta Informatica ...Goto statements: Semantics and deduction systems. Acta Informatica , pages 385–424, 1981. 6.3 324 B Bibliography Alain Deutsch. Interprocedural may

Nonextensive kinetic theory and H-theorem in general relativity

NASA Astrophysics Data System (ADS)

Santos, A. P.; Silva, R.; Alcaniz, J. S.; Lima, J. A. S.

2017-11-01

The nonextensive kinetic theory for degenerate quantum gases is discussed in the general relativistic framework. By incorporating nonadditive modifications in the collisional term of the relativistic Boltzmann equation and entropy current, it is shown that Tsallis entropic framework satisfies a H-theorem in the presence of gravitational fields. Consistency with the 2nd law of thermodynamics is obtained only whether the entropic q-parameter lies in the interval q ∈ [ 0 , 2 ] . As occurs in the absence of gravitational fields, it is also proved that the local collisional equilibrium is described by the extended Bose-Einstein (Fermi-Dirac) q-distributions.

No-go theorem for iterations of unknown quantum gates

NASA Astrophysics Data System (ADS)

Soleimanifar, Mehdi; Karimipour, Vahid

2016-01-01

We propose a no-go theorem by proving the impossibility of constructing a deterministic quantum circuit that iterates a unitary oracle by calling it only once. Different schemes are provided to bypass this result and to approximately realize the iteration. The optimal scheme is also studied. An interesting observation is that for a large number of iterations, a trivial strategy like using the identity channel has the optimal performance, and preprocessing, postprocessing, or using resources like entanglement does not help at all. Intriguingly, the number of iterations, when being large enough, does not affect the performance of the proposed schemes.

The fundamental theorem of asset pricing under default and collateral in finite discrete time

NASA Astrophysics Data System (ADS)

Alvarez-Samaniego, Borys; Orrillo, Jaime

2006-08-01

We consider a financial market where time and uncertainty are modeled by a finite event-tree. The event-tree has a length of N, a unique initial node at the initial date, and a continuum of branches at each node of the tree. Prices and returns of J assets are modeled, respectively, by a R2JxR2J-valued stochastic process . In this framework we prove a version of the Fundamental Theorem of Asset Pricing which applies to defaultable securities backed by exogenous collateral suffering a contingent linear depreciation.

An Integrable Approximation for the Fermi Pasta Ulam Lattice

NASA Astrophysics Data System (ADS)

Rink, Bob

This contribution presents a review of results obtained from computations of approximate equations of motion for the Fermi-Pasta-Ulam lattice. These approximate equations are obtained as a finite-dimensional Birkhoff normal form. It turns out that in many cases, the Birkhoff normal form is suitable for application of the KAM theorem. In particular, this proves Nishida's 1971 conjecture stating that almost all low-energetic motions of the anharmonic Fermi-Pasta-Ulam lattice with fixed endpoints are quasi-periodic. The proof is based on the formal Birkhoff normal form computations of Nishida, the KAM theorem and discrete symmetry considerations.

A tensor Banach algebra approach to abstract kinetic equations

NASA Astrophysics Data System (ADS)

Greenberg, W.; van der Mee, C. V. M.

The study deals with a concrete algebraic construction providing the existence theory for abstract kinetic equation boundary-value problems, when the collision operator A is an accretive finite-rank perturbation of the identity operator in a Hilbert space H. An algebraic generalization of the Bochner-Phillips theorem is utilized to study solvability of the abstract boundary-value problem without any regulatory condition. A Banach algebra in which the convolution kernel acts is obtained explicitly, and this result is used to prove a perturbation theorem for bisemigroups, which then plays a vital role in solving the initial equations.

No-Ghost Theorem for Neveu-Schwarz String in 0-Picture

NASA Astrophysics Data System (ADS)

Kohriki, M.; Kunitomo, H.; Murata, M.

2010-12-01

The no-ghost theorem for Neveu-Schwarz string is directly proved in 0-picture. The one-to-one correspondence between physical states in 0-picture and in the conventional (-1)-picture is confirmed. It is shown that a nontrivial metric consistent with the BRST cohomology is needed to define a positive semidefinite norm in the physical Hilbert space. As a by-product, we find a new inverse picture-changing operator, which is noncovariant but has a nonsingular operator product with itself. A possibility to construct a new gauge-invariant superstring field theory is discussed.

Manned systems utilization analysis (study 2.1). Volume 3: LOVES computer simulations, results, and analyses

NASA Technical Reports Server (NTRS)

Stricker, L. T.

1975-01-01

The LOVES computer program was employed to analyze the geosynchronous portion of the NASA's 1973 automated satellite mission model from 1980 to 1990. The objectives of the analyses were: (1) to demonstrate the capability of the LOVES code to provide the depth and accuracy of data required to support the analyses; and (2) to tradeoff the concept of space servicing automated satellites composed of replaceable modules against the concept of replacing expendable satellites upon failure. The computer code proved to be an invaluable tool in analyzing the logistic requirements of the various test cases required in the tradeoff. It is indicated that the concept of space servicing offers the potential for substantial savings in the cost of operating automated satellite systems.

Artificial Intelligence: Underlying Assumptions and Basic Objectives.

ERIC Educational Resources Information Center

Cercone, Nick; McCalla, Gordon

1984-01-01

Presents perspectives on methodological assumptions underlying research efforts in artificial intelligence (AI) and charts activities, motivations, methods, and current status of research in each of the major AI subareas: natural language understanding; computer vision; expert systems; search, problem solving, planning; theorem proving and logic…

Global Classical Solutions for MHD System

NASA Astrophysics Data System (ADS)

Casella, E.; Secchi, P.; Trebeschi, P.

In this paper we study the equations of magneto-hydrodynamics for a 2D incompressible ideal fluid in the exterior domain and in the half-plane. We prove the existence of a global classical solution in Hölder spaces, by applying Shauder fixed point theorem.

On special Lie algebras having a faithful module with Krull dimension

NASA Astrophysics Data System (ADS)

Pikhtilkova, O. A.; Pikhtilkov, S. A.

2017-02-01

For special Lie algebras we prove an analogue of Markov's theorem on {PI}-algebras having a faithful module with Krull dimension: the solubility of the prime radical. We give an example of a semiprime Lie algebra that has a faithful module with Krull dimension but cannot be represented as a subdirect product of finitely many prime Lie algebras. We prove a criterion for a semiprime Lie algebra to be representable as such a subdirect product.

Evolution families of conformal mappings with fixed points and the Löwner-Kufarev equation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Goryainov, V V

2015-01-31

The paper is concerned with evolution families of conformal mappings of the unit disc to itself that fix an interior point and a boundary point. Conditions are obtained for the evolution families to be differentiable, and an existence and uniqueness theorem for an evolution equation is proved. A convergence theorem is established which describes the topology of locally uniform convergence of evolution families in terms of infinitesimal generating functions. The main result in this paper is the embedding theorem which shows that any conformal mapping of the unit disc to itself with two fixed points can be embedded into a differentiable evolution familymore » of such mappings. This result extends the range of the parametric method in the theory of univalent functions. In this way the problem of the mutual change of the derivative at an interior point and the angular derivative at a fixed point on the boundary is solved for a class of mappings of the unit disc to itself. In particular, the rotation theorem is established for this class of mappings. Bibliography: 27 titles.« less

Limit Theory for Panel Data Models with Cross Sectional Dependence and Sequential Exogeneity.

PubMed

Kuersteiner, Guido M; Prucha, Ingmar R

2013-06-01

The paper derives a general Central Limit Theorem (CLT) and asymptotic distributions for sample moments related to panel data models with large n . The results allow for the data to be cross sectionally dependent, while at the same time allowing the regressors to be only sequentially rather than strictly exogenous. The setup is sufficiently general to accommodate situations where cross sectional dependence stems from spatial interactions and/or from the presence of common factors. The latter leads to the need for random norming. The limit theorem for sample moments is derived by showing that the moment conditions can be recast such that a martingale difference array central limit theorem can be applied. We prove such a central limit theorem by first extending results for stable convergence in Hall and Hedye (1980) to non-nested martingale arrays relevant for our applications. We illustrate our result by establishing a generalized estimation theory for GMM estimators of a fixed effect panel model without imposing i.i.d. or strict exogeneity conditions. We also discuss a class of Maximum Likelihood (ML) estimators that can be analyzed using our CLT.

The Knaster-Kuratowski-Mazurkiewicz theorem and abstract convexities

NASA Astrophysics Data System (ADS)

Cain, George L., Jr.; González, Luis

2008-02-01

The Knaster-Kuratowski-Mazurkiewicz covering theorem (KKM), is the basic ingredient in the proofs of many so-called "intersection" theorems and related fixed point theorems (including the famous Brouwer fixed point theorem). The KKM theorem was extended from Rn to Hausdorff linear spaces by Ky Fan. There has subsequently been a plethora of attempts at extending the KKM type results to arbitrary topological spaces. Virtually all these involve the introduction of some sort of abstract convexity structure for a topological space, among others we could mention H-spaces and G-spaces. We have introduced a new abstract convexity structure that generalizes the concept of a metric space with a convex structure, introduced by E. Michael in [E. Michael, Convex structures and continuous selections, Canad. J. MathE 11 (1959) 556-575] and called a topological space endowed with this structure an M-space. In an article by Shie Park and Hoonjoo Kim [S. Park, H. Kim, Coincidence theorems for admissible multifunctions on generalized convex spaces, J. Math. Anal. Appl. 197 (1996) 173-187], the concepts of G-spaces and metric spaces with Michael's convex structure, were mentioned together but no kind of relationship was shown. In this article, we prove that G-spaces and M-spaces are close related. We also introduce here the concept of an L-space, which is inspired in the MC-spaces of J.V. Llinares [J.V. Llinares, Unified treatment of the problem of existence of maximal elements in binary relations: A characterization, J. Math. Econom. 29 (1998) 285-302], and establish relationships between the convexities of these spaces with the spaces previously mentioned.

Brill-Noether theory for vector bundles on projective curves

NASA Astrophysics Data System (ADS)

Ballico, E.

1998-11-01

In this paper we will study the Brill-Noether theory of vector bundles on a smooth projective curve X. As usual in papers on this topic we are mainly interested in stable or at least semistable bundles. Let Wkr, d(X) be the scheme of all stable vector bundles E on X with rank (E)=r, deg (E)=d and h0(X, E)[gt-or-equal, slanted]k+1. For a survey of the main known results, see the introduction of [6]. The referee has pointed out that the results in [6] were improved by V. Mercat in [14]; he proved that Wkr, d(X) is non-empty for d<2r if and only if k+1[less-than-or-eq, slant]r+(d[minus sign]r)/g. If X has general moduli the more interesting existence theorem was proved in [19]. However, in this paper we are mainly interested in very special curves X, e.g. the hyperelliptic or the bielliptic curves. We work over an algebraically closed base field K. In Section 5 we will assume char (K)=0. In Section 1 we will give some theorems of Clifford's type. In Section 2 we will construct several stable bundles with certain properties. Here the main tool is an operation (the +elementary transformation) which sends a vector bundle E on X to another vector bundle E[prime prime or minute] with rank (E[prime prime or minute])=rank (E) and deg (E[prime prime or minute])=deg (E)+1 (see Section 2 for its definition and its elementary properties). Using the +elementary transformations in Section 3 we will prove the following existence theorem which covers the case of a ‘small’ number of sections.

The nodal count {0,1,2,3,…} implies the graph is a tree

PubMed Central

Band, Ram

2014-01-01

Sturm's oscillation theorem states that the nth eigenfunction of a Sturm–Liouville operator on the interval has n−1 zeros (nodes) (Sturm 1836 J. Math. Pures Appl. 1, 106–186; 373–444). This result was generalized for all metric tree graphs (Pokornyĭ et al. 1996 Mat. Zametki 60, 468–470 (doi:10.1007/BF02320380); Schapotschnikow 2006 Waves Random Complex Media 16, 167–178 (doi:10.1080/1745530600702535)) and an analogous theorem was proved for discrete tree graphs (Berkolaiko 2007 Commun. Math. Phys. 278, 803–819 (doi:10.1007/S00220-007-0391-3); Dhar & Ramaswamy 1985 Phys. Rev. Lett. 54, 1346–1349 (doi:10.1103/PhysRevLett.54.1346); Fiedler 1975 Czechoslovak Math. J. 25, 607–618). We prove the converse theorems for both discrete and metric graphs. Namely if for all n, the nth eigenfunction of the graph has n−1 zeros, then the graph is a tree. Our proofs use a recently obtained connection between the graph's nodal count and the magnetic stability of its eigenvalues (Berkolaiko 2013 Anal. PDE 6, 1213–1233 (doi:10.2140/apde.2013.6.1213); Berkolaiko & Weyand 2014 Phil. Trans. R. Soc. A 372, 20120522 (doi:10.1098/rsta.2012.0522); Colin de Verdière 2013 Anal. PDE 6, 1235–1242 (doi:10.2140/apde.2013.6.1235)). In the course of the proof, we show that it is not possible for all (or even almost all, in the metric case) the eigenvalues to exhibit a diamagnetic behaviour. In addition, we develop a notion of ‘discretized’ versions of a metric graph and prove that their nodal counts are related to those of the metric graph. PMID:24344337

A coverage and slicing dependencies analysis for seeking software security defects.

PubMed

He, Hui; Zhang, Dongyan; Liu, Min; Zhang, Weizhe; Gao, Dongmin

2014-01-01

Software security defects have a serious impact on the software quality and reliability. It is a major hidden danger for the operation of a system that a software system has some security flaws. When the scale of the software increases, its vulnerability has becoming much more difficult to find out. Once these vulnerabilities are exploited, it may lead to great loss. In this situation, the concept of Software Assurance is carried out by some experts. And the automated fault localization technique is a part of the research of Software Assurance. Currently, automated fault localization method includes coverage based fault localization (CBFL) and program slicing. Both of the methods have their own location advantages and defects. In this paper, we have put forward a new method, named Reverse Data Dependence Analysis Model, which integrates the two methods by analyzing the program structure. On this basis, we finally proposed a new automated fault localization method. This method not only is automation lossless but also changes the basic location unit into single sentence, which makes the location effect more accurate. Through several experiments, we proved that our method is more effective. Furthermore, we analyzed the effectiveness among these existing methods and different faults.

Synchronous Control Method and Realization of Automated Pharmacy Elevator

NASA Astrophysics Data System (ADS)

Liu, Xiang-Quan

Firstly, the control method of elevator's synchronous motion is provided, the synchronous control structure of double servo motor based on PMAC is accomplished. Secondly, synchronous control program of elevator is implemented by using PMAC linear interpolation motion model and position error compensation method. Finally, the PID parameters of servo motor were adjusted. The experiment proves the control method has high stability and reliability.

Long time existence from interior gluing

NASA Astrophysics Data System (ADS)

Chruściel, Piotr T.

2017-07-01

We prove completeness-to-the-future of null hypersurfaces emanating outwards from large spheres, in vacuum space-times evolving from general asymptotically flat data with well-defined energy-momentum. The proof uses scaling and a gluing construction to reduce the problem to Bieri’s stability theorem.

Euclid and Descartes: A Partnership.

ERIC Educational Resources Information Center

Wasdovich, Dorothy Hoy

1991-01-01

Presented is a method of reorganizing a high school geometry course to integrate coordinate geometry together with Euclidean geometry at an earlier stage in the course, thus enabling students to prove subsequent theorems from either perspective. Several examples contrasting different proofs from both perspectives are provided. (MDH)

On the solubility of certain classes of non-linear integral equations in p-adic string theory

NASA Astrophysics Data System (ADS)

Khachatryan, Kh. A.

2018-04-01

We study classes of non-linear integral equations that have immediate application to p-adic mathematical physics and to cosmology. We prove existence and uniqueness theorems for non-trivial solutions in the space of bounded functions.

A mechanized process algebra for verification of device synchronization protocols

NASA Technical Reports Server (NTRS)

Schubert, E. Thomas

1992-01-01

We describe the formalization of a process algebra based on CCS within the Higher Order Logic (HOL) theorem-proving system. The representation of four types of device interactions and a correctness proof of the communication between a microprocessor and MMU is presented.

On Row Rank Equal Column Rank

ERIC Educational Resources Information Center

Khalili, Parviz

2009-01-01

We will prove a well-known theorem in Linear Algebra, that is, for any "m x n" matrix the dimension of row space and column space are the same. The proof is based on the subject of "elementary matrices" and "reduced row-echelon" form of a matrix.

Weak ergodicity of population evolution processes.

PubMed

Inaba, H

1989-10-01

The weak ergodic theorems of mathematical demography state that the age distribution of a closed population is asymptotically independent of the initial distribution. In this paper, we provide a new proof of the weak ergodic theorem of the multistate population model with continuous time. The main tool to attain this purpose is a theory of multiplicative processes, which was mainly developed by Garrett Birkhoff, who showed that ergodic properties generally hold for an appropriate class of multiplicative processes. First, we construct a general theory of multiplicative processes on a Banach lattice. Next, we formulate a dynamical model of a multistate population and show that its evolution operator forms a multiplicative process on the state space of the population. Subsequently, we investigate a sufficient condition that guarantees the weak ergodicity of the multiplicative process. Finally, we prove the weak and strong ergodic theorems for the multistate population and resolve the consistency problem.

Structure of rapidity divergences in multi-parton scattering soft factors

NASA Astrophysics Data System (ADS)

Vladimirov, Alexey

2018-04-01

We discuss the structure of rapidity divergences that are presented in the soft factors of transverse momentum dependent (TMD) factorization theorems. To provide the discussion on the most general level we consider soft factors for multi-parton scattering. We show that the rapidity divergences are result of the gluon exchanges with the distant transverse plane, and are structurally equivalent to the ultraviolet divergences. It allows to formulate and to prove the renormalization theorem for rapidity divergences. The proof is made with the help the conformal transformation which maps rapidity divergences to ultraviolet divergences. The theorem is the systematic form of the factorization of rapidity divergences, which is required for the definition of TMD parton distributions. In particular, the definition of multi parton distributions is presented. The equivalence of ultraviolet and rapidity divergences leads to the exact relation between soft and rapidity anomalous dimensions. Using this relation we derive the rapidity anomalous dimension at the three-loop order.

Entropy Inequalities for Stable Densities and Strengthened Central Limit Theorems

NASA Astrophysics Data System (ADS)

Toscani, Giuseppe

2016-10-01

We consider the central limit theorem for stable laws in the case of the standardized sum of independent and identically distributed random variables with regular probability density function. By showing decay of different entropy functionals along the sequence we prove convergence with explicit rate in various norms to a Lévy centered density of parameter λ >1 . This introduces a new information-theoretic approach to the central limit theorem for stable laws, in which the main argument is shown to be the relative fractional Fisher information, recently introduced in Toscani (Ricerche Mat 65(1):71-91, 2016). In particular, it is proven that, with respect to the relative fractional Fisher information, the Lévy density satisfies an analogous of the logarithmic Sobolev inequality, which allows to pass from the monotonicity and decay to zero of the relative fractional Fisher information in the standardized sum to the decay to zero in relative entropy with an explicit decay rate.

The Adiabatic Theorem and Linear Response Theory for Extended Quantum Systems

NASA Astrophysics Data System (ADS)

Bachmann, Sven; De Roeck, Wojciech; Fraas, Martin

2018-03-01

The adiabatic theorem refers to a setup where an evolution equation contains a time-dependent parameter whose change is very slow, measured by a vanishing parameter ɛ. Under suitable assumptions the solution of the time-inhomogenous equation stays close to an instantaneous fixpoint. In the present paper, we prove an adiabatic theorem with an error bound that is independent of the number of degrees of freedom. Our setup is that of quantum spin systems where the manifold of ground states is separated from the rest of the spectrum by a spectral gap. One important application is the proof of the validity of linear response theory for such extended, genuinely interacting systems. In general, this is a long-standing mathematical problem, which can be solved in the present particular case of a gapped system, relevant e.g. for the integer quantum Hall effect.

Radiating black hole solutions in Einstein-Gauss-Bonnet gravity

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dominguez, Alfredo E.; Instituto Universitario Aeronautico, Avenida Fuerza Aerea km 6.5.; Gallo, Emanuel

2006-03-15

In this paper, we find some new exact solutions to the Einstein-Gauss-Bonnet equations. First, we prove a theorem which allows us to find a large family of solutions to the Einstein-Gauss-Bonnet gravity in n-dimensions. This family of solutions represents dynamic black holes and contains, as particular cases, not only the recently found Vaidya-Einstein-Gauss-Bonnet black hole, but also other physical solutions that we think are new, such as the Gauss-Bonnet versions of the Bonnor-Vaidya (de Sitter/anti-de Sitter) solution, a global monopole, and the Husain black holes. We also present a more general version of this theorem in which less restrictive conditionsmore » on the energy-momentum tensor are imposed. As an application of this theorem, we present the exact solution describing a black hole radiating a charged null fluid in a Born-Infeld nonlinear electrodynamics.« less

A double commutant theorem for Murray–von Neumann algebras

PubMed Central

Liu, Zhe

2012-01-01

Murray–von Neumann algebras are algebras of operators affiliated with finite von Neumann algebras. In this article, we study commutativity and affiliation of self-adjoint operators (possibly unbounded). We show that a maximal abelian self-adjoint subalgebra of the Murray–von Neumann algebra associated with a finite von Neumann algebra is the Murray–von Neumann algebra , where is a maximal abelian self-adjoint subalgebra of and, in addition, is . We also prove that the Murray–von Neumann algebra with the center of is the center of the Murray–von Neumann algebra . Von Neumann’s celebrated double commutant theorem characterizes von Neumann algebras as those for which , where , the commutant of , is the set of bounded operators on the Hilbert space that commute with all operators in . At the end of this article, we present a double commutant theorem for Murray–von Neumann algebras. PMID:22543165

DOE Office of Scientific and Technical Information (OSTI.GOV)

Witzel, Wayne; Rudinger, Kenneth Michael; Sarovar, Mohan

Using a novel formal methods approach, we have generated computer-veri ed proofs of major theorems pertinent to the quantum phase estimation algorithm. This was accomplished using our Prove-It software package in Python. While many formal methods tools are available, their practical utility is limited. Translating a problem of interest into these systems and working through the steps of a proof is an art form that requires much expertise. One must surrender to the preferences and restrictions of the tool regarding how mathematical notions are expressed and what deductions are allowed. Automation is a major driver that forces restrictions. Our focus,more » on the other hand, is to produce a tool that allows users the ability to con rm proofs that are essentially known already. This goal is valuable in itself. We demonstrate the viability of our approach that allows the user great exibility in expressing state- ments and composing derivations. There were no major obstacles in following a textbook proof of the quantum phase estimation algorithm. There were tedious details of algebraic manipulations that we needed to implement (and a few that we did not have time to enter into our system) and some basic components that we needed to rethink, but there were no serious roadblocks. In the process, we made a number of convenient additions to our Prove-It package that will make certain algebraic manipulations easier to perform in the future. In fact, our intent is for our system to build upon itself in this manner.« less

From EUCLID to Ptolemy in English Crop Circles

NASA Astrophysics Data System (ADS)

Hawkins, G. S.

1997-12-01

The late Lord Soli Zuckerman, science advisor to several British governments, encouraged the author, an astronomer, to test the theory that all crop circles were made by hoaxers. Within the hundreds of formations in Southern England he saw a thread of surprising historical content at the intellectual level of College Dons. One diagram in celestial mechanics involved triple conjunctions of Mercury, Venus and Mars every 67 2/3 years. Ptolemy's fourth musical scale, tense diatonic, occurred in the circles during the period 1978-88. Starting on E, Ptolemaic ratios make our perfect diatonic scale of white notes on the keyboard of the piano or church organ. For separated circles the ratio was given by diameters, and for concentric circles it was diameters squared. A series of rotationally symmetric figures began in 1988 which combined Ptolemy's ratios with Euclid's theorems. In his last plane theorem, Euclid (Elements 13,12) proved that the square on the side of an equilateral triangle is 3 times the square on the circum-circle radius -- diatonic note G(2). From the 1988 figure one can prove the square on the side is 16/3 times the square on the semi-altitude, giving note F(3). Later rotational figures over the next 5 years led to diatonic ratios for the hexagon, square and triangle. They gave with the exactness of Euclidean theorems the notes F, C(2) and E(2), and they are the only regular polygons to do so. Although these 4 crop theorems derive from Euclid, they were previously unknown as a set in the literature, nor had the Ptolemaic connection been published. Professional magazines asked the readers to provide a fifth theorem that would generate the above 4 theorems, but none was forthcoming. Ultimately the cicle makers showed knowledge of this generating theorem using a 200-ft design at Litchfield, Hampshire. After 1993, rotationally symmetric geometries continued to appear, but with much more complicated patterns. One design showed 6 crescent moons in a hexagon with cusps set on 2 concentric circles defining the note A(2). Here the mathematical level required application of Ptolemy's famous theorem of chords to confirm the A(2) ratio of exactly 10/3. The chords were the side of a hexagon joined to the side of a pentagon. We confirm Zuckerman's suggestion that there is a strong thread of expertise in the phenomenon worthy of scientific interest, and it spans a 20-year period. He asks: Why do they use a wheat field, and "how do they maintain their hidden identities?" Their type of knowledge rests in the past, and is not frequently found in the contemporary educational system.

Polyhedral sweeping processes with unbounded nonconvex-valued perturbation

NASA Astrophysics Data System (ADS)

Tolstonogov, A. A.

2017-12-01

A polyhedral sweeping process with a multivalued perturbation whose values are nonconvex unbounded sets is studied in a separable Hilbert space. Polyhedral sweeping processes do not satisfy the traditional assumptions used to prove existence theorems for convex sweeping processes. We consider the polyhedral sweeping process as an evolution inclusion with subdifferential operators depending on time. The widely used assumption of Lipschitz continuity for the multivalued perturbation term is replaced by a weaker notion of (ρ - H) Lipschitzness. The existence of solutions is proved for this sweeping process.

An innovative approach to compensator design

NASA Technical Reports Server (NTRS)

Mitchell, J. R.; Mcdaniel, W. L., Jr.

1973-01-01

The design is considered of a computer-aided-compensator for a control system from a frequency domain point of view. The design technique developed is based on describing the open loop frequency response by n discrete frequency points which result in n functions of the compensator coefficients. Several of these functions are chosen so that the system specifications are properly portrayed; then mathematical programming is used to improve all of these functions which have values below minimum standards. To do this, several definitions in regard to measuring the performance of a system in the frequency domain are given, e.g., relative stability, relative attenuation, proper phasing, etc. Next, theorems which govern the number of compensator coefficients necessary to make improvements in a certain number of functions are proved. After this a mathematical programming tool for aiding in the solution of the problem is developed. This tool is called the constraint improvement algorithm. Then for applying the constraint improvement algorithm generalized, gradients for the constraints are derived. Finally, the necessary theory is incorporated in a Computer program called CIP (compensator Improvement Program). The practical usefulness of CIP is demonstrated by two large system examples.

Explaining quantum correlations through evolution of causal models

NASA Astrophysics Data System (ADS)

Harper, Robin; Chapman, Robert J.; Ferrie, Christopher; Granade, Christopher; Kueng, Richard; Naoumenko, Daniel; Flammia, Steven T.; Peruzzo, Alberto

2017-04-01

We propose a framework for the systematic and quantitative generalization of Bell's theorem using causal networks. We first consider the multiobjective optimization problem of matching observed data while minimizing the causal effect of nonlocal variables and prove an inequality for the optimal region that both strengthens and generalizes Bell's theorem. To solve the optimization problem (rather than simply bound it), we develop a genetic algorithm treating as individuals causal networks. By applying our algorithm to a photonic Bell experiment, we demonstrate the trade-off between the quantitative relaxation of one or more local causality assumptions and the ability of data to match quantum correlations.

A stability theorem for energy-balance climate models

NASA Technical Reports Server (NTRS)

Cahalan, R. F.; North, G. R.

1979-01-01

The paper treats the stability of steady-state solutions of some simple, latitude-dependent, energy-balance climate models. For north-south symmetric solutions of models with an ice-cap-type albedo feedback, and for the sum of horizontal transport and infrared radiation given by a linear operator, it is possible to prove a 'slope stability' theorem, i.e., if the local slope of the steady-state iceline latitude versus solar constant curve is positive (negative) the steady-state solution is stable (unstable). Certain rather weak restrictions on the albedo function and on the heat transport are required for the proof, and their physical basis is discussed.

A theorem regarding roots of the zero-order Bessel function of the first kind

NASA Technical Reports Server (NTRS)

Lin, X.-A.; Agrawal, O. P.

1993-01-01

This paper investigates a problem on the steady-state, conduction-convection heat transfer process in cylindrical porous heat exchangers. The governing partial differential equations for the system are obtained using the energy conservation law. Solution of these equations and the concept of enthalpy lead to a new approach to prove a theorem that the sum of inverse squares of all the positive roots of the zero order Bessel function of the first kind equals to one-forth. As a corollary, it is shown that the sum of one over pth power (p greater than or equal to 2) of the roots converges to some constant.

Formal hardware verification of digital circuits

NASA Technical Reports Server (NTRS)

Joyce, J.; Seger, C.-J.

1991-01-01

The use of formal methods to verify the correctness of digital circuits is less constrained by the growing complexity of digital circuits than conventional methods based on exhaustive simulation. This paper briefly outlines three main approaches to formal hardware verification: symbolic simulation, state machine analysis, and theorem-proving.

Automated Verification of Design Patterns with LePUS3

NASA Technical Reports Server (NTRS)

Nicholson, Jonathan; Gasparis, Epameinondas; Eden, Ammon H.; Kazman, Rick

2009-01-01

Specification and [visual] modelling languages are expected to combine strong abstraction mechanisms with rigour, scalability, and parsimony. LePUS3 is a visual, object-oriented design description language axiomatized in a decidable subset of the first-order predicate logic. We demonstrate how LePUS3 is used to formally specify a structural design pattern and prove ( verify ) whether any JavaTM 1.4 program satisfies that specification. We also show how LePUS3 specifications (charts) are composed and how they are verified fully automatically in the Two-Tier Programming Toolkit.

2×2 systems of conservation laws with L data

NASA Astrophysics Data System (ADS)

Bianchini, Stefano; Colombo, Rinaldo M.; Monti, Francesca

Consider a hyperbolic system of conservation laws with genuinely nonlinear characteristic fields. We extend the classical Glimm-Lax (1970) result [13, Theorem 5.1] proving the existence of solutions for L initial datum, relaxing the assumptions taken therein on the geometry of the shock-rarefaction curves.

Nonlinear Fourier algorithm applied to solving equations of gravitational gas dynamics

NASA Technical Reports Server (NTRS)

Kolosov, B. I.

1979-01-01

Two dimensional gas flow problems were reduced to an approximating system of common differential equations, which were solved by a standard procedure of the Runge-Kutta type. A theorem of the existence of stationary conical shock waves with the cone vertex in the gravitating center was proved.

CONTRIBUTION TO THE THEORY OF MATRICES PARTITIONED INTO BLOCKS.

DTIC Science & Technology

results were obtained on cones of matrices and vectors, and an extension of the well-known Perron - Frobenius theorem was proved. Also a necessary and...sufficient condition was derived, in order that to a given matrix corresponds a cone on which it is a positive operator. Easily computed upper and

Semi-classical analysis and pseudo-spectra

NASA Astrophysics Data System (ADS)

Davies, E. B.

We prove an approximate spectral theorem for non-self-adjoint operators and investigate its applications to second-order differential operators in the semi-classical limit. This leads to the construction of a twisted FBI transform. We also investigate the connections between pseudo-spectra and boundary conditions in the semi-classical limit.

A Note on Hamiltonian Graphs

ERIC Educational Resources Information Center

Skurnick, Ronald; Davi, Charles; Skurnick, Mia

2005-01-01

Since 1952, several well-known graph theorists have proven numerous results regarding Hamiltonian graphs. In fact, many elementary graph theory textbooks contain the theorems of Ore, Bondy and Chvatal, Chvatal and Erdos, Posa, and Dirac, to name a few. In this note, the authors state and prove some propositions of their own concerning Hamiltonian…

Using Computer-Assisted Multiple Representations in Learning Geometry Proofs

ERIC Educational Resources Information Center

Wong, Wing-Kwong; Yin, Sheng-Kai; Yang, Hsi-Hsun; Cheng, Ying-Hao

2011-01-01

Geometry theorem proving involves skills that are difficult to learn. Instead of working with abstract and complicated representations, students might start with concrete, graphical representations. A proof tree is a graphical representation of a formal proof, with each node representing a proposition or given conditions. A computer-assisted…

Proof of Nishida's Conjecture on Anharmonic Lattices

NASA Astrophysics Data System (ADS)

Rink, Bob

2006-02-01

We prove Nishida's 1971 conjecture stating that almost all low-energetic motions of the anharmonic Fermi-Pasta-Ulam lattice with fixed endpoints are quasi-periodic. The proof is based on the formal computations of Nishida, the KAM theorem, discrete symmetry considerations and an algebraic trick that considerably simplifies earlier results.

Homoclinic orbits and critical points of barrier functions

NASA Astrophysics Data System (ADS)

Cannarsa, Piermarco; Cheng, Wei

2015-06-01

We interpret the close link between the critical points of Mather's barrier functions and minimal homoclinic orbits with respect to the Aubry sets on {{T}}n . We also prove a critical point theorem for barrier functions and the existence of such homoclinic orbits on {{T}}2 as an application.

Synthesizing Certified Code

NASA Technical Reports Server (NTRS)

Whalen, Michael; Schumann, Johann; Fischer, Bernd

2002-01-01

Code certification is a lightweight approach to demonstrate software quality on a formal level. Its basic idea is to require producers to provide formal proofs that their code satisfies certain quality properties. These proofs serve as certificates which can be checked independently. Since code certification uses the same underlying technology as program verification, it also requires many detailed annotations (e.g., loop invariants) to make the proofs possible. However, manually adding theses annotations to the code is time-consuming and error-prone. We address this problem by combining code certification with automatic program synthesis. We propose an approach to generate simultaneously, from a high-level specification, code and all annotations required to certify generated code. Here, we describe a certification extension of AUTOBAYES, a synthesis tool which automatically generates complex data analysis programs from compact specifications. AUTOBAYES contains sufficient high-level domain knowledge to generate detailed annotations. This allows us to use a general-purpose verification condition generator to produce a set of proof obligations in first-order logic. The obligations are then discharged using the automated theorem E-SETHEO. We demonstrate our approach by certifying operator safety for a generated iterative data classification program without manual annotation of the code.

Kohn's theorem in a superfluid Fermi gas with a Feshbach resonance

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ohashi, Y.

2004-12-01

We investigate the dipole mode in a superfluid gas of Fermi atoms trapped in a harmonic potential. According to Kohn's theorem, the frequency of this collective mode is not affected by an interaction between the atoms and is always equal to the trap frequency. This remarkable property, however, does not necessarily hold in an approximate theory. We explicitly prove that the Hartree-Fock-Bogoliubov generalized random phase approximation (HFB-GRPA), including a coupling between fluctuations in the density and Cooper channels, is consistent with both Kohn's theorem as well as Goldstone's theorem. This proof can be immediately extended to the strong-coupling superfluid theorymore » developed by Nozieres and Schmitt-Rink (NSR), where the effect of superfluid fluctuations is included within the Gaussian level. As a result, the NSR-GRPA formalism can be used to study collective modes in the BCS-BEC crossover region in a manner which is consistent with Kohn's theorem. We also include the effect of a Feshbach resonance and a condensate of the associated molecular bound states. A detailed discussion is given of the unusual nature of the Kohn mode eigenfunctions in a Fermi superfluid, in the presence and absence of a Feshbach resonance. When the molecular bosons feel a different trap frequency from the Fermi atoms, the dipole frequency is shown to depend on the strength of effective interaction associated with the Feshbach resonance.« less

Analysis of irradiated U-7wt%Mo dispersion fuel microstructures using automated image processing

DOE PAGES

Collette, R.; King, J.; Buesch, C.; ...

2016-04-01

The High Performance Research Reactor Fuel Development (HPPRFD) program is responsible for developing low enriched uranium (LEU) fuel substitutes for high performance reactors fueled with highly enriched uranium (HEU) that have not yet been converted to LEU. The uranium-molybdenum (U-Mo) fuel system was selected for this effort. In this study, fission gas pore segmentation was performed on U-7wt%Mo dispersion fuel samples at three separate fission densities using an automated image processing interface developed in MATLAB. Pore size distributions were attained that showed both expected and unexpected fission gas behavior. In general, it proved challenging to identify any dominant trends whenmore » comparing fission bubble data across samples from different fuel plates due to varying compositions and fabrication techniques. Here, the results exhibited fair agreement with the fission density vs. porosity correlation developed by the Russian reactor conversion program.« less

Analysis of irradiated U-7wt%Mo dispersion fuel microstructures using automated image processing

DOE Office of Scientific and Technical Information (OSTI.GOV)

Collette, R.; King, J.; Buesch, C.

The High Performance Research Reactor Fuel Development (HPPRFD) program is responsible for developing low enriched uranium (LEU) fuel substitutes for high performance reactors fueled with highly enriched uranium (HEU) that have not yet been converted to LEU. The uranium-molybdenum (U-Mo) fuel system was selected for this effort. In this study, fission gas pore segmentation was performed on U-7wt%Mo dispersion fuel samples at three separate fission densities using an automated image processing interface developed in MATLAB. Pore size distributions were attained that showed both expected and unexpected fission gas behavior. In general, it proved challenging to identify any dominant trends whenmore » comparing fission bubble data across samples from different fuel plates due to varying compositions and fabrication techniques. Here, the results exhibited fair agreement with the fission density vs. porosity correlation developed by the Russian reactor conversion program.« less

A grounded theory of abstraction in artificial intelligence.

PubMed Central

Zucker, Jean-Daniel

2003-01-01

In artificial intelligence, abstraction is commonly used to account for the use of various levels of details in a given representation language or the ability to change from one level to another while preserving useful properties. Abstraction has been mainly studied in problem solving, theorem proving, knowledge representation (in particular for spatial and temporal reasoning) and machine learning. In such contexts, abstraction is defined as a mapping between formalisms that reduces the computational complexity of the task at stake. By analysing the notion of abstraction from an information quantity point of view, we pinpoint the differences and the complementary role of reformulation and abstraction in any representation change. We contribute to extending the existing semantic theories of abstraction to be grounded on perception, where the notion of information quantity is easier to characterize formally. In the author's view, abstraction is best represented using abstraction operators, as they provide semantics for classifying different abstractions and support the automation of representation changes. The usefulness of a grounded theory of abstraction in the cartography domain is illustrated. Finally, the importance of explicitly representing abstraction for designing more autonomous and adaptive systems is discussed. PMID:12903672

Limit Theory for Panel Data Models with Cross Sectional Dependence and Sequential Exogeneity

PubMed Central

Kuersteiner, Guido M.; Prucha, Ingmar R.

2013-01-01

The paper derives a general Central Limit Theorem (CLT) and asymptotic distributions for sample moments related to panel data models with large n. The results allow for the data to be cross sectionally dependent, while at the same time allowing the regressors to be only sequentially rather than strictly exogenous. The setup is sufficiently general to accommodate situations where cross sectional dependence stems from spatial interactions and/or from the presence of common factors. The latter leads to the need for random norming. The limit theorem for sample moments is derived by showing that the moment conditions can be recast such that a martingale difference array central limit theorem can be applied. We prove such a central limit theorem by first extending results for stable convergence in Hall and Hedye (1980) to non-nested martingale arrays relevant for our applications. We illustrate our result by establishing a generalized estimation theory for GMM estimators of a fixed effect panel model without imposing i.i.d. or strict exogeneity conditions. We also discuss a class of Maximum Likelihood (ML) estimators that can be analyzed using our CLT. PMID:23794781

What are the ultimate limits to computational techniques: verifier theory and unverifiability

NASA Astrophysics Data System (ADS)

Yampolskiy, Roman V.

2017-09-01

Despite significant developments in proof theory, surprisingly little attention has been devoted to the concept of proof verifiers. In particular, the mathematical community may be interested in studying different types of proof verifiers (people, programs, oracles, communities, superintelligences) as mathematical objects. Such an effort could reveal their properties, their powers and limitations (particularly in human mathematicians), minimum and maximum complexity, as well as self-verification and self-reference issues. We propose an initial classification system for verifiers and provide some rudimentary analysis of solved and open problems in this important domain. Our main contribution is a formal introduction of the notion of unverifiability, for which the paper could serve as a general citation in domains of theorem proving, as well as software and AI verification.

Applications of square-related theorems

NASA Astrophysics Data System (ADS)

Srinivasan, V. K.

2014-04-01

The square centre of a given square is the point of intersection of its two diagonals. When two squares of different side lengths share the same square centre, there are in general four diagonals that go through the same square centre. The Two Squares Theorem developed in this paper summarizes some nice theoretical conclusions that can be obtained when two squares of different side lengths share the same square centre. These results provide the theoretical basis for two of the constructions given in the book of H.S. Hall and F.H. Stevens , 'A Shorter School Geometry, Part 1, Metric Edition'. In page 134 of this book, the authors present, in exercise 4, a practical construction which leads to a verification of the Pythagorean theorem. Subsequently in Theorems 29 and 30, the authors present the standard proofs of the Pythagorean theorem and its converse. In page 140, the authors present, in exercise 15, what amounts to a geometric construction, whose verification involves a simple algebraic identity. Both the constructions are of great importance and can be replicated by using the standard equipment provided in a 'geometry toolbox' carried by students in high schools. The author hopes that the results proved in this paper, in conjunction with the two constructions from the above-mentioned book, would provide high school students an appreciation of the celebrated theorem of Pythagoras. The diagrams that accompany this document are based on the free software GeoGebra. The author formally acknowledges his indebtedness to the creators of this free software at the end of this document.

A Proof of Factorization Theorem of Drell-Yan Process at Operator Level

NASA Astrophysics Data System (ADS)

Zhou, Gao-Liang

2016-02-01

An alternative proof of factorization theorem for Drell-Yan process that works at operator level is presented in this paper. Contributions of interactions after the hard collision for such inclusive processes are proved to be canceled at operator level according to the unitarity of time evolution operator. After this cancellation, there are no longer leading pinch singular surface in Glauber region in the time evolution of electromagnetic currents. Effects of soft gluons are absorbed into Wilson lines of scalar-polarized gluons. Cancelation of soft gluons is attribute to unitarity of time evolution operator and such Wilson lines. Supported by the National Natural Science Foundation of China under Grant No. 11275242

Nonlocality in Bohmian mechanics

NASA Astrophysics Data System (ADS)

Ghafar, Zati Amalina binti Mohd Abdul; Radiman, Shahidan bin; Siong, Ch'ng Han

2018-04-01

The Einstein-Podolsky-Rosen (EPR) paradox demonstrates that entangled particles can interact in such a way that it is possible to measure both their position and momentum instantaneously. The position or momentum of one particle can be determined by measuring another identical particle that exists in another space. This instantaneous action is actually called nonlocality. The nonlocality has been proved by Bell's theorem that states that all quantum theories must be nonlocal. The Bell's theorem gives a strong support to the hidden variable theory, i.e. Bohmian mechanics. Using nonlocality, we present that the velocity field of one particle can be obtained by measuring the velocity of other particles. The trajectory of these particles is perhaps surrealistic trajectory due to the nonlocality.

Further evidence for the EPNT assumption

NASA Technical Reports Server (NTRS)

Greenberger, Daniel M.; Bernstein, Herbert J.; Horne, Michael; Zeilinger, Anton

1994-01-01

We recently proved a theorem extending the Greenberger-Horne-Zeilinger (GHZ) Theorem from multi-particle systems to two-particle systems. This proof depended upon an auxiliary assumption, the EPNT assumption (Emptiness of Paths Not Taken). According to this assumption, if there exists an Einstein-Rosen-Podolsky (EPR) element of reality that determines that a path is empty, then there can be no entity associated with the wave that travels this path (pilot-waves, empty waves, etc.) and reports information to the amplitude, when the paths recombine. We produce some further evidence in support of this assumption, which is certainly true in quantum theory. The alternative is that such a pilot-wave theory would have to violate EPR locality.

Uniqueness and characterization theorems for generalized entropies

NASA Astrophysics Data System (ADS)

Enciso, Alberto; Tempesta, Piergiulio

2017-12-01

The requirement that an entropy function be composable is key: it means that the entropy of a compound system can be calculated in terms of the entropy of its independent components. We prove that, under mild regularity assumptions, the only composable generalized entropy in trace form is the Tsallis one-parameter family (which contains Boltzmann-Gibbs as a particular case). This result leads to the use of generalized entropies that are not of trace form, such as Rényi’s entropy, in the study of complex systems. In this direction, we also present a characterization theorem for a large class of composable non-trace-form entropy functions with features akin to those of Rényi’s entropy.

Steady States, Fluctuation-Dissipation Theorems and Homogenization for Reversible Diffusions in a Random Environment

NASA Astrophysics Data System (ADS)

Mathieu, P.; Piatnitski, A.

2018-04-01

Prolongating our previous paper on the Einstein relation, we study the motion of a particle diffusing in a random reversible environment when subject to a small external forcing. In order to describe the long time behavior of the particle, we introduce the notions of steady state and weak steady state. We establish the continuity of weak steady states for an ergodic and uniformly elliptic environment. When the environment has finite range of dependence, we prove the existence of the steady state and weak steady state and compute its derivative at a vanishing force. Thus we obtain a complete `fluctuation-dissipation Theorem' in this context as well as the continuity of the effective variance.

Proving refinement transformations using extended denotational semantics

DOE Office of Scientific and Technical Information (OSTI.GOV)

Winter, V.L.; Boyle, J.M.

1996-04-01

TAMPR is a fully automatic transformation system based on syntactic rewrites. Our approach in a correctness proof is to map the transformation into an axiomatized mathematical domain where formal (and automated) reasoning can be performed. This mapping is accomplished via an extended denotational semantic paradigm. In this approach, the abstract notion of a program state is distributed between an environment function and a store function. Such a distribution introduces properties that go beyond the abstract state that is being modeled. The reasoning framework needs to be aware of these properties in order to successfully complete a correctness proof. This papermore » discusses some of our experiences in proving the correctness of TAMPR transformations.« less

Non-linear quenching of current fluctuations in a self-exciting homopolar dynamo, proved by feedback system theory

NASA Astrophysics Data System (ADS)

de Paor, A. M.

Hide (Nonlinear Processes in Geophysics, 1998) has produced a new mathematical model of a self-exciting homopolar dynamo driving a series- wound motor, as a continuing contribution to the theory of the geomagnetic field. By a process of exact perturbation analysis, followed by combination and partial solution of differential equations, the complete nonlinear quenching of current fluctuations reported by Hide in the case that a parameter ɛ has the value 1 is proved via the Popov theorem from feedback system stability theory.

A comparison theorem for the SOR iterative method

NASA Astrophysics Data System (ADS)

Sun, Li-Ying

2005-09-01

In 1997, Kohno et al. have reported numerically that the improving modified Gauss-Seidel method, which was referred to as the IMGS method, is superior to the SOR iterative method. In this paper, we prove that the spectral radius of the IMGS method is smaller than that of the SOR method and Gauss-Seidel method, if the relaxation parameter [omega][set membership, variant](0,1]. As a result, we prove theoretically that this method is succeeded in improving the convergence of some classical iterative methods. Some recent results are improved.

Effect of the mass center shift for force-free flexible spacecraft

NASA Technical Reports Server (NTRS)

Meirovitch, L.; Juang, J.-N.

1975-01-01

For a spinning flexible spacecraft the mass center generally shifts relative to the nominal undeformed position. It is thought that this shift of center complicates spacecraft stability analysis. It is proved, on the basis of results achieved by Meirovitch and Calico (1972), that for the general class of force-free single-spin flexible spacecraft it is possible to ignore this shift of center without affecting the stability criteria in any significant way. A new theorem on inequalities for quadratic forms is proved to demonstrate the validity of the stability analysis.

Robin problems with a general potential and a superlinear reaction

NASA Astrophysics Data System (ADS)

Papageorgiou, Nikolaos S.; Rădulescu, Vicenţiu D.; Repovš, Dušan D.

2017-09-01

We consider semilinear Robin problems driven by the negative Laplacian plus an indefinite potential and with a superlinear reaction term which need not satisfy the Ambrosetti-Rabinowitz condition. We prove existence and multiplicity theorems (producing also an infinity of smooth solutions) using variational tools, truncation and perturbation techniques and Morse theory (critical groups).

Formal Abstraction in Engineering Education--Challenges and Technology Support

ERIC Educational Resources Information Center

Neuper, Walther A.

2017-01-01

This is a position paper in the field of Engineering Education, which is at the very beginning in Europe. It relates challenges in the new field to the emerging technology of (Computer) Theorem Proving (TP). Experience shows, that "teaching" abstract models, for instance the wave equation in mechanical engineering and in electrical…

The inverse resonance problem for CMV operators

NASA Astrophysics Data System (ADS)

Weikard, Rudi; Zinchenko, Maxim

2010-05-01

We consider the class of CMV operators with super-exponentially decaying Verblunsky coefficients. For these we define the concept of a resonance. Then we prove the existence of Jost solutions and a uniqueness theorem for the inverse resonance problem: given the location of all resonances, taking multiplicities into account, the Verblunsky coefficients are uniquely determined.

Investigating Image-Based Perception and Reasoning in Geometry

ERIC Educational Resources Information Center

Campbell, Stephen R.; Handscomb, Kerry; Zaparyniuk, Nicholas E.; Sha, Li; Cimen, O. Arda; Shipulina, Olga V.

2009-01-01

Geometry is required for many secondary school students, and is often learned, taught, and assessed more in a heuristic image-based manner, than as a formal axiomatic deductive system. Students are required to prove general theorems, but diagrams are usually used. It follows that understanding how students engage in perceiving and reasoning about…

Common Grounds for Modelling Mathematics in Educational Software

ERIC Educational Resources Information Center

Neuper, Walther

2010-01-01

Two kinds of software, CAS and DGS, are starting to work towards mutual integration. This paper envisages common grounds for such integration based on principles of computer theorem proving (CTP). Presently, the CTP community seems to lack awareness as to which of their products' features might serve mathematics education from high-school to…

Time-ordered exponential on the complex plane and Gell-Mann—Low formula as a mathematical theorem

DOE Office of Scientific and Technical Information (OSTI.GOV)

Futakuchi, Shinichiro; Usui, Kouta

2016-04-15

The time-ordered exponential representation of a complex time evolution operator in the interaction picture is studied. Using the complex time evolution, we prove the Gell-Mann—Low formula under certain abstract conditions, in mathematically rigorous manner. We apply the abstract results to quantum electrodynamics with cutoffs.

Separability of Item and Person Parameters in Response Time Models.

ERIC Educational Resources Information Center

Van Breukelen, Gerard J. P.

1997-01-01

Discusses two forms of separability of item and person parameters in the context of response time models. The first is "separate sufficiency," and the second is "ranking independence." For each form a theorem stating sufficient conditions is proved. The two forms are shown to include several cases of models from psychometric…

Autonomous quantum to classical transitions and the generalized imaging theorem

NASA Astrophysics Data System (ADS)

Briggs, John S.; Feagin, James M.

2016-03-01

The mechanism of the transition of a dynamical system from quantum to classical mechanics is of continuing interest. Practically it is of importance for the interpretation of multi-particle coincidence measurements performed at macroscopic distances from a microscopic reaction zone. Here we prove the generalized imaging theorem which shows that the spatial wave function of any multi-particle quantum system, propagating over distances and times large on an atomic scale but still microscopic, and subject to deterministic external fields and particle interactions, becomes proportional to the initial momentum wave function where the position and momentum coordinates define a classical trajectory. Currently, the quantum to classical transition is considered to occur via decoherence caused by stochastic interaction with an environment. The imaging theorem arises from unitary Schrödinger propagation and so is valid without any environmental interaction. It implies that a simultaneous measurement of both position and momentum will define a unique classical trajectory, whereas a less complete measurement of say position alone can lead to quantum interference effects.

No-Hair Theorem for Black Holes in Astrophysical Environments

NASA Astrophysics Data System (ADS)

Gürlebeck, Norman

2015-04-01

According to the no-hair theorem, static black holes are described by a Schwarzschild spacetime provided there are no other sources of the gravitational field. This requirement, however, is in astrophysical realistic scenarios often violated, e.g., if the black hole is part of a binary system or if it is surrounded by an accretion disk. In these cases, the black hole is distorted due to tidal forces. Nonetheless, the subsequent formulation of the no-hair theorem holds: The contribution of the distorted black hole to the multipole moments that describe the gravitational field close to infinity and, thus, all sources is that of a Schwarzschild black hole. It still has no hair. This implies that there is no multipole moment induced in the black hole and that its second Love numbers, which measure some aspects of the distortion, vanish as was already shown in approximations to general relativity. But here we prove this property for astrophysical relevant black holes in full general relativity.

Autonomous quantum to classical transitions and the generalized imaging theorem

DOE PAGES

Briggs, John S.; Feagin, James M.

2016-03-16

The mechanism of the transition of a dynamical system from quantum to classical mechanics is of continuing interest. Practically it is of importance for the interpretation of multi-particle coincidence measurements performed at macroscopic distances from a microscopic reaction zone. We prove the generalized imaging theorem which shows that the spatial wave function of any multi-particle quantum system, propagating over distances and times large on an atomic scale but still microscopic, and subject to deterministic external fields and particle interactions, becomes proportional to the initial momentum wave function where the position and momentum coordinates define a classical trajectory. Now, the quantummore » to classical transition is considered to occur via decoherence caused by stochastic interaction with an environment. The imaging theorem arises from unitary Schrödinger propagation and so is valid without any environmental interaction. It implies that a simultaneous measurement of both position and momentum will define a unique classical trajectory, whereas a less complete measurement of say position alone can lead to quantum interference effects.« less

Entanglement conservation, ER=EPR, and a new classical area theorem for wormholes

DOE PAGES

Remmen, Grant N.; Bao, Ning; Pollack, Jason

2016-07-11

We consider the question of entanglement conservation in the context of the ER=EPR correspondence equating quantum entanglement with wormholes. In quantum mechanics, the entanglement between a system and its complement is conserved under unitary operations that act independently on each; ER=EPR suggests that an analogous statement should hold for wormholes. We accordingly prove a new area theorem in general relativity: for a collection of dynamical wormholes and black holes in a spacetime satisfying the null curvature condition, the maximin area for a subset of the horizons (giving the largest area attained by the minimal cross section of the multi-wormhole throatmore » separating the subset from its complement) is invariant under classical time evolution along the outermost apparent horizons. The evolution can be completely general, including horizon mergers and the addition of classical matter satisfying the null energy condition. In conclusion, this theorem is the gravitational dual of entanglement conservation and thus constitutes an explicit characterization of the ER=EPR duality in the classical limit.« less

No-hair theorem for black holes in astrophysical environments.

PubMed

Gürlebeck, Norman

2015-04-17

According to the no-hair theorem, static black holes are described by a Schwarzschild spacetime provided there are no other sources of the gravitational field. This requirement, however, is in astrophysical realistic scenarios often violated, e.g., if the black hole is part of a binary system or if it is surrounded by an accretion disk. In these cases, the black hole is distorted due to tidal forces. Nonetheless, the subsequent formulation of the no-hair theorem holds: The contribution of the distorted black hole to the multipole moments that describe the gravitational field close to infinity and, thus, all sources is that of a Schwarzschild black hole. It still has no hair. This implies that there is no multipole moment induced in the black hole and that its second Love numbers, which measure some aspects of the distortion, vanish as was already shown in approximations to general relativity. But here we prove this property for astrophysical relevant black holes in full general relativity.

Entanglement conservation, ER=EPR, and a new classical area theorem for wormholes

DOE Office of Scientific and Technical Information (OSTI.GOV)

Remmen, Grant N.; Bao, Ning; Pollack, Jason

We consider the question of entanglement conservation in the context of the ER=EPR correspondence equating quantum entanglement with wormholes. In quantum mechanics, the entanglement between a system and its complement is conserved under unitary operations that act independently on each; ER=EPR suggests that an analogous statement should hold for wormholes. We accordingly prove a new area theorem in general relativity: for a collection of dynamical wormholes and black holes in a spacetime satisfying the null curvature condition, the maximin area for a subset of the horizons (giving the largest area attained by the minimal cross section of the multi-wormhole throatmore » separating the subset from its complement) is invariant under classical time evolution along the outermost apparent horizons. The evolution can be completely general, including horizon mergers and the addition of classical matter satisfying the null energy condition. In conclusion, this theorem is the gravitational dual of entanglement conservation and thus constitutes an explicit characterization of the ER=EPR duality in the classical limit.« less

Central Limit Theorems for the Shrinking Target Problem

NASA Astrophysics Data System (ADS)

Haydn, Nicolai; Nicol, Matthew; Vaienti, Sandro; Zhang, Licheng

2013-12-01

Suppose B i := B( p, r i ) are nested balls of radius r i about a point p in a dynamical system ( T, X, μ). The question of whether T i x∈ B i infinitely often (i.o.) for μ a.e. x is often called the shrinking target problem. In many dynamical settings it has been shown that if diverges then there is a quantitative rate of entry and for μ a.e. x∈ X. This is a self-norming type of strong law of large numbers. We establish self-norming central limit theorems (CLT) of the form (in distribution) for a variety of hyperbolic and non-uniformly hyperbolic dynamical systems, the normalization constants are . Dynamical systems to which our results apply include smooth expanding maps of the interval, Rychlik type maps, Gibbs-Markov maps, rational maps and, in higher dimensions, piecewise expanding maps. For such central limit theorems the main difficulty is to prove that the non-stationary variance has a limit in probability.

Entropy for quantum pure states and quantum H theorem

NASA Astrophysics Data System (ADS)

Han, Xizhi; Wu, Biao

2015-06-01

We construct a complete set of Wannier functions that are localized at both given positions and momenta. This allows us to introduce the quantum phase space, onto which a quantum pure state can be mapped unitarily. Using its probability distribution in quantum phase space, we define an entropy for a quantum pure state. We prove an inequality regarding the long-time behavior of our entropy's fluctuation. For a typical initial state, this inequality indicates that our entropy can relax dynamically to a maximized value and stay there most of time with small fluctuations. This result echoes the quantum H theorem proved by von Neumann [Zeitschrift für Physik 57, 30 (1929), 10.1007/BF01339852]. Our entropy is different from the standard von Neumann entropy, which is always zero for quantum pure states. According to our definition, a system always has bigger entropy than its subsystem even when the system is described by a pure state. As the construction of the Wannier basis can be implemented numerically, the dynamical evolution of our entropy is illustrated with an example.

Math majors' visual proofs in a dynamic environment: the case of limit of a function and the ɛ-δ approach

NASA Astrophysics Data System (ADS)

Caglayan, Günhan

2015-08-01

Despite few limitations, GeoGebra as a dynamic geometry software stood as a powerful instrument in helping university math majors understand, explore, and gain experiences in visualizing the limits of functions and the ɛ - δ formalism. During the process of visualizing a theorem, the order mattered in the sequence of constituents. Students made use of such rich constituents as finger-hand gestures and cursor gestures in an attempt to keep a record of visual demonstration in progress, while being aware of the interrelationships among these constituents and the transformational aspect of the visually proving process. Covariational reasoning along with interval mapping structures proved to be the key constituents in the visualizing and sense-making of a limit theorem using the delta-epsilon formalism. Pedagogical approaches and teaching strategies based on experimental mathematics - mindtool - consituential visual proofs trio would permit students to study, construct, and meaningfully connect the new knowledge to the previously mastered concepts and skills in a manner that would make sense for them.

Mechanically verified hardware implementing an 8-bit parallel IO Byzantine agreement processor

NASA Technical Reports Server (NTRS)

Moore, J. Strother

1992-01-01

Consider a network of four processors that use the Oral Messages (Byzantine Generals) Algorithm of Pease, Shostak, and Lamport to achieve agreement in the presence of faults. Bevier and Young have published a functional description of a single processor that, when interconnected appropriately with three identical others, implements this network under the assumption that the four processors step in synchrony. By formalizing the original Pease, et al work, Bevier and Young mechanically proved that such a network achieves fault tolerance. We develop, formalize, and discuss a hardware design that has been mechanically proven to implement their processor. In particular, we formally define mapping functions from the abstract state space of the Bevier-Young processor to a concrete state space of a hardware module and state a theorem that expresses the claim that the hardware correctly implements the processor. We briefly discuss the Brock-Hunt Formal Hardware Description Language which permits designs both to be proved correct with the Boyer-Moore theorem prover and to be expressed in a commercially supported hardware description language for additional electrical analysis and layout. We briefly describe our implementation.

Monitoring Programs Using Rewriting

NASA Technical Reports Server (NTRS)

Havelund, Klaus; Rosu, Grigore; Lan, Sonie (Technical Monitor)

2001-01-01

We present a rewriting algorithm for efficiently testing future time Linear Temporal Logic (LTL) formulae on finite execution traces, The standard models of LTL are infinite traces, reflecting the behavior of reactive and concurrent systems which conceptually may be continuously alive in most past applications of LTL, theorem provers and model checkers have been used to formally prove that down-scaled models satisfy such LTL specifications. Our goal is instead to use LTL for up-scaled testing of real software applications, corresponding to analyzing the conformance of finite traces against LTL formulae. We first describe what it means for a finite trace to satisfy an LTL property end then suggest an optimized algorithm based on transforming LTL formulae. We use the Maude rewriting logic, which turns out to be a good notation and being supported by an efficient rewriting engine for performing these experiments. The work constitutes part of the Java PathExplorer (JPAX) project, the purpose of which is to develop a flexible tool for monitoring Java program executions.

Geography and the Properties of Surfaces. The Sandwich Theorem - A Basic One for Geography.

DTIC Science & Technology

the nature of the Sandwich Theorem and its relationship to Geography and provides an algorithm and a complete program to achieve ’solutions.’ Also included is a translation of one work of Hugo Steinhaus . (Author)

Tree-manipulating systems and Church-Rosser theorems.

NASA Technical Reports Server (NTRS)

Rosen, B. K.

1973-01-01

Study of a broad class of tree-manipulating systems called subtree replacement systems. The use of this framework is illustrated by general theorems analogous to the Church-Rosser theorem and by applications of these theorems. Sufficient conditions are derived for the Church-Rosser property, and their applications to recursive definitions, the lambda calculus, and parallel programming are discussed. McCarthy's (1963) recursive calculus is extended by allowing a choice between call-by-value and call-by-name. It is shown that recursively defined functions are single-valued despite the nondeterminism of the evaluation algorithm. It is also shown that these functions solve their defining equations in a 'canonical' manner.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Nielsen, Michael A.; School of Information Technology and Electrical Engineering, University of Queensland, Brisbane, Queensland 4072; Dawson, Christopher M.

The one-way quantum computing model introduced by Raussendorf and Briegel [Phys. Rev. Lett. 86, 5188 (2001)] shows that it is possible to quantum compute using only a fixed entangled resource known as a cluster state, and adaptive single-qubit measurements. This model is the basis for several practical proposals for quantum computation, including a promising proposal for optical quantum computation based on cluster states [M. A. Nielsen, Phys. Rev. Lett. (to be published), quant-ph/0402005]. A significant open question is whether such proposals are scalable in the presence of physically realistic noise. In this paper we prove two threshold theorems which showmore » that scalable fault-tolerant quantum computation may be achieved in implementations based on cluster states, provided the noise in the implementations is below some constant threshold value. Our first threshold theorem applies to a class of implementations in which entangling gates are applied deterministically, but with a small amount of noise. We expect this threshold to be applicable in a wide variety of physical systems. Our second threshold theorem is specifically adapted to proposals such as the optical cluster-state proposal, in which nondeterministic entangling gates are used. A critical technical component of our proofs is two powerful theorems which relate the properties of noisy unitary operations restricted to act on a subspace of state space to extensions of those operations acting on the entire state space. We expect these theorems to have a variety of applications in other areas of quantum-information science.« less

On the Chern-Gauss-Bonnet Theorem and Conformally Twisted Spectral Triples for C*-Dynamical Systems

NASA Astrophysics Data System (ADS)

Fathizadeh, Farzad; Gabriel, Olivier

2016-02-01

The analog of the Chern-Gauss-Bonnet theorem is studied for a C^*-dynamical system consisting of a C^*-algebra A equipped with an ergodic action of a compact Lie group G. The structure of the Lie algebra g of G is used to interpret the Chevalley-Eilenberg complex with coefficients in the smooth subalgebra A subset A as noncommutative differential forms on the dynamical system. We conformally perturb the standard metric, which is associated with the unique G-invariant state on A, by means of a Weyl conformal factor given by a positive invertible element of the algebra, and consider the Hermitian structure that it induces on the complex. A Hodge decomposition theorem is proved, which allows us to relate the Euler characteristic of the complex to the index properties of a Hodge-de Rham operator for the perturbed metric. This operator, which is shown to be selfadjoint, is a key ingredient in our construction of a spectral triple on A and a twisted spectral triple on its opposite algebra. The conformal invariance of the Euler characteristic is interpreted as an indication of the Chern-Gauss-Bonnet theorem in this setting. The spectral triples encoding the conformally perturbed metrics are shown to enjoy the same spectral summability properties as the unperturbed case.

Mixing rates and limit theorems for random intermittent maps

NASA Astrophysics Data System (ADS)

Bahsoun, Wael; Bose, Christopher

2016-04-01

We study random transformations built from intermittent maps on the unit interval that share a common neutral fixed point. We focus mainly on random selections of Pomeu-Manneville-type maps {{T}α} using the full parameter range 0<α <∞ , in general. We derive a number of results around a common theme that illustrates in detail how the constituent map that is fastest mixing (i.e. smallest α) combined with details of the randomizing process, determines the asymptotic properties of the random transformation. Our key result (theorem 1.1) establishes sharp estimates on the position of return time intervals for the quenched dynamics. The main applications of this estimate are to limit laws (in particular, CLT and stable laws, depending on the parameters chosen in the range 0<α <1 ) for the associated skew product; these are detailed in theorem 3.2. Since our estimates in theorem 1.1 also hold for 1≤slant α <∞ we study a second class of random transformations derived from piecewise affine Gaspard-Wang maps, prove existence of an infinite (σ-finite) invariant measure and study the corresponding correlation asymptotics. To the best of our knowledge, this latter kind of result is completely new in the setting of random transformations.

Existence of standard models of conic fibrations over non-algebraically-closed fields

DOE Office of Scientific and Technical Information (OSTI.GOV)

Avilov, A A

2014-12-31

We prove an analogue of Sarkisov's theorem on the existence of a standard model of a conic fibration over an algebraically closed field of characteristic different from two for three-dimensional conic fibrations over an arbitrary field of characteristic zero with an action of a finite group. Bibliography: 16 titles.

A Proposal for Testing Local Realism Without Using Assumptions Related to Hidden Variable States

NASA Technical Reports Server (NTRS)

Ryff, Luiz Carlos

1996-01-01

A feasible experiment is discussed which allows us to prove a Bell's theorem for two particles without using an inequality. The experiment could be used to test local realism against quantum mechanics without the introduction of additional assumptions related to hidden variables states. Only assumptions based on direct experimental observation are needed.

Research on Interactive Acquisition and Use of Knowledge.

DTIC Science & Technology

1983-05-01

intepretation of certain problematical types of sentences. Native speakers of English show definite and consistent preferences for certain readings of syn...W’R67] Wos, L., G. Robinson, D. Carson, and L. Shalla. The concept of demodulation in theorem proving. J. ACM 14, 4 (October 1987), 898-709. 28 5 , Zi FILMED 9 83 DTIC

Type Theory, Computation and Interactive Theorem Proving

DTIC Science & Technology

2015-09-01

postdoc Cody Roux, to develop new methods of verifying real-valued inequalities automatically. They developed a prototype implementation in Python [8] (an...he has developed new heuristic, geometric methods of verifying real-valued inequalities. A python -based implementation has performed surprisingly...express complex mathematical and computational assertions. In this project, Avigad and Harper developed type-theoretic algorithms and formalisms that

ON THE STRONG EXTREMUM PRINCIPLE FOR A \\mathrm{D}-(\\Pi, \\Omega)-ELLIPTICALLY CONNECTED OPERATOR OF SECOND ORDER

NASA Astrophysics Data System (ADS)

Kamynin, L. I.; Himčenko, B. N.

1981-02-01

In this paper the strong extremum principle is proved for a certain new class of second order operators with nonnegative characteristic form, without requiring the smoothness of their coefficients, which is essential in the converse of Raševskiĭ's theorem on completely nonholonomic systems. Bibliography: 19 titles.

Nonmaximality of known extremal metrics on torus and Klein bottle

DOE Office of Scientific and Technical Information (OSTI.GOV)

Karpukhin, M A

2013-12-31

The El Soufi-Ilias theorem establishes a connection between minimal submanifolds of spheres and extremal metrics for eigenvalues of the Laplace-Beltrami operator. Recently, this connection was used to provide several explicit examples of extremal metrics. We investigate the properties of these metrics and prove that none of them is maximal. Bibliography: 24 titles.

A holographic c-theorem for Schrödinger spacetimes

DOE PAGES

Liu, James T.; Zhong, Weishun

2015-12-29

We prove a c-theorem for holographic renormalization group flows in a Schrodinger spacetime that demonstrates that the effective radius L(r) monotonically decreases from the UV to the IR, where r is the bulk radial coordinate. This result assumes that the bulk matter satisfies the null energy condition, but holds regardless of the value of the critical exponent z. We also construct several numerical examples in a model where the Schrodinger background is realized by a massive vector coupled to a real scalar. Finally, the full Schrodinger group is realized when z = 2, and in this case it is possiblemore » to construct solutions with constant effective z(r) = 2 along the entire flow.« less

Second order accurate finite difference approximations for the transonic small disturbance equation and the full potential equation

NASA Technical Reports Server (NTRS)

Mostrel, M. M.

1988-01-01

New shock-capturing finite difference approximations for solving two scalar conservation law nonlinear partial differential equations describing inviscid, isentropic, compressible flows of aerodynamics at transonic speeds are presented. A global linear stability theorem is applied to these schemes in order to derive a necessary and sufficient condition for the finite element method. A technique is proposed to render the described approximations total variation-stable by applying the flux limiters to the nonlinear terms of the difference equation dimension by dimension. An entropy theorem applying to the approximations is proved, and an implicit, forward Euler-type time discretization of the approximation is presented. Results of some numerical experiments using the approximations are reported.

Ground-state energies of the nonlinear sigma model and the Heisenberg spin chains

NASA Technical Reports Server (NTRS)

Zhang, Shoucheng; Schulz, H. J.; Ziman, Timothy

1989-01-01

A theorem on the O(3) nonlinear sigma model with the topological theta term is proved, which states that the ground-state energy at theta = pi is always higher than the ground-state energy at theta = 0, for the same value of the coupling constant g. Provided that the nonlinear sigma model gives the correct description for the Heisenberg spin chains in the large-s limit, this theorem makes a definite prediction relating the ground-state energies of the half-integer and the integer spin chains. The ground-state energies obtained from the exact Bethe ansatz solution for the spin-1/2 chain and the numerical diagonalization on the spin-1, spin-3/2, and spin-2 chains support this prediction.

Hamiltonian structure of the guiding center plasma model

NASA Astrophysics Data System (ADS)

Burby, J. W.; Sengupta, W.

2018-02-01

The guiding center plasma model (also known as kinetic MHD) is a rigorous sub-cyclotron-frequency closure of the Vlasov-Maxwell system. While the model has been known for decades and it plays a fundamental role in describing the physics of strongly magnetized collisionless plasmas, its Hamiltonian structure has never been found. We provide explicit expressions for the model's Poisson bracket and Hamiltonian and thereby prove that the model is an infinite-dimensional Hamiltonian system. The bracket is derived in a manner which ensures that it satisfies the Jacobi identity. We also report on several previously unknown circulation theorems satisfied by the guiding center plasma model. Without knowledge of the Hamiltonian structure, these circulation theorems would be difficult to guess.

Multidirectional hybrid algorithm for the split common fixed point problem and application to the split common null point problem.

PubMed

Li, Xia; Guo, Meifang; Su, Yongfu

2016-01-01

In this article, a new multidirectional monotone hybrid iteration algorithm for finding a solution to the split common fixed point problem is presented for two countable families of quasi-nonexpansive mappings in Banach spaces. Strong convergence theorems are proved. The application of the result is to consider the split common null point problem of maximal monotone operators in Banach spaces. Strong convergence theorems for finding a solution of the split common null point problem are derived. This iteration algorithm can accelerate the convergence speed of iterative sequence. The results of this paper improve and extend the recent results of Takahashi and Yao (Fixed Point Theory Appl 2015:87, 2015) and many others .

Sharpening the second law of thermodynamics with the quantum Bayes theorem.

PubMed

Gharibyan, Hrant; Tegmark, Max

2014-09-01

We prove a generalization of the classic Groenewold-Lindblad entropy inequality, combining decoherence and the quantum Bayes theorem into a simple unified picture where decoherence increases entropy while observation decreases it. This provides a rigorous quantum-mechanical version of the second law of thermodynamics, governing how the entropy of a system (the entropy of its density matrix, partial-traced over the environment and conditioned on what is known) evolves under general decoherence and observation. The powerful tool of spectral majorization enables both simple alternative proofs of the classic Lindblad and Holevo inequalities without using strong subadditivity, and also novel inequalities for decoherence and observation that hold not only for von Neumann entropy, but also for arbitrary concave entropies.

Mathematical model of blasting schemes management in mining operations in presence of random disturbances

NASA Astrophysics Data System (ADS)

Kazakova, E. I.; Medvedev, A. N.; Kolomytseva, A. O.; Demina, M. I.

2017-11-01

The paper presents a mathematical model of blasting schemes management in presence of random disturbances. Based on the lemmas and theorems proved, a control functional is formulated, which is stable. A universal classification of blasting schemes is developed. The main classification attributes are suggested: the orientation in plan the charging wells rows relatively the block of rocks; the presence of cuts in the blasting schemes; the separation of the wells series onto elements; the sequence of the blasting. The periodic regularity of transition from one Short-delayed scheme of blasting to another is proved.

Constrained multibody system dynamics: An automated approach

NASA Technical Reports Server (NTRS)

Kamman, J. W.; Huston, R. L.

1982-01-01

The governing equations for constrained multibody systems are formulated in a manner suitable for their automated, numerical development and solution. The closed loop problem of multibody chain systems is addressed. The governing equations are developed by modifying dynamical equations obtained from Lagrange's form of d'Alembert's principle. The modifications is based upon a solution of the constraint equations obtained through a zero eigenvalues theorem, is a contraction of the dynamical equations. For a system with n-generalized coordinates and m-constraint equations, the coefficients in the constraint equations may be viewed as constraint vectors in n-dimensional space. In this setting the system itself is free to move in the n-m directions which are orthogonal to the constraint vectors.

An Application of Automated Theorem Provers to Computer System Security: The Schematic Protection Model

DTIC Science & Technology

2010-06-01

z ∃ dom(Y) • true A link is denoted by a function linki (X, Y) where X and Y are formal parameters representing entities and is evaluated as true or...X/rc ∃ dom(Y), • linki (Y, Z), and • τ(X)/r:c ∃ fi(τ(Y), τ(Z)). The addition of the filter, made possible by the protection types, distinguishes the

Extrapolating the Trends of Test Drop Data with Opening Shock Factor Calculations: the Case of the Orion Main and Drogue Parachutes Inflating to 1st Reefed Stage

NASA Technical Reports Server (NTRS)

Potvin, Jean; Ray, Eric

2017-01-01

We describe a new calculation of the opening shock factor C (sub k) characterizing the inflation performance of NASA's Orion spacecraft main and drogue parachutes opening under a reefing constraint (1st stage reefing), as currently tested in the Capsule Parachute Assembly System (CPAS) program. This calculation is based on an application of the Momentum-Impulse Theorem at low mass ratio (R (sub m) is less than 10 (sup -1)) and on an earlier analysis of the opening performance of drogues decelerating point masses and inflating along horizontal trajectories. Herein we extend the reach of the Theorem to include the effects of payload drag and gravitational impulse during near-vertical motion - both important pre-requisites for CPAS parachute analysis. The result is a family of C (sub k) versus R (sub m) curves which can be used for extrapolating beyond the drop-tested envelope. The paper proves this claim in the case of the CPAS Mains and Drogues opening while trailing either a Parachute Compartment Drop Test Vehicle or a Parachute Test Vehicle (an Orion capsule boiler plate). It is seen that in all cases the values of the opening shock factor can be extrapolated over a range in mass ratio that is at least twice that of the test drop data.

Development and Demonstration of an Ada Test Generation System

NASA Technical Reports Server (NTRS)

1996-01-01

In this project we have built a prototype system that performs Feasible Path Analysis on Ada programs: given a description of a set of control flow paths through a procedure, and a predicate at a program point feasible path analysis determines if there is input data which causes execution to flow down some path in the collection reaching the point so that tile predicate is true. Feasible path analysis can be applied to program testing, program slicing, array bounds checking, and other forms of anomaly checking. FPA is central to most applications of program analysis. But, because this problem is formally unsolvable, syntactic-based approximations are used in its place. For example, in dead-code analysis the problem is to determine if there are any input values which cause execution to reach a specified program point. Instead an approximation to this problem is computed: determine whether there is a control flow path from the start of the program to the point. This syntactic approximation is efficiently computable and conservative: if there is no such path the program point is clearly unreachable, but if there is such a path, the analysis is inconclusive, and the code is assumed to be live. Such conservative analysis too often yields unsatisfactory results because the approximation is too weak. As another example, consider data flow analysis. A du-pair is a pair of program points such that the first point is a definition of a variable and the second point a use and for which there exists a definition-free path from the definition to the use. The sharper, semantic definition of a du-pair requires that there be a feasible definition-free path from the definition to the use. A compiler using du-pairs for detecting dead variables may miss optimizations by not considering feasibility. Similarly, a program analyzer computing program slices to merge parallel versions may report conflicts where none exist. In the context of software testing, feasibility analysis plays an important role in identifying testing requirements which are infeasible. This is especially true for data flow testing and modified condition/decision coverage. Our system uses in an essential way symbolic analysis and theorem proving technology, and we believe this work represents one of the few successful uses of a theorem prover working in a completely automatic fashion to solve a problem of practical interest. We believe this work anticipates an important trend away from purely syntactic-based methods for program analysis to semantic methods based on symbolic processing and inference technology. Other results demonstrating the practical use of automatic inference is being reported in hardware verification, although there are significant differences between the hardware work and ours. However, what is common and important is that general purpose theorem provers are being integrated with more special-purpose decision procedures to solve problems in analysis and verification. We are pursuina commercial opportunities for this work, and will use and extend the work in other projects we are engaged in. Ultimately we would like to rework the system to analyze C, C++, or Java as a key step toward commercialization.

How to (properly) strengthen Bell's theorem using counterfactuals

NASA Astrophysics Data System (ADS)

Bigaj, Tomasz

Bell's theorem in its standard version demonstrates that the joint assumptions of the hidden-variable hypothesis and the principle of local causation lead to a conflict with quantum-mechanical predictions. In his latest counterfactual strengthening of Bell's theorem, Stapp attempts to prove that the locality assumption itself contradicts the quantum-mechanical predictions in the Hardy case. His method relies on constructing a complex, non-truth functional formula which consists of statements about measurements and outcomes in some region R, and whose truth value depends on the selection of a measurement setting in a space-like separated location L. Stapp argues that this fact shows that the information about the measurement selection made in L has to be present in R. I give detailed reasons why this conclusion can and should be resisted. Next I correct and formalize an informal argument by Shimony and Stein showing that the locality condition coupled with Einstein's criterion of reality is inconsistent with quantum-mechanical predictions. I discuss the possibility of avoiding the inconsistency by rejecting Einstein's criterion rather than the locality assumption.

Quantum mechanics problems in observer's mathematics

DOE Office of Scientific and Technical Information (OSTI.GOV)

Khots, Boris; Khots, Dmitriy; iMath Consulting LLC, Omaha, Nebraska

2012-11-06

This work considers the ontology, guiding equation, Schrodinger's equation, relation to the Born Rule, the conditional wave function of a subsystem in a setting of arithmetic, algebra and topology provided by Observer's Mathematics (see www.mathrelativity.com). Observer's Mathematics creates new arithmetic, algebra, geometry, topology, analysis and logic which do not contain the concept of continuum, but locally coincide with the standard fields. Certain results and communications pertaining to solutions of these problems are provided. In particular, we prove the following theorems: Theorem I (Two-slit interference). Let {Psi}{sub 1} be a wave from slit 1, {Psi}{sub 2} - from slit 2, andmore » {Psi} = {Psi}{sub 1}+{Psi}{sub 2}. Then the probability of {Psi} being a wave equals to 0.5. Theorem II (k-bodies solution). For W{sub n} from m-observer point of view with m>log{sub 10}((2 Multiplication-Sign 10{sup 2n}-1){sup 2k}+1), the probability of standard expression of Hamiltonian variation is less than 1 and depends on n,m,k.« less

The distribution of the zeros of the Hermite-Padé polynomials for a pair of functions forming a Nikishin system

DOE Office of Scientific and Technical Information (OSTI.GOV)

Rakhmanov, E A; Suetin, S P

2013-09-30

The distribution of the zeros of the Hermite-Padé polynomials of the first kind for a pair of functions with an arbitrary even number of common branch points lying on the real axis is investigated under the assumption that this pair of functions forms a generalized complex Nikishin system. It is proved (Theorem 1) that the zeros have a limiting distribution, which coincides with the equilibrium measure of a certain compact set having the S-property in a harmonic external field. The existence problem for S-compact sets is solved in Theorem 2. The main idea of the proof of Theorem 1 consists in replacing a vector equilibrium problem in potentialmore » theory by a scalar problem with an external field and then using the general Gonchar-Rakhmanov method, which was worked out in the solution of the '1/9'-conjecture. The relation of the result obtained here to some results and conjectures due to Nuttall is discussed. Bibliography: 51 titles.« less

Analogues of Chernoff's theorem and the Lie-Trotter theorem

NASA Astrophysics Data System (ADS)

Neklyudov, Alexander Yu

2009-10-01

This paper is concerned with the abstract Cauchy problem \\dot x=\\mathrm{A}x, x(0)=x_0\\in\\mathscr{D}(\\mathrm{A}), where \\mathrm{A} is a densely defined linear operator on a Banach space \\mathbf X. It is proved that a solution x(\\,\\cdot\\,) of this problem can be represented as the weak limit \\lim_{n\\to\\infty}\\{\\mathrm F(t/n)^nx_0\\}, where the function \\mathrm F\\colon \\lbrack 0,\\infty)\\mapsto\\mathscr L(\\mathrm X) satisfies the equality \\mathrm F'(0)y=\\mathrm{A}y, y\\in\\mathscr{D}(\\mathrm{A}), for a natural class of operators. As distinct from Chernoff's theorem, the existence of a global solution to the Cauchy problem is not assumed. Based on this result, necessary and sufficient conditions are found for the linear operator \\mathrm{C} to be closable and for its closure to be the generator of a C_0-semigroup. Also, we obtain new criteria for the sum of two generators of C_0-semigroups to be the generator of a C_0-semigroup and for the Lie-Trotter formula to hold. Bibliography: 13 titles.

Direct approach for the fluctuation-dissipation theorem under nonequilibrium steady-state conditions

NASA Astrophysics Data System (ADS)

Komori, Kentaro; Enomoto, Yutaro; Takeda, Hiroki; Michimura, Yuta; Somiya, Kentaro; Ando, Masaki; Ballmer, Stefan W.

2018-05-01

The test mass suspensions of cryogenic gravitational-wave detectors such as the KAGRA project are tasked with extracting the heat deposited on the optics. These suspensions have a nonuniform temperature, requiring the calculation of thermal noise in nonequilibrium conditions. While it is not possible to describe the whole suspension system with one temperature, the local temperature at every point in the system is still well defined. We therefore generalize the application of the fluctuation-dissipation theorem to mechanical systems, pioneered by Saulson and Levin, to nonequilibrium conditions in which a temperature can only be defined locally. The result is intuitive in the sense that the thermal noise in the observed degree of freedom is given by averaging the temperature field, weighted by the dissipation density associated with that particular degree of freedom. After proving this theorem, we apply the result to examples of increasing complexity: a simple spring, the bending of a pendulum suspension fiber, and a model of the KAGRA cryogenic suspension. We conclude by outlining the application to nonequilibrium thermoelastic noise.

Warped product space-times

NASA Astrophysics Data System (ADS)

An, Xinliang; Wong, Willie Wai Yeung

2018-01-01

Many classical results in relativity theory concerning spherically symmetric space-times have easy generalizations to warped product space-times, with a two-dimensional Lorentzian base and arbitrary dimensional Riemannian fibers. We first give a systematic presentation of the main geometric constructions, with emphasis on the Kodama vector field and the Hawking energy; the construction is signature independent. This leads to proofs of general Birkhoff-type theorems for warped product manifolds; our theorems in particular apply to situations where the warped product manifold is not necessarily Einstein, and thus can be applied to solutions with matter content in general relativity. Next we specialize to the Lorentzian case and study the propagation of null expansions under the assumption of the dominant energy condition. We prove several non-existence results relating to the Yamabe class of the fibers, in the spirit of the black-hole topology theorem of Hawking–Galloway–Schoen. Finally we discuss the effect of the warped product ansatz on matter models. In particular we construct several cosmological solutions to the Einstein–Euler equations whose spatial geometry is generally not isotropic.

Election Verifiability: Cryptographic Definitions and an Analysis of Helios and JCJ

DTIC Science & Technology

2015-08-06

SHA - 256 [98], we assume that H is a random oracle to prove Theorem 2. Moreover, we assume the sigma protocols used by Helios 4.0 satisfy the...Aspects in Security and Trust, volume 5491 of LNCS, pages 242– 256 . Springer, 2008. [68] Martin Hirt. Receipt-Free K-out-of-L Voting Based on ElGamal

[Formula: see text]-Contraction in terms of measure of noncompactness with application for nonlinear integral equations.

PubMed

Nikbakhtsarvestani, Farzaneh; Vaezpour, S Mansour; Asadi, Mehdi

2017-01-01

In this paper, some new generalization of Darbo's fixed point theorem is proved by using a [Formula: see text]-contraction in terms of a measure of noncompactness. Our result extends to obtaining a common fixed point for a pair of compatible mappings. The paper contains an application for nonlinear integral equations as well.

One Problem, Nine Student-Produced Proofs

ERIC Educational Resources Information Center

Birky, Geoffrey; Campbell, Connie M.; Raman, Manya; Sandefur, James; Somers, Kay

2011-01-01

This paper tells the story of what happened when students in the authors' sophomore-level introduction-to-proof classes were given a theorem to prove with no expectation about what proof method to use. The paper discusses the nine different student-produced proofs of the statement: If "n" is an integer such that "n" is greater than or equal to 3,…

Lichnerowicz-type equations with sign-changing nonlinearities on complete manifolds with boundary

NASA Astrophysics Data System (ADS)

Albanese, Guglielmo; Rigoli, Marco

2017-12-01

We prove an existence theorem for positive solutions to Lichnerowicz-type equations on complete manifolds with boundary (M , ∂ M , 〈 , 〉) and nonlinear Neumann conditions. This kind of nonlinear problems arise quite naturally in the study of solutions for the Einstein-scalar field equations of General Relativity in the framework of the so called Conformal Method.

Feynman amplitudes and limits of heights

NASA Astrophysics Data System (ADS)

Amini, O.; Bloch, S. J.; Burgos Gil, J. I.; Fresán, J.

2016-10-01

We investigate from a mathematical perspective how Feynman amplitudes appear in the low-energy limit of string amplitudes. In this paper, we prove the convergence of the integrands. We derive this from results describing the asymptotic behaviour of the height pairing between degree-zero divisors, as a family of curves degenerates. These are obtained by means of the nilpotent orbit theorem in Hodge theory.

My Way of Teaching Mathematics in a Social Context (In Junior High School)

ERIC Educational Resources Information Center

Kneller, Shmuel

2012-01-01

This article is not comprehensive. It aims at encouraging all teachers of mathematics "to look behind the subject matter" and to probe what educational values it contains. More examples can easily be found. Suffice it to say that when Pythagoras proved his famous theorem, mankind "discovered" that the square root of 2 is an irrational number. The…

Proof and Proving in the Classroom: Dynamic Geometry Systems as Tools of Semiotic Mediation

ERIC Educational Resources Information Center

Mariotti, Maria Alessandra

2012-01-01

The objective of this paper is to discuss the didactic potential offered by the use of a Dynamic Geometry System (DGS) in introducing students to theoretical thinking and specifically to the practice of proof. Starting from a discussion about what constitutes the general objective in developing students' sense of proof, the notion of Theorem is…

A result on differential inequalities and its application to higher order trajectory derivatives

NASA Technical Reports Server (NTRS)

Gunderson, R. W.

1973-01-01

A result on differential inequalities is obtained by considering the adjoint differential equation of the variational equation of the right side of the inequality. The main theorem is proved using basic results on differentiability of solutions with respect to initial conditions. The result is then applied to the problem of determining solution behavior using comparison techniques.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Akers, Chris; Bousso, Raphael; Halpern, Illan F.

We prove that the boundary of the future of a surface K consists precisely of the points p that lie on a null geodesic orthogonal to K such that between K and p there are no points conjugate to K nor intersections with another such geodesic. Our theorem has applications to holographic screens and their associated light sheets and in particular enters the proof that holographic screens satisfy an area law.

Multifield Galileons and higher codimension branes

DOE PAGES

Hinterbichler, Kurt; Trodden, Mark; Wesley, Daniel

2010-12-07

We studied a multi-field generalizations of the galileon - a popular idea of how to modify gravity to account for the acceleration of the universe. We derived an extremely restrictive theory of multiple galileon fields, and explored some properties of this theory, including proving a general non-renormalization theorem: multi-field galileons are not renormalized quantum mechanically to any loop in perturbation theory.

Oscillating solutions for nonlinear Helmholtz equations

NASA Astrophysics Data System (ADS)

Mandel, Rainer; Montefusco, Eugenio; Pellacci, Benedetta

2017-12-01

Existence results for radially symmetric oscillating solutions for a class of nonlinear autonomous Helmholtz equations are given and their exact asymptotic behaviour at infinity is established. Some generalizations to nonautonomous radial equations as well as existence results for nonradial solutions are found. Our theorems prove the existence of standing waves solutions of nonlinear Klein-Gordon or Schrödinger equations with large frequencies.

A mathematical description of the inclusive fitness theory.

PubMed

Wakano, Joe Yuichiro; Ohtsuki, Hisashi; Kobayashi, Yutaka

2013-03-01

Recent developments in the inclusive fitness theory have revealed that the direction of evolution can be analytically predicted in a wider class of models than previously thought, such as those models dealing with network structure. This paper aims to provide a mathematical description of the inclusive fitness theory. Specifically, we provide a general framework based on a Markov chain that can implement basic models of inclusive fitness. Our framework is based on the probability distribution of "offspring-to-parent map", from which the key concepts of the theory, such as fitness function, relatedness and inclusive fitness, are derived in a straightforward manner. We prove theorems showing that inclusive fitness always provides a correct prediction on which of two competing genes more frequently appears in the long run in the Markov chain. As an application of the theorems, we prove a general formula of the optimal dispersal rate in the Wright's island model with recurrent mutations. We also show the existence of the critical mutation rate, which does not depend on the number of islands and below which a positive dispersal rate evolves. Our framework can also be applied to lattice or network structured populations. Copyright © 2012 Elsevier Inc. All rights reserved.

Granular Contact Forces: Proof of "Self-Ergodicity" by Generalizing Boltzmann's Stosszahlansatz and H Theorem

NASA Technical Reports Server (NTRS)

Metzger, Philip T.

2006-01-01

Ergodicity is proved for granular contact forces. To obtain this proof from first principles, this paper generalizes Boltzmann's stosszahlansatz (molecular chaos) so that it maintains the necessary correlations and symmetries of granular packing ensembles. Then it formally counts granular contact force states and thereby defines the proper analog of Boltzmann's H functional. This functional is used to prove that (essentially) all static granular packings must exist at maximum entropy with respect to their contact forces. Therefore, the propagation of granular contact forces through a packing is a truly ergodic process in the Boltzmannian sense, or better, it is self-ergodic. Self-ergodicity refers to the non-dynamic, internal relationships that exist between the layer-by-layer and column-by-column subspaces contained within the phase space locus of any particular granular packing microstate. The generalized H Theorem also produces a recursion equation that may be solved numerically to obtain the density of single particle states and hence the distribution of granular contact forces corresponding to the condition of self-ergodicity. The predictions of the theory are overwhelmingly validated by comparison to empirical data from discrete element modeling.

Role for Automated Communication Strategies in Medication Adherence Management

PubMed Central

Ross, S. Michael

2008-01-01

Lack of medication adherence is a prevalent problem that causes a broad range of health-and health-economics-related issues. Adherence management is therefore an important strategy, but it also presents its own set of challenges. Interventional communication from care support teams at managed care organizations and disease management and wellness programs has proved effective at modifying patients' medication adherence and reporting behaviors. However, these communications do not work well from an economic standpoint. It is not economically feasible to scale call centers and the numbers of clinical and professional staff to communicate with the increasing number of patients with chronic diseases who require ongoing medication use. Using communication automation to augment traditional call center outreach can help to mediate patient medication-taking behaviors. Specific design criteria for the automation of this interaction are discussed in this article, offering supporting data from a recent trial of 304 elderly patients with hypertension, and showing the benefits of using such a system for effective blood pressure monitoring, at reduced costs. PMID:25126263

Role for automated communication strategies in medication adherence management.

PubMed

Ross, S Michael

2008-11-01

Lack of medication adherence is a prevalent problem that causes a broad range of health-and health-economics-related issues. Adherence management is therefore an important strategy, but it also presents its own set of challenges. Interventional communication from care support teams at managed care organizations and disease management and wellness programs has proved effective at modifying patients' medication adherence and reporting behaviors. However, these communications do not work well from an economic standpoint. It is not economically feasible to scale call centers and the numbers of clinical and professional staff to communicate with the increasing number of patients with chronic diseases who require ongoing medication use. Using communication automation to augment traditional call center outreach can help to mediate patient medication-taking behaviors. Specific design criteria for the automation of this interaction are discussed in this article, offering supporting data from a recent trial of 304 elderly patients with hypertension, and showing the benefits of using such a system for effective blood pressure monitoring, at reduced costs.

DG-AMMOS: a new tool to generate 3d conformation of small molecules using distance geometry and automated molecular mechanics optimization for in silico screening.

PubMed

Lagorce, David; Pencheva, Tania; Villoutreix, Bruno O; Miteva, Maria A

2009-11-13

Discovery of new bioactive molecules that could enter drug discovery programs or that could serve as chemical probes is a very complex and costly endeavor. Structure-based and ligand-based in silico screening approaches are nowadays extensively used to complement experimental screening approaches in order to increase the effectiveness of the process and facilitating the screening of thousands or millions of small molecules against a biomolecular target. Both in silico screening methods require as input a suitable chemical compound collection and most often the 3D structure of the small molecules has to be generated since compounds are usually delivered in 1D SMILES, CANSMILES or in 2D SDF formats. Here, we describe the new open source program DG-AMMOS which allows the generation of the 3D conformation of small molecules using Distance Geometry and their energy minimization via Automated Molecular Mechanics Optimization. The program is validated on the Astex dataset, the ChemBridge Diversity database and on a number of small molecules with known crystal structures extracted from the Cambridge Structural Database. A comparison with the free program Balloon and the well-known commercial program Omega generating the 3D of small molecules is carried out. The results show that the new free program DG-AMMOS is a very efficient 3D structure generator engine. DG-AMMOS provides fast, automated and reliable access to the generation of 3D conformation of small molecules and facilitates the preparation of a compound collection prior to high-throughput virtual screening computations. The validation of DG-AMMOS on several different datasets proves that generated structures are generally of equal quality or sometimes better than structures obtained by other tested methods.

Glueball spectrum and hadronic processes in low-energy QCD

NASA Astrophysics Data System (ADS)

Frasca, Marco

2010-10-01

Low-energy limit of quantum chromodynamics (QCD) is obtained using a mapping theorem recently proved. This theorem states that, classically, solutions of a massless quartic scalar field theory are approximate solutions of Yang-Mills equations in the limit of the gauge coupling going to infinity. Low-energy QCD is described by a Yukawa theory further reducible to a Nambu-Jona-Lasinio model. At the leading order one can compute glue-quark interactions and one is able to calculate the properties of the σ and η-η mesons. Finally, it is seen that all the physics of strong interactions, both in the infrared and ultraviolet limit, is described by a single constant Λ arising in the ultraviolet by dimensional transmutation and in the infrared as an integration constant.

Making Temporal Logic Calculational: A Tool for Unification and Discovery

NASA Astrophysics Data System (ADS)

Boute, Raymond

In temporal logic, calculational proofs beyond simple cases are often seen as challenging. The situation is reversed by making temporal logic calculational, yielding shorter and clearer proofs than traditional ones, and serving as a (mental) tool for unification and discovery. A side-effect of unifying theories is easier access by practicians. The starting point is a simple generic (software tool independent) Functional Temporal Calculus (FTC). Specific temporal logics are then captured via endosemantic functions. This concept reflects tacit conventions throughout mathematics and, once identified, is general and useful. FTC also yields a reasoning style that helps discovering theorems by calculation rather than just proving given facts. This is illustrated by deriving various theorems, most related to liveness issues in TLA+, and finding strengthenings of known results. Educational issues are addressed in passing.

Formal methods for modeling and analysis of hybrid systems

NASA Technical Reports Server (NTRS)

Tiwari, Ashish (Inventor); Lincoln, Patrick D. (Inventor)

2009-01-01

A technique based on the use of a quantifier elimination decision procedure for real closed fields and simple theorem proving to construct a series of successively finer qualitative abstractions of hybrid automata is taught. The resulting abstractions are always discrete transition systems which can then be used by any traditional analysis tool. The constructed abstractions are conservative and can be used to establish safety properties of the original system. The technique works on linear and non-linear polynomial hybrid systems: the guards on discrete transitions and the continuous flows in all modes can be specified using arbitrary polynomial expressions over the continuous variables. An exemplar tool in the SAL environment built over the theorem prover PVS is detailed. The technique scales well to large and complex hybrid systems.

General invertible transformation and physical degrees of freedom

NASA Astrophysics Data System (ADS)

Takahashi, Kazufumi; Motohashi, Hayato; Suyama, Teruaki; Kobayashi, Tsutomu

2017-04-01

An invertible field transformation is such that the old field variables correspond one-to-one to the new variables. As such, one may think that two systems that are related by an invertible transformation are physically equivalent. However, if the transformation depends on field derivatives, the equivalence between the two systems is nontrivial due to the appearance of higher derivative terms in the equations of motion. To address this problem, we prove the following theorem on the relation between an invertible transformation and Euler-Lagrange equations: If the field transformation is invertible, then any solution of the original set of Euler-Lagrange equations is mapped to a solution of the new set of Euler-Lagrange equations, and vice versa. We also present applications of the theorem to scalar-tensor theories.

Design and Application of Strategies/Tactics in Higher Order Logics

NASA Technical Reports Server (NTRS)

Archer, Myla (Editor); diVito, Ben (Editor); Munoz, Cesar (Editor)

2003-01-01

This Proceedings includes both a paper from the implementors of PVS providing guidance for PVS strategy writers and a tutorial on PVS strategy writing distilled from the experience of three PVS users who have written extensive sets of PVS user strategies. Following these are three full papers from the higher-order logic theorem proving community that discuss PVS strategies to enhance arithmetic and other interactive reasoning in PVS; implementing first-order tactics in higher-order provers; and a proposed technique for specifying small step semantics that can be used in multiple higher order logic theorem provers, with illustrations from both Coq and PVS. The Proceedings concludes with three position papers for a panel session that discuss three settings in which development of PVS strategies is worth while.

Superfluid helium on orbit transfer (SHOOT)

NASA Technical Reports Server (NTRS)

Dipirro, Michael J.

1987-01-01

A number of space flight experiments and entire facilities require superfluid helium as a coolant. Among these are the Space Infrared Telescope Facility (SIRTF), the Large Deployable Reflector (LDR), the Advanced X-ray Astrophysics Facility (AXAF), the Particle Astrophysics Magnet Facility (PAMF or Astromag), and perhaps even a future Hubble Space Telescope (HST) instrument. Because these systems are required to have long operational lifetimes, a means to replenish the liquid helium, which is exhausted in the cooling process, is required. The most efficient method of replenishment is to refill the helium dewars on orbit with superfluid helium (liquid helium below 2.17 Kelvin). To develop and prove the technology required for this liquid helium refill, a program of ground and flight testing was begun. The flight demonstration is baselined as a two flight program. The first, described in this paper, will prove the concepts involved at both the component and system level. The second flight will demonstrate active astronaut involvement and semi-automated operation. The current target date for the first launch is early 1991.

Shrunk loop theorem for the topology probabilities of closed Brownian (or Feynman) paths on the twice punctured plane

NASA Astrophysics Data System (ADS)

Giraud, O.; Thain, A.; Hannay, J. H.

2004-02-01

The shrunk loop theorem proved here is an integral identity which facilitates the calculation of the relative probability (or probability amplitude) of any given topology that a free, closed Brownian (or Feynman) path of a given 'duration' might have on the twice punctured plane (plane with two marked points). The result is expressed as a 'scattering' series of integrals of increasing dimensionality based on the maximally shrunk version of the path. Physically, this applies in different contexts: (i) the topology probability of a closed ideal polymer chain on a plane with two impassable points, (ii) the trace of the Schrödinger Green function, and thence spectral information, in the presence of two Aharonov-Bohm fluxes and (iii) the same with two branch points of a Riemann surface instead of fluxes. Our theorem starts from the Stovicek scattering expansion for the Green function in the presence of two Aharonov-Bohm flux lines, which itself is based on the famous Sommerfeld one puncture point solution of 1896 (the one puncture case has much easier topology, just one winding number). Stovicek's expansion itself can supply the results at the expense of choosing a base point on the loop and then integrating it away. The shrunk loop theorem eliminates this extra two-dimensional integration, distilling the topology from the geometry.

Two dissimilar approaches to dynamical systems on hyper MV -algebras and their information entropy

NASA Astrophysics Data System (ADS)

Mehrpooya, Adel; Ebrahimi, Mohammad; Davvaz, Bijan

2017-09-01

Measuring the flow of information that is related to the evolution of a system which is modeled by applying a mathematical structure is of capital significance for science and usually for mathematics itself. Regarding this fact, a major issue in concern with hyperstructures is their dynamics and the complexity of the varied possible dynamics that exist over them. Notably, the dynamics and uncertainty of hyper MV -algebras which are hyperstructures and extensions of a central tool in infinite-valued Lukasiewicz propositional calculus that models many valued logics are of primary concern. Tackling this problem, in this paper we focus on the subject of dynamical systems on hyper MV -algebras and their entropy. In this respect, we adopt two varied approaches. One is the set-based approach in which hyper MV -algebra dynamical systems are developed by employing set functions and set partitions. By the other method that is based on points and point partitions, we establish the concept of hyper injective dynamical systems on hyper MV -algebras. Next, we study the notion of entropy for both kinds of systems. Furthermore, we consider essential ergodic characteristics of those systems and their entropy. In particular, we introduce the concept of isomorphic hyper injective and hyper MV -algebra dynamical systems, and we demonstrate that isomorphic systems have the same entropy. We present a couple of theorems in order to help calculate entropy. In particular, we prove a contemporary version of addition and Kolmogorov-Sinai Theorems. Furthermore, we provide a comparison between the indispensable properties of hyper injective and semi-independent dynamical systems. Specifically, we present and prove theorems that draw comparisons between the entropies of such systems. Lastly, we discuss some possible relationships between the theories of hyper MV -algebra and MV -algebra dynamical systems.

On the M-function and Borg-Marchenko theorems for vector-valued Sturm-Liouville equations

NASA Astrophysics Data System (ADS)

Andersson, E.

2003-12-01

We will consider a vector-valued Sturm-Liouville equation of the form R[U]≔-(PU')'+QU=λWU, x∈[0,b), with P-1, W, Q∈Lloc1([0,b))m×m being Hermitian and under some additional conditions on P-1 and W. We give an elementary deduction of the leading order term asymptotics for the Titchmarsh-Weyl M-function corresponding to this equation. In the special case of P=W=I, Q∈L1([0,∞))m×m and the Neumann boundary conditions at 0, we will also prove that M=(1/√-λ )(I+R)(I-R)-1, where R=limn→∞ Rn=∑n=1∞Qn, for recursively defined sequences {Rn} and {Qn}. If Q∈Lloc1([0,b))m×m, 0

DOE Office of Scientific and Technical Information (OSTI.GOV)

Miyadera, Takayuki; Imai, Hideki; Graduate School of Science and Engineering, Chuo University, 1-13-27 Kasuga, Bunkyo-ku, Tokyo 112-8551

This paper discusses the no-cloning theorem in a logicoalgebraic approach. In this approach, an orthoalgebra is considered as a general structure for propositions in a physical theory. We proved that an orthoalgebra admits cloning operation if and only if it is a Boolean algebra. That is, only classical theory admits the cloning of states. If unsharp propositions are to be included in the theory, then a notion of effect algebra is considered. We proved that an atomic Archimedean effect algebra admitting cloning operation is a Boolean algebra. This paper also presents a partial result, indicating a relation between the cloningmore » on effect algebras and hidden variables.« less

A quantum diffusion law

NASA Astrophysics Data System (ADS)

Satpathi, Urbashi; Sinha, Supurna; Sorkin, Rafael D.

2017-12-01

We analyse diffusion at low temperature by bringing the fluctuation-dissipation theorem (FDT) to bear on a physically natural, viscous response-function R(t) . The resulting diffusion-law exhibits several distinct regimes of time and temperature, each with its own characteristic rate of spreading. As with earlier analyses, we find logarithmic spreading in the quantum regime, indicating that this behavior is robust. A consistent R(t) must satisfy the key physical requirements of Wightman positivity and passivity, and we prove that ours does so. We also prove in general that these two conditions are equivalent when the FDT holds. Given current technology, our diffusion law can be tested in a laboratory with ultra cold atoms.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Cabello, Adan

We introduce two two-player quantum pseudotelepathy games based on two recently proposed all-versus-nothing (AVN) proofs of Bell's theorem [A. Cabello, Phys. Rev. Lett. 95, 210401 (2005); Phys. Rev. A 72, 050101(R) (2005)]. These games prove that Broadbent and Methot's claim that these AVN proofs do not rule out local-hidden-variable theories in which it is possible to exchange unlimited information inside the same light cone (quant-ph/0511047) is incorrect.

Locality and simultaneous elements of reality

NASA Astrophysics Data System (ADS)

Nisticò, G.; Sestito, A.

2012-12-01

We show that the extension of quantum correlations stemming from a "strict" interpretation of the criterion of reality raises the failure of Hardy's non-locality theorem. Then, by suggesting an ideal experiment, we prove that such an extension, though strictly smaller than the one derived by Einstein, Podolsky and Rosen and usually adopted, allows for the assignment of simultaneous objective values of two non-commuting observables.

A Single Instance of the Pythagorean Theorem Implies the Parallel Postulate

ERIC Educational Resources Information Center

Dobbs, David E.

2002-01-01

This note could find use as enrichment material in a course on the classical geometries; its preliminary results could also be used in an advanced calculus course. It is proved that if a , b and c are positive real numbers such that a[squared] + b[squared] = c[squared] , then cosh ( a ) cosh ( b ) greater than cosh ( c ). The proof of this result…

On Viviani's Theorem and Its Extensions

ERIC Educational Resources Information Center

Abboud, Elias

2010-01-01

Viviani's theorem states that the sum of distances from any point inside an equilateral triangle to its sides is constant. Here, in an extension of this result, we show, using linear programming, that any convex polygon can be divided into parallel line segments on which the sum of the distances to the sides of the polygon is constant. Let us say…

Quantum Nonlocality and Reality

NASA Astrophysics Data System (ADS)

Bell, Mary; Gao, Shan

2016-09-01

Preface; Part I. John Stewart Bell: The Physicist: 1. John Bell: the Irish connection Andrew Whitaker; 2. Recollections of John Bell Michael Nauenberg; 3. John Bell: recollections of a great scientist and a great man Gian-Carlo Ghirardi; Part II. Bell's Theorem: 4. What did Bell really prove? Jean Bricmont; 5. The assumptions of Bell's proof Roderich Tumulka; 6. Bell on Bell's theorem: the changing face of nonlocality Harvey R. Brown and Christopher G. Timpson; 7. Experimental tests of Bell inequalities Marco Genovese; 8. Bell's theorem without inequalities: on the inception and scope of the GHZ theorem Olival Freire, Jr and Osvaldo Pessoa, Jr; 9. Strengthening Bell's theorem: removing the hidden-variable assumption Henry P. Stapp; Part III. Nonlocality: Illusions or Reality?: 10. Is any theory compatible with the quantum predictions necessarily nonlocal? Bernard d'Espagnat; 11. Local causality, probability and explanation Richard A. Healey; 12. Bell inequality and many-worlds interpretation Lev Vaidman; 13. Quantum solipsism and non-locality Travis Norsen; 14. Lessons of Bell's theorem: nonlocality, yes; action at a distance, not necessarily Wayne C. Myrvold; 15. Bell non-locality, Hardy's paradox and hyperplane dependence Gordon N. Fleming; 16. Some thoughts on quantum nonlocality and its apparent incompatibility with relativity Shan Gao; 17. A reasonable thing that just might work Daniel Rohrlich; 18. Weak values and quantum nonlocality Yakir Aharonov and Eliahu Cohen; Part IV. Nonlocal Realistic Theories: 19. Local beables and the foundations of physics Tim Maudlin; 20. John Bell's varying interpretations of quantum mechanics: memories and comments H. Dieter Zeh; 21. Some personal reflections on quantum non-locality and the contributions of John Bell Basil J. Hiley; 22. Bell on Bohm Sheldon Goldstein; 23. Interactions and inequality Philip Pearle; 24. Gravitation and the noise needed in objective reduction models Stephen L. Adler; 25. Towards an objective physics of Bell non-locality: palatial twistor theory Roger Penrose; 26. Measurement and macroscopicity: overcoming conceptual imprecision in quantum measurement theory Gregg Jaeger; Index.

System description: IVY

DOE Office of Scientific and Technical Information (OSTI.GOV)

McCune, W.; Shumsky, O.

2000-02-04

IVY is a verified theorem prover for first-order logic with equality. It is coded in ACL2, and it makes calls to the theorem prover Otter to search for proofs and to the program MACE to search for countermodels. Verifications of Otter and MACE are not practical because they are coded in C. Instead, Otter and MACE give detailed proofs and models that are checked by verified ACL2 programs. In addition, the initial conversion to clause form is done by verified ACL2 code. The verification is done with respect to finite interpretations.

Development of an automated pavement crack sealing system.

DOT National Transportation Integrated Search

2010-12-01

Pavement crack sealing operations remain predominantly manual due to the challenges associated with automation. The research : performed by the Georgia Tech Research Institute in conjunction with the Georgia Department of Transportation has proved in...

Abstraction and Assume-Guarantee Reasoning for Automated Software Verification

NASA Technical Reports Server (NTRS)

Chaki, S.; Clarke, E.; Giannakopoulou, D.; Pasareanu, C. S.

2004-01-01

Compositional verification and abstraction are the key techniques to address the state explosion problem associated with model checking of concurrent software. A promising compositional approach is to prove properties of a system by checking properties of its components in an assume-guarantee style. This article proposes a framework for performing abstraction and assume-guarantee reasoning of concurrent C code in an incremental and fully automated fashion. The framework uses predicate abstraction to extract and refine finite state models of software and it uses an automata learning algorithm to incrementally construct assumptions for the compositional verification of the abstract models. The framework can be instantiated with different assume-guarantee rules. We have implemented our approach in the COMFORT reasoning framework and we show how COMFORT out-performs several previous software model checking approaches when checking safety properties of non-trivial concurrent programs.

Proof-of-concept automation of propellant processing

NASA Technical Reports Server (NTRS)

Ramohalli, Kumar; Schallhorn, P. A.

1989-01-01

For space-based propellant production, automation of the process is needed. Currently, all phases of terrestrial production have some form of human interaction. A mixer was acquired to help perform the tasks of automation. A heating system to be used with the mixer was designed, built, and installed. Tests performed on the heating system verify design criteria. An IBM PS/2 personal computer was acquired for the future automation work. It is hoped that some the mixing process itself will be automated. This is a concept demonstration task; proving that propellant production can be automated reliably.

Discrete Time Rescaling Theorem: Determining Goodness of Fit for Discrete Time Statistical Models of Neural Spiking

PubMed Central

Haslinger, Robert; Pipa, Gordon; Brown, Emery

2010-01-01

One approach for understanding the encoding of information by spike trains is to fit statistical models and then test their goodness of fit. The time rescaling theorem provides a goodness of fit test consistent with the point process nature of spike trains. The interspike intervals (ISIs) are rescaled (as a function of the model’s spike probability) to be independent and exponentially distributed if the model is accurate. A Kolmogorov Smirnov (KS) test between the rescaled ISIs and the exponential distribution is then used to check goodness of fit. This rescaling relies upon assumptions of continuously defined time and instantaneous events. However spikes have finite width and statistical models of spike trains almost always discretize time into bins. Here we demonstrate that finite temporal resolution of discrete time models prevents their rescaled ISIs from being exponentially distributed. Poor goodness of fit may be erroneously indicated even if the model is exactly correct. We present two adaptations of the time rescaling theorem to discrete time models. In the first we propose that instead of assuming the rescaled times to be exponential, the reference distribution be estimated through direct simulation by the fitted model. In the second, we prove a discrete time version of the time rescaling theorem which analytically corrects for the effects of finite resolution. This allows us to define a rescaled time which is exponentially distributed, even at arbitrary temporal discretizations. We demonstrate the efficacy of both techniques by fitting Generalized Linear Models (GLMs) to both simulated spike trains and spike trains recorded experimentally in monkey V1 cortex. Both techniques give nearly identical results, reducing the false positive rate of the KS test and greatly increasing the reliability of model evaluation based upon the time rescaling theorem. PMID:20608868

Discrete time rescaling theorem: determining goodness of fit for discrete time statistical models of neural spiking.

PubMed

Haslinger, Robert; Pipa, Gordon; Brown, Emery

2010-10-01

One approach for understanding the encoding of information by spike trains is to fit statistical models and then test their goodness of fit. The time-rescaling theorem provides a goodness-of-fit test consistent with the point process nature of spike trains. The interspike intervals (ISIs) are rescaled (as a function of the model's spike probability) to be independent and exponentially distributed if the model is accurate. A Kolmogorov-Smirnov (KS) test between the rescaled ISIs and the exponential distribution is then used to check goodness of fit. This rescaling relies on assumptions of continuously defined time and instantaneous events. However, spikes have finite width, and statistical models of spike trains almost always discretize time into bins. Here we demonstrate that finite temporal resolution of discrete time models prevents their rescaled ISIs from being exponentially distributed. Poor goodness of fit may be erroneously indicated even if the model is exactly correct. We present two adaptations of the time-rescaling theorem to discrete time models. In the first we propose that instead of assuming the rescaled times to be exponential, the reference distribution be estimated through direct simulation by the fitted model. In the second, we prove a discrete time version of the time-rescaling theorem that analytically corrects for the effects of finite resolution. This allows us to define a rescaled time that is exponentially distributed, even at arbitrary temporal discretizations. We demonstrate the efficacy of both techniques by fitting generalized linear models to both simulated spike trains and spike trains recorded experimentally in monkey V1 cortex. Both techniques give nearly identical results, reducing the false-positive rate of the KS test and greatly increasing the reliability of model evaluation based on the time-rescaling theorem.

A Generalization of the Karush-Kuhn-Tucker Theorem for Approximate Solutions of Mathematical Programming Problems Based on Quadratic Approximation

NASA Astrophysics Data System (ADS)

Voloshinov, V. V.

2018-03-01

In computations related to mathematical programming problems, one often has to consider approximate, rather than exact, solutions satisfying the constraints of the problem and the optimality criterion with a certain error. For determining stopping rules for iterative procedures, in the stability analysis of solutions with respect to errors in the initial data, etc., a justified characteristic of such solutions that is independent of the numerical method used to obtain them is needed. A necessary δ-optimality condition in the smooth mathematical programming problem that generalizes the Karush-Kuhn-Tucker theorem for the case of approximate solutions is obtained. The Lagrange multipliers corresponding to the approximate solution are determined by solving an approximating quadratic programming problem.

Higher-order Fourier analysis over finite fields and applications

NASA Astrophysics Data System (ADS)

Hatami, Pooya

Higher-order Fourier analysis is a powerful tool in the study of problems in additive and extremal combinatorics, for instance the study of arithmetic progressions in primes, where the traditional Fourier analysis comes short. In recent years, higher-order Fourier analysis has found multiple applications in computer science in fields such as property testing and coding theory. In this thesis, we develop new tools within this theory with several new applications such as a characterization theorem in algebraic property testing. One of our main contributions is a strong near-equidistribution result for regular collections of polynomials. The densities of small linear structures in subsets of Abelian groups can be expressed as certain analytic averages involving linear forms. Higher-order Fourier analysis examines such averages by approximating the indicator function of a subset by a function of bounded number of polynomials. Then, to approximate the average, it suffices to know the joint distribution of the polynomials applied to the linear forms. We prove a near-equidistribution theorem that describes these distributions for the group F(n/p) when p is a fixed prime. This fundamental fact was previously known only under various extra assumptions about the linear forms or the field size. We use this near-equidistribution theorem to settle a conjecture of Gowers and Wolf on the true complexity of systems of linear forms. Our next application is towards a characterization of testable algebraic properties. We prove that every locally characterized affine-invariant property of functions f : F(n/p) → R with n∈ N, is testable. In fact, we prove that any such property P is proximity-obliviously testable. More generally, we show that any affine-invariant property that is closed under subspace restrictions and has "bounded complexity" is testable. We also prove that any property that can be described as the property of decomposing into a known structure of low-degree polynomials is locally characterized and is, hence, testable. We discuss several notions of regularity which allow us to deduce algorithmic versions of various regularity lemmas for polynomials by Green and Tao and by Kaufman and Lovett. We show that our algorithmic regularity lemmas for polynomials imply algorithmic versions of several results relying on regularity, such as decoding Reed-Muller codes beyond the list decoding radius (for certain structured errors), and prescribed polynomial decompositions. Finally, motivated by the definition of Gowers norms, we investigate norms defined by different systems of linear forms. We give necessary conditions on the structure of systems of linear forms that define norms. We prove that such norms can be one of only two types, and assuming that |F p| is sufficiently large, they essentially are equivalent to either a Gowers norm or Lp norms.

Statistical mechanics of the international trade network.

PubMed

Fronczak, Agata; Fronczak, Piotr

2012-05-01

Analyzing real data on international trade covering the time interval 1950-2000, we show that in each year over the analyzed period the network is a typical representative of the ensemble of maximally random weighted networks, whose directed connections (bilateral trade volumes) are only characterized by the product of the trading countries' GDPs. It means that time evolution of this network may be considered as a continuous sequence of equilibrium states, i.e., a quasistatic process. This, in turn, allows one to apply the linear response theory to make (and also verify) simple predictions about the network. In particular, we show that bilateral trade fulfills a fluctuation-response theorem, which states that the average relative change in imports (exports) between two countries is a sum of the relative changes in their GDPs. Yearly changes in trade volumes prove that the theorem is valid.

Statistical mechanics of the international trade network

NASA Astrophysics Data System (ADS)

Fronczak, Agata; Fronczak, Piotr

2012-05-01

Analyzing real data on international trade covering the time interval 1950-2000, we show that in each year over the analyzed period the network is a typical representative of the ensemble of maximally random weighted networks, whose directed connections (bilateral trade volumes) are only characterized by the product of the trading countries' GDPs. It means that time evolution of this network may be considered as a continuous sequence of equilibrium states, i.e., a quasistatic process. This, in turn, allows one to apply the linear response theory to make (and also verify) simple predictions about the network. In particular, we show that bilateral trade fulfills a fluctuation-response theorem, which states that the average relative change in imports (exports) between two countries is a sum of the relative changes in their GDPs. Yearly changes in trade volumes prove that the theorem is valid.

Verifying the interactive convergence clock synchronization algorithm using the Boyer-Moore theorem prover

NASA Technical Reports Server (NTRS)

Young, William D.

1992-01-01

The application of formal methods to the analysis of computing systems promises to provide higher and higher levels of assurance as the sophistication of our tools and techniques increases. Improvements in tools and techniques come about as we pit the current state of the art against new and challenging problems. A promising area for the application of formal methods is in real-time and distributed computing. Some of the algorithms in this area are both subtle and important. In response to this challenge and as part of an ongoing attempt to verify an implementation of the Interactive Convergence Clock Synchronization Algorithm (ICCSA), we decided to undertake a proof of the correctness of the algorithm using the Boyer-Moore theorem prover. This paper describes our approach to proving the ICCSA using the Boyer-Moore prover.

Existence of Hartree-Fock excited states for atoms and molecules

NASA Astrophysics Data System (ADS)

Lewin, Mathieu

2018-04-01

For neutral and positively charged atoms and molecules, we prove the existence of infinitely many Hartree-Fock critical points below the first energy threshold (that is, the lowest energy of the same system with one electron removed). This is the equivalent, in Hartree-Fock theory, of the famous Zhislin-Sigalov theorem which states the existence of infinitely many eigenvalues below the bottom of the essential spectrum of the N-particle linear Schrödinger operator. Our result improves a theorem of Lions in 1987 who already constructed infinitely many Hartree-Fock critical points, but with much higher energy. Our main contribution is the proof that the Hartree-Fock functional satisfies the Palais-Smale property below the first energy threshold. We then use minimax methods in the N-particle space, instead of working in the one-particle space.

Quantum computing without wavefunctions: time-dependent density functional theory for universal quantum computation.

PubMed

Tempel, David G; Aspuru-Guzik, Alán

2012-01-01

We prove that the theorems of TDDFT can be extended to a class of qubit Hamiltonians that are universal for quantum computation. The theorems of TDDFT applied to universal Hamiltonians imply that single-qubit expectation values can be used as the basic variables in quantum computation and information theory, rather than wavefunctions. From a practical standpoint this opens the possibility of approximating observables of interest in quantum computations directly in terms of single-qubit quantities (i.e. as density functionals). Additionally, we also demonstrate that TDDFT provides an exact prescription for simulating universal Hamiltonians with other universal Hamiltonians that have different, and possibly easier-to-realize two-qubit interactions. This establishes the foundations of TDDFT for quantum computation and opens the possibility of developing density functionals for use in quantum algorithms.

Vafa-Witten theorem and Lee-Yang singularities

DOE Office of Scientific and Technical Information (OSTI.GOV)

Aguado, M.; Asorey, M.

2009-12-15

We prove the analyticity of the finite volume QCD partition function for complex values of the {theta}-vacuum parameter. The absence of singularities different from Lee-Yang zeros only permits and cusp singularities in the vacuum energy density and never or cusps. This fact together with the Vafa-Witten diamagnetic inequality implies the vanishing of the density of Lee-Yang zeros at {theta}=0 and has an important consequence: the absence of a first order phase transition at {theta}=0. The result provides a key missing link in the Vafa-Witten proof of parity symmetry conservation in vectorlike gauge theories and follows from renormalizability, unitarity, positivity, andmore » existence of Bogomol'nyi-Prasad-Sommerfield bounds. Generalizations of this theorem to other physical systems are also discussed, with particular interest focused on the nonlinear CP{sup N} sigma model.« less

Using the analysis of stress waves to build research for experimentation on ultrasonic film measurement

NASA Astrophysics Data System (ADS)

Chang, Shi-Shing; Wu, John H.

1993-09-01

After the 2th world war, although the application of ultrasonic wave in industries is becoming more and more popular. But due to the restriction of the precise equivelent , experimental method and the support of the basic theoremsetc. Ultrasonic wave is not applied in precise measurement. Nowadays due to many conditions - the improvement in the production technic, the precise of the equivelent, causes to increase the application of ultrasonic wave. But it's still limited due to the lack of measurement and analysis theorem. In this paper, first we caculate translation of the stress wave (elastic wave) in material for the free surface of material by a normal impulse load. as the theorem analysis base in real application. It is applied to an experiment of film measurement. We can find the partical motion in material and the arriving time of wave front. Then we can estimate the thickness of layers and can prove the actual condition with the result of experiment. This resarch is not only in the theoretical investigation but also in setting overall the measurement system, and excutes the following three experiments: the thickness measurement of two layers, the thickness measurement of film material. the thickness measurement of air propagation. About the data processing, we relied on the frequency analysis to evalute the time difference of two overlapped ultrasonic wave signal. in the meanwhile. we also designed several computer programs to assist the sonic wave identification and signal analysis.

Possible violation of the optical theorem in LHC experiments

NASA Astrophysics Data System (ADS)

Kupczynski, M.

2014-12-01

The optical theorem (OT), allowing the determination of the total cross section for a hadron-hadron scattering from the imaginary part of the forward elastic scattering amplitude, is believed to be an unavoidable consequence of the conservation of probability and of the unitary S matrix. This is a fundamental theorem which contains an imaginary part of the forward elastic scattering amplitude that is not directly measurable. The impossibility of scattering phenomena without the elastic channel is considered to be a part of the quantum magic. However, if one takes seriously the idea that the hadrons are extended particles, one may define a unitary S matrix such that one cannot prove the OT. Moreover, data violating the OT do exist, but they are not conclusive due to the uncertainties related to the extrapolation of the differential elastic cross-section to the forward direction. These results were published several years ago, but they were forgotten. In this paper we will recall these results in an understandable way, and we will give the additional arguments why the OT can be violated in high energy strong interaction scattering and why it should be tested and not simply used as a tool in LHC experiments.

The generalized second law implies a quantum singularity theorem

NASA Astrophysics Data System (ADS)

Wall, Aron C.

2013-08-01

The generalized second law can be used to prove a singularity theorem, by generalizing the notion of a trapped surface to quantum situations. Like Penrose’s original singularity theorem, it implies that spacetime is null-geodesically incomplete inside black holes, and to the past of spatially infinite Friedmann-Robertson-Walker cosmologies. If space is finite instead, the generalized second law requires that there only be a finite amount of entropy producing processes in the past, unless there is a reversal of the arrow of time. In asymptotically flat spacetime, the generalized second law also rules out traversable wormholes, negative masses, and other forms of faster-than-light travel between asymptotic regions, as well as closed timelike curves. Furthermore it is impossible to form baby universes which eventually become independent of the mother universe, or to restart inflation. Since the semiclassical approximation is used only in regions with low curvature, it is argued that the results may hold in full quantum gravity. The introduction describes the second law and its time-reverse, in ordinary and generalized thermodynamics, using either the fine-grained or the coarse-grained entropy. (The fine-grained version is used in all results except those relating to the arrow of time.)

Serre duality, Abel's theorem, and Jacobi inversion for supercurves over a thick superpoint

NASA Astrophysics Data System (ADS)

Rothstein, Mitchell J.; Rabin, Jeffrey M.

2015-04-01

The principal aim of this paper is to extend Abel's theorem to the setting of complex supermanifolds of dimension 1 | q over a finite-dimensional local supercommutative C-algebra. The theorem is proved by establishing a compatibility of Serre duality for the supercurve with Poincaré duality on the reduced curve. We include an elementary algebraic proof of the requisite form of Serre duality, closely based on the account of the reduced case given by Serre in Algebraic groups and class fields, combined with an invariance result for the topology on the dual of the space of répartitions. Our Abel map, taking Cartier divisors of degree zero to the dual of the space of sections of the Berezinian sheaf, modulo periods, is defined via Penkov's characterization of the Berezinian sheaf as the cohomology of the de Rham complex of the sheaf D of differential operators. We discuss the Jacobi inversion problem for the Abel map and give an example demonstrating that if n is an integer sufficiently large that the generic divisor of degree n is linearly equivalent to an effective divisor, this need not be the case for all divisors of degree n.

Systems of nonlinear algebraic equations with positive solutions.

PubMed

Ciurte, Anca; Nedevschi, Sergiu; Rasa, Ioan

2017-01-01

We are concerned with the positive solutions of an algebraic system depending on a parameter [Formula: see text] and arising in economics. For [Formula: see text] we prove that the system has at least a solution. For [Formula: see text] we give three proofs of the existence and a proof of the uniqueness of the solution. Brouwer's theorem and inequalities involving convex functions are essential tools in our proofs.

Dynamic contact problem with adhesion and damage between thermo-electro-elasto-viscoplastic bodies

NASA Astrophysics Data System (ADS)

Hadj ammar, Tedjani; Saïdi, Abdelkader; Azeb Ahmed, Abdelaziz

2017-05-01

We study of a dynamic contact problem between two thermo-electro-elasto-viscoplastic bodies with damage and adhesion. The contact is frictionless and is modeled with normal compliance condition. We derive variational formulation for the model and prove an existence and uniqueness result of the weak solution. The proof is based on arguments of evolutionary variational inequalities, parabolic inequalities, differential equations, and fixed point theorem.

On the invariant mass conjecture in general relativity

NASA Astrophysics Data System (ADS)

Chruściel, Piotr T.

1988-06-01

An asymptotic symmetries theorem is proved under certain hypotheses on the behaviour of the metric at spatial infinity. This implies that the Einstein-von Freud-ADM mass can be invariantly assigned to an asymptotically flat four dimensional end of an asymptotically empty solution of Einstein equations if the metric is a no-radiation metric or if the end is defined in terms of a collection of boost-type domains.

Generalized statistical complexity measures: Geometrical and analytical properties

NASA Astrophysics Data System (ADS)

Martin, M. T.; Plastino, A.; Rosso, O. A.

2006-09-01

We discuss bounds on the values adopted by the generalized statistical complexity measures [M.T. Martin et al., Phys. Lett. A 311 (2003) 126; P.W. Lamberti et al., Physica A 334 (2004) 119] introduced by López Ruiz et al. [Phys. Lett. A 209 (1995) 321] and Shiner et al. [Phys. Rev. E 59 (1999) 1459]. Several new theorems are proved and illustrated with reference to the celebrated logistic map.

Boundary of the future of a surface

DOE PAGES

Akers, Chris; Bousso, Raphael; Halpern, Illan F.; ...

2018-01-12

We prove that the boundary of the future of a surface K consists precisely of the points p that lie on a null geodesic orthogonal to K such that between K and p there are no points conjugate to K nor intersections with another such geodesic. Our theorem has applications to holographic screens and their associated light sheets and in particular enters the proof that holographic screens satisfy an area law.

Periodicity in cell dynamics in some mathematical models for the treatment of leukemia

NASA Astrophysics Data System (ADS)

Halanay, A.

2012-11-01

A model for the evolution of short-term hematopoietic stem cells and of leukocytes in leucemia under periodic treatment is introduced. It consists of a system of periodic delay differential equations and takes into consideration the asymmetric division. A guiding function is used, together with a theorem of Krasnoselskii, to prove the existence of a strictly positive periodic solution and its stability is investigated.

On an application of conformal maps to inequalities for rational functions

NASA Astrophysics Data System (ADS)

Dubinin, V. N.

2002-04-01

Using classical properties of conformal maps, we get new exact inequalities for rational functions with prescribed poles. In particular, we prove a new Bernstein-type inequality, an inequality for Blaschke products and a theorem that generalizes the Turan inequality for polynomials. The estimates obtained strengthen some familiar inequalities of Videnskii and Rusak. They are also related to recent results of Borwein, Erdelyi, Li, Mohapatra, Rodriguez, Aziz and others.

Issues in Adaptive Planning

DTIC Science & Technology

1986-06-30

approach to the application of theorem proving to problem solving, Aritificial Intelligence 2 (1Q71), 18Q- 208. 4. Fikes, R., Hart, P. and Nilsson, N...by emphasizing the structure of knowledge. 1.2. Planning Literature The earliest work in planning in Artificial Intelligence grew out of the work on...References 1. Newell, A., Artificial Intelligence and the concept of mind, in Computer models of thought and language, Schank, R. and Colby, K. (editor

Arbitrary nonlinearity is sufficient to represent all functions by neural networks - A theorem

NASA Technical Reports Server (NTRS)

Kreinovich, Vladik YA.

1991-01-01

It is proved that if we have neurons implementing arbitrary linear functions and a neuron implementing one (arbitrary but smooth) nonlinear function g(x), then for every continuous function f(x sub 1,..., x sub m) of arbitrarily many variables, and for arbitrary e above 0, we can construct a network that consists of g-neurons and linear neurons, and computes f with precision e.

Asymptotic Behavior of Solutions of Systems of Neutral and Convolution Equations

NASA Astrophysics Data System (ADS)

Basit, Bolis; Günzler, Hans

1998-10-01

Suppose J=[α, ∞) for someα∈R or J=R and letXbe a Banach space. We study asymptotic behavior of solutions on J of neutral system of equations with values inX. This reduces to questions concerning the behavior of solutions of convolution equations (*)H∗Ω=b, whereH=(Hj, k) is anr×rmatrix,Hj, k∈D‧L1,b=(bj) andbj∈D‧(R, X), for 1⩽j, k⩽r. We prove that ifΩis a bounded uniformly continuous solution of (*) withbfrom some translation invariant suitably closed class A, thenΩbelongs to A, provided, for example, that det Hhas countably many zeros on R andc0⊄X. In particular, ifbis (asymptotically) almost periodic, almost automorphic or recurrent,Ωis too. Our results extend theorems of Bohr, Neugebauer, Bochner, Doss, Basit, and Zhikov and also, certain theorems of Fink, Madych, Staffans, and others. Also, we investigate bounded solutions of (*). This leads to an extension of the known classes of almost periodicity to larger classes called mean-classes. We explore mean-classes and prove that bounded solutions of (*) belong to mean-classes provided certain conditions hold. These results seem new even for the simplest difference equationΩ(t+1)-Ω(t)=b(t) with J=X=R andbStepanoff almost periodic.

SU(p,q) coherent states and a Gaussian de Finetti theorem

NASA Astrophysics Data System (ADS)

Leverrier, Anthony

2018-04-01

We prove a generalization of the quantum de Finetti theorem when the local space is an infinite-dimensional Fock space. In particular, instead of considering the action of the permutation group on n copies of that space, we consider the action of the unitary group U(n) on the creation operators of the n modes and define a natural generalization of the symmetric subspace as the space of states invariant under unitaries in U(n). Our first result is a complete characterization of this subspace, which turns out to be spanned by a family of generalized coherent states related to the special unitary group SU(p, q) of signature (p, q). More precisely, this construction yields a unitary representation of the noncompact simple real Lie group SU(p, q). We therefore find a dual unitary representation of the pair of groups U(n) and SU(p, q) on an n(p + q)-mode Fock space. The (Gaussian) SU(p, q) coherent states resolve the identity on the symmetric subspace, which implies a Gaussian de Finetti theorem stating that tracing over a few modes of a unitary-invariant state yields a state close to a mixture of Gaussian states. As an application of this de Finetti theorem, we show that the n × n upper-left submatrix of an n × n Haar-invariant unitary matrix is close in total variation distance to a matrix of independent normal variables if n3 = O(m).

Construction of normal-regular decisions of Bessel typed special system

NASA Astrophysics Data System (ADS)

Tasmambetov, Zhaksylyk N.; Talipova, Meiramgul Zh.

2017-09-01

Studying a special system of differential equations in the separate production of the second order is solved by the degenerate hypergeometric function reducing to the Bessel functions of two variables. To construct a solution of this system near regular and irregular singularities, we use the method of Frobenius-Latysheva applying the concepts of rank and antirank. There is proved the basic theorem that establishes the existence of four linearly independent solutions of studying system type of Bessel. To prove the existence of normal-regular solutions we establish necessary conditions for the existence of such solutions. The existence and convergence of a normally regular solution are shown using the notion of rank and antirank.

Deterministic Approach to the Kinetic Theory of Gases

NASA Astrophysics Data System (ADS)

Beck, József

2010-02-01

In the so-called Bernoulli model of the kinetic theory of gases, where (1) the particles are dimensionless points, (2) they are contained in a cube container, (3) no attractive or exterior forces are acting on them, (4) there is no collision between the particles, (5) the collision against the walls of the container are according to the law of elastic reflection, we deduce from Newtonian mechanics two local probabilistic laws: a Poisson limit law and a central limit theorem. We also prove some global law of large numbers, justifying that "density" and "pressure" are constant. Finally, as a byproduct of our research, we prove the surprising super-uniformity of the typical billiard path in a square.

On Schrödinger's bridge problem

NASA Astrophysics Data System (ADS)

Friedland, S.

2017-11-01

In the first part of this paper we generalize Georgiou-Pavon's result that a positive square matrix can be scaled uniquely to a column stochastic matrix which maps a given positive probability vector to another given positive probability vector. In the second part we prove that a positive quantum channel can be scaled to another positive quantum channel which maps a given positive definite density matrix to another given positive definite density matrix using Brouwer's fixed point theorem. This result proves the Georgiou-Pavon conjecture for two positive definite density matrices, made in their recent paper. We show that the fixed points are unique for certain pairs of positive definite density matrices. Bibliography: 15 titles.

Existence and instability of steady states for a triangular cross-diffusion system: A computer-assisted proof

NASA Astrophysics Data System (ADS)

Breden, Maxime; Castelli, Roberto

2018-05-01

In this paper, we present and apply a computer-assisted method to study steady states of a triangular cross-diffusion system. Our approach consist in an a posteriori validation procedure, that is based on using a fixed point argument around a numerically computed solution, in the spirit of the Newton-Kantorovich theorem. It allows to prove the existence of various non homogeneous steady states for different parameter values. In some situations, we obtain as many as 13 coexisting steady states. We also apply the a posteriori validation procedure to study the linear stability of the obtained steady states, proving that many of them are in fact unstable.

Almost commuting self-adjoint matrices: The real and self-dual cases

NASA Astrophysics Data System (ADS)

Loring, Terry A.; Sørensen, Adam P. W.

2016-08-01

We show that a pair of almost commuting self-adjoint, symmetric matrices is close to a pair of commuting self-adjoint, symmetric matrices (in a uniform way). Moreover, we prove that the same holds with self-dual in place of symmetric and also for paths of self-adjoint matrices. Since a symmetric, self-adjoint matrix is real, we get a real version of Huaxin Lin’s famous theorem on almost commuting matrices. Similarly, the self-dual case gives a version for matrices over the quaternions. To prove these results, we develop a theory of semiprojectivity for real C*-algebras and also examine various definitions of low-rank for real C*-algebras.

The Successful Development of an Automated Rendezvous and Capture (AR&C) System for the National Aeronautics and Space Administration

NASA Technical Reports Server (NTRS)

Roe, Fred D.; Howard, Richard T.

2003-01-01

During the 1990's, the Marshall Space Flight Center (MSFC) conducted pioneering research in the development of an automated rendezvous and capture/docking (AR&C) system for U.S. space vehicles. Development and demonstration of a rendezvous sensor was identified early in the AR&C Program as the critical enabling technology that allows automated proximity operations and docking. A first generation rendezvous sensor, the Video Guidance Sensor (VGS), was developed and successfully flown on STS-87 and STS-95, proving the concept of a video- based sensor. A ground demonstration of the entire system and software was successfully tested. Advances in both video and signal processing technologies and the lessons learned from the two successful flight experiments provided a baseline for the development, by the MSFC, of a new generation of video based rendezvous sensor. The Advanced Video Guidance Sensor (AGS) has greatly increased performance and additional capability for longer-range operation with a new target designed as a direct replacement for existing ISS hemispherical reflectors.

Automation: how much is too much?

PubMed

Hancock, P A

2014-01-01

The headlong rush to automate continues apace. The dominant question still remains whether we can automate, not whether we should automate. However, it is this latter question that is featured and considered explicitly here. The suggestion offered is that unlimited automation of all technical functions will eventually prove anathema to the fundamental quality of human life. Examples of tasks, pursuits and past-times that should potentially be excused from the automation imperative are discussed. This deliberation leads us back to the question of balance in the cooperation, coordination and potential conflict between humans and the machines they create.

An Automated Motion Detection and Reward System for Animal Training.

PubMed

Miller, Brad; Lim, Audrey N; Heidbreder, Arnold F; Black, Kevin J

2015-12-04

A variety of approaches has been used to minimize head movement during functional brain imaging studies in awake laboratory animals. Many laboratories expend substantial effort and time training animals to remain essentially motionless during such studies. We could not locate an "off-the-shelf" automated training system that suited our needs.  We developed a time- and labor-saving automated system to train animals to hold still for extended periods of time. The system uses a personal computer and modest external hardware to provide stimulus cues, monitor movement using commercial video surveillance components, and dispense rewards. A custom computer program automatically increases the motionless duration required for rewards based on performance during the training session but allows changes during sessions. This system was used to train cynomolgus monkeys (Macaca fascicularis) for awake neuroimaging studies using positron emission tomography (PET) and functional magnetic resonance imaging (fMRI). The automated system saved the trainer substantial time, presented stimuli and rewards in a highly consistent manner, and automatically documented training sessions. We have limited data to prove the training system's success, drawn from the automated records during training sessions, but we believe others may find it useful. The system can be adapted to a range of behavioral training/recording activities for research or commercial applications, and the software is freely available for non-commercial use.

Airport Surface Traffic Automation Study.

DTIC Science & Technology

1988-05-09

the use of Artificial Intellignece * technology in enroute ATC can be applied directly to the surface control problem. 7.6 Development Approach The next...problems in airport surface control. If artificial intelligance provides useful results for airborne automation, the same techniques should prove useful

The Non-Signalling theorem in generalizations of Bell's theorem

NASA Astrophysics Data System (ADS)

Walleczek, J.; Grössing, G.

2014-04-01

Does "epistemic non-signalling" ensure the peaceful coexistence of special relativity and quantum nonlocality? The possibility of an affirmative answer is of great importance to deterministic approaches to quantum mechanics given recent developments towards generalizations of Bell's theorem. By generalizations of Bell's theorem we here mean efforts that seek to demonstrate the impossibility of any deterministic theories to obey the predictions of Bell's theorem, including not only local hidden-variables theories (LHVTs) but, critically, of nonlocal hidden-variables theories (NHVTs) also, such as de Broglie-Bohm theory. Naturally, in light of the well-established experimental findings from quantum physics, whether or not a deterministic approach to quantum mechanics, including an emergent quantum mechanics, is logically possible, depends on compatibility with the predictions of Bell's theorem. With respect to deterministic NHVTs, recent attempts to generalize Bell's theorem have claimed the impossibility of any such approaches to quantum mechanics. The present work offers arguments showing why such efforts towards generalization may fall short of their stated goal. In particular, we challenge the validity of the use of the non-signalling theorem as a conclusive argument in favor of the existence of free randomness, and therefore reject the use of the non-signalling theorem as an argument against the logical possibility of deterministic approaches. We here offer two distinct counter-arguments in support of the possibility of deterministic NHVTs: one argument exposes the circularity of the reasoning which is employed in recent claims, and a second argument is based on the inconclusive metaphysical status of the non-signalling theorem itself. We proceed by presenting an entirely informal treatment of key physical and metaphysical assumptions, and of their interrelationship, in attempts seeking to generalize Bell's theorem on the basis of an ontic, foundational interpretation of the non-signalling theorem. We here argue that the non-signalling theorem must instead be viewed as an epistemic, operational theorem i.e. one that refers exclusively to what epistemic agents can, or rather cannot, do. That is, we emphasize that the non-signalling theorem is a theorem about the operational inability of epistemic agents to signal information. In other words, as a proper principle, the non-signalling theorem may only be employed as an epistemic, phenomenological, or operational principle. Critically, our argument emphasizes that the non-signalling principle must not be used as an ontic principle about physical reality as such, i.e. as a theorem about the nature of physical reality independently of epistemic agents e.g. human observers. One major reason in favor of our conclusion is that any definition of signalling or of non-signalling invariably requires a reference to epistemic agents, and what these agents can actually measure and report. Otherwise, the non-signalling theorem would equal a general "no-influence" theorem. In conclusion, under the assumption that the non-signalling theorem is epistemic (i.e. "epistemic non-signalling"), the search for deterministic approaches to quantum mechanics, including NHVTs and an emergent quantum mechanics, continues to be a viable research program towards disclosing the foundations of physical reality at its smallest dimensions.

Fluctuation Theorem for Many-Body Pure Quantum States.

PubMed

Iyoda, Eiki; Kaneko, Kazuya; Sagawa, Takahiro

2017-09-08

We prove the second law of thermodynamics and the nonequilibrium fluctuation theorem for pure quantum states. The entire system obeys reversible unitary dynamics, where the initial state of the heat bath is not the canonical distribution but is a single energy eigenstate that satisfies the eigenstate-thermalization hypothesis. Our result is mathematically rigorous and based on the Lieb-Robinson bound, which gives the upper bound of the velocity of information propagation in many-body quantum systems. The entanglement entropy of a subsystem is shown connected to thermodynamic heat, highlighting the foundation of the information-thermodynamics link. We confirmed our theory by numerical simulation of hard-core bosons, and observed dynamical crossover from thermal fluctuations to bare quantum fluctuations. Our result reveals a universal scenario that the second law emerges from quantum mechanics, and can be experimentally tested by artificial isolated quantum systems such as ultracold atoms.

Chiral Luttinger liquids and a generalized Luttinger's theorem in fractional quantum Hall edges via finite-entanglement scaling

NASA Astrophysics Data System (ADS)

Varjas, Daniel; Zaletel, Michael; Moore, Joel

2014-03-01

We use bosonic field theories and the infinite system density matrix renormalization group (iDMRG) method to study infinite strips of fractional quantum Hall (FQH) states starting from microscopic Hamiltonians. Finite-entanglement scaling allows us to accurately measure chiral central charge, edge mode exponents and momenta without finite-size errors. We analyze states in the first and second level of the standard hierarchy and compare our results to predictions of the chiral Luttinger liquid (χLL) theory. The results confirm the universality of scaling exponents in chiral edges and demonstrate that renormalization is subject to universal relations in the non-chiral case. We prove a generalized Luttinger's theorem involving all singularities in the momentum-resolved density, which naturally arises when mapping Landau levels on a cylinder to a fermion chain and deepens our understanding of non-Fermi liquids in 1D.

Chiral Luttinger liquids and a generalized Luttinger theorem in fractional quantum Hall edges via finite-entanglement scaling

NASA Astrophysics Data System (ADS)

Varjas, Dániel; Zaletel, Michael P.; Moore, Joel E.

2013-10-01

We use bosonic field theories and the infinite system density matrix renormalization group method to study infinite strips of fractional quantum Hall states starting from microscopic Hamiltonians. Finite-entanglement scaling allows us to accurately measure chiral central charge, edge-mode exponents, and momenta without finite-size errors. We analyze states in the first and second levels of the standard hierarchy and compare our results to predictions of the chiral Luttinger liquid theory. The results confirm the universality of scaling exponents in chiral edges and demonstrate that renormalization is subject to universal relations in the nonchiral case. We prove a generalized Luttinger theorem involving all singularities in the momentum-resolved density, which naturally arises when mapping Landau levels on a cylinder to a fermion chain and deepens our understanding of non-Fermi liquids in one dimension.

A Liouville type theorem for Lane-Emden systems involving the fractional Laplacian

NASA Astrophysics Data System (ADS)

Quaas, Alexander; Xia, Aliang

2016-08-01

We establish a Liouville type theorem for the fractional Lane-Emden system: {(-Δ)αu=vqin  RN,(-Δ)αv=upin  RN, where α \\in (0,1) , N>2α and p, q are positive real numbers and in an appropriate new range. To prove our result we will use the local realization of fractional Laplacian, which can be constructed as a Dirichlet-to-Neumann operator of a degenerate elliptic equation in the spirit of Caffarelli and Silvestre (2007 Commun. PDE 32 1245-60). Our proof is based on a monotonicity argument for suitable transformed functions and the method of moving planes in a half infinite cylinder ({IR}× S+N , where S+N is the half unit sphere in {{{R}}N+1} ) based on maximum principles which are obtained by barrier functions and a coupling argument using a fractional Sobolev trace inequality.

Melnikov processes and chaos in randomly perturbed dynamical systems

NASA Astrophysics Data System (ADS)

Yagasaki, Kazuyuki

2018-07-01

We consider a wide class of randomly perturbed systems subjected to stationary Gaussian processes and show that chaotic orbits exist almost surely under some nondegenerate condition, no matter how small the random forcing terms are. This result is very contrasting to the deterministic forcing case, in which chaotic orbits exist only if the influence of the forcing terms overcomes that of the other terms in the perturbations. To obtain the result, we extend Melnikov’s method and prove that the corresponding Melnikov functions, which we call the Melnikov processes, have infinitely many zeros, so that infinitely many transverse homoclinic orbits exist. In addition, a theorem on the existence and smoothness of stable and unstable manifolds is given and the Smale–Birkhoff homoclinic theorem is extended in an appropriate form for randomly perturbed systems. We illustrate our theory for the Duffing oscillator subjected to the Ornstein–Uhlenbeck process parametrically.

Scattering amplitudes from multivariate polynomial division

NASA Astrophysics Data System (ADS)

Mastrolia, Pierpaolo; Mirabella, Edoardo; Ossola, Giovanni; Peraro, Tiziano

2012-11-01

We show that the evaluation of scattering amplitudes can be formulated as a problem of multivariate polynomial division, with the components of the integration-momenta as indeterminates. We present a recurrence relation which, independently of the number of loops, leads to the multi-particle pole decomposition of the integrands of the scattering amplitudes. The recursive algorithm is based on the weak Nullstellensatz theorem and on the division modulo the Gröbner basis associated to all possible multi-particle cuts. We apply it to dimensionally regulated one-loop amplitudes, recovering the well-known integrand-decomposition formula. Finally, we focus on the maximum-cut, defined as a system of on-shell conditions constraining the components of all the integration-momenta. By means of the Finiteness Theorem and of the Shape Lemma, we prove that the residue at the maximum-cut is parametrized by a number of coefficients equal to the number of solutions of the cut itself.

Quantum properties of supersymmetric theories regularized by higher covariant derivatives

NASA Astrophysics Data System (ADS)

Stepanyantz, Konstantin

2018-02-01

We investigate quantum corrections in \\mathscr{N} = 1 non-Abelian supersymmetric gauge theories, regularized by higher covariant derivatives. In particular, by the help of the Slavnov-Taylor identities we prove that the vertices with two ghost legs and one leg of the quantum gauge superfield are finite in all orders. This non-renormalization theorem is confirmed by an explicit one-loop calculation. By the help of this theorem we rewrite the exact NSVZ β-function in the form of the relation between the β-function and the anomalous dimensions of the matter superfields, of the quantum gauge superfield, and of the Faddeev-Popov ghosts. Such a relation has simple qualitative interpretation and allows suggesting a prescription producing the NSVZ scheme in all loops for the theories regularized by higher derivatives. This prescription is verified by the explicit three-loop calculation for the terms quartic in the Yukawa couplings.

A reconstruction theorem for Connes-Landi deformations of commutative spectral triples

NASA Astrophysics Data System (ADS)

Ćaćić, Branimir

2015-12-01

We formulate and prove an extension of Connes's reconstruction theorem for commutative spectral triples to so-called Connes-Landi or isospectral deformations of commutative spectral triples along the action of a compact Abelian Lie group G, also known as toric noncommutative manifolds. In particular, we propose an abstract definition for such spectral triples, where noncommutativity is entirely governed by a deformation parameter sitting in the second group cohomology of the Pontryagin dual of G, and then show that such spectral triples are well-behaved under further Connes-Landi deformation, thereby allowing for both quantisation from and dequantisation to G-equivariant abstract commutative spectral triples. We then use a refinement of the Connes-Dubois-Violette splitting homomorphism to conclude that suitable Connes-Landi deformations of commutative spectral triples by a rational deformation parameter are almost-commutative in the general, topologically non-trivial sense.

Two Universality Properties Associated with the Monkey Model of Zipf's Law

NASA Astrophysics Data System (ADS)

Perline, Richard; Perline, Ron

2016-03-01

The distribution of word probabilities in the monkey model of Zipf's law is associated with two universality properties: (1) the power law exponent converges strongly to $-1$ as the alphabet size increases and the letter probabilities are specified as the spacings from a random division of the unit interval for any distribution with a bounded density function on $[0,1]$; and (2), on a logarithmic scale the version of the model with a finite word length cutoff and unequal letter probabilities is approximately normally distributed in the part of the distribution away from the tails. The first property is proved using a remarkably general limit theorem for the logarithm of sample spacings from Shao and Hahn, and the second property follows from Anscombe's central limit theorem for a random number of i.i.d. random variables. The finite word length model leads to a hybrid Zipf-lognormal mixture distribution closely related to work in other areas.

Adaptive NN control for discrete-time pure-feedback systems with unknown control direction under amplitude and rate actuator constraints.

PubMed

Chen, Weisheng

2009-07-01

This paper focuses on the problem of adaptive neural network tracking control for a class of discrete-time pure-feedback systems with unknown control direction under amplitude and rate actuator constraints. Two novel state-feedback and output-feedback dynamic control laws are established where the function tanh(.) is employed to solve the saturation constraint problem. Implicit function theorem and mean value theorem are exploited to deal with non-affine variables that are used as actual control. Radial basis function neural networks are used to approximate the desired input function. Discrete Nussbaum gain is used to estimate the unknown sign of control gain. The uniform boundedness of all closed-loop signals is guaranteed. The tracking error is proved to converge to a small residual set around the origin. A simulation example is provided to illustrate the effectiveness of control schemes proposed in this paper.

Fluctuation Theorem for Many-Body Pure Quantum States

NASA Astrophysics Data System (ADS)

Iyoda, Eiki; Kaneko, Kazuya; Sagawa, Takahiro

2017-09-01

We prove the second law of thermodynamics and the nonequilibrium fluctuation theorem for pure quantum states. The entire system obeys reversible unitary dynamics, where the initial state of the heat bath is not the canonical distribution but is a single energy eigenstate that satisfies the eigenstate-thermalization hypothesis. Our result is mathematically rigorous and based on the Lieb-Robinson bound, which gives the upper bound of the velocity of information propagation in many-body quantum systems. The entanglement entropy of a subsystem is shown connected to thermodynamic heat, highlighting the foundation of the information-thermodynamics link. We confirmed our theory by numerical simulation of hard-core bosons, and observed dynamical crossover from thermal fluctuations to bare quantum fluctuations. Our result reveals a universal scenario that the second law emerges from quantum mechanics, and can be experimentally tested by artificial isolated quantum systems such as ultracold atoms.

Finite-size analysis of continuous-variable measurement-device-independent quantum key distribution

NASA Astrophysics Data System (ADS)

Zhang, Xueying; Zhang, Yichen; Zhao, Yijia; Wang, Xiangyu; Yu, Song; Guo, Hong

2017-10-01

We study the impact of the finite-size effect on the continuous-variable measurement-device-independent quantum key distribution (CV-MDI QKD) protocol, mainly considering the finite-size effect on the parameter estimation procedure. The central-limit theorem and maximum likelihood estimation theorem are used to estimate the parameters. We also analyze the relationship between the number of exchanged signals and the optimal modulation variance in the protocol. It is proved that when Charlie's position is close to Bob, the CV-MDI QKD protocol has the farthest transmission distance in the finite-size scenario. Finally, we discuss the impact of finite-size effects related to the practical detection in the CV-MDI QKD protocol. The overall results indicate that the finite-size effect has a great influence on the secret-key rate of the CV-MDI QKD protocol and should not be ignored.

An Onsager Singularity Theorem for Turbulent Solutions of Compressible Euler Equations

NASA Astrophysics Data System (ADS)

Drivas, Theodore D.; Eyink, Gregory L.

2017-12-01

We prove that bounded weak solutions of the compressible Euler equations will conserve thermodynamic entropy unless the solution fields have sufficiently low space-time Besov regularity. A quantity measuring kinetic energy cascade will also vanish for such Euler solutions, unless the same singularity conditions are satisfied. It is shown furthermore that strong limits of solutions of compressible Navier-Stokes equations that are bounded and exhibit anomalous dissipation are weak Euler solutions. These inviscid limit solutions have non-negative anomalous entropy production and kinetic energy dissipation, with both vanishing when solutions are above the critical degree of Besov regularity. Stationary, planar shocks in Euclidean space with an ideal-gas equation of state provide simple examples that satisfy the conditions of our theorems and which demonstrate sharpness of our L 3-based conditions. These conditions involve space-time Besov regularity, but we show that they are satisfied by Euler solutions that possess similar space regularity uniformly in time.

Self-adjointness of deformed unbounded operators

DOE Office of Scientific and Technical Information (OSTI.GOV)

Much, Albert

2015-09-15

We consider deformations of unbounded operators by using the novel construction tool of warped convolutions. By using the Kato-Rellich theorem, we show that unbounded self-adjoint deformed operators are self-adjoint if they satisfy a certain condition. This condition proves itself to be necessary for the oscillatory integral to be well-defined. Moreover, different proofs are given for self-adjointness of deformed unbounded operators in the context of quantum mechanics and quantum field theory.

On quasi-periodic solutions for generalized Boussinesq equation with quadratic nonlinearity

NASA Astrophysics Data System (ADS)

Shi, Yanling; Xu, Junxiang; Xu, Xindong

2015-02-01

In this paper, one-dimensional generalized Boussinesq equation: utt - uxx + (u2 + uxx)xx = 0 with boundary conditions ux(0, t) = ux(π, t) = uxxx(0, t) = uxxx(π, t) = 0 is considered. It is proved that the equation admits a Whitney smooth family of small-amplitude quasi-periodic solutions with 2-dimensional Diophantine frequencies. The proof is based on an infinite dimensional Kolmogorov-Arnold-Moser theorem and Birkhoff normal form.

Optimal control and optimal trajectories of regional macroeconomic dynamics based on the Pontryagin maximum principle

NASA Astrophysics Data System (ADS)

Bulgakov, V. K.; Strigunov, V. V.

2009-05-01

The Pontryagin maximum principle is used to prove a theorem concerning optimal control in regional macroeconomics. A boundary value problem for optimal trajectories of the state and adjoint variables is formulated, and optimal curves are analyzed. An algorithm is proposed for solving the boundary value problem of optimal control. The performance of the algorithm is demonstrated by computing an optimal control and the corresponding optimal trajectories.

Automated contour detection in X-ray left ventricular angiograms using multiview active appearance models and dynamic programming.

PubMed

Oost, Elco; Koning, Gerhard; Sonka, Milan; Oemrawsingh, Pranobe V; Reiber, Johan H C; Lelieveldt, Boudewijn P F

2006-09-01

This paper describes a new approach to the automated segmentation of X-ray left ventricular (LV) angiograms, based on active appearance models (AAMs) and dynamic programming. A coupling of shape and texture information between the end-diastolic (ED) and end-systolic (ES) frame was achieved by constructing a multiview AAM. Over-constraining of the model was compensated for by employing dynamic programming, integrating both intensity and motion features in the cost function. Two applications are compared: a semi-automatic method with manual model initialization, and a fully automatic algorithm. The first proved to be highly robust and accurate, demonstrating high clinical relevance. Based on experiments involving 70 patient data sets, the algorithm's success rate was 100% for ED and 99% for ES, with average unsigned border positioning errors of 0.68 mm for ED and 1.45 mm for ES. Calculated volumes were accurate and unbiased. The fully automatic algorithm, with intrinsically less user interaction was less robust, but showed a high potential, mostly due to a controlled gradient descent in updating the model parameters. The success rate of the fully automatic method was 91% for ED and 83% for ES, with average unsigned border positioning errors of 0.79 mm for ED and 1.55 mm for ES.

Tensor contraction engine: Abstraction and automated parallel implementation of configuration-interaction, coupled-cluster, and many-body perturbation theories

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hirata, So

2003-11-20

We develop a symbolic manipulation program and program generator (Tensor Contraction Engine or TCE) that automatically derives the working equations of a well-defined model of second-quantized many-electron theories and synthesizes efficient parallel computer programs on the basis of these equations. Provided an ansatz of a many-electron theory model, TCE performs valid contractions of creation and annihilation operators according to Wick's theorem, consolidates identical terms, and reduces the expressions into the form of multiple tensor contractions acted by permutation operators. Subsequently, it determines the binary contraction order for each multiple tensor contraction with the minimal operation and memory cost, factorizes commonmore » binary contractions (defines intermediate tensors), and identifies reusable intermediates. The resulting ordered list of binary tensor contractions, additions, and index permutations is translated into an optimized program that is combined with the NWChem and UTChem computational chemistry software packages. The programs synthesized by TCE take advantage of spin symmetry, Abelian point-group symmetry, and index permutation symmetry at every stage of calculations to minimize the number of arithmetic operations and storage requirement, adjust the peak local memory usage by index range tiling, and support parallel I/O interfaces and dynamic load balancing for parallel executions. We demonstrate the utility of TCE through automatic derivation and implementation of parallel programs for various models of configuration-interaction theory (CISD, CISDT, CISDTQ), many-body perturbation theory [MBPT(2), MBPT(3), MBPT(4)], and coupled-cluster theory (LCCD, CCD, LCCSD, CCSD, QCISD, CCSDT, and CCSDTQ).« less

Interval-valued intuitionistic fuzzy matrix games based on Archimedean t-conorm and t-norm

NASA Astrophysics Data System (ADS)

Xia, Meimei

2018-04-01

Fuzzy game theory has been applied in many decision-making problems. The matrix game with interval-valued intuitionistic fuzzy numbers (IVIFNs) is investigated based on Archimedean t-conorm and t-norm. The existing matrix games with IVIFNs are all based on Algebraic t-conorm and t-norm, which are special cases of Archimedean t-conorm and t-norm. In this paper, the intuitionistic fuzzy aggregation operators based on Archimedean t-conorm and t-norm are employed to aggregate the payoffs of players. To derive the solution of the matrix game with IVIFNs, several mathematical programming models are developed based on Archimedean t-conorm and t-norm. The proposed models can be transformed into a pair of primal-dual linear programming models, based on which, the solution of the matrix game with IVIFNs is obtained. It is proved that the theorems being valid in the exiting matrix game with IVIFNs are still true when the general aggregation operator is used in the proposed matrix game with IVIFNs. The proposed method is an extension of the existing ones and can provide more choices for players. An example is given to illustrate the validity and the applicability of the proposed method.

STABILITY OF GAS CLOUDS IN GALACTIC NUCLEI: AN EXTENDED VIRIAL THEOREM

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chen, Xian; Cuadra, Jorge; Amaro-Seoane, Pau, E-mail: xchen@astro.puc.cl, E-mail: jcuadra@astro.puc.cl, E-mail: Pau.Amaro-Seoane@aei.mpg.de

2016-03-10

Cold gas entering the central 1–10{sup 2} pc of a galaxy fragments and condenses into clouds. The stability of the clouds determines whether they will be turned into stars or can be delivered to the central supermassive black hole (SMBH) to turn on an active galactic nucleus (AGN). The conventional criteria to assess the stability of these clouds, such as the Jeans criterion and Roche (or tidal) limit, are insufficient here, because they assume the dominance of self-gravity in binding a cloud, and neglect external agents, such as pressure and tidal forces, which are common in galactic nuclei. We formulatemore » a new scheme for judging this stability. We first revisit the conventional Virial theorem, taking into account an external pressure, to identify the correct range of masses that lead to stable clouds. We then extend the theorem to further include an external tidal field, which is equally crucial for the stability in the region of our interest—in dense star clusters, around SMBHs. We apply our extended Virial theorem to find new solutions to controversial problems, namely, the stability of the gas clumps in AGN tori, the circum-nuclear disk in the Galactic Center, and the central molecular zone of the Milky Way. The masses we derive for these structures are orders of magnitude smaller than the commonly used Virial masses (equivalent to the Jeans mass). Moreover, we prove that these clumps are stable, contrary to what one would naively deduce from the Roche (tidal) limit.« less

On the symmetry of the boundary conditions of the volume potential

NASA Astrophysics Data System (ADS)

Kal'menov, Tynysbek Sh.; Arepova, Gaukhar; Suragan, Durvudkhan

2017-09-01

It is well known that the volume potential determines the mass or the charge distributed over the domain with density f. The volume potential is extensively used in function theory and embedding theorems. It is also well known that the volume potential gives a solution to an inhomogeneous equation. And it generates a linear self-adjoint operator. It is known that self-adjoint differential operators are generated by boundary conditions. In our previous papers for an arbitrary domain a boundary condition on the volume potential is given. In the past, it was not possible to prove the self-adjointness of these obtained boundary conditions. In the present paper, we prove the symmetry of boundary condition for the volume potential.

Formal reasoning about systems biology using theorem proving

PubMed Central

Hasan, Osman; Siddique, Umair; Tahar, Sofiène

2017-01-01

System biology provides the basis to understand the behavioral properties of complex biological organisms at different levels of abstraction. Traditionally, analysing systems biology based models of various diseases have been carried out by paper-and-pencil based proofs and simulations. However, these methods cannot provide an accurate analysis, which is a serious drawback for the safety-critical domain of human medicine. In order to overcome these limitations, we propose a framework to formally analyze biological networks and pathways. In particular, we formalize the notion of reaction kinetics in higher-order logic and formally verify some of the commonly used reaction based models of biological networks using the HOL Light theorem prover. Furthermore, we have ported our earlier formalization of Zsyntax, i.e., a deductive language for reasoning about biological networks and pathways, from HOL4 to the HOL Light theorem prover to make it compatible with the above-mentioned formalization of reaction kinetics. To illustrate the usefulness of the proposed framework, we present the formal analysis of three case studies, i.e., the pathway leading to TP53 Phosphorylation, the pathway leading to the death of cancer stem cells and the tumor growth based on cancer stem cells, which is used for the prognosis and future drug designs to treat cancer patients. PMID:28671950

Communication, Correlation and Complementarity

NASA Astrophysics Data System (ADS)

Schumacher, Benjamin Wade

1990-01-01

In quantum communication, a sender prepares a quantum system in a state corresponding to his message and conveys it to a receiver, who performs a measurement on it. The receiver acquires information about the message based on the outcome of his measurement. Since the state of a single quantum system is not always completely determinable from measurement, quantum mechanics limits the information capacity of such channels. According to a theorem of Kholevo, the amount of information conveyed by the channel can be no greater than the entropy of the ensemble of possible physical signals. The connection between information and entropy allows general theorems to be proved regarding the energy requirements of communication. For example, it can be shown that one particular quantum coding scheme, called thermal coding, uses energy with maximum efficiency. A close analogy between communication and quantum correlation can be made using Everett's notion of relative states. Kholevo's theorem can be used to prove that the mutual information of a pair of observables on different systems is bounded by the entropy of the state of each system. This confirms and extends an old conjecture of Everett. The complementarity of quantum observables can be described by information-theoretic uncertainty relations, several of which have been previously derived. These relations imply limits on the degree to which different messages can be coded in complementary observables of a single channel. Complementarity also restricts the amount of information that can be recovered from a given channel using a given decoding observable. Information inequalities can be derived which are analogous to the well-known Bell inequalities for correlated quantum systems. These inequalities are satisfied for local hidden variable theories but are violated by quantum systems, even where the correlation is weak. These information inequalities are metric inequalities for an "information distance", and their structure can be made exactly analogous to that of the familiar covariance Bell inequalities by introducing a "covariance distance". Similar inequalities derived for successive measurements on a single system are also violated in quantum mechanics.

Interpreter composition issues in the formal verification of a processor-memory module

NASA Technical Reports Server (NTRS)

Fura, David A.; Cohen, Gerald C.

1994-01-01

This report describes interpreter composition techniques suitable for the formal specification and verification of a processor-memory module using the HOL theorem proving system. The processor-memory module is a multichip subsystem within a fault-tolerant embedded system under development within the Boeing Defense and Space Group. Modeling and verification methods were developed that permit provably secure composition at the transaction-level of specification, significantly reducing the complexity of the hierarchical verification of the system.

Symmetry enhancement of extremal horizons in D  =  5 supergravity

NASA Astrophysics Data System (ADS)

Kayani, U.

2018-06-01

We consider the near-horizon geometry of supersymmetric extremal black holes in un-gauged and gauged 5-dimensional supergravity, coupled to abelian vector multiplets. By analyzing the global properties of the Killing spinors, we prove that the near-horizon geometries undergo a supersymmetry enhancement. This follows from a set of generalized Lichnerowicz-type theorems we establish, together with an index theory argument. As a consequence, these solutions always admit a symmetry group.

On Nonlinear Functionals of Random Spherical Eigenfunctions

NASA Astrophysics Data System (ADS)

Marinucci, Domenico; Wigman, Igor

2014-05-01

We prove central limit theorems and Stein-like bounds for the asymptotic behaviour of nonlinear functionals of spherical Gaussian eigenfunctions. Our investigation combines asymptotic analysis of higher order moments for Legendre polynomials and, in addition, recent results on Malliavin calculus and total variation bounds for Gaussian subordinated fields. We discuss applications to geometric functionals like the defect and invariant statistics, e.g., polyspectra of isotropic spherical random fields. Both of these have relevance for applications, especially in an astrophysical environment.

The use of 3-D sensing techniques for on-line collision-free path planning

NASA Technical Reports Server (NTRS)

Hayward, V.; Aubry, S.; Jasiukajc, Z.

1987-01-01

The state of the art in collision prevention for manipulators with revolute joints, showing that it is a particularly computationally hard problem, is discussed. Based on the analogy with other hard or undecidable problems such as theorem proving, an extensible multi-resolution architecture for path planning, based on a collection of weak methods is proposed. Finally, the role that sensors can play for an on-line use of sensor data is examined.

Quantum walks with an anisotropic coin II: scattering theory

NASA Astrophysics Data System (ADS)

Richard, S.; Suzuki, A.; de Aldecoa, R. Tiedra

2018-05-01

We perform the scattering analysis of the evolution operator of quantum walks with an anisotropic coin, and we prove a weak limit theorem for their asymptotic velocity. The quantum walks that we consider include one-defect models, two-phase quantum walks, and topological phase quantum walks as special cases. Our analysis is based on an abstract framework for the scattering theory of unitary operators in a two-Hilbert spaces setting, which is of independent interest.

Extended Full Computation-Tree Logic with Sequence Modal Operator: Representing Hierarchical Tree Structures

NASA Astrophysics Data System (ADS)

Kamide, Norihiro; Kaneiwa, Ken

An extended full computation-tree logic, CTLS*, is introduced as a Kripke semantics with a sequence modal operator. This logic can appropriately represent hierarchical tree structures where sequence modal operators in CTLS* are applied to tree structures. An embedding theorem of CTLS* into CTL* is proved. The validity, satisfiability and model-checking problems of CTLS* are shown to be decidable. An illustrative example of biological taxonomy is presented using CTLS* formulas.

GEEC All the Way Down

DTIC Science & Technology

2015-01-13

applying formal methods to systems software, e.g., IronClad [16] and seL4 [19], promise that this vision is not a fool’s er- rand after all. In this...kernel seL4 [19] is fully verified for functional correct- ness and it runs with other deprivileged services. How- ever, the verification process used...portion, which is non-trivial for theorem proving-based approaches. In our COSS example, adding the trusted network logging extensions to seL4 will

Neural network representation and learning of mappings and their derivatives

NASA Technical Reports Server (NTRS)

White, Halbert; Hornik, Kurt; Stinchcombe, Maxwell; Gallant, A. Ronald

1991-01-01

Discussed here are recent theorems proving that artificial neural networks are capable of approximating an arbitrary mapping and its derivatives as accurately as desired. This fact forms the basis for further results establishing the learnability of the desired approximations, using results from non-parametric statistics. These results have potential applications in robotics, chaotic dynamics, control, and sensitivity analysis. An example involving learning the transfer function and its derivatives for a chaotic map is discussed.

Fractional corresponding operator in quantum mechanics and applications: A uniform fractional Schrödinger equation in form and fractional quantization methods

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhang, Xiao; Science and Technology on Electronic Information Control Laboratory, 610036, Chengdu, Sichuan; Wei, Chaozhen

2014-11-15

In this paper we use Dirac function to construct a fractional operator called fractional corresponding operator, which is the general form of momentum corresponding operator. Then we give a judging theorem for this operator and with this judging theorem we prove that R–L, G–L, Caputo, Riesz fractional derivative operator and fractional derivative operator based on generalized functions, which are the most popular ones, coincide with the fractional corresponding operator. As a typical application, we use the fractional corresponding operator to construct a new fractional quantization scheme and then derive a uniform fractional Schrödinger equation in form. Additionally, we find thatmore » the five forms of fractional Schrödinger equation belong to the particular cases. As another main result of this paper, we use fractional corresponding operator to generalize fractional quantization scheme by using Lévy path integral and use it to derive the corresponding general form of fractional Schrödinger equation, which consequently proves that these two quantization schemes are equivalent. Meanwhile, relations between the theory in fractional quantum mechanics and that in classic quantum mechanics are also discussed. As a physical example, we consider a particle in an infinite potential well. We give its wave functions and energy spectrums in two ways and find that both results are the same.« less

Central limit theorem for recurrent random walks on a strip with bounded potential

NASA Astrophysics Data System (ADS)

Dolgopyat, D.; Goldsheid, I.

2018-07-01

We prove that the recurrent random walk (RW) in random environment (RE) on a strip in bounded potential satisfies the central limit theorem (CLT). The key ingredients of the proof are the analysis of the invariant measure equation and construction of a linearly growing martingale for walks in bounded potential. Our main result implies a complete classification of recurrent i.i.d. RWRE on the strip. Namely the walk either exhibits the Sinai behaviour in the sense that converges, as , to a (random) limit (the Sinai law) or, it satisfies the CLT. Another application of our main result is the CLT for the quasiperiodic environments with Diophantine frequencies in the recurrent case. We complement this result by proving that in the transient case the CLT holds for all uniquely ergodic environments. We also investigate the algebraic structure of the environments satisfying the CLT. In particular, we show that there exists a collection of proper algebraic subvarieties in the space of transition probabilities, such that: • If RE is stationary and ergodic and the transition probabilities are con-centrated on one of subvarieties from our collection then the CLT holds. • If the environment is i.i.d then the above condition is also necessary forthe CLT. All these results are valid for one-dimensional RWRE with bounded jumps as a particular case of the strip model.

Counterion-induced swelling of ionic microgels

NASA Astrophysics Data System (ADS)

Denton, Alan R.; Tang, Qiyun

2016-10-01

Ionic microgel particles, when dispersed in a solvent, swell to equilibrium sizes that are governed by a balance between electrostatic and elastic forces. Tuning of particle size by varying external stimuli, such as pH, salt concentration, and temperature, has relevance for drug delivery, microfluidics, and filtration. To model swelling of ionic microgels, we derive a statistical mechanical theorem, which proves exact within the cell model, for the electrostatic contribution to the osmotic pressure inside a permeable colloidal macroion. Applying the theorem, we demonstrate how the distribution of counterions within an ionic microgel determines the internal osmotic pressure. By combining the electrostatic pressure, which we compute via both Poisson-Boltzmann theory and molecular dynamics simulation, with the elastic pressure, modeled via the Flory-Rehner theory of swollen polymer networks, we show how deswelling of ionic microgels with increasing concentration of particles can result from a redistribution of counterions that reduces electrostatic pressure. A linearized approximation for the electrostatic pressure, which proves remarkably accurate, provides physical insight and greatly eases numerical calculations for practical applications. Comparing with experiments, we explain why soft particles in deionized suspensions deswell upon increasing concentration and why this effect may be suppressed at higher ionic strength. The failure of the uniform ideal-gas approximation to adequately account for counterion-induced deswelling below close packing of microgels is attributed to neglect of spatial variation of the counterion density profile and the electrostatic pressure of incompletely neutralized macroions.

A new framework for analysing automated acoustic species-detection data: occupancy estimation and optimization of recordings post-processing

USGS Publications Warehouse

Chambert, Thierry A.; Waddle, J. Hardin; Miller, David A.W.; Walls, Susan; Nichols, James D.

2018-01-01

The development and use of automated species-detection technologies, such as acoustic recorders, for monitoring wildlife are rapidly expanding. Automated classification algorithms provide a cost- and time-effective means to process information-rich data, but often at the cost of additional detection errors. Appropriate methods are necessary to analyse such data while dealing with the different types of detection errors.We developed a hierarchical modelling framework for estimating species occupancy from automated species-detection data. We explore design and optimization of data post-processing procedures to account for detection errors and generate accurate estimates. Our proposed method accounts for both imperfect detection and false positive errors and utilizes information about both occurrence and abundance of detections to improve estimation.Using simulations, we show that our method provides much more accurate estimates than models ignoring the abundance of detections. The same findings are reached when we apply the methods to two real datasets on North American frogs surveyed with acoustic recorders.When false positives occur, estimator accuracy can be improved when a subset of detections produced by the classification algorithm is post-validated by a human observer. We use simulations to investigate the relationship between accuracy and effort spent on post-validation, and found that very accurate occupancy estimates can be obtained with as little as 1% of data being validated.Automated monitoring of wildlife provides opportunity and challenges. Our methods for analysing automated species-detection data help to meet key challenges unique to these data and will prove useful for many wildlife monitoring programs.

Quantitative Indicators for Behaviour Drift Detection from Home Automation Data.

PubMed

Veronese, Fabio; Masciadri, Andrea; Comai, Sara; Matteucci, Matteo; Salice, Fabio

2017-01-01

Smart Homes diffusion provides an opportunity to implement elderly monitoring, extending seniors' independence and avoiding unnecessary assistance costs. Information concerning the inhabitant behaviour is contained in home automation data, and can be extracted by means of quantitative indicators. The application of such approach proves it can evidence behaviour changes.

Automated Rendezvous and Capture System Development and Simulation for NASA

NASA Technical Reports Server (NTRS)

Roe, Fred D.; Howard, Richard T.; Murphy, Leslie

2004-01-01

The United States does not have an Automated Rendezvous and Capture/Docking (AR and C) capability and is reliant on manned control for rendezvous and docking of orbiting spacecraft. This reliance on the labor intensive manned interface for control of rendezvous and docking vehicles has a significant impact on the cost of the operation of the International Space Station (ISS) and precludes the use of any U.S. expendable launch capabilities for Space Station resupply. The Soviets have the capability to autonomously dock in space, but their system produces a hard docking with excessive force and contact velocity. Automated Rendezvous and Capture/Docking has been identified as a key enabling technology for the Space Launch Initiative (SLI) Program, DARPA Orbital Express and other DOD Programs. The development and implementation of an AR&C capability can significantly enhance system flexibility, improve safety, and lower the cost of maintaining, supplying, and operating the International Space Station. The Marshall Space Flight Center (MSFC) has conducted pioneering research in the development of an automated rendezvous and capture (or docking) (AR and C) system for U.S. space vehicles. This AR&C system was tested extensively using hardware-in-the-loop simulations in the Flight Robotics Laboratory, and a rendezvous sensor, the Video Guidance Sensor was developed and successfully flown on the Space Shuttle on flights STS-87 and STS-95, proving the concept of a video- based sensor. Further developments in sensor technology and vehicle and target configuration have lead to continued improvements and changes in AR&C system development and simulation. A new Advanced Video Guidance Sensor (AVGS) with target will be utilized on the Demonstration of Autonomous Rendezvous Technologies (DART) flight experiment in 2004.

TU-AB-201-02: An Automated Treatment Plan Quality Assurance Program for Tandem and Ovoid High Dose-Rate Brachytherapy

DOE Office of Scientific and Technical Information (OSTI.GOV)

Tan, J; Shi, F; Hrycushko, B

2015-06-15

Purpose: For tandem and ovoid (T&O) HDR brachytherapy in our clinic, it is required that the planning physicist manually capture ∼10 images during planning, perform a secondary dose calculation and generate a report, combine them into a single PDF document, and upload it to a record- and-verify system to prove to an independent plan checker that the case was planned correctly. Not only does this slow down the already time-consuming clinical workflow, the PDF document also limits the number of parameters that can be checked. To solve these problems, we have developed a web-based automatic quality assurance (QA) program. Methods:more » We set up a QA server accessible through a web- interface. A T&O plan and CT images are exported as DICOMRT files and uploaded to the server. The software checks 13 geometric features, e.g. if the dwell positions are reasonable, and 10 dosimetric features, e.g. secondary dose calculations via TG43 formalism and D2cc to critical structures. A PDF report is automatically generated with errors and potential issues highlighted. It also contains images showing important geometric and dosimetric aspects to prove the plan was created following standard guidelines. Results: The program has been clinically implemented in our clinic. In each of the 58 T&O plans we tested, a 14- page QA report was automatically generated. It took ∼45 sec to export the plan and CT images and ∼30 sec to perform the QA tests and generate the report. In contrast, our manual QA document preparation tooks on average ∼7 minutes under optimal conditions and up to 20 minutes when mistakes were made during the document assembly. Conclusion: We have tested the efficiency and effectiveness of an automated process for treatment plan QA of HDR T&O cases. This software was shown to improve the workflow compared to our conventional manual approach.« less

Toward automated interpretation of integrated information: Managing "big data" for NDE

NASA Astrophysics Data System (ADS)

Gregory, Elizabeth; Lesthaeghe, Tyler; Holland, Stephen

2015-03-01

Large scale automation of NDE processes is rapidly maturing, thanks to recent improvements in robotics and the rapid growth of computer power over the last twenty years. It is fairly straightforward to automate NDE data collection itself, but the process of NDE remains largely manual. We will discuss three threads of technological needs that must be addressed before we are able to perform automated NDE. Spatial context, the first thread, means that each NDE measurement taken is accompanied by metadata that locates the measurement with respect to the 3D physical geometry of the specimen. In this way, the geometry of the specimen acts as a database key. Data context, the second thread, means that we record why the data was taken and how it was measured in addition to the NDE data itself. We will present our software tool that helps users interact with data in context, Databrowse. Condition estimation, the third thread, is maintaining the best possible knowledge of the condition (serviceability, degradation, etc.) of an object or part. In the NDE context, we can prospectively use Bayes' Theorem to integrate the data from each new NDE measurement with prior knowledge. These tools, combined with robotic measurements and automated defect analysis, will provide the information needed to make high-level life predictions and focus NDE measurements where they are needed most.

Towards the Formal Verification of a Distributed Real-Time Automotive System

NASA Technical Reports Server (NTRS)

Endres, Erik; Mueller, Christian; Shadrin, Andrey; Tverdyshev, Sergey

2010-01-01

We present the status of a project which aims at building, formally and pervasively verifying a distributed automotive system. The target system is a gate-level model which consists of several interconnected electronic control units with independent clocks. This model is verified against the specification as seen by a system programmer. The automotive system is implemented on several FPGA boards. The pervasive verification is carried out using combination of interactive theorem proving (Isabelle/HOL) and model checking (LTL).

Two-player quantum pseudotelepathy based on recent all-versus-nothing violations of local realism

NASA Astrophysics Data System (ADS)

Cabello, Adán

2006-02-01

We introduce two two-player quantum pseudotelepathy games based on two recently proposed all-versus-nothing (AVN) proofs of Bell’s theorem [A. Cabello, Phys. Rev. Lett. 95, 210401 (2005); Phys. Rev. A 72, 050101(R) (2005)]. These games prove that Broadbent and Méthot’s claim that these AVN proofs do not rule out local-hidden-variable theories in which it is possible to exchange unlimited information inside the same light cone (quant-ph/0511047) is incorrect.

Evolutionary Oseen Model for Generalized Newtonian Fluid with Multivalued Nonmonotone Friction Law

NASA Astrophysics Data System (ADS)

Migórski, Stanisław; Dudek, Sylwia

2018-03-01

The paper deals with the non-stationary Oseen system of equations for the generalized Newtonian incompressible fluid with multivalued and nonmonotone frictional slip boundary conditions. First, we provide a result on existence of a unique solution to an abstract evolutionary inclusion involving the Clarke subdifferential term for a nonconvex function. We employ a method based on a surjectivity theorem for multivalued L-pseudomonotone operators. Then, we exploit the abstract result to prove the weak unique solvability of the Oseen system.

What Bell proved: A reply to Blaylock

NASA Astrophysics Data System (ADS)

Maudlin, Tim

2010-01-01

Blaylock argues that the derivation of Bell's inequality requires a hidden assumption, counterfactual definiteness, of which Bell was unaware. A careful analysis of Bell's argument shows that Bell presupposes only locality and the predictions of standard quantum mechanics. Counterfactual definiteness, insofar as it is required, is derived in the course of the argument rather than presumed. Bell's theorem has no direct bearing on the many worlds interpretation not because that interpretation denies counterfactual definiteness but because it does not recover the predictions of standard quantum mechanics.

A Family of Finite-Dimensional Representations of Generalized Double Affine Hecke Algebras of Higher Rank

NASA Astrophysics Data System (ADS)

Fu, Yuchen; Shelley-Abrahamson, Seth

2016-06-01

We give explicit constructions of some finite-dimensional representations of generalized double affine Hecke algebras (GDAHA) of higher rank using R-matrices for U_q(sl_N). Our construction is motivated by an analogous construction of Silvia Montarani in the rational case. Using the Drinfeld-Kohno theorem for Knizhnik-Zamolodchikov differential equations, we prove that the explicit representations we produce correspond to Montarani's representations under a monodromy functor introduced by Etingof, Gan, and Oblomkov.

The growth rate of vertex-transitive planar graphs

DOE Office of Scientific and Technical Information (OSTI.GOV)

Babai, L.

1997-06-01

A graph is vertex-transitive if all of its vertices axe equivalent under automorphisms. Confirming a conjecture of Jon Kleinberg and Eva Tardos, we prove the following trichotomy theorem concerning locally finite vertex-transitive planar graphs: the rate of growth of a graph with these properties is either linear or quadratic or exponential. The same result holds more generally for locally finite, almost vertex-transitive planar graphs (the automorphism group has a finite number of orbits). The proof uses the elements of hyperbolic plane geometry.

Transition and separation process in brine channels formation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Berti, Alessia, E-mail: alessia.berti@unibs.it; Bochicchio, Ivana, E-mail: ibochicchio@unisa.it; Fabrizio, Mauro, E-mail: mauro.fabrizio@unibo.it

2016-02-15

In this paper, we discuss the formation of brine channels in sea ice. The model includes a time-dependent Ginzburg-Landau equation for the solid-liquid phase change, a diffusion equation of the Cahn-Hilliard kind for the solute dynamics, and the heat equation for the temperature change. The macroscopic motion of the fluid is also considered, so the resulting differential system couples with the Navier-Stokes equation. The compatibility of this system with the thermodynamic laws and a maximum theorem is proved.

Global exponential stability of positive periodic solution of the n-species impulsive Gilpin-Ayala competition model with discrete and distributed time delays.

PubMed

Zhao, Kaihong

2018-12-01

In this paper, we study the n-species impulsive Gilpin-Ayala competition model with discrete and distributed time delays. The existence of positive periodic solution is proved by employing the fixed point theorem on cones. By constructing appropriate Lyapunov functional, we also obtain the global exponential stability of the positive periodic solution of this system. As an application, an interesting example is provided to illustrate the validity of our main results.

Advanced LPI (Low-Probability-of-Intercept) Intercept Detector Research

DTIC Science & Technology

1985-11-13

following comparisons, we select a nominal loss figure of - 1.5 dB. We note that the above losses pertain to a rectangular BPF ; other filter ships will...this brief expose on the useful properties of the LLR moment- * generating functions, we can now prove the BPF theorem in a rather compact fashion...can be performed following guidelines similar to those in Appendix C, as follows: Let the bandpass AWGN n(t) be represented by 0) n(t) -T2 nj (t) cos

Invariant Tori in the Secular Motions of the Three-body Planetary Systems

NASA Astrophysics Data System (ADS)

Locatelli, Ugo; Giorgilli, Antonio

We consider the problem of the applicability of KAM theorem to a realistic problem of three bodies. In the framework of the averaged dynamics over the fast angles for the Sun-Jupiter-Saturn system we can prove the perpetual stability of the orbit. The proof is based on semi-numerical algorithms requiring both explicit algebraic manipulations of series and analytical estimates. The proof is made rigorous by using interval arithmetics in order to control the numerical errors.

The Friedmann-Lemaître-Robertson-Walker Big Bang Singularities are Well Behaved

NASA Astrophysics Data System (ADS)

Stoica, Ovidiu Cristinel

2016-01-01

We show that the Big Bang singularity of the Friedmann-Lemaître-Robertson-Walker model does not raise major problems to General Relativity. We prove a theorem showing that the Einstein equation can be written in a non-singular form, which allows the extension of the spacetime before the Big Bang. The physical interpretation of the fields used is discussed. These results follow from our research on singular semi-Riemannian geometry and singular General Relativity.

A General Explanation-Based Learning Mechanism and Its Application to Narrative Understanding.

DTIC Science & Technology

1987-12-01

sitive emotional relationship with the victim and conse- cquentlv valued her freedom more than personal possessions. This generalization is important...Generalizing Algorithin 2tc.as - men r.red rh rev;ous foo-.r.ote. *.he Bac&?-,-a~a,.e ucjr.presented i.:ony b dCei rol prCp 711 pro-agatc C r~~sac-oss orcs the...explanation. As men - tioned earlier. PROLOC-EBG elegantly integrates generalization with the theorem proving process. and MRS-EBG elegan ti

Transition records of stationary Markov chains.

PubMed

Naudts, Jan; Van der Straeten, Erik

2006-10-01

In any Markov chain with finite state space the distribution of transition records always belongs to the exponential family. This observation is used to prove a fluctuation theorem, and to show that the dynamical entropy of a stationary Markov chain is linear in the number of steps. Three applications are discussed. A known result about entropy production is reproduced. A thermodynamic relation is derived for equilibrium systems with Metropolis dynamics. Finally, a link is made with recent results concerning a one-dimensional polymer model.

Constant mean curvature slicings of Kantowski-Sachs spacetimes

DOE Office of Scientific and Technical Information (OSTI.GOV)

Heinzle, J. Mark

2011-04-15

We investigate existence, uniqueness, and the asymptotic properties of constant mean curvature (CMC) slicings in vacuum Kantowski-Sachs spacetimes with positive cosmological constant. Since these spacetimes violate the strong energy condition, most of the general theorems on CMC slicings do not apply. Although there are in fact Kantowski-Sachs spacetimes with a unique CMC foliation or CMC time function, we prove that there also exist Kantowski-Sachs spacetimes with an arbitrary number of (families of) CMC slicings. The properties of these slicings are analyzed in some detail.

Quasi-measures on the group G{sup m}, Dirichlet sets, and uniqueness problems for multiple Walsh series

DOE Office of Scientific and Technical Information (OSTI.GOV)

Plotnikov, Mikhail G

2011-02-11

Multiple Walsh series (S) on the group G{sup m} are studied. It is proved that every at most countable set is a uniqueness set for series (S) under convergence over cubes. The recovery problem is solved for the coefficients of series (S) that converge outside countable sets or outside sets of Dirichlet type. A number of analogues of the de la Vallee Poussin theorem are established for series (S). Bibliography: 28 titles.

Banach Synaptic Algebras

NASA Astrophysics Data System (ADS)

Foulis, David J.; Pulmannov, Sylvia

2018-04-01

Using a representation theorem of Erik Alfsen, Frederic Schultz, and Erling Størmer for special JB-algebras, we prove that a synaptic algebra is norm complete (i.e., Banach) if and only if it is isomorphic to the self-adjoint part of a Rickart C∗-algebra. Also, we give conditions on a Banach synaptic algebra that are equivalent to the condition that it is isomorphic to the self-adjoint part of an AW∗-algebra. Moreover, we study some relationships between synaptic algebras and so-called generalized Hermitian algebras.

Security of continuous-variable quantum key distribution against general attacks.

PubMed

Leverrier, Anthony; García-Patrón, Raúl; Renner, Renato; Cerf, Nicolas J

2013-01-18

We prove the security of Gaussian continuous-variable quantum key distribution with coherent states against arbitrary attacks in the finite-size regime. In contrast to previously known proofs of principle (based on the de Finetti theorem), our result is applicable in the practically relevant finite-size regime. This is achieved using a novel proof approach, which exploits phase-space symmetries of the protocols as well as the postselection technique introduced by Christandl, Koenig, and Renner [Phys. Rev. Lett. 102, 020504 (2009)].

Traveling wave to a reaction-hyperbolic system for axonal transport

NASA Astrophysics Data System (ADS)

Huang, Feimin; Li, Xing; Zhang, Yinglong

2017-07-01

In this paper, we study a class of nonlinear reaction-hyperbolic systems modeling the neuronal signal transfer in neuroscience. This reaction-hyperbolic system can be regarded as n × n (n ≥ 2) hyperbolic system with relaxation. We first prove the existence of traveling wave by Gershgorin circle theorem and mathematically describe the neuronal signal transport. Then for a special case n = 2, we show the traveling wave is nonlinearly stable, and obtain the convergence rate simultaneously by a weighted estimate.

Conditions for achieving ideal and Lambertian symmetrical solar concentrators.

PubMed

Luque, A; Lorenzo, E

1982-10-15

In this paper we are concerned with symmetrical bidimensional concentrators, and we prove that for a given source's angular extension a curve exists that divides the plane into two regions. No ideal concentrator can be found with its edges on the outer region and no Lambertian concentrator can be found with its edges on the inner region. A consequence of this theorem is that a concentrator is forced to cast some of the incident energy outside the collector to ensure its obtaining the maximum power.

Physical models of polarization mode dispersion

DOE Office of Scientific and Technical Information (OSTI.GOV)

Menyuk, C.R.; Wai, P.K.A.

The effect of randomly varying birefringence on light propagation in optical fibers is studied theoretically in the parameter regime that will be used for long-distance communications. In this regime, the birefringence is large and varies very rapidly in comparison to the nonlinear and dispersive scale lengths. We determine the polarization mode dispersion, and we show that physically realistic models yield the same result for polarization mode dispersion as earlier heuristic models that were introduced by Poole. We also prove an ergodic theorem.

Optimal decay rate for the wave equation on a square with constant damping on a strip

NASA Astrophysics Data System (ADS)

Stahn, Reinhard

2017-04-01

We consider the damped wave equation with Dirichlet boundary conditions on the unit square parametrized by Cartesian coordinates x and y. We assume the damping a to be strictly positive and constant for x<σ and zero for x>σ . We prove the exact t^{-4/3}-decay rate for the energy of classical solutions. Our main result (Theorem 1) answers question (1) of Anantharaman and Léautaud (Anal PDE 7(1):159-214, 2014, Section 2C).

DOE Office of Scientific and Technical Information (OSTI.GOV)

Not Available

This paper reports on an automated metering/proving system for custody transfer of crude oil at the Phillips 66 Co. tanker unloading terminal in Freeport, Texas. It is described as one of the most sophisticated systems developed. The menu-driven, one-button automation removes the proving sequence entirely from manual control. The system also is the to be cost-effective and versatile compared to a dedicated flow computer with API calculation capabilities. Developed by Puffer-Sweiven, systems integrators, the new technology additionally is thought to be the first custody transfer system to employ a programmable logic controller (PLC). The PLC provides the automation, gathers andmore » stores all raw data, and prints alarms. Also the system uses a personal computer operator interface (OI) that runs on the Intel iRMX real time operating system. The OI is loaded with Puffer-Sweiven application software that performs API meter factor and volume correction calculations as well as present color graphics and generate reports.« less

Automated Management Of Documents

NASA Technical Reports Server (NTRS)

Boy, Guy

1995-01-01

Report presents main technical issues involved in computer-integrated documentation. Problems associated with automation of management and maintenance of documents analyzed from perspectives of artificial intelligence and human factors. Technologies that may prove useful in computer-integrated documentation reviewed: these include conventional approaches to indexing and retrieval of information, use of hypertext, and knowledge-based artificial-intelligence systems.

Well-posedness and continuity properties of the Fornberg-Whitham equation in Besov spaces

NASA Astrophysics Data System (ADS)

Holmes, John; Thompson, Ryan C.

2017-10-01

In this paper, we prove well-posedness of the Fornberg-Whitham equation in Besov spaces B2,rs in both the periodic and non-periodic cases. This will imply the existence and uniqueness of solutions in the aforementioned spaces along with the continuity of the data-to-solution map provided that the initial data belongs to B2,rs. We also establish sharpness of continuity on the data-to-solution map by showing that it is not uniformly continuous from any bounded subset of B2,rs to C ([ - T , T ] ;B2,rs). Furthermore, we prove a Cauchy-Kowalevski type theorem for this equation that establishes the existence and uniqueness of real analytic solutions and also provide blow-up criterion for solutions.

Universal Hitting Time Statistics for Integrable Flows

NASA Astrophysics Data System (ADS)

Dettmann, Carl P.; Marklof, Jens; Strömbergsson, Andreas

2017-02-01

The perceived randomness in the time evolution of "chaotic" dynamical systems can be characterized by universal probabilistic limit laws, which do not depend on the fine features of the individual system. One important example is the Poisson law for the times at which a particle with random initial data hits a small set. This was proved in various settings for dynamical systems with strong mixing properties. The key result of the present study is that, despite the absence of mixing, the hitting times of integrable flows also satisfy universal limit laws which are, however, not Poisson. We describe the limit distributions for "generic" integrable flows and a natural class of target sets, and illustrate our findings with two examples: the dynamics in central force fields and ellipse billiards. The convergence of the hitting time process follows from a new equidistribution theorem in the space of lattices, which is of independent interest. Its proof exploits Ratner's measure classification theorem for unipotent flows, and extends earlier work of Elkies and McMullen.

Sufficient conditions for uniqueness of the weak value

NASA Astrophysics Data System (ADS)

Dressel, J.; Jordan, A. N.

2012-01-01

We review and clarify the sufficient conditions for uniquely defining the generalized weak value as the weak limit of a conditioned average using the contextual values formalism introduced in Dressel, Agarwal and Jordan (2010 Phys. Rev. Lett. 104 240401). We also respond to criticism of our work by Parrott (arXiv:1105.4188v1) concerning a proposed counter-example to the uniqueness of the definition of the generalized weak value. The counter-example does not satisfy our prescription in the case of an underspecified measurement context. We show that when the contextual values formalism is properly applied to this example, a natural interpretation of the measurement emerges and the unique definition in the weak limit holds. We also prove a theorem regarding the uniqueness of the definition under our sufficient conditions for the general case. Finally, a second proposed counter-example by Parrott (arXiv:1105.4188v6) is shown not to satisfy the sufficiency conditions for the provided theorem.

Cosmic equilibration: A holographic no-hair theorem from the generalized second law

NASA Astrophysics Data System (ADS)

Carroll, Sean M.; Chatwin-Davies, Aidan

2018-02-01

In a wide class of cosmological models, a positive cosmological constant drives cosmological evolution toward an asymptotically de Sitter phase. Here we connect this behavior to the increase of entropy over time, based on the idea that de Sitter spacetime is a maximum-entropy state. We prove a cosmic no-hair theorem for Robertson-Walker and Bianchi I spacetimes that admit a Q-screen ("quantum" holographic screen) with certain entropic properties: If generalized entropy, in the sense of the cosmological version of the generalized second law conjectured by Bousso and Engelhardt, increases up to a finite maximum value along the screen, then the spacetime is asymptotically de Sitter in the future. Moreover, the limiting value of generalized entropy coincides with the de Sitter horizon entropy. We do not use the Einstein field equations in our proof, nor do we assume the existence of a positive cosmological constant. As such, asymptotic relaxation to a de Sitter phase can, in a precise sense, be thought of as cosmological equilibration.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Beigi, Salman

Sandwiched (quantum) α-Rényi divergence has been recently defined in the independent works of Wilde et al. [“Strong converse for the classical capacity of entanglement-breaking channels,” preprint http://arxiv.org/abs/arXiv:1306.1586 (2013)] and Müller-Lennert et al. [“On quantum Rényi entropies: a new definition, some properties and several conjectures,” preprint http://arxiv.org/abs/arXiv:1306.3142v1 (2013)]. This new quantum divergence has already found applications in quantum information theory. Here we further investigate properties of this new quantum divergence. In particular, we show that sandwiched α-Rényi divergence satisfies the data processing inequality for all values of α > 1. Moreover we prove that α-Holevo information, a variant of Holevo informationmore » defined in terms of sandwiched α-Rényi divergence, is super-additive. Our results are based on Hölder's inequality, the Riesz-Thorin theorem and ideas from the theory of complex interpolation. We also employ Sion's minimax theorem.« less

Time-dependent entropy evolution in microscopic and macroscopic electromagnetic relaxation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Baker-Jarvis, James

This paper is a study of entropy and its evolution in the time and frequency domains upon application of electromagnetic fields to materials. An understanding of entropy and its evolution in electromagnetic interactions bridges the boundaries between electromagnetism and thermodynamics. The approach used here is a Liouville-based statistical-mechanical theory. I show that the microscopic entropy is reversible and the macroscopic entropy satisfies an H theorem. The spectral entropy development can be very useful for studying the frequency response of materials. Using a projection-operator based nonequilibrium entropy, different equations are derived for the entropy and entropy production and are applied tomore » the polarization, magnetization, and macroscopic fields. I begin by proving an exact H theorem for the entropy, progress to application of time-dependent entropy in electromagnetics, and then apply the theory to relevant applications in electromagnetics. The paper concludes with a discussion of the relationship of the frequency-domain form of the entropy to the permittivity, permeability, and impedance.« less

On the homotopy equivalence of simple AI-algebras

DOE Office of Scientific and Technical Information (OSTI.GOV)

Aristov, O Yu

1999-02-28

Let A and B be simple unital AI-algebras (an AI-algebra is an inductive limit of C*-algebras of the form BigOplus{sub i}{sup k}C([0,1],M{sub N{sub i}}). It is proved that two arbitrary unital homomorphisms from A into B such that the corresponding maps K{sub 0}A{yields}K{sub 0}B coincide are homotopic. Necessary and sufficient conditions on the Elliott invariant for A and B to be homotopy equivalent are indicated. Moreover, two algebras in the above class having the same K-theory but not homotopy equivalent are constructed. A theorem on the homotopy of approximately unitarily equivalent homomorphisms between AI-algebras is used in the proof, whichmore » is deduced in its turn from a generalization to the case of AI-algebras of a theorem of Manuilov stating that a unitary matrix almost commuting with a self-adjoint matrix h can be joined to 1 by a continuous path consisting of unitary matrices almost commuting with h.« less

Discontinuous Galerkin Methods for NonLinear Differential Systems

NASA Technical Reports Server (NTRS)

Barth, Timothy; Mansour, Nagi (Technical Monitor)

2001-01-01

This talk considers simplified finite element discretization techniques for first-order systems of conservation laws equipped with a convex (entropy) extension. Using newly developed techniques in entropy symmetrization theory, simplified forms of the discontinuous Galerkin (DG) finite element method have been developed and analyzed. The use of symmetrization variables yields numerical schemes which inherit global entropy stability properties of the PDE (partial differential equation) system. Central to the development of the simplified DG methods is the Eigenvalue Scaling Theorem which characterizes right symmetrizers of an arbitrary first-order hyperbolic system in terms of scaled eigenvectors of the corresponding flux Jacobian matrices. A constructive proof is provided for the Eigenvalue Scaling Theorem with detailed consideration given to the Euler equations of gas dynamics and extended conservation law systems derivable as moments of the Boltzmann equation. Using results from kinetic Boltzmann moment closure theory, we then derive and prove energy stability for several approximate DG fluxes which have practical and theoretical merit.

On the probability of violations of Fourier's law for heat flow in small systems observed for short times

NASA Astrophysics Data System (ADS)

Evans, Denis J.; Searles, Debra J.; Williams, Stephen R.

2010-01-01

We study the statistical mechanics of thermal conduction in a classical many-body system that is in contact with two thermal reservoirs maintained at different temperatures. The ratio of the probabilities, that when observed for a finite time, the time averaged heat flux flows in and against the direction required by Fourier's Law for heat flow, is derived from first principles. This result is obtained using the transient fluctuation theorem. We show that the argument of that theorem, namely, the dissipation function is, close to equilibrium, equal to a microscopic expression for the entropy production. We also prove that if transient time correlation functions of smooth zero mean variables decay to zero at long times, the system will relax to a unique nonequilibrium steady state, and for this state, the thermal conductivity must be positive. Our expressions are tested using nonequilibrium molecular dynamics simulations of heat flow between thermostated walls.

On the mass of static metrics with positive cosmological constant: I

NASA Astrophysics Data System (ADS)

Borghini, Stefano; Mazzieri, Lorenzo

2018-06-01

In this paper we prove a new uniqueness result for the de Sitter solution. Our theorem is based on a new notion of mass, whose well-posedness is discussed and established in the realm of static spacetimes with positive cosmological constant that are bounded by Killing horizons. This new definition is formulated in terms of the surface gravities of the Killing horizons and agrees with the usual notion when the Schwarzschild–de Sitter solutions are considered. A positive mass statement is also shown to hold in this context. The corresponding rigidity statement coincides with the above mentioned characterization of the de Sitter solution as the only static vacuum metric with zero mass. Finally, exploiting some particular features of our formalism, we show how the same analysis can be fruitfully employed to treat the case of negative cosmological constant, leading to a new uniqueness theorem for the anti-de Sitter spacetime, which holds under a very feeble assumption on the asymptotic behavior of the solution.

Lorentz-violating modification of Dirac theory based on spin-nondegenerate operators

NASA Astrophysics Data System (ADS)

Reis, J. A. A. S.; Schreck, M.

2017-04-01

The Standard Model extension (SME) parametrizes all possible Lorentz-violating contributions to the Standard Model and general relativity. It can be considered as an effective framework to describe possible quantum-gravity effects for energies much below the Planck energy. In the current paper, the spin-nondegenerate operators of the SME fermion sector are the focus. The propagators, energies, and solutions to the modified Dirac equation are obtained for several families of coefficients including nonminimal ones. The particle energies and spinors are computed at first order in Lorentz violation and, with the optical theorem, they are shown to be consistent with the propagators. The optical theorem is then also used to derive the matrices formed from a spinor and its Dirac conjugate at all orders in Lorentz violation. The results are the first explicit ones derived for the spin-nondegenerate operators. They will prove helpful for future phenomenological calculations in the SME that rely on the footing of quantum field theory.

Sandwiched Rényi divergence satisfies data processing inequality

DOE Office of Scientific and Technical Information (OSTI.GOV)

Beigi, Salman

2013-12-15

Sandwiched (quantum) α-Rényi divergence has been recently defined in the independent works of Wilde et al. [“Strong converse for the classical capacity of entanglement-breaking channels,” preprint http://arxiv.org/abs/arXiv:1306.1586 (2013)] and Müller-Lennert et al. [“On quantum Rényi entropies: a new definition, some properties and several conjectures,” preprint http://arxiv.org/abs/arXiv:1306.3142v1 (2013)]. This new quantum divergence has already found applications in quantum information theory. Here we further investigate properties of this new quantum divergence. In particular, we show that sandwiched α-Rényi divergence satisfies the data processing inequality for all values of α > 1. Moreover we prove that α-Holevo information, a variant of Holevo informationmore » defined in terms of sandwiched α-Rényi divergence, is super-additive. Our results are based on Hölder's inequality, the Riesz-Thorin theorem and ideas from the theory of complex interpolation. We also employ Sion's minimax theorem.« less

Doing accelerator physics using SDDS, UNIX, and EPICS

DOE Office of Scientific and Technical Information (OSTI.GOV)

Borland, M.; Emery, L.; Sereno, N.

1995-12-31

The use of the SDDS (Self-Describing Data Sets) file protocol, together with the UNIX operating system and EPICS (Experimental Physics and Industrial Controls System), has proved powerful during the commissioning of the APS (Advanced Photon Source) accelerator complex. The SDDS file protocol has permitted a tool-oriented approach to developing applications, wherein generic programs axe written that function as part of multiple applications. While EPICS-specific tools were written for data collection, automated experiment execution, closed-loop control, and so forth, data processing and display axe done with the SDDS Toolkit. Experiments and data reduction axe implemented as UNIX shell scripts that coordinatemore » the execution of EPICS specific tools and SDDS tools. Because of the power and generic nature of the individual tools and of the UNIX shell environment, automated experiments can be prepared and executed rapidly in response to unanticipated needs or new ideas. Examples are given of application of this methodology to beam motion characterization, beam-position-monitor offset measurements, and klystron characterization.« less

[The study of medical supplies automation replenishment algorithm in hospital on medical supplies supplying chain].

PubMed

Sheng, Xi

2012-07-01

The thesis aims to study the automation replenishment algorithm in hospital on medical supplies supplying chain. The mathematical model and algorithm of medical supplies automation replenishment are designed through referring to practical data form hospital on the basis of applying inventory theory, greedy algorithm and partition algorithm. The automation replenishment algorithm is proved to realize automatic calculation of the medical supplies distribution amount and optimize medical supplies distribution scheme. A conclusion could be arrived that the model and algorithm of inventory theory, if applied in medical supplies circulation field, could provide theoretical and technological support for realizing medical supplies automation replenishment of hospital on medical supplies supplying chain.

78 FR 66039 - Modification of National Customs Automation Program Test Concerning Automated Commercial...

Federal Register 2010, 2011, 2012, 2013, 2014

2013-11-04

... Customs Automation Program Test Concerning Automated Commercial Environment (ACE) Cargo Release (Formerly... Simplified Entry functionality in the Automated Commercial Environment (ACE). Originally, the test was known...) test concerning Automated Commercial Environment (ACE) Simplified Entry (SE test) functionality is...

Wormholes with fluid sources: A no-go theorem and new examples

NASA Astrophysics Data System (ADS)

Bronnikov, K. A.; Baleevskikh, K. A.; Skvortsova, M. V.

2017-12-01

For static, spherically symmetric space-times in general relativity (GR), a no-go theorem is proved: it excludes the existence of wormholes with flat and/or anti-de Sitter asymptotic regions on both sides of the throat if the source matter is isotropic, i.e., the radial and tangential pressures coincide. It explains why in all previous attempts to build such solutions it was necessary to introduce boundaries with thin shells that manifestly violate the isotropy of matter. Under a simple assumption on the behavior of the spherical radius r (x ), we obtain a number of examples of wormholes with isotropic matter and one or both de Sitter asymptotic regions, allowed by the no-go theorem. We also obtain twice asymptotically flat wormholes with anisotropic matter, both symmetric and asymmetric with respect to the throat, under the assumption that the scalar curvature is zero. These solutions may be on equal grounds interpreted as those of GR with a traceless stress-energy tensor and as vacuum solutions in a brane world. For such wormholes, the traversability conditions and gravitational lensing properties are briefly discussed. As a byproduct, we obtain twice asymptotically flat regular black hole solutions with up to four Killing horizons. As another byproduct, we point out intersection points in families of integral curves for the function A (x )=gt t, parametrized by its values on the throat.

Relativistic H-theorem and nonextensive kinetic theory

NASA Astrophysics Data System (ADS)

Silva, R.; Lima, J. A. S.

2003-08-01

In 1988 Tsallis proposed a striking generalization of the Boltzmann-Gibbs entropy functional form given by [1] (1) where kB is Boltzmann's constant, pi is the probability of the i-th microstate, and the parameter q is any real number. Nowadays, the q-thermostatistics associated with Sq is being hailed as the possible basis of a theoretical framework appropriate to deal with nonextensive settings. There is a growing body of evidence suggesting that Sq provides a convenient frame for the thermostatistical analysis of many physical systems and processes ranging from the laboratory scale to the astrophysical domain [2]. However, all the basic results, including the proof of the H-theorem has been worked in the classical non-relativistic domain [3]. In this context we discuss the relativistic kinetic foundations of the Tsallis' nonextensive approach through the full Boltzmann's transport equation. Our analysis follows from a nonextensive generalization of the "molecular chaos hypothesis". For q > 0, the q-transport equation satisfies a relativistic H-theorem based on Tsallis entropy. It is also proved that the collisional equilibrium is given by the relativistic Tsallis' q-nonextensive velocity distribution. References [1] C. Tsallis, J. Stat. Phys. 52, 479 (1988). [2] J. A. S. Lima, R. Silva, and J. Santos, Astron. and Astrophys. 396, 309 (2002). [3] J. A. S. Lima, R. Silva, and A. R. Plastino, Phys. Rev. Lett. 86, 2938 (2001).

On the Uniqueness and Consistency of Scattering Amplitudes

NASA Astrophysics Data System (ADS)

Rodina, Laurentiu

In this dissertation, we study constraints imposed by locality, unitarity, gauge invariance, the Adler zero, and constructability (scaling under BCFW shifts). In the first part we study scattering amplitudes as the unique mathematical objects which can satisfy various combinations of such principles. In all cases we find that locality and unitarity may be derived from gauge invariance (for Yang-Mills and General Relativity) or from the Adler zero (for the non-linear sigma model and the Dirac-Born-Infeld model), together with mild assumptions on the singularity structure and mass dimension. We also conjecture that constructability and locality together imply gauge invariance, hence also unitarity. All claims are proved through a soft expansion, and in the process we end re-deriving the well-known leading soft theorems for all four theories. Unlike other proofs of these theorems, we do not assume any form of factorization (unitarity). In the second part we show how tensions arising between gauge invariance (as encoded by spinor helicity variables in four dimensions), locality, unitarity and constructability give rise to various physical properties. These include high-spin no-go theorems, the equivalence principle, and the emergence of supersymmetry from spin 3/2 particles. We also complete the fully on-shell constructability proof of gravity amplitudes, by showing that the improved "bonus'' behavior of gravity under BCFW shifts is a simple consequence of Bose symmetry.

Kerr-de Sitter spacetime, Penrose process, and the generalized area theorem

NASA Astrophysics Data System (ADS)

Bhattacharya, Sourav

2018-04-01

We investigate various aspects of energy extraction via the Penrose process in the Kerr-de Sitter spacetime. We show that the increase in the value of a positive cosmological constant, Λ , always reduces the efficiency of this process. The Kerr-de Sitter spacetime has two ergospheres associated with the black hole and the cosmological event horizons. We prove by analyzing turning points of the trajectory that the Penrose process in the cosmological ergoregion is never possible. We next show that in this process both the black hole and cosmological event horizons' areas increase, and the latter becomes possible when the particle coming from the black hole ergoregion escapes through the cosmological event horizon. We identify a new, local mass function instead of the mass parameter, to prove this generalized area theorem. This mass function takes care of the local spacetime energy due to the cosmological constant as well, including that which arises due to the frame-dragging effect due to spacetime rotation. While the current observed value of Λ is quite small, its effect in this process could be considerable in the early Universe scenario where its value is much larger, where the two horizons could have comparable sizes. In particular, the various results we obtain here are also evaluated in a triply degenerate limit of the Kerr-de Sitter spacetime we find, in which radial values of the inner, the black hole and the cosmological event horizons are nearly coincident.

Computation and visualization of geometric partial differential equations

NASA Astrophysics Data System (ADS)

Tiee, Christopher L.

The chief goal of this work is to explore a modern framework for the study and approximation of partial differential equations, recast common partial differential equations into this framework, and prove theorems about such equations and their approximations. A central motivation is to recognize and respect the essential geometric nature of such problems, and take it into consideration when approximating. The hope is that this process will lead to the discovery of more refined algorithms and processes and apply them to new problems. In the first part, we introduce our quantities of interest and reformulate traditional boundary value problems in the modern framework. We see how Hilbert complexes capture and abstract the most important properties of such boundary value problems, leading to generalizations of important classical results such as the Hodge decomposition theorem. They also provide the proper setting for numerical approximations. We also provide an abstract framework for evolution problems in these spaces: Bochner spaces. We next turn to approximation. We build layers of abstraction, progressing from functions, to differential forms, and finally, to Hilbert complexes. We explore finite element exterior calculus (FEEC), which allows us to approximate solutions involving differential forms, and analyze the approximation error. In the second part, we prove our central results. We first prove an extension of current error estimates for the elliptic problem in Hilbert complexes. This extension handles solutions with nonzero harmonic part. Next, we consider evolution problems in Hilbert complexes and prove abstract error estimates. We apply these estimates to the problem for Riemannian hypersurfaces in R. {n+1},generalizing current results for open subsets of R. {n}. Finally, we applysome of the concepts to a nonlinear problem, the Ricci flow on surfaces, and use tools from nonlinear analysis to help develop and analyze the equations. In the appendices, we detail some additional motivation and a source for further examples: canonical geometries that are realized as steady-state solutions to parabolic equations similar to that of Ricci flow. An eventual goal is to compute such solutions using the methods of the previous chapters.

Generalized Optical Theorem Detection in Random and Complex Media

NASA Astrophysics Data System (ADS)

Tu, Jing

The problem of detecting changes of a medium or environment based on active, transmit-plus-receive wave sensor data is at the heart of many important applications including radar, surveillance, remote sensing, nondestructive testing, and cancer detection. This is a challenging problem because both the change or target and the surrounding background medium are in general unknown and can be quite complex. This Ph.D. dissertation presents a new wave physics-based approach for the detection of targets or changes in rather arbitrary backgrounds. The proposed methodology is rooted on a fundamental result of wave theory called the optical theorem, which gives real physical energy meaning to the statistics used for detection. This dissertation is composed of two main parts. The first part significantly expands the theory and understanding of the optical theorem for arbitrary probing fields and arbitrary media including nonreciprocal media, active media, as well as time-varying and nonlinear scatterers. The proposed formalism addresses both scalar and full vector electromagnetic fields. The second contribution of this dissertation is the application of the optical theorem to change detection with particular emphasis on random, complex, and active media, including single frequency probing fields and broadband probing fields. The first part of this work focuses on the generalization of the existing theoretical repertoire and interpretation of the scalar and electromagnetic optical theorem. Several fundamental generalizations of the optical theorem are developed. A new theory is developed for the optical theorem for scalar fields in nonhomogeneous media which can be bounded or unbounded. The bounded media context is essential for applications such as intrusion detection and surveillance in enclosed environments such as indoor facilities, caves, tunnels, as well as for nondestructive testing and communication systems based on wave-guiding structures. The developed scalar optical theorem theory applies to arbitrary lossless backgrounds and quite general probing fields including near fields which play a key role in super-resolution imaging. The derived formulation holds for arbitrary passive scatterers, which can be dissipative, as well as for the more general class of active scatterers which are composed of a (passive) scatterer component and an active, radiating (antenna) component. Furthermore, the generalization of the optical theorem to active scatterers is relevant to many applications such as surveillance of active targets including certain cloaks, invisible scatterers, and wireless communications. The latter developments have important military applications. The derived theoretical framework includes the familiar real power optical theorem describing power extinction due to both dissipation and scattering as well as a reactive optical theorem related to the reactive power changes. Meanwhile, the developed approach naturally leads to three optical theorem indicators or statistics, which can be used to detect changes or targets in unknown complex media. In addition, the optical theorem theory is generalized in the time domain so that it applies to arbitrary full vector fields, and arbitrary media including anisotropic media, nonreciprocal media, active media, as well as time-varying and nonlinear scatterers. The second component of this Ph.D. research program focuses on the application of the optical theorem to change detection. Three different forms of indicators or statistics are developed for change detection in unknown background media: a real power optical theorem detector, a reactive power optical theorem detector, and a total apparent power optical theorem detector. No prior knowledge is required of the background or the change or target. The performance of the three proposed optical theorem detectors is compared with the classical energy detector approach for change detection. The latter uses a mathematical or functional energy while the optical theorem detectors are based on real physical energy. For reference, the optical theorem detectors are also compared with the matched filter approach which (unlike the optical theorem detectors) assumes perfect target and medium information. The practical implementation of the optical theorem detectors is based for certain random and complex media on the exploitation of time reversal focusing ideas developed in the past 20 years in electromagnetics and acoustics. In the final part of the dissertation, we also discuss the implementation of the optical theorem sensors for one-dimensional propagation systems such as transmission lines. We also present a new generalized likelihood ratio test for detection that exploits a prior data constraint based on the optical theorem. Finally, we also address the practical implementation of the optical theorem sensors for optical imaging systems, by means of holography. The later is the first holographic implementation the optical theorem for arbitrary scenes and targets.

Skolem and pessimism about proof in mathematics.

PubMed

Cohen, Paul J

2005-10-15

Attitudes towards formalization and proof have gone through large swings during the last 150 years. We sketch the development from Frege's first formalization, to the debates over intuitionism and other schools, through Hilbert's program and the decisive blow of the Gödel Incompleteness Theorem. A critical role is played by the Skolem-Lowenheim Theorem, which showed that no first-order axiom system can characterize a unique infinite model. Skolem himself regarded this as a body blow to the belief that mathematics can be reliably founded only on formal axiomatic systems. In a remarkably prescient paper, he even sketches the possibility of interesting new models for set theory itself, something later realized by the method of forcing. This is in contrast to Hilbert's belief that mathematics could resolve all its questions. We discuss the role of new axioms for set theory, questions in set theory itself, and their relevance for number theory. We then look in detail at what the methods of the predicate calculus, i.e. mathematical reasoning, really entail. The conclusion is that there is no reasonable basis for Hilbert's assumption. The vast majority of questions even in elementary number theory, of reasonable complexity, are beyond the reach of any such reasoning. Of course this cannot be proved and we present only plausibility arguments. The great success of mathematics comes from considering 'natural problems', those which are related to previous work and offer a good chance of being solved. The great glories of human reasoning, beginning with the Greek discovery of geometry, are in no way diminished by this pessimistic view. We end by wishing good health to present-day mathematics and the mathematics of many centuries to come.

76 FR 34246 - Automated Commercial Environment (ACE); Announcement of National Customs Automation Program Test...

Federal Register 2010, 2011, 2012, 2013, 2014

2011-06-13

... CBP with authority to conduct limited test programs or procedures designed to evaluate planned... aspects of this test, including the design, conduct and implementation of the test, in order to determine... Environment (ACE); Announcement of National Customs Automation Program Test of Automated Procedures for In...

A Functional Central Limit Theorem for the Becker-Döring Model

NASA Astrophysics Data System (ADS)

Sun, Wen

2018-04-01

We investigate the fluctuations of the stochastic Becker-Döring model of polymerization when the initial size of the system converges to infinity. A functional central limit problem is proved for the vector of the number of polymers of a given size. It is shown that the stochastic process associated to fluctuations is converging to the strong solution of an infinite dimensional stochastic differential equation (SDE) in a Hilbert space. We also prove that, at equilibrium, the solution of this SDE is a Gaussian process. The proofs are based on a specific representation of the evolution equations, the introduction of a convenient Hilbert space and several technical estimates to control the fluctuations, especially of the first coordinate which interacts with all components of the infinite dimensional vector representing the state of the process.

A Loomis-Sikorski theorem and functional calculus for a generalized Hermitian algebra

NASA Astrophysics Data System (ADS)

Foulis, David J.; Jenčová, Anna; Pulmannová, Sylvia

2017-10-01

A generalized Hermitian (GH-) algebra is a generalization of the partially ordered Jordan algebra of all Hermitian operators on a Hilbert space. We introduce the notion of a gh-tribe, which is a commutative GH-algebra of functions on a nonempty set X with pointwise partial order and operations, and we prove that every commutative GH-algebra is the image of a gh-tribe under a surjective GH-morphism. Using this result, we prove that each element a of a GH-algebra A corresponds to a real observable ξa on the σ-orthomodular lattice of projections in A and that ξa determines the spectral resolution of a. Also, if f is a continuous function defined on the spectrum of a, we formulate a definition of f (a), thus obtaining a continuous functional calculus for A.

On an open question of V. Colao and G. Marino presented in the paper "Krasnoselskii-Mann method for non-self mappings".

PubMed

Guo, Meifang; Li, Xia; Su, Yongfu

2016-01-01

Let H be a Hilbert space and let C be a closed convex nonempty subset of H and [Formula: see text] a non-self nonexpansive mapping. A map [Formula: see text] defined by [Formula: see text]. Then, for a fixed [Formula: see text] and for [Formula: see text], Krasnoselskii-Mann algorithm is defined by [Formula: see text] where [Formula: see text]. Recently, Colao and Marino (Fixed Point Theory Appl 2015:39, 2015) have proved both weak and strong convergence theorems when C is a strictly convex set and T is an inward mapping. Meanwhile, they proposed a open question for a countable family of non-self nonexpansive mappings. In this article, authors will give an answer and will prove the further generalized results with the examples to support them.

The Equilibrium State of Colliding Electron Beams

DOE Office of Scientific and Technical Information (OSTI.GOV)

Warnock, R

2003-12-12

We study a nonlinear integral equation that is a necessary condition on the equilibrium phase space distribution function of stored, colliding electron beams. It is analogous to the Haissinski equation, being derived from Vlasov-Fokker-Planck theory, but is quite different in form. The equation is analyzed for the case of the Chao-Ruth model of the beam-beam interaction in one degree of freedom, a so-called strong-strong model with nonlinear beam-beam force. We prove existence of a unique solution, for sufficiently small beam current, by an application of the implicit function theorem. We have not yet proved that this solution is positive, asmore » would be required to establish existence of an equilibrium. There is, however, numerical evidence of a positive solution. We expect that our analysis can be extended to more realistic models.« less

Structure theorems for game trees

PubMed Central

Govindan, Srihari; Wilson, Robert

2002-01-01

Kohlberg and Mertens [Kohlberg, E. & Mertens, J. (1986) Econometrica 54, 1003–1039] proved that the graph of the Nash equilibrium correspondence is homeomorphic to its domain when the domain is the space of payoffs in normal-form games. A counterexample disproves the analog for the equilibrium outcome correspondence over the space of payoffs in extensive-form games, but we prove an analog when the space of behavior strategies is perturbed so that every path in the game tree has nonzero probability. Without such perturbations, the graph is the closure of the union of a finite collection of its subsets, each diffeomorphic to a corresponding path-connected open subset of the space of payoffs. As an application, we construct an algorithm for computing equilibria of an extensive-form game with a perturbed strategy space, and thus approximate equilibria of the unperturbed game. PMID:12060702

Structure theorems for game trees.

PubMed

Govindan, Srihari; Wilson, Robert

2002-06-25

Kohlberg and Mertens [Kohlberg, E. & Mertens, J. (1986) Econometrica 54, 1003-1039] proved that the graph of the Nash equilibrium correspondence is homeomorphic to its domain when the domain is the space of payoffs in normal-form games. A counterexample disproves the analog for the equilibrium outcome correspondence over the space of payoffs in extensive-form games, but we prove an analog when the space of behavior strategies is perturbed so that every path in the game tree has nonzero probability. Without such perturbations, the graph is the closure of the union of a finite collection of its subsets, each diffeomorphic to a corresponding path-connected open subset of the space of payoffs. As an application, we construct an algorithm for computing equilibria of an extensive-form game with a perturbed strategy space, and thus approximate equilibria of the unperturbed game.

Proceedings of the Seminar on the DoD Computer Security Initiative Program, National Bureau of Standards, Gaithersburg, Maryland, July 17-18, 1979.

DTIC Science & Technology

1979-01-01

specifications have been prepared for a DoD communications processor on an IBM minicomputer, a minicomputer time sharing system for the DEC PDP-11 and...the Honeywell Level 6. a virtual machine monitor for the IBM 370, and Multics [10] for the Honeywell Level 68. MECHANISMS FOR KERNEL IMPLEMENTATION...HOL INA ZJO : ANERIONS g PROCESSORn , c ...THEOREMS 1 ITP I-THEOREMS PROOF EVIDENCE - p II KV./370 FORMAL DESIGN PROCESS M4ODULAR DECOMPOSITION * NON

77 FR 48527 - National Customs Automation Program (NCAP) Test Concerning Automated Commercial Environment (ACE...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-08-14

... Program (NCAP) Test Concerning Automated Commercial Environment (ACE) Simplified Entry: Modification of... Automated Commercial Environment (ACE). The test's participant selection criteria are modified to reflect... (NCAP) test concerning Automated Commercial Environment (ACE) Simplified Entry functionality (Simplified...

Matrix theory interpretation of discrete light cone quantization string worldsheets

PubMed

Grignani; Orland; Paniak; Semenoff

2000-10-16

We study the null compactification of type-IIA string perturbation theory at finite temperature. We prove a theorem about Riemann surfaces establishing that the moduli spaces of infinite-momentum-frame superstring worldsheets are identical to those of branched-cover instantons in the matrix-string model conjectured to describe M theory. This means that the identification of string degrees of freedom in the matrix model proposed by Dijkgraaf, Verlinde, and Verlinde is correct and that its natural generalization produces the moduli space of Riemann surfaces at all orders in the genus expansion.

Existence, uniqueness, and stability of stochastic neutral functional differential equations of Sobolev-type

DOE Office of Scientific and Technical Information (OSTI.GOV)

Yang, Xuetao; Zhu, Quanxin, E-mail: zqx22@126.com

2015-12-15

In this paper, we are mainly concerned with a class of stochastic neutral functional differential equations of Sobolev-type with Poisson jumps. Under two different sets of conditions, we establish the existence of the mild solution by applying the Leray-Schauder alternative theory and the Sadakovskii’s fixed point theorem, respectively. Furthermore, we use the Bihari’s inequality to prove the Osgood type uniqueness. Also, the mean square exponential stability is investigated by applying the Gronwall inequality. Finally, two examples are given to illustrate the theory results.

A system of nonlinear set valued variational inclusions.

PubMed

Tang, Yong-Kun; Chang, Shih-Sen; Salahuddin, Salahuddin

2014-01-01

In this paper, we studied the existence theorems and techniques for finding the solutions of a system of nonlinear set valued variational inclusions in Hilbert spaces. To overcome the difficulties, due to the presence of a proper convex lower semicontinuous function ϕ and a mapping g which appeared in the considered problems, we have used the resolvent operator technique to suggest an iterative algorithm to compute approximate solutions of the system of nonlinear set valued variational inclusions. The convergence of the iterative sequences generated by algorithm is also proved. 49J40; 47H06.

Killing-Yano tensors of order n - 1

NASA Astrophysics Data System (ADS)

Batista, Carlos

2014-08-01

The properties of a Killing-Yano tensor of order n-1 in an n-dimensional manifold are investigated. The integrability conditions are worked out and all metrics admitting a Killing-Yano tensor of order n-1 are found. A connection between such tensors and a generalization of the concept of angular momentum is pointed out. A theorem on how to generate closed conformal Killing vectors using the symmetries of a manifold is proved and used to find all Killing-Yano tensors of order n-1 of a maximally symmetric space.

Periodic measure for the stochastic equation of the barotropic viscous gas in a discretized one-dimensional domain

DOE Office of Scientific and Technical Information (OSTI.GOV)

Benseghir, Rym, E-mail: benseghirrym@ymail.com, E-mail: benseghirrym@ymail.com; Benchettah, Azzedine, E-mail: abenchettah@hotmail.com; Raynaud de Fitte, Paul, E-mail: prf@univ-rouen.fr

2015-11-30

A stochastic equation system corresponding to the description of the motion of a barotropic viscous gas in a discretized one-dimensional domain with a weight regularizing the density is considered. In [2], the existence of an invariant measure was established for this discretized problem in the stationary case. In this paper, applying a slightly modified version of Khas’minskii’s theorem [5], we generalize this result in the periodic case by proving the existence of a periodic measure for this problem.

Topics in Nonlinear Filtering Theory.

DTIC Science & Technology

1980-12-01

Brownian, and f(x(t))=x(t). Their main result, to be stated in lemma 3.1, proves that the conditional density of x(t) given Fy is Gaussian and provides...integrals as a sum of multiple integrals and which is an important calculational and con- ceptual tool in the theory of Chapter 4. Technical lemmas ...Theorem 2.2 ( Ito ) Fo(vey r = (Irf If A 2 ]r) For every r, T L ([0,T]r " Thus, if e L2(,FP), there exist kernels kr E2([0,TJr) such that k + r (kr ). r

Semigroup theory and numerical approximation for equations in linear viscoelasticity

NASA Technical Reports Server (NTRS)

Fabiano, R. H.; Ito, K.

1990-01-01

A class of abstract integrodifferential equations used to model linear viscoelastic beams is investigated analytically, applying a Hilbert-space approach. The basic equation is rewritten as a Cauchy problem, and its well-posedness is demonstrated. Finite-dimensional subspaces of the state space and an estimate of the state operator are obtained; approximation schemes for the equations are constructed; and the convergence is proved using the Trotter-Kato theorem of linear semigroup theory. The actual convergence behavior of different approximations is demonstrated in numerical computations, and the results are presented in tables.

Yes, The Precautionary Principle Is Incoherent.

PubMed

Peterson, Martin

2017-11-01

This article is a reply to Thomas Boyer-Kassem's discussion of my criticism of the precautionary principle published in this journal about a decade ago. Boyer-Kassem does not question the logical validity of the theorem proved in my original article, but he brings up important questions about its scope. He also challenges the plausibility of some of the assumptions on which it is based. In this comment, I argue that each objection can be adequately dealt with. As a decision rule, the precautionary principle is (still) incoherent. © 2017 Society for Risk Analysis.

Non-lightlike ruled surfaces with constant curvatures in Minkowski 3-space

NASA Astrophysics Data System (ADS)

Ali, Ahmad Tawfik

We study the non-lightlike ruled surfaces in Minkowski 3-space with non-lightlike base curve c(s) =∫(αt + βn + γb)ds, where t, n, b are the tangent, principal normal and binormal vectors of an arbitrary timelike curve Γ(s). Some important results of flat, minimal, II-minimal and II-flat non-lightlike ruled surfaces are studied. Finally, the following interesting theorem is proved: the only non-zero constant mean curvature (CMC) non-lightlike ruled surface is developable timelike ruled surface generated by binormal vector.

Simple proof of the concavity of the entropy power with respect to Gaussian noise

NASA Technical Reports Server (NTRS)

Dembo, Amir

1989-01-01

A very simple proof of M. H. Costa's result that the entropy power of Xt = X + N (O, tI) is concave in t, is derived as an immediate consequence of an inequality concerning Fisher information. This relationship between Fisher information and entropy is found to be useful for proving the central limit theorem. Thus, one who seeks new entropy inequalities should try first to find new inequalities about Fisher information, or at least to exploit the existing ones in new ways.

Super Generalized Central Limit Theorem —Limit Distributions for Sums of Non-identical Random Variables with Power Laws—

NASA Astrophysics Data System (ADS)

Shintani, Masaru; Umeno, Ken

2018-04-01

The power law is present ubiquitously in nature and in our societies. Therefore, it is important to investigate the characteristics of power laws in the current era of big data. In this paper we prove that the superposition of non-identical stochastic processes with power laws converges in density to a unique stable distribution. This property can be used to explain the universality of stable laws that the sums of the logarithmic returns of non-identical stock price fluctuations follow stable distributions.

Necessary optimality conditions for infinite dimensional state constrained control problems

NASA Astrophysics Data System (ADS)

Frankowska, H.; Marchini, E. M.; Mazzola, M.

2018-06-01

This paper is concerned with first order necessary optimality conditions for state constrained control problems in separable Banach spaces. Assuming inward pointing conditions on the constraint, we give a simple proof of Pontryagin maximum principle, relying on infinite dimensional neighboring feasible trajectories theorems proved in [20]. Further, we provide sufficient conditions guaranteeing normality of the maximum principle. We work in the abstract semigroup setting, but nevertheless we apply our results to several concrete models involving controlled PDEs. Pointwise state constraints (as positivity of the solutions) are allowed.

Some Remarks on Solutions of Fermats Last Equation in Terms of Wright’s Hypergeometric Function

DTIC Science & Technology

1990-02-16

DISTRIBUTION/AVAILABILITY OF ABSTRACT 121 ABSTRACT SECURITY CLASSIFICATION MUNCLASSIFIED/UNLIMITED C SAME AS RPT 0 DTIC USERS UNCLASSIFIED 22a NAME...A) = (u/vl)", 4’ C \\) = (U/V)%, then from Lemma 2 we have (UsV2)n + (U2VI )n = V2) and the theorem is proved. ANOTHER DERIVATION OF EQ. (10) From Eq. (3... Ramanujan (7, pp. 71, 307] studied and derived solutions of trinonials in Chapter 3 of his notebooks (1903-1914) and in his first quarterly report

Small cities face greater impact from automation.

PubMed

Frank, Morgan R; Sun, Lijun; Cebrian, Manuel; Youn, Hyejin; Rahwan, Iyad

2018-02-01

The city has proved to be the most successful form of human agglomeration and provides wide employment opportunities for its dwellers. As advances in robotics and artificial intelligence revive concerns about the impact of automation on jobs, a question looms: how will automation affect employment in cities? Here, we provide a comparative picture of the impact of automation across US urban areas. Small cities will undertake greater adjustments, such as worker displacement and job content substitutions. We demonstrate that large cities exhibit increased occupational and skill specialization due to increased abundance of managerial and technical professions. These occupations are not easily automatable, and, thus, reduce the potential impact of automation in large cities. Our results pass several robustness checks including potential errors in the estimation of occupational automation and subsampling of occupations. Our study provides the first empirical law connecting two societal forces: urban agglomeration and automation's impact on employment. © 2018 The Authors.