This study demonstrated preliminary results in diagnosis of the numerical model with reference to the TRMM/PR, examples of the GPM/DPR synthetic data, and application of the synthetic data to the algorithm development in the nonuniform beamfilling correction method. These were performed using a satellite radar simulation algorithm by the National Institute of Information and Communications Technology (NICT) and the Japan Aerospace Exploration Agency (JAXA) named as the Integrated Satellite Observation Simulator for Radar (ISOSIM-Radar) and a cloud-resolving model by the Japan Meteorological Agency (JMA-NHM).

We propose a strategy using competitive hybridization for DNA computing. DNA computing is a means of solving intractable computation problems such as NP-complete problems. In our strategy, each spot on a DNA microarray represents the candidate solution. The calculation is executed by competitive hybridization of two groups of fluorescent DNA strands. One group represents a situation in which constraints of the problem are satisfied, and another group represents a situation in which constraints of the problems are not satisfied. After competitive hybridization of two groups, the spot with only the former type of fluorescent DNA strands hold "true" solution. We describe the approach to DNA computing by competitive hybridization through SAT problem. The SAT problem is an NP-complete problem in Boolean logic. We also show that our DNA computing can solve optimization problem through MAX-SAT problem. MAX-SAT problem is one of the derivative problems of SAT and it belongs to MAX-SNP-complete and APX-complete.

T. A. J. Nicholson has introduced a restricted class of drawn graphs (N-graphs) into the problem of drawing a graph with a minimum number of crosspoints. This short note shows some defects in representing the capability of N-graphs by presenting a planar graph which cannot be represented by any N-graphs.

The basic properties and realization of failsafe combinational logic nets and failsafe sequential machines are discussed. The present note concerns totally asymmetric faiiure nets which are composed only of (+) elements and/ or (-) elements, where a (+) element is an asymmetric failure element which never fails to logical zero and a (-) element is defined similarly.