首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   10908篇
  免费   196篇
  国内免费   253篇
化学   1294篇
晶体学   17篇
力学   62篇
综合类   7篇
数学   9319篇
物理学   658篇
  2023年   16篇
  2022年   20篇
  2021年   24篇
  2020年   46篇
  2019年   229篇
  2018年   248篇
  2017年   134篇
  2016年   82篇
  2015年   123篇
  2014年   250篇
  2013年   1004篇
  2012年   331篇
  2011年   802篇
  2010年   660篇
  2009年   660篇
  2008年   875篇
  2007年   879篇
  2006年   650篇
  2005年   383篇
  2004年   327篇
  2003年   279篇
  2002年   221篇
  2001年   230篇
  2000年   215篇
  1999年   253篇
  1998年   190篇
  1997年   190篇
  1996年   172篇
  1995年   248篇
  1994年   218篇
  1993年   165篇
  1992年   145篇
  1991年   99篇
  1990年   89篇
  1989年   70篇
  1988年   53篇
  1987年   55篇
  1986年   68篇
  1985年   94篇
  1984年   80篇
  1983年   41篇
  1982年   67篇
  1981年   67篇
  1980年   65篇
  1979年   47篇
  1978年   65篇
  1977年   40篇
  1976年   37篇
  1975年   18篇
  1974年   18篇
排序方式: 共有10000条查询结果,搜索用时 171 毫秒
41.
We investigate properties of minimally generated Boolean algebras. It is shown that all measures defined on such algebras are separable but not necessarily weakly uniformly regular. On the other hand, there exist Boolean algebras small in terms of measures which are not minimally generated. We prove that under CH a measure on a retractive Boolean algebra can be nonseparable. Some relevant examples are indicated. Also, we give two examples of spaces satisfying some kind of Efimov property.  相似文献   
42.
We prove that the class of homogeneous quasi-arithmetic progressions has unbounded discrepancy. That is, we show that given any 2-coloring of the natural numbers and any positive integer D, one can find a real number α≥1 and a set of natural numbers of the form {0, [α], [2α], [3α], . . . , [kα]} so that one color appears at least D times more than the other color. This was already proved by Beck in 1983, but the proof given here is somewhat simpler and gives a better bound on the discrepancy.  相似文献   
43.
A magic labelling of a set system is a labelling of its points by distinct positive integers so that every set of the system has the same sum, the magic sum. Examples are magic squares (the sets are the rows, columns, and diagonals) and semimagic squares (the same, but without the diagonals). A magilatin labelling is like a magic labelling but the values need be distinct only within each set. We show that the number of n × n magic or magilatin labellings is a quasipolynomial function of the magic sum, and also of an upper bound on the entries in the square. Our results differ from previous ones because we require that the entries in the square all be different from each other, and because we derive our results not by ad hoc reasoning but from a general theory of counting lattice points in rational inside-out polytopes. We also generalize from set systems to rational linear forms. Dedicated to the memory of Claudia Zaslavsky, 1917–2006 Received August 10, 2005  相似文献   
44.
Scanning electron microscopy (SEM), Fourier transform infrared (FTIR) transmission, and Hall effect measurements were performed to investigate the structural, optical, and electrical properties of as-grown and in situ-annealed Hg0.7Cd0.3Te epilayers grown on CdTe buffer layers by using molecular beam epitaxy. After the Hg0.7Cd0.3Te epilayers had been annealed in a Hg-cell flux atmosphere, the SEM images showed that the surface morphologies of the Hg0.7Cd0.3Te thin films were mirror-like with no indication of pinholes or defects, and the FTIR spectra showed that the transmission intensities had increased in comparison to that of the as-grown Hg0.7Cd0.3Te epilayer. Hall-effect measurements showed that n-Hg0.7Cd0.3Te epilayers were converted to p-Hg0.7Cd0.3Te epilayers. These results indicate that the surface, optical, and electrical properties of the Hg1 − xCdxTe epilayers are improved by annealing and that as-grown n-Hg1 − xCdxTe epilayers can be converted to p-Hg1 − xCdxTe epilayers by in situ annealing.  相似文献   
45.
46.
The paper is concerned with a two-delay singular differential system with a twin parameter. Applying fixed-point index theory, we show the relationship between the asymptotic behaviors of nonlinearities (at zero and infinity) and the open regions (eigenvalue regions) of parameters, which are correlated with delays, such that the system has zero, one and two positive solution(s).  相似文献   
47.
Correlations of active galactic nuclei (AGNs) with microquasars are discussed based on the coexistence of the Blandford-Znajek (BZ) and magnetic coupling (MC) processes (CEBZMC) in black hole (BH) accretion disk.The proportions of several quantities of BH systems for both AGNs and microquasars are derived by combining the observational data with CEBZMC. It is shown that the square of the magnetic field at the BH horizon is inversely proportional to the BH mass, while the accretion rate of the disk is proportional to the BH mass. In addition, the very steep emissivity indexes from the recent XMM-Newton observations of the nearby bright Seyfert 1 galaxy MCG-6-30-15 and the microquasars XTE J1650-500 are well fitted by considering the MC effects on the disk radiation. These results suggest strongly the correlations of A GNs with microquasars.  相似文献   
48.
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.  相似文献   
49.
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.  相似文献   
50.
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.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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