首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   3050篇
  免费   276篇
  国内免费   123篇
化学   767篇
晶体学   9篇
力学   635篇
综合类   55篇
数学   1117篇
物理学   866篇
  2024年   8篇
  2023年   24篇
  2022年   89篇
  2021年   93篇
  2020年   88篇
  2019年   77篇
  2018年   67篇
  2017年   107篇
  2016年   133篇
  2015年   112篇
  2014年   139篇
  2013年   190篇
  2012年   135篇
  2011年   170篇
  2010年   144篇
  2009年   190篇
  2008年   192篇
  2007年   223篇
  2006年   157篇
  2005年   131篇
  2004年   132篇
  2003年   96篇
  2002年   94篇
  2001年   108篇
  2000年   78篇
  1999年   57篇
  1998年   75篇
  1997年   38篇
  1996年   49篇
  1995年   42篇
  1994年   28篇
  1993年   32篇
  1992年   32篇
  1991年   13篇
  1990年   17篇
  1989年   8篇
  1988年   10篇
  1987年   6篇
  1986年   11篇
  1985年   5篇
  1984年   8篇
  1982年   11篇
  1980年   3篇
  1979年   3篇
  1978年   3篇
  1976年   3篇
  1975年   2篇
  1973年   5篇
  1970年   2篇
  1969年   2篇
排序方式: 共有3449条查询结果,搜索用时 0 毫秒
1.
The semi‐analytical integration of an 8‐node plane strain finite element stiffness matrix is presented in this work. The element is assumed to be super‐parametric, having straight sides. Before carrying out the integration, the integral expressions are classified into several groups, thus avoiding duplication of calculations. Symbolic manipulation and integration is used to obtain the basic formulae to evaluate the stiffness matrix. Then, the resulting expressions are postprocessed, optimized, and simplified in order to reduce the computation time. Maple symbolic‐manipulation software was used to generate the closed expressions and to develop the corresponding Fortran code. Comparisons between semi‐analytical integration and numerical integration were made. It was demonstrated that semi‐analytical integration required less CPU time than conventional numerical integration (using Gaussian‐Legendre quadrature) to obtain the stiffness matrix. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006  相似文献   
2.
Developement of numerical methods for obtaining approximate solutions to the three dimensional diffusion equation with an integral condition will be carried out. The numerical techniques discussed are based on the fully explicit (1,7) finite difference technique and the fully implicit (7,1) finite difference method and the (7,7) Crank‐Nicolson type finite difference formula. The new developed methods are tested on a problem. Truncation error analysis and numerical examples are used to illustrate the accuracy of the new algorithms. The results of numerical testing show that the numerical methods based on the finite difference techniques discussed in the present article produce good results. © 2002 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 18: 193–202, 2002; DOI 10.1002/num.1040  相似文献   
3.
We introduce a new construction algorithm for digital nets for integration in certain weighted tensor product Hilbert spaces. The first weighted Hilbert space we consider is based on Walsh functions. Dick and Pillichshammer calculated the worst-case error for integration using digital nets for this space. Here we extend this result to a special construction method for digital nets based on polynomials over finite fields. This result allows us to find polynomials which yield a small worst-case error by computer search. We prove an upper bound on the worst-case error for digital nets obtained by such a search algorithm which shows that the convergence rate is best possible and that strong tractability holds under some condition on the weights.

We extend the results for the weighted Hilbert space based on Walsh functions to weighted Sobolev spaces. In this case we use randomly digitally shifted digital nets. The construction principle is the same as before, only the worst-case error is slightly different. Again digital nets obtained from our search algorithm yield a worst-case error achieving the optimal rate of convergence and as before strong tractability holds under some condition on the weights. These results show that such a construction of digital nets yields the until now best known results of this kind and that our construction methods are comparable to the construction methods known for lattice rules.

We conclude the article with numerical results comparing the expected worst-case error for randomly digitally shifted digital nets with those for randomly shifted lattice rules.

  相似文献   

4.
合作联盟资源集成计划一种新方法   总被引:1,自引:0,他引:1  
合作联盟里,资源集成计划往往是联盟成员群体谈判博弈的结果。本以两人博弈为例,对联盟的资源集成计划给出一个谈判博弈模型,能够较好地模仿和反映合作联盟资源整合计划的制订过程。  相似文献   
5.
混合位级正交试验设计的极差分析方法   总被引:3,自引:0,他引:3  
本文指出,在混合位级的正交试验设计中,以往的极差分析方法存在着不足。本文给出了极差的修正方法,并用大量实例做了数值验证,说明这个修正确实很有效  相似文献   
6.
Two groups of 10 speech-language pathology graduate students were each given 7 weeks of singing lessons to determine whether voice lessons could have an effect on their clinical and perceptual skills. Pre-, mid-, and posttests to measure various skills were designed and implemented. With use of paired sample statistical testing, statistically significant results were obtained. In addition, the subjective responses of the students show that the lessons were effective in improving pitch perception, breath control, and legato production or easy onset. This study supports efforts to integrate curricula in vocal performance and speech-language pathology.  相似文献   
7.
Many recent algorithmic approaches involve the construction of a differential equation model for computational purposes, typically by introducing an artificial time variable. The actual computational model involves a discretization of the now time-dependent differential system, usually employing forward Euler. The resulting dynamics of such an algorithm is then a discrete dynamics, and it is expected to be “close enough” to the dynamics of the continuous system (which is typically easier to analyze) provided that small – hence many – time steps, or iterations, are taken. Indeed, recent papers in inverse problems and image processing routinely report results requiring thousands of iterations to converge. This makes one wonder if and how the computational modeling process can be improved to better reflect the actual properties sought. In this article we elaborate on several problem instances that illustrate the above observations. Algorithms may often lend themselves to a dual interpretation, in terms of a simply discretized differential equation with artificial time and in terms of a simple optimization algorithm; such a dual interpretation can be advantageous. We show how a broader computational modeling approach may possibly lead to algorithms with improved efficiency. AMS subject classification (2000)  65L05, 65M32, 65N21, 65N22, 65D18  相似文献   
8.
Summary We study the integration theory for general integral metrics when restricted to upper integrals q, finding improvements in the relation between the classes of the q-integrable and the ql-integrable functions. We give new results and notions which lead to the desirable characterizations of q-integrable functions as ql-integrable f with q(|f|) < ∞, and of ql-integrable functions via the integrability of their upper truncations, under natural conditions which are fulfilled in most finitely additive integration theories.  相似文献   
9.
Some authors claim that reporting the best result obtained by a stochastic algorithm in a number of runs is more meaningful than reporting some central statistic. In this short note, we analyze and refute the main argument brought in favor of this statement.  相似文献   
10.
为给转炉设计提供依据,需要计算炉液倾动的重心.利用数学方法将实际问题进行简化,通过分析炉液倾动过程中变量间的相互关系,来确定每个倾动角度对应情况下的液面位置.利用数学中三重积分的有关应用,进一步得出转炉在每个倾动角度为α∈(0,π2)时的重心计算方法及相关结论,在理论上为工程计算重心的方法提供参考.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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