Strongly Fault-Secure (SFS) circuits are known to achieve the TSC goal of producing a non-codeword as the first erroneous output due to a fault. Strongly Code-Disjoint (SCD) circuits always map non-codeword inputs to non-codeword outputs even in the presence of faults so long as the faults are undetectable. This paper presents a new generalized design method for the SFS and SCD realization of combinational circuits. The proposed design is simple, and always gives an SFS and SCD combinational circuit which implements any given logic function. The resulting SFS/SCD circuits can be connected in cascade with each other to construct a larger SFS/SCD circuit if each interface is fully exercised.

In complex self-checking systems several blocks (i.e. functional blocks and checkers) are embedded. In order to check the self-checking properties of such blocks we need to know the set of vectors they receive from the blocks feeding their inputs (i.e. the code word output spaces of the source blocks). In a complex system the computation of the output spaces by means of exhaustive simulation of the system is intractable. In this paper we present a tool which performs this computation with low CPU time. Some other tools allowing to verify the self-checking properties of embedded blocks (like the strongly fault secure property of embedded PLAs and the self-testing property of embedded checkers), have also been developed and experimented.

Unidirectional/Asymmetric error control codes have extensively been studied, not only from theoretical interest but from application to computer systems or communication systems. Recently, attention has been focused on detecting only d, not all, unidirectional errors, that is, d bits unidirectional error ditecting (d-UED) codes. Borden proposed an optimal nonsystematic d-UED code. This paper shows a new design method for cost-effective self-testing checker for the optimal d-UED code. The checking policy is to check whether condition of the Borden code satisfies or not. The proposed checker includes the parallel weight counter, the comparator and th e modulo adder in which new residue operation is defined and hence this makes the circuit self-testing. These circuits are designed to have all possible input patterns in order to satisfy self-testing property. Finally, the proposed checker has greatly reduced hardware amount compared to the existing one.

Isotope dilution secondary ion mass spectroscopy (ID-SIMS) using 30Si as a spike is investigated as a quantitative analysis method for trace amounts of Si. For a standard solution of Si, the relateve standard deviation of results using this method is 5% for 0.2 µg Si, and the determination lower limit is 18 ng. Using this method, the amount of Si deposited on the Ge(100) surface by the self-limited adsorption of SiH2Cl2 is determined to be about 1.00.2 monolayer.

Topographic maps begin to be recognized as one of the major computational structures underlying neural computation in the brain. They provide dimension-reducing projections between feature spaces that seem to be established and maintained under the participation of selforganizing, adaptive processes. In this contribution, we investigate how well the structure of such maps can be replicated by simple adaptive processes of the kind proposed by Kohonen. We will particularly address the important issue, how the dimensionality of the input space affects the spatial organization of the resulting map.

The purpose of the present paper is to review a state of the art of nonlinear analysis with the self-validating numerical method. The self-validating numerics based method provides a tool for performing computer assisted proofs of nonlinear problems by taking the effect of rounding errors in numerical computations rigorously into account. First, Kantorovich's approach of a posteriori error estimation method is surveyed, which is based on his convergence theorem of Newton's method. Then, Urabe's approach for computer assisted existence proofs is likewise discussed. Based on his convergence theorem of the simplified Newton method, he treated practical nonlinear differential equations such as the Van der Pol equation ahd the Duffing equation, and proved the existence of their periodic and quasi-periodic solutions by the self-validating numerics. An approach of the author for generalization and abstraction of Urabe's method are also discribed to more general funcional equations. Furthermore, methods for rigorous estimation of rounding errors are surveyed. Interval analytic methods are discussed. Then an approach of the author which uses rational arithmetic is reviewed. Finally, approaches for computer assisted proofs of nonlinear problems are surveyed, which are based on the self-validating numerics.

The nonlinear optical properties of organics with unsaturated bonds were compared with those of inorganics including semiconductors and dielectrics. Because of the mesomeric effect, namely quantum mechanical resonance effect among configurations, aromatic molecules and polymers have larger optical nonlinear parameters defined as δ(n)=X(n)/(X(l))n both for the second (n=2) and third-order (n=3) nonlinearities. Experimental results of ultrafast nonlinear response of conjugated polymers, especially polydiacetylenes, were described and a model is proposed to explain the relaxation processes of photoexcitations in the conjugated polymers. Applying the model constructed on the basis of the extensive experimental study, we propose model polymers to obtain ultrafast resonant optical nonlinearity.

The nonlinear optical properties of organics with unsaturated bonds were compared with those of inorganics including semiconductors and dielectrics. Because of the mesomeric effect, namely quantum mechanical resonance effect among configurations, aromatic molecules and polymers have larger optical nonlinear parameters defined as δ(n)X(n)/(X(1))n both for the second (n2) and third-order (n3) nonlinearities. Experimental results of ultrafast nonlinear response of conjugated polymers, especially polydiacetylenes, were described and a model is proposed to explain the relaxation processes of photoexcitations in the conjugated polymers. Applying the model constructed on the basis of the extensive experimental study, we propose model polymers to obtain ultrafast resonant optical nonlinearity.

This paper proposes a new construction of the minimum knowledge undeniable signature scheme which solves a problem inherent in Chaum's scheme. We formulate a new proof system, the minimum knowledge interactive bi-proof system, and a pair of languages, the common witness problem, based on the random self-reducible problem. We show that any common witness problem has the minimum knowledge interactive bi-proof system. A practical construction for undeniable signature schemes is proposed based on such a proof system. These schemes provide signature confirmation and disavowal with the same protocol (or at the same time).