Nanotechnology R&;D Policy of Japan and Nanotechnology Support Project

In the 2nd Science and Technology Basic Plan (2001–2005), the area of nanotechnology and materials is designated one of the four prioritized areas in funding. Following this plan, Ministry of Education, Culture, Sports, Science and Technology (MEXT) and Ministry of Economy, Trade and Industries (METI), the main funding ministries, and their organizations, Japan Society for the Promotion of Science (JSPS), Japan Science and Technology Agency (JST), National Institute for Materials Science (NIMS), RIKEN, New Energy and Industrial Technology Organization (NEDO), and National Institute of Advanced Industrial Science and Technology (AIST) promotes their research programs. Besides, in order to promote interdisciplinary, interorganizational, and international collaboration of researchers, Nanotechnology Support Project (NSP) was started by MEXT in 2002. The project has two missions: informational support and common use facility support. Nanotechnology Researchers Network Center of Japan is responsible for informational support, and 14 universities and national research institutes are responsible for common use facility support.     

Communication, credible improvements and the core of an economy with asymmetric information

We analyze an economy with asymmetric information and endogenize the possibilities for information transmission between members of a coalition. We then define a concept of the Core that takes into account these communication possibilities. The internal consistency of the improvements is considered and an Internally Consistent Core, which requires credibility from the improvements is introduced. Received: September 1998/revised version: June 1999     

城市综合实力增长的比较

本文基于多个总体的主成分分析方法,对城市综合实力增长的比较进行一些探索性的研究。对我国十八个大城市１９９４年、１９９５年和１９９６年的八个指标用多个总体的主成分分析方法进行分析,通过检验和计算,得到这三个总体的公共主成分子空间。取公共主成分子空间的一正交基作为这三个总体的新的主成分ＰＲＩＮ１的系数,此主成分即表示城市综合实力。计算出各城市任意两年间的综合实力差值,以此作为城市综合实力增长的度量,对城市综合实力增长再作主成分分析,即得到有效的城市综合实力增长的比较方法     

Strong convergence theorems for strictly asymptotically pseudocontractive mappings in Hilbert spaces

The purpose of this paper is by using CSQ method to study the strong convergence problem of iterative sequences for a pair of strictly asymptotically pseudocontractive mappings to approximate a common fixed point in a Hilbert space. Under suitable conditions some strong convergence theorems are proved. The results presented in the paper are new which extend and improve some recent results of Acedo and Xu [Iterative methods for strict pseudo-contractions in Hilbert spaces. Nonlinear Anal., 67(7), 2258??271 (2007)], Kim and Xu [Strong convergence of modified Mann iterations for asymptotically nonexpansive mappings and semigroups. Nonlinear Anal., 64, 1140??152 (2006)], Martinez-Yanes and Xu [Strong convergence of the CQ method for fixed point iteration processes. Nonlinear Anal., 64, 2400??411 (2006)], Nakajo and Takahashi [Strong convergence theorems for nonexpansive mappings and nonexpansive semigroups. J. Math. Anal. Appl., 279, 372??79 (2003)], Marino and Xu [Weak and strong convergence theorems for strict pseudocontractions in Hilbert spaces. J. Math. Anal. Appl., 329(1), 336??46 (2007)], Osilike et al. [Demiclosedness principle and convergence theorems for k-strictly asymptotically pseudocontractive maps. J. Math. Anal. Appl., 326, 1334??345 (2007)], Liu [Convergence theorems of the sequence of iterates for asymptotically demicontractive and hemicontractive mappings. Nonlinear Anal., 26(11), 1835??842 (1996)], Osilike et al. [Fixed points of demi-contractive mappings in arbitrary Banach spaces. Panamer Math. J., 12 (2), 77??8 (2002)], Gu [The new composite implicit iteration process with errors for common fixed points of a finite family of strictly pseudocontractive mappings. J. Math. Anal. Appl., 329, 766??76 (2007)].     

Novel evolutionary models and applications to sequence alignment problems

In this paper, we present a novel graph-theoretical approach for representing a wide variety of sequence analysis problems within a single model. The model allows incorporation of the operations “insertion”, “deletion”, and “substitution”, and various parameters such as relative distances and weights. Conceptually, we refer the problem as the minimum weight common mutated sequence (MWCMS) problem. The MWCMS model has many applications including multiple sequence alignment problem, the phylogenetic analysis, the DNA sequencing problem, and sequence comparison problem, which encompass a core set of very difficult problems in computational biology. Thus the model presented in this paper lays out a mathematical modeling framework that allows one to investigate theoretical and computational issues, and to forge new advances for these distinct, but related problems. Through the introduction of supernodes, and the multi-layer supergraph, we proved that MWCMS is -complete. Furthermore, it was shown that a conflict graph derived from the multi-layer supergraph has the property that a solution to the associated node-packing problem of the conflict graph corresponds to a solution of the MWCMS problem. In this case, we proved that when the number of input sequences is a constant, MWCMS is polynomial-time solvable. We also demonstrated that some well-known combinatorial problems can be viewed as special cases of the MWCMS problem. In particular, we presented theoretical results implied by the MWCMS theory for the minimum weight supersequence problem, the minimum weight superstring problem, and the longest common subsequence problem. Two integer programming formulations were presented and a simple yet elegant decomposition heuristic was introduced. The integer programming instances have proven to be computationally intensive. Consequently, research involving simultaneous column and row generation and parallel computing will be explored. The heuristic algorithm, introduced herein for multiple sequence alignment, overcomes the order-dependent drawbacks of many of the existing algorithms, and is capable of returning good sequence alignments within reasonable computational time. It is able to return the optimal alignment for multiple sequences of length less than 1500 base pairs within 30 minutes. Its algorithmic decomposition nature lends itself naturally for parallel distributed computing, and we continue to explore its flexibility and scalability in a massive parallel environment.     

定义在广义Gcd—closed集S上的GGCD矩阵和GLCM矩阵的逆

设S＝｛x1,x2,…xn｝是一个由非零整数且|xi|≠|xj≠k.1≤i,j≤n)组合的集合,我们先定义了集S上的广义GCD（GGCD）矩阵和广义LCM（GLCM）矩阵,然后计算了定义在广义gcd-closed集上的GGCD矩阵和CLCM矩阵的逆矩阵。     

角反射器阵列作为伪相位共轭器件的保真度分析

 研究了共光路共模块自适应光学系统中用角反射器阵列构成伪相位共轭器件,角反射器阵列形成伪相位共轭波的能力,具体计算了不同单元数的角反射器阵列形成具有Zernike多项式展开的各阶像差的波面的相位共轭的保真度。角反射器阵列的保真度决定于其单元数和阵列结构,对于不同类型的像差保真度也是不同的。最后对各种影响因素如衍射、二面角误差和面形误差等进行了分析。     

半序度量空间中公共二元随机重合点定理及其应用

在完备可分的半序度量空间中,引入了随机映射对(F,G)关于g随机半序弱增以及(F,G)随机半序弱增的定义,研究了在满足一定非线性压缩条件下的随机映射列F_k:Ω×X×X→X,k=1,2…,g:Ω×X→X和h:Ω×X→X的公共二元随机重合点与公共二元随机不动点问题,所得结果推广了已有文献中的一些不动点定理.     

关于最大公因数的一个定理的推广

本文推广了关于最大公因数的一个定理.     

交运算的连续性和重合点的通有稳定性

建立了全新的集合族空间,讨论了公共元的通有稳定性,得到了闭集族空间上的交运算在Hausdorff拓扑下的上半连续性,并研究了重合点的通有稳定性.