A low wall-loading DEMO reactor design with high priority for early and reliable realization of a tokamak fusion reactor over the cost performance

Based on scientific databases adopted for designing ITER plasmas and on the advancement of fusion nuclear technology from the recent R&D program, a low wall-loading DEMO fusion reactor has been designed, where high priority has been given to the early and reliable realization of a tokamak fusion plasma over the cost performance. Since the major radius of this DEMO reactor is chosen to be 10 m, plasma ignition is achievable with a low fusion power of 0.8 GW and an operation period of 4–5 hours is available only with inductive current drive. The low ignition power makes it possible to adopt a first wall with an austenitic stainless steel, for which significant databases and operating experience exists, due to its use in the presence of neutron irradiation in fission reactors. In step with development of advanced materials, a step-wise increase of the fusion power seems to be feasible and realistic, because this DEMO reactor has the potential to produce a fusion power of 5 GW.     

A study on improving shielding performance of shielded cable

With the developments in power electronics equipment, the electromagnetic environment has become severe for electronic equipment. In the smart facility field, the stable operation of electronic devices is indispensable, and noise countermeasures must be improved. To suppress intrusive noise from cables, shielded cables are used in many cases. However, electromagnetic induction cannot be suppressed when the shield is grounded at one end, and when grounding both ends of the shield, current flows through the shield creating intrusive noise in the cable. That is, even if a shielded cable is used, a sufficient effect cannot be obtained. Therefore, as a countermeasure, this study prototypes and evaluates cables that combine double shielded cables with magnetic cores. Evaluations conducted using the copper pipe method, triaxial method, and impulse test confirm that the shielded performance improved by 10–30 dB compared with the conventional shielded cable.     

Deformation and Fracture of Micron‐Sized Metal‐Coated Polymer Spheres: An In Situ Study

In situ imaging and analysis of the mechanical behavior of micron‐sized metal‐coated polymer particles under compression is reported. A nanoindentation set‐up mounted in a scanning electron microscope is used to observe the deformation and fracture of 10 μm polymer spheres with Ni, Ni/Au, Au, and Ag coatings. The spheres fracture in one of two metallization‐dependent modes, brittle, and ductile, depending only on the presence of a nickel layer. The metal coating always fractures parallel to the direction of compression. The mechanical properties up to the point of coating fracture are rate‐dependent due to the viscoelastic polymer core. Metal‐coated polymer spheres are an important composite material in electronics packaging, and this study demonstrates a novel method of evaluating the mechanical properties of particles to tailor them for electronic materials.

     

Rank 2 proximal Cantor systems are residually scrambled

Downarowicz and Maass [7 T. Downarowicz and A. Maass, Finite-rank Bratteli–Vershik diagrams are expansive, Ergod. Th. Dynam. Sys. 28 (2008), pp. 739–747.[Web of Science ®] , [Google Scholar]] proposed topological ranks for all homeomorphic Cantor minimal dynamical systems using properly ordered Bratteli diagrams. In this study, we adopt this definition to the case of the essentially minimal zero-dimensional systems. We consider the cases in which topological ranks are 2 and unique minimal sets are fixed points. Akin and Kolyada [2 E. Akin and S. Kolyada, Li–Yorke sensitivity, Nonlinearity 16(4) (2003), pp. 1421–1433.[Crossref], [Web of Science ®] , [Google Scholar]], had shown that if the unique minimal set of an essentially minimal system is a fixed point, then the system must be proximal. The finite topological rank implies expansiveness; furthermore, in the case of proximal Cantor systems with topological rank 2, the expansiveness is always from the lowest degree. Rank 2 proximal Cantor systems are residually scrambled. We present a necessary and sufficient condition for the unique ergodicity of these systems. In addition, we show that the number of ergodic measures of the systems that are topologically mixing can be 1 and 2. Moreover, we present examples that are topologically weakly mixing, not topologically mixing, and uniquely ergodic. Finally, we show that the number of ergodic measures of the systems that are not weakly mixing can be 1 and 2.     

Anisotropy in the resistive superconducting transition under magnetic fields in single crystal Pb2Sr2Ho0.5Ca0.5Cu3O8

Anisotropie properties of the single crystal Pb₂Sr₂Ho_0.5Ca_0.5Cu₃O₈ have been investigated by measuring the electrical resistivity in theab-planeρ _ab (H, θ,T), which depends on the angleθ between theab-plane and the magnetic-field direction, in various constant fieldsH perpendicular to the current direction. All the angle-dependent values ofρ _ab (H, θ,T) at a constant temperature are scaled to be on one curve as a function of reduced field. The anisotropic parameter γ≡(m _c ^* /m _ab ^* )^1/2 is estimated as 12–13, which is larger than that of YBa₂Cu₃O₇ and much smaller than that of Bi₂Sr₂CaCu₂O₈. It has been concluded that the anisotropy does not always depend on the thickness of the blocking layer but seems to depend on the overlap of the electronic wave functions along thec-axis. Anisotropy in the pinning potential has also been discussed from the resistive tail in the temperature dependence ofρ _ab (H,θ,T).     

Dynamic defocus and occlusion compensation of projected imagery by model-based optimal projector selection in multi-projection environment

This paper presents a novel model-based approach of dynamic defocus and occlusion compensation method in a multi-projection environment. Conventional defocus compensation research applies appearance-based method, which needs a point spread function (PSF) calibration when either position or orientation of an object to be projected is changed, thus cannot be applied to interactive applications in which the object dynamically moves. On the other hand, we propose a model-based method in which PSF and geometric calibrations are required only once in advance, and projector’s PSF is computed online based on geometric relationship between the projector and the object without any additional calibrations. We propose to distinguish the oblique blur (loss of high-spatial-frequency components according to the incidence angle of the projection light) from the defocus blur and to introduce it to the PSF computation. For each part of the object surfaces, we select an optimal projector that preserves the largest amount of high-spatial-frequency components of the original image to realize defocus-free projection. The geometric relationship can also be used to eliminate the cast shadows of the projection images in multi-projection environment. Our method is particularly useful in the interactive systems because the movement of the object (consequently geometric relationship between each projector and the object) is usually measured by an attached tracking sensor. This paper describes details about the proposed approach and a prototype implementation. We performed two proof-of-concept experiments to show the feasibility of our approach.     

Design of discrete time adaptive PID control systems with parallel feedforward compensator

This paper deals with the design of an adaptive PID control system with a parallel feedforward compensator (PFC) for discrete-time SISO systems and its application to water level control of a 3-tank system. The proposed method utilizes the characteristics of almost strict positive realness (ASPR) of the controlled plant. A conventional design scheme of a PFC which realizes an ASPR augmented controlled plant is also proposed. Further it is shown that the introduction of an internal model improves the control performance of the control system with the PFC. The effectiveness of the proposed method is confirmed through water level control experiments on a three-tank SISO system.     

Two complementary operations inspired by the DNA hairpin formation: Completion and reduction

We consider two complementary operations: Hairpin completion introduced in [D. Cheptea, C. Martin-Vide, V. Mitrana, A new operation on words suggested by DNA biochemistry: Hairpin completion, in: Proc. Transgressive Computing, 2006, pp. 216–228] with motivations coming from DNA biochemistry and hairpin reduction as the inverse operation of the hairpin completion. Both operations are viewed here as formal operations on words and languages. We settle the closure properties of the classes of regular and linear context-free languages under hairpin completion in comparison with hairpin reduction. While the class of linear context-free languages is exactly the weak-code image of the class of the hairpin completion of regular languages, rather surprisingly, the weak-code image of the class of the hairpin completion of linear context-free languages is a class of mildly context-sensitive languages. The closure properties with respect to the hairpin reduction of some time and space complexity classes are also studied. We show that the factors found in the general cases are not necessary for regular and context-free languages. This part of the paper completes the results given in the earlier paper, where a similar investigation was made for hairpin completion. Finally, we briefly discuss the iterated variants of these operations.     

Solving the irregular strip packing problem via guided local search for overlap minimization

The irregular strip-packing problem (ISP) requires a given set of non-convex polygons to be placed without overlap within a rectangular container having a fixed width and a variable length, which is to be minimized. As a core sub-problem to solve ISP, we consider an overlap minimization problem (OMP) whose objective is to place all polygons into a container with given width and length so that the total amount of overlap between polygons is made as small as possible. We propose to use directional penetration depths to measure the amount of overlap between a pair of polygons, and present an efficient algorithm to find a position with the minimum overlap for each polygon when it is translated in a specified direction. Based on this, we develop a local search algorithm for OMP that translates a polygon in horizontal and vertical directions alternately. Then we incorporate it in our algorithm for OMP, which is a variant of the guided local search algorithm. Computational results show that our algorithm improves the best-known values of some well-known benchmark instances.