The Somatropin Reference Standard (Control 951) of the National Institute of Health Sciences

Somatropin material was examined for preparation of the "Somatropin Reference Standard". The candidate material was evaluated by a domestic collaborative study in which eight laboratories participated. The protein content was determined to be 4.5 mg/Vial based on amino acid analysis. Because of the possibility of application as a chemical reference standard for assay by the HPLC method, a physico-chemical evaluation of the candidate material was also performed. By SE-HPLC, the content of polymer, dimer were determined to be 0.54%, 0.98%, respectively. By RP-HPLC, the early peak area ascribed to desamido and sulfoxide form was 1.07% of the total peak area. And for informational data, the potency of the candidate material, being estimated by three different biological methods, weight gain assay, tibia test and adiposeconversion assay is 14.8 IU/vial. Based on the above results, the candidate was authorized as the Somatropin Reference Standard of the National Institute of Health Sciences.     

3D block-based medial axis transform and chessboard distance transform based on dominance

Traditionally, the block-based medial axis transform (BB-MAT) and the chessboard distance transform (CDT) were usually viewed as two completely different image computation problems, especially for three dimensional (3D) space. In fact, there exist some equivalent properties between them. The relationship between both of them is first derived and proved in this paper. One of the significant properties is that CDT for 3D binary image V is equal to BB-MAT for image V' where it denotes the inverse image of V. In a parallel algorithm, a cost is defined as the product of the time complexity and the number of processors used. The main contribution of this work is to reduce the costs of 3D BB-MAT and 3D CDT problems proposed by Wang [65]. Based on the reverse-dominance technique which is redefined from dominance concept, we achieve the computation of the 3D CDT problem by implementing the 3D BB-MAT algorithm first. For a 3D binary image of size N³, our parallel algorithm can be run in O(logN) time using N³ processors on the concurrent read exclusive write (CREW) parallel random access machine (PRAM) model to solve both 3D BB-MAT and 3D CDT problems, respectively. The presented results for the cost are reduced in comparison with those of Wang's. To the best of our knowledge, this work is the lowest costs for the 3D BB-MAT and 3D CDT algorithms known. In parallel algorithms, the running time can be divided into computation time and communication time. The experimental results of the running, communication and computation times for the different problem sizes are implemented in an HP Superdome with SMP/CC-NUMA (symmetric multiprocessor/cache coherent non-uniform memory access) architecture. We conclude that the parallel computer (i.e., SMP/CC-NUMA architecture or cluster system) is more suitable for solving problems with a large amount of input size.     

Bottom-up pyramid cellular acceptors with three-dimensional layers

In 1997, C.R. Dyer and A. Rosenfeld introduced an acceptor on a two-dimensional pattern (or tape), called the pyramid cellular acceptor, and demonstrated that many useful recognition tasks are executed by pyramid cellular acceptors in time proportional to the logarithm of the diameter of the input. They also introduced a bottom-up pyramid cellular acceptor which is a restricted version of the pyramid cellular acceptor, and proposed some interesting open problems of the bottom-up pyramid cellular acceptors. On the other hand, we think that the study of threedimensional automata has been meaningful as the computational model of three-dimensional information processing such as computer vision, robotics, and so forth. In this paper, we investigate about bottom-up pyramid cellular acceptors with three-dimensional layers, and show their some accepting powers. This work was presented in part at the 13th International Symposium on Artificial Life and Robotics, Oita, Japan, January 31–February 2, 2008     

An efficient Earth Mover's Distance algorithm for robust histogram comparison

We propose EMD-L1: a fast and exact algorithm for computing the Earth Mover's Distance (EMD) between a pair of histograms. The efficiency of the new algorithm enables its application to problems that were previously prohibitive due to high time complexities. The proposed EMD-L1 significantly simplifies the original linear programming formulation of EMD. Exploiting the L1 metric structure, the number of unknown variables in EMD-L1 is reduced to O(N) from O(N2) of the original EMD for a histogram with N bins. In addition, the number of constraints is reduced by half and the objective function of the linear program is simplified. Formally, without any approximation, we prove that the EMD-L1 formulation is equivalent to the original EMD with a L1 ground distance. To perform the EMD-L1 computation, we propose an efficient tree-based algorithm, Tree-EMD. Tree-EMD exploits the fact that a basic feasible solution of the simplex algorithm-based solver forms a spanning tree when we interpret EMD-L1 as a network flow optimization problem. We empirically show that this new algorithm has an average time complexity of O(N2), which significantly improves the best reported supercubic complexity of the original EMD. The accuracy of the proposed methods is evaluated by experiments for two computation-intensive problems: shape recognition and interest point matching using multidimensional histogram-based local features. For shape recognition, EMD-L1 is applied to compare shape contexts on the widely tested MPEG7 shape data set, as well as an articulated shape data set. For interest point matching, SIFT, shape context and spin image are tested on both synthetic and real image pairs with large geometrical deformation, illumination change, and heavy intensity noise. The results demonstrate that our EMD-L1-based solutions outperform previously reported state-of-the-art features and distance measures in solving the two tasks.     

Selectivity and stability via dendritic nonlinearity

Inspired by recent studies regarding dendritic computation, we constructed a recurrent neural network model incorporating dendritic lateral inhibition. Our model consists of an input layer and a neuron layer that includes excitatory cells and an inhibitory cell; this inhibitory cell is activated by the pooled activities of all the excitatory cells, and it in turn inhibits each dendritic branch of the excitatory cells that receive excitations from the input layer. Dendritic nonlinear operation consisting of branch-specifically rectified inhibition and saturation is described by imposing nonlinear transfer functions before summation over the branches. In this model with sufficiently strong recurrent excitation, on transiently presenting a stimulus that has a high correlation with feed- forward connections of one of the excitatory cells, the corresponding cell becomes highly active, and the activity is sustained after the stimulus is turned off, whereas all the other excitatory cells continue to have low activities. But on transiently presenting a stimulus that does not have high correlations with feedforward connections of any of the excitatory cells, all the excitatory cells continue to have low activities. Interestingly, such stimulus-selective sustained response is preserved for a wide range of stimulus intensity. We derive an analytical formulation of the model in the limit where individual excitatory cells have an infinite number of dendritic branches and prove the existence of an equilibrium point corresponding to such a balanced low-level activity state as observed in the simulations, whose stability depends solely on the signal-to-noise ratio of the stimulus. We propose this model as a model of stimulus selectivity equipped with self-sustainability and intensity-invariance simultaneously, which was difficult in the conventional competitive neural networks with a similar degree of complexity in their network architecture. We discuss the biological relevance of the model in a general framework of computational neuroscience.     

Towards understanding the mechanism of action of the multidrug resistance-linked half-ABC transporter ABCG2: a molecular modeling study

The ATP-binding cassette protein ABCG2 is a member of a broad family of ABC transporters with potential clinical importance as a mediator of multidrug resistance. We carried out a homology and knowledge-based, and mutationally improved molecular modeling study to establish a much needed structural framework for the protein, which could serve as guidance for further genetic, biochemical, and structural analyses. Based on homology with known structures of both full-length and nucleotide-binding domains (NBD) of ABC transporters and structural knowledge of integral membrane proteins, an initial model of ABCG2 was established. Subsequent refinement to conform to the lipophilic index distributions in the transmembrane domain (TMD) and to the results of site-directed mutagenesis experiments led to an improved model. The complete ABCG2 model consists of two identical subunits facing each other in a closed conformation. The dimeric interface in the nucleotide-binding domain (NBD) involves a characteristic nucleotide sandwich and the interface in the TMD consists of the TM helices 1–3 of one subunit and the helices 5 and 6 of the other. The interface between the NBD and the TMD is bridged by the conserved structural motif between TM2 and TM3, the intracellular domain 1 (ICD1), and the terminal β-strand (S6) of the central β-sheet in the NBD. The apparent flexibility of the ICD1 may play a role in transmitting conformational changes from the NBD to the TMD or from the TMD to the NBD.     

Switching in polystyrene and polymethyl methacrylate thin films: effect of preparation conditions of the polymers

Switching without any break in the electrodes was observed in polystyrene and polymethyl methacrylate films by controlling the current using a high resistance connected in series with the sample. The effect of the method of polymerization on the switching characteristics were studies for both polymers. Polymers were prepared by -ray irradiation or by catalytic or noncatalytic thermal polymerization. The switching characteristics gave poor reproducibility for the catalytically polymerized polystyrene, but no difference was observed for the three types of polymethyl methacrylate from different origins. In the case of polystyrene, the lower the molecule weight, the higher was the threshold voltage. With polymethyl methacrylate such a dependence was not observed. In both polymers the on-state is relatively stable. When the samples in the on-state were heated above 100° C, they were converted to the offstate. No dots or breaks on the sample were detected by scanning electron microscopy (SEM) after switching has occurred.     

Effects of 4He impurities on 3He nuclear spin-lattice relaxation in hcp solid 3He

Nuclear spin-lattice relaxation properties of hcp solid ³He with ⁴He impurities have been studied. At temperatures below the exchange plateau region, three kinds of relaxation time were observed. To analyze the data, a phenomenological four-bath model was developed, the four baths being the Zeeman bath, the phonon bath, an X-bath, and a Y-bath. The X-bath consists of the exchange bath and a part of the ⁴He-⁴He elastic interaction bath. The Y-bath is the main part of the elastic interaction bath. We measured the concentration dependence of the energy constants of all the baths, as well as the temperature and concentration dependences of the three kinds of relaxation time. The relaxation behavior corresponding to the process between the X-bath and the Y-bath could not be expressed by a single exponential function of time and the relaxation rate was strongly dependent on the concentration. This process may be related to the internal thermal equilibrium process within the elastic interaction bath. The impurity-dependent relaxation time between the X-bath and the phonon bath had a temperature dependence of T ^–n with n = 7.4±0.3.     

Logic circuit synthesis using Prolog

This paper briefly reviews the current use of CAD in logic design, and then describes an expert system used to synthesize logic circuits. Specialized knowledge dealing with standard TTL ICs is written in Prolog and AGE, and the results are compared.