首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   10054篇
  免费   741篇
  国内免费   274篇
化学   1338篇
晶体学   28篇
力学   1129篇
综合类   148篇
数学   6916篇
物理学   1510篇
  2024年   20篇
  2023年   99篇
  2022年   234篇
  2021年   331篇
  2020年   201篇
  2019年   224篇
  2018年   241篇
  2017年   329篇
  2016年   315篇
  2015年   232篇
  2014年   473篇
  2013年   605篇
  2012年   637篇
  2011年   494篇
  2010年   468篇
  2009年   584篇
  2008年   582篇
  2007年   626篇
  2006年   489篇
  2005年   433篇
  2004年   340篇
  2003年   317篇
  2002年   288篇
  2001年   273篇
  2000年   262篇
  1999年   204篇
  1998年   218篇
  1997年   204篇
  1996年   149篇
  1995年   169篇
  1994年   141篇
  1993年   118篇
  1992年   108篇
  1991年   90篇
  1990年   76篇
  1989年   62篇
  1988年   50篇
  1987年   41篇
  1986年   38篇
  1985年   53篇
  1984年   50篇
  1983年   14篇
  1982年   24篇
  1981年   21篇
  1980年   18篇
  1979年   32篇
  1978年   22篇
  1977年   30篇
  1976年   19篇
  1974年   5篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
In this paper we consider minimizers of the functionalmin{λ1(Ω)++λk(Ω)+Λ|Ω|,:ΩD open} where DRd is a bounded open set and where 0<λ1(Ω)λk(Ω) are the first k eigenvalues on Ω of an operator in divergence form with Dirichlet boundary condition and with Hölder continuous coefficients. We prove that the optimal sets Ω have finite perimeter and that their free boundary ΩD is composed of a regular part, which is locally the graph of a C1,α-regular function, and a singular part, which is empty if d<d, discrete if d=d and of Hausdorff dimension at most dd if d>d, for some d{5,6,7}.  相似文献   
2.
In this study, the combination of parameters required for optimal extraction of anti-oxidative components from the Chinese lotus (CLR) and Malaysian lotus (MLR) roots were carefully investigated. Box–Behnken design was employed to optimize the pH (X1: 2–3), extraction time (X2: 0.5–1.5 h) and solvent-to-sample ratio (X3: 20–40 mL/g) to obtain a high flavonoid yield with high % DPPHsc free radical scavenging and Ferric-reducing power assay (FRAP). The analysis of variance clearly showed the significant contribution of quadratic model for all responses. The optimal conditions for both Chinese lotus (CLR) and Malaysian lotus (MLR) roots were obtained as: CLR: X1 = 2.5; X2 = 0.5 h; X3 = 40 mL/g; MLR: X1 = 2.4; X2 = 0.5 h; X3 = 40 mL/g. These optimum conditions gave (a) Total flavonoid content (TFC) of 0.599 mg PCE/g sample and 0.549 mg PCE/g sample, respectively; (b) % DPPHsc of 48.36% and 29.11%, respectively; (c) FRAP value of 2.07 mM FeSO4 and 1.89 mM FeSO4, respectively. A close agreement between predicted and experimental values was found. The result obtained succinctly revealed that the Chinese lotus exhibited higher antioxidant and total flavonoid content when compared with the Malaysia lotus root at optimum extraction condition.  相似文献   
3.
4.
In this paper we propose a class of merit functions for variational inequality problems (VI). Through these merit functions, the variational inequality problem is cast as unconstrained minimization problem. We estimate the growth rate of these merit functions and give conditions under which the stationary points of these functions are the solutions of VI. This work was supported by the state key project “Scientific and Engineering Computing”.  相似文献   
5.
一个图的最小填充问题是寻求边数最少的弦母图,一个图的树宽问题是寻求团数最小的弦母图,这两个问题分别在稀疏矩阵计算及图的算法设计中有非常重要的作用.一个k-树G的补图G称为k-补树.本文给出了k-补树G的最小填充数f(G) 及树宽TW(G).  相似文献   
6.
Well-Posedness by Perturbations of Variational Problems   总被引:3,自引:0,他引:3  
In this paper, we consider the extension of the notion of well-posedness by perturbations, introduced by Zolezzi for optimization problems, to other related variational problems like inclusion problems and fixed-point problems. Then, we study the conditions under which there is equivalence of the well-posedness in the above sense between different problems. Relations with the so-called diagonal well-posedness are also given. Finally, an application to staircase iteration methods is presented.  相似文献   
7.
This paper presents an adaptive memory-based method for solving the Capacitated Vehicle Routing Problem (CVRP), called BoneRoute. The CVRP deals with the problem of finding the optimal sequence of deliveries conducted by a fleet of homogeneous vehicles, based at one depot, to serve a set of customers. The computational performance of the BoneRoute was found to be very efficient, producing high quality solutions over two sets of well known case studies examined.  相似文献   
8.
In this paper, we will propose algorithms for calculating a minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities. If we know all vertices of the polytope and its cardinality is not very large, we can solve the problem in an efficient manner by a number of existent algorithms. However, when the polytope is defined by linear inequalities, these algorithms may not work since the cardinality of vertices may be huge. Based on a fact that vertices determining an ellipsoid are only a fraction of these vertices, we propose algorithms which iteratively calculate an ellipsoid which covers a subset of vertices. Numerical experiment shows that these algorithms perform well for polytopes of dimension up to seven.  相似文献   
9.
We consider applications of disjunctive programming to global optimization and problems with equilibrium constraints. We propose a modification of the algorithm of F. Beaumont for disjunctive programming problems and show its numerical efficiency.  相似文献   
10.
A stochastic algorithm for finding stationary points of real-valued functions defined on a Euclidean space is analyzed. It is based on the Robbins-Monro stochastic approximation procedure. Gradient evaluations are done by means of Monte Carlo simulations. At each iteratex i , one sample point is drawn from an underlying probability space, based on which the gradient is approximated. The descent direction is against the approximation of the gradient, and the stepsize is 1/i. It is shown that, under broad conditions, w.p.1 if the sequence of iteratesx 1,x 2,...generated by the algorithm is bounded, then all of its accumulation points are stationary.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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