Exponential prefixed polynomial equations

A prefixed polynomial equation is an equation of the form $P(t_1,\ldots,t_n) = 0$, where $P$ is a polynomial whose variables $t_1,\ldots,t_n$ range over the natural numbers, preceded by quantifiers over some, or all, of its variables. Here, we consider exponential prefixed polynomial equations (EPPEs), where variables can also occur as exponents. We obtain a relatively concise EPPE equivalent to the combinatorial principle of the Paris-Harrington theorem for pairs (which is independent of primitive recursive arithmetic), as well as an EPPE equivalent to Goodstein's theorem (which is independent of Peano arithmetic). Some new devices are used in addition to known methods for the elimination of bounded universal quantifiers for Diophantine predicates

Semantics through Reference to the Unknown

In this paper, I dwell on a particular distinction introduced by Ilhan Inan—the distinction between ostensible and inostensible use of our language. The distinction applies to singular terms, such as proper names and definite descriptions, or to general terms like concepts and to the ways in which we refer to objects in the world by using such terms. Inan introduces the distinction primarily as an epistemic one but in his earlier writings (1997: 49) he leaves some room for it to have some semantic significance i.e., the view that in certain intensional de re contexts whether a term occurring in a sentence is ostensible or inostensible may have a bearing on the semantic content of the sentence. However, in his later writings e.g., The Philosophy of Curiosity, he appears to abandon his earlier thoughts regarding the semantic significance of his distinction. He says: “the ostensible/inostensible distinction is basically an epistemic one.... It is an epistemic distinction that has no semantic significance” (2012: 65). I argue that there are indeed such intensional contexts in which the distinction has some semantic significance, i.e., whether a term is ostensible or inostensible has in fact a bearing on what proposition is expressed by the sentence in which the term occurs

Fast matrix multiplication techniques based on the Adleman-Lipton model

On distributed memory electronic computers, the implementation and association of fast parallel matrix multiplication algorithms has yielded astounding results and insights. In this discourse, we use the tools of molecular biology to demonstrate the theoretical encoding of Strassen's fast matrix multiplication algorithm with DNA based on an $n$-moduli set in the residue number system, thereby demonstrating the viability of computational mathematics with DNA. As a result, a general scalable implementation of this model in the DNA computing paradigm is presented and can be generalized to the application of \emph{all} fast matrix multiplication algorithms on a DNA computer. We also discuss the practical capabilities and issues of this scalable implementation. Fast methods of matrix computations with DNA are important because they also allow for the efficient implementation of other algorithms (i.e. inversion, computing determinants, and graph theory) with DNA.Comment: To appear in the International Journal of Computer Engineering Research. Minor changes made to make the preprint as similar as possible to the published versio

Looking for single top quarks in D0 data

The search for the electroweak production of top quarks is entering an exciting time: with the ever increasing luminosity furnished by the Tevatron ppbar Collider at Fermilab and sophisticated analysis techniques we are now able to approach the expected standard model production cross section for this new mode of production. Using 370pb-1 of D0 data and likelihoods as discriminants to extract the signal from the large backgrounds, we set upper limits on the standard model production cross section in the s-channel of 5.0 pb and in the t-channel of 4.4 pb, at 95% confidence level.Comment: 5 pages, 3 figures. Contributed to the proceedings of the 34th International Meeting on Fundamental Physics. El Escorial, Spain, April 200

Evidence for single top quark production at D0

The results of the first analysis to show evidence for production of single top quarks are presented. Using 0.9 fb-1 of data collected with the D0 detector at the Fermilab Tevatron, the analysis is performed in the electron+jets and muon+jets decay modes, taking special care in modeling the large backgrounds, applying a new powerful b-quark tagging algorithm and using three multivariate techniques to extract the small signal in the data. The combined measured production cross section is 4.8 +- 1.3 pb. The probability to measure a cross section at this value or higher in the absence of a signal is 0.027%, corresponding to a 3.5 standard deviation significance.Comment: 6 pages, 4 figures. Presented at 42nd Rencontres de Moriond on Electroweak Interactions and Unified Theories, La Thuile, Italy, 10-17 Mar 200

Analysis of the three-dimensional segmented Poincaré plot for complex coupling analyses of the autonomic regulation

Pregnancy is still one of the most delicate stages in a woman’s life, especially in the third world countries. In this project, we propose to characterize and analyse the respiratory and cardiovascular systems using the Poincaré plot. 112 pregnant women that suffered different pregnancy illnesses and 10 Non-pregnant women were analysed. In this project we implement a new algorithm to an already established method of analysis, the 3 dimension Segmented Poincaré Plot Analysis (3DSPPA). RR, SYS, DIA and TRESP time series were extracted from the ECG, blood pressure and respiratory flow signals, respectively. Parameters that describe the importance of the concentrations of the scatterplot of the Poincaré method along their relative positions, related to a series of levels described by the user, were extracted. An analysis of those extracted parameters lead to our results. These results show a difference between the studied parameters from every health condition analysed leading us to be able to discern between them with our algorithm