search problem
Recently Published Documents


TOTAL DOCUMENTS

520
(FIVE YEARS 194)

H-INDEX

28
(FIVE YEARS 4)

2022 ◽  
Vol 40 (3) ◽  
pp. 1-29
Author(s):  
Jing Yao ◽  
Zhicheng Dou ◽  
Ji-Rong Wen

Personalized search tailors document ranking lists for each individual user based on her interests and query intent to better satisfy the user’s information need. Many personalized search models have been proposed. They first build a user interest profile from the user’s search history, and then re-rank the documents based on the personalized matching scores between the created profile and candidate documents. In this article, we attempt to solve the personalized search problem from an alternative perspective of clarifying the user’s intention of the current query. We know that there are many ambiguous words in natural language such as “Apple.” People with different knowledge backgrounds and interests have personalized understandings of these words. Therefore, we propose a personalized search model with personal word embeddings for each individual user that mainly contain the word meanings that the user already knows and can reflect the user interests. To learn great personal word embeddings, we design a pre-training model that captures both the textual information of the query log and the information about user interests contained in the click-through data represented as a graph structure. With personal word embeddings, we obtain the personalized word and context-aware representations of the query and documents. Furthermore, we also employ the current session as the short-term search context to dynamically disambiguate the current query. Finally, we use a matching model to calculate the matching score between the personalized query and document representations for ranking. Experimental results on two large-scale query logs show that our designed model significantly outperforms state-of-the-art personalization models.


2022 ◽  
Vol 183 (1-2) ◽  
pp. 125-167
Author(s):  
Ronny Tredup

For a fixed type of Petri nets τ, τ-SYNTHESIS is the task of finding for a given transition system A a Petri net N of type τ(τ-net, for short) whose reachability graph is isomorphic to A if there is one. The decision version of this search problem is called τ-SOLVABILITY. If an input A allows a positive decision, then it is called τ-solvable and a sought net N τ-solves A. As a well known fact, A is τ-solvable if and only if it has the so-called τ-event state separation property (τ-ESSP, for short) and the τ-state separation property (τ-SSP, for short). The question whether A has the τ-ESSP or the τ-SSP defines also decision problems. In this paper, for all b ∈ ℕ, we completely characterize the computational complexity of τ-SOLVABILITY, τ-ESSP and τ-SSP for the types of pure b-bounded Place/Transition-nets, the b-bounded Place/Transitionnets and their corresponding ℤb+1-extensions.


Author(s):  
Pablo Andres-Martinez ◽  
Chris Heunen

Abstract A while loop tests a termination condition on every iteration. On a quantum computer, such measurements perturb the evolution of the algorithm. We define a while loop primitive using weak measurements, offering a trade-off between the perturbation caused and the amount of information gained per iteration. This trade-off is adjusted with a parameter set by the programmer. We provide sufficient conditions that let us determine, with arbitrarily high probability, a worst-case estimate of the number of iterations the loop will run for. As an example, we solve Grover's search problem using a while loop and prove the quadratic quantum speed-up is maintained.


2022 ◽  
Vol 22 (1&2) ◽  
pp. 53-85
Author(s):  
Thomas G. Wong

The task of finding an entry in an unsorted list of $N$ elements famously takes $O(N)$ queries to an oracle for a classical computer and $O(\sqrt{N})$ queries for a quantum computer using Grover's algorithm. Reformulated as a spatial search problem, this corresponds to searching the complete graph, or all-to-all network, for a marked vertex by querying an oracle. In this tutorial, we derive how discrete- and continuous-time (classical) random walks and quantum walks solve this problem in a thorough and pedagogical manner, providing an accessible introduction to how random and quantum walks can be used to search spatial regions. Some of the results are already known, but many are new. For large $N$, the random walks converge to the same evolution, both taking $N \ln(1/\epsilon)$ time to reach a success probability of $1-\epsilon$. In contrast, the discrete-time quantum walk asymptotically takes $\pi\sqrt{N}/2\sqrt{2}$ timesteps to reach a success probability of $1/2$, while the continuous-time quantum walk takes $\pi\sqrt{N}/2$ time to reach a success probability of $1$.


2022 ◽  
Vol 31 (2) ◽  
pp. 1131-1142
Author(s):  
Iftikhar Ahmad ◽  
Abdulwahab Ali Almazroi ◽  
Mohammed A. Alqarni ◽  
Muhammad Kashif Nawaz
Keyword(s):  

2021 ◽  
Vol 9 (4) ◽  
pp. 1-27
Author(s):  
Anat Ganor ◽  
Karthik C. S. ◽  
Dömötör Pálvölgyi

Brouwer’s fixed point theorem states that any continuous function from a compact convex space to itself has a fixed point. Roughgarden and Weinstein (FOCS 2016) initiated the study of fixed point computation in the two-player communication model, where each player gets a function from [0,1]^n to [0,1]^n , and their goal is to find an approximate fixed point of the composition of the two functions. They left it as an open question to show a lower bound of 2^{\Omega (n)} for the (randomized) communication complexity of this problem, in the range of parameters which make it a total search problem. We answer this question affirmatively. Additionally, we introduce two natural fixed point problems in the two-player communication model. Each player is given a function from [0,1]^n to [0,1]^{n/2} , and their goal is to find an approximate fixed point of the concatenation of the functions. Each player is given a function from [0,1]^n to [0,1]^{n} , and their goal is to find an approximate fixed point of the mean of the functions. We show a randomized communication complexity lower bound of 2^{\Omega (n)} for these problems (for some constant approximation factor). Finally, we initiate the study of finding a panchromatic simplex in a Sperner-coloring of a triangulation (guaranteed by Sperner’s lemma) in the two-player communication model: A triangulation T of the d -simplex is publicly known and one player is given a set S_A\subset T and a coloring function from S_A to \lbrace 0,\ldots ,d/2\rbrace , and the other player is given a set S_B\subset T and a coloring function from S_B to \lbrace d/2+1,\ldots ,d\rbrace , such that S_A\dot{\cup }S_B=T , and their goal is to find a panchromatic simplex. We show a randomized communication complexity lower bound of |T|^{\Omega (1)} for the aforementioned problem as well (when d is large). On the positive side, we show that if d\le 4 then there is a deterministic protocol for the Sperner problem with O((\log |T|)^2) bits of communication.


Algorithms ◽  
2021 ◽  
Vol 15 (1) ◽  
pp. 10
Author(s):  
Márcia R. Cappelle ◽  
Les R. Foulds ◽  
Humberto J. Longo

Given a monotone ordered multi-dimensional real array A and a real value k, an important question in computation is to establish if k is a member of A by sequentially searching A by comparing k with some of its entries. This search problem and its known results are surveyed, including the case when A has sizes not necessarily equal. Worst case search algorithms for various types of arrays of finite dimension and sizes are reported. Each algorithm has order strictly less than the product of the sizes of the array. Present challenges and open problems in the area are also presented.


Author(s):  
Tomas Komarek ◽  
Jan Brabec ◽  
Cenek Skarda ◽  
Petr Somol

2021 ◽  
Author(s):  
Chong Lu ◽  
Shien Liu ◽  
Weihua Shi ◽  
Jun Yu ◽  
Zhou Zhou ◽  
...  

Chemical space exploration is a major task of the hit-finding process during the pursuit of novel chemical entities. Compared with other screening technologies, computational de novo design has become a popular approach to overcome the limitation of current chemical libraries. Here, we reported a de novo design platform named systemic evolutionary chemical space explorer (SECSE). The platform was conceptually inspired by fragment-based drug design, that miniaturized a “lego-building” process within the pocket of a certain target. The key of virtual hits generation was then turned into a computational search problem. To enhance search and optimization, human intelligence and deep learning were integrated. Application of SECSE against PHGDH, proved its potential in finding novel and diverse small molecules that are attractive starting points for further validation. This platform is open-sourced and the code is available at http://github.com/KeenThera/SECSE.


Sign in / Sign up

Export Citation Format

Share Document