Nearest neighbor search is a fundamental task in various domains, such as federated learning, data mining, information retrieval, and biomedicine. With the increasing need to utilize from different organizations while respecting privacy regulations, private federation has emerged promising solution. However, it costly directly apply existing approaches k-nearest (kNN) with difficult-to-compute distance functions, like graph or sequence similarity. To address this challenge, we propose...

Abstract Aiming at the problem of target position determination through multi-missile collaboration, algorithm research on estimation was carried out based line sight angle and missile distance measured by guidance head. Finally, “current” model uniform acceleration were used as motion models, an interactive multi-model filter constructed square root Cubature Kalman to achieve from serpentine maneuver motion. We have improved calculation method for transition probabilities various models in...

We revisit the classical change propagation framework for query evaluation under updates. The standard takes a plan and materializes intermediate views, which incurs high polynomial costs in both space time, with join operator being culprit. In this paper, we propose new without joins, thus naturally avoiding blowup. Meanwhile, show that still supports constant-delay enumeration of deltas full results, same as framework. Furthermore, provide quantitative analysis its update cost, not only...

Collision avoidance is a fundamental problem in navigation. In this paper, we present novel method of cooperative movement planning to examine how two vehicles can orchestrate their movements so as avoid collisions and subsequently return intended paths. Movement research solved by regarding it decision process. When the are at risk collision, system determines appropriate steering motions for both each time step, that they cooperatively change course original when averted. Reinforcement...

In this paper, we propose a collision avoidance algorithm for multi-vehicle systems, which is common problem in many areas, including navigation and robotics. dynamic environments, vehicles may become involved potential collisions with each other, particularly when the vehicle density high direction of travel unrestricted. Cooperatively planning movement can effectively reduce fairly distribute detour inconvenience before subsequently returning to their intended paths. We present novel...

Most existing algorithms computing the maximum independent set (MIS) or (IS) are designed for handling static graphs, which may not be practicable as many networks dynamically evolving over time. In this paper, we study MIS/IS problem in graphs by considering graph update operations: vertex/edge addition and deletion. Instead of updated from scratch, propose a baseline algorithm that finds at time t i+1 based on ti. Due to hardness an exact MIS, develop efficient constant-time LSTwo return...

Conjunctive queries with predicates in the form of comparisons that span multiple relations have regained interest recently, due to their relevance OLAP queries, spatiotemporal databases, and machine learning over relational data. The standard technique, predicate pushdown, has limited efficacy on such comparisons. A technique by Willard can be used process short are adjacent join tree time linear input size plus output size. In this paper, we describe a new algorithm for evaluating...

This paper compares three Simultaneous Localization and Mapping (SLAM) algorithms. SLAM algorithms are the core technology for autonomous navigation environmental perception of mobile robots. used by robots to perceive surrounding environment, build up an environment map position themselves in real-time unknown environment. article first systematically reviews basic principles each algorithm based on experiments studies that have been completed previous researchers illustrates their...

A large number of analytical queries (e.g., all the 22 in TPC-H benchmark) are based on acyclic foreign-key joins. In this paper, we study problem incrementally maintaining query results these joins under updates, i.e., insertion and deletion tuples to any relations. Prior work has shown that is inherently hard, requiring at least Ω(|db|1/2 -ε) time per update, where |db| size database, ε > 0 can be small constant. However, negative result holds only adversarially constructed update...

We will demonstrate SparkSQL+, a SQL processing engine built on top of Spark. Unlike the vanilla SparkSQL that uses classical query plans, SparkSQL+ adopts some recently developed new including generalized hypertree decompositions(GHD), worst-case optimal join (WCOJ) algorithms, and conjunctive queries with comparisons (CQC). also provides platform for users to explore different plans given through web-based interface, compare their performance same Spark core.

We investigate how to efficiently compute the difference result of two (or multiple) conjunctive queries, which is last operator in relational algebra be unraveled. The standard approach practical database systems materialize results for every input query as a separate set, and then sets. This bottlenecked by complexity evaluating individually, could very expensive, particularly when there are only few difference. In this paper, we introduce new exploiting structural property queries...

The evaluation of top-k conjunctive queries, a staple in business analysis, often requires evaluating the query prior to filtering results, leading significant computational overhead within Database Management Systems (DBMSs). While efficient algorithms have been proposed, their integration into DBMSs remains arduous. We introduce relational algorithms, paradigm where each algorithmic step is expressed by operator. This allows algorithm be represented as set SQL enabling easy deployment...

Path-planning for multiple vehicles is a topic relevant to many areas of research including navigation and robotics. In this paper, we present novel approach cooperative movement management examine how two objects can orchestrate their movements so as avoid collisions retain good chance returning intended paths. When the recognize that they are at risk collision, cooperatively change course hitting each other return original when averted. The paths generated selected by system after learning...

We revisit the classical change propagation framework for query evaluation under updates. The standard takes a plan and materializes intermediate views, which incurs high polynomial costs in both space time, with join operator being culprit. In this paper, we propose new without joins, thus naturally avoiding blowup. Meanwhile, show that still supports constant-delay enumeration of deltas full results, same as framework. Furthermore, provide quantitative analysis its update cost, not only...

Conjunctive queries with predicates in the form of comparisons that span multiple relations have regained interest recently, due to their relevance OLAP queries, spatiotemporal databases, and machine learning over relational data. The standard technique, predicate pushdown, has limited efficacy on such comparisons. A technique by Willard can be used process short are adjacent join tree time linear input size plus output size. In this paper, we describe a new algorithm for evaluating...

Attributed bipartite graphs (ABGs) are an expressive data model for describing the interactions between two sets of heterogeneous nodes that associated with rich attributes, such as customer-product purchase networks and author-paper authorship graphs. Partitioning target node set in into k disjoint clusters (referred to k-ABGC) finds widespread use various domains, including social network analysis, recommendation systems, information retrieval, bioinformatics. However, majority existing...

Attributed bipartite graphs (ABGs) are an expressive data model for describing the interactions between two sets of heterogeneous nodes that associated with rich attributes, such as customer-product purchase networks and author-paper authorship graphs. Partitioning target node set in into k disjoint clusters (referred to k-ABGC) finds widespread use various domains, including social network analysis, recommendation systems, information retrieval, bioinformatics. However, majority existing...

We investigate how to efficiently compute the difference result of two (or multiple) conjunctive queries, which is last operator in relational algebra be unraveled. The standard approach practical database systems materialize results for every input query as a separate set, and then sets. This bottlenecked by complexity evaluating individually, could very expensive, particularly when there are only few difference. In this paper, we introduce new exploiting structural property queries...

The repetition-free longest common subsequence problem is an important model in sequence comparison and analyzing conserved genes within bioinformatics. Conserved are highly similar across species play a crucial role understanding the evolution of gene function. However, existing algorithms suffer from limitations concerning runtime efficiency number identified, thereby hindering practical analysis these essential genetic elements. To address challenges, this paper proposes novel hybrid...