Pronounced hydrogel formation by the self-assembled aggregates of N-alkyl disaccharide amphiphiles

Six disaccharide amphiphiles were synthesized and their hydrogel-forming behavior was extensively studied. These amphiphiles were based on maltose and lactose. Since the gels formed from some of these systems showed the ability to "trap" water molecules upon gelation, these gels were described as "hydrogels". When these gels were heated to similar to 70 degrees C, the samples turned into clear, isotropic fluids, and upon gradual cooling, the hydrogels could be reproduced. Thus these systems were also "thermoreversible". The low molecular mass (MW 565) of the gelators compared to that of a typical polymeric gelator forming substance implies pronounced aggregation of the disaccharide amphiphiles into larger microstructures during gelation. To discern the aggregate textures and morphologies, the specimen hydrogel samples were examined by high-resolution scanning electron microscopy (SEM). A possible reason for the exceptionally high water gelating capacities (>6000 molecules of water per gelator molecule) exhibited by these N-alkyl disaccharide amphiphiles is the presence of large interlamellar spaces into which the water molecules get entrapped due to surface tension. In contrast to their single-chain counterparts, the double-chain lactosyl and maltosylamine amphiphiles upon solubilization in EtOH-H2O afforded hydrogels with reduced mechanical strengths. Interestingly, the corresponding microstructures were found to be quite different from the corresponding hydrogels of their single-chain counterparts. Rheological studies provided further insights into the behavior of these hydrogels. Varying the chain length of the alcohol cosolvent could modulate the gelation capacities, melting temperatures, and the mechanical properties of these hydrogels. To explain the possible reasons of gelation, the results of molecular modeling and energy minimization studies were also included.

Influence of interface properties on fracture behaviour of concrete

Hardened concrete is a three-phase composite consisting of cement paste, aggregate and interface between cement paste and aggregate. The interface in concrete plays a key role on the overall performance of concrete. The interface properties such as deformation, strength, fracture energy, stress intensity and its influence on stiffness and ductility of concrete have been investigated. The effect of composition of cement, surface characteristics of aggregate and type of loading have been studied. The load-deflection response is linear showing that the linear elastic fracture mechanics (LEFM) is applicable to characterize interface. The crack deformation increases with large rough aggregate surfaces. The strength of interface increases with the richness of concrete mix. The interface fracture energy increases as the roughness of the aggregate surface increases. The interface energy under mode II loading increases with the orientation of aggregate surface with the direction of loading. The chemical reaction between smooth aggregate surface and the cement paste seems to improve the interface energy. The ductility of concrete decreases as the surface area of the strong interface increases. The fracture toughness (stress intensity factor) of the interface seems to be very low, compared with hardened cement paste, mortar and concrete.

Fracture energy and softening behavior of high-strength concrete

An experimental investigation on the fracture properties of high-strength concrete (HSC) is reported. Three-point bend beam specimens of size 100 x 100 x 500 mm were used as per RILEM-FMC 50 recommendations. The influence of maximum size of coarse aggregate on fracture energy, fracture toughness, and characteristic length of concrete has been studied. The compressive strength of concrete ranged between 40 and 75 MPa. Relatively brittle fracture behavior was observed with the increase in compressive strength. The load-CMOD relationship is linear in the ascending portion and gradually drops off after the peak value in the descending portion. The length of the tail end portion of the softening curve increases as the size of coarse aggregate increases. The fracture energy increases as the maximum size of coarse aggregate and compressive strength of concrete increase. The characteristic length of concrete increases with the maximum size of coarse aggregate and decreases as the compressive strength increases, (C) 2002 Elsevier Science Ltd. All rights reserved.

Improving web server performance by network aware data buffering and caching

In this paper we propose a new method of data handling for web servers. We call this method Network Aware Buffering and Caching (NABC for short). NABC facilitates reduction of data copies in web server's data sending path, by doing three things: (1) Layout the data in main memory in a way that protocol processing can be done without data copies (2) Keep a unified cache of data in kernel and ensure safe access to it by various processes and kernel and (3) Pass only the necessary meta data between processes so that bulk data handling time spent during IPC can be reduced. We realize NABC by implementing a set of system calls and an user library. The end product of the implementation is a set of APIs specifically designed for use by the web servers. We port an in house web server called SWEET, to NABC APIs and evaluate performance using a range of workloads both simulated and real. The results show a very impressive gain of 12% to 21% in throughput for static file serving and 1.6 to 4 times gain in throughput for lightweight dynamic content serving for a server using NABC APIs over the one using UNIX APIs.

Performance analysis of the random early detection algorithm

In this article we consider a finite queue with its arrivals controlled by the random early detection algorithm. This is one of the most prominent congestion avoidance schemes in the Internet routers. The aggregate arrival stream from the population of transmission control protocol sources is locally considered stationary renewal or Markov modulated Poisson process with general packet length distribution. We study the exact dynamics of this queue and provide the stability and the rates of convergence to the stationary distribution and obtain the packet loss probability and the waiting time distribution. Then we extend these results to a two traffic class case with each arrival stream renewal. However, computing the performance indices for this system becomes computationally prohibitive. Thus, in the latter half of the article, we approximate the dynamics of the average queue length process asymptotically via an ordinary differential equation. We estimate the error term via a diffusion approximation. We use these results to obtain approximate transient and stationary performance of the system. Finally, we provide some computational examples to show the accuracy of these approximations.

Synthesis and characterization of novel cationic lipid and cholesterol-coated gold nanoparticles and their interactions with dipalmitoylphosphatidylcholine membranes

Novel gold nanoparticles bearing cationic single-chain, double-chain, and cholesterol based amphiphilic units have been synthesized. These nanoparticles represent size-stable entities in which various cationic lipids have been immobilized through their thiol group onto the gold nanoparticle core. The resulting colloids have been characterized by UV-vis, (1)H NMR, FT-IR spectroscopy, and transmission electron microscopy. The average size of the resultant nanoparticles could be controlled by the relative bulkiness of the capping agent. Thus, the average diameters of the nanoparticles formed from the cationic single-chain, double-chain, and cholesterol based thiolate-coated materials were 5.9,2.9, and 2.04 nm, respectively. We also examined the interaction of these cationic gold nanoparticles with vesicular membranes generated from dipalmitoylphosphatidylcholine (DPPC) lipid suspensions. Nanoparticle doped DPPC vesicular suspensions displayed a characteristic surface plasmon band in their UV-vis spectra. Inclusion of nanoparticles in vesicular suspensions led to increases in the aggregate diameters, as evidenced from dynamic light scattering. Differential scanning calorimetric examination indicated that incorporation of single-chain, double-chain, and cholesteryl-linked cationic nanoparticles exert variable effects on the DPPC melting transitions. While increased doping of single-chain nanoparticles in DPPC resulted in the phases that melt at higher temperatures, inclusion of an incremental amount of double-chain nanoparticles caused the lowering of the melting temperature of DPPC. On the other hand, the cationic cholesteryl nanoparticle interacted with DPPC in membranes in a manner somewhat analogous to that of cholesterol itself and caused broadening of the DPPC melting transition.

Autonomous and non-autonomous traits mediate social cooperation in Dictyostelium discoideum

In the trishanku (triA(-)) mutant of the social amoeba Dictyostelium discoideum, aggregates are smaller than usual and the spore mass is located mid-way up the stalk, not at the apex. We have monitored aggregate territory size, spore allocation and fruiting body morphology in chimaeric groups of (quasi-wild-type) Ax2 and triA(-) cells. Developmental canalisation breaks down in chimaeras and leads to an increase in phenotypic variation. A minority of triA(-) cells causes largely Ax2 aggregation streams to break up; the effect is not due to the counting factor. Most chimaeric fruiting bodies resemble those of Ax2 or triA(-). Others are double-deckers with a single stalk and two spore masses, one each at the terminus and midway along the stalk. The relative number of spores belonging to the two genotypes depends both on the mixing ratio and on the fruiting body morphology. In double-deckers formed from 1:1 chimaeras, the upper spore mass has more Ax2 spores, and the lower spore mass more triA(-) spores, than expected. Thus, the traits under study depend partly on the cells' own genotype and partly on the phenotypes, and so genotypes, of other cells: they are both autonomous and non-autonomous. These findings strengthen the parallels between multicellular development and behaviour in social groups. Besides that, they reinforce the point that a trait can be associated with a genotype only in a specified context.

A Coalitional Game Framework for Cooperative Secondary Spectrum Access

We consider a framework in which several service providers offer downlink wireless data access service in a certain area. Each provider serves its end-users through opportunistic secondary spectrum access of licensed spectrum, and needs to pay primary license holders of the spectrum usage based and membership based charges for such secondary spectrum access. In these circumstances, if providers pool their resources and allow end-users to be served by any of the cooperating providers, the total user satisfaction as well as the aggregate revenue earned by providers may increase. We use coalitional game theory to investigate such cooperation among providers, and show that the optimal cooperation schemes can be obtained as solutions of convex optimizations. We next show that under usage based charging scheme, if all providers cooperate, there always exists an operating point that maximizes the aggregate revenue of providers, while presenting each provider a share of the revenue such that no subset of providers has an incentive to leave the coalition. Furthermore, such an operating point can be computed in polynomial time. Finally, we show that when the charging scheme involves membership based charges, the above result holds in important special cases.

Impact of Energy Expenditure Rate Constraints on the performance of Multihop Wireless Mesh Networks

In this article we study the problem of joint congestion control, routing and MAC layer scheduling in multi-hop wireless mesh network, where the nodes in the network are subjected to maximum energy expenditure rates. We model link contention in the wireless network using the contention graph and we model energy expenditure rate constraint of nodes using the energy expenditure rate matrix. We formulate the problem as an aggregate utility maximization problem and apply duality theory in order to decompose the problem into two sub-problems namely, network layer routing and congestion control problem and MAC layer scheduling problem. The source adjusts its rate based on the cost of the least cost path to the destination where the cost of the path includes not only the prices of the links in it but also the prices associated with the nodes on the path. The MAC layer scheduling of the links is carried out based on the prices of the links. We study the e�ects of energy expenditure rate constraints of the nodes on the optimal throughput of the network.

Time dependent deformations in concrete: A multi-scale approach

Estimation of creep and shrinkage are critical in order to compute loss of prestress with time in order to compute leak tightness and assess safety margins available in containment structures of nuclear power plants. Short-term creep and shrinkage experiments have been conducted using in-house test facilities developed specifically for the present research program on 35 and 45 MPa normal concrete and 25 MPa heavy density concrete. The extensive experimental program for creep, has cylinders subject to sustained levels of load typically for several days duration (till negligible strain increase with time is observed in the creep specimen), to provide the total creep strain versus time curves for the two normal density concrete grades and one heavy density concrete grade at different load levels, different ages at loading, and at different relative humidity’s. Shrinkage studies on prism specimen for concrete of the same mix grades are also being studied. In the first instance, creep and shrinkage prediction models reported in the literature has been used to predict the creep and shrinkage levels in subsequent experimental data with acceptable accuracy. While macro-scale short experiments and analytical model development to estimate time dependent deformation under sustained loads over long term, accounting for the composite rheology through the influence of parameters such as the characteristic strength, age of concrete at loading, relative humidity, temperature, mix proportion (cement: fine aggregate: coarse aggregate: water) and volume to surface ratio and the associated uncertainties in these variables form one part of the study, it is widely believed that strength, early age rheology, creep and shrinkage are affected by the material properties at the nano-scale that are not well established. In order to understand and improve cement and concrete properties, investigation of the nanostructure of the composite and how it relates to the local mechanical properties is being undertaken. While results of creep and shrinkage obtained at macro-scale and their predictions through rheological modeling are satisfactory, the nano and micro indenting experimental and analytical studies are presently underway. Computational mechanics based models for creep and shrinkage in concrete must necessarily account for numerous parameters that impact their short and long term response. A Kelvin type model with several elements representing the influence of various factors that impact the behaviour is under development. The immediate short term deformation (elastic response), effects of relative humidity and temperature, volume to surface ratio, water cement ratio and aggregate cement ratio, load levels and age of concrete at loading are parameters accounted for in this model. Inputs to this model, such as the pore structure and mechanical properties at micro/nano scale have been taken from scanning electron microscopy and micro/nano-indenting of the sample specimen.

STEM+: A Fair and Efficient Algorithm for Scheduling on the DSCH in UMTS Networks

In Universal Mobile Telecommunication Systems (UMTS), the Downlink Shared Channel (DSCH) can be used for providing streaming services. The traffic model for streaming services is different from the commonly used continuously- backlogged model. Each connection specifies a required service rate over an interval of time, k, called the "control horizon". In this paper, our objective is to determine how k DSCH frames should be shared among a set of I connections. We need a scheduler that is efficient and fair and introduce the notion of discrepancy to balance the conflicting requirements of aggregate throughput and fairness. Our motive is to schedule the mobiles in such a way that the schedule minimizes the discrepancy over the k frames. We propose an optimal and computationally efficient algorithm, called STEM+. The proof of the optimality of STEM+, when applied to the UMTS rate sets is the major contribution of this paper. We also show that STEM+ performs better in terms of both fairness and aggregate throughput compared to other scheduling algorithms. Thus, STEM+ achieves both fairness and efficiency and is therefore an appealing algorithm for scheduling streaming connections.

On the Limits of Spatial Reuse and Cooperative Communication for Dense Wireless Networks

We consider a dense ad hoc wireless network comprising n nodes confined to a given two dimensional region of fixed area. For the Gupta-Kumar random traffic model and a realistic interference and path loss model (i.e., the channel power gains are bounded above, and are bounded below by a strictly positive number), we study the scaling of the aggregate end-to-end throughput with respect to the network average power constraint, P macr, and the number of nodes, n. The network power constraint P macr is related to the per node power constraint, P macr, as P macr = np. For large P, we show that the throughput saturates as Theta(log(P macr)), irrespective of the number of nodes in the network. For moderate P, which can accommodate spatial reuse to improve end-to-end throughput, we observe that the amount of spatial reuse feasible in the network is limited by the diameter of the network. In fact, we observe that the end-to-end path loss in the network and the amount of spatial reuse feasible in the network are inversely proportional. This puts a restriction on the gains achievable using the cooperative communication techniques studied in and, as these rely on direct long distance communication over the network.

Jointly Optimal Power Control and Hop Length for a Single Cell, Dense, Ad hoc Wireless Network

We consider a dense, ad hoc wireless network confined to a small region, such that direct communication is possible between any pair of nodes. The physical communication model is that a receiver decodes the signal from a single transmitter, while treating all other signals as interference. Data packets are sent between source-destination pairs by multihop relaying. We assume that nodes self-organise into a multihop network such that all hops are of length d meters, where d is a design parameter. There is a contention based multiaccess scheme, and it is assumed that every node always has data to send, either originated from it or a transit packet (saturation assumption). In this scenario, we seek to maximize a measure of the transport capacity of the network (measured in bit-meters per second) over power controls (in a fading environment) and over the hop distance d, subject to an average power constraint. We first argue that for a dense collection of nodes confined to a small region, single cell operation is efficient for single user decoding transceivers. Then, operating the dense ad hoc network (described above) as a single cell, we study the optimal hop length and power control that maximizes the transport capacity for a given network power constraint. More specifically, for a fading channel and for a fixed transmission time strategy (akin to the IEEE 802.11 TXOP), we find that there exists an intrinsic aggregate bit rate (Thetaopt bits per second, depending on the contention mechanism and the channel fading characteristics) carried by the network, when operating at the optimal hop length and power control. The optimal transport capacity is of the form dopt(Pmacrt) x Thetaopt with dopt scaling as Pmacrt 1 /eta, where Pmacrt is the available time average transmit power and eta is the path loss exponent. Under certain conditions on the fading distribution, we then pro- - vide a simple characterisation of the optimal operating point.

Executable Analysis using Abstract Interpretation with Circular Linear Progressions

We propose a new abstract domain for static analysis of executable code. Concrete states are abstracted using circular linear progressions (CLPs). CLPs model computations using a finite word length as is seen in any real life processor. The finite abstraction allows handling overflow scenarios in a natural and straight-forward manner. Abstract transfer functions have been defined for a wide range of operations which makes this domain easily applicable for analyzing code for a wide range of ISAs. CLPs combine the scalability of interval domains with the discreteness of linear congruence domains. We also present a novel, lightweight method to track linear equality relations between static objects that is used by the analysis to improve precision. The analysis is efficient, the total space and time overhead being quadratic in the number of static objects being tracked.

Register File Energy Optimization for Snooping Based Clustered VLIW Architectures

Frequent accesses to the register file make it one of the major sources of energy consumption in ILP architectures. The large number of functional units connected to a large unified register file in VLIW architectures make power dissipation in the register file even worse because of the need for a large number of ports. High power dissipation in a relatively smaller area occupied by a register file leads to a high power density in the register file and makes it one of the prime hot-spots. This makes it highly susceptible to the possibility of a catastrophic heatstroke. This in turn impacts the performance and cost because of the need for periodic cool down and sophisticated packaging and cooling techniques respectively. Clustered VLIW architectures partition the register file among clusters of functional units and reduce the number of ports required thereby reducing the power dissipation. However, we observe that the aggregate accesses to register files in clustered VLIW architectures (and associated energy consumption) become very high compared to the centralized VLIW architectures and this can be attributed to a large number of explicit inter-cluster communications. Snooping based clustered VLIW architectures provide very limited but very fast way of inter-cluster communication by allowing some of the functional units to directly read some of the operands from the register file of some of the other clusters. In this paper, we propose instruction scheduling algorithms that exploit the limited snooping capability to reduce the register file energy consumption on an average by 12% and 18% and improve the overall performance by 5% and 11% for a 2-clustered and a 4-clustered machine respectively, over an earlier state-of-the-art clustered scheduling algorithm when evaluated in the context of snooping based clustered VLIW architectures.