A comparative study of dragonfly inspired flapping wings actuated by single crystal piezoceramic

A dragonfly inspired flapping wing is investigated in this paper. The flapping wing is actuated from the root by a PZT-5H and PZN-7%PT single crystal unimorph in the piezofan configuration. The nonlinear governing equations of motion of the smart flapping wing are obtained using the Hamilton's principle. These equations are then discretized using the Galerkin method and solved using the method of multiple scales. Dynamic characteristics of smart flapping wings having the same size as the actual wings of three different dragonfly species Aeshna Multicolor, Anax Parthenope Julius and Sympetrum Frequens are analyzed using numerical simulations. An unsteady aerodynamic model is used to obtain the aerodynamic forces. Finally, a comparative study of performances of three piezoelectrically actuated flapping wings is performed. The numerical results in this paper show that use of PZN-7%PT single crystal piezoceramic can lead to considerable amount of wing weight reduction and increase of lift and thrust force compared to PZT-5H material. It is also shown that dragonfly inspired smart flapping wings actuated by single crystal piezoceramic are a viable contender for insect scale flapping wing micro air vehicles.

Temporal Logics of Repeating Values

Various logical formalisms with the freeze quantifier have been recently considered to model computer systems even though this is a powerful mechanism that often leads to undecidability. In this article, we study a linear-time temporal logic with past-time operators such that the freeze operator is only used to express that some value from an infinite set is repeated in the future or in the past. Such a restriction has been inspired by a recent work on spatio-temporal logics that suggests such a restricted use of the freeze operator. We show decidability of finitary and infinitary satisfiability by reduction into the verification of temporal properties in Petri nets by proposing a symbolic representation of models. This is a quite surprising result in view of the expressive power of the logic since the logic is closed under negation, contains future-time and past-time temporal operators and can express the nonce property and its negation. These ingredients are known to lead to undecidability with a more liberal use of the freeze quantifier. The article also contains developments about the relationships between temporal logics with the freeze operator and counter automata as well as reductions into first-order logics over data words.

Use of Fick's law and Maxwell–Stefan equations in computation of multicomponent diffusion

This article does not have an abstract.

A finite population model of mlecular evolution: theory and computation

This article is concerned with the evolution of haploid organisms that reproduce asexually. In a seminal piece of work, Eigen and coauthors proposed the quasispecies model in an attempt to understand such an evolutionary process. Their work has impacted antiviral treatment and vaccine design strategies. Yet, predictions of the quasispecies model are at best viewed as a guideline, primarily because it assumes an infinite population size, whereas realistic population sizes can be quite small. In this paper we consider a population genetics-based model aimed at understanding the evolution of such organisms with finite population sizes and present a rigorous study of the convergence and computational issues that arise therein. Our first result is structural and shows that, at any time during the evolution, as the population size tends to infinity, the distribution of genomes predicted by our model converges to that predicted by the quasispecies model. This justifies the continued use of the quasispecies model to derive guidelines for intervention. While the stationary state in the quasispecies model is readily obtained, due to the explosion of the state space in our model, exact computations are prohibitive. Our second set of results are computational in nature and address this issue. We derive conditions on the parameters of evolution under which our stochastic model mixes rapidly. Further, for a class of widely used fitness landscapes we give a fast deterministic algorithm which computes the stationary distribution of our model. These computational tools are expected to serve as a framework for the modeling of strategies for the deployment of mutagenic drugs.

Status of supersymmetric type-I seesaw in SO(10) inspired models

We report on the status of supersymmetric seesaw models in the light of recent experimental results on mu -> e + gamma, theta(13) and the light Higgs mass at the LHC. SO(10)-like relations are assumed for neutrino Dirac Yukawa couplings and two cases of mixing, one large, PMNS-like, and another small, CKM-like, are considered. It is shown that for the large mixing case, only a small range of parameter space with moderate tan beta is still allowed. This remaining region can be ruled out by an order of magnitude improvement in the current limit on BR(mu -> e + gamma). We also explore a model with non-universal Higgs mass boundary conditions at the high scale. It is shown that the renormalization group induced flavor violating slepton mass terms are highly sensitive to the Higgs boundary conditions. Depending on the choice of the parameters, they can either lead to strong enhancements or cancellations within the flavor violating terms. Such cancellations might relax the severe constraints imposed by lepton flavor violation compared to mSUGRA. Nevertheless for a large region of parameter space the predicted rates lie within the reach of future experiments once the light Higgs mass constraint is imposed. We also update the potential of the ongoing and future experimental searches for lepton flavor violation in constraining the supersymmetric parameter space.

Secure Computation in a Bidirectional Relay

Bidirectional relaying, where a relay helps two user nodes to exchange equal length binary messages, has been an active area of recent research. A popular strategy involves a modified Gaussian MAC, where the relay decodes the XOR of the two messages using the naturally-occurring sum of symbols simultaneously transmitted by user nodes. In this work, we consider the Gaussian MAC in bidirectional relaying with an additional secrecy constraint for protection against a honest but curious relay. The constraint is that, while the relay should decode the XOR, it should be fully ignorant of the individual messages of the users. We exploit the symbol addition that occurs in a Gaussian MAC to design explicit strategies that achieve perfect independence between the received symbols and individual transmitted messages. Our results actually hold for a more general scenario where the messages at the two user nodes come from a finite Abelian group G, and the relay must decode the sum within G of the two messages. We provide a lattice coding strategy and study optimal rate versus average power trade-offs for asymptotically large dimensions.

Fast Likelihood Computation in Speech Recognition using Matrices

Acoustic modeling using mixtures of multivariate Gaussians is the prevalent approach for many speech processing problems. Computing likelihoods against a large set of Gaussians is required as a part of many speech processing systems and it is the computationally dominant phase for Large Vocabulary Continuous Speech Recognition (LVCSR) systems. We express the likelihood computation as a multiplication of matrices representing augmented feature vectors and Gaussian parameters. The computational gain of this approach over traditional methods is by exploiting the structure of these matrices and efficient implementation of their multiplication. In particular, we explore direct low-rank approximation of the Gaussian parameter matrix and indirect derivation of low-rank factors of the Gaussian parameter matrix by optimum approximation of the likelihood matrix. We show that both the methods lead to similar speedups but the latter leads to far lesser impact on the recognition accuracy. Experiments on 1,138 work vocabulary RM1 task and 6,224 word vocabulary TIMIT task using Sphinx 3.7 system show that, for a typical case the matrix multiplication based approach leads to overall speedup of 46 % on RM1 task and 115 % for TIMIT task. Our low-rank approximation methods provide a way for trading off recognition accuracy for a further increase in computational performance extending overall speedups up to 61 % for RM1 and 119 % for TIMIT for an increase of word error rate (WER) from 3.2 to 3.5 % for RM1 and for no increase in WER for TIMIT. We also express pairwise Euclidean distance computation phase in Dynamic Time Warping (DTW) in terms of matrix multiplication leading to saving of approximately of computational operations. In our experiments using efficient implementation of matrix multiplication, this leads to a speedup of 5.6 in computing the pairwise Euclidean distances and overall speedup up to 3.25 for DTW.

A Savitzky-Golay Filtering Perspective of Dynamic Feature Computation

We address the classical problem of delta feature computation, and interpret the operation involved in terms of Savitzky- Golay (SG) filtering. Features such as themel-frequency cepstral coefficients (MFCCs), obtained based on short-time spectra of the speech signal, are commonly used in speech recognition tasks. In order to incorporate the dynamics of speech, auxiliary delta and delta-delta features, which are computed as temporal derivatives of the original features, are used. Typically, the delta features are computed in a smooth fashion using local least-squares (LS) polynomial fitting on each feature vector component trajectory. In the light of the original work of Savitzky and Golay, and a recent article by Schafer in IEEE Signal Processing Magazine, we interpret the dynamic feature vector computation for arbitrary derivative orders as SG filtering with a fixed impulse response. This filtering equivalence brings in significantly lower latency with no loss in accuracy, as validated by results on a TIMIT phoneme recognition task. The SG filters involved in dynamic parameter computation can be viewed as modulation filters, proposed by Hermansky.

Fast acoustic likelihood computation using low-rank matrix approximation

Acoustic modeling using mixtures of multivariate Gaussians is the prevalent approach for many speech processing problems. Computing likelihoods against a large set of Gaussians is required as a part of many speech processing systems and it is the computationally dominant phase for LVCSR systems. We express the likelihood computation as a multiplication of matrices representing augmented feature vectors and Gaussian parameters. The computational gain of this approach over traditional methods is by exploiting the structure of these matrices and efficient implementation of their multiplication.In particular, we explore direct low-rank approximation of the Gaussian parameter matrix and indirect derivation of low-rank factors of the Gaussian parameter matrix by optimum approximation of the likelihood matrix. We show that both the methods lead to similar speedups but the latter leads to far lesser impact on the recognition accuracy. Experiments on a 1138 word vocabulary RM1 task using Sphinx 3.7 system show that, for a typical case the matrix multiplication approach leads to overall speedup of 46%. Both the low-rank approximation methods increase the speedup to around 60%, with the former method increasing the word error rate (WER) from 3.2% to 6.6%, while the latter increases the WER from 3.2% to 3.5%.

A nested linear codes approach to distributed function computation over subspaces

In this paper, we consider a distributed function computation setting, where there are m distributed but correlated sources X1,...,Xm and a receiver interested in computing an s-dimensional subspace generated by [X1,...,Xm]Γ for some (m × s) matrix Γ of rank s. We construct a scheme based on nested linear codes and characterize the achievable rates obtained using the scheme. The proposed nested-linear-code approach performs at least as well as the Slepian-Wolf scheme in terms of sum-rate performance for all subspaces and source distributions. In addition, for a large class of distributions and subspaces, the scheme improves upon the Slepian-Wolf approach. The nested-linear-code scheme may be viewed as uniting under a common framework, both the Korner-Marton approach of using a common linear encoder as well as the Slepian-Wolf approach of employing different encoders at each source. Along the way, we prove an interesting and fundamental structural result on the nature of subspaces of an m-dimensional vector space V with respect to a normalized measure of entropy. Here, each element in V corresponds to a distinct linear combination of a set {Xi}im=1 of m random variables whose joint probability distribution function is given.

AN EXPERIMENTAL STUDY ON EFFERVESCENT ATOMIZATION OF BIO-OIL FUELS

This paper presents the work on detailed characterization of effervescent spray of Jatropha and Pongamia pure plant oils. The spray characteristics of these biofuels are compared with those of diesel. Both macroscopic and microscopic spray characteristics at different injection pressures and gas-to-liquid ratio (GLR) have been studied. The particle/droplet imaging analysis (PDIA) technique along with direct imaging methods are used for the purpose of spray characterization. Due to their higher viscosity, pure plant oils showed poor atomization compared to diesel and a blend of diesel and pure plant oil at a given GLR. Pure plant oil sprays showed a lower spray cone angle when compared to diesel and blends at lower GLRs. However, the difference is not significant at higher GLRs. Droplet size measurements at 100 mm downstream of the exit orifice showed reduction in Sauter mean diameter (SMD) diameter with increase in GLR. A radial variation in the SMD is observed for the blend and pure plant oils. Pure oils showed a larger variation when compared to the blend. Spray unsteadiness has been characterized based on the image-to-image variation in the mean droplet diameter and fluctuations in the spray cone angle. Results showed that pure plant oil sprays are more unsteady at lower GLRs when compared to diesel and blend. A critical GLR is identified at which the spray becomes steady. The three regimes of spray operation, namely ``steady spray,'' ``pulsating spray,'' and ``spray and unbroken liquid jet'' are identified in the injection pressure-GLR parameter space for these pure plant oils. Two-phase flow imaging inside the exit orifice shows that for the pure plant oils, the flow is highly transient at low GLRs and the bubbly, slug, and annular two-phase flow regimes are all observed. However, at higher GLRs where the spray is steady, only the annular flow regime is observed.

Fish inspired biomimetic ionic polymer metal composite pectoral fins using labriform propulsion

Ionic polymer metal composites (IPMC) are a new class of smart materials that have attractive characteristics such as muscle like softness, low voltage and power consumption, and good performance in aqueous environments. Thus, IPMC’s provide promising application for biomimetic fish like propulsion systems. In this paper, we design and analyze IPMC underwater propulsor inspired from swimming of Labriform fishes. Different fish species in nature are source of inspiration for different biomimetic flapping IPMC fin design. Here, three fish species with high performance flapping pectoral fin locomotion is chosen and performance analysis of each fin design is done to discover the better configurations for engineering applications. In order to describe the behavior of an active IPMC fin actuator in water, a complex hydrodynamic function is used and structural model of the IPMC fin is obtained by modifying the classical dynamic equation for a slender beam. A quasi-steady blade element model that accounts for unsteady phenomena such as added mass effects, dynamic stall, and the cumulative Wagner effect is used to estimate the hydrodynamic performance of the flapping rectangular shape fin. Dynamic characteristics of IPMC actuated flapping fins having the same size as the actual fins of three different fish species, Gomphosus varius, Scarus frenatus and Sthethojulis trilineata, are analyzed with numerical simulations. Finally, a comparative study is performed to analyze the performance of three different biomimetic IPMC flapping pectoral fins.

Nonlinear dynamic analysis of dragonfly inspired piezoelectrically driven flapping and pitching wing

The nonlinear equations for coupled elastic flapping-twisting motion of a dragonfly in- spired smart flapping wing are used for a flapping wing actuated from the root by a PZT unimorph in the piezofan configuration. Excitation by the piezoelectric harmonic force generates only the flap bending motion, which in turn, induces the elastic twist motion due to interaction between flexural and torsional vibrations modes. An unsteady aerodynamic model is used to obtain the aerodynamic forces. Numerical simulations are performed using a wing whose size is the same as the dragonfly Sympetrum Frequens wing. It is found that the value of average lift reaches to its maximum when the smart flapping wing is excited at a frequency closer to the natural frequency in torsion. Moreover, consideration of the elastic twisting of flapping wing leads to an increase in the lift force. It is also found that the flapping wing generates sufficient lift to support its own weight and carry a small pay- load. Therefore, the piezoelectrically actuated smart flapping wing based on the geometry of Sympetrum Frequens wing and undergoing flapping-twisting motions may be considered as a potential candidate for use in MAV applications.

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.