首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   5400篇
  免费   244篇
  国内免费   127篇
化学   367篇
晶体学   18篇
力学   828篇
综合类   33篇
数学   3204篇
物理学   1321篇
  2023年   52篇
  2022年   64篇
  2021年   88篇
  2020年   77篇
  2019年   65篇
  2018年   65篇
  2017年   76篇
  2016年   121篇
  2015年   117篇
  2014年   218篇
  2013年   343篇
  2012年   212篇
  2011年   310篇
  2010年   278篇
  2009年   405篇
  2008年   454篇
  2007年   438篇
  2006年   305篇
  2005年   230篇
  2004年   202篇
  2003年   194篇
  2002年   161篇
  2001年   134篇
  2000年   119篇
  1999年   135篇
  1998年   142篇
  1997年   92篇
  1996年   93篇
  1995年   56篇
  1994年   70篇
  1993年   65篇
  1992年   48篇
  1991年   43篇
  1990年   29篇
  1989年   26篇
  1988年   36篇
  1987年   20篇
  1986年   20篇
  1985年   31篇
  1984年   32篇
  1983年   14篇
  1982年   16篇
  1981年   14篇
  1980年   11篇
  1979年   9篇
  1978年   10篇
  1977年   8篇
  1976年   6篇
  1975年   4篇
  1973年   3篇
排序方式: 共有5771条查询结果,搜索用时 15 毫秒
31.
宋丽叶 《应用数学》2006,19(1):159-168
本文针对一类非饱和土壤水流问题,提出了基于二次插值的特征差分格式,得到了严谨的L2模误差估计.并作了数值试验,指明方法的有效性.  相似文献   
32.
The efficiency of parallel implementations of the branch-and-bound method in discrete optimization problems is considered. A theoretical analysis and comparison of two parallel implementations of this method is performed. A mathematical model of the computation process is constructed and used to obtain estimates of the maximum possible speedup. Examples of problems in which none of these two parallel implementations can speed up the computations are considered.  相似文献   
33.
A one-dimensional nanodusty plasma was modeled by self-consistently coupling a plasma model with nanoparticle growth, charging, and transport models. As nanoparticles grow from subnanometer to tens of nm in diameter, the numerical results predict a rich spatiotemporal structure, including four distinct temporal phases: a charge-limited phase, a charge accumulation phase, an early ion drag phase, and a sheath interaction phase.  相似文献   
34.
现代优化计算方法在蛋白质结构预测中的应用   总被引:2,自引:1,他引:1  
现代优化计算方法在蛋白质结构预测中占有重要地位.简要地介绍了模拟退火算法,遗传算法,人工神经网络和图论算法在蛋白质结构预测中的应用.对国内外近年来应用这些算法,特别是在蛋白质构象搜索问题中,解决蛋白质结构预测的研究作了回顾,并分析、比较了这几种算法的效果和特点.  相似文献   
35.
We consider the problem of guillotine cutting a rectangular sheet into two rectangular pieces without rotations. The question is whether there exists a cutting pattern with given numbers of occurrences of both rectangular pieces. A polynomial time algorithm is described to construct the convex hull of solutions to this problem.  相似文献   
36.
In this paper the algorithms for solving the p-median problem based on the Benders decomposition are investigated. A family of problems hard for solving with such algorithms is constructed and then generalized to a special NP-hard case of the p-median problem. It is shown that the effectiveness of the considered algorithms depends on the choice of the optimal values of the dual variables used in Benders cuts. In particular, the depth of the cuts can be equal to one.  相似文献   
37.
38.
A rigorous and systematic intercomparison of codes used for the retrieval of trace gas profiles from high-resolution ground-based solar absorption FTIR measurements is presented for the first time. Spectra were analyzed with the two widely used independent, retrieval codes: SFIT2 and PROFFIT9. Vertical profiles of O3, HNO3, HDO, and N2O were derived from the same set of typical observed spectra. Analysis of O3 was improved by using updated line parameters. It is shown that profiles and total column amounts are in excellent agreement, when similar constraints are applied, and that the resolution kernel matrices are also consistent. Owing to the limited altitude resolution of ground-based observations, the impact of the constraints on the solution is not negligible. It is shown that the results are also compatible for independently chosen constraints. Perspectives for refined constraints are discussed. It can be concluded that the error budget introduced by the radiative transfer code and the retrieval algorithm on total columns deduced from high-resolution ground-based solar FTIR spectra is below 1%.  相似文献   
39.
We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful measure for optimization problems where the random assignment algorithm is known to give essentially the best possible polynomial time approximation. In this paper, we focus on this measure for the optimization problems Max‐Lin‐2 in which we need to maximize the number of satisfied linear equations in a system of linear equations modulo 2, and Max‐k‐Lin‐2, a special case of the above problem in which each equation has at most k variables. The main techniques we use, in our approximation algorithms and inapproximability results for this measure, are from Fourier analysis and derandomization. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2004  相似文献   
40.
Based on the investigation carried out in Ref. 1, this paper incorporates new studies about the properties of inclusion functions on subintervals while a branch-and-bound algorithm is solving global optimization problems. It is found that the relative place of the global minimum value within the inclusion function value of the objective function at the current interval indicates mostly whether the given interval is close to a minimizer point. This information is used in a heuristic interval rejection rule that can save a considerable amount of computation. Illustrative examples are discussed and an extended numerical study shows the advantages of the new approach.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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