全文获取类型
收费全文 | 10250篇 |
免费 | 1033篇 |
国内免费 | 758篇 |
专业分类
化学 | 2102篇 |
晶体学 | 27篇 |
力学 | 799篇 |
综合类 | 225篇 |
数学 | 6246篇 |
物理学 | 2642篇 |
出版年
2024年 | 21篇 |
2023年 | 109篇 |
2022年 | 162篇 |
2021年 | 219篇 |
2020年 | 272篇 |
2019年 | 284篇 |
2018年 | 255篇 |
2017年 | 308篇 |
2016年 | 399篇 |
2015年 | 260篇 |
2014年 | 492篇 |
2013年 | 898篇 |
2012年 | 443篇 |
2011年 | 608篇 |
2010年 | 558篇 |
2009年 | 613篇 |
2008年 | 631篇 |
2007年 | 669篇 |
2006年 | 580篇 |
2005年 | 544篇 |
2004年 | 469篇 |
2003年 | 461篇 |
2002年 | 421篇 |
2001年 | 336篇 |
2000年 | 309篇 |
1999年 | 262篇 |
1998年 | 240篇 |
1997年 | 192篇 |
1996年 | 174篇 |
1995年 | 140篇 |
1994年 | 99篇 |
1993年 | 92篇 |
1992年 | 82篇 |
1991年 | 79篇 |
1990年 | 41篇 |
1989年 | 45篇 |
1988年 | 34篇 |
1987年 | 22篇 |
1986年 | 30篇 |
1985年 | 29篇 |
1984年 | 25篇 |
1983年 | 14篇 |
1982年 | 17篇 |
1981年 | 18篇 |
1980年 | 15篇 |
1979年 | 18篇 |
1978年 | 12篇 |
1977年 | 14篇 |
1976年 | 7篇 |
1973年 | 7篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
41.
42.
Summary A rapid, robust and reproducible method providing excellent separation performance and simplicity using a 0.5% MC-4000 methyl
cellulosic sieving medium in DB-1 coated capillaries has been developed. The method is suitable for qualitative comparison
of DNA restriction profiles for fragments in the size range 100–1000 base pairs (bp). Efficiencies up to 8.5 million plates/m
(1057 bp fragment) were recorded. Peak resolution of 6 bp (291/297 bp, 335/341 bp) and 4 bp (238/242 bp, 341/345 bp) was achieved.
In addition, 1 bp partial resolution of 123/124 bp and 298/297 bp was obtained. Run-to-run (n=15), day-to-day (n=4), and capillary-to-capillary
(n=3) variations of 0.1–0.2% RSD, 0.3–0.5% RSD, and 0.1–0.3% RSD, respectively, were observed. The MC-4000 sieving matrix
was found to be better than hydroxypropyl methyl cellulose and hydroxypropyl cellulose, in terms of both performance and stability
in the DB-1 coated capillaries. The efficiency and resolution in DB-WAX capillaries were inferior to those obtained in DB-1
capillaries. The commercially available DB-1 capillaries were stable for months in the sieving medium at pH 8.3 and could
be regenerated to provide high efficiency after accidental current breaks. 相似文献
43.
谱任意的符号模式矩阵 总被引:1,自引:0,他引:1
一个n阶符号模式矩阵A称为是谱任意的,如果对任意的实系数n次首1多项式r(x),在A的定性矩阵类Q(A)中至少存在一个实矩阵B,使得B的特征多项式是r(x),文中证明了当n为奇数时n阶谱任意符号模式矩阵是存在的。 相似文献
44.
引入了随机环境中双移民生灭过程的概念,定义了过程的模态指示函数,在此基础上研究了其转移矩阵的平稳分布,给出了平稳分布众数的位置与模态指示函数之间的关系.研究了平稳分布的众数与边界关系. 相似文献
45.
In this paper, we consider questions related to the structure of inverse matrices of linear bounded operators acting in infinite-dimensional complex Banach spaces. We obtain specific estimates of elements of inverse matrices for bounded operators whose matrices have a special structure. Matrices are introduced as special operator-valued functions on an index set. The matrix structure is described by the behavior of the given function on elements of a special partition of the index set. The method used for deriving the estimates is based on an analysis of Fourier series of strongly continuous periodic functions. 相似文献
46.
Jiang Tongsong Liu Yonghui Wei Musheng 《高校应用数学学报(英文版)》2006,21(1):113-118
This paper derives a theorem of generalized singular value decomposition of quaternion matrices (QGSVD),studies the solution of general quaternion matrix equation AXB -CYD= E,and obtains quaternionic Roth's theorem. This paper also suggests sufficient and necessary conditions for the existence and uniqueness of solutions and explicit forms of the solutions of the equation. 相似文献
47.
运输网络中最小饱和流的求解 总被引:4,自引:0,他引:4
运输网络中常常由于流量的不可控易发生堵塞现象.网络发生堵塞时的饱和流值达不到最大流值.最小饱和流是运输网络,尤其是紧急疏散网络设计中很重要的一个参数.通过建立网络的割集矩阵来确定网络的堵塞截面,基于此提出了求解最小饱和流的线性规划模型及算法.举例分析表明,利用该算法计算网络最小饱和流更加简便、更加实用. 相似文献
48.
王筑娟 《数学的实践与认识》2006,36(11):217-222
讨论Dx广义正定阵的问题,给出了Dx广义正定阵的一些等价性的刻划,同时还讨论了Dx广义正定阵的若干性质. 相似文献
49.
Let G be a graph and let Pm(G) denote the number of perfect matchings of G.We denote the path with m vertices by Pm and the Cartesian product of graphs G and H by G×H. In this paper, as the continuance of our paper [W. Yan, F. Zhang, Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians, Adv. Appl. Math. 32 (2004) 175-188], we enumerate perfect matchings in a type of Cartesian products of graphs by the Pfaffian method, which was discovered by Kasteleyn. Here are some of our results:1. Let T be a tree and let Cn denote the cycle with n vertices. Then Pm(C4×T)=∏(2+α2), where the product ranges over all eigenvalues α of T. Moreover, we prove that Pm(C4×T) is always a square or double a square.2. Let T be a tree. Then Pm(P4×T)=∏(1+3α2+α4), where the product ranges over all non-negative eigenvalues α of T.3. Let T be a tree with a perfect matching. Then Pm(P3×T)=∏(2+α2), where the product ranges over all positive eigenvalues α of T. Moreover, we prove that Pm(C4×T)=[Pm(P3×T)]2. 相似文献
50.
R. Thomas conjectured, 20 years ago, that the presence of a positive circuit in the interaction graph of a dynamical system is a necessary condition for the presence of several stable states. Recently, E. Remy et al. stated and proved the conjecture for Boolean dynamical systems. Using a similar approach, we generalize the result to discrete dynamical systems, and by focusing on the asynchronous dynamics that R. Thomas used in the course of his analysis of genetic networks, we obtain a more general variant of R. Thomas’ conjecture. In this way, we get a necessary condition for genetic networks to lead to differentiation. 相似文献