全文获取类型
收费全文 | 5019篇 |
免费 | 379篇 |
国内免费 | 147篇 |
专业分类
化学 | 574篇 |
晶体学 | 6篇 |
力学 | 500篇 |
综合类 | 120篇 |
数学 | 3355篇 |
物理学 | 990篇 |
出版年
2024年 | 5篇 |
2023年 | 46篇 |
2022年 | 77篇 |
2021年 | 83篇 |
2020年 | 85篇 |
2019年 | 82篇 |
2018年 | 81篇 |
2017年 | 102篇 |
2016年 | 138篇 |
2015年 | 101篇 |
2014年 | 179篇 |
2013年 | 267篇 |
2012年 | 218篇 |
2011年 | 215篇 |
2010年 | 210篇 |
2009年 | 272篇 |
2008年 | 320篇 |
2007年 | 352篇 |
2006年 | 279篇 |
2005年 | 242篇 |
2004年 | 228篇 |
2003年 | 210篇 |
2002年 | 207篇 |
2001年 | 178篇 |
2000年 | 137篇 |
1999年 | 147篇 |
1998年 | 164篇 |
1997年 | 132篇 |
1996年 | 102篇 |
1995年 | 90篇 |
1994年 | 78篇 |
1993年 | 77篇 |
1992年 | 67篇 |
1991年 | 54篇 |
1990年 | 33篇 |
1989年 | 28篇 |
1988年 | 48篇 |
1987年 | 23篇 |
1986年 | 23篇 |
1985年 | 23篇 |
1984年 | 30篇 |
1983年 | 7篇 |
1982年 | 22篇 |
1981年 | 13篇 |
1980年 | 14篇 |
1979年 | 9篇 |
1978年 | 11篇 |
1977年 | 16篇 |
1976年 | 10篇 |
1974年 | 5篇 |
排序方式: 共有5545条查询结果,搜索用时 78 毫秒
11.
A parallel method for time discretization of parabolic equations based on Laplace transformation and quadrature 总被引:5,自引:0,他引:5
We consider the discretization in time of an inhomogeneous parabolicequation in a Banach space setting, using a representation ofthe solution as an integral along a smooth curve in the complexleft half-plane which, after transformation to a finite interval,is then evaluated to high accuracy by a quadrature rule. Thisreduces the problem to a finite set of elliptic equations withcomplex coefficients, which may be solved in parallel. The paperis a further development of earlier work by the authors, wherewe treated the homogeneous equation in a Hilbert space framework.Special attention is given here to the treatment of the forcingterm. The method is combined with finite-element discretizationin spatial variables. 相似文献
12.
On the Application of the Auxiliary Problem Principle 总被引:6,自引:0,他引:6
The auxiliary problem principle (APP) derives from a general theory on decomposition-coordination methods establishing a comprehensive framework for both one-level and two-level methods. In this paper, the results of the two-level methods of APP are specialized for an efficient application to some engineering problems. 相似文献
13.
Solving large scale linear systems efficiently plays an important role in a petroleum reservoir simulator, and the key part is how to choose an effective parallel preconditioner. Properly choosing a good preconditioner has been beyond the pure algebraic field. An integrated preconditioner should include such components as physical background, characteristics of PDE mathematical model, nonlinear solving method, linear 相似文献
14.
15.
The problem of finding the Euclidean distance between two convex polyhedra can be reduced to the combinatorial optimization problem of finding the minimum distance between their faces. This paper presents a global optimality criterion for this problem. An algorithm (QLDPA) for the fast computation of the distance between convex and bounded polyhedra is proposed as an application of it. Computer experiments show its fast performance, especially when the total number of vertices is large. 相似文献
16.
Gowravaram Sabitha G.S.Kiran Kumar ReddyK.Bhaskar Reddy J.S. Yadav 《Tetrahedron letters》2003,44(34):6497-6499
The three component condensation of an aldehyde, a β-keto ester and urea (thiourea) in the presence of a catalytic amount of VCl3 is disclosed for the solution phase synthesis of dihydropyrimidinones. The ease of synthesis and work-up allowed the parallel synthesis of a 48-membered library of dihydropyrimidinones quickly and efficiently in good yields. 相似文献
17.
A new approach to the robust handling of non‐linear constraints for GAs (genetic algorithms) optimization is proposed. A specific feature of the approach consists of the change in the conventional search strategy by employing search paths which pass through both feasible and infeasible points (contrary to the traditional approach where only feasible points may be included in a path). The method (driven by full Navier–Stokes computations) was applied to the problem of multiobjective optimization of aerodynamic shapes subject to various geometrical and aerodynamic constraints. The results demonstrated that the method retains high robustness of conventional GAs while keeping CFD computational volume to an acceptable level, which allowed the algorithm to be used in a demanding engineering environment. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
18.
We give a Gray code and constant average time generating algorithm for derangements, i.e., permutations with no fixed points. In our Gray code, each derangement is transformed into its successor either via one or two transpositions or a rotation of three elements. We generalize these results to permutations with number of fixed points bounded between two constants. 相似文献
19.
We deal with MAXH0-FREE PARTIAL SUBGRAPH. We mainly prove that 3-locally optimum solutions achieve approximation ratio (δ0+1)/(B+2+ν0), where B=maxv∈VdG(v), δ0=minv∈V(H0)dH0(v) and ν0=(|V(H0)|+1)/δ0. Next, we show that this ratio rises up to 3/(B+1) when H0=K3. Finally, we provide hardness results for MAXK3-FREE PARTIAL SUBGRAPH. 相似文献
20.
A server needs to compute a broadcast schedule for n pages whose request times are known in advance. Outputting a page satisfies all outstanding requests for the page. The goal is to minimize the average waiting time of a client. In this paper, we show the equivalence of two apparently different relaxations that have been considered for this problem. 相似文献