Effect of equal channel angular pressing on grain refinement and texture evolution in a biomedical alloy Ti-13Nb-13Zr

Evolution of texture and concomitant grain refinement during Equal Channel Angular Pressing (ECAP) of Ti - 13Nb - 13Zr alloy has been presented. Sub-micron sized equiaxed grains with narrow grain size distribution could be achieved after eight pass at 873 K. A characteristic ECAP texture evolved in alpha phase till four passes while the evolution of characteristic ECAP texture in the beta phase could be observed only beyond the fourth pass. On increasing the deformation up to eight passes, the texture in alpha phase weakens while the beta phase shows an ideal ECAP texture. A weaker texture, low dislocation density and high crystallite size values in alpha phase suggest the occurrence of dynamic recrystallization. The absence of texture evolution in beta phase till four passes can be attributed to local lattice rotations. The characteristic ECAP texture in the eight pass deformed sample is attributed to delayed dynamic recrystallization in the beta phase. (C) 2013 Elsevier Inc. All rights reserved.

A transform approach to linear network coding for acyclic networks with delay

The algebraic formulation for linear network coding in acyclic networks with each link having an integer delay is well known. Based on this formulation, for a given set of connections over an arbitrary acyclic network with integer delay assumed for the links, the output symbols at the sink nodes at any given time instant is a Fq-linear combination of the input symbols across different generations, where Fq denotes the field over which the network operates. We use finite-field discrete Fourier transform (DFT) to convert the output symbols at the sink nodes at any given time instant into a Fq-linear combination of the input symbols generated during the same generation. We call this as transforming the acyclic network with delay into n-instantaneous networks (n is sufficiently large). We show that under certain conditions, there exists a network code satisfying sink demands in the usual (non-transform) approach if and only if there exists a network code satisfying sink demands in the transform approach. Furthermore, assuming time invariant local encoding kernels, we show that the transform method can be employed to achieve half the rate corresponding to the individual source-destination mincut (which are assumed to be equal to 1) for some classes of three-source three-destination multiple unicast network with delays using alignment strategies when the zero-interference condition is not satisfied.

On interference alignment for symmetrically connected interference networks with line of sight channels at finite powers

In this work, interference alignment for a class of Gaussian interference networks with general message demands, having line of sight (LOS) channels, at finite powers is considered. We assume that each transmitter has one independent message to be transmitted and the propagation delays are uniformly distributed between 0 and (L - 1) (L >; 0). If receiver-j, j ∈{1,2,..., J}, requires the message of transmitter-i, i ∈ {1, 2, ..., K}, we say (i, j) belongs to a connection. A class of interference networks called the symmetrically connected interference network is defined as a network where, the number of connections required at each transmitter-i is equal to ct for all i and the number of connections required at each receiver-j is equal to cr for all j, for some fixed positive integers ct and cr. For such networks with a LOS channel between every transmitter and every receiver, we show that an expected sum-spectral efficiency (in bits/sec/Hz) of at least K/(e+c1-1)(ct+1) (ct/ct+1)ct log2 (1+min(i, j)∈c|hi, j|2 P/WN0) can be achieved as the number of transmitters and receivers tend to infinity, i.e., K, J →∞ where, C denotes the set of all connections, hij is the channel gain between transmitter-i and receiver-j, P is the average power constraint at each transmitter, W is the bandwidth and N0 W is the variance of Gaussian noise at each receiver. This means that, for an LOS symmetrically connected interference network, at any finite power, the total spectral efficiency can grow linearly with K as K, J →∞. This is achieved by extending the time domain interference alignment scheme proposed by Grokop et al. for the k-user Gaussian interference channel to interference networks.

Achievable rate region of gaussian broadcast channel with finite input alphabet and quantized output

In this paper, we study the achievable rate region of two-user Gaussian broadcast channel (GBC) when the messages to be transmitted to both the users take values from finite signal sets and the received signal is quantized at both the users. We refer to this channel as quantized broadcast channel (QBC). We first observe that the capacity region defined for a GBC does not carry over as such to QBC. Also, we show that the optimal decoding scheme for GBC (i.e., high SNR user doing successive decoding and low SNR user decoding its message alone) is not optimal for QBC. We then propose an achievable rate region for QBC based on two different schemes. We present achievable rate region results for the case of uniform quantization at the receivers. We find that rotation of one of the user's input alphabet with respect to the other user's alphabet marginally enlarges the achievable rate region of QBC when almost equal powers are allotted to both the users.

CFD Analysis of two phase flow with a prediction of torque demand of a Bi-lobe rotor of a mixing chamber

An attempt to study the fluid dynamic behavior of two phase flow comprising of solid and liquid with nearly equal density in a geometrical case that has an industrial significance in theareas like processing of polymers, food, pharma ceutical, paints. In this work,crystalline silica is considered as the dispersed medium in glycerin. In the CFD analysis carried out,the two phase components are considered to be premixed homogeneously at the initial state. The flow in a cylinder that has an axially driven bi-lobe rotor, a typical blender used in polymer industry for mixing or kneading to render the multi-component mixture to homogeneous condition is considered. A viscous, incompressible, isothermal flow is considered with an assumption that the components do not undergo any physical change and the solids are rigid and mix in fully wetting conditions. Silica with a particle diameter of 0.4 mm is considered and flow is analyzed for different mixing fractions. An industry standard CFD code is used for solving 3D-RANS equations. As the outcome of the study the torque demand by the bi-lobe rotor for different mixture fractions which are estimated show a behavioral consistency to the expected physical phenomena occurring in the domain considered.

Vertical uplift resistance of two horizontal strip anchors with common vertical axis

With an application of the upper bound finite element limit analysis, the vertical pullout capacity of a group of two horizontal strip plate anchors, with the common vertical axis and placed in a cohesive-frictional soil, has been computed. The variation of the uplift factors Fc, Fq and Fy, due to the contributions of soil cohesion, surcharge pressure and unit weight, respectively, has been evaluated for different combinations of S/B and H/B. As compared to single isolated anchor, the group of two anchors generates significantly greater magnitude of Fc for Φ ≤ 20° especially with greater values of H/B and under fully bonded anchor-soil interface condition. The factor Fc attains almost the maximum value when the upper anchor plate is placed midway between ground surface and the lower anchor plate. The factors Fq and Fy, on the other hand, for a group of two anchors are found to remain almost equal to that of a single isolated anchor as long as the levels of the lower plate in the group and the single isolated anchor are kept the same.

Non-existence of tight neighborly triangulated manifolds with beta(1)=2

All triangulated d-manifolds satisfy the inequality ((f0-d-1)(2)) >= ((d+2)(2))beta(1) for d >= 3. A triangulated d-manifold is called tight neighborly if it attains equality in this bound. For each d >= 3, a (2d + 3)-vertex tight neighborly triangulation of the Sd-1-bundle over S-1 with beta(1) = 1 was constructed by Kuhnel in 1986. In this paper, it is shown that there does not exist a tight neighborly triangulated manifold with beta(1) = 2. In other words, there is no tight neighborly triangulation of (Sd-1 x S-1)(#2) or (Sd-1 (sic) S-1)(#2) for d >= 3. A short proof of the uniqueness of K hnel's complexes for d >= 4 under the assumption beta(1) not equal 0 is also presented.

Optical properties of an inhomogeneously broadened Lambda V-system with multiple excited states

We present a theoretical model using a density matrix approach to show the influence of multiple excited states on the optical properties of an inhomogeneously broadened Lambda V-system of the Rb-87 D2 line. These closely spaced multiple excited states cause asymmetry in absorption and dispersion profiles. We observe the reduced absorption profiles, due to dressed state interactions of the applied electromagnetic fields, which results the Mollow sideband-like transparency windows. In a room temperature vapor, we obtain a narrow enhanced absorption and steep positive dispersion at the line center when the strengths of control and pump fields are equal. Here, we show how the probe transmittance varies when it passes through the atomic medium. We also discuss the transient behavior of our system which agrees well with the corresponding absorption and dispersion profiles. This study has potential applications in controllability of group velocity, and for optical and quantum information processing.

Precoding-Based Network Alignment Using Transform Approach for Acyclic Networks With Delay

The algebraic formulation for linear network coding in acyclic networks with the links having integer delay is well known. Based on this formulation, for a given set of connections over an arbitrary acyclic network with integer delay assumed for the links, the output symbols at the sink nodes, at any given time instant, is a F(p)m-linear combination of the input symbols across different generations, where F(p)m denotes the field over which the network operates (p is prime and m is a positive integer). We use finite-field discrete Fourier transform to convert the output symbols at the sink nodes, at any given time instant, into a F(p)m-linear combination of the input symbols generated during the same generation without making use of memory at the intermediate nodes. We call this as transforming the acyclic network with delay into n-instantaneous networks (n is sufficiently large). We show that under certain conditions, there exists a network code satisfying sink demands in the usual (nontransform) approach if and only if there exists a network code satisfying sink demands in the transform approach. When the zero-interference conditions are not satisfied, we propose three precoding-based network alignment (PBNA) schemes for three-source three-destination multiple unicast network with delays (3-S 3-D MUN-D) termed as PBNA using transform approach and time-invariant local encoding coefficients (LECs), PBNA using time-varying LECs, and PBNA using transform approach and block time-varying LECs. We derive sets of necessary and sufficient conditions under which throughputs close to n' + 1/2n' + 1, n'/2n' + 1, and n'/2n' + 1 are achieved for the three source-destination pairs in a 3-S 3-D MUN-D employing PBNA using transform approach and time-invariant LECs, and PBNA using transform approach and block time-varying LECs, where n' is a positive integer. For PBNA using time-varying LECs, we obtain a sufficient condition under which a throughput demand of n(1)/n, n(2)/n, and n(3)/n can be met for the three source-destination pairs in a 3-S 3-D MUN-D, where n(1), n(2), and n(3) are positive integers less than or equal to the positive integer n. This condition is also necessary when n(1) + n(3) = n(1) + n(2) = n where n(1) >= n(2) >= n(3).

Modelling of transient heat conduction with diffuse interface methods

We present a survey on different numerical interpolation schemes used for two-phase transient heat conduction problems in the context of interface capturing phase-field methods. Examples are general transport problems in the context of diffuse interface methods with a non-equal heat conductivity in normal and tangential directions to the interface. We extend the tonsorial approach recently published by Nicoli M et al (2011 Phys. Rev. E 84 1-6) to the general three-dimensional (3D) transient evolution equations. Validations for one-dimensional, two-dimensional and 3D transient test cases are provided, and the results are in good agreement with analytical and numerical reference solutions.

Codes with Locality for Two Erasures

In this paper, we study codes with locality that can recover from two erasures via a sequence of two local, parity-check computations. By a local parity-check computation, we mean recovery via a single parity-check equation associated with small Hamming weight. Earlier approaches considered recovery in parallel; the sequential approach allows us to potentially construct codes with improved minimum distance. These codes, which we refer to as locally 2-reconstructible codes, are a natural generalization along one direction, of codes with all-symbol locality introduced by Gopalan et al, in which recovery from a single erasure is considered. By studying the generalized Hamming weights of the dual code, we derive upper bounds on the minimum distance of locally 2-reconstructible codes and provide constructions for a family of codes based on Turan graphs, that are optimal with respect to this bound. The minimum distance bound derived here is universal in the sense that no code which permits all-symbol local recovery from 2 erasures can have larger minimum distance regardless of approach adopted. Our approach also leads to a new bound on the minimum distance of codes with all-symbol locality for the single-erasure case.

MIMO Decode-and-Forward Relay Beamforming for Secrecy with Cooperative Jamming

In this paper, we consider decode-and-forward (DF) relay beamforming for secrecy with cooperative jamming (CJ) in the presence of multiple eavesdroppers. The communication between a source-destination pair is aided by a multiple-input multiple-output (MIMO) relay. The source has one transmit antenna and the destination and eavesdroppers have one receive antenna each. The source and the MIMO relay are constrained with powers P-S and P-R, respectively. We relax the rank-1 constraint on the signal beamforming matrix and transform the secrecy rate max-min optimization problem to a single maximization problem, which is solved by semidefinite programming techniques. We obtain the optimum source power, signal relay weights, and jamming covariance matrix. We show that the solution of the rank-relaxed optimization problem has rank-1. Numerical results show that CJ can improve the secrecy rate.

MIMO Decode-and-Forward Relay Beamforming for Secrecy with Cooperative Jamming

In this paper, we consider decode-and-forward (DF) relay beamforming for secrecy with cooperative jamming (CJ) in the presence of multiple eavesdroppers. The communication between a source-destination pair is aided by a multiple-input multiple-output (MIMO) relay. The source has one transmit antenna and the destination and eavesdroppers have one receive antenna each. The source and the MIMO relay are constrained with powers P-S and P-R, respectively. We relax the rank-1 constraint on the signal beamforming matrix and transform the secrecy rate max-min optimization problem to a single maximization problem, which is solved by semidefinite programming techniques. We obtain the optimum source power, signal relay weights, and jamming covariance matrix. We show that the solution of the rank-relaxed optimization problem has rank-1. Numerical results show that CJ can improve the secrecy rate.

Suspensions of polymer-grafted nanoparticles with added polymers-Structure and effective pair-interactions

We present the results of combined experimental and theoretical (molecular dynamics simulations and integral equation theory) studies of the structure and effective interactions of suspensions of polymer grafted nanoparticles (PGNPs) in the presence of linear polymers. Due to the absence of systematic experimental and theoretical studies of PGNPs, it is widely believed that the structure and effective interactions in such binary mixtures would be very similar to those of an analogous soft colloidal material-star polymers. In our study, polystyrene-grafted gold nanoparticles with functionality f = 70 were mixed with linear polystyrene (PS) of two different molecular weights for obtaining two PGNP: PS size ratios, xi = 0.14 and 2.76 (where, xi = M-g/M-m, M-g and M-m being the molecular weights of grafting and matrix polymers, respectively). The experimental structure factor of PGNPs could be modeled with an effective potential (Model-X), which has been found to be widely applicable for star polymers. Similarly, the structure factor of the blends with xi = 0.14 could be modeled reasonably well, while the structure of blends with xi = 2.76 could not be captured, especially for high density of added polymers. A model (Model-Y) for effective interactions between PGNPs in a melt of matrix polymers also failed to provide good agreement with the experimental data for samples with xi = 2.76 and high density of added polymers. We tentatively attribute this anomaly in modeling the structure factor of blends with xi = 2.76 to the questionable assumption of Model-X in describing the added polymers as star polymers with functionality 2, which gets manifested in both polymer-polymer and polymer-PGNP interactions especially at higher fractions of added polymers. The failure of Model-Y may be due to the neglect of possible many-body interactions among PGNPs mediated by matrix polymers when the fraction of added polymers is high. These observations point to the need for a new framework to understand not only the structural behavior of PGNPs but also possibly their dynamics and thermo-mechanical properties as well. (C) 2015 AIP Publishing LLC.

An approximation to the QoS aware throughput region of a tree network under IEEE 802.15.4 CSMA/CA with application to wireless sensor network design

In the context of wireless sensor networks, we are motivated by the design of a tree network spanning a set of source nodes that generate packets, a set of additional relay nodes that only forward packets from the sources, and a data sink. We assume that the paths from the sources to the sink have bounded hop count, that the nodes use the IEEE 802.15.4 CSMA/CA for medium access control, and that there are no hidden terminals. In this setting, starting with a set of simple fixed point equations, we derive explicit conditions on the packet generation rates at the sources, so that the tree network approximately provides certain quality of service (QoS) such as end-to-end delivery probability and mean delay. The structures of our conditions provide insight on the dependence of the network performance on the arrival rate vector, and the topological properties of the tree network. Our numerical experiments suggest that our approximations are able to capture a significant part of the QoS aware throughput region (of a tree network), that is adequate for many sensor network applications. Furthermore, for the special case of equal arrival rates, default backoff parameters, and for a range of values of target QoS, we show that among all path-length-bounded trees (spanning a given set of sources and the data sink) that meet the conditions derived in the paper, a shortest path tree achieves the maximum throughput. (C) 2015 Elsevier B.V. All rights reserved.