This paper presents an attempt to construct a ”practical” CSP algorithm that assigns a variable with 2 values at every step. Such a strategy has been successfully used for construction of ”theoretical” constraint solvers because it decreases twice the base of the exponent of the upper bound of the search algorithm. We present a solver based on the strategy. The pruning mechanism of the algorith...

An unsteady two-dimensional finite-volume solver was developed based on Van Leer’s flux splitting algorithm in conjunction with “Monotonic Upstream Scheme for Conservation Laws (MUSCL)” limiters to improve the order of accuracy and the two-layer Baldwin-Lomax turbulence model was also implemented. Two test cases were prepared to validate the solver. The computed results were compared with the e...

We study the reachability problem for systems implemented as feed-forward neural networks whose activation function is implemented via ReLU functions. We draw a correspondence between establishing whether some arbitrary output can ever be outputed by a neural system and linear problems characterising a neural system of interest. We present a methodology to solve cases of practical interest by m...

A direct imaging algorithm for point and extended targets is presented. The algorithm is based on a physical factorization of the response matrix of a transducer array. The factorization is used to transform a passive target problem to an active source problem and to extract principal components (tones) in a phase consistent way. The multitone imaging function can superpose multiple tones (spat...

We present a direct imaging algorithm for extended targets. The algorithm is based on a physical factorization of the response matrix of a transducer array and the Multi-Signal Classification (MUSIC) imaging function is used to visualize the results. A resolution and noise level based thresholding strategy is developed for regularization. The algorithm is simple and efficient since no forward s...

We present a high-level approach to array bound check optimization that is neither hampered by recursive functions, nor disabled by the presence of partially redundant checks. Our approach combines a forward analysis to infer precise contextual constraint at designated program points, and a backward method for deriving a safety pre-condition for each bound check. Both analyses are formulated wi...

We study an example due to Wooldridge of a small robotic agent that will vacuum clean a room. The room is an n × n grid and at any point the robot can move forward one step or turn right 90 degrees. The problem is to find a deterministic strategy for the robot in which (1) its next action only depends on its current square and orientation (one of north, west, south, east), and (2) all squares a...

The runsolver tool was designed for the 2005 edition of the pseudo-Boolean competition in order to solve the problem of correctly measuring the resources used by solvers, especially solvers with multiple processes. Since then, it has been improved in several directions and adopted by several other competitions or frameworks. This paper presents the inner working of this tool and the technical p...