全文获取类型
收费全文 | 5068篇 |
免费 | 388篇 |
国内免费 | 448篇 |
专业分类
化学 | 476篇 |
晶体学 | 24篇 |
力学 | 88篇 |
综合类 | 41篇 |
数学 | 2381篇 |
物理学 | 614篇 |
综合类 | 2280篇 |
出版年
2024年 | 9篇 |
2023年 | 41篇 |
2022年 | 83篇 |
2021年 | 63篇 |
2020年 | 88篇 |
2019年 | 102篇 |
2018年 | 91篇 |
2017年 | 116篇 |
2016年 | 132篇 |
2015年 | 129篇 |
2014年 | 236篇 |
2013年 | 300篇 |
2012年 | 223篇 |
2011年 | 258篇 |
2010年 | 225篇 |
2009年 | 299篇 |
2008年 | 358篇 |
2007年 | 353篇 |
2006年 | 349篇 |
2005年 | 292篇 |
2004年 | 222篇 |
2003年 | 231篇 |
2002年 | 186篇 |
2001年 | 202篇 |
2000年 | 166篇 |
1999年 | 156篇 |
1998年 | 132篇 |
1997年 | 117篇 |
1996年 | 116篇 |
1995年 | 80篇 |
1994年 | 79篇 |
1993年 | 69篇 |
1992年 | 54篇 |
1991年 | 40篇 |
1990年 | 36篇 |
1989年 | 49篇 |
1988年 | 29篇 |
1987年 | 24篇 |
1986年 | 13篇 |
1985年 | 33篇 |
1984年 | 25篇 |
1983年 | 7篇 |
1982年 | 17篇 |
1981年 | 16篇 |
1980年 | 19篇 |
1979年 | 15篇 |
1978年 | 8篇 |
1977年 | 6篇 |
1976年 | 5篇 |
1936年 | 1篇 |
排序方式: 共有5904条查询结果,搜索用时 375 毫秒
1.
Dr. Kyung-Seok Kang Dr. Krishnan A. Iyer Prof. Dr. Jeffrey Pyun 《Chemistry (Weinheim an der Bergstrasse, Germany)》2022,28(35):e202200115
In this concept review, the fundamental and polymerization chemistry of inverse vulcanization for the preparation of statistical and segmented sulfur copolymers, which have been actively developed and advanced in various applications over the past decade is discussed. This concept review delves into a discussion of step-growth polymerization constructs to describe the inverse vulcanization process and discuss prepolymer approaches for the synthesis of segmented sulfur polyurethanes. Furthermore, this concept review discusses the advantages of inverse vulcanization in conjunction with dynamic covalent polymerization and post-polymerization modifications to prepare segmented block copolymers with enhanced thermomechanical and flame retardant properties of these materials. 相似文献
2.
利用VBA实现CAD和CAPP系统集成,讨论了基于Word平台进行工艺卡填写,并在此基础上进行工艺卡填写和工序图并行输出的一般问题。工艺文件的填写是在CAPP数据库的支持下,直接读取CAD所提供的CAPP工艺数据文件,经推理机推理自动生产工艺过程;工序图绘制是在特征图表级和参数化绘图原理的基础上进行的。 相似文献
3.
Space-time directional Lyapunov exponents are introduced. They describe the maximal velocity of propagation to the right or to the left of fronts of perturbations in a frame moving with a given velocity. The continuity of these exponents as function of the velocity and an inequality relating them to the directional entropy is proved. 相似文献
4.
In this paper we introduce a generalization of stable sets: stable multi-sets. A stable multi-set is an assignment of integers
to the vertices of a graph, such that specified bounds on vertices and edges are not exceeded. In case all vertex and edge
bounds equal one, stable multi-sets are equivalent to stable sets.
For the stable multi-set problem, we derive reduction rules and study the associated polytope. We state necessary and sufficient
conditions for the extreme points of the linear relaxation to be integer. These conditions generalize the conditions for the
stable set polytope. Moreover, the classes of odd cycle and clique inequalities for stable sets are generalized to stable
multi-sets and conditions for them to be facet defining are determined.
The study of stable multi-sets is initiated by optimization problems in the field of telecommunication networks. Stable multi-sets
emerge as an important substructure in the design of optical networks.
Received: February 14, 2001/Revised version: September 7, 2001 相似文献
5.
When an organization solves a portfolio problem with public projects evaluated by multiple criteria, in which the economic dimension is not essential or not well characterized, the classical methods are not useful. We propose a non-linear preference model developed from normative Value Theory and using fuzzy sets to model some sources of imprecision. This model can be considered as a generalization of the classical approaches. However, the optimization problem is very complex in order to be solved with non-linear programming techniques. Therefore, the model is exploited by an evolutionary algorithm, able to achieve a strong improvement of the quality of solution. 相似文献
6.
针对辐射源威胁评估实时性、复杂性和信息不确定性的问题,将直觉模糊集与贝叶斯网络相结合,提出一种基于IFS-BN的辐射源威胁评估方法。IFS-BN算法通过直觉模糊集刻画贝叶斯网络的节点信息,充分描述节点信息的确定性,不确定性以及犹豫度。同时,将直觉模糊集求得的各辐射源先验概率代入贝叶斯网络模型之中,得出后验概率进行威胁等级排序,并在此基础上建立了相应的评估指标体系。仿真分析表明,算法具有较好的可行性与有效性。与经典贝叶斯网络评估方法相比,IFS-BN算法的结果更加客观合理。 相似文献
7.
The exponential functional of simple, symmetric random walks with negative
drift is an infinite polynomial Y = 1 + ξ1 + ξ1ξ2 + ξ1ξ2ξ3 + ⋯ of independent
and identically distributed non-negative random variables. It has moments that are
rational functions of the variables μ
k
= E(ξ
k
) < 1 with universal coefficients. It
turns out that such a coefficient is equal to the number of permutations with descent
set defined by the multiindex of the coefficient. A recursion enumerates all numbers
of permutations with given descent sets in the form of a Pascal-type triangle.
This revised version was published online in August 2006 with corrections to the Cover Date. 相似文献
8.
This paper presents a unified analysis of decomposition algorithms for continuously differentiable optimization problems defined on Cartesian products of convex feasible sets. The decomposition algorithms are analyzed using the framework of cost approx imation algorithms. A convergence analysis is made for three decomposition algorithms: a sequential algorithm which extends the classical Gauss-Seidel scheme, a synchronized parallel algorithm which extends the Jacobi method, and a partially asynchronous parallel algorithm. The analysis validates inexact computations in both the subproblem and line search phases, and includes convergence rate results. The range of feasible step lengths within each algorithm is shown to have a direct correspondence to the increasing degree of parallelism and asynchronism, and the resulting usage of more outdated information in the algorithms. 相似文献
9.
本文得到了广义区间空间中几个参数型非空交定理,并用此结果证明了一些新型极大极小定理,截口定理,重合定理,以及变分不等式解的存在性定理。本文中的结果包含(1,3,5-12,14-16)中相应结果。 相似文献
10.
A Modified SQP Method and Its Global Convergence 总被引:6,自引:0,他引:6
Guanglu Zhou 《Journal of Global Optimization》1997,11(2):193-205
The sequential quadratic programming method developed by Wilson, Han andPowell may fail if the quadratic programming subproblems become infeasibleor if the associated sequence of search directions is unbounded. In [1], Hanand Burke give a modification to this method wherein the QP subproblem isaltered in a way which guarantees that the associated constraint region isnonempty and for which a robust convergence theory is established. In thispaper, we give a modification to the QP subproblem and provide a modifiedSQP method. Under some conditions, we prove that the algorithm eitherterminates at a Kuhn–Tucker point within finite steps or generates aninfinite sequence whose every cluster is a Kuhn–Tucker point.Finally, we give some numerical examples. 相似文献