全文获取类型
收费全文 | 11295篇 |
免费 | 614篇 |
国内免费 | 432篇 |
专业分类
化学 | 1375篇 |
晶体学 | 15篇 |
力学 | 3709篇 |
综合类 | 56篇 |
数学 | 3814篇 |
物理学 | 3372篇 |
出版年
2024年 | 14篇 |
2023年 | 112篇 |
2022年 | 194篇 |
2021年 | 176篇 |
2020年 | 211篇 |
2019年 | 229篇 |
2018年 | 163篇 |
2017年 | 208篇 |
2016年 | 339篇 |
2015年 | 334篇 |
2014年 | 421篇 |
2013年 | 777篇 |
2012年 | 456篇 |
2011年 | 620篇 |
2010年 | 468篇 |
2009年 | 752篇 |
2008年 | 749篇 |
2007年 | 733篇 |
2006年 | 648篇 |
2005年 | 576篇 |
2004年 | 537篇 |
2003年 | 538篇 |
2002年 | 412篇 |
2001年 | 292篇 |
2000年 | 308篇 |
1999年 | 241篇 |
1998年 | 291篇 |
1997年 | 220篇 |
1996年 | 170篇 |
1995年 | 194篇 |
1994年 | 150篇 |
1993年 | 124篇 |
1992年 | 93篇 |
1991年 | 77篇 |
1990年 | 49篇 |
1989年 | 64篇 |
1988年 | 52篇 |
1987年 | 40篇 |
1986年 | 34篇 |
1985年 | 42篇 |
1984年 | 20篇 |
1983年 | 15篇 |
1982年 | 21篇 |
1981年 | 23篇 |
1980年 | 17篇 |
1979年 | 21篇 |
1978年 | 17篇 |
1977年 | 18篇 |
1976年 | 18篇 |
1971年 | 14篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
151.
152.
基于粗糙集模糊神经网络的爆破振动危害预测 总被引:2,自引:0,他引:2
为了探索一种能克服单因素预测的局限性、提高爆破振动危害预测精度的方法,基于粗糙集模糊神经网络理论,建立了综合考虑爆破振动幅值、主频率、主频率持续时间及结构动力特性等10个因素的民房破坏程度预测模型;用铜绿山矿爆破振动和民房破坏情况观测数据,对该模型进行了训练和测试,测试结果与现场观测结果具有良好的一致性。研究表明:粗糙集理论可将现场数据进行属性约简,简化输入变量,缩小神经网络的搜索空间,改善爆破振动的预测性能;基于粗糙集模糊神经网络理论的爆破振动危害预测模型,能更好地考虑各种因素对危害程度的综合影响,避免了单因素预测的局限性。 相似文献
153.
154.
155.
We formulate binary fragmentation as a discrete stochastic process in which an integer mass k splits into two integer fragments j, , with rate proportional to the fragmentation kernel . We construct the ensemble of all distributions that can form in fixed number of steps from initial mass M and obtain their probabilities in terms of the fragmentation kernel. We obtain its partition function, the mean distribution and its evolution in time, and determine its stability using standard thermodynamic tools. We show that shattering is a phase transition that takes place when the stability conditions of the partition function are violated. We further discuss the close analogy between shattering and gelation, and between fragmentation and aggregation in general. 相似文献
156.
Vladimir V. Aristov Anatoly S. Buchelnikov Yury D. Nechipurenko 《Entropy (Basel, Switzerland)》2022,24(2)
Some problems of describing biological systems with the use of entropy as a measure of the complexity of these systems are considered. Entropy is studied both for the organism as a whole and for its parts down to the molecular level. Correlation of actions of various parts of the whole organism, intercellular interactions and control, as well as cooperativity on the microlevel lead to a more complex structure and lower statistical entropy. For a multicellular organism, entropy is much lower than entropy for the same mass of a colony of unicellular organisms. Cooperativity always reduces the entropy of the system; a simple example of ligand binding to a macromolecule carrying two reaction centers shows how entropy is consistent with the ambiguity of the result in the Bernoulli test scheme. Particular attention is paid to the qualitative and quantitative relationship between the entropy of the system and the cooperativity of ligand binding to macromolecules. A kinetic model of metabolism. corresponding to Schrödinger’s concept of the maintenance biosystems by “negentropy feeding”, is proposed. This model allows calculating the nonequilibrium local entropy and comparing it with the local equilibrium entropy inherent in non-living matter. 相似文献
157.
H. Akbar-Zadeh 《Journal of Geometry and Physics》1995,17(4):342-380
A Finslerian manifold is called a generalized Einstein manifold (GEM) if the Ricci directional curvature R(u,u) is independent of the direction. Let F0(M, gt) be a deformation of a compact n-dimensional Finslerian manifold preserving the volume of the unitary fibre bundle W(M). We prove that the critical points g0 F0(gt) of the integral I(gt) on W(M) of the Finslerian scalar curvature (and certain functions of the scalar curvature) define a GEM. We give an estimate of the eigenvalues of Laplacian Δ defined on W(M) operating on the functions coming from the base when (M, g) is of minima fibration with a constant scalar curvature H admitting a conformal infinitesimal deformation (CID). We obtain λ ≥ H/(n − 1) (Δf = λf). If M is simply connected and λ = H/(n − 1), then (M, g) is Riemannian and is isometric to an n-sphere. We first calculate, in the general case, the formula of the second variationals of the integral I (gt) for G = g0, then for a CID we show that for certain Finslerian manifolds, I″(g0) > 0. Applications to the gravitation and electromagnetism in general relativity are given. We prove that the spaces characterizing Einstein-Maxwell equations are GEMs. 相似文献
158.
提出了广义变系数模型函数系数的一种新的估计方法.我们用B样条函数逼近函数系数,不具体选择节点的个数,而是节点个数取均匀的无信息先验,样条函数系数取正态先验,用Bayesian模型平均的方法估计各个函数系数.这种估计方法一个主要特点是允许各个函数系数所需节点个数的后验分布不同,因此允许不同函数系数使用不同的光滑参数.另外,本文还给出了Bayesian B样条估计的计算方法,并通过模拟例子,说明广义变系数模型的函数系数可以由Bayesian B样条估计方法得到很好的估计. 相似文献
159.
Models based on sparse graphs are of interest to many communities: they appear as basic models in combinatorics, probability theory, optimization, statistical physics, information theory, and more applied fields of social sciences and economics. Different notions of similarity (and hence convergence) of sparse graphs are of interest in different communities. In probability theory and combinatorics, the notion of Benjamini‐Schramm convergence, also known as left‐convergence, is used quite frequently. Statistical physicists are interested in the the existence of the thermodynamic limit of free energies, which leads naturally to the notion of right‐convergence. Combinatorial optimization problems naturally lead to so‐called partition convergence, which relates to the convergence of optimal values of a variety of constraint satisfaction problems. The relationship between these different notions of similarity and convergence is, however, poorly understood. In this paper we introduce a new notion of convergence of sparse graphs, which we call Large Deviations or LD‐convergence, and which is based on the theory of large deviations. The notion is introduced by “decorating” the nodes of the graph with random uniform i.i.d. weights and constructing corresponding random measures on and . A graph sequence is defined to be converging if the corresponding sequence of random measures satisfies the Large Deviations Principle with respect to the topology of weak convergence on bounded measures on . The corresponding large deviations rate function can be interpreted as the limit object of the sparse graph sequence. In particular, we can express the limiting free energies in terms of this limit object. We then establish that LD‐convergence implies the other three notions of convergence discussed above, and at the same time establish several previously unknown relationships between the other notions of convergence. In particular, we show that partition‐convergence does not imply left‐ or right‐convergence, and that right‐convergence does not imply partition‐convergence. © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 51, 52–89, 2017 相似文献
160.
一个择一定理及对广义凸规划的应用 总被引:7,自引:1,他引:7
本文在实线性空间中得出了广义凸函数的择一定理 ,利用这一定理 ,我们获得广义凸规划的最优性条件 相似文献