ANT-colony based disjoint set assortment in wireless sensor networks

Wireless Networks - Wireless sensor network (WSN) consists of small sized devices containing different sensors to monitor physical, environmental and medical conditions during surveillance of...     

A Distributed Routing Method for Dynamic Multicasting

Single point, sender based control does not scale well for multicast delivery. For applications, such as group video or teleconferencing a low total cost multicast tree is required. In this article we present a destination driven algorithm to minimize the total tree cost of multicast tree in a dynamic situation for the whole session duration. In this heuristic approach we considered the staying duration of participants are available at the time of joining. The performance of our algorithm is analyzed through extensive simulation and evaluated against several other existing dynamic multicast routing and also against one well known near optimum heuristic algorithm used for solving Steiner tree problem. We have further tested our algorithm using erroneous information given by the joining participants. Simulation results show that its performance does not degrade that much even when the range of error is considerably high, which proves the robustness of our algorithm.     

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.     

Entangled States Based on Two Coherent States 3π/2 out of Phase

Entangled states based on two coherent states 3π/2 out of phase with each other, i.e. ｜α〉 and e^iФ｜-iα〉, as well as on a special state with a relative phase Ф = ｜α｜^2, are constructed. By analysing the amount of entanglement it is evident that entangled states based on this special state can be used as an excellent resource for quantum teleportation. It is also revealed that these entangled states possess some nonclassical features.     

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.     

Modified Householder iterative method free from second derivatives for nonlinear equations

In this paper, we suggest and analyze a new two-step predictor–corrector type iterative method free from second derivatives for solving nonlinear equations of the type f(x)=0. This new method includes the two-step Newton method as a special case. We prove that the new iterative method is of fourth-order. Several examples are given to illustrate the efficiency of this new method and its comparison with other iterative methods. This method can be considered as a significant improvement of the Newton method and its variant forms.