首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   370128篇
  免费   3318篇
  国内免费   1695篇
化学   168377篇
晶体学   4928篇
力学   20512篇
综合类   61篇
数学   73812篇
物理学   107451篇
  2019年   1914篇
  2018年   18776篇
  2017年   19330篇
  2016年   12099篇
  2015年   3880篇
  2014年   3912篇
  2013年   9290篇
  2012年   14337篇
  2011年   28466篇
  2010年   17359篇
  2009年   17632篇
  2008年   23404篇
  2007年   28232篇
  2006年   8746篇
  2005年   14848篇
  2004年   11264篇
  2003年   10859篇
  2002年   8126篇
  2001年   7061篇
  2000年   5608篇
  1999年   3836篇
  1998年   3257篇
  1997年   3154篇
  1996年   3315篇
  1995年   2811篇
  1994年   2864篇
  1993年   2732篇
  1992年   2932篇
  1991年   3012篇
  1990年   2811篇
  1989年   2736篇
  1988年   2693篇
  1987年   2628篇
  1986年   2639篇
  1985年   3424篇
  1984年   3494篇
  1983年   2932篇
  1982年   3171篇
  1981年   2932篇
  1980年   2734篇
  1979年   2925篇
  1978年   3138篇
  1977年   3080篇
  1976年   3133篇
  1975年   2858篇
  1974年   2963篇
  1973年   3061篇
  1972年   2371篇
  1971年   1878篇
  1968年   1770篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
Theorems 2 and 3 establish the minimum algebraic conditions necessary for a field to be algebraically closed, and they can therefore be said to “optimize” the Fundamental Theorem of Algebra. But each specific“degree implication” is a first-order consequence of the axioms for fields, and could have been discovered two centuries ago; the existence of these finitary relationships appears to have been unsuspected by practically everyone, with one important exception.  相似文献   
992.
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.  相似文献   
993.
Digital holographic shape measurements using femtosecond laser pulses are reported. For contouring of very fast moving objects, the simultaneous generation of at least two spectrally separated ultrashort pulses is required. To deliver this particular spectral signature at high pulse energies, a chirped-pulse Ti:sapphire laser amplifier was modified to emit two spectrally separated pulses with energies above 1 μJ each. The wavelength separation of these pulses was adjustable within the 50 nm gain bandwidth, cutting out two distinct wavelength peaks by a variable double-slit assembly in a prism sequence. A Michelson-type interferometer was employed to perform the two-wavelength contouring. The phases of the holograms and the phase differences are calculated numerically, which allow us to deduce the contour lines of the topology of the object. The suitability of the light source for digital holography is demonstrated with contouring of stationary objects and the potential for high-speed applications is indicated. PACS 42.40.-i; 42.60.By  相似文献   
994.
The life course of the physicist and biologist George Feher may be seen as an epitome of science of the second half of the 20th century and the beginning of the 21st century. Feher, a native of Slovakia, barely escaped Nazism and communism and became a scientist in the USA. The Nazi concentration camps and the communist gulags have become a symbol of the 20th century. This symbol stands here to pose a question: How the two totalitarian systems, fraught with irrationality, may have arisen and thrived in parallel with an unprecedented expansion of science, the paragon of rationalism? The question has become even more urgent in the 21st century. The Ground Zero, an empty spot left after the collapse of the twin towers of the World Trade Center on 11 September 2001, has become the symbol of the entrance of humankind into the new millennium. We can do much, but we understand too little about who we are and what we are doing — this is a message that the two symbols convey about the precarious stage of our evolution. The second message concerns the role of artifacts, specifically scientific instruments, in the advancement of science. Human cultural evolution has been steadily progressing, in a form of a ratchet, only because artifacts have been continually evolving. Contrary to the common Popperian wisdom, the demarcation in science may not consist in the amenability to theoretical falsification, but rather in the amenability to instrumental grasping. Scientific instruments have empowered humans for impressive feats of manipulation with Nature and themselves. Knowledge arising in the course of autonomous evolution of artifacts may surpass the horizon of human understanding and grasping. New knowledge may still be power, but no longer the power of humans. We may need a revision of some fundamental ideas of European thought. Our understanding of the human mind may entirely reshape our comprehension of the nature of physical knowledge, and vice versa.  相似文献   
995.
In this paper,we use Daubechies scaling functions as test functions for the Galerkin method,and discuss Wavelet-Galerkin solutions for the Hamilton-Jacobi equations.It can be proved that the schemesare TVD schemes.Numerical tests indicate that the schemes are suitable for the Hamilton-Jacobi equations.Furthermore,they have high-order accuracy in smooth regions and good resolution of singularities.  相似文献   
996.
Sergey Alekseevich Khristianovich is one of the famous Russian mechanical engineers of the 20th century together with N.E. Zhukovsky, S.A. Chaplygin, N.E. Kochin, and others. He made an immense contribution to some aspects of mechanics, such as aerogasdynamics, rock mechanics, theory of plasticity, filtration theory, and environmental power engineering. All this was preceded by a long, hard, and fruitful life full of outstanding events.  相似文献   
997.
The problem of joint a posteriori detection of reference fragments in a quasi-periodic sequence and its partition into segments containing series of recurring fragments from the reference tuple is solved. It is assumed that (i) an ordered reference tuple of sequences to be detected is given, (ii) the number of desired fragments is known, (iii) the index of the sequence term corresponding to the beginning of a fragment is a deterministic (not random) value, and (iv) a sequence distorted by an additive uncorrelated Gaussian noise is available for observation. It is established that the problem consists in testing a set of hypotheses about the mean of a random Gaussian vector. The cardinality of the set grows exponentially as the vector dimension (i.e., the sequence length) increases. An efficient a posteriori algorithm producing a maximum-likelihood optimal solution to the problem is substantiated. Time and space complexity bounds related to the parameters of the problem are derived. The results of numerical simulation are presented.  相似文献   
998.
999.
The not-sufficient-enough conductance of semioxidized protonated polyaniline (PANI) is usually attributed to the presence of ordered quasi-metallic domains surrounded by a poorly conducting amorphous phase. The paper presents experimental results testifying to the existence, in semioxidized PANI, of multilevel redox heterogeneity that crucially effects the conductance magnitude in view of specific topology at which higher-oxidized (conducting) domains are surrounded by less oxidized (poorly conducting) domains and because the PANI conduction is extremely sensitive to the oxidation degree. It is shown experimentally that the interphase doping with metals and degenerate semiconductors of a semioxidized salt of PANI and poly(2-acrylamide-2-methyl-1-propanesulfonic acid) (PAMPSA) with a 1: 2 ratio between PANI and PAMPSA raises the PANI-PAMPSA conductivity by 3–8 orders of magnitude due to the formation near the interface of thin layers whose conductance depends on the work function of the material in contact with PANI-PAMPSA and in extreme cases substantially exceeds the conductance of gold and copper at room temperature.  相似文献   
1000.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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