26 research outputs found
Clustering and Sharing Incentives in BitTorrent Systems
Peer-to-peer protocols play an increasingly instrumental role in Internet
content distribution. Consequently, it is important to gain a full
understanding of how these protocols behave in practice and how their
parameters impact overall performance. We present the first experimental
investigation of the peer selection strategy of the popular BitTorrent protocol
in an instrumented private torrent. By observing the decisions of more than 40
nodes, we validate three BitTorrent properties that, though widely believed to
hold, have not been demonstrated experimentally. These include the clustering
of similar-bandwidth peers, the effectiveness of BitTorrent's sharing
incentives, and the peers' high average upload utilization. In addition, our
results show that BitTorrent's new choking algorithm in seed state provides
uniform service to all peers, and that an underprovisioned initial seed leads
to the absence of peer clustering and less effective sharing incentives. Based
on our observations, we provide guidelines for seed provisioning by content
providers, and discuss a tracker protocol extension that addresses an
identified limitation of the protocol
AI is a viable alternative to high throughput screening: a 318-target study
: High throughput screening (HTS) is routinely used to identify bioactive small molecules. This requires physical compounds, which limits coverage of accessible chemical space. Computational approaches combined with vast on-demand chemical libraries can access far greater chemical space, provided that the predictive accuracy is sufficient to identify useful molecules. Through the largest and most diverse virtual HTS campaign reported to date, comprising 318 individual projects, we demonstrate that our AtomNet® convolutional neural network successfully finds novel hits across every major therapeutic area and protein class. We address historical limitations of computational screening by demonstrating success for target proteins without known binders, high-quality X-ray crystal structures, or manual cherry-picking of compounds. We show that the molecules selected by the AtomNet® model are novel drug-like scaffolds rather than minor modifications to known bioactive compounds. Our empirical results suggest that computational methods can substantially replace HTS as the first step of small-molecule drug discovery
Synthesis of chemical additives and their effect on Akholjuni crude oil (Gujarat, India)
55-61
High paraffin wax content in crude oil creates a variety of
problems during production and transportation through pipelines. One of the
main problems is the crystallization and deposition of paraffin wax crystals in
the flow line which is more severe in winter. Low ambient temperature relative
to pour point of the crude can cause pumping problems. The pour point and rheological
properties of the crude oil can be improved by adding requisite amount of a
pour point depressant (PPD). The present study deals with the synthesis of
copolymers of maleic anhydride and esters of n-alkyl alcohols and
unsaturated acid (C11H20O2). The resulted
copolymers were esterified with two moles of fatty alcohol (C19H36O8).
The products were evaluated as pour point depressant and flow improver on the
Akholjuni crude oil (Gujarat,
India). The
pour point and rheological behaviour of the crude oil with these prepared
additives were studied. The results were encouraging up to the optimum length
of pendant side chains of PPD.
</smarttagtype
Contact sensitivity to dinitrofluorobenzene and oxazolone in mice: in vitro cell-electrophoretic assay.
Publish/Subscribe-Based P2P-Cloud of Underutilized Computing Resources for Providing Computation-as-a-Service
ART: sub-logarithmic decentralized range query processing with probabilistic guarantees
We focus on range query processing on large-scale, typically distributed infrastructures, such as clouds of thousands of nodes of shared-datacenters, of p2p distributed overlays, etc. In such distributed environments, efficient range query processing is the key for managing the distributed data sets per se, and for monitoring the infrastructure’s resources. We wish to develop an architecture that can support range queries in such large-scale decentralized environments and can scale in terms of the number of nodes as well as in terms of the data items stored. Of course, in the last few years there have been a number of solutions (mostly from researchers in the p2p domain) for designing such large-scale systems. However, these are inadequate for our purposes, since at the envisaged scales the classic logarithmic complexity (for point queries) is still too expensive while for range queries it is even more disappointing. In this paper we go one step further and achieve a sub-logarithmic complexity. We contribute the ART (Autonomous Range Tree) structure, which outperforms the most popular decentralized structures, including Chord (and some of its successors), BATON (and its successor) and Skip-Graphs. We contribute theoretical analysis, backed up by detailed experimental results, showing that the communication cost of query and update operations is O(log2blogN) hops, where the base b is a double-exponentially power of two and N is the total number of nodes. Moreover, ART is a fully dynamic and fault-tolerant structure, which supports the join/leave node operations in O(loglogN) expected w.h.p. number of hops. Our experimental performance studies include a detailed performance comparison which showcases the improved performance, scalability, and robustness of ART