Linear Coding Schemes for the Distributed Computation of Subspaces

Let X-1,..., X-m be a set of m statistically dependent sources over the common alphabet F-q, that are linearly independent when considered as functions over the sample space. We consider a distributed function computation setting in which the receiver is interested in the lossless computation of the elements of an s-dimensional subspace W spanned by the elements of the row vector X-1,..., X-m]Gamma in which the (m x s) matrix Gamma has rank s. A sequence of three increasingly refined approaches is presented, all based on linear encoders. The first approach uses a common matrix to encode all the sources and a Korner-Marton like receiver to directly compute W. The second improves upon the first by showing that it is often more efficient to compute a carefully chosen superspace U of W. The superspace is identified by showing that the joint distribution of the {X-i} induces a unique decomposition of the set of all linear combinations of the {X-i}, into a chain of subspaces identified by a normalized measure of entropy. This subspace chain also suggests a third approach, one that employs nested codes. For any joint distribution of the {X-i} and any W, the sum-rate of the nested code approach is no larger than that under the Slepian-Wolf (SW) approach. Under the SW approach, W is computed by first recovering each of the {X-i}. For a large class of joint distributions and subspaces W, the nested code approach is shown to improve upon SW. Additionally, a class of source distributions and subspaces are identified, for which the nested-code approach is sum-rate optimal.

Multiobjective discrete particle swarm optimization for multisensor image alignment

A new technique is proposed for multisensor image registration by matching the features using discrete particle swarm optimization (DPSO). The feature points are first extracted from the reference and sensed image using improved Harris corner detector available in the literature. From the extracted corner points, DPSO finds the three corresponding points in the sensed and reference images using multiobjective optimization of distance and angle conditions through objective switching technique. By this, the global best matched points are obtained which are used to evaluate the affine transformation for the sensed image. The performance of the image registration is evaluated and concluded that the proposed approach is efficient.

Interplay Between Optimal Selection Scheme, Selection Criterion, and Discrete Rate Adaptation in Opportunistic Wireless Systems

An opportunistic, rate-adaptive system exploits multi-user diversity by selecting the best node, which has the highest channel power gain, and adapting the data rate to selected node's channel gain. Since channel knowledge is local to a node, we propose using a distributed, low-feedback timer backoff scheme to select the best node. It uses a mapping that maps the channel gain, or, in general, a real-valued metric, to a timer value. The mapping is such that timers of nodes with higher metrics expire earlier. Our goal is to maximize the system throughput when rate adaptation is discrete, as is the case in practice. To improve throughput, we use a pragmatic selection policy, in which even a node other than the best node can be selected. We derive several novel, insightful results about the optimal mapping and develop an algorithm to compute it. These results bring out the inter-relationship between the discrete rate adaptation rule, optimal mapping, and selection policy. We also extensively benchmark the performance of the optimal mapping with several timer and opportunistic multiple access schemes considered in the literature, and demonstrate that the developed scheme is effective in many regimes of interest.

Delay optimal scheduling of a discrete-time batch service queue for point-to-point channel code rate selection

We consider the problem of characterizing the minimum average delay, or equivalently the minimum average queue length, of message symbols randomly arriving to the transmitter queue of a point-to-point link which dynamically selects a (n, k) block code from a given collection. The system is modeled by a discrete time queue with an IID batch arrival process and batch service. We obtain a lower bound on the minimum average queue length, which is the optimal value for a linear program, using only the mean (λ) and variance (σ2) of the batch arrivals. For a finite collection of (n, k) codes the minimum achievable average queue length is shown to be Θ(1/ε) as ε ↓ 0 where ε is the difference between the maximum code rate and λ. We obtain a sufficient condition for code rate selection policies to achieve this optimal growth rate. A simple family of policies that use only one block code each as well as two other heuristic policies are shown to be weakly optimal in the sense of achieving the 1/ε growth rate. An appropriate selection from the family of policies that use only one block code each is also shown to achieve the optimal coefficient σ2/2 of the 1/ε growth rate. We compare the performance of the heuristic policies with the minimum achievable average queue length and the lower bound numerically. For a countable collection of (n, k) codes, the optimal average queue length is shown to be Ω(1/ε). We illustrate the selectivity among policies of the growth rate optimality criterion for both finite and countable collections of (n, k) block codes.

Self-assembly of discrete metallamacrocycles employing half-sandwich octahedral diruthenium(II) building units and imidazole-based ligands

Equimolar combination of a series of binuclear half-sandwich p-cymene ruthenium(II) building units Ru-2(mu-eta(4)-C2O4)(MeOH)(2)(eta(6)-p-cymene)(2)](OTf)(2) 1a](OTf)(2), Ru-2(mu-eta(4)-N,N'-diphenyloxamidato)( MeOH)(2)(eta(6)-p-cymene)(2)](OTf)(2) 1b](OTf)(2) and Ru-2(mu-eta(4)-C6H2O4)(MeOH)(2)(eta(6)-p-cymene)(2)](OTf)(2) 1c](OTf)(2) separately with imidazole-based ditopic ligands (L-1-L-2) in methanol yielded a series of tetranuclear metallamacrocycles 2-7](OTf)(4), respectively L-1 = 1,4-bis(imidazole-1-yl)benzene; L-2 = 4,4'-bis(imidazole-1-yl)biphenyl; OTf- = O3SCF3-]. Similarly, the reaction of Ru-2(mu-eta(4)-C2O4)(MeOH)(2)(eta(6)-p-cymene)2](OTf)(2) 1a](OTf)(2) with a triazine-based tritopic ligand 1,3,5-tris(imidazole-1-yl) triazine (L3) in 3: 2 M ratio afforded an unexpected tetranuclear macrocycle 8](OTf)(4) instead of an expected trigonal prismatic cage 8a](OTf)(6). All the self-assembled macrocycles 2-8](OTf)(4) were isolated in moderate to high yields and were fully characterized by multinuclear H-1, F-19] NMR, IR and electrospray ionization mass spectrometry (ESI-MS). In addition, X-ray diffraction study on the single crystals of 3](OTf)(4) and 8](OTf)(4) also indicated the formation 2 + 2] self-assembled macrocycles. Despite the possibility of formation of different conformational isomeric macrocycles (syn-and anti) and polymeric product due to free rotation of ligand sites of imidazole linkers, the selective formation of single conformational isomer (anti) as the only product is quite interesting. Furthermore, the photo-and electrochemical properties of these assemblies have been studied using UV/Vis absorption and cyclic voltammetry analysis. (c) 2013 Elsevier B.V. All rights reserved.

Three-Dimensional Study of Natural Convection in a Horizontal Channel With Discrete Heaters on One of Its Vertical Walls

Three-dimensional natural convection in a horizontal channel with an array of discrete flush-mounted heaters on one of its vertical walls is numerically studied. Effects of thermal conductivities of substrate and heaters and convection on outer sides of the channel walls on heat transfer are examined. The substrate affects heat transfer in a wider range of thermal conductivities than do the heaters. At lower heater thermal conductivities a higher heat portion is transferred by direct convection from the heaters to the adjacent coolant. However, higher substrate conductivity is associated with higher heat portion transferred through the substrate. The innermost heater column is found to become the hottest heater column due to the lower coolant accessibility. The heat transfer in the channel is strongly influenced by convection on the outer sides of the channel walls. Correlations are presented for dimensionless temperature maximum and average Nusselt number.

Cubic Sieve Congruence of the Discrete Logarithm Problem, and fractional part sequences

The Cubic Sieve Method for solving the Discrete Logarithm Problem in prime fields requires a nontrivial solution to the Cubic Sieve Congruence (CSC) x(3) equivalent to y(2)z (mod p), where p is a given prime number. A nontrivial solution must also satisfy x(3) not equal y(2)z and 1 <= x, y, z < p(alpha), where alpha is a given real number such that 1/3 < alpha <= 1/2. The CSC problem is to find an efficient algorithm to obtain a nontrivial solution to CSC. CSC can be parametrized as x equivalent to v(2)z (mod p) and y equivalent to v(3)z (mod p). In this paper, we give a deterministic polynomial-time (O(ln(3) p) bit-operations) algorithm to determine, for a given v, a nontrivial solution to CSC, if one exists. Previously it took (O) over tilde (p(alpha)) time in the worst case to determine this. We relate the CSC problem to the gap problem of fractional part sequences, where we need to determine the non-negative integers N satisfying the fractional part inequality {theta N} < phi (theta and phi are given real numbers). The correspondence between the CSC problem and the gap problem is that determining the parameter z in the former problem corresponds to determining N in the latter problem. We also show in the alpha = 1/2 case of CSC that for a certain class of primes the CSC problem can be solved deterministically in <(O)over tilde>(p(1/3)) time compared to the previous best of (O) over tilde (p(1/2)). It is empirically observed that about one out of three primes is covered by the above class. (C) 2013 Elsevier B.V. All rights reserved.

Discrete time second order sliding mode observer for uncertain linear multi-output system

This paper presents a second order sliding mode observer (SOSMO) design for discrete time uncertain linear multi-output system. The design procedure is effective for both matched and unmatched bounded uncertainties and/or disturbances. A second order sliding function and corresponding sliding manifold for discrete time system are defined similar to the lines of continuous time counterpart. A boundary layer concept is employed to avoid switching across the defined sliding manifold and the sliding trajectory is confined to a boundary layer once it converges to it. The condition for existence of convergent quasi-sliding mode (QSM) is derived. The observer estimation errors satisfying given stability conditions converge to an ultimate finite bound (within the specified boundary layer) with thickness O(T-2) where T is the sampling period. A relation between sliding mode gain and boundary layer is established for the existence of second order discrete sliding motion. The design strategy is very simple to apply and is demonstrated for three examples with different class of disturbances (matched and unmatched) to show the effectiveness of the design. Simulation results to show the robustness with respect to the measurement noise are given for SOSMO and the performance is compared with pseudo-linear Kalman filter (PLKF). (C) 2013 Published by Elsevier Ltd. on behalf of The Franklin Institute

Multi Label Classification of Discrete Data

The paper describes an algorithm for multi-label classification. Since a pattern can belong to more than one class, the task of classifying a test pattern is a challenging one. We propose a new algorithm to carry out multi-label classification which works for discrete data. We have implemented the algorithm and presented the results for different multi-label data sets. The results have been compared with the algorithm multi-label KNN or ML-KNN and found to give good results.

Kinetically stabilized C-60-toluene solvate nanostructures with a discrete absorption edge enabling supramolecular topotactic molecular exchange

Nanosized fullerene solvates have attracted widespread research attention due to recent interesting discoveries. A particular type of solvate is limited to a fixed number of solvents and designing new solvates within the same family is a fundamental challenge. Here we demonstrate that the hexagonal closed packed (HCP) phase of C-60 solvates, formed with m-xylene, can also be stabilized using toluene. Contrary to the notion on their instability, these can be stabilized from minutes up to months by tuning the occupancy of solvent molecules. Due to high stability, we could record their absorption edge, and measure excitonic life-time, which has not been reported for any C-60 solvate. Despite being solid, absorbance spectrum of the solvates is similar in appearance to that of C-60 in solution. A new absorption band appears at 673 nm. The fluorescence lifetime at 760 nm is similar to 1.2 ns, suggesting an excited state unaffected by solvent-C-60 interaction. Finally, we utilized the unstable set of HCP solvates to exchange with a second solvent by a topotactic exchange mechanism, which rendered near permanent stability to the otherwise few minutes stable solvates. This is also the first example of topotactic exchange in supramolecular crystal, which is widely known in ionic solids. (C) 2014 Elsevier Ltd. All rights reserved.

Discrete Vortex Method-Based Model for Ground-Effect Studies

A discrete vortex method-based model has been proposed for two-dimensional/three-dimensional ground-effect prediction. The model merely requires two-dimensional sectional aerodynamics in free flight. This free-flight data can be obtained either from experiments or a high-fidelity computational fluid dynamics solver. The first step of this two-step model involves a constrained optimization procedure that modifies the vortex distribution on the camber line as obtained from a discrete vortex method to match the free-flight data from experiments/computational fluid dynamics. In the second step, the vortex distribution thus obtained is further modified to account for the presence of the ground plane within a discrete vortex method-based framework. Whereas the predictability of the lift appears as a natural extension, the drag predictability within a potential flow framework is achieved through the introduction of what are referred to as drag panels. The need for the use of the generalized Kutta-Joukowski theorem is emphasized. The extension of the model to three dimensions is by the way of using the numerical lifting-line theory that allows for wing sweep. The model is extensively validated for both two-dimensional and three-dimensional ground-effect studies. The work also demonstrates the ability of the model to predict lift and drag coefficients of a high-lift wing in ground effect to about 2 and 8% accuracy, respectively, as compared to the results obtained using a Reynolds-averaged Navier-Stokes solver involving grids with several million volumes. The model shows a lot of promise in design, particularly during the early phase.

Linear Index Coding and Representable Discrete Polymatroids

Discrete polymatroids are the multi-set analogue of matroids. In this paper, we explore the connections between linear index coding and representable discrete polymatroids. The index coding problem involves a sender which generates a set of messages X = {x(1), x(2), ... x(k)} and a set of receivers R which demand messages. A receiver R is an element of R is specified by the tuple (x, H) where x. X is the message demanded by R and H subset of X \textbackslash {x} is the side information possessed by R. It is first shown that a linear solution to an index coding problem exists if and only if there exists a representable discrete polymatroid satisfying certain conditions which are determined by the index coding problem considered. El Rouayheb et. al. showed that the problem of finding a multi-linear representation for a matroid can be reduced to finding a perfect linear index coding solution for an index coding problem obtained from that matroid. Multi-linear representation of a matroid can be viewed as a special case of representation of an appropriate discrete polymatroid. We generalize the result of El Rouayheb et. al. by showing that the problem of finding a representation for a discrete polymatroid can be reduced to finding a perfect linear index coding solution for an index coding problem obtained from that discrete polymatroid.

Discrete-Rate Adaptation and Selection in Energy Harvesting Wireless Systems

In a system with energy harvesting (EH) nodes, the design focus shifts from minimizing energy consumption by infrequently transmitting less information to making the best use of available energy to efficiently deliver data while adhering to the fundamental energy neutrality constraint. We address the problem of maximizing the throughput of a system consisting of rate-adaptive EH nodes that transmit to a destination. Unlike related literature, we focus on the practically important discrete-rate adaptation model. First, for a single EH node, we propose a discrete-rate adaptation rule and prove its optimality for a general class of stationary and ergodic EH and fading processes. We then study a general system with multiple EH nodes in which one is opportunistically selected to transmit. We first derive a novel and throughput-optimal joint selection and rate adaptation rule (TOJSRA) when the nodes are subject to a weaker average power constraint. We then propose a novel rule for a multi-EH node system that is based on TOJSRA, and we prove its optimality for stationary and ergodic EH and fading processes. We also model the various energy overheads of the EH nodes and characterize their effect on the adaptation policy and the system throughput.

Self-Assembled Discrete Molecules for Sensing Nitroaromatics

Efficient sensing of trace amount nitroaromatic (NAC) explosives has become a major research focus in recent time due to concerns over national security as well as their role as environment pollutants. NO2-containing electron-deficient aromatic compounds, such as picric acid (PA), trinitrotoluene (TNT), and dinitrotoluene (DNT), are the common constituents of many commercially available chemical explosives. In this article, we have summarized our recent developments on the rational design of electron-rich self-assembled discrete molecular sensors and their efficacy in sensing nitroaromatics both in solution as well as in vapor phase. Several p-electron-rich fluorescent metallacycles (squares, rectangles, and tweezers/pincers) and metallacages (trigonal and tetragonal prisms) have been synthesized by means of metal-ligand coordination-bonding interactions, with enough internal space to accommodate electron-deficient nitroaromatics at the molecular level by multiple supramolecular interactions. Such interactions subsequently result in the detectable fluorescence quenching of sensors even in the presence of trace quantities of nitroaromatics. The fascinating sensing characteristics of molecular architectures discussed in this article may enable future development of improved sensors for nitroaromatic explosives.

Voice source characterization using pitch synchronous discrete cosine transform for speaker identification

A characterization of the voice source (VS) signal by the pitch synchronous (PS) discrete cosine transform (DCT) is proposed. With the integrated linear prediction residual (ILPR) as the VS estimate, the PS DCT of the ILPR is evaluated as a feature vector for speaker identification (SID). On TIMIT and YOHO databases, using a Gaussian mixture model (GMM)-based classifier, it performs on par with existing VS-based features. On the NIST 2003 database, fusion with a GMM-based classifier using MFCC features improves the identification accuracy by 12% in absolute terms, proving that the proposed characterization has good promise as a feature for SID studies. (C) 2015 Acoustical Society of America