Analysis of optical Kerr effect on effective core area and index of refraction in single-mode dispersion shifted and dispersion flattened fibers

A new technique is presented for computing very useful propagation parameters like effective core area and effective index of refraction of mono-mode dispersion shifted and dispersion flattened fibers both in the presence and in the absence of Kerr nonlinearity. The technique involves application of accurate but simple expressions for modal fields developed by Chebyshev formalism. The study of the influence of Kerr nonlinearity on the aforementioned parameters, however, requires the application of the method of iteration. For the purpose of such investigation, in linear as well as nonlinear region, we take some typically used dispersion shifted and dispersion flattened fibers and we show that the results found by our simple formalism are in excellent agreement with those obtained by using complex finite element method. Further, the necessary evaluation by our simple method needs very less computations. Thus, our formalism generates ample opportunity for applications in many areas in the field of nonlinear optics.

Generic Ownership: a Practical Approach to Ownership and Confinement in Object-Oriented Programming Languages

<p>Modern object-oriented programming languages support many techniques that simplify the work of a programmer. Among them is generic types: the ability to create generic descriptions of algorithms and object structures that will be automatically specialised by supplying the type information when they are used. At the same time, object-oriented technologies still suffer from aliasing: the case of many objects in a program's memory referring to the same object via different references. Ownership types enforce encapsulation in object-oriented programs by ensuring that objects cannot be referred to from the outside of the object(s) that own them. Existing ownership programming languages either do not support generic types or attempt to add them on top of ownership restrictions. The goal of this work is to bring object ownership into mainstream object-oriented programming languages. This thesis presents Generic Ownership which provides perobject ownership on top of a generic imperative language. Surprisingly, the resulting system not only provides ownership guarantees comparable to the established systems, but also requires few additional language mechanisms to achieve them due to full reuse of generic types. In this thesis I formalise the core of Generic Ownership, highlighting that the restriction of this calls, owner preservation over subtyping, and appropriate owner nesting are the only necessary requirements for ownership. I describe two formalisms: (1) a simple formalism, capturing confinement in a functional setting, and (2) a complete formalism, providing a way for Generic Ownership to support both deep and shallow variations of ownership types. I support the formal work by describing how the Ownership Generic Java (OGJ) language is implemented as a minimal extension to Java 5. OGJ is the first publicly available language implementation that supports ownership, confinement, and generic types at the same time. I demonstrate OGJ in practice: show how to use OGJ to write programs and provide insights into the implementations of Generic Ownership.</p>

Generic Ownership: a Practical Approach to Ownership and Confinement in Object-Oriented Programming Languages

<p>Modern object-oriented programming languages support many techniques that simplify the work of a programmer. Among them is generic types: the ability to create generic descriptions of algorithms and object structures that will be automatically specialised by supplying the type information when they are used. At the same time, object-oriented technologies still suffer from aliasing: the case of many objects in a program's memory referring to the same object via different references. Ownership types enforce encapsulation in object-oriented programs by ensuring that objects cannot be referred to from the outside of the object(s) that own them. Existing ownership programming languages either do not support generic types or attempt to add them on top of ownership restrictions. The goal of this work is to bring object ownership into mainstream object-oriented programming languages. This thesis presents Generic Ownership which provides perobject ownership on top of a generic imperative language. Surprisingly, the resulting system not only provides ownership guarantees comparable to the established systems, but also requires few additional language mechanisms to achieve them due to full reuse of generic types. In this thesis I formalise the core of Generic Ownership, highlighting that the restriction of this calls, owner preservation over subtyping, and appropriate owner nesting are the only necessary requirements for ownership. I describe two formalisms: (1) a simple formalism, capturing confinement in a functional setting, and (2) a complete formalism, providing a way for Generic Ownership to support both deep and shallow variations of ownership types. I support the formal work by describing how the Ownership Generic Java (OGJ) language is implemented as a minimal extension to Java 5. OGJ is the first publicly available language implementation that supports ownership, confinement, and generic types at the same time. I demonstrate OGJ in practice: show how to use OGJ to write programs and provide insights into the implementations of Generic Ownership.</p>

Planning with Incomplete Information in Quantified Answer Set Programming

We present a general approach to planning with incomplete information in Answer Set Programming (ASP). More precisely, we consider the problems of conformant and conditional planning with sensing actions and assumptions. We represent planning problems using a simple formalism where logic programs describe the transition function between states, the initial states and the goal states. For solving planning problems, we use Quantified Answer Set Programming (QASP), an extension of ASP with existential and universal quantifiers over atoms that is analogous to Quantified Boolean Formulas (QBFs). We define the language of quantified logic programs and use it to represent the solutions different variants of conformant and conditional planning. On the practical side, we present a translation-based QASP solver that converts quantified logic programs into QBFs and then executes a QBF solver, and we evaluate experimentally the approach on conformant and conditional planning benchmarks.

Modelling and Planning Evolution Styles in Software Architecture

The purpose of this study is to find the right model to plan and predict future evolution paths of an evolving software architecture based on past evolution data. Thus, in this paper, a model to represent the software architecture evolution process is defined. In order to collect evolution data, a simple formalism allowing to easily express software architecture evolution data is introduced. The sequential pattern extraction technique is applied to the collected evolution styles of an evolving software architecture in order to predict and plan the future evolution paths. A learning and prediction model is defined to generate the software architecture possible future evolution paths. A method for evaluating the generated paths is presented. In addition, we explain and validate our approach through a study on two examples of evolution of component-oriented software architecture.

Prediction of First Higher Order Modal Field for Graded Index Fiber in Presence of Kerr Nonlinearity

We report evaluation of first higher order modal field for dual mode optical fiber having step and parabolic index profiles. The study is carried out both in absence as well as in presence of Kerr nonlinearity. The analysis is based on a simple iterative method involving Chebyshev formalism. Taking some typical step- and parabolic-index fibers as examples, we show that our results agree excellently with the exact results which can be obtained by applying rigorous methods. Thus, our simple formalism stands the merit of being considered as an accurate alternative to the existing cumbersome methods. The prescribed formalism provides scope for accurate estimation of different propagation parameters associated with first higher order mode in such kinds of fibers in presence of Kerr nonlinearity. The execution of formalism being user friendly, it will be beneficial to the system engineers working in the field of optical technology.

A simple formalism Artificial intelligence-based to represent knowledge in a multi-agent planning context

At the start of the simulation, the agent knows nothing about how the dynamics of interaction with the environment unfold, or what causes his sensations. He does not distinguish obstacles from free paths, and he does not know the consequences implied by his actions. Under these conditions, the CALM mechanism was able to converge steadily towards the expected solution, by building a model of the world adequate to represent the regularities of the environment, the regularities of its bodily sensations, as well as to represent the influence regular actions on both. The agent learns about the consequences of his actions in different situations, which are represented by a reduced number of very general diagrams. From them, the mechanism can build an action policy that allows it to avoid affectively negative situations and to seek those that are affectively positive. This solution manages to describe precisely all the regularities that the agent can perceive without building a complete plan of the environment.

A Novel and Simple Formalism for Study of Effect of Kerr Nonlinearity on Petermann I and II Spot Sizes of Single-Mode-Graded Index Fiber

We present investigation of Petermann I and II spot sizes in the presence of Kerr nonlinearity. Our study is based on the simple power series formulation for fundamental modal field of single-mode-graded index fiber developed by Chebyshev formalism. Based on the said power series expression in the absence of nonlinearity, analytical expressions of the said spot sizes can be prescribed. Using the analytical expressions of the said spot sizes in the absence of nonlinearity, we apply iterative technique in order to predict the said propagation characteristics in presence of Kerr nonlinearity. In this context, we choose some typical single-mode step and parabolic index fibers. We show that the our results agree excellently with the exact results which can be obtained by using rigorous finite-element technique. This leads to verification of accuracy of our simple technique. Moreover, evaluation of the concerned parameters by our formalism involves little computation. Thus, our method provides an accurate but simple alternative to the existing rigorous methods in this context. Accordingly, this novel and simple formalism will prove user friendly to the system engineers in the field non linear optics.

Multilayered Transmission Lines on Quasi-planar Substrates With Anisotropic Medium

This paper exhibits the extension of the discrete mode matching (DMM) method to analyze conformal structures with anisotropy. It represents a simple formalism as a basis to analyze multilayered structures with quasi-planar anisotropic dielectric layers. The dyadic Green's function is then calculated using a full-wave equivalent circuit (FWEC) of the structure, where each layer is represented with the hybrid block consisting of the tangential field components. The application is demonstrated by computing propagation constants for partially filled quasi-planar waveguides and microstrip lines with isotropic, uniaxial and biaxial anisotropic dielectrics.