468 research outputs found

    Computational Study of the Optimum Gradient Magnetic Field for the Navigation of the Spherical Particles in the Process of Cleaning the Water from Heavy Metals

    Get PDF
    AbstractThe usage of magnetic spherical nanoparticles, coated with substances and driven to targeted areas in tanks, is proposed for cleaning the water from heavy metals. In the present paper, a computational study for the estimation of the optimum gradient magnetic field is presented in order to ensure the optimum driving of the particles into the targeted area. The optimization of the gradient magnetic field rates’ is verified with the particles’ deviation from a desired trajectory. Using the above mentioned method, it was depicted that with the increase of the optimization parameters number, the particles’ deviation from the desired trajectory is decreased

    Oct-2, although not required for early B-cell development, is critical for later B-cell maturation and for postnatal survival

    Get PDF
    Oct-2, a POU homeo domain transcription factor, is believed to stimulate B-cell-restricted expression of immunoglobulin genes through binding sites in immunoglobulin gene promoters and enhancers. To determine whether Oct-2 is required for B-cell development or function, or has other developmental roles, the gene was disrupted by homologous recombination. Oct-2^(-/-) mice develop normally but die within hours of birth for undetermined reasons. Mutants contain normal numbers of B-cell precursors but are somewhat deficient in IgM+ B cells. These B cells have a marked defect in their capacity to secrete immunoglobulin upon mitogenic stimulation in vitro. Thus, Oct-2 is not required for the generation of immunoglobulin-bearing B cells but is crucial for their maturation to immunoglobulin-secreting cells and for another undetermined organismal function

    Private Stateful Information Retrieval

    Get PDF
    Private information retrieval (PIR) is a fundamental tool for preserving query privacy when accessing outsourced data. All previous PIR constructions have significant costs preventing widespread use. In this work, we present private stateful information retrieval (PSIR), an extension of PIR, allowing clients to be stateful and maintain information between multiple queries. Our design of the PSIR primitive maintains three important properties of PIR: multiple clients may simultaneously query without complex concurrency primitives, query privacy should be maintained if the server colludes with other clients, and new clients should be able to enroll into the system by exclusively interacting with the server. We present a PSIR framework that reduces an online query to performing one single-server PIR on a sub-linear number of database records. All other operations beyond the single-server PIR consist of cryptographic hashes or plaintext operations. In practice, the dominating costs of resources occur due to the public-key operations involved with PIR. By reducing the input database to PIR, we are able to limit expensive computation and avoid transmitting large ciphertexts. We show that various instantiations of PSIR reduce server CPU by up to 10x and online network costs by up to 10x over the previous best PIR construction

    Clinical profile and treatment of infantile spasms using vigabatrin and ACTH - a developing country perspective

    Get PDF
    Background: Infantile spasms represent a serious epileptic syndrome that occurs in the early infantile age. ACTH and Vigabatrin are actively investigated drugs in its treatment. This study describes the comparison of their efficacy in a large series of Patients with infantile spasms from Pakistan. Methods: All Patients with infantile spasms who presented to Aga Khan University Hospital, Karachi, Pakistan from January, 2006 to April, 2008 were included in this study. Inclusion criteria were clinical symptoms of infantile spasms, hypsarrythmia or modified hyparrythmia on electroencephalography, at least six months of follow-up period and receipt of any of the two drugs mentioned above. The type of drug distribution was random according to the availability, cost and ease of administration. Results: Fifty six cases fulfilled the inclusion criteria. 62.5% were males. Mean age at onset of seizures was 5 +/- 1.4 months. Fifty two (92.8%) Patients demonstrated hypsarrythmia on electroencephalography. 64.3% cases were identified as symptomatic while 19.6% were cryptogenic and 16.1% were idiopathic. Eighteen Patients received ACTH while 38 Patients received Vigabatrin as first line therapy. Initial response to first line therapy was similar (50% for ACTH and 55.3% for Vigabatrin). Overall, the symptomatic and idiopathic groups responded better to Vigabatrin. The relapse rate was higher for ACTH as compared to Vigabatrin (55.5% vs. 33.3%) when considering the first line therapy. Four Patients evolved to Lennox-Gastaut variant, all of these Patients had initially received Vigabatrin and then ACTH. Conclusion: Vigabatrin and ACTH showed no significant difference in the initial treatment of infantile spasms. However, Patients receiving ACTH were 1.2 times more likely to relapse as compared to the Patients receiving Vigabatrin when considering monotherapy. We suggest that Vigabatrin should be the initial drug of choice in Patients presenting with infantile spasms. However, larger studies from developing countries are required to validate the therapeutic trends observed in this study

    Proofs of Space: When Space Is of the Essence

    Get PDF
    Proofs of computational effort were devised to control denial of service attacks. Dwork and Naor (CRYPTO ’92), for example, proposed to use such proofs to discourage spam. The idea is to couple each email message with a proof of work that demonstrates the sender performed some computational task. A proof of work can be either CPU-bound or memory-bound. In a CPU-bound proof, the prover must compute a CPU-intensive function that is easy to check by the verifier. A memory-bound proof, instead, forces the prover to access the main memory several times, effectively replacing CPU cycles with memory accesses. In this paper we put forward a new concept dubbed proof of space. To compute such a proof, the prover must use a specified amount of space, i.e., we are not interested in the number of accesses to the main memory (as in memory-bound proof of work) but rather on the amount of actual memory the prover must employ to compute the proof. We give a complete and detailed algorithmic description of our model. We develop a comprehensive theoretical analysis which uses combinatorial tools from Complexity Theory (such as pebbling games) which are essential in studying space lower bounds

    Proof of Space from Stacked Expanders

    Get PDF
    Recently, proof of space (PoS) has been suggested as a more egalitarian alternative to the traditional hash-based proof of work. In PoS, a prover proves to a verifier that it has dedicated some specified amount of space. A closely related notion is memory-hard functions (MHF), functions that require a lot of memory/space to compute. While making promising progress, existing PoS and MHF have several problems. First, there are large gaps between the desired space-hardness and what can be proven. Second, it has been pointed out that PoS and MHF should require a lot of space not just at some point, but throughout the entire computation/protocol; few proposals considered this issue. Third, the two existing PoS constructions are both based on a class of graphs called superconcentrators, which are either hard to construct or add a logarithmic factor overhead to efficiency. In this paper, we construct PoS from stacked expander graphs. Our constructions are simpler, more efficient and have tighter provable space-hardness than prior works. Our results also apply to a recent MHF called Balloon hash. We show Balloon hash has tighter space-hardness than previously believed and consistent space-hardness throughout its computation

    Methanogens, sulphate and heavy metals: a complex system

    Get PDF
    Anaerobic digestion (AD) is a well-established technology used for the treatment of wastes and wastewaters with high organic content. During AD organic matter is converted stepwise to methane-containing biogasa renewable energy carrier. Methane production occurs in the last AD step and relies on methanogens, which are rather sensitive to some contaminants commonly found in wastewaters (e.g. heavy metals), or easily outcompeted by other groups of microorganisms (e.g. sulphate reducing bacteria, SRB). This review gives an overview of previous research and pilot-scale studies that shed some light on the effects of sulphate and heavy metals on methanogenesis. Despite the numerous studies on this subject, comparison is not always possible due to differences in the experimental conditions used and parameters explained. An overview of the possible benefits of methanogens and SRB co-habitation is also covered. Small amounts of sulphide produced by SRB can precipitate with metals, neutralising the negative effects of sulphide accumulation and free heavy metals on methanogenesis. Knowledge on how to untangle and balance sulphate reduction and methanogenesis is crucial to take advantage of the potential for the utilisation of biogenic sulphide as a metal detoxification agent with minimal loss in methane production in anaerobic digesters.The research was financially supported by the People Program (Marie Curie Actions) of the European Union's Seventh Framework Programme FP7/2007-2013 under REA agreement 289193

    Measurement of the Quark and Gluon Fragmentation Functions in Z0Z^0 Hadronic Decays

    Get PDF
    The fragmentation functions and multiplicities in bbb\overline{b} and light quark events are compared. The measured transverse and longitudinal components of the fragmentation function allow the gluon fragmentation function to be evaluated

    First Measurement of the Strange Quark Asymmetry at the Z0Z^{0} Peak

    Get PDF
    corecore