Searching a Polygonal Region by a Boundary Searcher

This paper considers the problem of planning the motion of a searcher in a polygonal region to eventually"see"an intruder that is unpredictable and capable of moving arbitrarily fast.A searcher is called the boundary searcher if he continuously moves on the polygon boundary and can see only along the rays of the flashlights he holds at a time. We present necessary and sufficient conditions for an n-sided polygon to be searchable by a boundary searcher.Based on our characterization,the equivalence of the ...     

Searching a Polygonal Region by Two Guards

We study the problem of searching for a mobile intruder in a polygonal region P by two guards. The objective is to decide whether there should exist a search schedule for the two guards to detect the intruder, no matter how fast the intruder moves, and if so, generate a search schedule. During the search, the two guards are required to walk on the boundary of P continuously and be mutually visible all the time. We present a characterization of the class of polygons searchable by two guards in terms of non-redundant components, and thus solve a long-standing open problem in computational geometry. Also, we give an optimal O(n) time algorithm to determine the two-guard searchability in a polygon, and an O(nlog n m) time algorithm to generate a search schedule, if it exists, where n is the number of vertices of P and m (≤n2) is the number of search instructions reported.     

Error bounds for complementarity problems with tridiagonal nonlinear functions

In this paper we consider the complementarity problem NCP(f) with f(x) = Mx + φ(x), where M ∈ R ^n×n is a real matrix and φ is a so-called tridiagonal (nonlinear) mapping. This problem occurs, for example, if certain classes of free boundary problems are discretized. We compute error bounds for approximations \({\hat x}\) to a solution x* of the discretized problems. The error bounds are improved by an iterative method and can be made arbitrarily small. The ideas are illustrated by numerical experiments.     

Accuracy of the Richardson Extrapolation Method in Eigenvalue Problems

The accuracy of the Richardson extrapolation method is investigated for the eigenvalue problem of linear elasticity theory with zero Dirichlet boundary conditions in a three-dimensional beam. O(h ⁴)-estimates of eigenvalue and eigenfunction vector errors are obtained with the constraint that the eigenfunction belongs to the space W ₂ ⁴ ().     

Implicit midpoint rule and extrapolation to singularly perturbed boundary alue problems

Linear singularly perturbed boundary value probleme εy″?py = f(x), y(0) = y(l) = 0 is solved numerically by reducing to the first order linear system and applying the implicit midpoint rule on equidistant meshes. Using the asymptotic expansion of the global error, the second order of convergence is improved by Richardson extrapolation when h ²≤ε. Some numerical examples are given in illustration of this theory.     

Using reproducing kernel for solving a class of singular weakly nonlinear boundary value problems

Cui et al. [M. Cui and F. Geng, Solving singular two point boundary value problems in reproducing kernel space, J. Comput. Appl. Math. 205 (2007), pp. 6–15; H. Yao and M. Cui, A new algorithm for a class of singular boundary value problems, Appl. Math. Comput. 186 (2007), pp. 1183–1191] presents an algorithm to solve a class of singular linear boundary value problems in the reproducing kernel space. In this paper, we will present three new algorithms to solve a class of singular weakly nonlinear boundary value problems in reproducing kernel space. The algorithms are efficiently applied to solving some model problems. It is demonstrated by the numerical examples that those algorithms are highly accurate.     

On Parabolic Boundary Layers for Convection–Diffusion Equations in a Channel: Analysis and Numerical Applications

In this article we discuss singularly perturbed convection–diffusion equations in a channel in cases producing parabolic boundary layers. It has been shown that one can improve the numerical resolution of singularly perturbed problems involving boundary layers, by incorporating the structure of the boundary layers into the finite element spaces, when this structure is available; see e.g. [Cheng, W. and Temam, R. (2002). Comput. Fluid. V.31, 453–466; Jung, C. (2005). Numer. Meth. Partial Differ. Eq. V.21, 623–648]. This approach is developed in this article for a convection–diffusion equation. Using an analytical approach, we first derive an approximate (simplified) form of the parabolic boundary layers (elements) for our problem; we then develop new numerical schemes using these boundary layer elements. The results are performed for the perturbation parameter ε in the range 10⁻¹–10⁻¹⁵ whereas the discretization mesh is in the range of order 1/10–1/100 in the x-direction and of order 1/10–1/30 in the y-direction. Indications on various extensions of this work are briefly described at the end of the Introduction.Dedicated to David Gottlieb on his 60th birthday.     

一类可分离SAT问题的O(1.890n)精确算法

布尔可满足性问题（SAT）是指对于给定的布尔公式,是否存在一个可满足的真值指派.这是第1个被证明的NP完全问题,一般认为不存在多项式时间算法,除非P=NP.学者们大都研究了子句长度不超过k的SAT问题（k-SAT）,从全局搜索到局部搜索,给出了大量的相对有效算法,包括随机算法和确定算法.目前,最好算法的时间复杂度不超过O（（2-2/k）ⁿ）,当k=3时,最好算法时间复杂度为O（1.308ⁿ）.而对于更一般的与子句长度k无关的SAT问题,很少有文献涉及.引入了一类可分离SAT问题,即3-正则可分离可满足性问题（3-RSSAT）,证明了3-RSSAT是NP完全问题,给出了一般SAT问题3-正则可分离性的O（1.890ⁿ）判定算法.然后,利用矩阵相乘算法的研究成果,给出了3-RSSAT问题的O（1.890ⁿ）精确算法,该算法与子句长度无关.     

The Approximation and Computation of a Basis of the Trace Space <Emphasis Type="Italic">H</Emphasis><Superscript>1/2</Superscript>

We present a method for construction of an approximate basis of the trace space H ^1/2 based on a combination of the Steklov spectral method and a finite element approximation. Specifically, we approximate the Steklov eigenfunctions with respect to a particular finite element basis. Then solutions of elliptic boundary value problems with Dirichlet boundary conditions can be efficiently and accurately expanded in the discrete Steklov basis. We provide a reformulation of the discrete Steklov eigenproblem as a generalized eigenproblem that we solve by the implicitly restarted Arnoldi method of ARPACK. We include examples highlighting the computational properties of the proposed method for the solution of elliptic problems on bounded domains using both a conforming bilinear finite element and a non-conforming harmonic finite element. In addition, we document the efficiency of the proposed method by solving a Dirichlet problem for the Laplace equation on a densely perforated domain.     

Accuracy of the difference scheme of solving the eigenvalue problem for the Laplacian

The finite-difference approximation of the eigenvalue problem with the Dirichlet boundary conditions for the Laplacian in a two-dimensional domain of complex form is analyzed for accuracy and the error of eigenfunctions from the class W₂²( W) W_2^2\left( \Omega \right) in the mesh norm of W₂¹( w) W_2^1\left( \omega \right) is estimated.     

An efficient top-down search algorithm for learning Boolean networks of gene expression

Boolean networks provide a simple and intuitive model for gene regulatory networks, but a critical defect is the time required to learn the networks. In recent years, efficient network search algorithms have been developed for a noise-free case and for a limited function class. In general, the conventional algorithm has the high time complexity of O(2^{2k mn k+1}) where m is the number of measurements, n is the number of nodes (genes), and k is the number of input parents. Here, we suggest a simple and new approach to Boolean networks, and provide a randomized network search algorithm with average time complexity O ^{(mn k+1}/ (log m)^(k−1)). We show the efficiency of our algorithm via computational experiments, and present optimal parameters. Additionally, we provide tests for yeast expression data. Editor: David Page     

Subcubic Cost Algorithms for the All Pairs Shortest Path Problem

In this paper we give three subcubic cost algorithms for the all pairs shortest distance (APSD) and path (APSP) problems. The first is a parallel algorithm that solves the APSD problem for a directed graph with unit edge costs in O(log ² n) time with processors where μ = 2.688 on an EREW PRAM. The second parallel algorithm solves the APSP, and consequently APSD, problem for a directed graph with nonnegative general costs (real numbers) in O(log ² n) time with o(n ³ ) subcubic cost. Previously this cost was greater than O(n ³ ) . Finally we improve with respect to M the complexity O((Mn) ^μ ) of a sequential algorithm for a graph with edge costs up to M to O(M ^1/3 n ^(6+ω)/3 (log n) ^2/3 (log log n) ^1/3 ) in the APSD problem, where ω = 2.376 . Received October 15, 1995; revised June 21, 1996.     

背包类问题的并行O(25n/6)时间-空间-处理机折衷

将串行动态二表算法应用于并行三表算法的设计中,提出一种求解背包、精确的可满足性和集覆盖等背包类NP完全问题的并行三表六子表算法.基于EREW-PRAM模型,该算法可使用O(2^n/8)的处理机在O(2^7n/16)的时间和O(2^13n/48)的空间求解n维背包类问题,其时间-空间-处理机折衷为O(2^5n/6).与现有文献的性能对比分析表明,该算法极大地提高了并行求解背包类问题的时间-空间-处理机折衷性能.由于该算法能够破解更高维数的背包类公钥和数字水印系统,其结论在密钥分析领域具有一定的理论和实际意义.     

Complexities of efficient solutions of rectilinear polygon cover problems

The rectilinear polygon cover problem is one in which a certain class of features of a rectilinear polygon ofn vertices has to be covered with the minimum number of rectangles included in the polygon. In particular, we consider covering the entire interior, the boundary, and the set of corners of the polygon. These problems have important applications in storing images and in the manufacture of integrated circuits. Unfortunately, most of these problems are known to be NP-complete. Hence it is necessary to develop efficient heuristics for these problems or to show that the design of efficient heuristics is impossible. In this paper we show:

Stabilization of a Heat‐ODE System Cascaded at a Boundary Point and an Intermediate Point

This paper considers the stabilization of a heat‐ODE system cascaded at a boundary point and an intermediate point. The stabilizing feedback control law is designed by the backstepping method. Based on a novel transformation, we prove that all the kernel functions in the forward and inverse transformations are of the class C². Moreover, the effectiveness of controller design is shown with a numerical simulation. Finally, we show the coherence between the controllability assumption of the main theorem in this paper and the known one for a special case with λ=0.