首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1474篇
  免费   92篇
  国内免费   12篇
化学   1111篇
晶体学   12篇
力学   31篇
数学   154篇
物理学   270篇
  2024年   3篇
  2023年   5篇
  2022年   27篇
  2021年   51篇
  2020年   31篇
  2019年   31篇
  2018年   24篇
  2017年   29篇
  2016年   59篇
  2015年   54篇
  2014年   90篇
  2013年   109篇
  2012年   141篇
  2011年   126篇
  2010年   94篇
  2009年   78篇
  2008年   86篇
  2007年   83篇
  2006年   77篇
  2005年   63篇
  2004年   57篇
  2003年   48篇
  2002年   40篇
  2001年   32篇
  2000年   24篇
  1999年   16篇
  1998年   13篇
  1997年   9篇
  1996年   17篇
  1995年   9篇
  1994年   7篇
  1993年   5篇
  1992年   4篇
  1991年   5篇
  1990年   4篇
  1989年   4篇
  1988年   5篇
  1987年   3篇
  1986年   1篇
  1985年   1篇
  1984年   3篇
  1983年   1篇
  1982年   1篇
  1978年   2篇
  1977年   2篇
  1976年   1篇
  1975年   1篇
  1971年   1篇
  1967年   1篇
排序方式: 共有1578条查询结果,搜索用时 15 毫秒
101.
In this paper we study some properties of a totally *-paranormal operator (defined below) on Hilbert space. In particular, we characterize a totally *-paranormal operator. Also we show that Weyl’s theorem and the spectral mapping theorem hold for totally *-paranormal operators through the local spectral theory. Finally, we show that every totally *-paranormal operator satisfies an analogue of the single valued extension property for W 2(D, H) and some of totally *-paranormal operators have scalar extensions.  相似文献   
102.
Although they are simple techniques from the early days of timetabling research, graph colouring heuristics are still attracting significant research interest in the timetabling research community. These heuristics involve simple ordering strategies to first select and colour those vertices that are most likely to cause trouble if deferred until later. Most of this work used a single heuristic to measure the difficulty of a vertex. Relatively less attention has been paid to select an appropriate colour for the selected vertex. Some recent work has demonstrated the superiority of combining a number of different heuristics for vertex and colour selection. In this paper, we explore this direction and introduce a new strategy of using linear combinations of heuristics for weighted graphs which model the timetabling problems under consideration. The weights of the heuristic combinations define specific roles that each simple heuristic contributes to the process of ordering vertices. We include specific explanations for the design of our strategy and present the experimental results on a set of benchmark real world examination timetabling problem instances. New best results for several instances have been obtained using this method when compared with other constructive methods applied to this benchmark dataset.  相似文献   
103.

Let the mod 2 Steenrod algebra, , and the general linear group, , act on with in the usual manner. We prove the conjecture of the first-named author in Spherical classes and the algebraic transfer, (Trans. Amer. Math Soc. 349 (1997), 3893-3910) stating that every element of positive degree in the Dickson algebra is -decomposable in for arbitrary 2$">. This conjecture was shown to be equivalent to a weak algebraic version of the classical conjecture on spherical classes, which states that the only spherical classes in are the elements of Hopf invariant one and those of Kervaire invariant one.

  相似文献   

104.
This study investigates students' retention of mathematical knowledge and skills in two differential equations classes. Posttests and delayed posttests after 1 year were administered to students in inquiry‐oriented and traditional classes. The results show that students in the inquiry‐oriented class retained conceptual knowledge, as seen by their performance on modeling problems, and retained equal proficiency in procedural problems, when compared with students in the traditionally taught classes. The results of this study add additional support to the claim that teaching for conceptual understanding can lead to longer retention of mathematical knowledge.  相似文献   
105.
106.
This paper is devoted to the development of variational analysis and generalized differentiation in the framework of Asplund spaces. We mainly concern the study of a special class of set-valued mapping given in the form
where both F and Q are set-valued mappings between Asplund spaces. Models of this type are associated with solutions maps to the so-called (extended) generalized equations and play a significant role in many aspects of variational analysis and its applications to optimization, stability, control theory, etc. In this paper we conduct a local variational analysis of such extended solution maps S and their remarkable specifications based on dual-space generalized differential constructions of the coderivative type. The major part of our analysis revolves around coderivative calculus largely developed and implemented in this paper and then applied to establishing verifiable conditions for robust Lipschitzian stability of extended generalized equations and related objects.  相似文献   
107.
Meisters and Peterson gave an equivalent condition under which the multisensor deconvolution problem has a solution when there are two convolvers, each the characteristic function of an interval. In this article we find additional conditions under which the deconvolution problem for multiple characteristic functions is solvable. We extend the result to the space of Gevrey distributions and prove that every linear operator S, fromthe space of Gevrey functions with compact support onto itself, which commutes with translations can be represented as convolution with a unique Gevrey distribution T of compact support. Finally, we find explicit formula for deconvolvers when the convolvers satisfy weaker conditions than the equivalence conditions using nonperiodic sampling method.  相似文献   
108.
In this paper,we are interested in HSS preconditioners for saddle point lin- ear systems with a nonzero(2,2)-th block.We study an approximation of the spectra of HSS preconditioned matrices and use these results to illustrate and explain the spectra obtained from numerical examples,where the previous spectral analysis of HSS precon- ditioned matrices does not cover.  相似文献   
109.
We investigate the compatibility of \(I_0\) with various combinatorial principles at \(\lambda ^+\), which include the existence of \(\lambda ^+\)-Aronszajn trees, square principles at \(\lambda \), the existence of good scales at \(\lambda \), stationary reflections for subsets of \(\lambda ^{+}\), diamond principles at \(\lambda \) and the singular cardinal hypothesis at \(\lambda \). We also discuss whether these principles can hold in \(L(V_{\lambda +1})\).  相似文献   
110.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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