An exact, linear solution to the problem of imaging through turbulence

We show how, in principle, to solve the ‘blind deconvolution' problem. This is in the context of the problem of imaging through atmospheric turbulence. The approach is digital but not iterative, and requires as input data but two short-exposure intensity images, without the need for reference point sources. By taking the Fourier transform of each image and dividing, a set of linear equations is generated whose unknowns are sampled values of the two random point spread functions that degraded the images. An oversampling by 50% in Fourier space equalizes the number of unknowns and independent equations. With some prior knowledge of spread function support, and in the absence of added noise of image detection, the inverted equations give exact solutions. The two observed images are then inverse filtered to reconstruct the object.     

Zigzag inequalities: a new class of facet-inducing inequalities for Arc Routing Problems

In this paper we introduce a new class of facet-inducing inequalities for the Windy Rural Postman Problem and the Windy General Routing Problem. These inequalities are called Zigzag inequalities because they cut off fractional solutions containing a zigzag associated with variables with 0.5 value. Two different types of inequalities, the Odd Zigzag and the Even Zigzag inequalities, are presented. Finally, their application to other known Arc Routing Problems is discussed.     

On pedigree polytopes and Hamiltonian cycles

In this paper we define a combinatorial object called a pedigree, and study the corresponding polytope, called the pedigree polytope. Pedigrees are in one-to-one correspondence with the Hamiltonian cycles on K_n. Interestingly, the pedigree polytope seems to differ from the standard tour polytope, Q_n with respect to the complexity of testing whether two given vertices of the polytope are nonadjacent. A polynomial time algorithm is given for nonadjacency testing in the pedigree polytope, whereas the corresponding problem is known to be NP-complete for Q_n. We also discuss some properties of the pedigree polytope and illustrate with examples.     

Remarks on Barbashin-Ezeilo Problem on third-order nonlinear differential equations

In this paper, we use the frequency domain criteria to initiate a general result on the Barbashin-Ezeilo Problem on third-order nonlinear differential equation. Earlier ideas of Burkin [I.M. Burkin, Orbital stability of second-kind limiting cycles for dynamical systems with cylindrical phase space, Differential Equations 29 (1993) 1262-1264], Leonov [G.A. Leonov, A frequency criterion for the existence of limit cycles of dynamical systems with cylindrical phase spaces, Differential Equations 23 (1987) 1375-1378] on the problem are being improved upon.     

Focusing of electromagnetic waves into a uniaxial crystal

We derive integral representations suitable for studying the focusing of electromagnetic waves through a plane interface into a uniaxial crystal. To that end we start from existing exact solutions for the transmitted fields due to an arbitrary three-dimensional (3D) wave that is incident upon a plane interface separating two uniaxial crystals with arbitrary orientation of the optical axis in each medium. Then we specialize to the case in which the medium of the incident wave is isotropic and derive explicit expressions for the dyadic Green's functions associated with the transmitted fields as well as integral representations suitable for asymptotic analysis and efficient numerical evaluation. Relevant integral representations for focused 3D electromagnetic waves are also given. Next we consider the special case in which (i) the incident field is a two-dimensional (2D) TM wave and (ii) the optical axis in the crystal lies in the plane of incidence, implying that we have a 2D vectorial problem, and derive dyadic Green's functions, integral representations suitable for asymptotic and numerical treatment, and integral representations for focused TM fields. Numerical results for focused 2D TM fields based on these integral representations as well as corresponding experimental results will be presented in forthcoming papers.     

Exploring college students’ mental representations of inferential statistics

We report a case study that explored how three college students mentally represented the knowledge they held of inferential statistics, how this knowledge was connected, and how it was applied in two problem solving situations. A concept map task and two problem categorization tasks were used along with interviews to gather the data. We found that the students’ representations were based on incomplete statistical understanding. Although they grasped various concepts and inferential tests, the students rarely linked key concepts together or to tests nor did they accurately apply that knowledge to categorize word problems. We suggest that one reason the students had difficulty applying their knowledge is that it was not sufficiently integrated. In addition, we found that varying the instruction for the categorization task elicited different mental representations. One instruction was particularly effective in revealing students’ partial understandings. This finding suggests that modifying the task format as we have done could be a useful diagnostic tool.     

求解stokes问题的一个新的非协调混合元格式

构造一个新的非协调混合元格式求解stokes问题,证明了该元满足B-B条件,并且有2阶收敛速度.     

The effect of structural branching on the efficiency of clause learning SAT solving: An experimental study

The techniques for making decisions (branching) play a central role in complete methods for solving structured instances of propositional satisfiability (SAT). Experimental case studies in specific problem domains have shown that in some cases SAT solvers can determine satisfiability faster if branching in the solver is restricted to a subset of the variables at hand. The underlying idea in these approaches is to prune the search space substantially by restricting branching to strong backdoor sets of variables which guarantee completeness of the search. In this paper we present an extensive experimental evaluation of the effects of structure-based branching restrictions on the efficiency of solving structural SAT instances. Previous work is extended in a number of ways. We study state-of-the-art solver techniques, including clause learning and related heuristics. We provide a thorough analysis of the effect of branching restrictions on the inner workings of the solver, going deeper than merely measuring the solution time. Extending previous studies which have focused on input-restricted branching, we also consider relaxed branching restrictions that are based on underlying structural properties of the variables.     

关于奇性两点狄利克雷问题

本文研究奇性两点狄利克雷问题，在ｆ（ｔ，ｘ，ｙ）≤α（ｔ）ｇ（ｘ）＋β（ｔ）ｈ（ｘ）｜ｙ｜ε，０＜ε≤２情形下，得到了解的存在性定理，推广了Ｔｉｎｅｏ（１９９２）的结果．     

A polynomial algorithm for the max-cut problem on graphs without long odd cycles

Given a graphG=[V, E] with positive edge weights, the max-cut problem is to find a cut inG such that the sum of the weights of the edges of this cut is as large as possible. Letg(K) be the class of graphs whose longest odd cycle is not longer than2K+1, whereK is a nonnegative integer independent of the numbern of nodes ofG. We present an O(n ^4K) algorithm for the max-cut problem for graphs ing(K). The algorithm is recursive and is based on some properties of longest and longest odd cycles of graphs. This research was supported by National Science Foundation Grant ECS-8005350 to Cornell University.