Evaluation of two-dimensional quantizers for Fourier transform binary holograms

Quantization formats of four digital holographic codes (Lohmann,Lee, Burckhardt and Hsueh-Sawchuk) are evaluated. A quantitative assessment is made from errors in both the Fourier transform and image domains. In general, small errors in the Fourier amplitude or phase alone do not guarantee high image fidelity. From quantization considerations, the Lee hologram is shown to be the best choice for randomly phase coded objects. When phase coding is not feasible, the Lohmann hologram is preferable as it is easier to plot.

A Joint Source-Channel Coding Scheme for Transmission of Correlated Discrete Sources over a Gaussian Multiple Access Channel

We consider the problem of transmission of correlated discrete alphabet sources over a Gaussian Multiple Access Channel (GMAC). A distributed bit-to-Gaussian mapping is proposed which yields jointly Gaussian codewords. This can guarantee lossless transmission or lossy transmission with given distortions, if possible. The technique can be extended to the system with side information at the encoders and decoder.

New approximation algorithms for minimum cycle bases of graphs

We consider the problem of computing an approximate minimum cycle basis of an undirected edge-weighted graph G with m edges and n vertices; the extension to directed graphs is also discussed. In this problem, a {0,1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of the weights of the cycles is minimum is called a minimum cycle basis of G. Cycle bases of low weight are useful in a number of contexts, e.g. the analysis of electrical networks, structural engineering, chemistry, and surface reconstruction. We present two new algorithms to compute an approximate minimum cycle basis. For any integer k >= 1, we give (2k - 1)-approximation algorithms with expected running time 0(kmn(1+2/k) + mn((1+1/k)(omega-1))) and deterministic running time 0(n(3+2/k)), respectively. Here omega is the best exponent of matrix multiplication. It is presently known that omega < 2.376. Both algorithms are o(m(omega)) for dense graphs. This is the first time that any algorithm which computes sparse cycle bases with a guarantee drops below the Theta(m(omega)) bound. We also present a 2-approximation algorithm with O(m(omega) root n log n) expected running time, a linear time 2-approximation algorithm for planar graphs and an O(n(3)) time 2.42-approximation algorithm for the complete Euclidean graph in the plane.

Optimal infinite-horizon feedback laws for a general class of constrained discrete-time systems: stability and moving-horizon approximations

Stability results are given for a class of feedback systems arising from the regulation of time-varying discrete-time systems using optimal infinite-horizon and moving-horizon feedback laws. The class is characterized by joint constraints on the state and the control, a general nonlinear cost function and nonlinear equations of motion possessing two special properties. It is shown that weak conditions on the cost function and the constraints are sufficient to guarantee uniform asymptotic stability of both the optimal infinite-horizon and movinghorizon feedback systems. The infinite-horizon cost associated with the moving-horizon feedback law approaches the optimal infinite-horizon cost as the moving horizon is extended.

Design of nonequivalent self-routing networks based on a matrix model

In earlier work, nonisomorphic graphs have been converted into networks to realize Multistage Interconnection networks, which are topologically nonequivalent to the Baseline network. The drawback of this technique is that these nonequivalent networks are not guaranteed to be self-routing, because each node in the graph model can be replaced by a (2 × 2) switch in any one of the four different configurations. Hence, the problem of routing in these networks remains unsolved. Moreover, nonisomorphic graphs were obtained by interconnecting bipartite loops in a heuristic manner; the heuristic nature of this procedure makes it difficult to guarantee full connectivity in large networks. We solve these problems through a direct approach, in which a matrix model for self-routing networks is developed. An example is given to show that this model encompases nonequivalent self-routing networks. This approach has the additional advantage in that the matrix model itself ensures full connectivity.

New Approximation Algorithms for Minimum Cycle Bases of Graphs

We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed graphs is also discussed. In this problem, a {0,1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of the weights of the cycles is minimum is called a minimum cycle basis of G. Cycle bases of low weight are useful in a number of contexts, e.g. the analysis of electrical networks, structural engineering, chemistry, and surface reconstruction. Although in most such applications any cycle basis can be used, a low weight cycle basis often translates to better performance and/or numerical stability. Despite the fact that the problem can be solved exactly in polynomial time, we design approximation algorithms since the performance of the exact algorithms may be too expensive for some practical applications. We present two new algorithms to compute an approximate minimum cycle basis. For any integer k >= 1, we give (2k - 1)-approximation algorithms with expected running time O(kmn(1+2/k) + mn((1+1/k)(omega-1))) and deterministic running time O(n(3+2/k) ), respectively. Here omega is the best exponent of matrix multiplication. It is presently known that omega < 2.376. Both algorithms are o(m(omega)) for dense graphs. This is the first time that any algorithm which computes sparse cycle bases with a guarantee drops below the Theta(m(omega) ) bound. We also present a 2-approximation algorithm with expected running time O(M-omega root n log n), a linear time 2-approximation algorithm for planar graphs and an O(n(3)) time 2.42-approximation algorithm for the complete Euclidean graph in the plane.

A QFT-based robust SVC controller for improving the dynamic stability of power systems

A new design technique for an SVC-based power system damping controller has been proposed. The controller attempts to place all plant poles within a specified region on the s-plane to guarantee the desired closed loop performance. The use of Horowitz's quantitative feedback theory (QFT) permits the design of a 'fixed gain controller' that maintains its performance in spite of large variations in the plant parameters during its normal course of operation. The required controller parameters are arrived at by solving an optimization problem that incorporates the control specifications. The performance of this robust controller has been evaluated on a single machine infinite bus system equipped with a mid point SVC, and the results are shown to be consistent with the expected performance of the stabilizer. (C) 1998 Elsevier Science S.A. All rights reserved.

An investigation into the feasibility of fetal lung maturity prediction using statistical textural features

Fetal lung and liver tissues were examined by ultrasound in 240 subjects during 24 to 38 weeks of gestational age in order to investigate the feasibility of predicting the maturity of the lung from the textural features of sonograms. A region of interest of 64 X 64 pixels is used for extracting textural features. Since the histological properties of the liver are claimed to remain constant with respect to gestational age, features obtained from the lung region are compared with those from liver. Though the mean values of some of the features show a specific trend with respect to gestation age, the variance is too high to guarantee definite prediction of the gestational age. Thus, we restricted our purview to an investigation into the feasibility of fetal lung maturity prediction using statistical textural features. Out of 64 features extracted, those features that are correlated with gestation age and less computationally intensive are selected. The results of our study show that the sonographic features hold some promise in determining whether the fetal lung is mature or immature.

Phenylboronic acids in crystal engineering: Utility of the energetically unfavorable syn,syn-conformation in co-crystal design

Phenylboronic acids can exist, in principle, in three different conformers (syn,syn; syn,anti and anti,anti) with distinct energy profiles. In their native state, these compounds prefer the energetically favored syn, anti-conformation. In molecular complexes, however, the functionality exhibits conformational diversity. In this paper we report a series of co-crystals, with N-donor compounds, prepared by a design strategy involving the synthons based on the syn, syn-conformation of the boronic acid functionality. For this purpose, we employed compounds with the 1,2-diazo fragment (alprazolam, 1H-tetrazole, acetazolamide and benzotriazole), 1,10-phenanthroline and 2,2'-bipyridine for the co-crystallization experiments. However, our study shows that the mere presence of the 1,2-diazo fragment in the coformer does not guarantee the successful formation of co-crystals with a syn, syn-conformation of the boronic acid. [GRAPHICS] The -B(OH)(2) fragment makes unsymmetrical O-H center dot center dot center dot N heterosynthons with alprazolam (ALP) and 1,10-phenanthroline (PHEN). In the co-crystals of phenylboronic acids with 1H-tetrazole (TETR) and 2,2'-bipyridine (BPY), the symmetrical boronic acid dimer is the major synthon. In the BPY complex, boronic acid forms linear chains and the pyridine compound interacts with the lateral OH of boronic acid dimers that acts as a connector, thus forming a ladder structure. In the TETR complex, each heterocycle interacts with three boronic acids. While two boronic acids interact using the phenolic group, the third molecule generates O-H center dot center dot center dot N hydrogen bonds using the extra OH group, of -B(OH)(2) fragment, left after the dimer formation. Thus, although molecules were selected retrosynthetically with the 1,2-diazo fragment or with nearby hetero-atoms to induce co-crystal formation using the syn,syn-orientation of the -B(OH)(2) functionality, co-crystal formation is in fact selective and is probably driven by energy factors. Acetazolamide (ACET) contains self-complementary functional groups and hence creates stable homosynthons. Phenylboronic acids being weak competitors fail to perturb the homosynthons and hence the components crystallize separately. Therefore, besides the availability of possible hydrogen bond acceptors in the required position and orientation, the ability of the phenyl-boronic acid to perturb the existing interactions is also a prerequisite to form co-crystals. This is illustrated in the table below. In the case of ALP, PHEN and BPY, the native structures are stabilized by weak interactions and may be influenced by the boronic acid fragment. Thus phenylboronic acids can attain co-crystals with those compounds, wherein the cyclic O-H center dot center dot center dot N hydrogen bonds are stronger than the individual homo-interactions. This can lower the lattice energy of the molecular complex as compared with the individual crystals. [GRAPHICS] Phenylboronic acids show some selectivity in the formation of co-crystals with N-heterocycles. The differences in solubility of the components fall short to provide a possible reason for the selective formation of co-crystals only with certain compounds. These compounds, being weak acids, do not follow the Delta pK(a) analysis and hence fail to provide any conclusive observation. Theoretical results show that of the three conformers possible, the syn,anti conformer is the most stable. The relative stabilities of the three conformers syn,anti,syn,syn and anti,anti are 0.0, 2.18 and 3.14 kcal/mol, respectively. The theoretical calculations corroborate the fact that only energetically favorable synthons can induce the formation of heterosynthons, as in ALP and PHEN complexes. From a theoretical and structural analysis it is seen that phenylboronic acids will form interactions with those molecules wherein the heterocyclic and acidic fragments can interrupt the homosynthons. However, the energy profile is shallow and can be perturbed easily by the presence of competing functional groups (such as OH and COOH) in the vicinity. [GRAPHICS] .

Numerical modeling of the non-isothermal liquid droplet impact on a hot solid substrate

The heat transfer from a solid phase to an impinging non-isothermal liquid droplet is studied numerically. A new approach based on an arbitrary Lagrangian-Eulerian (ALE) finite element method for solving the incompressible Navier Stokes equations in the liquid and the energy equation within the solid and the liquid is presented. The novelty of the method consists in using the ALE-formulation also in the solid phase to guarantee matching grids along the liquid solid interface. Moreover, a new technique is developed to compute the heat flux without differentiating the numerical solution. The free surface and the liquid solid interface of the droplet are represented by a moving mesh which can handle jumps in the material parameter and a temperature dependent surface tension. Further, the application of the Laplace-Beltrami operator technique for the curvature approximation allows a natural inclusion of the contact angle. Numerical simulation for varying Reynold, Weber, Peclet and Biot numbers are performed to demonstrate the capabilities of the new approach. (C) 2014 Elsevier Ltd. All rights reserved.

Adaptive Mesh Refinement for Fast Convergence of EFIE-Based 3-D Extraction

3-D full-wave method of moments (MoM) based electromagnetic analysis is a popular means toward accurate solution of Maxwell's equations. The time and memory bottlenecks associated with such a solution have been addressed over the last two decades by linear complexity fast solver algorithms. However, the accurate solution of 3-D full-wave MoM on an arbitrary mesh of a package-board structure does not guarantee accuracy, since the discretization may not be fine enough to capture spatial changes in the solution variable. At the same time, uniform over-meshing on the entire structure generates a large number of solution variables and therefore requires an unnecessarily large matrix solution. In this paper, different refinement criteria are studied in an adaptive mesh refinement platform. Consequently, the most suitable conductor mesh refinement criterion for MoM-based electromagnetic package-board extraction is identified and the advantages of this adaptive strategy are demonstrated from both accuracy and speed perspectives. The results are also compared with those of the recently reported integral equation-based h-refinement strategy. Finally, a new methodology to expedite each adaptive refinement pass is proposed.

GLOBAL REGISTRATION OF MULTIPLE POINT CLOUDS USING SEMIDEFINITE PROGRAMMING

Consider N points in R-d and M local coordinate systems that are related through unknown rigid transforms. For each point, we are given (possibly noisy) measurements of its local coordinates in some of the coordinate systems. Alternatively, for each coordinate system, we observe the coordinates of a subset of the points. The problem of estimating the global coordinates of the N points (up to a rigid transform) from such measurements comes up in distributed approaches to molecular conformation and sensor network localization, and also in computer vision and graphics. The least-squares formulation of this problem, although nonconvex, has a well-known closed-form solution when M = 2 (based on the singular value decomposition (SVD)). However, no closed-form solution is known for M >= 3. In this paper, we demonstrate how the least-squares formulation can be relaxed into a convex program, namely, a semidefinite program (SDP). By setting up connections between the uniqueness of this SDP and results from rigidity theory, we prove conditions for exact and stable recovery for the SDP relaxation. In particular, we prove that the SDP relaxation can guarantee recovery under more adversarial conditions compared to earlier proposed spectral relaxations, and we derive error bounds for the registration error incurred by the SDP relaxation. We also present results of numerical experiments on simulated data to confirm the theoretical findings. We empirically demonstrate that (a) unlike the spectral relaxation, the relaxation gap is mostly zero for the SDP (i.e., we are able to solve the original nonconvex least-squares problem) up to a certain noise threshold, and (b) the SDP performs significantly better than spectral and manifold-optimization methods, particularly at large noise levels.