首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   22389篇
  免费   1123篇
  国内免费   1323篇
化学   9236篇
晶体学   182篇
力学   122篇
综合类   39篇
数学   13320篇
物理学   1936篇
  2023年   134篇
  2022年   177篇
  2021年   185篇
  2020年   292篇
  2019年   572篇
  2018年   489篇
  2017年   393篇
  2016年   354篇
  2015年   516篇
  2014年   750篇
  2013年   1971篇
  2012年   931篇
  2011年   1452篇
  2010年   1238篇
  2009年   1332篇
  2008年   1650篇
  2007年   1579篇
  2006年   1236篇
  2005年   955篇
  2004年   847篇
  2003年   726篇
  2002年   851篇
  2001年   571篇
  2000年   566篇
  1999年   560篇
  1998年   490篇
  1997年   414篇
  1996年   387篇
  1995年   419篇
  1994年   388篇
  1993年   295篇
  1992年   259篇
  1991年   169篇
  1990年   169篇
  1989年   148篇
  1988年   114篇
  1987年   104篇
  1986年   110篇
  1985年   136篇
  1984年   128篇
  1983年   76篇
  1982年   100篇
  1981年   100篇
  1980年   101篇
  1979年   77篇
  1978年   85篇
  1977年   53篇
  1976年   48篇
  1975年   27篇
  1974年   31篇
排序方式: 共有10000条查询结果,搜索用时 46 毫秒
101.
This paper shows that for a local field K, a subfield kK and a variety X over k, X is complete if and only if for every finite field extension Kʹ | K, the set X(Kʹ) is compact in its strong topology. The author likes to thank Florian Pop, Jakob Stix, Stefan Wewers, Gunther Cornelissen and his own parents for their support. Received: 13 April 2006  相似文献   
102.
Let V={1,2,…,n}. A mapping p:VRr, where p1,…,pn are not contained in a proper hyper-plane is called an r-configuration. Let G=(V,E) be a simple connected graph on n vertices. Then an r-configuration p together with graph G, where adjacent vertices of G are constrained to stay the same distance apart, is called a bar-and-joint framework (or a framework) in Rr, and is denoted by G(p). In this paper we introduce the notion of dimensional rigidity of frameworks, and we study the problem of determining whether or not a given G(p) is dimensionally rigid. A given framework G(p) in Rr is said to be dimensionally rigid iff there does not exist a framework G(q) in Rs for s?r+1, such that ∥qi-qj2=∥pi-pj2 for all (i,j)∈E. We present necessary and sufficient conditions for G(p) to be dimensionally rigid, and we formulate the problem of checking the validity of these conditions as a semidefinite programming (SDP) problem. The case where the points p1,…,pn of the given r-configuration are in general position, is also investigated.  相似文献   
103.
We show that the infimum of any family of proximally symmetric quasi-uniformities is proximally symmetric, while the supremum of two proximally symmetric quasi-uniformities need not be proximally symmetric. On the other hand, the supremum of any family of transitive quasi-uniformities is transitive, while there are transitive quasi-uniformities whose infimum with their conjugate quasi-uniformity is not transitive. Moreover we present two examples that show that neither the supremum topology nor the infimum topology of two transitive topologies need be transitive. Finally, we prove that several operations one can perform on and between quasi-uniformities preserve the property of having a complement.  相似文献   
104.
The minimum span of L(2,1)-labelings of certain generalized Petersen graphs   总被引:1,自引:0,他引:1  
In the classical channel assignment problem, transmitters that are sufficiently close together are assigned transmission frequencies that differ by prescribed amounts, with the goal of minimizing the span of frequencies required. This problem can be modeled through the use of an L(2,1)-labeling, which is a function f from the vertex set of a graph G to the non-negative integers such that |f(x)-f(y)|? 2 if xand y are adjacent vertices and |f(x)-f(y)|?1 if xand y are at distance two. The goal is to determine the λ-number of G, which is defined as the minimum span over all L(2,1)-labelings of G, or equivalently, the smallest number k such that G has an L(2,1)-labeling using integers from {0,1,…,k}. Recent work has focused on determining the λ-number of generalized Petersen graphs (GPGs) of order n. This paper provides exact values for the λ-numbers of GPGs of orders 5, 7, and 8, closing all remaining open cases for orders at most 8. It is also shown that there are no GPGs of order 4, 5, 8, or 11 with λ-number exactly equal to the known lower bound of 5, however, a construction is provided to obtain examples of GPGs with λ-number 5 for all other orders. This paper also provides an upper bound for the number of distinct isomorphism classes for GPGs of any given order. Finally, the exact values for the λ-number of n-stars, a subclass of the GPGs inspired by the classical Petersen graph, are also determined. These generalized stars have a useful representation on Möebius strips, which is fundamental in verifying our results.  相似文献   
105.
106.
Starting from certain point sets in the projective plane, we construct a tropical (or subtraction-free birational) representation of Weyl groups over the field of τ-functions. In particular, our construction includes E 8 (1) , E 7 (1) , E 6 (1) and D 5 (1) as affine cases; each of them gives rise to the q-difference Painlevé equation.  相似文献   
107.
We prove a conjecture by F. Ferrari. Let X be the total space of a nonlinear deformation of a rank two holomorphic vector bundle on a smooth rational curve, such that X has trivial canonical bundle and has sections. Then the normal bundle to such sections is computed in terms of the rank of the Hessian of a suitably defined superpotential at its critical points.  相似文献   
108.
A set (or a collection of sets) contained in the Euclidean space Rm is symmetric if it is invariant under the antipodal map. Given a symmetric unicoherent polyhedron X (like an n-dimensional cube or a sphere) and an odd real function f defined on vertices of a certain symmetric triangulation of X, we algorithmically construct a connected symmetric separator of X by choosing a subcollection of the triangulation. Each element of the subcollection contains the vertices v and u such that f(v)f(u)?0.  相似文献   
109.
New criteria are provided for determining whether an integral representation of a stable process is minimal. These criteria are based on various nonminimal sets and their projections, and have several advantages over and shed light on already available criteria. In particular, they naturally lead from a nonminimal representation to the one which is minimal. Several known examples are considered to illustrate the main results. The general approach is also adapted to show that the so-called mixed moving averages have a minimal integral representation of the mixed moving average type.  相似文献   
110.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号