Popular Mixed Matchings

We study the problem of matching applicants to jobs under one-sided preferences: that is, each applicant ranks a non-empty subset of jobs under an order of preference, possibly involving ties. A matching M is said to be rnore popular than T if the applicants that prefer M to T outnumber those that prefer T to M. A matching is said to be popular if there is no matching more popular than it. Equivalently, a matching M is popular if phi(M,T) >= phi(T, M) for all matchings T, where phi(X, Y) is the number of applicants that prefer X to Y. Previously studied solution concepts based oil the popularity criterion are either not guaranteed to exist for every instance (e.g., popular matchings) or are NP-hard to compute (e.g., least unpopular matchings). This paper addresses this issue by considering mixed matchings. A mixed matching is simply a probability distributions over matchings in the input graph. The function phi that compares two matchings generalizes in a natural manner to mixed matchings by taking expectation. A mixed matching P is popular if phi(P,Q) >= phi(Q,P) for all mixed matchings Q. We show that popular mixed matchings always exist. and we design polynomial time algorithms for finding them. Then we study their efficiency and give tight bounds on the price of anarchy and price of stability of the popular matching problem.

A new mixed-matrix membrane for DMFCs

A new mixed-matrix membrane based on stabilized phosphotungstic acid (PTA) incorporated to chitosan (CS)-hydroxy ethyl cellulose (HEC) for application in direct methanol fuel cells (DMFCs) is reported. Membranes are characterised using Fourier Transform Spectroscopy (FTIR), Thermo-Gravimetric Analysis (TGA), Scanning Electron Microscopy (SEM) and their mechanical properties are evaluated. The PTA content in the CS-HEC blend and its influence on proton conductivity, water/methanol sorption, and methanol cross-over in the DMFC is studied. The DMFC with 3 wt. % stabilized PTA-CS-HEC mixed-matrix membrane delivers peak power-density of 58 mW/cm(2) at a load current-density of 210 mA/cm(2) with a lower methanol cross-over than that observed for a DMFC operating with a Nafion membrane electrolyte.

Mixed mode (I and II) crack tip fields in bulk metallic glasses

Stationary crack tip fields in bulk metallic glasses under mixed mode (I and II) loading are studied through detailed finite element simulations assuming plane strain, small scale yielding conditions. The influence of internal friction or pressure sensitivity on the plastic zones. notch deformation, stress and plastic strain fields is examined for different mode mixities. Under mixed mode loading, the notch deforms into a shape such that one part of its surface sharpens while the other part blunts. Increase in mode If component of loading dramatically enhances the normalized plastic zone size, lowers the stresses but significantly elevates the plastic strain levels near the notch tip. Higher internal friction reduces the peak tangential stress but increases the plastic strain and stretching near the blunted part of the notch. The simulated shear bands are straight and extend over a long distance ahead of the notch tip under mode II dominant loading. The possible variations of fracture toughness with mode mixity corresponding to failure by brittle micro-cracking and ductile shear banding are predicted employing two simple fracture criteria. The salient results from finite element simulations are validated by comparison with those from mixed mode (I and II) fracture experiments on a Zr-based bulk metallic glass.

An FETI-preconditioned conjuerate gradient method for large-scale stochastic finite element problems

In the spectral stochastic finite element method for analyzing an uncertain system. the uncertainty is represented by a set of random variables, and a quantity of Interest such as the system response is considered as a function of these random variables Consequently, the underlying Galerkin projection yields a block system of deterministic equations where the blocks are sparse but coupled. The solution of this algebraic system of equations becomes rapidly challenging when the size of the physical system and/or the level of uncertainty is increased This paper addresses this challenge by presenting a preconditioned conjugate gradient method for such block systems where the preconditioning step is based on the dual-primal finite element tearing and interconnecting method equipped with a Krylov subspace reusage technique for accelerating the iterative solution of systems with multiple and repeated right-hand sides. Preliminary performance results on a Linux Cluster suggest that the proposed Solution method is numerically scalable and demonstrate its potential for making the uncertainty quantification Of realistic systems tractable.

Pseudo-time marching schemes for inverse problems in structural health assessment and medical imaging

We propose a self-regularized pseudo-time marching strategy for ill-posed, nonlinear inverse problems involving recovery of system parameters given partial and noisy measurements of system response. While various regularized Newton methods are popularly employed to solve these problems, resulting solutions are known to sensitively depend upon the noise intensity in the data and on regularization parameters, an optimal choice for which remains a tricky issue. Through limited numerical experiments on a couple of parameter re-construction problems, one involving the identification of a truss bridge and the other related to imaging soft-tissue organs for early detection of cancer, we demonstrate the superior features of the pseudo-time marching schemes.

Steady mixed convection stagnation-point flow of upper convected Maxwell fluids with magnetic field

The steady MHD mixed convection flow of a viscoelastic fluid in the vicinity of two-dimensional stagnation point with magnetic field has been investigated under the assumption that the fluid obeys the upper-convected Maxwell (UCM) model. Boundary layer theory is used to simplify the equations of motion. induced magnetic field and energy which results in three coupled non-linear ordinary differential equations which are well-posed. These equations have been solved by using finite difference method. The results indicate the reduction in the surface velocity gradient, surface heat transfer and displacement thickness with the increase in the elasticity number. These trends are opposite to those reported in the literature for a second-grade fluid. The surface velocity gradient and heat transfer are enhanced by the magnetic and buoyancy parameters. The surface heat transfer increases with the Prandtl number, but the surface velocity gradient decreases.

Co(II) and Cr(III) complexes of formate-formamide mixed ligands: synthesis, structures, single crystal-to-single crystal transformation and magnetic behaviour

Solvothermal treatment of an equimolar mixture of Co(NO3)(2)center dot 6H(2)O, HCONH2 and NaN3 in MeOH at 100 degrees C yielded a three-dimensional NaCl type network Co(HCOO)(2)(HCONH2)(2) center dot HCONH2 (1a) containing formamides in the pores of the structure. Solvated pink 1a undergoes single crystal-to-single crystal (SCSC) transformation at 215 degrees C to form the desolvated dark brown product Co(HCOO)(2)-( HCONH2)(2) (1b) with the retention of the original framework. Reversible single crystal-to-single crystal transformation of 1b (brown) to 1a (pink) in the presence of excess formamide was also established at room temperature. The coordination environment around Co(II) in both 1a and 1b is octahedral with a CoN2O4 coordination composition. A similar reaction replacing Co(II) by Cr(III) produced a heterometallic 3D extended network Na[Cr(HCOO)(4)(HCONH2)(2)]center dot 2H(2)O (2a) at 100 degrees C. An increase in reaction temperature to 150 degrees C produced a simple mononuclear complex Cr(HCOO)(3)(HCONH2)(3) center dot 3H(2)O (2b). Variable temperature magnetic studies revealed the presence of a canting phenomena in both 1a and 1b, and hysteresis loop in the field dependent magnetisation plot at 2 K whereas complex 2a is simply paramagnetic in nature.

Problems and prospects in neurochemistry

The importance of neurochemistry in understanding the functional basis of the nervous system was emphasized. Attention was drawn to the role of lipids, particularly the sphingolipids,whose metabolic abnormalities lead to 'sphingolipidosis' In the brain and to gangliosides, which show growth-promoting and neuritogenic properties. Several questions that remain to be answered in this area were enumerated. It was pointed out that neurons make a large number of proteins, an order of magnitude higher than other cells, and several of these are yet to be characterized and their functional significance established. Myelination and synapto-genesis are two fundamental processes in brain development. Although much is known about myelin lipids and proteins, it is not known what signals the glial cell receives to initiate myelin synthesis around the axon, In fact, the process of myelination provides an excellent system for studying membrane biogenesis and cell-sell interaction. Great strides were made in the understanding of neurotransmitter receptors and their function in synaptic transmission, but how neurons make synapses with other specific neurons in a preprogrammed manner is not known and requires immediate study. In this context, it was stressed that developmental neurobiology of the human brain could be most profitably done in India. The importance and complexity of signal transduction mechanisms in the brain was explained and many fundamental questions that remain to be answered were discussed. In conclusion, several other areas of contemporary research interest in the nervous system were mentioned and it was suggested that a 'National Committee for Brain Research' be constituted to identify and intensify research programmes in this vital field.

Multi-channel curve crossing problems: analytically solvable model

We have proposed a general method for finding the exact analytical solution for the multi-channel curve crossing problem in the presence of delta function couplings. We have analysed the case where aa potential energy curve couples to a continuum (in energy) of the potential energy curves.

Shortcomings of discontinuous-pressure finite element methods on a class of transient problems

Past studies that have compared LBB stable discontinuous- and continuous-pressure finite element formulations on a variety of problems have concluded that both methods yield Solutions of comparable accuracy, and that the choice of interpolation is dictated by which of the two is more efficient. In this work, we show that using discontinuous-pressure interpolations can yield inaccurate solutions at large times on a class of transient problems, while the continuous-pressure formulation yields solutions that are in good agreement with the analytical Solution.

Agents Based Algorithms for Design Parameter Estimation in Contaminant Transport Inverse Problems

A considerable amount of work has been dedicated on the development of analytical solutions for flow of chemical contaminants through soils. Most of the analytical solutions for complex transport problems are closed-form series solutions. The convergence of these solutions depends on the eigen values obtained from a corresponding transcendental equation. Thus, the difficulty in obtaining exact solutions from analytical models encourages the use of numerical solutions for the parameter estimation even though, the later models are computationally expensive. In this paper a combination of two swarm intelligence based algorithms are used for accurate estimation of design transport parameters from the closed-form analytical solutions. Estimation of eigen values from a transcendental equation is treated as a multimodal discontinuous function optimization problem. The eigen values are estimated using an algorithm derived based on glowworm swarm strategy. Parameter estimation of the inverse problem is handled using standard PSO algorithm. Integration of these two algorithms enables an accurate estimation of design parameters using closed-form analytical solutions. The present solver is applied to a real world inverse problem in environmental engineering. The inverse model based on swarm intelligence techniques is validated and the accuracy in parameter estimation is shown. The proposed solver quickly estimates the design parameters with a great precision.

Why do birds participate in mixed-species foraging flocks? A large-scale synthesis

Mixed-species flocks of foraging birds have been documented from terrestrial habitats all over the world and are thought to form for either improved feeding efficiency or better protection from predators. Two kinds of flock participants are recognized: those that join other species ('followers') and are therefore likely to be the recipients of the benefits of flock participation and those that are joined ('leaders'). Through comparative analyses, using a large sample of flocks from around the world, we show that (1) 'followers' tend to be smaller, more insectivorous, and feed in higher strata than matched species that participate in flocks to a lesser extent and (2) 'leaders' tend to be cooperative breeders more often than matched species that are not known to lead flocks. Furthermore, meta-analyses of published results from across the world showed that bird species in terrestrial mixed-species flocks increase foraging rates and reduce vigilance compared to when they are solitary or in conspecific groups. Moreover, the increase in foraging rates is seen only with flock followers and not flock leaders. These findings suggest a role for predation in the evolution of mixed-species flocking. Species that are vulnerable to predation follow species whose vigilance they can exploit. By doing so, they are able to reduce their own vigilance and forage at higher rates. (C) 2009 The Association for the Study of Animal Behaviour. Published by Elsevier Ltd. All rights reserved.

Linear time algorithms for Abelian group isomorphism and related problems

We consider the problem of determining if two finite groups are isomorphic. The groups are assumed to be represented by their multiplication tables. We present an O(n) algorithm that determines if two Abelian groups with n elements each are isomorphic. This improves upon the previous upper bound of O(n log n) [Narayan Vikas, An O(n) algorithm for Abelian p-group isomorphism and an O(n log n) algorithm for Abelian group isomorphism, J. Comput. System Sci. 53 (1996) 1-9] known for this problem. We solve a more general problem of computing the orders of all the elements of any group (not necessarily Abelian) of size n in O(n) time. Our algorithm for isomorphism testing of Abelian groups follows from this result. We use the property that our order finding algorithm works for any group to design a simple O(n) algorithm for testing whether a group of size n, described by its multiplication table, is nilpotent. We also give an O(n) algorithm for determining if a group of size n, described by its multiplication table, is Abelian. (C) 2007 Elsevier Inc. All rights reserved.

Isoperimetric Problem and Meta-fibonacci Sequences

Let G = (V,E) be a simple, finite, undirected graph. For S ⊆ V, let $\delta(S,G) = \{ (u,v) \in E : u \in S \mbox { and } v \in V-S \}$ and $\phi(S,G) = \{ v \in V -S: \exists u \in S$ , such that (u,v) ∈ E} be the edge and vertex boundary of S, respectively. Given an integer i, 1 ≤ i ≤ ∣ V ∣, the edge and vertex isoperimetric value at i is defined as b e (i,G) =  min S ⊆ V; |S| = i |δ(S,G)| and b v (i,G) =  min S ⊆ V; |S| = i |φ(S,G)|, respectively. The edge (vertex) isoperimetric problem is to determine the value of b e (i, G) (b v (i, G)) for each i, 1 ≤ i ≤ |V|. If we have the further restriction that the set S should induce a connected subgraph of G, then the corresponding variation of the isoperimetric problem is known as the connected isoperimetric problem. The connected edge (vertex) isoperimetric values are defined in a corresponding way. It turns out that the connected edge isoperimetric and the connected vertex isoperimetric values are equal at each i, 1 ≤ i ≤ |V|, if G is a tree. Therefore we use the notation b c (i, T) to denote the connected edge (vertex) isoperimetric value of T at i. Hofstadter had introduced the interesting concept of meta-fibonacci sequences in his famous book “Gödel, Escher, Bach. An Eternal Golden Braid”. The sequence he introduced is known as the Hofstadter sequences and most of the problems he raised regarding this sequence is still open. Since then mathematicians studied many other closely related meta-fibonacci sequences such as Tanny sequences, Conway sequences, Conolly sequences etc. Let T 2 be an infinite complete binary tree. In this paper we related the connected isoperimetric problem on T 2 with the Tanny sequences which is defined by the recurrence relation a(i) = a(i − 1 − a(i − 1)) + a(i − 2 − a(i − 2)), a(0) = a(1) = a(2) = 1. In particular, we show that b c (i, T 2) = i + 2 − 2a(i), for each i ≥ 1. We also propose efficient polynomial time algorithms to find vertex isoperimetric values at i of bounded pathwidth and bounded treewidth graphs.

Novel window functions for digital filters

Window technique is one of the simplest methods to design Finite Impulse Response (FIR) filters. It uses special functions to truncate an infinite sequence to a finite one. In this paper, we propose window techniques based on integer sequences. The striking feature of the proposed work is that it overcomes all the problems posed by floating point numbers and inaccuracy, as the sequences are made of only integers. Some of these integer window sequences, yield sharp transition, while some of them result in zero ripple in passband and stopband.