首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   14821篇
  免费   407篇
  国内免费   51篇
化学   11693篇
晶体学   90篇
力学   227篇
数学   1845篇
物理学   1424篇
  2023年   112篇
  2022年   511篇
  2021年   569篇
  2020年   320篇
  2019年   362篇
  2018年   289篇
  2017年   245篇
  2016年   490篇
  2015年   475篇
  2014年   462篇
  2013年   905篇
  2012年   956篇
  2011年   1089篇
  2010年   661篇
  2009年   640篇
  2008年   903篇
  2007年   873篇
  2006年   732篇
  2005年   683篇
  2004年   588篇
  2003年   493篇
  2002年   473篇
  2001年   190篇
  2000年   151篇
  1999年   120篇
  1998年   132篇
  1997年   116篇
  1996年   136篇
  1995年   98篇
  1994年   93篇
  1993年   84篇
  1992年   65篇
  1991年   79篇
  1990年   62篇
  1989年   78篇
  1988年   64篇
  1987年   53篇
  1986年   58篇
  1985年   70篇
  1984年   87篇
  1983年   48篇
  1982年   70篇
  1981年   60篇
  1980年   61篇
  1979年   50篇
  1978年   58篇
  1977年   40篇
  1976年   33篇
  1975年   29篇
  1963年   20篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
This article presents the scores teachers assigned to samples of actual students' problem-solving work and the rationales teachers provided for these scores. These rationales may reflect teachers' values relative to aspects of mathematical problem solving. It may be that when teachers can express rationales for scoring students' work, they are able to justify their evaluation of what students can “know and do” in mathematics.  相似文献   
992.
A new bargaining set based on notions of both internal and external stability is developed in the context of endogenous coalition formation. It allows one to make an explicit distinction between within-group and outside-group deviation options. This type of distinction is not present in current bargaining sets. For the class of monotonic proper simple games, the outcomes in the bargaining set are characterized. Furthermore, it is shown that the bargaining set of any homogeneous weighted majority game contains an outcome for which the underlying coalition structure consists of a minimal winning coalition and its complement.  相似文献   
993.
Using results obtained from a study of homogeneous ideals sharing the same initial ideal with respect to some term order, we prove the singularity of the point corresponding to a segment ideal with respect to a degreverse term order (as, for example, the degrevlex order) in the Hilbert scheme of points in Pn. In this context, we look into the properties of several types of “segment” ideals that we define and compare. This study also leads us to focus on the connections between the shape of generators of Borel ideals and the related Hilbert polynomial, thus providing an algorithm for computing all saturated Borel ideals with a given Hilbert polynomial.  相似文献   
994.
We study the efficiency of the greedy algorithm for wavelet bases in Lorentz spaces in order to give the near best approximation. The result is used to give sharp inclusions for the approximation spaces in terms of discrete Lorentz sequence spaces.  相似文献   
995.
We characterize normal and extremally disconnected biframes in terms of the insertion of a continuous real function in between given lower and upper semicontinuous real functions and show this to be the common root of several classical and new insertion results concerning topological spaces, bitopological spaces, ordered topological spaces and locales.  相似文献   
996.
997.
We study an integro-differential parabolic problem modeling a process with jumps arising in financial mathematics. Under suitable conditions, we prove the existence of weak solutions to a more general integro-differential equation by using the Schaefer’s fixed point theorem and generalize the result to unbounded domains.  相似文献   
998.
Optimal power flow problems arise in the context of the optimization and secure exploitation of electrical power in alternating current (AC) networks. This optimization problem evaluates the flow on each line and to ensure that they are under line thermal limits. To improve the reliability of the power supply, a secure network is necessary, i.e., it has to be able to cope with some contingencies. Nowadays high performance solution methods, that are based on nonlinear programming algorithms, search for an optimal state while considering certain contingencies. According to the number of contingencies the problem size increases linearly. As the base case can already be large-scaled, the optimization time computation increases quickly. Parallelization seems to be a good way to solve quickly this kind of problem. This paper considers the minimization of an objective function and at least two constraints at each node. This optimization problem is solved by IPOPT, an interior point method, coupled with ADOL-C, an algorithmic differentiation tool, and MA27, a linear solver. Several results on employed parallelizing strategies will be discussed. (© 2011 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)  相似文献   
999.
Riassunto Si dà una costruzione di un insieme minimale di generatori omogenei per l'ideale di una curva monomiale proiettiva e una limitazione per il grado delle equazioni che la definiscono.
Summary A construction of a minimal system of homogeneous generators for the ideal of a monomial projective curve and a degree bound for its defining equations are given.
  相似文献   
1000.
Journal of Optimization Theory and Applications - We consider a control problem in a finite-dimensional setting, which consists in finding a minimizer for a standard functional defined by way of...  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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