Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 29 for “"Query Model"”.
-
An object-oriented data and query model
… identifiers; a result set is asserted; and a query expression’s meta details are asserted too. The algebra has ten operators and most have algebraic properties. A framework was developed too and it has its object base loaded with methods that maintain it and our algebra. A framework’s function …
-
Integrating Flexibility and Fuzziness into a Question Driven Query Model
… cooperated and developed various data models which form the main foundation for existing database management systems. The relational data model is still dominating despite the rapid development in the techniques used for data collection, storage and processing. Further, a relational …
-
Visual Basic time-space query modeling for geovisualization of life paths
… an annual census taken in Sweden. A space-time query model was constructed to explore associations between an individual's residential locations for given periods of time to those of other individuals with similar heath, or health related factors. The space-time query model was created in the …
-
Concept based retrieval and information filtering
… system. In this thesis, we develop a conceptual query model that is close to the user's need and investigate an information filtering method for text categorization/classification. The central idea of our conceptual model is captured in a rule based query model. The proposed approach involves …
-
Computational Problems Related to Open Quantum Systems
… of quantum algorithms. We present a dissipative query model, which is based on the amplitude damping process. With this dissipative query model, we provide a quantum algorithm that performs a fixed-point quantum search while preserving the quadratic speedup against classical algorithms.
-
Exploring Techniques for Providing Privacy in Location-Based Services Nearest Neighbor Query
… Each technique tries to address different models with which location-based services respond to subscribers. In this work, we present ideas to address privacy concerns for the two main models namely: the snapshot nearest neighbor query model and the continuous nearest neighbor query model. …
-
Connectivity Query Processing in Temporal Graphs
The connectivity query in undirected graphs aims to determine if there exists a path connecting two query vertices, which is a fundamental task in both graph theory and real graph-driven tasks. The temporal graph has a time label for each edge and is commonly used to capture the interactions …
-
Service-Oriented Sensor-Actuator Networks
… SANETs and generic SANETs. We first define a query model and an architecture for SOSANETs. The proposed query model offers a simple, uniform query interface whereby applications specify sensing and actuation queries independently from any specific deployment of the underlying SOSANET. We then …
-
Quantum Cost Models for Cryptanalysis of Isogenies
… The key size is based on an analysis in the query model. Queries do not reflect the full cost of an algorithm, and this thesis considers other cost models. These models fit in a memory peripheral framework, which focuses on the classical control costs of a quantum computer. Rather than …
-
A semantic framework for event-driven service composition
… service matchmaking. Furthermore, existing models that implement SOA have mostly middleware-controlled synchronous request/replybased runtime binding of services that incur undesirable service latency. In addition, they impose expensive state monitoring overhead on the middleware. Some newer …
-
Efficient Delivery of Web Services
… most of our work on presenting a comprehensive query infrastructure for the emerging concept of Web services. The core of this query infrastructure is to enable the efficient delivery of Web services based on the concept of Quality of Web Service. Treating Web services as first class objects is …
-
Limitations of Quantum Methods for Breaking Cryptography and for Optimization
… studies permutation inversion in the quantum query model, proving lower bounds showing that the problem remains essentially as hard as standard inversion even with inverse access or quantum advice. These results highlight fundamental barriers to quantum speedups that are independent of …
-
Capability Language Processing (CLP): Classification and Ranking of Manufacturing Suppliers Based on Unstructured Capability Data
… with human judgment, especially if the query model and supplier capability model belong to the same class. However, the correlation decreases when multiple overlapping classes of suppliers are mixed. The findings of this research can be used to improve the precision and reliability of …
-
Sample-Complexity Optimality Under Local Differential Privacy and Related Models
… between local privacy and data-access models which turn out to be closely related. In particular, we demonstrate an equivalence between the sample complexity of learning under sequential LDP and the sample complexity of learning under single-intrusion pan-privacy. Finally, we …
-
Expressivity and learnability of sequence models
… capabilities and learnability of sequence models, with a focus on Transformers, the backbone of modern large language models. We first investigate expressivity: whether and how efficiently an architecture can represent a target function. For a range of algorithmic tasks, we prove …
-
Sublinear Algorithm And Lower Bound For Combinatorial Problems
… combinatorial problems in different computation models that process large input sizes using limited resources. In particular, we consider the query model, streaming model, and massively parallel computation model. In addition, we also study the tradeoffs between the adaptivity and performance of …
-
Efficient Framework for Quantum Walks and Beyond
… of any abstract search algorithm. The total query complexity is given by the quantum hitting time of the resulting operator, which we show that it is of the same order as the quantum hitting time of the original algorithm. As a major application of our framework, we show that for any …
-
SYMMETRIC-KEY CRYPTOGRAPHY AND QUERY COMPLEXITY IN THE QUANTUM WORLD
… both are secure in a realistic quantum attack model. For example, we prove that 2^{n/3} quantum queries are necessary to break the Even-Mansour cipher. We also consider the practical applications that our work implies. Using our framework, we derive post-quantum security proofs for three …
-
A study of language models for exploiting user feedback in Information Retrieval
… there are not many works exploring language modeling techniques for feedback. In this thesis, I study how to use language models to exploit user feedback, including long-term implicit feedback and short-term explicit term-based feedback. I show that language models have unique advantages in …
-
Variants of Pseudo-deterministic Algorithms and Duality in TFNP
… algorithms for search problems in query complexity. Roughly, for a search problem $\cS$, a faux-deterministic algorithm is a probability distribution $\mathcal{A}$ over deterministic algorithms $A\in \mathcal{A}$ such that no computationally bounded adversary making black-box …
Page 1 of 2