首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   6784篇
  免费   866篇
  国内免费   393篇
化学   306篇
晶体学   8篇
力学   601篇
综合类   49篇
数学   974篇
物理学   2361篇
综合类   3744篇
  2024年   14篇
  2023年   47篇
  2022年   107篇
  2021年   128篇
  2020年   103篇
  2019年   110篇
  2018年   112篇
  2017年   141篇
  2016年   177篇
  2015年   195篇
  2014年   367篇
  2013年   408篇
  2012年   416篇
  2011年   503篇
  2010年   398篇
  2009年   433篇
  2008年   465篇
  2007年   556篇
  2006年   416篇
  2005年   395篇
  2004年   353篇
  2003年   291篇
  2002年   308篇
  2001年   251篇
  2000年   218篇
  1999年   184篇
  1998年   164篇
  1997年   114篇
  1996年   136篇
  1995年   85篇
  1994年   63篇
  1993年   70篇
  1992年   58篇
  1991年   44篇
  1990年   45篇
  1989年   25篇
  1988年   34篇
  1987年   20篇
  1986年   10篇
  1985年   10篇
  1984年   8篇
  1983年   5篇
  1982年   17篇
  1981年   3篇
  1980年   5篇
  1978年   4篇
  1976年   4篇
  1975年   3篇
  1973年   7篇
  1970年   3篇
排序方式: 共有8043条查询结果,搜索用时 10 毫秒
1.
图书馆数字资源整合浅谈   总被引:5,自引:1,他引:4  
介绍了图书馆数字化资源的主要类型和资源整合的目标,针对数字资源的特点,提出了图书馆数字资源整合的必要性,并论述了推进数字资源整合的措施。  相似文献   
2.
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  相似文献   
3.
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  相似文献   
4.
从高职院校的培养目标出发,指出信息技术与高职数学课程整合的目标,分析信息技术环境下高职数学课程的特征,介绍信息技术与高职数学课程整合的策略,阐述信息技术与高职数学课程整合的一些途径。  相似文献   
5.
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.

  相似文献   

6.
合作联盟资源集成计划一种新方法   总被引:1,自引:0,他引:1  
合作联盟里,资源集成计划往往是联盟成员群体谈判博弈的结果。本以两人博弈为例,对联盟的资源集成计划给出一个谈判博弈模型,能够较好地模仿和反映合作联盟资源整合计划的制订过程。  相似文献   
7.
We apply the Krylov and Bogolyubov asymptotic integration procedure to asymptotically autonomous systems. First, we consider linear systems with quasi-periodic coefficient matrix multiplied by a scalar factor vanishing at infinity. Next, we study the asymptotically autonomous Van-der-Pol oscillator.

  相似文献   

8.
Cyclic Hypomonotonicity,Cyclic Submonotonicity,and Integration   总被引:9,自引:1,他引:8  
Rockafellar has shown that the subdifferentials of convex functions are always cyclically monotone operators. Moreover, maximal cyclically monotone operators are necessarily operators of this type, since one can construct explicitly a convex function, which turns out to be unique up to a constant, whose subdifferential gives back the operator. This result is a cornerstone in convex analysis and relates tightly convexity and monotonicity. In this paper, we establish analogous robust results that relate weak convexity notions to corresponding notions of weak monotonicity, provided one deals with locally Lipschitz functions and locally bounded operators. In particular, the subdifferentials of locally Lipschitz functions that are directionally hypomonotone [respectively, directionally submonotone] enjoy also an additional cyclic strengthening of this notion and in fact are maximal under this new property. Moreover, every maximal cyclically hypomonotone [respectively, maximal cyclically submonotone] operator is always the Clarke subdifferential of some directionally weakly convex [respectively, directionally approximately convex] locally Lipschitz function, unique up to a constant, which in finite dimentions is a lower C2 function [respectively, a lower C1 function].  相似文献   
9.
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.  相似文献   
10.
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  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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