全文获取类型
收费全文 | 4518篇 |
免费 | 572篇 |
国内免费 | 159篇 |
专业分类
化学 | 496篇 |
晶体学 | 3篇 |
力学 | 386篇 |
综合类 | 103篇 |
数学 | 1107篇 |
物理学 | 795篇 |
无线电 | 2359篇 |
出版年
2024年 | 5篇 |
2023年 | 35篇 |
2022年 | 57篇 |
2021年 | 72篇 |
2020年 | 104篇 |
2019年 | 69篇 |
2018年 | 81篇 |
2017年 | 140篇 |
2016年 | 152篇 |
2015年 | 179篇 |
2014年 | 254篇 |
2013年 | 260篇 |
2012年 | 339篇 |
2011年 | 327篇 |
2010年 | 213篇 |
2009年 | 214篇 |
2008年 | 278篇 |
2007年 | 261篇 |
2006年 | 255篇 |
2005年 | 255篇 |
2004年 | 228篇 |
2003年 | 219篇 |
2002年 | 169篇 |
2001年 | 142篇 |
2000年 | 109篇 |
1999年 | 109篇 |
1998年 | 105篇 |
1997年 | 101篇 |
1996年 | 69篇 |
1995年 | 81篇 |
1994年 | 60篇 |
1993年 | 77篇 |
1992年 | 64篇 |
1991年 | 31篇 |
1990年 | 21篇 |
1989年 | 19篇 |
1988年 | 17篇 |
1987年 | 9篇 |
1986年 | 12篇 |
1985年 | 13篇 |
1984年 | 15篇 |
1983年 | 2篇 |
1982年 | 8篇 |
1981年 | 5篇 |
1980年 | 3篇 |
1979年 | 5篇 |
1976年 | 1篇 |
1975年 | 1篇 |
1972年 | 1篇 |
1967年 | 1篇 |
排序方式: 共有5249条查询结果,搜索用时 46 毫秒
231.
TANG Dexiang GE Wei WANG Xiaowei MA Jingsen GUO Li & LI Jinghai Multi-phase Reaction Laboratory Institute of Process Engineering Chinese Academy of Sciences Beijing China 《中国科学B辑(英文版)》2004,47(5):434-442
Particle methods such as SPH (smoothed particlehydrodynamics)[1,2], DEM (distinct-element model)[3],DPD (dissipative particle dynamics)[4— and pseudo- 6]particle modeling (PPM)[7,8] are getting more and morepopular as numerical methods in material science andfluid dynamics, due to their flexibility in simulatingcomplicated phenomena like fluid-solid coupling,multi-phase flow and large deformation and rupture insolid materials. However, a comm… 相似文献
232.
Gaussian elimination with partial pivoting achieved by adding the pivot row to the kth row at step k, was introduced by Onaga and Takechi in 1986 as means for reducing communications in parallel implementations. In this paper it is shown that the growth factor of this partial pivoting algorithm is bounded above by n <#60; 3
n–1, as compared to 2
n–1 for the standard partial pivoting. This bound n, close to 3
n–2, is attainable for class of near-singular matrices. Moreover, for the same matrices the growth factor is small under partial pivoting.This revised version was published online in October 2005 with corrections to the Cover Date. 相似文献
233.
本文介绍了“863”通信技术主题8年来取得的成果,对产业发展的贡献,管理组织的经验和体会,存在的问题,对今后工作的建议。 相似文献
234.
González-Castaño Francisco J. García-Palomares Ubaldo M. 《Telecommunication Systems》2001,17(4):435-454
This paper describes a new model for routing in survivable ATM networks and a new parallel projection algorithm for solving the corresponding optimization problem. The proposed algorithm has application in general linear programming (LP). Numerical results for medium size networks are presented and discussed. 相似文献
235.
Local branching 总被引:1,自引:0,他引:1
The availability of effective exact or heuristic solution methods for general Mixed-Integer Programs (MIPs) is of paramount importance for practical applications. In the present paper we investigate the use of a generic MIP solver as a black-box ``tactical' tool to explore effectively suitable solution subspaces defined and controlled at a ``strategic' level by a simple external branching framework. The procedure is in the spirit of well-known local search metaheuristics, but the neighborhoods are obtained through the introduction in the MIP model of completely general linear inequalities called local branching cuts. The new solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the MIP solver at hand. It alternates high-level strategic branchings to define the solution neighborhoods, and low-level tactical branchings to explore them. The result is a completely general scheme aimed at favoring early updatings of the incumbent solution, hence producing high-quality solutions at early stages of the computation. The method is analyzed computationally on a large class of very difficult MIP problems by using the state-of-the-art commercial software ILOG-Cplex 7.0 as the black-box tactical MIP solver. For these instances, most of which cannot be solved to proven optimality in a reasonable time, the new method exhibits consistently an improved heuristic performance: in 23 out of 29 cases, the MIP solver produced significantly better incumbent solutions when driven by the local branching paradigm.
Mathematics Subject Classification (2000):90C06, 90C10, 90C11, 90C27, 90C59 相似文献
236.
Hijazi Oussama Montiel Sebastin Roldn Antonio 《Annals of Global Analysis and Geometry》2003,23(3):247-264
We give a sharp extrinsic lower bound for the first eigenvaluesof the intrinsic Dirac operator of certain hypersurfaces boundinga compact domain in a spin manifold of negative scalar curvature.Limiting-cases are characterized by the existence, on the domain,of imaginary Killing spinors. Some geometrical applications, as anAlexandrov type theorem, are given. 相似文献
237.
Suppose r ≥ 2 is a real number. A proper r‐flow of a directed multi‐graph is a mapping such that (i) for every edge , ; (ii) for every vertex , . The circular flow number of a graph G is the least r for which an orientation of G admits a proper r‐flow. The well‐known 5‐flow conjecture is equivalent to the statement that every bridgeless graph has circular flow number at most 5. In this paper, we prove that for any rational number r between 2 and 5, there exists a graph G with circular flow number r. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 304–318, 2003 相似文献
238.
In this paper, theoretical results are described on the maximum norm stability and accuracy of finite difference discretizations of parabolic equations on overset nonmatching space-time grids. We consider parabolic equations containing a linear reaction term on a space-time domain which is decomposed into an overlapping collection of cylindrical subregions of the form , for . Each of the space-time domains are assumed to be independently grided (in parallel) according to the local geometry and space-time regularity of the solution, yielding space-time grids with mesh parameters and . In particular, the different space-time grids need not match on the regions of overlap, and the time steps can differ from one grid to the next. We discretize the parabolic equation on each local grid by employing an explicit or implicit -scheme in time and a finite difference scheme in space satisfying a discrete maximum principle. The local discretizations are coupled together, without the use of Lagrange multipliers, by requiring the boundary values on each space-time grid to match a suitable interpolation of the solution on adjacent grids. The resulting global discretization yields a large system of coupled equations which can be solved by a parallel Schwarz iterative procedure requiring some communication between adjacent subregions. Our analysis employs a contraction mapping argument.
Applications of the results are briefly indicated for reaction-diffusion equations with contractive terms and heterogeneous hyperbolic-parabolic approximations of parabolic equations.
239.
240.
Stefan M. Stefanov 《Computational Optimization and Applications》2001,18(1):27-48
A minimization problem with convex and separable objective function subject to a separable convex inequality constraint and bounded variables is considered. A necessary and sufficient condition is proved for a feasible solution to be an optimal solution to this problem. Convex minimization problems subject to linear equality/linear inequality constraint, and bounds on the variables are also considered. A necessary and sufficient condition and a sufficient condition, respectively, are proved for a feasible solution to be an optimal solution to these two problems. Algorithms of polynomial complexity for solving the three problems are suggested and their convergence is proved. Some important forms of convex functions and computational results are given in the Appendix. 相似文献