scholarly journals Interpreting singular definite descriptions in database queries

1985 ◽  
Author(s):  
Genevieve Berry-Rogghe
Keyword(s):  
Definite Descriptions ◽  
Database Queries

scholarly journals Multi-objective database queries in combined knapsack and set covering problem domains

2021 ◽  
Vol 8 (1) ◽  
Author(s):  
Sean A. Mochocki ◽  
Gary B. Lamont ◽  
Robert C. Leishman ◽  
Kyle J. Kauffman
Keyword(s):  
Relational Database ◽  
Set Covering ◽  
Covering Problem ◽  
Set Covering Problem ◽  
Database Queries ◽  
Multi Objective ◽  
Data Representations ◽  
Np Hard Problem ◽  
Institute Of Technology ◽  
The One

AbstractDatabase queries are one of the most important functions of a relational database. Users are interested in viewing a variety of data representations, and this may vary based on database purpose and the nature of the stored data. The Air Force Institute of Technology has approximately 100 data logs which will be converted to the standardized Scorpion Data Model format. A relational database is designed to house this data and its associated sensor and non-sensor metadata. Deterministic polynomial-time queries were used to test the performance of this schema against two other schemas, with databases of 100 and 1000 logs of repeated data and randomized metadata. Of these approaches, the one that had the best performance was chosen as AFIT’s database solution, and now more complex and useful queries need to be developed to enable filter research. To this end, consider the combined Multi-Objective Knapsack/Set Covering Database Query. Algorithms which address The Set Covering Problem or Knapsack Problem could be used individually to achieve useful results, but together they could offer additional power to a potential user. This paper explores the NP-Hard problem domain of the Multi-Objective KP/SCP, proposes Genetic and Hill Climber algorithms, implements these algorithms using Java, populates their data structures using SQL queries from two test databases, and finally compares how these algorithms perform.

scholarly journals A Puzzle about Logical Analysis

Philosophia ◽  
2021 ◽  
Author(s):  
Stefan Rinner
Keyword(s):  
Complete Solution ◽  
Definite Descriptions ◽  
Logical Analysis ◽  
Frege’S Puzzle ◽  
Main Thesis ◽  
Frege's Puzzle ◽  
Belief Ascriptions

AbstractIn this paper, I will present a puzzle for logical analyses, such as Russell’s analysis of definite descriptions and Recanati’s analysis of ‘that’-clauses. I will argue that together with Kripke’s disquotational principles connecting sincere assent and belief such non-trivial logical analyses lead to contradictions. Following this, I will compare the puzzle about logical analysis with Frege’s puzzle about belief ascriptions. We will see that although the two puzzles do have similarities, the solutions to Frege’s puzzle cannot be applied mutatis mutandis to the puzzle about logical analysis. Hence, to say it with Kripke, the main thesis of this paper is that the puzzle is a puzzle. A complete solution to the puzzle promises a better understanding of both logical analyses and belief ascriptions.

Comprehensive Analysis of Automatic Identification System (AIS) Data in Regard to Vessel Movement Prediction

2014 ◽  
Vol 67 (5) ◽  
pp. 791-809 ◽  
Author(s):  
Philipp Last ◽  
Christian Bahlke ◽  
Martin Hering-Bertram ◽  
Lars Linsen
Keyword(s):  
Large Data ◽  
Automatic Identification ◽  
Identification System ◽  
Very High Frequency ◽  
Database Queries ◽  
Related Data ◽  
Movement Prediction ◽  
Time Period ◽  
Current Usage ◽  
Exchange Vessel

AIS was primarily developed to exchange vessel-related data among vessels or AIS stations by using very-high frequency (VHF) technology to increase safety at sea. This study evaluates the formal integrity, availability, and the reporting intervals of AIS data with a focus on vessel movement prediction. In contrast to former studies, this study is based on a large data collection of over 85 million AIS messages, which were continuously received within a time period of two months. Thus, the evaluated data represent a comprehensive and up-to-date view of the current usage of AIS systems installed on vessels. Results of previous studies concerning the availability of AIS data are confirmed and extended. New aspects such as reporting intervals are additionally evaluated. Received messages are stored in a database, which allows for performing database queries to evaluate the obtained data in an automatic way. This study shows that almost ten years after becoming mandatory for professional operating vessels, AIS still lacks availability for both static and dynamic data and that the reporting intervals are not as reliable as specified within the technical AIS standard.

Asymmetries between uniqueness and familiarity in the semantics of definite descriptions

2021 ◽  
Vol 30 ◽  
pp. 694
Author(s):  
Sadhwi Srinivas ◽  
Kyle Rawlins ◽  
Daphna Heller
Keyword(s):  
Definite Descriptions ◽  
Definite Article ◽  
Two Factors ◽  
Future Work

In over a century of research into the English definite article "the", two main theoretical factors have been identified as relevant to its meaning: namely, (i) uniqueness and (ii) familiarity. The identification of these factors has led to an extensive debate in semantics about which of them is more fundamental to the meaning of "the". In this paper, we contribute to this debate by introducing novel data obtained through two controlled psycholinguistic experiments. We manipulated uniqueness and familiarity of potential referents, examining how these factors affect the comprehension and production of English definite descriptions. The behavioral results reveal an asymmetry between these two factors, with familiarity being a weaker cue than uniqueness – a pattern that is unexpected under any existing theory of definiteness. We close with a discussion of possible extensions to existing theories in light of this result, as well as avenues for future work.

Reducing the communication complexity of quantum private database queries by subtle classical post-processing with relaxed quantum ability

2019 ◽  
Vol 81 ◽  
pp. 15-24 ◽  
Author(s):  
Yu-Guang Yang ◽  
Xue-Pei Guo ◽  
Gang Xu ◽  
Xiu-Bo Chen ◽  
Jian Li ◽  
...  
Keyword(s):  
Communication Complexity ◽  
Post Processing ◽  
Database Queries
Sign in / Sign up

Export Citation Format

Share Document