Effect of non-plastic fines on cyclic behaviour of sandy soils

This paper presents the results of the detailed studies on stress - controlled cyclic triaxial tests on sandy soils from Ahmedabad, Gujarat, India subjected to a loading frequency of 0.1 Hz in cyclic triaxial equipment. Undrained stress controlled cyclic triaxial tests were carried out on cylindrical samples of size 50 mm diameter and height 100 mm with different cyclic stress ratios. Laboratory evaluations were carried out to compare the cyclic resistance of clean sand to that of sand with various fines contents at a constant gross void ratio. The gross void ratio considers the voids formed by sand particles and fines. The effects of gross void ratio with and without fines on pore water pressure build up and liquefaction potential of sandy soils in stress controlled tests are presented. The results obtained from this study provide direct evidence that the limiting silt content plays an important role in the cyclic resistance of sandy soils. Below the limiting silt content the cyclic resistance decreases until the limiting silt content is reached and then the cyclic resistance increases.

Register Allocation and Optimal Spill code Scheduling in Software Pipelined Loops using 0-1 Integer Linear Programming Formulation

In achieving higher instruction level parallelism, software pipelining increases the register pressure in the loop. The usefulness of the generated schedule may be restricted to cases where the register pressure is less than the available number of registers. Spill instructions need to be introduced otherwise. But scheduling these spill instructions in the compact schedule is a difficult task. Several heuristics have been proposed to schedule spill code. These heuristics may generate more spill code than necessary, and scheduling them may necessitate increasing the initiation interval. We model the problem of register allocation with spill code generation and scheduling in software pipelined loops as a 0-1 integer linear program. The formulation minimizes the increase in initiation interval (II) by optimally placing spill code and simultaneously minimizes the amount of spill code produced. To the best of our knowledge, this is the first integrated formulation for register allocation, optimal spill code generation and scheduling for software pipelined loops. The proposed formulation performs better than the existing heuristics by preventing an increase in II in 11.11% of the loops and generating 18.48% less spill code on average among the loops extracted from Perfect Club and SPEC benchmarks with a moderate increase in compilation time.

OOCs, Partial Relative Difference Families and a Conjecture of Golomb

The cyclic difference sets constructed by Singer are also examples of perfect distinct difference sets (DDS). The Bose construction of distinct difference sets, leads to a relative difference set. In this paper we introduce the concept of partial relative DDS and prove that an optical orthogonal code (OOC) construction due to Moreno et. al., is a partial relative DDS. We generalize the concept of ideal matrices previously introduced by Kumar and relate it to the concepts of this paper. Another variation of ideal matrices is introduced in this paper: Welch ideal matrices of dimension n by (n - 1). We prove that Welch ideal matrices exist only for n prime. Finally, we recast an old conjecture of Golomb on the Welch construction of Costas arrays using the concepts of this paper. This connection suggests that our construction of partial relative difference sets is in a sense, unique

Collocated and Distributed STBCs with Partial Interference Cancellation Decoding, Part II: Code Construction

In this second part of a two part series of papers, we construct a new class of Space-Time Block Codes (STBCs) for point-to-point MIMO channel and Distributed STBCs (DSTBCs) for the amplify-and-forward relay channel that give full-diversity with Partial Interference Cancellation (PIC) and PIC with Successive Interference Cancellation (PIC-SIC) decoders. The proposed class of STBCs include most of the known full-diversity low complexity PIC/PIC-SIC decodable STBCs as special cases. We also show that a number of known full-diversity PIC/PIC-SIC decodable STBCs that were constructed for the point-topoint MIMO channel can be used as full-diversity PIC/PIC-SIC decodable DSTBCs in relay networks. For the same decoding complexity, the proposed STBCs and DSTBCs achieve higher rates than the known low decoding complexity codes. Simulation results show that the new codes have a better bit error rate performance than the low ML decoding complexity codes available in the literature.

Improving Superscalar Instruction Dispatch And Issue By Exploiting Dynamic Code Sequences

Superscalar processors currently have the potential to fetch multiple basic blocks per cycle by employing one of several recently proposed instruction fetch mechanisms. However, this increased fetch bandwidth cannot be exploited unless pipeline stages further downstream correspondingly improve. In particular,register renaming a large number of instructions per cycle is diDcult. A large instruction window, needed to receive multiple basic blocks per cycle, will slow down dependence resolution and instruction issue. This paper addresses these and related issues by proposing (i) partitioning of the instruction window into multiple blocks, each holding a dynamic code sequence; (ii) logical partitioning of the registerjle into a global file and several local jles, the latter holding registers local to a dynamic code sequence; (iii) the dynamic recording and reuse of register renaming information for registers local to a dynamic code sequence. Performance studies show these mechanisms improve performance over traditional superscalar processors by factors ranging from 1.5 to a little over 3 for the SPEC Integer programs. Next, it is observed that several of the loops in the benchmarks display vector-like behavior during execution, even if the static loop bodies are likely complex for compile-time vectorization. A dynamic loop vectorization mechanism that builds on top of the above mechanisms is briefly outlined. The mechanism vectorizes up to 60% of the dynamic instructions for some programs, albeit the average number of iterations per loop is quite small.

Algebraic Approaches to Space-Time Code Construction for Multiple-Antenna Communication

A major challenge in wireless communications is overcoming the deleterious effects of fading, a phenomenon largely responsible for the seemingly inevitable dropped call. Multiple-antennas communication systems, commonly referred to as MIMO systems, employ multiple antennas at both transmitter and receiver, thereby creating a multitude of signalling pathways between transmitter and receiver. These multiple pathways give the signal a diversity advantage with which to combat fading. Apart from helping overcome the effects of fading, MIMO systems can also be shown to provide a manyfold increase in the amount of information that can be transmitted from transmitter to receiver. Not surprisingly,MIMO has played, and continues to play, a key role in the advancement of wireless communication.Space-time codes are a reference to a signalling format in which information about the message is dispersed across both the spatial (or antenna) and time dimension. Algebraic techniques drawing from algebraic structures such as rings, fields and algebras, have been extensively employed in the construction of optimal space-time codes that enable the potential of MIMO communication to be realized, some of which have found their way into the IEEE wireless communication standards. In this tutorial article, reflecting the authors’interests in this area, we survey some of these techniques.

Gap model of one-way cyclic lateral load on vertical files in soft clay

For the analysis and design of pile foundation used for coastal structures the prediction of cyclic response, which is influenced by the nonlinear behavior, gap (pile soil separation) and degradation (reduction in strength) of soil becomes necessary. To study the effect of the above parameters a nonlinear cyclic load analysis program using finite element method is developed, incorporating the proposed gap and degradation model and adopting an incremental-iterative procedure. The pile is idealized using beam elements and the soil by number of elastoplastic sub-element springs at each node. The effect of gap and degradation on the load-deflection behavior. elasto-plastic sub-element and resistance of the soil at ground-line have been clearly depicted in this paper.

Nonlinear cyclic load analysis for lateral response of batter piles in soft clay with a rigorous degradation model

Nonlinear analysis of batter piles in soft clay is performed using the finite element technique. As the batter piles are not only governed by lateral load but also axial load, the effect of P- Delta moment and geometric stiffness matrix is included in the analysis. For implementing the nonlinear soil behavior, reduction in soil strength (degradation), and formation of gap with number of load cycles, a numerical model is developed where a hyperbolic relation is adopted for the soil in static condition and hyperbolic relation considering degradation and gap for cyclic load condition. The numerical model is validated with published experimental results for cyclic lateral loading and the hysteresis loops are developed to predict the load-deflection behavior and soil resistance behavior during consecutive cycles of loading. This paper highlights the importance of a rigorous degradation model for subsequent cycles of loading on the pile-soil system by a hysteretic representation.

A simple and fast scheme for code compression for VLIW processors

Summary form only given. A scheme for code compression that has a fast decompression algorithm, which can be implemented using simple hardware, is proposed. The effectiveness of the scheme on the TMS320C62x architecture that includes the overheads of a line address table (LAT) is evaluated and obtained compression rates ranging from 70% to 80%. Two schemes for decompression are proposed. The basic idea underlying the scheme is a simple clustering algorithm that partially maps a block of instructions into a set of clusters. The clustering algorithm is a greedy algorithm based on the frequency of occurrence of various instructions.

Designed Cyclic Permutants of HIV-1 gp120: Implications for Envelope Trimer Structure and Immunogen Design

Most HIV-1 broadly neutralizing antibodies are directed against the gp120 subunit of the env surface protein. Native env consists of a trimer of gp120-gp41 heterodimers, and in contrast to monomeric gp120, preferentially binds CD4 binding site (CD4bs)-directed neutralizing antibodies over non-neutralizing ones. Some cryo-electron tomography studies have suggested that the V1V2 loop regions of gp120 are located close to the trimer interface. We have therefore designed cyclically permuted variants of gp120 with and without the h-CMP and SUMO2a trimerization domains inserted into the V1V2 loop. h-CMP-V1cyc is one such variant in which residues 153 and 142 are the N- and C-terminal residues, respectively, of cyclically permuted gp120 and h-CMP is fused to the N-terminus. This molecule forms a trimer under native conditions and binds CD4 and the neutralizing CD4bs antibodies b12 with significantly higher affinity than wild-type gp120. It binds non-neutralizing CD4bs antibody F105 with lower affinity than gp120. A similar derivative, h-CMP-V1cycl, bound the V1V2 loop-directed broadly neutralizing antibodies PG9 and PG16 with similar to 20-fold higher affinity than wild-type JRCSF gp120. These cyclic permutants of gp120 are properly folded and are potential immunogens. The data also support env models in which the V1V2 loops are proximal to the trimer interface.