相关论文: A Light-Based Device for Solving the Hamiltonian P…

Quantification of microscopy time-series of in vitro reconstituted motor driven microtubule (MT) transport in 'gliding assays' is typically performed using computational object tracking tools. However, these are limited to non-intersecting…

Graph isomorphism is an important computer science problem. The problem for the general case is unknown to be in polynomial time. The base algorithm for the general case works in quasi-polynomial time. The solutions in polynomial time for…

Quantum walks provide a natural framework to approach graph problems with quantum computers, exhibiting speedups over their classical counterparts for tasks such as the search for marked nodes or the prediction of missing links.…

This paper investigated the problem of embedding a simple Hamiltonian Cycle with n vertices on n points inside a simple polygon. This problem seeks to embed a straight-line cycle (without bends), which does not intersect either itself or…

In the paper we present a low cost optical device which splits the light in the focal plane into two separate optical paths and collimates it back into a single image plane, and where a selective information processing ca be carried out.…

We attempt to see how closely we can formally obtain the planetary and light path equations of General Relativity by employing certain operations on the familiar Newtonian equation. This article is intended neither as an alternative to nor…

Modern computer vision algorithms have brought significant advancement to 3D geometry reconstruction. However, illumination and material reconstruction remain less studied, with current approaches assuming very simplified models for…

This article proposes a novel approach for determining exact solutions to nonlinear ordinary differential equations. The recommended iterative method provides the solution via a rapidly converging series that readily approaches a closed…

This paper proposes a novel approach to Hamiltonian simulation using Decision Diagrams (DDs), which are an exact representation based on exploiting redundancies in representations of quantum states and operations. While the simulation of…

Given a graph and a pair of terminals $s$, $t$, the next-to-shortest path problem asks for an $s\!\to \!t$ (simple) path that is shortest among all not shortest $s\!\to \!t$ paths (if one exists). This problem was introduced in 1996, and…

We propose a numerical method for approximate calculations of the time evolution of point particle systems given only the system's Hamiltonian function and initial conditions. The method both generates and solves the equations of motion…

This paper is concerned with the study of a model case of first order Hamilton-Jacobi equations posed on a "junction", that is to say the union of a finite number of half-lines with a unique common point. The main result is a comparison…

An optical method for precise purification of chemical elements is introduced in this paper. The materials are supposed to be in the states of gaseous beams, which are coherently coupled to an external traveling light during purification.…

For more than twenty years, Ray Tracing methods have continued to improve on both accuracy and computational time aspects. However, most state-of-the-art image-based ray tracers still rely on a description of the environment that only…

In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, but solvable in linear time on this type of graphs. The…

Fundamental theories, such as Quantum Electrodynamics (QED) and Quantum Chromodynamics (QCD) promise great predictive power addressing phenomena over vast scales from the microscopic to cosmic scales. However, new non-perturbative tools are…

We propose a new approach to circumvent the sign problem in which the integration path is optimized to control the sign problem. We give a trial function specifying the integration path in the complex plane and tune it to optimize the cost…

Computational color constancy refers to the problem of computing the illuminant color so that the images of a scene under varying illumination can be normalized to an image under the canonical illumination. In this paper, we adopt a deep…

In this paper, we propose a graph classification approach for automatically determining whether to use a monolithic or a decomposition-based solution method. In this approach, an optimization problem is represented as a graph that captures…

We propose to determine the bifurcation diagrams of fixed points using their coordinates as control parameters. This method can lead to exact solutions to otherwise intractable bifurcation problems.