|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | Review on the study of entanglement in quantum computation speedup显示文摘The role the quantum entanglement plays in quantum computation speedup has been widely disputed. Some believe that quantum computation's speedup over classical computation is impossible if entan-glement is absent,while others claim that the presence of entanglement is not a necessary condition for some quantum algorithms. This paper discusses this problem systematically. Simulating quantum computation with classical resources is analyzed and entanglement in known algorithms is reviewed. It is concluded that the presence of entanglement is a necessary but not sufficient condition in the pure state or pseudo-pure state quantum computation speedup. The case with the mixed state remains open. Further work on quantum computation will benefit from the presented results. | DING ShengChao1,3 & JIN Zhi1,2,1 Institute of Computing Technology,Chinese Academy of Sciences,Beijing 100080,China 2 Academy of Mathematics and Systems Science,Chinese Academy of Sciences,Beijing 100080,China 3 Graduate University of Chinese Academy of Sciences,Beijing 100080,China | 2007 | Chinese Science Bulletin2007，52，16： | 34 |
| 2 | Modeling and verifying Web services driven by requirements:An ontology-based approach显示文摘Automatic discovery and composition of Web services is an important research area in Web service technology, in which the specification of Web services is a key issue. This paper presents a Web service capability description framework based on the environment ontology. This framework depicts Web services capability in two aspects: the operable environment and the environment changes resulting from behaviors of the Web service. On the basis of the framework, a requirement-driven Web service composition model has been constructed. This paper brings forward the formalization of Web service interactions with π calculus. And an automatic mechanism converting conceptual capability description to the formal process expression has been built. This kind of formal specification assists in verifying whether the composite Web service model matches the requirement. | HOU Lishan1,3,JIN ZHi1,2 & WU Budan1,4 1. Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100080, China 2. Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100080, China 3. Institute of Software, Chinese Academy of Sciences, Beijing 100080, China 4. Graduate University of Chinese Academy of Sciences, Beijing 100049, China | 2006 | Science in China(Series F)2006，49，6： | 15 |
| 3 | Evaluation of Six Methods for Estimating Synonymous and Non-synonymous Substitution Rates显示文摘Methods for estimating synonymous and nonsynonymous substitution rates among protein-coding sequences adopt different mutation (substitution) models with sub- tle yet significant differences, which lead to different estimates of evolutionary information. Little attention has been devoted to the comparison of methods for obtaining reliable estimates since the amount of sequence variations within tar- geted datasets is always unpredictable. To our knowledge, there is little informa- tion available in literature about evaluation of these different methods. In this study, we compared six widely used methods and provided with evaluation results using simulated sequences. The results indicate that incorporating sequence fea- tures (such as transition/transversion bias and nucleotide/codon frequency bias) into methods could yield better performance. We recommend that conclusions related to or derived from Ka and Ks analyses should not be readily drawn only according to results from one method. | Zhang Zhang1,2,3 and Jun Yu1,2,4* 1 Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100080, China 2 Beijing Institute of Genomics, Chinese Academy of Sciences, Beijing 101300, China 3Graduate School, Chinese Academy of Sciences, Beijing 100039, China 4James D. Watson Institute of Genome Sciences, Zhejiang University, Hangzhou 310007, China. | 2006 | Genomics, Proteomics & Bioinformatics2006，4，3： | 7 |
| 4 | A draft sequence of the rice (Oryza sativa ssp. indica) genome显示文摘The sequence of the rice genome holds fundamental information for its biology, including physiology, genetics, development, and evolution, as well as information on many beneficial phenotypes of economic significance. Using a 'whole genome shotgun' approach, we have pro-duced a draft rice genome sequence of Oryza sativa ssp. in-dica, the major crop rice subspecies in China and many other regions of Asia. The draft genome sequence is constructed from over 4.3 million successful sequencing traces with an accumulative total length of 2214.9 Mb. The initial assembly of the non-redundant sequences reached 409.76 Mb in length, based on 3.30 million successful sequencing traces with a total length of 1797.4 Mb from an indica variant cultivar 93-11, giving an estimated coverage of 95.29% of the rice genome with an average base accuracy of higher than 99%. The coverage of the draft sequence, the randomness of the sequence distribution, and the consistency of BIG-ASSEM-BLER, a custom-designed software package | YU Jun, HU Songnian, WANG Jun,LI Songgang WONG Ka-Shu Gane, LIU Bin,DENG Yajun, DAI Li, ZHOU Yan,ZHANG Xiuqing, CAO Mengliang, LIU Jing,SUN Jiandong , TANG Jiabin, CHEN Yanjiong,HUANG Xiaobing, LIN Wei, YE Chen, TONG Wei,CONG Lijuan, GENG Jianing, HAN Yujun, LI Lin,LI Wei, HU Guangqiang, HUANG Xiangang,LI Wenjie, LI Jian, LIU Zhanwei, LI Long,LIU Jianping, Ql Qiuhui, LIU Jinsong, LI Li,WANG Xuegang, LU Hong, WU Tingling,ZHU Miao, Nl Peixiang, HAN Hua, DONG Wei,REN Xiaoyu, FENG Xiaoli, GUI Peng,LI Xianran, WANG Hao, XU Xin, ZHAI Wenxue,XU Zhao, ZHANG Jinsong, HE Sijie,ZHANG Jianguo, XU Jichen, ZHANG Kunlin,ZHENG Xianwu, DONG Jianhai, ZENG Wanyong,TAO Lin, CHEN Xuewei, HE Jun, LIU Daofeng,TIAN Wei, TIAN Chaoguang, XIA Hongai,LI Gang, GAO Hui, LI Ping, CHEN Wei ,WANG Xudong, ZHANG Yong, HU Jianfei,WANG Jing, LIU Song, YANG Jian,ZHANG Guangyu, XIONG Yuqing, LI Zhijie,MAO Long, ZHOU Chengshu, ZHU Zhen,CHEN Runsheng, HAO Bailin,ZHENG Weimou, CHEN Shouyi, QUO Wei,LI Guojie, LIU Siqi, HUANG Guyang,TAO Ming, WANG Jian, ZHU Lihuang,YUAN Longping& YANG HuanmingBeijing Genomics Institute/Center of Genomics & Bioinformatics, Chinese Academy of Sciences, Beijing 101300, China Hangzhou Genomics Institute/Institute of Bioinformatics of Zhejiang University/Key Laboratory of Bioinformatics of Zhejiang Province, Hangzhou 310007, China Institute of Genetics, Chinese Academy of Sciences, Beijing 100101, China National Hybrid Rice R & D Center, Changsha 410125, China Laboratory of Bioinformatics, Institute of Biophysics, Chinese Academy of Sciences, Beijing 100101, China College of Life Sciences, Peking University, Beijing 100871, China Institute of Theoretical Physics, Chinese Academy of Sciences, Beijing 1Q0080, China Digital China Ltd., Beijing 100080, China Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100080, China Medical College, Xi’an Jiaotong University, Xi’an 710061, ChinaThese authors contributed equally to this work.Corresponding author.Corresponden | 2001 | Chinese Science Bulletin2001，46，23： | 6 |
| 5 | Design of secure operating systems with high security levels显示文摘Numerous Internet security incidents have shown that support from secure operating systems is paramount to fighting threats posed by modern computing environments. Based on the requirements of the relevant national and international standards and criteria, in combination with our experience in the design and development of the ANSHENG v4.0 secure operating system with high security level (hereafter simply referred to as ANSHENG OS), this paper addresses the following key issues in the design of secure operating systems with high security levels: se- curity architecture, security policy models, and covert channel analysis. The design principles of security architecture and three basic security models: confidentiality, integrity, and privilege control models are discussed, respectively. Three novel security models and new security architecture are proposed. The prominent features of these proposals, as well as their applications to the ANSHENG OS, are elaborated. Cover channel analysis (CCA) is a well-known hard problem in the design of secure operating systems with high security levels since to date it lacks a sound theoretical basis and systematic analysis approach. In order to resolve the fundamental difficulties of CCA, we have set up a sound theoretical basis for completeness of covert channel identification and have proposed a unified framework for covert channel identification and an efficient backward tracking search method. The successful application of our new proposals to the ANSHENG OS has shown that it can help ease and speedup the entire CCA process. | QING SiHan1,2 & SHEN ChangXiang3 1 Institute of Software, Chinese Academy of Sciences, Beijing 100080, China 2 School of Software and Microelectronics, Peking University, Beijing 102600, China 3 Institute of Computing Technology, Navy, Beijing 100841, China | 2007 | Science in China(Series F)2007，50，3： | 5 |
| 6 | On the coupled NBEM and FEM for a class of nonlinear exterior Dirichlet problem in R^(2*)显示文摘In this paper, based on the natural boundary reduction advanced by Feng and Yu, we couple the finite elementapproach with the natural boundary element method to study theweak solvability and Galerkin approximation of a class ofnonlinear exterior boundary value problems. The analysis is mainlybased on the variational formulation with constraints.We provethe error estimate of the finite element solution and obtain theasymptotic rate of convergence. Finally, we also give anumerical example. | WU Zhengpeng, KANG Tong & YU DehaoInstitute of Computational Mathematics and Scientific/Engineering Computing, Academy of Mathematics and System Sciences, Chinese Academy of Sciences, Beijing 100080, China Department of Applied Mathematics, Beijing Broadcasting Institute, Beijing 100024, China Combinatorial and Computational Mathematics Center, Pohang University of Science and Technology, Phoang 790-784, Republic of Korea | 2004 | Science China Mathematics2004，47，z1： | 4 |
| 7 | Simulation study of phase retrieval for hard X-ray in-line phase contrast imaging显示文摘Two algorithms for the phase retrieval of hard X-ray in-line phase contrast imaging are presented. One is referred to as Iterative Angular Spectrum Algorithm (IASA) and the other is a hybrid algorithm that combines IASA with TIE (transport of intensity equation). The calculations of the algorithms are based on free space propagation of the angular spectrum. The new approaches are demonstrated with numerical simulations. Comparisons with other phase retrieval algorithms are also performed. It is shown that the phase retrieval method combining the IASA and TIE is a promising technique for the application of hard X-ray phase contrast imaging. | YU Bin1,2, PENG Xiang1,2, TIAN Jindong1, NIU Hanben1, DIAO Luhong3 & LI Hua3 1. Key Laboratory of Optoelectronic Devices and Systems of Ministry of Education, Institute of Optoelec- tronics, Shenzhen University, Shenzhen 518060, China 2. State Key Laboratory of Precision Measuring Technology and Instruments, Tianjin University, Tianjin 300072,China 3. Key Laboratory of Intelligent Information Processing, Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100080,China | 2005 | Science China(Physics,Mechanics & Astronomy)2005，48，4： | 2 |
| 8 | Synchronized oscillation in a modular neural network composed of columns显示文摘The columnar organization is a ubiquitous feature in the cerebral cortex. In this study, a neural network model simulating the cortical columns has been constructed. When fed with random pulse input with constant rate, a column generates synchronized oscillations, with a frequency varying from 3 to 43 Hz depending on parameter values. The behavior of the model under periodic stimulation was studied and the input-output relationship was non-linear. When identical columns were sparsely interconnected, the column oscillator could be locked in synchrony. In a network composed of heterogeneous columns, the columns were organized by intrinsic properties and formed partially synchronized assemblies. | LI Su, Ql Xianglin, HU Hong & WANG Yunjiu Laboratory for Visual Information Processing, Institute of Biophysics, Chinese Academy of Sciences, Beijing 100101, China Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100080, China | 2005 | Science China(Life Sciences)2005，48，1： | 1 |
| 9 | Formal Verification under Unknown Constraints显示文摘We present a formal method of verifying designs with unknown constraints (e.g., black boxes) using Boolean satisfiability (SAT). This method is based on a new encoding scheme of unknown constraints, and solves the corresponding conjunctive normal form (CNF) formulas.Furthermore,this method can avoid the potential memory explosion, which the binary decision diagram (BDD) based techniques maybe suffer from, thus it has the capacity of verifying large designs. Experimental results demonstrate the efficiency and feasibility of the proposed method. | LI Guang-hui 1,2,3 , LI Xiao-wei 2,31. School of Information Engineering, Zhejiang Forestry College, Hangzhou 311300, Zhejiang, China 2. Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100080, China 3. Graduate School of the Chinese Academy of Sciences, Beijing 100039, China | 2005 | Wuhan University Journal of Natural Sciences2005，10，1： | 1 |
| 10 | A mixed finite element method for the unilateral contact problem in elasticity显示文摘In this paper, we provide a new mixed finite element approximation of the variational inequality resulting from the unilateral contact problem in elasticity. We use the continuous piecewise P2-P1 finite element to approximate the displacement field and the normal stress component on the contact region. Optimal convergence rates are obtained under the reasonable regularity hypotheses. Numerical example verifies our results. | HUA Dongying & WANG Lieheng The First Fundamental Department, Beijing Information Technology Institute, Beijing 100101, China Institute of Computational Mathematics and Scientific/Engineering Computing, Academy of Mathematics and System Sciences, Chinese Academy of Sciences, Beijing 100080, China | 2006 | Science China Mathematics2006，49，4： | 1 |
| 11 | Target-Fault-Oriented Test Generation of Sequential CircuitsUsing Genetic Algorithm显示文摘This paper deals with the target-fault-oriented test generation of sequential circuits using genetic algorithms. We adopted the concept of multiple phases and proposed four sub-procedures which consist of activation, propagation and justification phases. The paper focuses on the design of genetic operators and construction of fitness functions which are based on the structure information of circuits. Using ISCAS89 benchmarks, the experiment results of GA were given. | Li Shen Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China, 100080 | 2000 | 湖南大学学报(自然科学版)2000，27，S2： | 0 |
| 12 | The universal fuzzy logical framework of neural circuits and its application in modeling primary visual cortex显示文摘Analytical study of large-scale nonlinear neural circuits is a difficult task. Here we analyze the function of neural systems by probing the fuzzy logical framework of the neural cells' dynamical equations. Al- though there is a close relation between the theories of fuzzy logical systems and neural systems and many papers investigate this subject, most investigations focus on finding new functions of neural systems by hybridizing fuzzy logical and neural system. In this paper, the fuzzy logical framework of neural cells is used to understand the nonlinear dynamic attributes of a common neural system by abstracting the fuzzy logical framework of a neural cell. Our analysis enables the educated design of network models for classes of computation. As an example, a recurrent network model of the primary visual cortex has been built and tested using this approach. | HU Hong1, LI Su2, WANG YunJiu2, QI XiangLin2 & SHI ZhongZhi1 1 Key Laboratory of Intelligent Information Processing, Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100080, China 2 Laboratory of Visual Information Processing, Institute of Biophysics, Chinese Academy of Sciences, Beijing 100101, China | 2008 | Science China(Life Sciences)2008，51，10： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员