Pullout capacity of inclined plate anchors embedded in sand

The pullout capacity of an inclined strip plate anchor embedded in sand has been determined by using the lower bound theorem of the limit analysis in combination with finite elements and linear optimization. The numerical results in the form of pullout factors have been presented by changing gradually the inclination of the plate from horizontal to vertical. The pullout resistance increases significantly with an increase in the horizontal inclination (theta) of the plate especially for theta > 30 degrees. The effect of the anchor plate-soil interface friction angle (delta) on the pullout resistance becomes extensive for a vertical anchor but remains insignificant for a horizontal anchor. The development of the failure zone around the anchor plates was also studied by varying theta and delta. The results from the analysis match well with the theoretical and experimental results reported in literature.

An Eigen Approach to Transmit Beamforming in Wireless Networks With Single Antenna Receivers

In this paper, we propose an eigen framework for transmit beamforming for single-hop and dual-hop network models with single antenna receivers. In cases where number of receivers is not more than three, the proposed Eigen approach is vastly superior in terms of ease of implementation and computational complexity compared with the existing convex-relaxation-based approaches. The essential premise is that the precoding problems can be posed as equivalent optimization problems of searching for an optimal vector in the joint numerical range of Hermitian matrices. We show that the latter problem has two convex approximations: the first one is a semi-definite program that yields a lower bound on the solution, and the second one is a linear matrix inequality that yields an upper bound on the solution. We study the performance of the proposed and existing techniques using numerical simulations.

Seismic Bearing Capacity of Shallow Embedded Foundations on a Sloping Ground Surface

By using the lower-bound theorem of the limit analysis in conjunction with finite elements and nonlinear optimization, bearing-capacity factors, N-c and N-gamma q, with an inclusion of pseudostatic horizontal seismic body forces, have been determined for a shallow embedded horizontal strip footing placed on sloping ground surface. The variation of N-c and N-gamma q with changes in slope angle (beta) for different values of seismic acceleration coefficient (k(h)) has been obtained. The analysis reveals that irrespective of ground inclination and the embedment depth of the footing, the factors N-c and N-gamma q decrease quite considerably with an increase in k(h). As compared with N-c, the factor N-gamma q is affected more extensively with changes in k(h) and beta. Unlike most of the results reported in literature for the seismic case, the present computational results take into account the shear resistance of soil mass above the footing level. An increase in the depth of the embedment leads to an increase in the magnitudes of both N-c and N-gamma q. (C) 2014 American Society of Civil Engineers.

Bearing Capacity of Circular Footings on Reinforced Soils

A method is presented for determining the ultimate bearing capacity of a circular footing reinforced with a horizontal circular sheet of reinforcement placed over granular and cohesive-frictional soils. It was assumed that the reinforcement sheet could bear axial tension but not the bending moment. The analysis was performed based on the lower-bound theorem of the limit analysis in combination with finite elements and linear optimization. The present research is an extension of recent work with strip foundations reinforced with different layers of reinforcement. To incorporate the effect of the reinforcement, the efficiency factors eta(gamma) and eta(c), which need to be multiplied by the bearing capacity factors N-gamma and N-c, were established. Results were obtained for different values of the soil internal friction angle (phi). The optimal positions of the reinforcements, which would lead to a maximum improvement in the bearing capacity, were also determined. The variations of the axial tensile force in the reinforcement sheet at different radial distances from the center were also studied. The results of the analysis were compared with those available from literature. (C) 2014 American Society of Civil Engineers.

Energy-efficient, delay-constrained, QoS-aware broadcast for cooperative wireless sensor networks

The problem of delay-constrained, energy-efficient broadcast in cooperative wireless networks is NP-complete. While centralised setting allows some heuristic solutions, designing heuristics in distributed implementation poses significant challenges. This is more so in wireless sensor networks (WSNs) where nodes are deployed randomly and topology changes dynamically due to node failure/join and environment conditions. This paper demonstrates that careful design of network infrastructure can achieve guaranteed delay bounds and energy-efficiency, and even meet quality of service requirements during broadcast. The paper makes three prime contributions. First, we present an optimal lower bound on energy consumption for broadcast that is tighter than what has been previously proposed. Next, iSteiner, a lightweight, distributed and deterministic algorithm for creation of network infrastructure is discussed. iPercolate is the algorithm that exploits this structure to cooperatively broadcast information with guaranteed delivery and delay bounds, while allowing real-time traffic to pass undisturbed.

On the Communication Complexity of Secret Key Generation in the Multiterminal Source Model

Communication complexity refers to the minimum rate of public communication required for generating a maximal-rate secret key (SK) in the multiterminal source model of Csiszar and Narayan. Tyagi recently characterized this communication complexity for a two-terminal system. We extend the ideas in Tyagi's work to derive a lower bound on communication complexity in the general multiterminal setting. In the important special case of the complete graph pairwise independent network (PIN) model, our bound allows us to determine the exact linear communication complexity, i.e., the communication complexity when the communication and SK are restricted to be linear functions of the randomness available at the terminals.

Heterochromatic paths in edge colored graphs without small cycles and heterochromatic-triangle-free graphs

Conditions for the existence of heterochromatic Hamiltonian paths and cycles in edge colored graphs are well investigated in literature. A related problem in this domain is to obtain good lower bounds for the length of a maximum heterochromatic path in an edge colored graph G. This problem is also well explored by now and the lower bounds are often specified as functions of the minimum color degree of G - the minimum number of distinct colors occurring at edges incident to any vertex of G - denoted by v(G). Initially, it was conjectured that the lower bound for the length of a maximum heterochromatic path for an edge colored graph G would be 2v(G)/3]. Chen and Li (2005) showed that the length of a maximum heterochromatic path in an edge colored graph G is at least v(G) - 1, if 1 <= v(G) <= 7, and at least 3v(G)/5] + 1 if v(G) >= 8. They conjectured that the tight lower bound would be v(G) - 1 and demonstrated some examples which achieve this bound. An unpublished manuscript from the same authors (Chen, Li) reported to show that if v(G) >= 8, then G contains a heterochromatic path of length at least 120 + 1. In this paper, we give lower bounds for the length of a maximum heterochromatic path in edge colored graphs without small cycles. We show that if G has no four cycles, then it contains a heterochromatic path of length at least v(G) - o(v(G)) and if the girth of G is at least 4 log(2)(v(G)) + 2, then it contains a heterochromatic path of length at least v(G) - 2, which is only one less than the bound conjectured by Chen and Li (2005). Other special cases considered include lower bounds for the length of a maximum heterochromatic path in edge colored bipartite graphs and triangle-free graphs: for triangle-free graphs we obtain a lower bound of 5v(G)/6] and for bipartite graphs we obtain a lower bound of 6v(G)-3/7]. In this paper, it is also shown that if the coloring is such that G has no heterochromatic triangles, then G contains a heterochromatic path of length at least 13v(G)/17)]. This improves the previously known 3v(G)/4] bound obtained by Chen and Li (2011). We also give a relatively shorter and simpler proof showing that any edge colored graph G contains a heterochromatic path of length at least (C) 2015 Elsevier Ltd. All rights reserved.

Relay Selection with Channel Probing in Sleep-Wake Cycling Wireless Sensor Networks

In geographical forwarding of packets in a large wireless sensor network (WSN) with sleep-wake cycling nodes, we are interested in the local decision problem faced by a node that has ``custody'' of a packet and has to choose one among a set of next-hop relay nodes to forward the packet toward the sink. Each relay is associated with a ``reward'' that summarizes the benefit of forwarding the packet through that relay. We seek a solution to this local problem, the idea being that such a solution, if adopted by every node, could provide a reasonable heuristic for the end-to-end forwarding problem. Toward this end, we propose a local relay selection problem consisting of a forwarding node and a collection of relay nodes, with the relays waking up sequentially at random times. At each relay wake-up instant, the forwarder can choose to probe a relay to learn its reward value, based on which the forwarder can then decide whether to stop (and forward its packet to the chosen relay) or to continue to wait for further relays to wake up. The forwarder's objective is to select a relay so as to minimize a combination of waiting delay, reward, and probing cost. The local decision problem can be considered as a variant of the asset selling problem studied in the operations research literature. We formulate the local problem as a Markov decision process (MDP) and characterize the solution in terms of stopping sets and probing sets. We provide results illustrating the structure of the stopping sets, namely, the (lower bound) threshold and the stage independence properties. Regarding the probing sets, we make an interesting conjecture that these sets are characterized by upper bounds. Through simulation experiments, we provide valuable insights into the performance of the optimal local forwarding and its use as an end-to-end forwarding heuristic.

Separation index of graphs and stacked 2-spheres

In 1987, Kalai proved that stacked spheres of dimension d >= 3 are characterised by the fact that they attain equality in Barnette's celebrated Lower Bound Theorem. This result does not extend to dimension d = 2. In this article, we give a characterisation of stacked 2-spheres using what we call the separation index. Namely, we show that the separation index of a triangulated 2-sphere is maximal if and only if it is stacked. In addition, we prove that, amongst all n-vertex triangulated 2-spheres, the separation index is minimised by some n-vertex flag sphere for n >= 6. Furthermore, we apply this characterisation of stacked 2-spheres to settle the outstanding 3-dimensional case of the Lutz-Sulanke-Swartz conjecture that ``tight-neighbourly triangulated manifolds are tight''. For dimension d >= 4, the conjecture has already been proved by Effenberger following a result of Novik and Swartz. (C) 2015 Elsevier Inc. All rights reserved.

Asymptotic Bounds on the Power-Delay Tradeoff for Fading Point-to-Point Links From Geometric Bounds on the Stationary Distribution of the Queue Length

The optimal power-delay tradeoff is studied for a time-slotted independently and identically distributed fading point-to-point link, with perfect channel state information at both transmitter and receiver, and with random packet arrivals to the transmitter queue. It is assumed that the transmitter can control the number of packets served by controlling the transmit power in the slot. The optimal tradeoff between average power and average delay is analyzed for stationary and monotone transmitter policies. For such policies, an asymptotic lower bound on the minimum average delay of the packets is obtained, when average transmitter power approaches the minimum average power required for transmitter queue stability. The asymptotic lower bound on the minimum average delay is obtained from geometric upper bounds on the stationary distribution of the queue length. This approach, which uses geometric upper bounds, also leads to an intuitive explanation of the asymptotic behavior of average delay. The asymptotic lower bounds, along with previously known asymptotic upper bounds, are used to identify three new cases where the order of the asymptotic behavior differs from that obtained from a previously considered approximate model, in which the transmit power is a strictly convex function of real valued service batch size for every fade state.

Bearing capacity of a circular foundation on layered sand-clay media

The bearing capacity of a circular footing lying over fully cohesive strata, with an overlaying sand layer, is computed using the axisymmetric lower bound limit analysis with finite elements and linear optimization. The effects of the thickness and the internal friction angle of the sand are examined for different combinations of c(u)/(gamma b) and q, where c(u)=the undrained shear strength of the cohesive strata, gamma=the unit weight of either layer, b=the footing radius, and q=the surcharge pressure. The results are given in the form of a ratio (eta) of the bearing capacity with an overlaying sand layer to that for a footing lying directly over clayey strata. An overlaying medium dense to dense sand layer considerably improves the bearing capacity. The improvement continuously increases with decreases in c(u)/(gamma b) and increases in phi and q/(gamma b). A certain optimum thickness of the sand layer exists beyond which no further improvement occurs. This optimum thickness increases with an increase in 0 and q and with a decrease in c(u)/(gamma b). Failure patterns are also drawn to examine the inclusion of the sand layer. (C) 2015 The Japanese Geotechnical Society. Production and hosting by Elsevier B.V. All rights reserved.

Secure Communication in Amplify-and-Forward Networks with Multiple Eavesdroppers: Decoding with SNR Thresholds

The problem of secure unicast communication over a two hop Amplify-and-Forward wireless relay network with multiple eavesdroppers is considered. Assuming that a receiver (destination or eavesdropper) can decode a message only if the received SNR is above a predefined threshold, we consider this problem in two scenarios. In the first scenario, we maximize the SNR at the legitimate destination, subject to the condition that the received SNR at each eavesdropper is below the target threshold. Due to the non-convex nature of the objective function and eavesdroppers' constraints, we transform variables and obtain a quadratically constrained quadratic program (QCQP) with convex constraints, which can be solved efficiently. When the constraints are not convex, we consider a semidefinite relaxation (SDR) to obtain computationally efficient approximate solution. In the second scenario, we minimize the total power consumed by all relay nodes, subject to the condition that the received SNR at the legitimate destination is above the threshold and at every eavesdropper, it is below the corresponding threshold. We propose a semidefinite relaxation of the problem in this scenario and also provide an analytical lower bound.

Real-Time Stress Measurements in Germanium Thin Film Electrodes during Electrochemical Lithiation/Delithiation Cycling

An in situ study of stress evolution and mechanical behavior of germanium as a lithium-ion battery electrode material is presented. Thin films of germanium are cycled in a half-cell configuration with lithium metal foil as counter/reference electrode, with 1M LiPF6 in ethylene carbonate, diethyl carbonate, dimethyl carbonate solution (1:1:1, wt%) as electrolyte. Real-time stress evolution in the germanium thin-film electrodes during electrochemical lithiation/delithiation is measured by monitoring the substrate curvature using the multi-beam optical sensing method. Upon lithiation a-Ge undergoes extensive plastic deformation, with a peak compressive stress reaching as high as -0.76 +/- 0.05 GPa (mean +/- standard deviation). The compressive stress decreases with lithium concentration reaching a value of approximately -0.3 GPa at the end of lithiation. Upon delithiation the stress quickly became tensile and follows a trend that mirrors the behavior on compressive side; the average peak tensile stress of the lithiated Ge samples was approximately 0.83 GPa. The peak tensile stress data along with the SEM analysis was used to estimate a lower bound fracture resistance of lithiated Ge, which is approximately 5.3 J/m(2). It was also observed that the lithiated Ge is rate sensitive, i.e., stress depends on how fast or slow the charging is carried out. (C) The Author(s) 2015. Published by ECS. This is an open access article distributed under the terms of the Creative Commons Attribution 4.0 License (CC BY, http://creativecommons.org/licenses/by/4.0/), which permits unrestricted reuse of the work in any medium, provided the original work is properly cited. All rights reserved.

Uplift Resistance of Interfering Pipelines Buried in Sand

The vertical uplift resistance of interfering pipelines buried in sands has been computed using the lower-bound limit analysis in conjunction with finite elements and nonlinear optimization. The soil mass is assumed to follow the Mohr-Coulomb failure criterion and an associated flow rule. It is specified that all the pipes fail simultaneously at the same magnitude of the failure load. For different clear spacing (S) between the pipes, the magnitude of the efficiency factor (xi(gamma)) is determined. Because of pipes' interference, with a reduction in the spacing between the pipelines, the magnitude of xi(gamma) is found to decrease continuously. The results were found to compare quite well with the available data from literature for horizontal strip anchors. (C) 2015 American Society of Civil Engineers.

Damage evolution, localization and failure of solids subjected to impact loading

In order to reveal the underlying mesoscopic mechanism governing the experimentally observed failure in solids subjected to impact loading, this paper presents a model of statistical microdamage evolution to macroscopic failure, in particular to spallation. Based on statistical microdamage mechanics and experimental measurement of nucleation and growth of microcracks in an Al alloy subjected to plate impact loading, the evolution law of damage and the dynamical function of damage are obtained. Then, a lower bound to damage localization can be derived. It is found that the damage evolution beyond the threshold of damage localization is extremely fast. So, damage localization can serve as a precursor to failure. This is supported by experimental observations. On the other hand, the prediction of failure becomes more accurate, when the dynamic function of damage is fitted with longer experimental observations. We also looked at the failure in creep with the same idea. Still, damage localization is a nice precursor to failure in creep rupture.