首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1731篇
  免费   48篇
  国内免费   9篇
化学   944篇
晶体学   24篇
力学   32篇
数学   316篇
物理学   472篇
  2023年   12篇
  2022年   21篇
  2021年   21篇
  2020年   33篇
  2019年   29篇
  2018年   25篇
  2017年   12篇
  2016年   41篇
  2015年   41篇
  2014年   43篇
  2013年   78篇
  2012年   86篇
  2011年   106篇
  2010年   64篇
  2009年   42篇
  2008年   84篇
  2007年   90篇
  2006年   79篇
  2005年   81篇
  2004年   68篇
  2003年   58篇
  2002年   67篇
  2001年   15篇
  2000年   18篇
  1999年   20篇
  1998年   20篇
  1997年   17篇
  1996年   28篇
  1995年   15篇
  1994年   17篇
  1993年   20篇
  1992年   19篇
  1991年   19篇
  1990年   15篇
  1989年   14篇
  1988年   14篇
  1987年   17篇
  1986年   18篇
  1985年   16篇
  1984年   30篇
  1983年   14篇
  1982年   17篇
  1981年   23篇
  1980年   16篇
  1979年   15篇
  1978年   14篇
  1977年   23篇
  1975年   17篇
  1974年   23篇
  1973年   14篇
排序方式: 共有1788条查询结果,搜索用时 15 毫秒
61.
LetM 1 = (E, 91),M 2 = (E, 92) be two matroids over the same set of elementsE, and with families of independent sets 91, 92. A setI 91 92 is said to be anintersection of the matroidsM 1,M 2. An important problem of combinatorial optimization is that of finding an optimal intersection ofM 1,M 2. In this paper three matroid intersection algorithms are presented. One algorithm computes an intersection containing a maximum number of elements. The other two algorithms compute intersections which are of maximum total weight, for a given weighting of the elements inE. One of these algorithms is primal-dual, being based on duality considerations of linear programming, and the other is primal. All three algorithms are based on the computation of an augmenting sequence of elements, a generalization of the notion of an augmenting path from network flow theory and matching theory. The running time of each algorithm is polynomial inm, the number of elements inE, and in the running times of subroutines for independence testing inM 1,M 2. The algorithms provide constructive proofs of various important theorems of matroid theory, such as the Matroid Intersection Duality Theorem and Edmonds' Matroid Polyhedral Intersection Theorem.Research sponsored by the Air Force Office of Scientific Research Grant 71-2076.  相似文献   
62.
63.
In this paper we introduce simplified, exact, combinatorial formulas that arise in the vortex interaction model found in [33]. These combinatorial formulas allow for the efficient implementation and development of a new multi-moment vortex method (MMVM) using a Hermite expansion to simulate 2D vorticity. The method naturally allows the particles to deform and become highly anisotropic as they evolve without the added cost of computing the non-local Biot–Savart integral. We present three examples using MMVM. We first focus our attention on the implementation of a single particle, large number of Hermite moments case, in the context of quadrupole perturbations of the Lamb–Oseen vortex. At smaller perturbation values, we show the method captures the shear diffusion mechanism and the rapid relaxation (on Re1/3 time scale) to an axisymmetric state. We then present two more examples of the full multi-moment vortex method and discuss the results in the context of classic vortex methods. We perform numerical tests of convergence of the single particle method and show that at least in simple cases the method exhibits the exponential convergence typical of spectral methods. Lastly, we numerically investigate the spatial accuracy improvement from the inclusion of higher Hermite moments in the full MMVM.  相似文献   
64.
65.
66.
For a knowledge-based system that fails to provide the correct answer, it is important to be able to tune the system while minimizing overall change in the knowledge-base. There are a variety of reasons why the answer is incorrect ranging from incorrect knowledge to information vagueness to incompleteness. Still, in all these situations, it is typically the case that most of the knowledge in the system is likely to be correct as specified by the expert (s) and/or knowledge engineer (s). In this paper, we propose a method to identify the possible changes by understanding the contribution of parameters on the outputs of concern. Our approach is based on Bayesian Knowledge Bases for modeling uncertainties. We start with single parameter changes and then extend to multiple parameters. In order to identify the optimal solution that can minimize the change to the model as specified by the domain experts, we define and evaluate the sensitivity values of the results with respect to the parameters. We discuss the computational complexities of determining the solution and show that the problem of multiple parameters changes can be transformed into Linear Programming problems, and thus, efficiently solvable. Our work can also be applied towards validating the knowledge base such that the updated model can satisfy all test-cases collected from the domain experts.  相似文献   
67.
Synthesis of the title compounds by treatment of the sodium salts of 7-quinolinol, 7-hydroxycoumarin, and resorufin with alkyl halides is described.  相似文献   
68.
We compare the results of our earlier paper on the floating in neutral equilibrium at arbitrary orientation in the sense of Finn-Young with the literature on its counterpart in the sense of Archimedes. We add a few remarks of personal and social-historical character.  相似文献   
69.
We consider asymptotics of ratios of random characteristic polynomials associated with orthogonal polynomial ensembles. Under some natural conditions on the measure in the definition of the orthogonal polynomial ensemble we establish a universality limit for these ratios.  相似文献   
70.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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