首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   7518篇
  免费   250篇
  国内免费   370篇
化学   1357篇
晶体学   14篇
力学   1730篇
综合类   4篇
数学   3521篇
物理学   1512篇
  2024年   15篇
  2023年   101篇
  2022年   126篇
  2021年   115篇
  2020年   188篇
  2019年   127篇
  2018年   130篇
  2017年   159篇
  2016年   184篇
  2015年   209篇
  2014年   389篇
  2013年   714篇
  2012年   313篇
  2011年   551篇
  2010年   470篇
  2009年   608篇
  2008年   518篇
  2007年   452篇
  2006年   377篇
  2005年   267篇
  2004年   280篇
  2003年   215篇
  2002年   177篇
  2001年   158篇
  2000年   127篇
  1999年   139篇
  1998年   131篇
  1997年   94篇
  1996年   82篇
  1995年   69篇
  1994年   92篇
  1993年   80篇
  1992年   73篇
  1991年   75篇
  1990年   58篇
  1989年   40篇
  1988年   34篇
  1987年   44篇
  1986年   19篇
  1985年   37篇
  1984年   38篇
  1983年   22篇
  1982年   14篇
  1981年   16篇
  1980年   1篇
  1979年   2篇
  1978年   5篇
  1977年   2篇
  1968年   1篇
排序方式: 共有8138条查询结果,搜索用时 46 毫秒
991.
This work deals with the construction of finite difference solutions of random advection Cauchy type partial differential equation containing uncertainty through the coefficient of the velocity. Under appropriate hypothesis on the velocity random variable, we establish that the constructed random finite difference solution is mean square consistent and mean square stable over the whole real line. In addition, the main statistical functions, such as the mean, of the approximate solution stochastic process generated by truncation of the exact finite difference solution are given. Finally, we apply the proposed technique to several illustrative examples which show our discussing for the mean square stability.  相似文献   
992.
Convex clustering, a convex relaxation of k-means clustering and hierarchical clustering, has drawn recent attentions since it nicely addresses the instability issue of traditional nonconvex clustering methods. Although its computational and statistical properties have been recently studied, the performance of convex clustering has not yet been investigated in the high-dimensional clustering scenario, where the data contains a large number of features and many of them carry no information about the clustering structure. In this article, we demonstrate that the performance of convex clustering could be distorted when the uninformative features are included in the clustering. To overcome it, we introduce a new clustering method, referred to as Sparse Convex Clustering, to simultaneously cluster observations and conduct feature selection. The key idea is to formulate convex clustering in a form of regularization, with an adaptive group-lasso penalty term on cluster centers. To optimally balance the trade-off between the cluster fitting and sparsity, a tuning criterion based on clustering stability is developed. Theoretically, we obtain a finite sample error bound for our estimator and further establish its variable selection consistency. The effectiveness of the proposed method is examined through a variety of numerical experiments and a real data application. Supplementary material for this article is available online.  相似文献   
993.
994.
995.
996.
997.
In this paper, we consider the stochastic heat equation of the form $$\frac{\partial u}{\partial t}=(\Delta_\alpha+\Delta_\beta)u+\frac{\partial f}{\partial x}(t,x,u)+\frac{\partial^2W}{\partial t\partial x},$$ where $1<\beta<\alpha< 2$, $W(t,x)$ is a fractional Brownian sheet, $\Delta_\theta:=-(-\Delta)^{\theta/2}$ denotes the fractional Lapalacian operator and $f:[0,T]\times \mathbb{R}\times \mathbb{R}\rightarrow\mathbb{R}$ is a nonlinear measurable function. We introduce the existence, uniqueness and H\"older regularity of the solution. As a related question, we consider also a large deviation principle associated with the above equation with a small perturbation via an equivalence relationship between Laplace principle and large deviation principle.  相似文献   
998.
This paper proves a necessary and sufficient condition for the endomorphism monoid of a lexicographic product G[H] of graphs G,H to be the wreath product of the monoids and . The paper also gives respective necessary and sufficient conditions for specialized cases such as for unretractive or triangle-free graphs G.  相似文献   
999.
We propose a new numerical method for the approximation of solutions to a non-autonomous form of the classical Gurtin-MacCamy population model with a mortality rate that is the sum of an intrinsic age-dependent rate that becomes unbounded as the age approaches its maximum value, plus a non-local, non-autonomous, bounded rate that depends on some weighted population size. We prove that our new quadrature based method converges to second-order and we show the results of several numerical simulations.  相似文献   
1000.
This paper concerns the finite element simulation of the diffraction of a time-harmonic acoustic wave in the presence of an arbitrary mean flow. Considering the equation for the perturbation of displacement (due to Galbrun), we derive a low-Mach number formulation of the problem which is proved to be of Fredholm type and is therefore well suited for discretization by classical Lagrange finite elements. Numerical experiments are done in the case of a potential flow for which an exact approach is available, and a good agreement is observed.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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