全文获取类型
收费全文 | 15122篇 |
免费 | 812篇 |
国内免费 | 1542篇 |
专业分类
化学 | 3415篇 |
晶体学 | 45篇 |
力学 | 275篇 |
综合类 | 151篇 |
数学 | 6249篇 |
物理学 | 1468篇 |
综合类 | 5873篇 |
出版年
2024年 | 33篇 |
2023年 | 149篇 |
2022年 | 222篇 |
2021年 | 290篇 |
2020年 | 312篇 |
2019年 | 350篇 |
2018年 | 337篇 |
2017年 | 374篇 |
2016年 | 278篇 |
2015年 | 326篇 |
2014年 | 571篇 |
2013年 | 1208篇 |
2012年 | 610篇 |
2011年 | 796篇 |
2010年 | 601篇 |
2009年 | 838篇 |
2008年 | 863篇 |
2007年 | 1148篇 |
2006年 | 922篇 |
2005年 | 865篇 |
2004年 | 727篇 |
2003年 | 751篇 |
2002年 | 659篇 |
2001年 | 547篇 |
2000年 | 504篇 |
1999年 | 479篇 |
1998年 | 437篇 |
1997年 | 375篇 |
1996年 | 296篇 |
1995年 | 240篇 |
1994年 | 247篇 |
1993年 | 174篇 |
1992年 | 186篇 |
1991年 | 142篇 |
1990年 | 114篇 |
1989年 | 110篇 |
1988年 | 95篇 |
1987年 | 86篇 |
1986年 | 35篇 |
1985年 | 43篇 |
1984年 | 22篇 |
1983年 | 15篇 |
1982年 | 19篇 |
1981年 | 19篇 |
1980年 | 10篇 |
1979年 | 7篇 |
1978年 | 11篇 |
1977年 | 12篇 |
1976年 | 4篇 |
1936年 | 3篇 |
排序方式: 共有10000条查询结果,搜索用时 7 毫秒
61.
A subgroup if of a group G is called semipermutable if it is permutable with every subgroup K of G with (|H|, |K|) - 1, and s-semipermutable if it is permutable with every Sylow p-subgroup of G with (p, |H|) = 1. In this paper, some sufficient conditions for a group to be solvable are obtained in terms of s-semipermutability. 相似文献
62.
Vasiliy A. Ustimenko 《Acta Appl Math》2002,74(2):117-153
A combinatorial method of encryption with a similarity to the classical scheme of linear coding has been suggested by the author. The general idea is to treat vertices of a graph as messages and arcs of a certain length as encryption tools. We will study the quality of such an encryption in the case of graphs of high girth by comparing the probability to guess the message, (vertex) at random with the probability of breaking the key, i.e. guessing the encoding arc. In fact, the quality is good for graphs which are close to the Erdös bound, defined by the Even Cycle Theorem.In the case of parallelotopic graphs, there is a uniform way to match arcs with strings in a certain alphabet. Among parallelotopic graphs we distinguish linguistic graphs of affine type whose vertices (messages) and arcs (encoding tools) both could be naturally identified with vectors over the GF(q), and neighbors of the vertex defined by a system of linear equations. We will discuss families of linguistic and parallelotopic graphs of increasing girth as the source for assymmetric cryptographic functions and related open key algorithms.Several constructions of families of linguistic graphs of high girth with good quality, complexity and expansion coefficients will be considered. Some of those constructions have been obtained via group-theoretical and geometrical techniques. 相似文献
63.
Piotr W. Nowak 《Journal of Functional Analysis》2007,243(1):323-344
We introduce a quasi-isometry invariant related to Property A and explore its connections to various other invariants of finitely generated groups. This allows to establish a direct relation between asymptotic dimension on one hand and isoperimetry and random walks on the other. We apply these results to reprove sharp estimates on isoperimetric profiles of some groups and to answer some questions in dimension theory. 相似文献
64.
Automorphisms of groups acting faithfully on rooted trees are studied. We find conditions under which every automorphism of such a group is induced by a conjugation from the full automorphism group of the rooted tree. These results are applied to known examples such as Grigorchuk groups, Gupta–Sidki group, etc. 相似文献
65.
P. G. Hjorth S. L. Kokkendorff S. Markvorsen 《Proceedings of the American Mathematical Society》2002,130(1):175-181
We study finite metric spaces with elements picked from, and distances consistent with, ambient Riemannian manifolds. The concepts of negative type and strictly negative type are reviewed, and the conjecture that hyperbolic spaces are of strictly negative type is settled, in the affirmative. The technique of the proof is subsequently applied to show that every compact manifold of negative type must have trivial fundamental group, and to obtain a necessary criterion for product manifolds to be of negative type.
66.
An asymptotic formula is obtained for the number of representations of an element of a finite field as a weighted sum of two prescribed powers of primitive elements. This generalises previous work on sums of primitive elements, including that relating to some conjectures of Golomb. 相似文献
67.
设 G=(A,△)为紧矩阵量子群,G为A的所有有限维光滑的、不可约余表示等价类的集合.本文通过(A,△)的一个余表示Vo构造了两个相互配对的集合,利用Hilbert C*-模的理论证明它们分别为A和Baaj与Skandalis构造的量子群A,并且证明了对任意的α∈G,在A中都对应一个有限维投影算子Pα,满足 dim(α)=dim(pα). 相似文献
68.
由2—噻吩基锂和N-吡咯格氏试剂分别与氟五甲基二硅烷反应,制得了2—噻吩基、五甲基二硅烷(Ⅰ)和N-吡咯基五甲基二硅烷(Ⅱ)。两种二硅烷都是无色液体。Ⅰ在室温下空气中是稳定的,Ⅱ在空气中逐渐转变成绿褐色。元素分析,IR,~1H MR和MS分析证实了其结构。Ⅰ和Ⅱ的最大紫外吸收峰分别为242.0nm和220.1nm。 相似文献
69.
A new approximate scheme which is combined by the mean-field renormalization group theory (MFRG) with the discretized path-integral renormalization (DPIR) is employed in the study of the disordered tranverse Ising model (TIM). The critical properties of random-bonds Ising systems on a d-dimensional lattice are calculated with this new approximate scheme. 相似文献
70.
董彪 《青海师范大学学报(自然科学版)》2003,(2):31-33
题库(ITEM BANK)是按照一定的教育测量理论,在计算机系统中实现的某个学科题目的集合.建立题库系统,计算机辅助教师命题组卷,是提高教学质量,实现测试手段现代化的有效途径. 相似文献