The high-resolution lattice imaging technique of transmission electron microscopy has been utilized to monitor the decomposition process in Au–Ni spinodal alloys. Individual measurements were made of lattice fringe spacings which are sensitive to composition variations at the atomic plane level. The results indicate that rather smooth and regular composition waves are obtained at an early state of decomposition, and that later stage coarsening results in larger amplitude fluctuations. This provides direct evidence of simultaneous decomposition and coarsening which agrees with theoretical predictions.
An analysis of reaction kinetics and morphology suggests that the decomposition is one-dimensional, even after very long aging times. This behavior is believed to be the combined result of a large matrix strain energy associated with the decomposition product and the slow decomposition kinetics due to low temperature aging (at 423 K).

抄録全体を表示

In this study, an efficient and robust Cartesian mesh generation method for Building-Cube Method (BCM) is proposed. It can handle “dirty” geometry data whose surface has cracks, overlaps, and reverse of triangle. BCM mesh generation is implemented by two procedures; cube generation and cell generation in each cube. The cell generation procedure in this study is managed in each cube individually, and parallelized by OpenMP. Efficiency of the parallelized BCM mesh generation is demonstrated for several three-dimensional test cases using a multi-core PC.

抄録全体を表示

油ヤシは食用油生産のために重要な植物である．油を抽出するために果実の成っている枝を収穫する前に，その枝よりも下側の葉はすべて刈り落とされる．この刈り落とした葉の部分を牛の飼料とするための研究が行われてきた．しかしマイコトキシン特にアフラトキシンによる汚染が懸念された．そこで著者らは，乾燥した油ヤシ葉（OPF）およびOFPを含む配合飼料中のアフラトキシン分析法を検討した．アフラトキシンは80％アセトニトリルで抽出し，多機能カラム（MycoSep #228）を通して精製し，TLC又はHPLCにより分析した．アフラトキシンを5～20 μg/kg（アフラトキシンB₁，B₂，G₁，G₂を各々）添加した試料での回収率は75％以上で，RSDは10％以下であった．TLCによるOPF中のアフラトキシンB₁の検出限界は5 μg/kgであった．10点の100％ OPF試料を分析したがアフラトキシン汚染は確認されなかったが，強いアフラトキシン産生能を有する菌をOPFに接種したところアフラトキシンの産生が確認された．

抄録全体を表示

In order to avoid an inefficient assembly/disassembly process and wasteful use of materials, it is important to improve the disassembly efficiency of products. In this paper, it is proposed that the choice of shape and labeling of parts may improve disassembly efficiency. In order to verify this assumption, a set of cube puzzles was used for disassembly process experiments. Three experiments were conducted with a total of 56 participants who disassembled seven different types of cube puzzles. The authors compared the average time taken and number of errors committed by participants while disassembling different cubes. The results showed that when participants disassembled a cube puzzle that could be opened via multiple parts, the average number of errors was not different, even though these cube puzzles took more time to disassemble.Thus, puzzle shape had no positive effect on disassembly efficiency. However, when participants disassembled a cube puzzle with only one key clue part that was labeled, it had a positive effect on disassembly efficiency, that is, labeling the first shape to be moved made the disassembly process more efficient.

抄録全体を表示

本論文において，対象物体の多視点画像を撮影しながらその物体の任意視点画像を描画するシステムを提案する．我々のシステムは4台のステレオカメラと撮影用PC4台，統合用PC1台の計5台のPCから成り立つ．4台のカメラはそれぞれが1台のPCと接続されており対象物体の撮影及びシルエット検出を行う．本システムではカラー画像と視差画像を用いてシルエット検出を行う．4台のPCと統合用PCはLANによって接続されており，撮影された画像とシルエット画像が転送され，シルエット法により対象物体の形状を復元する．本システムでは計算量削減のためOctreeをデータ構造として用いる．さらに，木構造の親にあたる情報を一時的に保持するスタックを参照することで，Octree生成アルゴリズムの計算量をさらに削減する．物体形状復元後，復元物体表面Voxelを着色して任意視点を描画する．これらのアルゴリズムにより，我々のシステムは毎秒約3～5フレームの描画速度を実現することができる．

抄録全体を表示

Calculating the interaction between a machining tool and a workpiece is very important in evaluating cutting process. The estimation of cutter-workpiece engagement based on three-dimensional (3D) geometric models needs huge amount of discrete data for representing dynamic states of the cutting tool and the workpiece. In the paper, authors propose a Spatio-Temporal description approach to represent dynamic machining process using four-dimensional (4D) geometric models. As the core of the approach, T-map data structure is newly introduced and a calculation of cutter-workpiece engagement using T-map is proposed. To accelerate the calculation with T-map, several parallel processing strategies are compared.

抄録全体を表示

This paper proposes several improved Side-channel cube attacks (SCCAs) on PRESENT-80/128 under single bit leakage model. Assuming the leakage is in the output of round 3 as in previous work, we discover new results of SCCA on PRESENT. Then an enhanced SCCA is proposed to extract key related non-linear equations. 64-bit key for both PRESENT-80 and 128 can be obtained. To mount more effective attack, we utilize the leakage in round 4 and enhance SCCA in two ways. A partitioning scheme is proposed to handle huge polynomials, and an iterative scheme is proposed to extract more key bits. With these enhanced techniques, the master key search space can be reduced to 2⁸ for PRESENT-80 and to 2²⁹ for PRESENT-128.

抄録全体を表示

Gen Shirane began studying ferroelectrics while he was still based in Japan in the early 1950’s. It was therefore natural that when he arrived at Brookhaven and began specialising in neutron scattering that he would devote much of his energy and expertise studying structural phase transitions. We review the ground breaking experiments that showed the behaviour of antiferroelectrics and ferroelectrics were reasonably described in terms of the soft mode concept of structural phase transitions. This work lead directly to Gen being awarded the Buckley prize and, jointly with John Axe, awarded the Warren prize. We then describe his work on incommensurate phase transitions and in particular how the giant Kohn anomalies are responsible for the structural instabilities in one-dimensional metals. Finally Gen carefully investigated the central peak and the two-length scale phenomena that occur at most if not all transitions. Due to Gen’s elegant experimental work we know a great deal about both of these effects but in neither case is theory able to explain all of his results.

抄録全体を表示

In this paper, another version of the star cube called the generalized-star cube, GSC(n, k, m), is presented as a three level interconnection topology. GSC(n, k, m) is a product graph of the (n, k)-star graph and the m-dimensional hypercube (m-cube). It can be constructed in one of two ways: to replace each node in an m-cube with an (n, k)-star graph, or to replace each node in an (n, k)-star graph with an m-cube. Because there are three parameters m, n, and k, the network size of GSC(n, k, m) can be changed more flexibly than the star graph, star-cube, and (n, k)-star graph. We first investigate the topological properties of the GSC(n, k, m), such as the node degree, diameter, average distance, and cost. Also, the regularity and node symmetry of the GSC(n, k, m) are derived. Next, we present a formal shortest-path routing algorithm. Then, we give broadcasting algorithms for both of the single-port and all-port models. To develop these algorithms, we use the spanning binomial tree, the neighborhood broadcasting algorithm, and the minimum dominating set. The complexities of the routing and broadcasting algorithms are also examined.

抄録全体を表示