Determining visibility in planar polygons and arrangements is an important subroutine for many algorithms in computational geometry. In this paper, we report on new implementations, and corresponding experimental evaluations, for two established and one novel algorithm for computing visibility polygons. These algorithms will be released to the public shortly, as a new package for the Computatio...

addresses used in the electronic interface are not available , the address buffering and decoding logic (figure 4) must be modified to decode an available memory address. The hardcopy of the date line 599-600 (BASIC program, table 3) will have to be modified to correspond to the syntax of the computer. For graphical output a printer-specific subroutine will have to be written.

Our main goal in this paper is to give molecular solutions for two NP–complete problems, namely Subset-sum and Knapsack, in a sticker based model for DNA computations. In order to achieve this, we have used a finite set sorting subroutine together with the description of a procedure to formally verify the designed programs through the labeling of test tubes using inductive techniques.

The Monte Carlo code MCNPX has been utilized to calculate the effective delayed neutron fraction and reactivity by using the area-ratio method. The effective delayed neutron fraction eff has been calculated with the fission probability method proposed by Meulekamp and van der Marck. MCNPX was used to calculate separately the fission probability of the delayed and the prompt neutrons by using th...

The Harrow-Hassidim-Lloyd quantum algorithm was proposed to solve linear systems of equations $A\vec{x} = \vec{b}$ and it is the core various applications. However, there not an explicit circuit for subroutine which maps inverse problem matrix $A$ into ancillary qubit. This makes challenging implementation in current devices, forcing us use hybrid approaches. Here, we propose a systematic manne...

In this thesis I present a new algorithm OPT for matrix inversion that builds on a matrix multiplication subroutine. It is combined of Strassen’s matrix inversion algorithm and Newton approximation. OPT overcomes the linear lower bound in parallel runtime of Strassen’s inversion algorithm and traditional Gaussian elimination without the log-factor more work of Newton approximation. In particula...

This work is part of a joint project of ANU and Fujitsu Ltd. Japan for the development of vector and parallel numerical algorithms and software. The results will be included in the Fujitsu Scientiic Subroutine Library. Coding and testing is done in cooperation with

Simultaneous matrix diagonalization is used as a subroutine in many machine learning problems, including blind source separation and paramater estimation in latent variable models. Here, we extend algorithms for performing joint diagonalization to low-rank and asymmetric matrices, and we also provide extensions to the perturbation analysis of these methods. Our results allow joint diagonalizati...

A submodular polyhedron is a polyhedron associated with a submodular function. This paper presents a strongly polynomial time algorithm for line search in submodular polyhedra with the aid of a fully combinatorial algorithm for submodular function minimization as a subroutine. The algorithm is based on the parametric search method proposed by Megiddo.

The conjugate gradient (CG) method is an efficient iterative method for solving large-scale strongly convex quadratic programming (QP). In this paper we propose some generalized CG (GCG) methods for solving the l1-regularized (possibly not strongly) convex QP that terminate at an optimal solution in a finite number of iterations. At each iteration, our methods first identify a face of an orthan...