Given a target binary function, the code search retrieves top-K similar functions in repository, and represent that they are compiled from same source codes. Searching is particularly challenging due to large variations of compiler tool-chains options CPU architectures, as well thousands Furthermore, there some pivotal issues current schemes, including inaccurate text-based or token-based analy...

We report 272 radial velocities for 19 RR Lyrae variables. For most of the stars we have complete pulsation cycle. These data are used to determine robust center--of--mass that been compared values from literature in a search evidence binary systems. Center--of--mass were determined each star using Fourier Series and Template fits velocities. Our uncertainties $\pm0.16$ km s$^{-1}$ $\pm$2.5 s$^...

Grayscale halftoning is the technique of approximating a grayscale image by a black-and-white image. Black-and-white printers use halftoning to replicate grayscale images on paper. The printers have only the black of ink and the white of paper as the colors at their disposal. Although the printers may vary the size of dots they drop, they cannot vary the intensity of the droplets. All droplets ...

The purpose of this paper is to settle two conjectures by Flajolet, Gourdon and Martinez ( 1996). We confirm that in a random binary tree on n nodes, the expected number of different subtrees grows indeed as 0 (n/ log n). Secondly, if K is the largest integer such that all possible shapes of subtrees of cardinality less than or equal to K occur in a random binary search tree, then we show that ...

We study the following problem: given a set of keys and access probabilities, find a minimum-cost binary search tree that uses only 2-way comparisons (=, <,≤) at each node. We give the first polynomialtime algorithm when both successful and unsuccessful queries are allowed, settling a long-standing open question. Our algorithm relies on a new structural theorem that proves a conjecture of Spule...

We study the following problem: given a set of keys and access probabilities, find a minimum-cost binary search tree that uses only 2-way comparisons (=, <,≤) at each node. We give the first polynomialtime algorithm when both successful and unsuccessful queries are allowed, settling a long-standing open question. Our algorithm relies on a new structural theorem that proves a conjecture of Spule...

For the random binary search tree with n nodes inserted the number of ancestors of the elements with ranks k and `, 1 ≤ k < ` ≤ n, as well as the path distance between these elements in the tree are considered. For both quantities central limit theorems for appropriately rescaled versions are derived. For the path distance the condition ` − k → ∞ as n → ∞ is required. We obtain tail bounds and ...

In this paper we propose a Local Search approach for NPHard problems expressed as binary programs. Our search method focuses on the fast production of feasible solutions. The method explicitly considers the structure of the problem as a conflict graph and uses a systematic neighbor generation procedure to jump from one feasible solution to another using chains of movements. Computational experi...