Low-temperature polaronic relaxations with variable range hopping conductivity in FeTiMO(6) (M = Ta,Nb,Sb)

Low-temperature dielectric measurements on FeTiMO(6) (M = Ta,Nb,Sb) rutile-type oxides at frequencies from 0.1 Hz to 10 MHz revealed anomalous dielectric relaxations with frequency dispersion. Unlike the high-temperature relaxor response of these materials, the low-temperature relaxations are polaronic in nature. The relationship between frequency and temperature of dielectric loss peak follows T(-1/4) behavior. The frequency dependence of ac conductivity shows the well-known universal dielectric response, while the dc conductivity follows Mott variable range hopping (VRH) behavior, confirming the polaronic origin of the observed dielectric relaxations. The frequency domain analysis of the dielectric spectra shows evidence for two relaxations, with the high-frequency relaxations following Mott VRH behavior more closely. Significantly, the Cr- and Ga-based analogs, CrTiNbO(6) and GaTiMO(6) (M = Ta,Nb), that were also studied, did not show these anomalies.

Secure Routing with an Integrated Localized Key Management Protocol in MANETs

A routing protocol in a mobile ad hoc network (MANET) should be secure against both the outside attackers which do not hold valid security credentials and the inside attackers which are the compromised nodes in the network. The outside attackers can be prevented with the help of an efficient key management protocol and cryptography. However, to prevent inside attackers, it should be accompanied with an intrusion detection system (IDS). In this paper, we propose a novel secure routing with an integrated localized key management (SR-LKM) protocol, which is aimed to prevent both inside and outside attackers. The localized key management mechanism is not dependent on any routing protocol. Thus, unlike many other existing schemes, the protocol does not suffer from the key management - secure routing interdependency problem. The key management mechanism is lightweight as it optimizes the use of public key cryptography with the help of a novel neighbor based handshaking and Least Common Multiple (LCM) based broadcast key distribution mechanism. The protocol is storage scalable and its efficiency is confirmed by the results obtained from simulation experiments.

Theoretical foundations for multiple rendezvous of glowworm-inspired mobile agents with variable local-decision domains

We present the theoretical foundations for the multiple rendezvous problem involving design of local control strategies that enable groups of visibility-limited mobile agents to split into subgroups, exhibit simultaneous taxis behavior towards, and eventually rendezvous at, multiple unknown locations of interest. The theoretical results are proved under certain restricted set of assumptions. The algorithm used to solve the above problem is based on a glowworm swarm optimization (GSO) technique, developed earlier, that finds multiple optima of multimodal objective functions. The significant difference between our work and most earlier approaches to agreement problems is the use of a virtual local-decision domain by the agents in order to compute their movements. The range of the virtual domain is adaptive in nature and is bounded above by the maximum sensor/visibility range of the agent. We introduce a new decision domain update rule that enhances the rate of convergence by a factor of approximately two. We use some illustrative simulations to support the algorithmic correctness and theoretical findings of the paper.

Energy-Efficient Decentralized Routing with Localized Cooperation Suitable for Fast Fading

Wireless networks transmit information from a source to a destination via multiple hops in order to save energy and, thus, increase the lifetime of battery-operated nodes. The energy savings can be especially significant in cooperative transmission schemes, where several nodes cooperate during one hop to forward the information to the next node along a route to the destination. Finding the best multi-hop transmission policy in such a network which determines nodes that are involved in each hop, is a very important problem, but also a very difficult one especially when the physical wireless channel behavior is to be accounted for and exploited. We model the above optimization problem for randomly fading channels as a decentralized control problem – the channel observations available at each node define the information structure, while the control policy is defined by the power and phase of the signal transmitted by each node.In particular, we consider the problem of computing an energy-optimal cooperative transmission scheme in a wireless network for two different channel fading models: (i) slow fading channels, where the channel gains of the links remain the same for a large number of transmissions, and (ii) fast fading channels,where the channel gains of the links change quickly from one transmission to another. For slow fading, we consider a factored class of policies (corresponding to local cooperation between nodes), and show that the computation of an optimal policy in this class is equivalent to a shortest path computation on an induced graph, whose edge costs can be computed in a decentralized manner using only locally available channel state information(CSI). For fast fading, both CSI acquisition and data transmission consume energy. Hence, we need to jointly optimize over both these; we cast this optimization problem as a large stochastic optimization problem. We then jointly optimize over a set of CSI functions of the local channel states, and a corresponding factored class of control policies corresponding to local cooperation between nodes with a local outage constraint. The resulting optimal scheme in this class can again be computed efficiently in a decentralized manner. We demonstrate significant energy savings for both slow and fast fading channels through numerical simulations of randomly distributed networks.

Thermoelectric properties of Pb0.75-xMnxSn0.25Te alloys with variable manganese content

Lead tin telluride is one of the well-established thermoelectric materials in the temperature range 350-750 K. In the present study, Pb0.75-xMnxSn0.25Te1.00 alloys with variable manganese (Mn) content were prepared by solid state synthesis and the thermoelectric properties were studied. X-ray diffraction, (XRD) showed that the samples followed Vegard's law, indicating solid solution formation and substitution of Mn at the Pb site. Scanning Electron Microscopy (SEM) showed that the grain sizes varied from <1 mu m to more than 10 mu m and MnTe rich phase was present for higher Mn content. Seebeck coefficient, electrical resistivity and thermal conductivity were measured from room temperature to 720 K. At 300 K, large Seebeck values were obtained, possibly due to increased effective mass on Mn substitution and low carrier concentration of the samples. At higher temperatures, transition from n-type to p-type indicated the presence of thermally generated carriers. Temperature dependent electrical resistivity showed the transition from degenerate to non-degenerate behavior. For thermal conductivity, low values (similar to 1 W/m-K at 300 K) were obtained. At higher temperatures bipolar conduction was observed, in agreement with the Seebeck and resistivity data. Due to low power factor, the maximum thermoelectric figure of merit (zT) was limited to 0.23 at 329 K for the sample with lowest Mn content (x=0.03). (C) 2015 Elsevier Ltd. All rights reserved.

RPRDC: Reliable Proliferation Routing with low Duty-Cycle in Wireless Sensor Networks

Ensuring reliable energy efficient data communication in resource constrained Wireless Sensor Networks (WSNs) is of primary concern. Traditionally, two types of re-transmission have been proposed for the data-loss, namely, End-to-End loss recovery (E2E) and per hop. In these mechanisms, lost packets are re-transmitted from a source node or an intermediate node with a low success rate. The proliferation routing(1) for QoS provisioning in WSNs low End-to-End reliability, not energy efficient and works only for transmissions from sensors to sink. This paper proposes a Reliable Proliferation Routing with low Duty Cycle RPRDC] in WSNs that integrates three core concepts namely, (i) reliable path finder, (ii) a randomized dispersity, and (iii) forwarding. Simulation results demonstrates that packet successful delivery rate can be maintained upto 93% in RPRDC and outperform Proliferation Routing(1). (C) 2015 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).

Aircraft pursuit-evasion problems with variable speeds

Aircraft pursuit-evasion encounters in a plane with variable speeds are analysed as a differential game. An engagement-dependent coordinate system confers open-loop optimality on the game. Each aircraft's optimal motion can be represented by extremel trajectory maps which are independent of role, adversary and capture radius. These maps are used in two different ways to construct the feedback solution. Some examples are given to illustrate these features. The paper draws on earlier results and surveys several existing papers on the subject.

Planar pursuit-evasion with variable speeds, part 1, extremal trajectory maps

Pursuit evasion in a plane is formulated with both players allowed to vary their speeds between fixed limits. A suitable choice of real-space coordinates confers open-loop optimality on the game. The solution in the small is described in terms of the individual players'' extremal trajectory maps (ETM). Each map is independent of role, adversary, and capture radius. An ETM depicts the actual real-space trajectories. A template method of generating constant control arcs is described. Examples of ETM for an aircraft flying at a constant altitude with fixed and varying speeds are presented.

Planar pursuit-evasion with variable speeds, part 2, barrier sections

An iterative method of constructing sections of the game surfaces from the players'' extremal trajectory maps is discussed. Barrier sections are presented for aircraft pursuit-evasion at constant altitude, with one aircraft flying at sustained speed and the other varying its speed.

Popular Matchings with Variable Job Capacities

We consider the problem of matching people to jobs, where each person ranks a subset of jobs in an order of preference, possibly involving ties. There are several notions of optimality about how to best match each person to a job; in particular, popularity is a natural and appealing notion of optimality. However, popular matchings do not always provide an answer to the problem of determining an optimal matching since there are simple instances that do not adroit popular matchings. This motivates the following extension of the popular rnatchings problem:Given a graph G; = (A boolean OR J, E) where A is the set of people and J is the set of jobs, and a list < c(1), c(vertical bar J vertical bar)) denoting upper bounds on the capacities of each job, does there exist (x(1), ... , x(vertical bar J vertical bar)) such that setting the capacity of i-th, job to x(i) where 1 <= x(i) <= c(i), for each i, enables the resulting graph to admit a popular matching. In this paper we show that the above problem is NP-hard. We show that the problem is NP-hard even when each c is 1 or 2.

Resistance fluctuations, phase randomness and noise in one-dimensional conductors with a long-range correlated potential

When the size (L) of a one-dimensional metallic conductor is less than the correlation length λ-1 of the Gaussian random potential, one expects transport properties to show ballistic behaviour. Using an invariant imbedding method, we study the exact distribution of the resistance, of the phase θ of the reflection amplitude of an incident electron of wave number k0, and of dθ/dk0, for λL ll 1. The resistance is non-self-averaging and the n-th resistance moment varies periodically as (1 - cos 2k0L)n. The charge fluctuation noise, determined by the distribution of dθ/dk0, is constant at low frequencies.

K1-xLaxCa2-xNb3O10, a Layered Perovskite Series with Variable Interlayer Cation Density, and LaCaNb3O10, a Novel Layered Perovskite Oxide with No Interlayer Cations

A series of layered perovskite oxides of the formula K1-xLaxCa2-xNb3O10 for 0 < x ≤ 1.0 have been prepared. All the members are isostructural, possessing the structure of KCa2Nb3O10. The interlayer potassium ions in the new series can be ion-exchanged with protons to give H1-xLaxCa2-xNb3O10. The latter readily forms intercalation compounds of the formula (CnH2n+1NH3)1-x LaxCa2-xNb3O10, just as the parent solid acid HCa2Nb3O10. The end member LaCaNb3O10 containing no interlayer cations is a novel layered perovskite oxide, being a n = 3 member of the series An-1BnX3n+1.

Exact-Solutions Of Linear Partial-Differential Equations With Variable-Coefficients

Backlund transformations relating the solutions of linear PDE with variable coefficients to those of PDE with constant coefficients are found, generalizing the study of Varley and Seymour [2]. Auto-Backlund transformations are also determined. To facilitate the generation of new solutions via Backlund transformation, explicit solutions of both classes of the PDE just mentioned are found using invariance properties of these equations and other methods. Some of these solutions are new.

Popular matchings with variable item copies

We consider the problem of matching people to items, where each person ranks a subset of items in an order of preference, possibly involving ties. There are several notions of optimality about how to best match a person to an item; in particular, popularity is a natural and appealing notion of optimality. A matching M* is popular if there is no matching M such that the number of people who prefer M to M* exceeds the number who prefer M* to M. However, popular matchings do not always provide an answer to the problem of determining an optimal matching since there are simple instances that do not admit popular matchings. This motivates the following extension of the popular matchings problem: Given a graph G = (A U 3, E) where A is the set of people and 2 is the set of items, and a list < c(1),...., c(vertical bar B vertical bar)> denoting upper bounds on the number of copies of each item, does there exist < x(1),...., x(vertical bar B vertical bar)> such that for each i, having x(i) copies of the i-th item, where 1 <= xi <= c(i), enables the resulting graph to admit a popular matching? In this paper we show that the above problem is NP-hard. We show that the problem is NP-hard even when each c(i) is 1 or 2. We show a polynomial time algorithm for a variant of the above problem where the total increase in copies is bounded by an integer k. (C) 2011 Elsevier B.V. All rights reserved.