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.

Analytical first order comparison of amplitude and phase noise in single and dual Mach-Zehnder interferometer detection schemes for DQPSK transmission systems

An analytical first order calculation of the impact of Gaussian white noise on a novel single Mach-Zehnder Interferometer demodulation scheme for DQPSK reveals a constant Q factor ratio to the conventional scheme.

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 optical differentiator based on an FBG in transmission

Optical differentiators constitute a basic device for analog all-optical signal processing [1]. Fiber grating approaches, both fiber Bragg grating (FBG) and long period grating (LPG), constitute an attractive solution because of their low cost, low insertion losses, and full compatibility with fiber optic systems. A first order differentiator LPG approach was proposed and demonstrated in [2], but FBGs may be preferred in applications with a bandwidth up to few nm because of the extreme sensitivity of LPGs to environmental fluctuations [3]. Several FBG approaches have been proposed in [3-6], requiring one or more additional optical elements to create a first-order differentiator. A very simple, single optical element FBG approach was proposed in [7] for first order differentiation, applying the well-known logarithmic Hilbert transform relation of the amplitude and phase of an FBG in transmission [8]. Using this relationship in the design process, it was theoretically and numerically demonstrated that a single FBG in transmission can be designed to simultaneously approach the amplitude and phase of a first-order differentiator spectral response, without need of any additional elements. © 2013 IEEE.

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.

Representing "Recursive" Default Logic in Modal Logic

The "recursive" definition of Default Logic is shown to be representable in a monotonic Modal Quantificational Logic whose modal laws are stronger than S5. Specifically, it is proven that a set of sentences of First Order Logic is a fixed-point of the "recursive" fixed-point equation of Default Logic with an initial set of axioms and defaults if and only if the meaning of the fixed-point is logically equivalent to a particular modal functor of the meanings of that initial set of sentences and of the sentences in those defaults. This is important because the modal representation allows the use of powerful automatic deduction systems for Modal Logic and because unlike the original "recursive" definition of Default Logic, it is easily generalized to the case where quantified variables may be shared across the scope of the components of the defaults.

On the Relationships Among Quantified Autoepistemic Logic, its Kernel, and Quantified Reflective Logic

A Quantified Autoepistemic Logic is axiomatized in a monotonic Modal Quantificational Logic whose modal laws are slightly stronger than S5. This Quantified Autoepistemic Logic obeys all the laws of First Order Logic and its L predicate obeys the laws of S5 Modal Logic in every fixed-point. It is proven that this Logic has a kernel not containing L such that L holds for a sentence if and only if that sentence is in the kernel. This result is important because it shows that L is superfluous thereby allowing the ori ginal equivalence to be simplified by eliminating L from it. It is also shown that the Kernel of Quantified Autoepistemic Logic is a generalization of Quantified Reflective Logic, which coincides with it in the propositional case.

Representing Reflective Logic in Modal Logic

The nonmonotonic logic called Reflective Logic is shown to be representable in a monotonic Modal Quantificational Logic whose modal laws are stronger than S5. Specifically, it is proven that a set of sentences of First Order Logic is a fixed-point of the fixed-point equation of Reflective Logic with an initial set of axioms and defaults if and only if the meaning of that set of sentences is logically equivalent to a particular modal functor of the meanings of that initial set of sentences and of the sentences in those defaults. This result is important because the modal representation allows the use of powerful automatic deduction systems for Modal Logic and because unlike the original Reflective Logic, it is easily generalized to the case where quantified variables may be shared across the scope of the components of the defaults thus allowing such defaults to produce quantified consequences. Furthermore, this generalization properly treats such quantifiers since all the laws of First Order Logic hold and since both the Barcan Formula and its converse hold.

Representing Default Logic in Modal Logic

The nonmonotonic logic called Default Logic is shown to be representable in a monotonic Modal Quantificational Logic whose modal laws are stronger than S5. Specifically, it is proven that a set of sentences of First Order Logic is a fixed-point of the fixed-point equation of Default Logic with an initial set of axioms and defaults if and only if the meaning or rather disquotation of that set of sentences is logically equivalent to a particular modal functor of the meanings of that initial set of sentences and of the sentences in those defaults. This result is important because the modal representation allows the use of powerful automatic deduction systems for Modal Logic and because unlike the original Default Logic, it is easily generalized to the case where quantified variables may be shared across the scope of the components of the defaults thus allowing such defaults to produce quantified consequences. Furthermore, this generalization properly treats such quantifiers since both the Barcan Formula and its converse hold.

Representing Autoepistemic Logic in Modal Logic

The nonmonotonic logic called Autoepistemic Logic is shown to be representable in a monotonic Modal Quantificational Logic whose modal laws are stronger than S5. Specifically, it is proven that a set of sentences of First Order Logic is a fixed-point of the fixed-point equation of Autoepistemic Logic with an initial set of axioms if and only if the meaning or rather disquotation of that set of sentences is logically equivalent to a particular modal functor of the meaning of that initial set of sentences. This result is important because the modal representation allows the use of powerful automatic deduction systems for Modal Logic and unlike the original Autoepistemic Logic, it is easily generalized to the case where quantified variables may be shared across the scope of modal expressions thus allowing the derivation of quantified consequences. Furthermore, this generalization properly treats such quantifiers since both the Barcan formula and its converse hold.

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.