A Novel Particle/Photon Detector Based on a Superconducting Proximity Array of Nanodots

The current frontiers in the investigation of high-energy particles demand for new detection methods. Higher sensitivity to low-energy deposition, high-energy resolution to identify events and improve the background rejection, and large detector masses have to be developed to detect even an individual particle that weakly interacts with ordinary matter. Here, we will describe the concept and the layout of a novel superconducting proximity array which show dynamic vortex Mott insulator to metal transitions, as an ultra-sensitive compact radiation-particle detector.     

Magnetic Properties of Thermal Sprayed Tungsten Carbide–Cobalt Coatings

In the information age, the storage and accessibility of data is of vital importance. There are several possibilities to fulfill this task. Magnetic storage of data is a well‐established method and the range of materials used is continuously extended. In this study, the magnetic remanence of thermally sprayed tungsten carbide–cobalt (WCCo)‐coatings in dependence of their thickness is examined. Two magnetic fields differing in value and geometry are imprinted into the coatings and the resulting remanence field is measured. It is found that there are two effects, which in combination determine the effective value of the magnetic remanence usable for magnetic data storage.

     

Single point incremental forming: state-of-the-art and prospects

Incremental sheet metal forming in general and Single Point Incremental Forming (SPIF) specifically have gone through a period of intensive development with growing attention from research institutes worldwide. The result of these efforts is significant progress in the understanding of the underlying forming mechanisms and opportunities as well as limitations associated with this category of flexible forming processes. Furthermore, creative process design efforts have enhanced the process capabilities and process planning methods. Also, simulation capabilities have evolved substantially. This review paper aims to provide an overview of the body of knowledge with respect to Single Point Incremental Forming. Without claiming to be exhaustive, each section aims for an up-to-date state-of-the-art review with corresponding conclusions on scientific progress and outlook on expected further developments.     

Dynamics and self-assembly of bio-functionalized gold nanoparticles in solution: Reactive molecular dynamics simulations

The self-assembling properties, stability, and dynamics of hybrid nanocarriers (gold nanoparticles (AuNPs) functionalized with cysteine-based peptides) in solution are studied through a series of classical molecular dynamics simulations based on a recently parametrized reactive force field. The results reveal, at the atomic level, all the details regarding the peptide adsorption mechanisms, nanoparticle stabilization, aggregation, and sintering. The data confirm and explain the experimental findings and disclose aspects that cannot be scrutinized by experiments. The biomolecules are both chemisorbed and physisorbed; self-interactions of the adsorbates and formation of stable networks of interconnected molecules on the AuNP surfaces limit substrate reconstructions, protect the AuNPs from the action of the solvent, and prevent direct interactions of the gold surfaces. The possibility of agglomeration of the functionalized nanoparticles, compared with the sintering of the bare supports in a water solution, is demonstrated through relatively long simulations and fast steered dynamics. The analysis of the trajectories reveals that the AuNPs were well stabilized by the peptides. This prevented particle sintering and kept the particles far apart; however, part of their chains could form interconnections (crosslinks) between neighboring gold vehicles. The excellent agreement of these results with the literature confirm the reliability of the method and its potential application to the modeling of more complex materials relevant to the biomedical sector.

Open image in new window

     

Mixtures of (N2)1−x : (O2) x at High Pressures and Low Temperatures

We performed Raman measurements at 18 K and pressures up to 25 GPa in order to construct a tentative phase diagram of the (N ₂)_1–x :(O ₂)_x –system at low temperatures. We varied the composition of the mixed system over the whole concentration range. Here we focused on the systems with high nitrogen concentration and pressures above 2 GPa. It is known that at room temperature oxygen is highly solvable in the –phase of N ₂. The experimental results show that oxygen suppresses the disorder–order transition –N ₂.     

Analyzing the metallurgical and cultural backgrounds of two Han-dynasty bronze-mirror fragments

Chinese TLV-bronze mirrors dating to the Han dynasty (206 B.C.-220 A.D.) were popular objects of everyday life as well as highly esteemed works of art. The decorated back of the mirror characterizes the culture of this period as well as the excellent early Chinese casting techniques.     

On resolution with short clauses

We investigate properties ofk-resolution, a restricted version of resolution in which one parent clause must have length at mostk. Starting from a unit-preference strategy, we compare minimal proof lengths of unit-resolution and unrestricted resolution. In particular, we show that the speed-up by using resolution is bound by if the shortest unit-resolution refutation needst steps. Next we present an algorithm which decides whether the empty clause can be deduced by 2-resolution from a formula and has time complexity O(length()⁴). Finally we describe effects onk-resolution if a formula is transformed intot-CNF and show that extended 3-resolution is complete and sound.     

Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates

This paper is the first attempt to successfully design efficient approximation algorithms for the single-machine weighted flow-time minimization problem when jobs have different release dates and weights equal to their processing times under the assumption that one job is fixed (i.e., the machine is unavailable during a fixed interval corresponding to the fixed job). Our work is motivated by an interesting algorithmic application to the generation of valid inequalities in a branch-and-cut method. Our analysis shows that the trivial FIFO sequence can lead to an arbitrary large worst-case performance bound. Hence, we modify this sequence so that a new 2-approximation solution can be obtained for every instance and we prove the tightness of this bound. Then, we propose a fully polynomial-time approximation algorithm with efficient running time for the considered problem. Especially, the complexity of our algorithm is strongly polynomial.     

Iterant recombination with one-norm minimization for multilevel Markov chain algorithms via the ellipsoid method

Recently, it was shown how the convergence of a class of multigrid methods for computing the stationary distribution of sparse, irreducible Markov chains can be accelerated by the addition of an outer iteration based on iterant recombination. The acceleration was performed by selecting a linear combination of previous fine-level iterates with probability constraints to minimize the two-norm of the residual using a quadratic programming method. In this paper we investigate the alternative of minimizing the one-norm of the residual. This gives rise to a nonlinear convex program which must be solved at each acceleration step. To solve this minimization problem we propose to use a deep-cuts ellipsoid method for nonlinear convex programs. The main purpose of this paper is to investigate whether an iterant recombination approach can be obtained in this way that is competitive in terms of execution time and robustness. We derive formulas for subgradients of the one-norm objective function and the constraint functions, and show how an initial ellipsoid can be constructed that is guaranteed to contain the exact solution and give conditions for its existence. We also investigate using the ellipsoid method to minimize the two-norm. Numerical tests show that the one-norm and two-norm acceleration procedures yield a similar reduction in the number of multigrid cycles. The tests also indicate that one-norm ellipsoid acceleration is competitive with two-norm quadratic programming acceleration in terms of running time with improved robustness.     

On the logic of preference and judgment aggregation

Agents that must reach agreements with other agents need to reason about how their preferences, judgments, and beliefs might be aggregated with those of others by the social choice mechanisms that govern their interactions. The emerging field of judgment aggregation studies aggregation from a logical perspective, and considers how multiple sets of logical formulae can be aggregated to a single consistent set. As a special case, judgment aggregation can be seen to subsume classical preference aggregation. We present a modal logic that is intended to support reasoning about judgment aggregation scenarios (and hence, as a special case, about preference aggregation): the logical language is interpreted directly in judgment aggregation rules. We present a sound and complete axiomatisation. We show that the logic can express aggregation rules such as majority voting; rule properties such as independence; and results such as the discursive paradox, Arrow’s theorem and Condorcet’s paradox—which are derivable as formal theorems of the logic. The logic is parameterised in such a way that it can be used as a general framework for comparing the logical properties of different types of aggregation—including classical preference aggregation. As a case study we present a logical study of, including a formal proof of, the neutrality lemma, the main ingredient in a well-known proof of Arrow’s theorem.