Detecting stable locality-aware predicates

In a large-scale locality-driven network such as in modular robotics and wireless sensor networks, knowing the state of a local area is sometimes necessary due to either interactions being local and driven by neighborhood proximity or the users being interested in the state of a certain region. We define locality-aware predicates (LAP) that aim at detecting a predicate within a specified area. We model the area of interest as the set of processes that are within a breadth-first search tree (BFST) of height k$k$ rooted at the initiator process. Although a locality-aware predicate specifies a predicate only within a local area, observing the area consistently requires considering the entire system in a consistent manner. This raises the challenge of making the complexities of the corresponding predicate detection algorithms scale-free, i.e., independent of the size of the system. Since all existing algorithms for getting a consistent view of the system require either a global snapshot of the entire system or vector clocks of the size of the system, a new solution is needed. We focus on stable LAP, which are those LAP that remain true once they become true. We propose a scale-free algorithm to detect stable LAP within a k$k$-height BFST. Our algorithm can detect both stable conjunctive LAP and stable relational LAP. In the process of designing our algorithm, we also propose the first distributed algorithm for building a BFST within an area of interest in a graph, and the first distributed algorithm for recording a consistent sub-cut within the area of interest. This paper demonstrates that LAPs are a natural fit for detecting distributed properties in large-scale distributed systems, and stable LAPs can be practically detected at low cost.     

Biomathematical study of time-dependent flow of a Carreau nanofluid through inclined catheterized arteries with overlapping stenosis

Journal of Central South University - This work is concerned with the analysis of blood flow through inclined catheterized arteries having a balloon (angioplasty) with time-variant overlapping...     

Power Control for Cognitive Radio Networks: A Game Theoretic Approach

In communication industry one of the most rapidly growing area is wireless technology and its applications. The efficient access to radio spectrum is a requirement to make this communication feasible for the users that are running multimedia applications and establishing real-time connections on an already overcrowded spectrum. In recent times cognitive radios (CR) are becoming the prime candidates for improved utilization of available spectrum. The unlicensed secondary users share the spectrum with primary licensed user in such manners that the interference at the primary user does not increase from a predefined threshold. In this paper, we propose an algorithm to address the power control problem for CR networks. The proposed solution models the wireless system with a non-cooperative game, in which each player maximize its utility in a competitive environment. The simulation results shows that the proposed algorithm improves the performance of the network in terms of high SINR and low power consumption.

     

A domain decomposition strategy for alignment of multiple biological sequences on multiprocessor platforms

Multiple Sequences Alignment (MSA) of biological sequences is a fundamental problem in computational biology due to its critical significance in wide ranging applications including haplotype reconstruction, sequence homology, phylogenetic analysis, and prediction of evolutionary origins. The MSA problem is considered NP-hard and known heuristics for the problem do not scale well with increasing numbers of sequences. On the other hand, with the advent of a new breed of fast sequencing techniques it is now possible to generate thousands of sequences very quickly. For rapid sequence analysis, it is therefore desirable to develop fast MSA algorithms that scale well with an increase in the dataset size. In this paper, we present a novel domain decomposition based technique to solve the MSA problem on multiprocessing platforms. The domain decomposition based technique, in addition to yielding better quality, gives enormous advantages in terms of execution time and memory requirements. The proposed strategy allows one to decrease the time complexity of any known heuristic of O(N)^x$O{\left(N\right)}^x$ complexity by a factor of O(1/p)^x$O{(1/p)}^x$, where N$N$ is the number of sequences, x$x$ depends on the underlying heuristic approach, and p$p$ is the number of processing nodes. In particular, we propose a highly scalable algorithm, Sample-Align-D, for aligning biological sequences using Muscle system as the underlying heuristic. The proposed algorithm has been implemented on a cluster of workstations using the MPI library. Experimental results for different problem sizes are analyzed in terms of quality of alignment, execution time and speed-up.     

Deformation and water loss from solvent filled microcapsules under compressive loads

Microcapsules filled with liquid solvents for CO₂ absorption can be easily deformed due to their elastic polymer shells. We present a combination of experiments and model predictions to demonstrate that modest compressive forces can lead to significant capsule deformation and performance issues for this enabling technology. Contrary to expectations based on Raoult's law, capsules containing aqueous carbonate solution were found to lose water to flows of humidified nitrogen in centimeter-scale packed beds. Water loss increased with gas velocity, suggesting compression was responsible for mass transfer, an interpretation supported by microscope images of deformed and broken capsules. A model for compression induced mass transfer under packed/fluidized bed operating conditions was developed and validated with the experimental data for a range of conditions (gas velocities, temperatures, humidities). Design criteria for future generations of microcapsules that will more effectively resist compression are evaluated.     

Silver nanoparticle films by flowing gas atmospheric pulsed laser deposition and application to surface-enhanced Raman spectroscopy

For the fast uptake into industrial applications, the further development of robust methods of nanomaterials, which are inexpensive and simultaneously technologically feasible, is one of the major key factors. A newly introduced atmospheric pulsed laser deposition method, based on a flowing gas approach, was used for plasmonic metal nanoparticle (NP) film of silver. Contrary to vacuum, in this method, the ambient air restricts expansion of the ablation plume within 1 to 3 mm above the target surface. These sets constrain on the formation of NP film close to the ablation spot. For deposition on a widely spaced surface, ablation material was entrained in a flow of argon, supplied at ~32 ms⁻¹, and effectively delivered to the substrate at ~20 ms⁻¹. The films produced were crystalline and particulate in nature, showing spectral plasmonic feature of surface plasmon resonance in the visible region. The film was directly tested in surface-enhanced Raman spectroscopy for chemical detection of crystal violet; the film with large particulates and aggregated crystallites was well-performed, showing enhanced Raman signals and detection sensitivity. Certainly, flowing gas atmospheric pulsed laser deposition seems a fast alternative to vacuum-pulsed laser deposition but needs further investigations to bring it in the industry for applications in sensor, catalysis, solar cell, and coating technology.     

SER and throughput analysis of space–time analog network coded relaying system over shadowed Rician fading channels

Wireless Networks - This research article presents an innovative approach based on analog network coding (ANC) in conjunction with space time block coding (STBC) which is termed as space time...     

TSAT is a better predictor than ferritin of hemoglobin response to Epoetin alfa in US dialysis patients

Clinical guidelines recommend concurrent treatment of anemia in end‐stage renal disease with erythropoiesis‐stimulating agents (ESAs) and iron. However, there are mixed data about optimal iron supplementation. To help address this gap, the relationship between iron markers and hemoglobin (Hb) response to ESA (Epoetin alfa) dose was examined. Electronic medical records of 1902 US chronic hemodialysis patients were analyzed over a 12‐month period between June 2009 and June 2010. The analysis included patients who had at least one Hb value during each 4‐week interval for four consecutive intervals (k ? 2, k ? 1, k, and k + 1; k is the index interval), received at least one ESA dose during intervals k ? 1 or k, had at least one transferrin saturation (TSAT) value at interval k, and at least one ferritin value during intervals k ? 2, k ? 1, or k. Effect modification by TSAT and ferritin on Hb response was evaluated using the generalized estimating equations approach. Patients had a mean (standard deviation) age of 62 (15) years; 41% were Caucasian, 34% African American, 65% had hypertension, and 39% diabetes. Transferrin saturation, but not ferritin, had a statistically significant (P < 0.05) modifying effect on Hb response. Maximum Hb response was achieved when TSAT was 34%, with minimal incremental effect beyond these levels. Of the two standard clinical iron markers, TSAT should be used as the primary marker of the modifying effect of iron on Hb response to ESA. Long‐term safety of iron use to improve Hb response to ESA warrants further study.