Regulating Nanotechnology: A Private–Public Insurance Solution

Nanotechnology promises to revolutionize innovation in nearly every industry. However, nanomaterials’ novel properties pose potentially significant health and environmental risks. Views in the current debate over nanotechnology regulation range from halting all research and development to allowing virtually unregulated innovation. One viable regulatory solution balancing commercialization and risk is the adoption of a mandatory private-public insurance program

Regulating Nanotechnology: A Private–Public Insurance Solution

Nanotechnology promises to revolutionize innovation in nearly every industry. However, nanomaterials’ novel properties pose potentially significant health and environmental risks. Views in the current debate over nanotechnology regulation range from halting all research and development to allowing virtually unregulated innovation. One viable regulatory solution balancing commercialization and risk is the adoption of a mandatory private-public insurance program

Academic Program Review: Promises and Perils

Abstract is available to download

Video: NASA Space Launch System Explained

Program promises possibilities for missions to Mars and interstellar trave

Institute of Child Nutrition Joins with FARE to Address Food Allergies

Partnership promises to strengthen resources and training for child nutrition program

Realisasi Janji Kampanye Program Kesehatan Bupati Semarang Periode 2010-2015

IONHealth program is the flagship program of the couple Mundjirin and Warnadi. Health programs are favored free treatment at health centers and classrooms III general hospitals. This study uses qualitative methods research that produces descriptive data described with words written and spoken by the people as well as observations of behavior to determine how the realization of campaign promises the couples Mundijirin and Warnadi in elections of regional heads Semarang district 2010. The results showed that the campaign promises of health programs in the form of Semarang regency regent free health programs truly realized

Bayesian algorithms for recovering structure from single-particle diffraction snapshots of unknown orientation: a comparison

The advent of X-ray Free Electron Lasers promises the possibility to determine the structure of individual particles such as microcrystallites, viruses and biomolecules from single-shot diffraction snapshots obtained before the particle is destroyed by the intense femtosecond pulse. This program requires the ability to determine the orientation of the particle giving rise to each snapshot at signal levels as low as ~10-2 photons/pixel. Two apparently different approaches have recently demonstrated this capability. Here we show they represent different implementations of the same fundamental approach, and identify the primary factors limiting their performance.Comment: 10 pages, 2 figure

The Decidability of Verification under Promising 2.0

In PLDI'20, Lee et al. introduced the \emph{promising } semantics PS 2.0 of the C++ concurrency that captures most of the common program transformations while satisfying the DRF guarantee. The reachability problem for finite-state programs under PS 2.0 with only release-acquire accesses is already known to be undecidable. Therefore, we address, in this paper, the reachability problem for programs running under PS 2.0 with relaxed accesses together with promises. We show that this problem is undecidable even in the case where the input program has finite state. Given this undecidability result, we consider the fragment of PS 2.0 with only relaxed accesses allowing bounded number of promises. We show that under this restriction, the reachability is decidable, albeit very expensive: it is non-primitive recursive. Given this high complexity with bounded number of promises and the undecidability result for the RA fragment of PS 2.0, we consider a bounded version of the reachability problem. To this end, we bound both the number of promises and the "view-switches", i.e, the number of times the processes may switch their local views of the global memory. We provide a code-to-code translation from an input program under PS 2.0, with relaxed and release-acquire memory accesses along with promises, to a program under SC. This leads to a reduction of the bounded reachability problem under PS 2.0 to the bounded context-switching problem under SC. We have implemented a prototype tool and tested it on a set of benchmarks, demonstrating that many bugs in programs can be found using a small bound

Tickets on Sale Now for the 40th Annual UMM Jazz Festival

This year’s program promises jazz takes on pop hits by P!nk, the Rolling Stones, and more