Block-based feature detection and matching for mosaicing of camera-captured document images

In this paper, we present a new feature-based approach for mosaicing of camera-captured document images. A novel block-based scheme is employed to ensure that corners can be reliably detected over a wide range of images. 2-D discrete cosine transform is computed for image blocks defined around each of the detected corners and a small subset of the coefficients is used as a feature vector A 2-pass feature matching is performed to establish point correspondences from which the homography relating the input images could be computed. The algorithm is tested on a number of complex document images casually taken from a hand-held camera yielding convincing results.

Conservation law with the flux function discontinuous in the space variable- II - Convex-concave type fluxes and generalized entropy solutions

We deal with a single conservation law with discontinuous convex-concave type fluxes which arise while considering sign changing flux coefficients. The main difficulty is that a weak solution may not exist as the Rankine-Hugoniot condition at the interface may not be satisfied for certain choice of the initial data. We develop the concept of generalized entropy solutions for such equations by replacing the Rankine-Hugoniot condition by a generalized Rankine-Hugoniot condition. The uniqueness of solutions is shown by proving that the generalized entropy solutions form a contractive semi-group in L-1. Existence follows by showing that a Godunov type finite difference scheme converges to the generalized entropy solution. The scheme is based on solutions of the associated Riemann problem and is neither consistent nor conservative. The analysis developed here enables to treat the cases of fluxes having at most one extrema in the domain of definition completely. Numerical results reporting the performance of the scheme are presented. (C) 2006 Elsevier B.V. All rights reserved.

Critical lattice size limit for synchronized chaotic state in one- and two-dimensional diffusively coupled map lattices

We consider diffusively coupled map lattices with P neighbors (where P is arbitrary) and study the stability of the synchronized state. We show that there exists a critical lattice size beyond which the synchronized state is unstable. This generalizes earlier results for nearest neighbor coupling. We confirm the analytical results by performing numerical simulations on coupled map lattices with logistic map at each node. The above analysis is also extended to two-dimensional P-neighbor diffusively coupled map lattices.

Facile one-pot synthesis of thio and selenourea derivatives: A new class of potent urease inhibitors

A facile, one-pot synthesis of thio and selenourea derivatives from amines using tetrathiomolybdate 1 and tetraseleno-tungstate 2 as sulfur and selenium transfer reagents, respectively, is reported. The compounds were tested for their activity as urease inhibitors and some of the compounds showed potent activity in the nanomolar range towards jack bean urease. (C) 2007 Elsevier Ltd. All rights reserved.

Memory-efficient spatial prediction image compression scheme

In prediction phase, the hierarchical tree structure obtained from the test image is used to predict every central pixel of an image by its four neighboring pixels. The prediction scheme generates the predicted error image, to which the wavelet/sub-band coding algorithm can be applied to obtain efficient compression. In quantization phase, we used a modified SPIHT algorithm to achieve efficiency in memory requirements. The memory constraint plays a vital role in wireless and bandwidth-limited applications. A single reusable list is used instead of three continuously growing linked lists as in case of SPIHT. This method is error resilient. The performance is measured in terms of PSNR and memory requirements. The algorithm shows good compression performance and significant savings in memory. (C) 2006 Elsevier B.V. All rights reserved.

Noncoherent low-decoding-complexity space-time codes for wireless relay networks

The differential encoding/decoding setup introduced by Kiran et at, Oggier et al and Jing et al for wireless relay networks that use codebooks consisting of unitary matrices is extended to allow codebooks consisting of scaled unitary matrices. For such codebooks to be used in the Jing-Hassibi protocol for cooperative diversity, the conditions that need to be satisfied by the relay matrices and the codebook are identified. A class of previously known rate one, full diversity, four-group encodable and four-group decodable Differential Space-Time Codes (DSTCs) is proposed for use as Distributed DSTCs (DDSTCs) in the proposed set up. To the best of our knowledge, this is the first known low decoding complexity DDSTC scheme for cooperative wireless networks.

Quantum spin nematics, dimerization, and deconfined criticality in Quasi-1D spin-one magnets

We study theoretically the destruction of spin nematic order due to quantum fluctuations in quasi-one-dimensional spin-1 magnets. If the nematic ordering is disordered by condensing disclinations, then quantum Berry phase effects induce dimerization in the resulting paramagnet. We develop a theory for a Landau-forbidden second order transition between the spin nematic and dimerized states found in recent numerical calculations. Numerical tests of the theory are suggested.

Polymer drift in a solvent by force acting on one polymer end

We investigate the effect of hydrodynamic interactions on the non-equilibrium drift dynamics of an ideal flexible polymer pulled by a constant force applied at one polymer end using the perturbation theory and the renormalization group method. For moderate force, if the polymer elongation is small, the hydrodynamic interactions are not screened and the velocity and the longitudinal elongation of the polymer are computed using the renormalization group method. Both the velocity and elongation are nonlinear functions of the driving force in this regime. For large elongation we found two regimes. For large force but finite chain length L the hydrodynamic interactions are screened. For large chain lengths and a finite force the hydrodynamic interactions are only partially screened, which in three dimensions results in unusual logarithmic corrections to the velocity and the longitudinal elongation.

Quadratic Nonlinearity of One- and Two-Electron Oxidized Metalloporphyrins and Their Switching in Solution

We report the quadratic nonlinearity of one- and two-electron oxidation products of the first series of transition metal complexes of meso-tetraphenylporphyrin (TPP). Among many MTPP complexes, only CuTPP and ZnTPP show reversible oxidation/reduction cycles as seen from cyclic voltammetry experiments. While centrosymmetric neutral metalloporphyrins have zero first hyperpolarizability, β, as expected, the cation radicals and dications of CuTPP and ZnTPP have very high β values. The one- and two-electron oxidation of the MTPPs leads to symmetry-breaking of the metal−porphyrin core, resulting in a large β value that is perhaps aided in part by contributions from the two-photon resonance enhancement. The calculated static first hyperpolarizabilities, β0, which are evaluated in the framework of density functional theory by a coupled perturbed Hartree−Fock method, support the experimental trend. The switching of optical nonlinearity has been achieved between the neutral and the one-electron oxidation products but not between the one- and the two-electron oxidation products since dications that are electrochemically reversible are unstable due to the formation of stable isoporphyrins in the presence of nucleophiles such as halides.

Topological properties of the one dimensional exponential random geometric graph

In this article we study the one-dimensional random geometric (random interval) graph when the location of the nodes are independent and exponentially distributed. We derive exact results and limit theorems for the connectivity and other properties associated with this random graph. We show that the asymptotic properties of a graph with a truncated exponential distribution can be obtained using the exponential random geometric graph. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2008.

One-dimensional zig-zag type coordination polymers of Ni(II) and Cu(II) containing 1,3-benzenedicarboxylate and 1,3-diaminopropane: Structural, spectral and thermal studies

Two coordination polymers [Ni(ipt)(dap)(2)](n) (1) and [Cu(ipt)(dap)H2O](n) center dot nH(2)O (2) with an overall one-dimensional arrangement and having isophthalate (ipt) as bridging moieties and chelating 1,3-diaminopropane (dap) as structure modulating units have been prepared and characterized by crystallographic, spectroscopic and thermo-analytical studies. Both have an overall one-dimensional zig-zag nature but with a distorted octahedral NiN4O2 chromophore for 1 and a distorted square pyramidal CuN2O3 chromophore for 2. Even though the ipt units are acting as bridging units through mono-dentatively coordinating carboxylate functions in both polymers, compound 1 has the carboxylate oxygen linkages at the trans positions, while in 2 the oxygen linkages occur at the cis positions leading to a different type of zig-zag arrangement. Relevant spectral and bonding parameters also could be evaluated for the compounds using UV-Vis and EPR spectra. Thermal stability and possible structural modifications on thermal treatment of the compounds were also investigated and the relevant thermodynamic and kinetic parameters evaluated from the thermal data. (C) 2007 Elsevier B.V. All rights reserved.

Optimized Policies for the Retransmission Probabilities in Slotted Aloha

In this paper, we study the behaviour of the slotted Aloha multiple access scheme with a finite number of users under different traffic loads and optimize the retransmission probability q(r) for various settings, cost objectives and policies. First, we formulate the problem as a parameter optimization problem and use certain efficient smoothed functional algorithms for finding the optimal retransmission probability parameter. Next, we propose two classes of multi-level closed-loop feedback policies (for finding in each case the retransmission probability qr that now depends on the current system state) and apply the above algorithms for finding an optimal policy within each class of policies. While one of the policy classes depends on the number of backlogged nodes in the system, the other depends on the number of time slots since the last successful transmission. The latter policies are more realistic as it is difficult to keep track of the number of backlogged nodes at each instant. We investigate the effect of increasing the number of levels in the feedback policies. Wen also investigate the effects of using different cost functions (withn and without penalization) in our algorithms and the corresponding change in the throughput and delay using these. Both of our algorithms use two-timescale stochastic approximation. One of the algorithms uses one simulation while the other uses two simulations of the system. The two-simulation algorithm is seen to perform better than the other algorithm. Optimal multi-level closed-loop policies are seen to perform better than optimal open-loop policies. The performance further improves when more levels are used in the feedback policies.

Splitting Algorithms for Fast Relay Selection: Generalizations, Analysis, and a Unified View

Relay selection for cooperative communications promises significant performance improvements, and is, therefore, attracting considerable attention. While several criteria have been proposed for selecting one or more relays, distributed mechanisms that perform the selection have received relatively less attention. In this paper, we develop a novel, yet simple, asymptotic analysis of a splitting-based multiple access selection algorithm to find the single best relay. The analysis leads to simpler and alternate expressions for the average number of slots required to find the best user. By introducing a new contention load' parameter, the analysis shows that the parameter settings used in the existing literature can be improved upon. New and simple bounds are also derived. Furthermore, we propose a new algorithm that addresses the general problem of selecting the best Q >= 1 relays, and analyze and optimize it. Even for a large number of relays, the scalable algorithm selects the best two relays within 4.406 slots and the best three within 6.491 slots, on average. We also propose a new and simple scheme for the practically relevant case of discrete metrics. Altogether, our results develop a unifying perspective about the general problem of distributed selection in cooperative systems and several other multi-node systems.

1-[(2-Chloro-7-methyl-3-quinolyl)methyl]pyridin-2(1H)-one

In the title compound, C16H13ClN2O, the quinoline ring system is essentially planar, with a maximum deviation of 0.021 (2) angstrom. The pyridone ring is oriented at a dihedral angle of 85.93 (6)degrees with respect to the quinoline ring system. In the crystal structure, intermolecular C-H center dot center dot center dot O hydrogen bonds link the molecules along the b axis. Weak pi-pi stacking interactions [centroid-centroid distances = 3.7218 (9) and 3.6083 (9) angstrom] are also observed.

1-[(2-Chloro-7,8-dimethylquinolin-3-yl)methyl]pyridin-2(1H)-one

In the title compound, C17H15ClN2O, the quinoline ring system is nearly planar, with a maximum deviation from the mean plane of 0.074 (2) angstrom, and makes a dihedral angle of 81.03 (7)degrees with the pyridone ring. The crystal packing is stabilized by pi-pi stacking interactions between the pyridone and benzene rings of the quinoline ring system [centroid-centroid distance = 3.6754 (10) angstrom]. Furthermore, weak intermolecular C-H center dot center dot center dot O hydrogen bonding links molecules into supramolecular chains along [001].