首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   14032篇
  免费   336篇
  国内免费   276篇
化学   1307篇
晶体学   81篇
力学   112篇
综合类   28篇
数学   11460篇
物理学   1656篇
  2023年   35篇
  2022年   68篇
  2021年   69篇
  2020年   96篇
  2019年   369篇
  2018年   363篇
  2017年   228篇
  2016年   189篇
  2015年   182篇
  2014年   344篇
  2013年   829篇
  2012年   406篇
  2011年   771篇
  2010年   657篇
  2009年   887篇
  2008年   1041篇
  2007年   1069篇
  2006年   849篇
  2005年   560篇
  2004年   514篇
  2003年   436篇
  2002年   369篇
  2001年   270篇
  2000年   272篇
  1999年   332篇
  1998年   314篇
  1997年   217篇
  1996年   371篇
  1995年   329篇
  1994年   307篇
  1993年   261篇
  1992年   215篇
  1991年   180篇
  1990年   142篇
  1989年   142篇
  1988年   77篇
  1987年   74篇
  1986年   71篇
  1985年   111篇
  1984年   76篇
  1983年   61篇
  1982年   79篇
  1981年   70篇
  1980年   70篇
  1979年   56篇
  1978年   64篇
  1977年   51篇
  1976年   45篇
  1975年   19篇
  1973年   15篇
排序方式: 共有10000条查询结果,搜索用时 109 毫秒
71.
We study the multiplicity of critical points for functionals which are only differentiable along some directions. We extend to this class of functionals the three critical point theorem of Pucci and Serrin and we apply it to a one-parameter family of functionals Jλ, λIR. Under suitable assumptions, we locate an open subinterval of values λ in I for which Jλ possesses at least three critical points. Applications to quasilinear boundary value problems are also given.  相似文献   
72.
The Maximum Cardinality Search (MCS) algorithm visits the vertices of a graph in some order, such that at each step, an unvisited vertex that has the largest number of visited neighbours becomes visited. A maximum cardinality search ordering (MCS-ordering) of a graph is an ordering of the vertices that can be generated by the MCS algorithm. The visited degree of a vertex v in an MCS-ordering is the number of neighbours of v that are before v in the ordering. The visited degree of an MCS-ordering ψ of G is the maximum visited degree over all vertices v in ψ. The maximum visited degree over all MCS-orderings of graph G is called its maximum visited degree. Lucena [A new lower bound for tree-width using maximum cardinality search, SIAM J. Discrete Math. 16 (2003) 345-353] showed that the treewidth of a graph G is at least its maximum visited degree.We show that the maximum visited degree is of size O(logn) for planar graphs, and give examples of planar graphs G with maximum visited degree k with O(k!) vertices, for all kN. Given a graph G, it is NP-complete to determine if its maximum visited degree is at least k, for any fixed k?7. Also, this problem does not have a polynomial time approximation algorithm with constant ratio, unless P=NP. Variants of the problem are also shown to be NP-complete.In this paper, we also propose some heuristics for the problem, and report on an experimental analysis of them. Several tiebreakers for the MCS algorithm are proposed and evaluated. We also give heuristics that give upper bounds on the value of the maximum visited degree of a graph, which appear to give results close to optimal on many graphs from real life applications.  相似文献   
73.
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  相似文献   
74.
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.  相似文献   
75.
A new scheme of small compact optical frequency standard based on thermal calcium beam with application of 423 nm shelving detection and sharp-angle velocity selection detection is proposed. Combining these presented techniques, we conclude that a small compact optical frequency standard based on thermal calcium beam will outperform the commercial caesium-beam microwave dock, like the 5071 Cs clock (from Hp to Agilent, now Symmetricom company), both in accuracy and stability.  相似文献   
76.
Five polymer bonded explosives (PBXs) with the base explosive ε-CL-20 (hexanitrohexaazaisowurtzi- tane), the most important high energy density compound (HEDC), and five polymer binders (Estane 5703, GAP, HTPB, PEG, and F2314) were constructed. Molecular dynamics (MD) method was employed to investigate their binding energies (Ebind), compatibility, safety, mechanical properties, and energetic properties. The information and rules were reported for choosing better binders and guiding formula- tion design of high energy density material (HEDM). According to the calculated binding energies, the ordering of compatibility and stability of the five PBXs was predicted as ε-CL-20/PEG > ε-CL-20/ Estane5703 ≈ε-CL-20/GAP > ε-CL-20/HTPB > ε-CL-20/F2314. By pair correlation function g(r) analyses, hydrogen bonds and vdw are found to be the main interactions between the two components. The elasticity and isotropy of PBXs based ε-CL-20 can be obviously improved more than pure ε-CL-20 crystal. It is not by changing the molecular structures of ε-CL-20 for each binder to affect the sensitivity. The safety and energetic properties of these PBXs are mainly influenced by the thermal capability (C°p) and density (ρ) of binders, respectively.  相似文献   
77.
Let G be a finite group. For semi-free G-manifolds which are oriented in the sense of Waner [S. Waner, Equivariant RO(G)-graded bordism theories, Topology and its Applications 17 (1984) 1-26], the homotopy classes of G-equivariant maps into a G-sphere are described in terms of their degrees, and the degrees occurring are characterised in terms of congruences. This is first shown to be a stable problem, and then solved using methods of equivariant stable homotopy theory with respect to a semi-free G-universe.  相似文献   
78.
Let M be a compact manifold with dimM?2. We prove that some iteration of the generic homeomorphism on M is semiconjugated to the shift map and has infinite topological entropy (Theorem 1.1).  相似文献   
79.
In logistic case-control studies, Prentice and Pyke (Biometrika 66 (1979) 403-411) showed that valid point estimators of the odds-ratio parameters and their standard errors may be obtained by fitting the prospective logistic regression model to case-control data. Wang and Carroll (Biometrika 80 (1993) 237-241; J. Statist. Plann. Inference 43 (1995) 331-340) generalized Prentice and Pyke's (Biometrika 66 (1979) 403-411) results to robust logistic case-control studies. In this paper, we extend the results of Prentice and Pyke (Biometrika 66 (1979) 403-411) and Wang and Carroll (Biometrika 80 (1993) 237-241; J. Statist. Plann. Inference 43 (1995) 331-340) to a class of statistics and a class of unbiased estimating equations. We present some results on simulation and on the analysis of two real datasets.  相似文献   
80.
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.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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