全文获取类型
收费全文 | 1465篇 |
免费 | 173篇 |
国内免费 | 130篇 |
专业分类
化学 | 603篇 |
晶体学 | 19篇 |
力学 | 74篇 |
综合类 | 29篇 |
数学 | 609篇 |
物理学 | 434篇 |
出版年
2024年 | 5篇 |
2023年 | 28篇 |
2022年 | 86篇 |
2021年 | 96篇 |
2020年 | 72篇 |
2019年 | 58篇 |
2018年 | 63篇 |
2017年 | 70篇 |
2016年 | 96篇 |
2015年 | 76篇 |
2014年 | 88篇 |
2013年 | 139篇 |
2012年 | 99篇 |
2011年 | 84篇 |
2010年 | 62篇 |
2009年 | 70篇 |
2008年 | 65篇 |
2007年 | 65篇 |
2006年 | 68篇 |
2005年 | 37篇 |
2004年 | 34篇 |
2003年 | 39篇 |
2002年 | 29篇 |
2001年 | 33篇 |
2000年 | 29篇 |
1999年 | 21篇 |
1998年 | 16篇 |
1997年 | 18篇 |
1996年 | 14篇 |
1995年 | 10篇 |
1994年 | 17篇 |
1993年 | 10篇 |
1992年 | 10篇 |
1991年 | 9篇 |
1990年 | 6篇 |
1989年 | 2篇 |
1988年 | 5篇 |
1987年 | 8篇 |
1986年 | 8篇 |
1985年 | 6篇 |
1984年 | 7篇 |
1983年 | 2篇 |
1982年 | 5篇 |
1981年 | 2篇 |
1979年 | 1篇 |
排序方式: 共有1768条查询结果,搜索用时 15 毫秒
1.
不完全信息群体决策专家权重的集结 总被引:8,自引:5,他引:3
本文对于属性权重信息和属性效用信息都不完全的群体多属性决策问题,通过构造属性值区间和运用系统聚类分析法,对群体决策中的专家进行分类,并确定每位专家的权重. 相似文献
2.
Deborah M. Greaves 《国际流体数值方法杂志》2006,50(6):693-711
An adaptive hierarchical grid‐based method for predicting complex free surface flows is used to simulate collapse of a water column. Adapting quadtree grids are combined with a high‐resolution interface‐capturing approach and pressure‐based coupling of the Navier–Stokes equations. The Navier–Stokes flow solution scheme is verified for simulation of flow in a lid‐driven cavity at Re=1000. Two approaches to the coupling of the Navier–Stokes equations are investigated as are alternative face velocity and hanging node interpolations. Collapse of a water column as well as collapse of a water column and its subsequent interaction with an obstacle are simulated. The calculations are made on uniform and adapting quadtree grids, and the accuracy of the quadtree calculations is shown to be the same as those made on the equivalent uniform grids. Results are in excellent agreement with experimental and other numerical data. A sharp interface is maintained at the free surface. The new adapting quadtree‐based method achieves a considerable saving in the size of the computational grid and CPU time in comparison with calculations made on equivalent uniform grids. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
3.
Katsunari Inoue Kazuaki Kato Norimitsu Tohnai Mikiji Miyata 《Journal of polymer science. Part A, Polymer chemistry》2004,42(18):4648-4655
We studied simulations by computer graphics to estimate the steric mechanism of the asymmetric polymerization of prochiral diene monomers in channels of inclusion compounds of steroidal bile acids, such as deoxycholic acid (DCA) and cholic acid. We applied a hierarchization method to interpret the crystal structures of bile acids, clarifying that the chiral host molecules associated to form characteristic 21-helical assemblies with uneven surfaces. A detailed analysis of the uneven channels in a close-packing state indicated that there were many possible arrangements of the monomers in the channels. The plausible arrangements in the channel could explain a previous study, which showed that the polymerization in the DCA channel yielded chiral polymers with a predominant configuration from prochiral diene monomers, such as 2-methyl-trans-1,3-pentadiene. On the basis of such simulation studies of the arrangements of guest monomers in the channel, we examined a plausible steric mechanism for asymmetric inclusion polymerization. © 2004 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 42: 4648–4655, 2004 相似文献
4.
We employ an agent‐based model to show that memory and the absence of an a priori best strategy are sufficient for self‐segregation and clustering to emerge in a complex adaptive system with discrete agents that do not compete over a limited resource nor contend in a winner‐take‐all scenario. An agent starts from a corner of a two‐dimensional lattice and aims to reach a randomly selected site in the opposite side within the shortest possible time. The agent is isolated during the course of its journey and does not interact with other agents. Time‐bound obstacles appear at random lattice locations and the agent must decide whether to challenge or evade any obstacle blocking its path. The agent is capable of adapting a strategy in dealing with an obstacle. We analyze the dependence of strategy‐retention time with strategy for both memory‐based and memory‐less agents. We derive the equality spectrum to establish the environmental conditions that favor the existence of an a priori best strategy. We found that memory‐less agents do not polarize into two opposite strategy‐retention time distributions nor cluster toward a center distribution. © 2004 Wiley Periodicals, Inc. Complexity 9: 41–46, 2004 相似文献
5.
6.
Preconditioners based on various multilevel extensions of two‐level finite element methods (FEM) lead to iterative methods which have an optimal order computational complexity with respect to the size of the system. Such methods were first presented in Axelsson and Padiy (SIAM. J. Sci. Stat. Comp. 1990; 20 :1807) and Axelsson and Vassilevski (Numer. Math. 1989; 56 :157), and are based on (recursive) two‐level splittings of the finite element space. The key role in the derivation of optimal convergence rate estimates is played by the constant γ in the so‐called Cauchy–Bunyakowski–Schwarz (CBS) inequality, associated with the angle between the two subspaces of the splitting. It turns out that only existence of uniform estimates for this constant is not enough but accurate quantitative bounds for γ have to be found as well. More precisely, the value of the upper bound for γ∈(0,1) is part of the construction of various multilevel extensions of the related two‐level methods. In this paper, an algebraic two‐level preconditioning algorithm for second‐order elliptic boundary value problems is constructed, where the discretization is done using Crouzeix–Raviart non‐conforming linear finite elements on triangles. An important point to make is that in this case the finite element spaces corresponding to two successive levels of mesh refinements are not nested. To handle this, a proper two‐level basis is considered, which enables us to fit the general framework for the construction of two‐level preconditioners for conforming finite elements and to generalize the method to the multilevel case. The major contribution of this paper is the derived estimates of the related constant γ in the strengthened CBS inequality. These estimates are uniform with respect to both coefficient and mesh anisotropy. To our knowledge, the results presented in the paper are the first such estimates for non‐conforming FEM systems. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
7.
Gerhard Starke 《Numerische Mathematik》1997,78(1):103-117
Summary. The convergence rate of Krylov subspace methods for the solution of nonsymmetric systems of linear equations, such as GMRES
or FOM, is studied. Bounds on the convergence rate are presented which are based on the smallest real part of the field of
values of the coefficient matrix and of its inverse. Estimates for these quantities are available during the iteration from
the underlying Arnoldi process. It is shown how these bounds can be used to study the convergence properties, in particular,
the dependence on the mesh-size and on the size of the skew-symmetric part, for preconditioners for finite element discretizations
of nonsymmetric elliptic boundary value problems. This is illustrated for the hierarchical basis and multilevel preconditioners
which constitute popular preconditioning strategies for such problems.
Received May 3, 1996 相似文献
8.
9.
The adaptive cross approximation (ACA) algorithm (Numer. Math. 2000; 86 :565–589; Computing 2003; 70 (1):1–24) provides a means to compute data‐sparse approximants of discrete integral formulations of elliptic boundary value problems with almost linear complexity. ACA uses only few of the original entries for the approximation of the whole matrix and is therefore well‐suited to speed up existing computer codes. In this article we extend the convergence proof of ACA to Galerkin discretizations. Additionally, we prove that ACA can be applied to integral formulations of systems of second‐order elliptic operators without adaptation to the respective problem. The results of applying ACA to boundary integral formulations of linear elasticity are reported. Furthermore, we comment on recent implementation issues of ACA for non‐smooth boundaries. Copyright © 2006 John Wiley & Sons, Ltd. 相似文献
10.
Fabio Schoen 《Journal of Global Optimization》1994,4(1):17-35
In this paper a new algorithm is proposed for global optimization problems. The main idea is that of modifying a standard clustering approach by sequentially sampling the objective function while adaptively deciding an appropriate sample size. Theoretical as well as computational results are presented. 相似文献