Phase transition in nanomagnetite

Recently, the application of nanosized magnetite particles became an area of growing interest for their potential practical applications. Nanosized magnetite samples of 36 and 9 nm sizes were synthesized. Special care was taken on the right stoichiometry of the magnetite particles. Mössbauer spectroscopy measurements were made in 4.2–300 K temperature range. The temperature dependence of the intensities of the spectral components indicated size dependent transition taking place in a broad temperature range. For nanosized samples, the hyperfine interaction values and their relative intensities changed above the Verwey transition temperature value of bulk megnetite. The continuous transition indicated the formation of dendritelike granular assemblies formed during the preparation of the samples

Design Strategy for the PFC in DEMO Reactor (KIT Scientific Reports ; 7637)

The performance of the plasma facing components (PFC) and materials in fusion reactor DEMO are fundamental issues affecting the ultimate technological and economic feasibility of fusion power. Many factors influence the choice of a functional and structural material in a fusion reactor. Component lifetime is mainly limited by radiation damage, disruptions, and sputtering erosion. Our design strategy is to determine the structure and coating thicknesses, which maximize component lifetime against all life limitations

A Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic

The Bernays-Sch\"onfinkel first-order logic fragment over simple linear real arithmetic constraints BS(SLR) is known to be decidable. We prove that BS(SLR) clause sets with both universally and existentially quantified verification conditions (conjectures) can be translated into BS(SLR) clause sets over a finite set of first-order constants. For the Horn case, we provide a Datalog hammer preserving validity and satisfiability. A toolchain from the BS(LRA) prover SPASS-SPL to the Datalog reasoner VLog establishes an effective way of deciding verification conditions in the Horn fragment. This is exemplified by the verification of supervisor code for a lane change assistant in a car and of an electronic control unit for a supercharged combustion engine

A Sorted Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic

In a previous paper, we have shown that clause sets belonging to the HornBernays-Sch\"onfinkel fragment over simple linear real arithmetic (HBS(SLR))can be translated into HBS clause sets over a finite set of first-orderconstants. The translation preserves validity and satisfiability and it isstill applicable if we extend our input with positive universally orexistentially quantified verification conditions (conjectures). We call thistranslation a Datalog hammer. The combination of its implementation inSPASS-SPL with the Datalog reasoner VLog establishes an effective way ofdeciding verification conditions in the Horn fragment. We verify supervisorcode for two examples: a lane change assistant in a car and an electroniccontrol unit of a supercharged combustion engine. In this paper, we improve ourDatalog hammer in several ways: we generalize it to mixed real-integerarithmetic and finite first-order sorts; we extend the class of acceptableinequalities beyond variable bounds and positively grounded inequalities; andwe significantly reduce the size of the hammer output by a soft typingdiscipline. We call the result the sorted Datalog hammer. It not only allows usto handle more complex supervisor code and to model already consideredsupervisor code more concisely, but it also improves our performance on realworld benchmark examples. Finally, we replace the before file-based interfacebetween SPASS-SPL and VLog by a close coupling resulting in a single executablebinary.<br

A Sorted Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic

International audienceAbstract In a previous paper, we have shown that clause sets belonging to the Horn Bernays-Schönfinkel fragment over simple linear real arithmetic (HBS(SLR)) can be translated into HBS clause sets over a finite set of first-order constants. The translation preserves validity and satisfiability and it is still applicable if we extend our input with positive universally or existentially quantified verification conditions (conjectures). We call this translation a Datalog hammer. The combination of its implementation in SPASS-SPL with the Datalog reasoner VLog establishes an effective way of deciding verification conditions in the Horn fragment. We verify supervisor code for two examples: a lane change assistant in a car and an electronic control unit of a supercharged combustion engine. In this paper, we improve our Datalog hammer in several ways: we generalize it to mixed real-integer arithmetic and finite first-order sorts; we extend the class of acceptable inequalities beyond variable bounds and positively grounded inequalities; and we significantly reduce the size of the hammer output by a soft typing discipline. We call the result the sorted Datalog hammer. It not only allows us to handle more complex supervisor code and to model already considered supervisor code more concisely, but it also improves our performance on real world benchmark examples. Finally, we replace the before file-based interface between SPASS-SPL and VLog by a close coupling resulting in a single executable binary

Going beyond carbon: An "Earth system impact" score to better capture corporate and investment impacts on the earth system

Corporations are responsible for a significant portion of observed impacts on the Earth system, including green-house gas (GHG) emissions, but also water extraction, landuse change and other pressures on nature. These nature-related impacts are essential to consider and capture because they have local impacts on a range of ecosystem functions on which companies and economies depend, but they also fundamentally affect our ability to mitigate and adapt to a changing climate. Furthermore, climate, land and water interact and affect each other in various ways, such that climate change can be exacerbated by degraded ecosystems, which in turn are dependent on water. This paper tests a novel metric developed to capture corporate Earth system impact (ESI) beyond merely direct GHG emissions and explores how such a tool could be used to improve assessments of corporate environmental impacts and support decisions on where to direct public and private investments. We use the mining sector as a test case to illustrate the applicability of the ESI score and examine the impact of the the five largest (by market cap) mining companies in the precious metal mining sector and the top five in the non-precious metal mining sector. We find that many of the mining assets have non-negligible impacts on land and water, and we show that the ESI metric identifies a different set of asset for targeted action than conventional carbon intensity scores would do

Analytically tractable climate-carbon cycle feedbacks under 21st century anthropogenic forcing

Changes to climate-carbon cycle feedbacks may significantly affect the Earth System’s response to greenhouse gas emissions. These feedbacks are usually analysed from numerical output of complex and arguably opaque Earth System Models (ESMs). Here, we construct a stylized global climate-carbon cycle model, test its output against complex ESMs, and investigate the strengths of its climate-carbon cycle feedbacks analytically. The analytical expressions we obtain aid understanding of carbon-cycle feedbacks and the operation of the carbon cycle. We use our results to analytically study the relative strengths of different climate-carbon cycle feedbacks and how they may change in the future, as well as to compare different feedback formalisms. Simple models such as that developed here also provide "workbenches" for simple but mechanistically based explorations of Earth system processes, such as interactions and feedbacks between the Planetary Boundaries, that are currently too uncertain to be included in complex ESMs

Pessimistic Software Lock-Elision

Read-write locks are one of the most prevalent lock forms in concurrent applications because they allow read accesses to locked code to proceed in parallel. However, they do not offer any parallelism between reads and writes. This paper introduces pessimistic lock-elision (PLE), a new approach for non-speculatively replacing read-write locks with pessimistic (i.e. non-aborting) software transactional code that allows read-write concurrency even for contended code and even if the code includes system calls. On systems with hardware transactional support, PLE will allow failed transactions, or ones that contain system calls, to preserve read-write concurrency. Our PLE algorithm is based on a novel encounter-order design of a fully pessimistic STM system that in a variety of benchmarks spanning from counters to trees, even when up to 40% of calls are mutating the locked structure, provides up to 5 times the performance of a state-of-the-art read-write lock.National Science Foundation (U.S.) (Grant 1217921