857 research outputs found
The Kochen-Specker and Conway-Kochen Theorems
This essay provides an analysis of two important theorems that arise in the context of quantum mechanics: the Kochen-Specker theorem, which challenges the existence of hidden variable theories; and the Conway-Kochen (free will) theorem, which can be seen as an improvement over the Kochen-Specker theorem, but instead focuses on challenging determinism
The Kochen-Specker and Conway-Kochen Theorems
This essay provides an analysis of two important theorems that arise in the context of quantum mechanics: the Kochen-Specker theorem, which challenges the existence of hidden variable theories; and the Conway-Kochen (free will) theorem, which can be seen as an improvement over the Kochen-Specker theorem, but instead focuses on challenging determinism
A user driven method for database reverse engineering
In this thesis we describe the UQoRE method which supports database reverse
engineering by using a data mining technique. Generally, Reverse Engineering
methods work by using information extracted from data dictionaries, database
extensions, application programs and expert users. The main differences
between all these methods rely on the assumptions made on the a-priori
knowledge available about the database (schema and constraints on attributes)
as well as the user competence. Most of them are based on the attribute name
consistency. This paper presents a method based on user queries. Queries are
stored in a “Query Base” and our system mines this new source of knowledge in
order to discover hidden links and similarity between database elements
Barbar Harmel to James Meredith (3 October 1962)
https://egrove.olemiss.edu/mercorr_pro/1211/thumbnail.jp
Barbar Lathrop to Mr. Meredith (1 October 1962)
https://egrove.olemiss.edu/mercorr_pro/1327/thumbnail.jp
An examination of heuristic algorithms for the travelling salesman problem
The role of heuristics in combinatorial optimization is discussed. Published heuristics for the Travelling Salesman Problem (TSP) were reviewed and morphological boxes were used to develop new heuristics for the TSP. New and published heuristics were programmed for symmetric TSPs where the triangle inequality holds, and were tested on micro computer. The best of the quickest heuristics was the furthest insertion heuristic, finding tours 3 to 9% above the best known solutions (2 minutes for 100 nodes). Better results were found by longer running heuristics, e.g. the cheapest angle heuristic (CCAO), 0-6% above best (80 minutes for 100 nodes). The savings heuristic found the best results overall, but took more than 2 hours to complete. Of the new heuristics, the MST path algorithm at times improved on the results of the furthest insertion heuristic while taking the same time as the CCAO. The study indicated that there is little likelihood of improving on present methods unless a fundamental new approach is discovered. Finally a case study using TSP heuristics to aid the planning of grid surveys was described
Progesterone myometrial effect and mechanism for the prevention of preterm birth
Current evidence suggests that prolonged treatment with progesterone and 17 α-
hydroxyprogesterone caproate (17OHPC) may reduce the incidence of premature delivery in high risk patients with a history of spontaneous preterm birth or with a short cervix but failed to understand the mechanism on myometrium
- …