The search for high-temperature superconductors has been focused on compounds containing a large fraction of hydrogen, such as SiH4(H2)2, CaH6 and KH6. Through a systematic investigation of yttrium hydrides at different hydrogen contents using an structure prediction method based on the particle swarm optimization algorithm, we have predicted two new yttrium hydrides (YH4 andYH6), which are sta...

A simple probabilistic algorithm is presented to find the irreducible factors of a bivariate polynomial over a large finite field. For a polynomial f(x, y) over F of total degree n , our algorithm takes at most 4.89, 2 , n log n log q operations in F to factor f(x , y) completely. This improves a probabilistic factorization algorithm of von zur Gathen and Kaltofen, which takes 0(n log n log q) ...

Shastri proved[3] that every knot can be expressed as the image of a parametric function t 7→ (x(t), y(t), z(t)), where x, y, and z are polynomials in t. However, it is difficult based on his proof to actually find a polynomial knot of a given knot type. We present an algorithm for converting a piecewise linear parameterization of a knot into a polynomial parameterization of a knot of the same ...

Let X[0..n− 1] and Y [0..m− 1] be two sorted arrays, and define the m × n matrix A by A[j][i] = X[i] + Y [j]. Frederickson and Johnson [7] gave an efficient algorithm for selecting the kth smallest element from A. We show how to make this algorithm IO-efficient. Our cache-oblivious algorithm performs O((m + n)/B) IOs, where B is the block size of memory transfers.

A logical theory of regular double or multiple recurrence of eventualities, which are regular patterns of occurrences that are repeated, in time, has been developed within the context of temporal reasoning that enabled reasoning about the problem of coincidence. i.e. if two complex eventualities, or eventuality sequences consisting respectively of component eventualities x0, x1,....,xr and y0, ...

An algorithm for perfect simulation from the unique solution of the distributional fixed point equation Y =d UY +U(1−U) is constructed, where Y and U are independent and U is uniformly distributed on [0, 1]. This distribution comes up as a limit distribution in the probabilistic analysis of the Quickselect algorithm. Our simulation algorithm is based on coupling from the past with a multigamma ...

In this paper, we introduce a conceptually very simple and demonstrative algorithm for finding small solutions (x, y) of ax + y = c mod N , where gcd(a, N) = 1. Our new algorithm is a variant of the Euclidian algorithm. Unlike former methods, it finds a small solution whenever such a solution exists. Further it runs in time O((log N)), which is the same as the best known previous techniques, e....

We study the convergence properties of an alternating proximal minimization algorithm for nonconvex structured functions of the type: L(x, y) = f(x)+Q(x, y)+g(y), where f : R → R∪{+∞} and g : R → R∪{+∞} are proper lower semicontinuous functions, and Q : R × R → R is a smooth C function which couples the variables x and y. The algorithm can be viewed as a proximal regularization of the usual Gau...

y(t0) = y0 Here f(t, y) is a given function, t0 is a given initial time and y0 is a given initial value for y. The unknown in the problem is the function y(t). Two obvious considerations in deciding whether or not a given algorithm is of any practical value are (a) the amount of computational effort required to execute the algorithm and (b) the accuracy that this computational effort yields. Fo...

? x x = 2; if (y == 2) y = 2; effective slice{2,3} in forming correct unions of slices potential dependences must be taken into account only when the potential statement is executed in some other slice effective slicing algorithm a relevant slicing algorithm abstracted over a set, !, of potential statements: effective(P, ", !) effective(P, ", ∅) = full(P, ") effective(P, ", P) = relevant(P, ") ...