全文获取类型
收费全文 | 3556篇 |
免费 | 454篇 |
国内免费 | 159篇 |
专业分类
化学 | 542篇 |
晶体学 | 10篇 |
力学 | 758篇 |
综合类 | 113篇 |
数学 | 1527篇 |
物理学 | 1219篇 |
出版年
2024年 | 10篇 |
2023年 | 35篇 |
2022年 | 83篇 |
2021年 | 82篇 |
2020年 | 95篇 |
2019年 | 83篇 |
2018年 | 80篇 |
2017年 | 121篇 |
2016年 | 149篇 |
2015年 | 110篇 |
2014年 | 176篇 |
2013年 | 250篇 |
2012年 | 183篇 |
2011年 | 195篇 |
2010年 | 149篇 |
2009年 | 169篇 |
2008年 | 189篇 |
2007年 | 222篇 |
2006年 | 168篇 |
2005年 | 163篇 |
2004年 | 163篇 |
2003年 | 148篇 |
2002年 | 141篇 |
2001年 | 140篇 |
2000年 | 97篇 |
1999年 | 96篇 |
1998年 | 115篇 |
1997年 | 87篇 |
1996年 | 78篇 |
1995年 | 78篇 |
1994年 | 49篇 |
1993年 | 56篇 |
1992年 | 55篇 |
1991年 | 26篇 |
1990年 | 12篇 |
1989年 | 16篇 |
1988年 | 20篇 |
1987年 | 10篇 |
1986年 | 10篇 |
1985年 | 8篇 |
1984年 | 12篇 |
1983年 | 3篇 |
1982年 | 10篇 |
1980年 | 4篇 |
1979年 | 3篇 |
1976年 | 3篇 |
1975年 | 2篇 |
1973年 | 5篇 |
1970年 | 2篇 |
1969年 | 2篇 |
排序方式: 共有4169条查询结果,搜索用时 15 毫秒
241.
We propose an exact branch-and-bound algorithm for the problem of maximizing the minimum machine completion time on identical
parallel machines. The proposed algorithm is based on tight lower and upper bounds as well as an effective symmetry-breaking
branching strategy. Computational results performed on a large set of randomly generated instances attest to the efficacy
of the proposed algorithm.
相似文献
242.
S. van Veldhuizen C. Vuik C.R. Kleijn 《Numerical Methods for Partial Differential Equations》2008,24(3):1037-1054
Two‐dimensional transient simulations are presented of the transport phenomena and multispecies, multireaction chemistry in chemical vapor deposition (CVD). The transient simulations are run until steady state, such that the steady state can be validated against the steady state solutions from literature. We compare various time integration methods in terms of efficiency and robustness. Besides stability, which is important due to the stiffness of the problem, preservation of non‐negativity is crucial. It appears that this latter condition on a time integration method is much more restrictive toward the time step size than stability. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2008 相似文献
243.
B. N. Chetverushkin E. V. Shilnikov 《Computational Mathematics and Mathematical Physics》2008,48(2):295-305
A parallel software package designed for the numerical simulation of three-dimensional viscous gas flows is presented. The numerical algorithm is based on kinetically consistent difference schemes used on locally refined grids. The software package has been tested in various super-and subsonic flow problems. It provides an opportunity for the direct simulation of turbulent flows. The efficiency of parallelization is analyzed depending on the problem size and the number of processors. 相似文献
244.
In this paper, by the fixed point index theory, the number of fixed points for sublinear and asymptotically linear operators via two coupled parallel sub-super solutions is studied. Under suitable conditions, the existence of at least nine or seven distinct fixed points for sublinear and asymptotically linear operators is proved. Finally, the theoretical results are applied to a nonlinear system of Hammerstein integral equations. 相似文献
245.
求解二层规划问题的遗传算法 总被引:9,自引:0,他引:9
本文求解二层规划问题的遗传算法,给出了算法基本框架并对算法实现进行了研究.算法适用于各类线性和非线性二层规划问题.数值计算结果显示,该方法是可行和有效的. 相似文献
246.
R. I. McLachlan H. Z. Munthe-Kaas G. R. W. Quispel A. Zanna 《Foundations of Computational Mathematics》2008,8(3):335-355
We present new explicit volume-preserving methods based on splitting for polynomial divergence-free vector fields. The methods
can be divided in two classes: methods that distinguish between the diagonal part and the off-diagonal part and methods that
do not. For the methods in the first class it is possible to combine different treatments of the diagonal and off-diagonal
parts, giving rise to a number of possible combinations.
This paper is dedicated to Arieh Iserles on the occasion of his 60th anniversary. 相似文献
247.
Ramiro Rojas Nicole K. Harris Karolina Piotrowska Joachim Kohn 《Journal of polymer science. Part A, Polymer chemistry》2009,47(1):49-58
This article explores current challenges in the use of automated parallel synthesizers in polymeric materials research. Four types of polymerizations were investigated: carbodiimide‐mediated polyesterification, diphenol phosgenation, free radical, and reversible addition‐fragmentation chain‐transfer (RAFT). Synthetic challenges of condensation polymerization, such as liquid and solid dispensing accuracy, dropwise addition, and toxic chemical handling, were successfully met using the automated synthesizer. Both solid and liquid dosing of the diphenol and diacid were successful for polyarylate synthesis. The high precision of liquid dispensing made it possible to achieve stoichiometric balance using reagent stock solutions. For all reactions, molecular weights and their reproducibility were comparable to those obtained with manual synthesis. For RAFT polymerizations, solvent and mol ratio of chain transfer reagent to initiator were successfully optimized on the automated synthesizer and a library of over 60 polymethacrylate copolymer compositions was generated. Considerable savings in time relative to manual methods were achieved when generating polymer libraries (e.g., 4.5× faster for 96 polymethacrylates and 20× faster for 45 for polycarbonates). © 2008 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 47: 49–58, 2009 相似文献
248.
Richard H. Byrd Cornelius L. Dert Alexander H. G. Rinnooy Kan Robert B. Schnabel 《Mathematical Programming》1990,46(1-3):1-29
The global optimization problem, finding the lowest minimizer of a nonlinear function of several variables that has multiple local minimizers, appears well suited to concurrent computation. This paper presents a new parallel algorithm for the global optimization problem. The algorithm is a stochastic method related to the multi-level single-linkage methods of Rinnooy Kan and Timmer for sequential computers. Concurrency is achieved by partitioning the work of each of the three main parts of the algorithm, sampling, local minimization start point selection, and multiple local minimizations, among the processors. This parallelism is of a coarse grain type and is especially well suited to a local memory multiprocessing environment. The paper presents test results of a distributed implementation of this algorithm on a local area network of computer workstations. It also summarizes the theoretical properties of the algorithm.Research supported by AFOSR grant AFOSR-85-0251, ARO contract DAAG 29-84-K-0140, NSF grant DCR-8403483, and NSF cooperative agreement DCR-8420944. 相似文献
249.
Gianluca DAddese Laura Sani Luca La Rocca Roberto Serra Marco Villani 《Entropy (Basel, Switzerland)》2021,23(4)
The identification of emergent structures in complex dynamical systems is a formidable challenge. We propose a computationally efficient methodology to address such a challenge, based on modeling the state of the system as a set of random variables. Specifically, we present a sieving algorithm to navigate the huge space of all subsets of variables and compare them in terms of a simple index that can be computed without resorting to simulations. We obtain such a simple index by studying the asymptotic distribution of an information-theoretic measure of coordination among variables, when there is no coordination at all, which allows us to fairly compare subsets of variables having different cardinalities. We show that increasing the number of observations allows the identification of larger and larger subsets. As an example of relevant application, we make use of a paradigmatic case regarding the identification of groups in autocatalytic sets of reactions, a chemical situation related to the origin of life problem. 相似文献
250.