Randomized scheduling algorithms for high-aggregate bandwidth switches

The aggregate bandwidth of a switch is its port count multiplied by its operating line rate. We consider switches with high-aggregate bandwidths; for example, a 30-port switch operating at 40 Gb/s or a 1000-port switch operating at 1 Gb/s. Designing high-performance schedulers for such switches with input queues is a challenging problem for the following reasons: (1) high performance requires finding good matchings; (2) good matchings take time to find; and (3) in high-aggregate bandwidth switches there is either too little time (due to high line rates) or there is too much work to do (due to a high port count). We exploit the following features of the switching problem to devise simple-to-implement, high-performance schedulers for high-aggregate bandwidth switches: (1) the state of the switch (carried in the lengths of its queues) changes slowly with time, implying that heavy matchings will likely stay heavy over a period of time and (2) observing arriving packets will convey useful information about the state of the switch. The above features are exploited using hardware parallelism and randomization to yield three scheduling algorithms - APSARA, LAURA, and SERENA. These algorithms are shown to achieve 100% throughput and simulations show that their delay performance is quite close to that of the maximum weight matching, even when the traffic is correlated. We also consider the stability property of these algorithms under generic admissible traffic using the fluid-model technique. The main contribution of this paper is a suite of simple to implement, high-performance scheduling algorithms for input-queued switches. We exploit a novel operation, called MERGE, which combines the edges of two matchings to produce a heavier match, and study of the properties of this operation via simulations and theory. The stability proof of the randomized algorithms we present involves a derandomization procedure and uses methods which may have wider applicability.     

Activity of microemulsion-based nanoparticles at the human bio-nano interface: concentration-dependent effects on thrombosis and hemolysis in whole blood

Background: Although microemulsion-based nanoparticles (MEs) may be useful for drug delivery or scavenging, these benefits must be balanced against potential nanotoxicological effects in biological tissue (bio-nano interface). We investigated the actions of assembled MEs and their individual components at the bio-nano interface of thrombosis and hemolysis in human blood. Methods: Oil-in-water MEs were synthesized using ethylbutyrate, sodium caprylate, and pluronic F-68 (ME4) or F-127 (ME6) in 0.9% NaCl_w/v. The effects of MEs or components on thrombosis were determined using thrombo-elastography, platelet contractile force, clot elastic modulus, and platelet counting. For hemolysis, ME or components were incubated with erythrocytes, centrifuged, and washed for measurement of free hemoglobin by spectroscopy. Results and conclusions: The mean particle diameters (polydispersity index) for ME6 and ME4 were 23.6 ± 2.5 nm (0.362) and 14.0 ± 1.0 nm (0.008), respectively. MEs (0, 0.03, 0.3, 3 mM) markedly reduced the thromboelastograph maximal amplitude in a concentration-dependent manner (49.0 ± 4.2, 39.0 ± 5.6, 15.0 ± 8.7, 3.8 ± 1.3 mm, respectively), an effect highly correlated (r2 = 0.94) with similar changes caused by pluronic surfactants (48.7 ± 10.9, 30.7 ± 15.8, 20.0 ± 11.3, 2.0 ± 0.5) alone. Neither oil nor sodium caprylate alone affected the thromboelastograph. The clot contractile force was reduced by ME (27.3 ± 11.1–6.7 ± 3.4 kdynes/cm², P = 0.02, n = 5) whereas the platelet population not affected (175 ± 28–182 ± 23 10⁶/ml, P = 0.12, n = 6). This data suggests that MEs reduced platelet activity due to associated pluronic surfactants, but caused minimal changes in protein function necessary for coagulation. Although pharmacological concentrations of sodium caprylate caused hemolysis (EC₅₀ = 213 mM), MEs and pluronic surfactants did not disrupt erythrocytes. Knowledge of nanoparticle activity and potential associated nanotoxicity at this bio-nano interface enables rational ME design for in vivo applications.     

Video compression using spatiotemporal regularity flow.

We propose a new framework in wavelet video coding to improve the compression rate by exploiting the spatiotemporal regularity of the data. A sequence of images creates a spatiotemporal volume. This volume is said to be regular along the directions in which the pixels vary the least, hence the entropy is the lowest. The wavelet decomposition of regularized data results in a fewer number of significant coefficients, thus yielding a higher compression rate. The directions of regularity of an image sequence depend on both its motion content and spatial structure. We propose the representation of these directions by a 3-D vector field, which we refer to as the spatiotemporal regularity flow (SPREF). SPREF uses splines to approximate the directions of regularity. The compactness of the spline representation results in a low storage overhead for SPREF, which is a desired property in compression applications. Once SPREF directions are known, they can be converted into actual paths along which the data is regular. Directional decomposition of the data along these paths can be further improved by using a special class of wavelet basis called the 3-D orthonormal bandelet basis. SPREF -based video compression not only removes the temporal redundancy, but it also compensates for the spatial redundancy. Our experiments on several standard video sequences demonstrate that the proposed method results in higher compression rates as compared to the standard wavelet based compression.     

A flexible and generic approach to dynamic modelling of supply chains

In this paper, we present a new modelling approach for realistic supply chain simulation. The model provides an experimental environment for informed comparison between different supply chain policies. A basic simulation model for a generic node, from which a supply chain network can be built, has been developed using an object-oriented approach. This generic model allows the incorporation of the information and physical systems and decision-making policies used by each node. The object-oriented approach gives the flexibility in specifying the supply chain configuration and operation decisions, and policies. Stochastic simulations are achieved by applying Latin Supercube Sampling to the uncertain variables in descending order of importance, which reduces the number of simulations required. We also present a case study to show that the model is applicable to a real-life situation for dynamic stochastic studies.     

Some inequalities for the polar derivative of a polynomial

LetP(z) be a polynomial of degreen which does not vanish in |z|<1. In this paper, we estimate the maximum and minimum moduli of thekth polar derivative ofP(z) on |z|=1 and thereby obtain compact generalizations of some known results, which among other results, yields interesting refinements of Erdos-Lax theorem and a theorem of Ankeny and Rivlin.     

Lowpass and bandpass transadmittance filter using operational amplifier pole

A new topology simultaneously implementing lowpass (LP) and bandpass (BP) transadmittance filtering signals using a single operational amplifier (OA), one capacitor, and two resistors is presented. The input impedance is very high which is essential for cascading without employment of buffers. The circuit uses absolute minimum number of active and passive components. The filter employs pole-model of OA and as such has acquired suitability for extended frequency operation. The circuit permits separate adjustment of natural frequency (ω₀) and quality factor (Q) in an orthogonal manner. The circuit has low sensitivity figures unlike the reported single amplifier biquads. The PSPICE simulation results are included.     

Efficient dissemination of personalized information using content-based multicast

There has been a surge of interest in the delivery of personalized information to users (e.g., personalized stocks or travel information), particularly as mobile users with limited terminal device capabilities increasingly desire updated and targeted information in real time. When the number of information recipients is large and there is sufficient commonality in their interests, as is often the case, IP multicast is an efficient way of delivering the information. However, IP multicast services do not consider the structure and semantics of the information in the multicast process. We propose the use of Content-Based Multicast (CBM) where extra content filtering is performed at the interior nodes of the IP multicast tree; this will reduce network bandwidth usage and delivery delay, as well as the computation required at the sources and sinks. We evaluate the situations in which CBM is advantageous. The benefits of CBM depend critically upon how well filters are placed at interior nodes of the IP multicast tree and the costs depend upon those introduced by filters themselves. Further, we consider the benefits of allowing the filters to be mobile so as to respond to user mobility or changes in user interests and the corresponding costs of filter mobility. The criterion that we consider is the total network bandwidth utilization. For this criterion, we develop an optimal filter placement algorithm, as well as a heuristic that executes faster than the optimal algorithm. We evaluate the algorithms by means of simulation experiments. Our results indicate that filters can be effective in substantially reducing bandwidth. We also find filter mobility is worthwhile if there is marked large-scale user mobility. We conclude with suggestions for further work.     

Diastereoselective formation of 2-aryl-3-arenesulfonyl 4-ethyl-1,3-oxazolidines: An X-ray crystallographic and H NMR study

N-Arylsulfonamides of (R)- and (S)-2-amino-1-butanol, on condensation with aromatic aldehydes produced diastereomerically pure 2-aryl-3-arenesulfonyl 4-ethyl-1,3-oxazolidines. The absolute configurations of one enantiomeric pair have been determined from two fully refined X-ray structures, supplemented by nmr data.     

某些查耳酮化合物的发光

本文叙述了两个同质查耳酮系列的合成.一个带有查耳酮中心链(系列Ⅰ),另一个是系列Ⅰ的酯类(系列Ⅱ).研究了每个系列中三种化合物的发光,发现两个系列的所有化合物都能见到发光.系列Ⅰ中的化合物在峰值为360nm处可见到发光,而系Ⅱ列中的化合物未能观测到这一波长的发光.然而,在峰值为470nm处两者均可见到发光.得出的结论是,消除非键电子微扰作用的氢键是系列Ⅰ中的化合物在360nm处出现发光的原因.     

Application of the finite Hankel transform to a diffusion problem without azimuthal symmetry

The problem treated in this paper concerns calculating the evolution of the pressure in a single-phase, slightly compressible fluid in a porous medium consisting of communicating layers. The fluid is produced through a point sink located on the side of an otherwise sealed cylindrical wellbore. This location of the sink causes the flow around the wellbore to be azimuthally asymmetric.The problem is solved through successive application of Laplace, finite Fourier and finite Hankel transforms. Although apparently straightforward, this approach leads to serious numerical difficulties. The published form of the inversion formula for the finite Hankel transform leads to inaccurate computation for the higher azimuthal modes even with 128 bit arithmetic. An alternative form is developed which enables accurate evaluation of the solution with the more practical 64 bit arithmetic. The technique for two-layer solution presented here can be directly extended to a problem with a larger number of communicating layers. This is the first instance of successful application of the finite Hankel transform to an azimuthally asymmetric diffusion problem.