A First Order Predicate Logic Formulation of the 3D Reconstruction Problem and its Solution Space

This paper defines the 3D reconstruction problem as the process of reconstructing a 3D scene from numerous 2D visual images of that scene. It is well known that this problem is ill-posed, and numerous constraints and assumptions are used in 3D reconstruction algorithms in order to reduce the solution space. Unfortunately, most constraints only work in a certain range of situations and often constraints are built into the most fundamental methods (e.g. Area Based Matching assumes that all the pixels in the window belong to the same object). This paper presents a novel formulation of the 3D reconstruction problem, using a voxel framework and first order logic equations, which does not contain any additional constraints or assumptions. Solving this formulation for a set of input images gives all the possible solutions for that set, rather than picking a solution that is deemed most likely. Using this formulation, this paper studies the problem of uniqueness in 3D reconstruction and how the solution space changes for different configurations of input images. It is found that it is not possible to guarantee a unique solution, no matter how many images are taken of the scene, their orientation or even how much color variation is in the scene itself. Results of using the formulation to reconstruct a few small voxel spaces are also presented. They show that the number of solutions is extremely large for even very small voxel spaces (5 x 5 voxel space gives 10 to 10(7) solutions). This shows the need for constraints to reduce the solution space to a reasonable size. Finally, it is noted that because of the discrete nature of the formulation, the solution space size can be easily calculated, making the formulation a useful tool to numerically evaluate the usefulness of any constraints that are added.

Point-by-point inscription of first-order fiber Bragg grating for C-band applications

The influence of the fiber geometry on the point-by-point inscription of fiber Bragg gratings using a femtosecond laser is highlighted. Fiber Bragg gratings with high spectral quality and strong first-order Bragg resonances within the C-band are achieved by optimizing the inscription process. Large birefringence (1.2×10-4) and high degree of polarizationdependent index modulation are observed in these gratings. Potential applications of these gratings in resonators are further illustrated.

Femtosecond inscription of the first order Bragg gratings in pure fused silica

The fabrication of sub-micron periodic structures beyond diffraction limit is a major motivation for the present paper. We describe the fabrication of the periodic structure of 25 mm long with a pitch size of 260 nm which is less than a third of the wavelength used. This is the smallest reported period of the periodic structure inscribed by direct point-by-point method. A prototype of the add-drop filter, which utilizes such gratings, was demonstrated in one stage fabrication process of femtosecond inscription, in the bulk fused silica.

Femtosecond inscription of the first order Bragg gratings in pure fused silica

The fabrication of sub-micron periodic structures beyond diffraction limit is a major motivation for the present paper. We describe the fabrication of the periodic structure of 25 mm long with a pitch size of 260 nm which is less than a third of the wavelength used. This is the smallest reported period of the periodic structure inscribed by direct point-by-point method. A prototype of the add-drop filter, which utilizes such gratings, was demonstrated in one stage fabrication process of femtosecond inscription, in the bulk fused silica.

Point-by-point inscription of first-order fiber Bragg grating for C-band applications

The influence of the fiber geometry on the point-by-point inscription of fiber Bragg gratings using a femtosecond laser is highlighted. Fiber Bragg gratings with high spectral quality and strong first-order Bragg resonances within the C-band are achieved by optimizing the inscription process. Large birefringence (1.2x10-4) and high degree of polarizationdependent index modulation are observed in these gratings. Potential applications of these gratings in resonators are further illustrated. © 2007 Optical Society of America.

First Order Characterizations of Pseudoconvex Functions

First order characterizations of pseudoconvex functions are investigated in terms of generalized directional derivatives. A connection with the invexity is analysed. Well-known first order characterizations of the solution sets of pseudolinear programs are generalized to the case of pseudoconvex programs. The concepts of pseudoconvexity and invexity do not depend on a single definition of the generalized directional derivative.

Existence and Uniqueness of Solutions for Partial Differential-Functional Equations of the First Order with Deviating Argument of the Derivative of Unknown Function

We consider the existence and uniqueness problem for partial differential-functional equations of the first order with the initial condition for which the right-hand side depends on the derivative of unknown function with deviating argument.

Sharp Bounds on the Number of Resonances for Symmertic Systems II. Non-Compactly Supported Perturbations

We extend the results in [5] to non-compactly supported perturbations for a class of symmetric first order systems.

Defining Network Activity Patterns Using First Order Temporal Logics

Part of network management is collecting information about the activities that go on around a distributed system and analyzing it in real time, at a deferred moment, or both. The reason such information may be stored in log files and analyzed later is to data-mine it so that interesting, unusual, or abnormal patterns can be discovered. In this paper we propose defining patterns in network activity logs using a dialect of First Order Temporal Logics (FOTL), called First Order Temporal Logic with Duration Constrains (FOTLDC). This logic is powerful enough to describe most network activity patterns because it can handle both causal and temporal correlations. Existing results for data-mining patterns with similar structure give us the confidence that discovering DFOTL patterns in network activity logs can be done efficiently.

Oscillation Criteria for First Order Delay Differential Equations

2000 Mathematics Subject Classification: 34K15.

First-Order Conditions for Optimization Problems with Quasiconvex Inequality Constraints

2000 Mathematics Subject Classification: 90C46, 90C26, 26B25, 49J52.

Quantum transition state theory and solving a first order master equation for complex reactions numerically

The field of chemical kinetics is an exciting and active field. The prevailing theories make a number of simplifying assumptions that do not always hold in actual cases. Another current problem concerns a development of efficient numerical algorithms for solving the master equations that arise in the description of complex reactions. The objective of the present work is to furnish a completely general and exact theory of reaction rates, in a form reminiscent of transition state theory, valid for all fluid phases and also to develop a computer program that can solve complex reactions by finding the concentrations of all participating substances as a function of time. To do so, the full quantum scattering theory is used for deriving the exact rate law, and then the resulting cumulative reaction probability is put into several equivalent forms that take into account all relativistic effects if applicable, including one that is strongly reminiscent of transition state theory, but includes corrections from scattering theory. Then two programs, one for solving complex reactions, the other for solving first order linear kinetic master equations to solve them, have been developed and tested for simple applications.

The Borel Complexity of Isomorphism for Some First Order Theories

In this work we consider several instances of the following problem: "how complicated can the isomorphism relation for countable models be?"' Using the Borel reducibility framework, we investigate this question with regard to the space of countable models of particular complete first-order theories. We also investigate to what extent this complexity is mirrored in the number of back-and-forth inequivalent models of the theory. We consider this question for two large and related classes of theories. First, we consider o-minimal theories, showing that if T is o-minimal, then the isomorphism relation is either Borel complete or Borel. Further, if it is Borel, we characterize exactly which values can occur, and when they occur. In all cases Borel completeness implies lambda-Borel completeness for all lambda. Second, we consider colored linear orders, which are (complete theories of) a linear order expanded by countably many unary predicates. We discover the same characterization as with o-minimal theories, taking the same values, with the exception that all finite values are possible except two. We characterize exactly when each possibility occurs, which is similar to the o-minimal case. Additionally, we extend Schirrman's theorem, showing that if the language is finite, then T is countably categorical or Borel complete. As before, in all cases Borel completeness implies lambda-Borel completeness for all lambda.