11 research outputs found
Comparative Experimental Study on Torsional Behavior of RC Beam Using CFRP and GFRP Fabric Wrapping
AbstractFiber reinforced polymer (FRP) as an external reinforcement is used extensively to enhance the strength requirement related to flexure and shear in structural systems. But the strengthening of members subjected to torsion is yet to be explored as Torsion failure is a brittle form of failure. In present experimental study deals with the torsional strengthening of Reinforced Concrete beams using epoxy bonded Fiber- Reinforced Polymer (FRP) fabric. Total Thirty nine rectangular beams of size 150mm × 300mm and 1200 in length are casted. Out of which, three beams are control beam and remaining thirty six beams are classified into two groups. One with CFRP fabric wrapping and another with GFRP fabric wrapping. With various wrapping patterns. The applied CFRP and GFRP configurations are U-jacketed, vertical strips with spacing, and edge strips along with vertical strips along its entire length. Torsional capacity of beams of two groups is compared with control specimen with respect to torsional moment, angle of twist and ductility factor and it was observed that CFRP fabric bonded beam shows more torsional strength than the GFRP bonded beam
Study of magnetofluidic laser scattering under rotating magnetic field
Magnetic field driven self-assembly of magnetic nanoparticles provides wireless programmable approach for tunable magnetofluidic laser scattering. In this work, we study magnetofluidic laser scattering from a commercial aqueous magnetic fluid (EMG 707) under an external rotating magnetic field. A set-up is developed to generate rotating magnetic field for the purpose. Self-assembled magnetic nanoparticle structures in the form of chains and bundles are formed along the magnetic field. This creates a linear streak formation in the forward laser scattering. Rotating magnetic field produces rotating linear streak. We report our initial results of rotating linear streaks at 3 rpm, 6 rpm and 10 rpm and our analysis of the patterns. The studies are useful for developing magnetic fluid based optical devices.Published versio
Author Correction:SciPy 1.0: fundamental algorithms for scientific computing in Python (Nature Methods, (2020), 10.1038/s41592-019-0686-2)
In the version of this article initially published online, the corresponding author designation was missing for Matt Haberland and Tyler Reddy. The affiliation for Evgeni Burovski was given as Higher School of Economics; the correct affiliation is National Research University, Higher School of Economics. In Box 1, “SciPy is an open-source package that builds on the strengths of Python and Numeric, providing a wide range of fast scientific and numeric functionality” was used as the box title; this has been moved to the beginning of the box text and a new title has been provided: “Excerpt from the SciPy 0.1 release announcement (typos corrected), posted 20 August 2001 on the Python-list mailing list.” From the original first sentence of this box, “(text following the % symbol indicates that a typo in the original text has been corrected in the version reproduced here)” has been deleted, and “% hanker to Hankel” and “% Netwon to Newton” have been deleted from the ends of the special functions row and the optimization row, respectively. In the first sentence of the ndimage section of Box 2, “nonlinear filter” has been changed to plural. At the end of the first paragraph of the section “SciPy matures,” “The library was expanded carefully, with the patience affordable in open-source projects and via best practices common in industry” has been changed to “The library was expanded carefully, with the patience affordable in open-source projects and via best practices, which are increasingly common in the scientific Python ecosystem and industry.” In Table 2, “Inequality constraint” has been changed to plural. In the “Nonlinear optimization: global minimization” section, “scipy.optimize.differentialevolution” had been changed to “scipy.optimize.differential_evolution.” In the first sentence of the section “Maintainers and contributors,” “SciPy developer guide” has been changed to “SciPy contributor guide” and the URL has been changed from http://scipy.github.io/devdocs/dev/core-dev/index. html to https://scipy.github.io/devdocs/dev/contributor/contributor_toc.html. In Table 2, entries in the first column have been changed from capitalized to lower-case. Finally, a URL in the second paragraph of the Discussion has been changed from https://scholar.google. com/scholar?q=SciPy to https://scholar.google.com/scholar?cites=2086009121748039507. The errors have been corrected in the print, HTML and PDF versions of the article. SciPy 1.0 Contributors Aditya Vijaykumar, Alessandro Pietro Bardelli, Alex Rothberg, Andreas Hilboll, Andreas Kloeckner, Anthony Scopatz, Antony Lee, Ariel Rokem, C. Nathan Woods, Chad Fulton, Charles Masson, Christian Häggström, Clark Fitzgerald, David A. Nicholson, David R. Hagen, Dmitrii V. Pasechnik, Emanuele Olivetti, Eric Martin, Eric Wieser, Fabrice Silva, Felix Lenders, Florian Wilhelm, G. Young, Gavin A. Price, Gert-Ludwig Ingold, Gregory E. Allen, Gregory R. Lee, Hervé Audren, Irvin Probst, Jörg P. Dietrich, Jacob Silterra, James T Webber, Janko Slavič, Joel Nothman, Johannes Buchner, Johannes Kulick, Johannes L. Schönberger, José Vinícius de Miranda Cardoso, Joscha Reimer, Joseph Harrington, Juan Luis Cano Rodríguez, Juan Nunez-Iglesias, Justin Kuczynski, Kevin Tritz, Martin Thoma, Matthew Newville, Matthias Kümmerer, Maximilian Bolingbroke, Michael Tartre, Mikhail Pak, Nathaniel J. Smith, Nikolai Nowaczyk, Nikolay Shebanov, Oleksandr Pavlyk, Per A. Brodtkorb, Perry Lee, Robert T. McGibbon, Roman Feldbauer, Sam Lewis, Sam Tygier, Scott Sievert, Sebastiano Vigna, Stefan Peterson, Surhud More, Tadeusz Pudlik, Takuya Oshima, Thomas J. Pingel, Thomas P. Robitaille, Thomas Spura, Thouis R. Jones, Tim Cera, Tim Leslie, Tiziano Zito, Tom Krauss, Utkarsh Upadhyay, Yaroslav O. Halchenko and Yoshiki Vázquez-Baeza.</p
Review on Rasa Manjari - A Text of Indian Alchemy
Ayurveda is a multidimensional science using a set of complex pharmaceutical combinations in treatment. Rasashastra, pharmaceutical science mainly deals with the processing and therapeutic utilization of mercury, metals and minerals. Rasa Manjari is one of the important ancient texts on ancient Indian alchemy written by Shri Shalinatha in Approx. 15th century AD. Two commentaries are available on this text. Subject matter of the text contains total 862 verses which are divided into 10 chapters. There is description of Dhatuvada (conversion of lower metals into higher metals) and Dehavada (therapeutic usage of metals and minerals) of Mercury (Parada). The present paper will highlight the review of Rasa Manjari, providing information about the author, text and contributions.</jats:p
Process of designing robust, dependable, safe and secure software for medical devices: Point of care testing device as a case study
This article has been made available through the Brunel Open Access Publishing Fund.Copyright © 2013 Sivanesan Tulasidas et al. This paper presents a holistic methodology for the design of medical device software, which encompasses of a new way of eliciting requirements, system design process, security design guideline, cloud architecture design, combinatorial testing process and agile project management. The paper uses point of care diagnostics as a case study where the software and hardware must be robust, reliable to provide accurate diagnosis of diseases. As software and software intensive systems are becoming increasingly complex, the impact of failures can lead to significant property damage, or damage to the environment. Within the medical diagnostic device software domain such failures can result in misdiagnosis leading to clinical complications and in some cases death. Software faults can arise due to the interaction among the software, the hardware, third party software and the operating environment. Unanticipated environmental changes and latent coding errors lead to operation faults despite of the fact that usually a significant effort has been expended in the design, verification and validation of the software system. It is becoming increasingly more apparent that one needs to adopt different approaches, which will guarantee that a complex software system meets all safety, security, and reliability requirements, in addition to complying with standards such as IEC 62304. There are many initiatives taken to develop safety and security critical systems, at different development phases and in different contexts, ranging from infrastructure design to device design. Different approaches are implemented to design error free software for safety critical systems. By adopting the strategies and processes presented in this paper one can overcome the challenges in developing error free software for medical devices (or safety critical systems).Brunel Open Access Publishing Fund
The feasibility of using profit and loss sharing for financing small and medium sized enterprises in Saudi Arabia
Saudi Arabia is considered to be an oil-rich country. However, it faces challenges in creating jobs and diversifying Its economy to perpetuate economic growth. Therefore, the role and contribution of small and medium sized enterprises (SMEs) is crucial for the country, leading the government to mitiate a numbe of policy measures. This development goal is fiirthered by the impressive developments in the financial sector. In particular, growth and development of Islamic banking and finance have shown remarkable performance in the country. Such financial developments have a positive impact on the development of SMEs by providing altemative financing options.EThOS - Electronic Theses Online ServiceGBUnited Kingdo
GWTC-3: Compact Binary Coalescences Observed by LIGO and Virgo During the Second Part of the Third Observing Run
The third Gravitational-Wave Transient Catalog (GWTC-3) describes signals
detected with Advanced LIGO and Advanced Virgo up to the end of their third
observing run. Updating the previous GWTC-2.1, we present candidate
gravitational waves from compact binary coalescences during the second half of
the third observing run (O3b) between 1 November 2019, 15:00 UTC and 27 March
2020, 17:00 UTC. There are 35 compact binary coalescence candidates identified
by at least one of our search algorithms with a probability of astrophysical
origin . Of these, 18 were previously reported as
low-latency public alerts, and 17 are reported here for the first time. Based
upon estimates for the component masses, our O3b candidates with
are consistent with gravitational-wave signals from
binary black holes or neutron star-black hole binaries, and we identify none
from binary neutron stars. However, from the gravitational-wave data alone, we
are not able to measure matter effects that distinguish whether the binary
components are neutron stars or black holes. The range of inferred component
masses is similar to that found with previous catalogs, but the O3b candidates
include the first confident observations of neutron star-black hole binaries.
Including the 35 candidates from O3b in addition to those from GWTC-2.1, GWTC-3
contains 90 candidates found by our analysis with
across the first three observing runs. These observations of compact binary
coalescences present an unprecedented view of the properties of black holes and
neutron stars.Comment: 88 pages (10 pages author list, 31 pages main text, 1 page
acknowledgements, 24 pages appendices, 22 pages bibliography), 17 figures, 16
tables. Update to match version to be published in Physical Review X. Data
products available from https://gwosc.org/GWTC-3
Peribulbar versus retrobulbar anaesthesia for cataract surgery.
BACKGROUND: Cataract is a major cause of blindness worldwide. Unless medically contraindicated, cataract surgery is usually performed under local (regional) anaesthesia. Local anaesthesia involves the blockage of a nerve subserving a given part of the body by infiltration of the area around the nerve with local anaesthetic. The two main approaches in the eye are retrobulbar and peribulbar. There is debate over whether the peribulbar approach provides more effective and safer anaesthesia for cataract surgery than retrobulbar block. OBJECTIVES: The objective of this review was to assess the effects of peribulbar anaesthesia (PB) compared to retrobulbar anaesthesia (RB) on pain scores, ocular akinesia, patient acceptability and ocular and systemic complications. SEARCH STRATEGY: We searched the Cochrane Central Register of Controlled Trials (CENTRAL) (The Cochrane Library 2007, Issue 4); MEDLINE (1960 to December 2007); and EMBASE (1980 to December 2007). SELECTION CRITERIA: We included randomized controlled clinical trials comparing peribulbar anaesthesia and retrobulbar anaesthesia for cataract surgery. DATA COLLECTION AND ANALYSIS: Two authors independently assessed trial quality and extracted data. We contacted trial authors for additional information, study methodology and missing data. We carried out a descriptive narrative of results as the methods used by the included stories for reporting the outcomes varied. We performed a subgroup analysis for globe akinesia. MAIN RESULTS: We included six trials involving 1438 participants. Two of the six trials had a low risk of bias; the remaining four had a moderate risk of bias. There was no evidence of any difference in pain perception during surgery with either retrobulbar or peribulbar anaesthesia. Both were largely effective. There was no evidence of any difference in complete akinesia or the need for further injections of local anaesthetic. Conjunctival chemosis was more common after peribulbar block (relative risk (RR) 2.11, 95% confidence Interval (CI) 1.46 to 3.05) and lid haematoma was more common after retrobulbar block (RR 0.36, 95% CI 0.15 to 0.88). Retrobulbar haemorrhage was uncommon and occurred only once, in a patient who had a retrobulbar block. AUTHORS' CONCLUSIONS: There is little to choose between peribulbar and retrobulbar block in terms of anaesthesia and akinesia during surgery in terms of acceptability to patients, need for additional injections and development of severe complications. Severe local or systemic complications were rare in PB and RB
Disjoint out-of-order execution processor
High-performance superscalar architectures used to exploit instruction level parallelism in single-thread applications have become too complex and power hungry for the multicore processors era. We propose a new architecture that uses multiple small latency-tolerant out-of-order cores to improve single-thread performance. Improving single-thread performance with multiple small out-of-order cores allows designers to place more of these cores on the same die. Consequently, emerging highly parallel applications can take full advantage of the multicore parallel hardware without sacrificing performance of inherently serial and hard to parallelize applications. Our architecture combines speculative multithreading (SpMT) with checkpoint recovery and continual flow pipeline architectures. It splits single-thread program execution into disjoint control and data threads that execute concurrently on multiple cooperating small and latency-tolerant out-oforder cores. Hence we call this style of execution Disjoint Out-of-Order Execution (DOE). DOE uses latency tolerance to overcome performance issues of SpMT caused by interthread data dependences. To evaluate this architecture, we have developed a microarchitecture performance model of DOE based on PTLSim, a simulation infrastructure of the x86 instruction set architecture. We evaluate the potential performance of DOE processor architecture using a simple heuristic to fork control independent threads in hardware at the target addresses of future procedure return instructions. Using applications from SpecInt 2000, we study DOE under ideal as well as realistic architectural constraints. We discuss the performance impact of key DOE architecture and application variables such as number of cores, interthread data dependences, intercore data communication delay, buffers capacity, and branch mispredictions. Without any DOE specific compiler optimizations, our results show that DOE outperforms conventional SpMT architectures by 15percent, on average. We also show that DOE with four small cores can perform on average equally well to a large superscalar core, consuming about the same power. Most importantly, DOE improves throughput performance by a significant amount over a large superscalar core, up to 2.5 times, when running multitasking applications. © 2012 ACM.Agarwal V, 2000, PROCEEDING OF THE 27TH INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE, P248, DOI 10.1109-ISCA.2000.854395; Aho AV, 2006, COMPILERS PRINCIPLES; Akkary H, 2003, P 36 ANN INT S MICR, P423, DOI 10.1109-MICRO.2003.1253246; Akkary H., 1998, Proceedings. 31st Annual ACM-IEEE International Symposium on Microarchitecture, DOI 10.1109-MICRO.1998.742784; Al-Zawawi AS, 2007, CONF PROC INT SYMP C, P448; BUMYONG C., 2008, P 13 INT C ARCH SUPP, P125; Chandra P, 1997, ACS SYM SER, V664, P274, DOI 10.1145-264107.264209; CHATTERJEE B., 2003, P S VLSI CIRC; Chaudhry S, 2009, CONF PROC INT SYMP C, P484; Chen M. K., 1998, Proceedings. 1998 International Conference on Parallel Architectures and Compilation Techniques (Cat. No.98EX192), DOI 10.1109-PACT.1998.727190; Cher CY, 2001, INT SYMP MICROARCH, P4; Chrysos GZ, 1998, CONF PROC INT SYMP C, P142; Cintra M., 2002, Proceedings Eighth International Symposium on High Performance Computer Architecture; Cintra M, 2000, PROCEEDING OF THE 27TH INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE, P13, DOI 10.1109-ISCA.2000.854373; Codrescu L., 1999, P INT C PAR ARCH COM, P40; Codrescu L, 2001, IEEE T COMPUT, V50, P67, DOI 10.1109-12.902753; Collins JD, 2004, INT SYMP MICROARCH, P129; Cristal A., 2002, UPCDAC200239 DEP COM; CRISTAL A., 2005, IEEE MICRO, V25, P3; Cristal A., 2004, Proceedings. 10th International Symposium on High Performance Computer Architecture; Cytron R., 1989, P 16 ANN ACM S PRINC, P25, DOI 10.1145-75277.75280; DUBEY P. K., 1995, P 1995 INT C PAR ARC; FRANKLIN M, 1992, ACM COMP AR, V20, P58, DOI 10.1109-ISCA.1992.753304; FRANKLIN M., 1993, THESIS U WISCONSIN M; Gandhi A., 2004, P 10 INT S HIGH PERF, P254; Gandhi A, 2005, CONF PROC INT SYMP C, P446, DOI 10.1109-ISCA.2005.46; GIBSON D., 2010, P 37 ANN INT S COMP; GOPAL S., 1998, P 4 INT S HIGH PERF; IPEK F., 2007, P 34 ANN INT S COMP; Jacobson Q., 1997, Proceedings. Third International Symposium on High-Performance Computer Architecture (Cat. No.97TB100094), DOI 10.1109-HPCA.1997.569673; Kaeli D. R., 1991, P 18 ANN INT S COMP, P34, DOI 10.1145-115952.115957; Kroft D., 1981, P 8 INT S COMP ARCH, P81; LAM MS, 1992, ACM COMP AR, V20, P46, DOI 10.1109-ISCA.1992.753303; Lebeck AR, 2002, CONF PROC INT SYMP C, P59; Marcuello P, 1998, P 12 INT C SUP, P77, DOI 10.1145-277830.277850; Marcuello P., 2002, Proceedings Eighth International Symposium on High Performance Computer Architecture; Marcuello P., 2000, Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000, DOI 10.1109-IPDPS.2000.846040; Marcuello P., 2003, THESIS U POLITECNICA; Marcuello P, 1999, INT SYMP MICROARCH, P230; McFarling S., 1993, TN36M DIG W RES LAB; Moshovos A., 1997, P 24 INT S COMP ARCH, P181, DOI 10.1145-264107.264189; MUTLU O., 2003, P 9 INT S HIGH PERF; Nekkalapu S, 2008, PR IEEE COMP DESIGN, P384, DOI 10.1109-ICCD.2008.4751889; NICOLAU A, 1984, IEEE T COMPUT, V33, P968; Olukotun K, 1999, P 1999 INT C SUP JUN, P21, DOI 10.1145-305138.305155; Olukotun K, 1996, ACM SIGPLAN NOTICES, V31, P2, DOI 10.1145-248209.237140; Papworth D. B., 1996, IEEE MICRO, V16; POSTIFF M. A., 1999, ACM COMPUT ARCHIT NE, V27, P1; Prabhu Manohar K., 2005, P PPOPP 05, P142, DOI 10.1145-1065944.1065964; Quinones C. G., 2005, P 2005 ACM SIGPLAN C, P269, DOI 10.1145-1065010.1065043; RISEMAN EM, 1972, IEEE T COMPUT, VC 21, P1405, DOI 10.1109-T-C.1972.223514; Rotenberg E, 1997, INT SYMP MICROARCH, P138; Sohi G. S., 1995, Proceedings 22nd Annual International Symposium on Computer Architecture (IEEE Cat. No.95CB35801), DOI 10.1109-ISCA.1995.524580; Srinivasan ST, 2004, ACM SIGPLAN NOTICES, V39, P107, DOI 10.1145-1037187.1024407; Srinivasan ST, 2004, PR IEEE COMP DESIGN, P360, DOI 10.1109-ICCD.2004.1347947; Steffan JG, 2000, PROCEEDING OF THE 27TH INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE, P1, DOI 10.1109-ISCA.2000.854372; Steffan J. G., 1998, Proceedings 1998 Fourth International Symposium on High-Performance Computer Architecture (Cat. No.98TB100224), DOI 10.1109-HPCA.1998.650541; Steffan JG, 2002, EIGHTH INTERNATIONAL SYMPOSIUM ON HIGH-PERFORMANCE COMPUTER ARCHITECTURE, PROCEEDINGS, P65; TSAI J.-Y., 1998, P 4 INT S HIGH PERF, P24; Tsai JY, 1999, IEEE T COMPUT, V48, P881; Vijaykumar T. N., 1998, Proceedings. 31st Annual ACM-IEEE International Symposium on Microarchitecture, DOI 10.1109-MICRO.1998.742771; WATANABI Y., 2010, P 37 ANN INT S COMP; YOURST MT, 2007, P INT S PERF AN SYST, P23; Zhai A, 2002, ACM SIGPLAN NOTICES, V37, P171, DOI 10.1145-605432.605416; ZILLES C., 2002, P 35 ANN ACM IEEE IN41
Author Correction: SciPy 1.0: fundamental algorithms for scientific computing in Python (Nature Methods, (2020), 17, 3, (261-272), 10.1038/s41592-019-0686-2)
An amendment to this paper has been published and can be accessed via a link at the top of the paper
