首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   314篇
  免费   4篇
  国内免费   1篇
化学   149篇
晶体学   1篇
力学   10篇
数学   44篇
物理学   115篇
  2022年   5篇
  2019年   2篇
  2018年   3篇
  2016年   3篇
  2014年   2篇
  2013年   11篇
  2012年   15篇
  2011年   16篇
  2010年   8篇
  2009年   4篇
  2008年   6篇
  2007年   16篇
  2006年   8篇
  2005年   11篇
  2004年   8篇
  2003年   6篇
  2002年   12篇
  2001年   5篇
  2000年   6篇
  1999年   6篇
  1998年   5篇
  1997年   3篇
  1996年   7篇
  1995年   7篇
  1994年   5篇
  1993年   17篇
  1992年   11篇
  1991年   3篇
  1990年   5篇
  1989年   6篇
  1988年   4篇
  1987年   6篇
  1985年   2篇
  1984年   3篇
  1983年   3篇
  1982年   7篇
  1981年   2篇
  1980年   8篇
  1979年   6篇
  1978年   8篇
  1977年   2篇
  1976年   12篇
  1975年   6篇
  1974年   5篇
  1973年   8篇
  1972年   3篇
  1971年   2篇
  1965年   3篇
  1958年   1篇
  1936年   1篇
排序方式: 共有319条查询结果,搜索用时 0 毫秒
61.
The Iowa Assessment Project was funded by the National Science Foundation to explore the feasibility of combining the expertise of science teachers, science educators, and test developers to build innovative performance assessments that complement traditional, norm-referenced, multiple-choice science tests. The science teachers, graduate students, and science educators designed and tested performance assessment tasks to enhance the picture of science understanding in students through multiple points of evidence. This paper describes the design of four science performance tasks for Grade 9 students and the relationship between their performance on these tasks and multiple-choice items in the Iowa Tests of Educational Development. Students and schools used to develop the tasks were not included in the verification sample.  相似文献   
62.
63.
64.
65.
Our main result shows that certain generalized convex functions on a real interval possess a unique best approximation from the family of piecewise polynomial functions of fixed degree with varying knots. This result was anticipated by Kioustelidis in [11]; however the proof given there is nonconstructive and uses topological degree as the primary tool, in a fashion similar to the proof the comparable result for the case in [5]. By contrast, the proof given here proceeds by demonstrating the global convergence of an algorithm to calculate a best approximation over the domain of all possible knot vectors. The proof uses the contraction mapping theorem to simultaneously establish convergence and uniqueness. This algorithm was suggested by Kioustelidis [10]. In addition, an asymptotic uniqueness result and a nonuniqueness result are indicated, which analogize known results in the case.

  相似文献   

66.
67.
68.
69.
Models estimating demand and need for emergency transportation services are developed. These models can provide reliable estimates which can be used for planning purposes, by complementing and/or substituting for historical data. The model estimating demand requires only four independent variables: population in the area, employment in the area, and two indicators of socioeconomic status which can be obtained from census data. The model can be used to estimate demand according to 4 operational categories and 11 clinical categories. The parameters of the model are calibrated with 1979 data from 82 ambulance services covering over 200 minor civil divisions in Southwestern Pennsylvania. This model was tested with data from another 55 minor civil divisions, also in Southwestern Pennsylvania, and it provided good estimates to total demand. The model to estimate need evolves from the demand model. It enables planners to estimate unmet need occurring in the region. The effect of emergency transportation service (ETS) provider characteristics on demand was also investigated. Statistical tests show that, for purposes of forecasting demand, when the sociodemographic factors are taken into account, provider characteristics are not significant.  相似文献   
70.
LetM 0, characterized byx k+1=G 0(x k),k?0,x 0 prescribed, be an iterative method for the solution of the operator equationF(x)=0, whereF:X → X is a given operator andX is a Banach space. Let ω:X → X be a given operator, and let the methodM mbe characterized byx x+1,m =G m(x k,m),k?0,x 0,m prescribed, where $$G_i (x) = G_0 (x) - \sum\limits_{j = 0}^{i - 1} { F'(\omega (x))^{ - 1} F(G_j (x)), i = 1, . . . ,m,} $$ in whichG 0:X → X is a given operator andF′:X → L(X) is the Fréchet derivative ofF. Sufficient conditions for the existence of a solutionx* m ofF(x)=0 to which the sequence (x k,m) generated from methodM mconverges are given, together with a rate-of-convergence estimate.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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