Confined concrete—Its application in R.C. beams and frames

Stress-strain characteristics of concrete confined in steel binders have been determined. A new factor “confinement index” has been introduced for a quantitative measure of the confinement and using these results a “stress-block” has been developed. Tests have been made on simply supported reinforced concrete beams with spiral binder confinement and analysed on the basis of the proposed stress-block. Tests have also been made oon reinforced concrete portal frames and continuous beams with spiral binder confinement at sections of possible plastic hinge formation. An analysis of these tests indicates that a full redistribution of moments has taken place at ultimate.

Application of Maclaurin Series in Structural Analysis

In the simple theory of flexure of beams, the slope, bending moment, shearing force, load and other quantities are functions of a derivative of y with respect to x. It is shown that the elastic curve of a transversely loaded beam can be represented by the Maclaurin series. Substitution of the values of the derivatives gives a direct solution of beam problems. In this paper the method is applied to derive the Theorem or three moments and slope deflection equations. The method is extended to the solution of a rigid portal frame. Finally the method is applied to deduce results on which the moment distribution method of analyzing rigid frames is based.

Multiple support excitations of open-plane frames by a filtered white noise and soil-structure interaction

Seismic structural design is essentially the estimation of structural response to a forced motion, which may be deterministic or stochastic, imposed on the ground. The assumption that the same ground motion acts at every point of the base of the structure (or at every support) is not always justifiable; particularly in case of very large structures when considerable spatial variability in ground motion can exist over significant distances example long span bridges. This variability is partly due to the delay in arrival of the excitation at different supports (which is called the wave passage effect) and due to heterogeneity in the ground medium which results in incoherency and local effects. The current study examines the influence of the wave passage effect (in terms of delay in arrival of horizontal ground excitation at different supports and neglecting transmission through the structure) on the response of a few open-plane frame building structures with soil-structure interaction. The ground acceleration has been modeled by a suitably filtered white noise. As a special case, the ground excitation at different supports has also been treated as statistically independent to model the extreme case of incoherence due to local effects and due to modifications to the ground motion resulting from wave reflections and refractions in heterogeneous soil media. The results indicate that, even for relatively short spanned building frames, wave passage effect can be significant. In the absence of soil-structure interaction, it can significantly increase the root mean square (rms) value of the shear in extreme end columns for the stiffer frames but has negligible effect on the flexible frames when total displacements are considered. It is seen that pseudo-static displacements increasingly contribute to the rms value of column shear as the time delay increases both for the stiffer and for the more flexible frames. When soil-structure interaction is considered, wave passage effect (in terms of total displacements) is significant only for low soil shear modulus, G. values (where soil-structure interaction significantly lowers the fundamental frequency) and for stiff frames. The contribution of pseudo-static displacement to these rms values is found to decrease with increase in G. In general, wave passage effect for most interactive frames is insignificant compared to the attenuating effect a decrease in G, has on the response of the interactive structure to uniform support excitation. When the excitations at different supports are statistically independent, it is seen that for both the stiff and flexible frames, the rms value of the column shear in extreme end columns is several times larger (more for the stiffer frames) than the value corresponding to uniform base excitation with the pseudo-static displacements contributing over 99% of the rms value of column shear. Soil-structure interaction has an attenuating effect on the rms value of the column shear, the effect decreasing with increase in G,. Here too, the pseudo-static displacements contribute very largely to the column shear. The influence of the wave passage effect on the response of three 2-bay frames with and without soil-structure interaction to a recorded horizontal accelerogram is also examined. (C) 2010 Elsevier Ltd. All rights reserved.

Stereoelectronic control of Cope rearrangement energetics through remote double bonds in novel, rigid polycyclic frames

The presence and orientation of remote double bonds are shown to completely alter the shapes of Cope rearrangement energy profiles in a heptacyclic system.

Grassmannian fusion frames and its use in block sparse recovery

Tight fusion frames which form optimal packings in Grassmannian manifolds are of interest in signal processing and communication applications. In this paper, we study optimal packings and fusion frames having a specific structure for use in block sparse recovery problems. The paper starts with a sufficient condition for a set of subspaces to be an optimal packing. Further, a method of using optimal Grassmannian frames to construct tight fusion frames which form optimal packings is given. Then, we derive a lower bound on the block coherence of dictionaries used in block sparse recovery. From this result, we conclude that the Grassmannian fusion frames considered in this paper are optimal from the block coherence point of view. (C) 2013 Elsevier B.V. All rights reserved.

Some limit theorems for regenerative queues

We consider a single server queue with the interarrival times and the service times forming a regenerative sequence. This traffic class includes the standard models: lid, periodic, Markov modulated (e.g., BMAP model of Lucantoni [18]) and their superpositions. This class also includes the recently proposed traffic models in high speed networks, exhibiting long range dependence. Under minimal conditions we obtain the rates of convergence to stationary distributions, finiteness of stationary moments, various functional limit theorems and the continuity of stationary distributions and moments. We use the continuity results to obtain approximations for stationary distributions and moments of an MMPP/GI/1 queue where the modulating chain has a countable state space. We extend all our results to feedforward networks where the external arrivals to each queue can be regenerative. In the end we show that the output process of a leaky bucket is regenerative if the input process is and hence our results extend to a queue with arrivals controlled by a leaky bucket.

Linear filtering in DCT IV/DST IV and MDCT/MDST domain

In this paper, expressions for convolution multiplication properties of DCT IV and DST IV are derived starting from equivalent DFT representations. Using these expressions methods for implementing linear filtering through block convolution in the DCT IV and DST IV domain are proposed. Techniques developed for DCT IV and DST IV are further extended to MDCT and MDST where the filter implementation is near exact for symmetric filters and approximate for non-symmetric filters. No additional overlapping is required for implementing the symmetric filtering in the MDCT domain and hence the proposed algorithm is computationally competitive with DFT based systems. Moreover, inherent 50% overlap between the adjacent frames used for MDCT/MDST domain reduces the blocking artifacts due to block processing or quantization. The techniques are computationally efficient for symmetric filters and provides a new alternative to DFT based convolution.

A Fuzzy Approximation Scheme for Sequential Learning in Pattern Recognition

An adaptive learning scheme, based on a fuzzy approximation to the gradient descent method for training a pattern classifier using unlabeled samples, is described. The objective function defined for the fuzzy ISODATA clustering procedure is used as the loss function for computing the gradient. Learning is based on simultaneous fuzzy decisionmaking and estimation. It uses conditional fuzzy measures on unlabeled samples. An exponential membership function is assumed for each class, and the parameters constituting these membership functions are estimated, using the gradient, in a recursive fashion. The induced possibility of occurrence of each class is useful for estimation and is computed using 1) the membership of the new sample in that class and 2) the previously computed average possibility of occurrence of the same class. An inductive entropy measure is defined in terms of induced possibility distribution to measure the extent of learning. The method is illustrated with relevant examples.

Optimal Parameter Trajectory Estimation in Parameterized SDEs: An Algorithmic Procedure

We consider the problem of estimating the optimal parameter trajectory over a finite time interval in a parameterized stochastic differential equation (SDE), and propose a simulation-based algorithm for this purpose. Towards this end, we consider a discretization of the SDE over finite time instants and reformulate the problem as one of finding an optimal parameter at each of these instants. A stochastic approximation algorithm based on the smoothed functional technique is adapted to this setting for finding the optimal parameter trajectory. A proof of convergence of the algorithm is presented and results of numerical experiments over two different settings are shown. The algorithm is seen to exhibit good performance. We also present extensions of our framework to the case of finding optimal parameterized feedback policies for controlled SDE and present numerical results in this scenario as well.

Reflexive Incidence Matrx (RIM) Representation of Petr Nets

Although incidence matrix representation has been used to analyze the Petri net based models of a system, it has the limitation that it does not preserve reflexive properties (i.e., the presence of selfloops) of Petri nets. But in many practical applications self-loops play very important roles. This paper proposes a new representation scheme for general Petri nets. This scheme defines a matrix called "reflexive incidence matrix (RIM) c which is a combination of two matrices, a "base matrix Cb,,, and a "power matrix CP." This scheme preserves the reflexive and other properties of the Petri nets. Through a detailed analysis it is shown that the proposed scheme requires less memory space and less processing time for answering commonly encountered net queries compared to other schemes. Algorithms to generate the RIM from the given net description and to decompose RIM into input and output function matrices are also given. The proposed Petri net representation scheme is very useful to model and analyze the systems having shared resources, chemical processes, network protocols, etc., and to evaluate the performance of asynchronous concurrent systems.

Multipath Dissemination in Regular Mesh Topologies

Mesh topologies are important for large-scale peer-to-peer systems that use low-power transceivers. The Quality of Service (QoS) in such systems is known to decrease as the scale increases. We present a scalable approach for dissemination that exploits all the shortest paths between a pair of nodes and improves the QoS. Despite th presence of multiple shortest paths in a system, we show that these paths cannot be exploited by spreading the messages over the paths in a simple round-robin manner; nodes along one of these paths will always handle more messages than the nodes along the other paths. We characterize the set of shortest paths between a pair of nodes in regular mesh topologies and derive rules, using this characterization, to effectively spread the messages over all the available paths. These rules ensure that all the nodes that are at the same distance from the source handle roughly the same number of messages. By modeling the multihop propagation in the mesh topology as a multistage queuing network, we present simulation results from a variety of scenarios that include link failures and propagation irregularities to reflect real-world characteristics. Our method achieves improved QoS in all these scenarios.

On the Conversion of Hensel Codes to Farey Rationals

Three different algorithms are described for the conversion of Hensel codes to Farey rationals. The first algorithm is based on the trial and error factorization of the weight of a Hensel code, inversion and range test. The second algorithm is deterministic and uses a pair of different p-adic systems for simultaneous computation; from the resulting weights of the two different Hensel codes of the same rational, two equivalence classes of rationals are generated using the respective primitive roots. The intersection of these two equivalence classes uniquely identifies the rational. Both the above algorithms are exponential (in time and/or space).

Synergistic Execution of Stream Programs on Multicores with Accelerators

The StreamIt programming model has been proposed to exploit parallelism in streaming applications oil general purpose multicore architectures. The StreamIt graphs describe task, data and pipeline parallelism which can be exploited on accelerators such as Graphics Processing Units (GPUs) or CellBE which support abundant parallelism in hardware. In this paper, we describe a novel method to orchestrate the execution of if StreamIt program oil a multicore platform equipped with an accelerator. The proposed approach identifies, using profiling, the relative benefits of executing a task oil the superscalar CPU cores and the accelerator. We formulate the problem of partitioning the work between the CPU cores and the GPU, taking into account the latencies for data transfers and the required buffer layout transformations associated with the partitioning, as all integrated Integer Linear Program (ILP) which can then be solved by an ILP solver. We also propose an efficient heuristic algorithm for the work-partitioning between the CPU and the GPU, which provides solutions which are within 9.05% of the optimal solution on an average across the benchmark Suite. The partitioned tasks are then software pipelined to execute oil the multiple CPU cores and the Streaming Multiprocessors (SMs) of the GPU. The software pipelining algorithm orchestrates the execution between CPU cores and the GPU by emitting the code for the CPU and the GPU, and the code for the required data transfers. Our experiments on a platform with 8 CPU cores and a GeForce 8800 GTS 512 GPU show a geometric mean speedup of 6.94X with it maximum of 51.96X over it single threaded CPU execution across the StreamIt benchmarks. This is a 18.9% improvement over it partitioning strategy that maps only the filters that cannot be executed oil the GPU - the filters with state that is persistent across firings - onto the CPU.

An Online Implementable Differential Evolution Tuned Optimal Guidance Law

This paper proposes a novel application of differential evolution to solve a difficult dynamic optimisation or optimal control problem. The miss distance in a missile-target engagement is minimised using differential evolution. The difficulty of solving it by existing conventional techniques in optimal control theory is caused by the nonlinearity of the dynamic constraint equation, inequality constraint on the control input and inequality constraint on another parameter that enters problem indirectly. The optimal control problem of finding the minimum miss distance has an analytical solution subject to several simplifying assumptions. In the approach proposed in this paper, the initial population is generated around the seed value given by this analytical solution. Thereafter, the algorithm progresses to an acceptable final solution within a few generations, satisfying the constraints at every iteration. Since this solution or the control input has to be obtained in real time to be of any use in practice, the feasibility of online implementation is also illustrated.