Structure and representation of correlation functions and the density matrix for a statistical wave field in optics

A systematic structure analysis of the correlation functions of statistical quantum optics is carried out. From a suitably defined auxiliary two‐point function we are able to identify the excited modes in the wave field. The relative simplicity of the higher order correlation functions emerge as a byproduct and the conditions under which these are made pure are derived. These results depend in a crucial manner on the notion of coherence indices and of unimodular coherence indices. A new class of approximate expressions for the density operator of a statistical wave field is worked out based on discrete characteristic sets. These are even more economical than the diagonal coherent state representations. An appreciation of the subtleties of quantum theory obtains. Certain implications for the physics of light beams are cited.

A field-consistent and variationally correct representation of transverse shear strains in the nine-noded plate element

We present a biquadratic Lagrangian plate bending element with consistent fields for the constrained transverse shear strain functions. A technique involving expansion of the strain interpolations in terms of Legendre polynomials is used to redistribute the kinematically derived shear strain fields so that the field-consistent forms (i.e. avoiding locking) are also variationally correct (i.e. do not violate the variational norms). Also, a rational method of isoparametric Jacobian transformation is incorporated so that the constrained covariant shear strain fields are always consistent in whatever general quadrilateral form the element may take. Finally the element is compared with another formulation which was recently published. The element is subjected to several robust bench mark tests and is found to pass all the tests efficiently.

Designing a Dependency Representation and Grammar Definition Corpus for Finnish

We outline the design and creation of a syntactically and morphologically annotated corpora of Finnish for use by the research community. We motivate a definitional, systematic “grammar definition corpus” as a first step in an three-year annotation effort to help create higher-quality, better-documented extensive parsebanks at a later stage. The syntactic representation, consisting of a dependency structure and a basic set of dependency functions, is outlined with examples. Reference is made to double-blind annotation experiments to measure the applicability of the newgrammar definition corpus methodology.

Parts based representation for pedestrian using NMF with robustness to partial occlusion

Computer Vision has seen a resurgence in the parts-based representation for objects over the past few years. The parts are usually annotated beforehand for training. We present an annotation free parts-based representation for the pedestrian using Non-Negative Matrix Factorization (NMF). We show that NMF is able to capture the wide range of pose and clothing of the pedestrians. We use a modified form of NMF i.e. NMF with sparsity constraints on the factored matrices. We also make use of Riemannian distance metric for similarity measurements in NMF space as the basis vectors generated by NMF aren't orthogonal. We show that for 1% drop in accuracy as compared to the Histogram of Oriented Gradients (HOG) representation we can achieve robustness to partial occlusion.

Integral treatment for the representation of thermodynamic properties in multicomponent systems using interaction parameters

The partial thermodynamic functions of the solvent component of a ternary system have been deduced in terms of the interaction parameters by integration of several series which emerge from the Maclaurin infinite series based on the integral property of the system and subjected to appropriate boundary conditions. The series integration shows that the resulting partial functions are suitable for interpreting the thermodynamic properties of the system and are independent of compositional paths. In the present analysis, the higher order terms of these series are found to make insignificant contributions.

Representation of thermodynamic properties of ternary systems and its application to the system silver-gold-copper at 1350 K

The article presents a generalized analytical expression for description of the integral excess Gibbs free energy of mixing of a ternary system. Twelve constants of the equation are assessed by the least mean squares regressional analysis of the experimental integral excess data of the constituent binaries; three ternary parameters are evaluated by a regressional analysis based on the partial experimental data of a component of the ternary system. The assessed values of the ternary parameters describe the nature of the ternary interaction in the system. Activities and isoactivities of the components in the Ag-Au-Cu system at 1350 K are calculated and found to be in good agreement with the experimental data. This analytical treatment is particularly useful to ternary systems where the thermodynamic data are available from different sources.

Representation of thermodynamic properties of quaternary systems using interaction parameters

Integral excess free energy of a quaternary system has been expressed in terms of the MacLaurin infinite series. The series is subjected to appropriate boundary conditions and each of the derivatives correlated to the corresponding interaction coefficients. The derivation of the partial functions involves extensive summation of various infinite series pertaining to the first order and quaternary parameters to remove any truncational error. The thermodynamic consistency of the derived partials has been established based on the Gibbs-Duhem relations. The equations are used to interpret the thermodynamic properties of the Fe-Cr-Ni-N system.

Synthesis of workspaces of planar manipulators with arbitrary topology using shape representation and simulated annealing

This paper presents a general methodology for the synthesis of the external boundary of the workspaces of a planar manipulator with arbitrary topology. Both the desired workspace and the manipulator workspaces are identified by their boundaries and are treated as simple closed polygons. The paper introduces the concept of best match configuration and shows that the corresponding transformation can be obtained by using the concept of shape normalization available in image processing literature. Introduction of the concept of shape in workspace synthesis allows highly accurate synthesis with fewer numbers of design variables. This paper uses a new global property based vector representation for the shape of the workspaces which is computationally efficient because six out of the seven elements of this vector are obtained as a by-product of the shape normalization procedure. The synthesis of workspaces is formulated as an optimization problem where the distance between the shape vector of the desired workspace and that of the workspace of the manipulator at hand are minimized by changing the dimensional parameters of the manipulator. In view of the irregular nature of the error manifold, the statistical optimization procedure of simulated annealing has been used. A number of worked-out examples illustrate the generality and efficiency of the present method. (C) 1998 Elsevier Science Ltd. All rights reserved.

Finding a Box Representation for a Graph in $O(n^2\Delta^2\ln n)$ time

An axis-parallel box in $b$-dimensional space is a Cartesian product $R_1 \times R_2 \times \cdots \times R_b$ where $R_i$ (for $1 \leq i \leq b$) is a closed interval of the form $[a_i, b_i]$ on the real line. For a graph $G$, its boxicity is the minimum dimension $b$, such that $G$ is representable as the intersection graph of (axis-parallel) boxes in $b$-dimensional space. The concept of boxicity finds application in various areas of research like ecology, operation research etc. Chandran, Francis and Sivadasan gave an $O(\Delta n^2 \ln^2 n)$ randomized algorithm to construct a box representation for any graph $G$ on $n$ vertices in $\lceil (\Delta + 2)\ln n \rceil$ dimensions, where $\Delta$ is the maximum degree of the graph. They also came up with a deterministic algorithm that runs in $O(n^4 \Delta )$ time. Here, we present an $O(n^2 \Delta^2 \ln n)$ deterministic algorithm that constructs the box representation for any graph in $\lceil (\Delta + 2)\ln n \rceil$ dimensions.

On a Novel Geometric Representation of Rotation

This paper presents a novel method of representing rotation and its application to representing the ranges of motion of coupled joints in the human body, using planar maps. The present work focuses on the viability of this representation for situations that relied on maps on a unit sphere. Maps on a unit sphere have been used in diverse applications such as Gauss map, visibility maps, axis-angle and Euler-angle representations of rotation etc. Computations on a spherical surface are difficult and computationally expensive; all the above applications suffer from problems associated with singularities at the poles. There are methods to represent the ranges of motion of such joints using two-dimensional spherical polygons. The present work proposes to use multiple planar domain “cube” instead of a single spherical domain, to achieve the above objective. The parameterization on the planar domains is easy to obtain and convert to spherical coordinates. Further, there is no localized and extreme distortion of the parameter space and it gives robustness to the computations. The representation has been compared with the spherical representation in terms of computational ease and issues related to singularities. Methods have been proposed to represent joint range of motion and coupled degrees of freedom for various joints in digital human models (such as shoulder, wrist and fingers). A novel method has been proposed to represent twist in addition to the existing swing-swivel representation.

mRegistry: a registry representation for fault diagnosis

Microsoft Windows uses the notion of registry to store all configuration information. The registry entries have associations and dependencies. For example, the paths to executables may be relative to some home directories. The registry being designed with faster access as one of the objectives does not explicitly capture these relations. In this paper, we explore a representation that captures the dependencies more explicitly using shared and unifying variables. This representation, called mRegistry exploits the tree-structured hierarchical nature of the registry, is concept-based and obtained in multiple stages. mRegistry captures intra-block, inter-block and ancestor-children dependencies (all leaf entries of a parent key in a registry put together as an entity constitute a block thereby making the block as the only child of the parent). In addition, it learns the generalized concepts of dependencies in the form of rules. We show that mRegistry has several applications: fault diagnosis, prediction, comparison, compression etc.

Representation of evidence: An approach to uncertainty handling in knowledge-based systems

Many knowledge based systems (KBS) transform a situation information into an appropriate decision using an in built knowledge base. As the knowledge in real world situation is often uncertain, the degree of truth of a proposition provides a measure of uncertainty in the underlying knowledge. This uncertainty can be evaluated by collecting `evidence' about the truth or falsehood of the proposition from multiple sources. In this paper we propose a simple framework for representing uncertainty in using the notion of an evidence space.

Location Area Planning Using Simulated Annealing With A New Solution Representation

Location area planning problem is to partition the cellular/mobile network into location areas with the objective of minimizing the total cost. This partitioning problem is a difficult combinatorial optimization problem. In this paper, we use the simulated annealing with a new solution representation. In our method, we can automatically generate different number of location areas using Compact Index (CI) to obtain the optimal/best partitions. We compare the results obtained in our method with the earlier results available in literature. We show that our methodology is able to perform better than earlier methods.