Low-Temperature Synthesis of ZrC Powder by Cyclic Reaction of Mg in ZrO2–Mg–CH4

We investigated the conditions for low-temperature synthesis of ZrC fine powder from ZrO₂–Mg–CH₄. The synthesis utilizes a thermite-type reaction, with Mg as the reducing agent, and a reaction between Mg and CH₄ gas as a carbon source. The Mg/ZrO₂ molar ratio as well as the heating rate were varied. Because C can be continuously fed into the reaction group by the cyclic reaction of Mg through the formation and decomposition of Mg₂C₃ (2Mg + 3CH₄→ Mg₂C₃+ 6H₂→ 2Mg + 3C), a molar ratio of 2.2 for Mg/ZrO₂ was sufficient for the synthesis of single-phase ZrC. ZrC powders were synthesized under the following conditions: Mg/ZrO₂ molar ratio = 2.2, heating rate = 20°C/min, and temperature maintained at 750°C for 30 min. The amount of reaction heat produced in the reduction reaction of ZrO₂ by Mg depended on the Mg/ZrO₂ molar ratio, specifically, the amount of ZrO₂ contained. Moreover, the cyclic reaction of Mg-Mg₂C₃–Mg was influenced by the amount of reaction heat described above and by the heating rate. The ZrC fine powder showed little aggregation and high dispersibility.     

Decomposition of Carbon Dioxide to Carbon with Active Wustite at 300°C

Active wustite (FeδO, with a δ value of 0.98) was prepared by keeping normal wustite (δ value of 0.94) in a N₂ atmosphere at 300°C for 10 min. This reaction is given by (4δ₂–3)Fe_δ1O→(4δ₁–3)Fe_δ2O + (δ₂–δ₁)Fe₃O₄ where δ₁= 0.94 and δ₂= 0.98. The equation indicates that the normal wustite undergoes eutectoid decomposition into active wustite and stoichiometric magnetite (Fe₃O₄). Carbon dioxide (1.013 × 10⁵ Pa) was almost completely (100%) decomposed into carbon (zero valence) by the active wustite at the low temperature of 300°C, which was associated with the transformation of the active wustite into the stoichiometric magnetite. The internal pressure of the reaction cell eventually became a vacuum.     

Reversible computing and cellular automata—A survey

Reversible computing is a paradigm where computing models are defined so that they reflect physical reversibility, one of the fundamental microscopic physical property of Nature. In this survey/tutorial paper, we discuss how computation can be carried out in a reversible system, how a universal reversible computer can be constructed by reversible logic elements, and how such logic elements are related to reversible physical phenomena. We shall see that, in reversible systems, computation can often be carried out in a very different manner from conventional (i.e., irreversible) computing systems, and even very simple reversible systems or logic elements have computation- or logical-universality. We discuss these problems based on reversible logic elements/circuits, reversible Turing machines, reversible cellular automata, and some other related models of reversible computing.     

Transflective IPS‐LCD with improved reflective contrast ratio

Abstract— In order to improve the reflective contrast ratio of transflective IPS‐LCDs, a novel pixel design for a normally white reflective IPS has been proposed. In this design, the large‐inter‐electrode‐spacing layout using a novel driving method and a double‐layered electrode have effectively reduced the light leakage. By applying these two technologies, a transflective IPS‐LCD has been successfully demonstrated with a high contrast ratio (15:1) in the reflective mode and a wide‐viewing‐angle characteristic in the transmissive mode.     

Estimating potential disaster waste generation for pre-disaster waste management

The paper discusses development of a method for estimating disaster waste that can be potentially generated by a natural disaster in the future for pre-disaster waste management. In particular, this research focuses on micro-disaster waste originating from household consumer durables. We documented the number of household consumer durables and built a mass per unit database of major consumer durables using web-based and statistical surveys. We also estimated present and future figures of disaster waste that can be generated in the study area. The estimated total amount of disaster waste that could be generated in 2015 was 24.1 kt (18.1–29.8 kt) and 108 kt (81.8–133 kt) for Kobe City and Ise-Shima region, respectively. The total quantities of TV sets, air conditioners, refrigerators, and washing machines generated in Kobe and Ise-Shima will range between 10.9 and 22.8 kt (247,000–545,000 units) in 2015, and 10.7 kt to 22.8 kt (249,000–550,000 units) in 2035. The quantity estimated for 2015 is equal to 61 % of the annual processing capacity of Plant A, Japan’s leading home appliances recycling plant. Finally, we discussed the contribution of the estimation results and geographic information systems in future recycling planning.     

Functional un|unparsing

Danvy??s functional unparsing problem (Danvy in J. Funct. Program. 8(6), 621?C625, 1998) is to implement a type-safe ??printf?? function, which converts a sequence of heterogeneous arguments to a string according to a given format. The dual problem is to implement a type-safe ??scanf?? function, which extracts a sequence of heterogeneous arguments from a string by interpreting (Friedman and Wand in LFP, pp. 348?C355, 1984 and in Essentials of Programming Languages, MIT Press, 2008) the same format as an equally heterogeneous sequence of patterns that binds zero or more variables. We derive multiple solutions to both problems (Wand in J. ACM 27(1), 164?C180, 1980) from their formal specifications (Wand in Theor. Comput. Sci. 20(1), 3?C32, 1982). On one hand, our solutions show how the Hindley-Milner type system, unextended, permits accessing heterogeneous sequences with the static assurance of type safety. On the other hand, our solutions demonstrate the use of control operators (Felleisen et al. in Proceedings of the 1988 ACM Conference on Lisp and Functional Programming, pp. 52?C62, ACM Press, New York, 1988; Wand in POPL 85: Conference Record of the Annual ACM Symposium on Principles of Programming Languages, vol. 16, ACM Press, New York, 1985; Meyer and Wand in Logics of Programs, Lecture Notes in Computer Science, vol. 193, pp. 219?C224, Springer, Berlin, 1985) to communicate with formats as coroutines (Wand in Proceedings of the 1980 ACM Conference on Lisp and Functional Programming, vol. 12, pp. 285?C299, ACM Press, New York, 1980 and Haynes et al. in LFP, pp. 293?C298, 1984).     

High-performance cone beam reconstruction using CUDA compatible GPUs

Compute unified device architecture (CUDA) is a software development platform that allows us to run C-like programs on the nVIDIA graphics processing unit (GPU). This paper presents an acceleration method for cone beam reconstruction using CUDA compatible GPUs. The proposed method accelerates the Feldkamp, Davis, and Kress (FDK) algorithm using three techniques: (1) off-chip memory access reduction for saving the memory bandwidth; (2) loop unrolling for hiding the memory latency; and (3) multithreading for exploiting multiple GPUs. We describe how these techniques can be incorporated into the reconstruction code. We also show an analytical model to understand the reconstruction performance on multi-GPU environments. Experimental results show that the proposed method runs at 83% of the theoretical memory bandwidth, achieving a throughput of 64.3 projections per second (pps) for reconstruction of 512³-voxel volume from 360 512²-pixel projections. This performance is 41% higher than the previous CUDA-based method and is 24 times faster than a CPU-based method optimized by vector intrinsics. Some detailed analyses are also presented to understand how effectively the acceleration techniques increase the reconstruction performance of a naive method. We also demonstrate out-of-core reconstruction for large-scale datasets, up to 1024³-voxel volume.     

Universality Issues in Reversible Computing Systems and Cellular Automata (Extended Abstract)

In this survey, we deal with the problem how a universal computer can be constructed in a reversible environment. We discuss this problem based on the frameworks of reversible Turing machines, reversible logic circuits, and reversible cellular automata. We can see that in spite of the constraint of reversibility, there are several very simple reversible systems that have universal computing ability.     

Buoyancy engine developed for underwater gliders

A buoyancy engine with a swashplate-type axial piston pump was developed. Its oil extrusion and drawing properties under high hydraulic pressure were evaluated. This buoyancy engine is now installed in an underwater glider that will achieve long-term monitoring of ocean environments up to 2100 m depth in a designated area with lower operational costs. This bidirectionally functioning pump can control the amount of oil in extrusion and draw operations. When drawing oil under high pressure, the hydraulic pump and the electric motor, respectively, act as a hydraulic motor and an electric generator. The generated electric power is absorbed by a damping resistor. The oil-drawing and extrusion properties were measured using a large hyperbaric chamber that is able to produce an almost identical environment to that of actual operations. Results confirmed stable oil extrusion operations up to 21 MPa. Regarding oil-drawing properties, although it was measured only up to 10 MPa in the hyperbaric chamber, it can be inferred that the system can draw the oil and can control the buoyancy precisely up to 21 MPa by replacing the two-way ball valve with an electromagnetic latching solenoid valve.