全文获取类型
收费全文 | 6690篇 |
免费 | 439篇 |
国内免费 | 489篇 |
专业分类
化学 | 218篇 |
晶体学 | 3篇 |
力学 | 276篇 |
综合类 | 79篇 |
数学 | 3120篇 |
物理学 | 830篇 |
综合类 | 3092篇 |
出版年
2024年 | 12篇 |
2023年 | 50篇 |
2022年 | 65篇 |
2021年 | 88篇 |
2020年 | 121篇 |
2019年 | 107篇 |
2018年 | 125篇 |
2017年 | 140篇 |
2016年 | 160篇 |
2015年 | 131篇 |
2014年 | 291篇 |
2013年 | 389篇 |
2012年 | 326篇 |
2011年 | 364篇 |
2010年 | 343篇 |
2009年 | 331篇 |
2008年 | 396篇 |
2007年 | 450篇 |
2006年 | 423篇 |
2005年 | 406篇 |
2004年 | 301篇 |
2003年 | 317篇 |
2002年 | 316篇 |
2001年 | 263篇 |
2000年 | 216篇 |
1999年 | 225篇 |
1998年 | 220篇 |
1997年 | 172篇 |
1996年 | 149篇 |
1995年 | 95篇 |
1994年 | 101篇 |
1993年 | 78篇 |
1992年 | 67篇 |
1991年 | 53篇 |
1990年 | 65篇 |
1989年 | 56篇 |
1988年 | 46篇 |
1987年 | 34篇 |
1986年 | 25篇 |
1985年 | 23篇 |
1984年 | 16篇 |
1983年 | 3篇 |
1982年 | 12篇 |
1981年 | 10篇 |
1980年 | 8篇 |
1979年 | 6篇 |
1978年 | 8篇 |
1977年 | 3篇 |
1976年 | 4篇 |
1973年 | 3篇 |
排序方式: 共有7618条查询结果,搜索用时 234 毫秒
1.
为了寻找团簇Co3FeP的稳定性、结构和内部作用力等规律,利用密度泛函理论,在B3LYP/Lanl2dz的量化水平下对团簇Co3FeP进行理论计算,得到5种优化构型,并从化学反应热力学与动力学的角度对其异构化反应中的反应物、过渡态和生成物进行了讨论分析。结果表明,所有构型均为C1对称且构型的空间结构对其熵值有影响;构型的稳定性主要由金属原子与非金属原子所决定,并且在常温常压下构型1(3)、2(3)和3(3)可以稳定存在,是大部分异构化反应的最终产物。因此,在实际材料的开发中,不仅需要注意金属原子与非金属原子之间的作用力以确保构型的稳定性,还应首先考虑对稳定构型1(3)、2(3)和3(3)进行相关研究。 相似文献
2.
The growth-fragmentation equation describes a system of growing and dividing particles, and arises in models of cell division, protein polymerisation and even telecommunications protocols. Several important questions about the equation concern the asymptotic behaviour of solutions at large times: at what rate do they converge to zero or infinity, and what does the asymptotic profile of the solutions look like? Does the rescaled solution converge to its asymptotic profile at an exponential speed? These questions have traditionally been studied using analytic techniques such as entropy methods or splitting of operators. In this work, we present a probabilistic approach: we use a Feynman–Kac formula to relate the solution of the growth-fragmentation equation to the semigroup of a Markov process, and characterise the rate of decay or growth in terms of this process. We then identify the Malthus exponent and the asymptotic profile in terms of a related Markov process, and give a spectral interpretation in terms of the growth-fragmentation operator and its dual. 相似文献
3.
Erosion and sediments transport processes have a great impact on industrial structures and on water quality. Despite its limitations, the Saint‐Venant‐Exner system is still (and for sure for some years) widely used in industrial codes to model the bedload sediment transport. In practice, its numerical resolution is mostly handled by a splitting technique that allows a weak coupling between hydraulic and morphodynamic distinct softwares but may suffer from important stability issues. In recent works, many authors proposed alternative methods based on a strong coupling that cure this problem but are not so trivial to implement in an industrial context. In this work, we then pursue 2 objectives. First, we propose a very simple scheme based on an approximate Riemann solver, respecting the strong coupling framework, and we demonstrate its stability and accuracy through a number of numerical test cases. However, second, we reinterpret our scheme as a splitting technique and we extend the purpose to propose what should be the minimal coupling that ensures the stability of the global numerical process in industrial codes, at least, when dealing with collocated finite volume method. The resulting splitting method is, up to our knowledge, the only one for which stability properties are fully demonstrated. 相似文献
4.
The satisfiability (SAT) problem is a core problem in computer science. Existing studies have shown that most industrial SAT instances can be effectively solved by modern SAT solvers while random SAT instances cannot. It is believed that the structural characteristics of different SAT formula classes are the reasons behind this difference. In this paper, we study the structural properties of propositional formulas in conjunctive normal form (CNF) by the principle of structural entropy of formulas. First, we used structural entropy to measure the complex structure of a formula and found that the difficulty solving the formula is related to the structural entropy of the formula. The smaller the compressing information of a formula, the more difficult it is to solve the formula. Secondly, we proposed a -approximation strategy to approximate the structural entropy of large formulas. The experimental results showed that the proposed strategy can effectively approximate the structural entropy of the original formula and that the approximation ratio is more than 92%. Finally, we analyzed the structural properties of a formula in the solution process and found that a local search solver tends to select variables in different communities to perform the next round of searches during a search and that the structural entropy of a variable affects the probability of the variable being flipped. By using these conclusions, we also proposed an initial candidate solution generation strategy for a local search for SAT, and the experimental results showed that this strategy effectively improves the performance of the solvers CCAsat and Sparrow2011 when incorporated into these two solvers. 相似文献
5.
6.
针对单个安排事务避免冲突的传统方法 ,提出一种基于浸润原理的事物安排算法。该算法采用漫布式将各个事务分摊到各个位置 ,根据条件计算权值 ,并有意造成冲突 ,从而发现冲突位置 ,最后从最不可能冲突的位置入手 ,逐步完成安排过程。该方法事务安排的复杂度为 O(n2× k× x) ,大大减少事务安排所需的时间 . 相似文献
7.
G. Montero L. Gonzlez E. Flrez M. D. García A. Surez 《Numerical Linear Algebra with Applications》2002,9(3):239-247
Parallel preconditioners are presented for the solution of general linear systems of equations. The computation of these preconditioners is achieved by orthogonal projections related to the Frobenius inner product. So, minM∈??∥AM?I∥ F and matrix M0∈?? corresponding to this minimum (?? being any vectorial subspace of ??n(?)) are explicitly computed using accumulative formulae in order to reduce computational cost when subspace ?? is extended to another one containing it. Every step, the computation is carried out taking advantage of the previous one, what considerably reduces the amount of work. These general results are illustrated with the subspace of matrices M such that AM is symmetric. The main application is developed for the subspace of matrices with a given sparsity pattern which may be constructed iteratively by augmenting the set of non‐zero entries in each column. Finally, the effectiveness of the sparse preconditioners is illustrated with some numerical experiments. Copyright © 2002 John Wiley & Sons, Ltd. 相似文献
8.
9.
In a previous paper (Ref. 1), an exact solution of the optimal planar interception with fixed end conditions was derived in closed form. The optimal control was expressed as an explicit function of the state variables and two fixed parameters, obtained by solving a set of nonlinear algebraic equations involving elliptic integrals. In order to facilitate the optimal control implementation, the present paper derives a highly accurate simplified solution assuming that the ratio of the pursuer turning radius to the initial range is small. An asymptotic expansion further reduces the computational workload. Construction of a near-optimal open-loop control, based on the approximations, completes the present paper. 相似文献
10.