全文获取类型
收费全文 | 23567篇 |
免费 | 3056篇 |
国内免费 | 728篇 |
专业分类
化学 | 1617篇 |
晶体学 | 29篇 |
力学 | 1114篇 |
综合类 | 368篇 |
数学 | 7036篇 |
物理学 | 3527篇 |
无线电 | 13660篇 |
出版年
2024年 | 78篇 |
2023年 | 274篇 |
2022年 | 514篇 |
2021年 | 623篇 |
2020年 | 623篇 |
2019年 | 547篇 |
2018年 | 547篇 |
2017年 | 786篇 |
2016年 | 1006篇 |
2015年 | 1025篇 |
2014年 | 1639篇 |
2013年 | 1622篇 |
2012年 | 1670篇 |
2011年 | 1741篇 |
2010年 | 1194篇 |
2009年 | 1392篇 |
2008年 | 1602篇 |
2007年 | 1622篇 |
2006年 | 1344篇 |
2005年 | 1147篇 |
2004年 | 986篇 |
2003年 | 856篇 |
2002年 | 739篇 |
2001年 | 603篇 |
2000年 | 555篇 |
1999年 | 423篇 |
1998年 | 388篇 |
1997年 | 323篇 |
1996年 | 303篇 |
1995年 | 203篇 |
1994年 | 151篇 |
1993年 | 162篇 |
1992年 | 133篇 |
1991年 | 67篇 |
1990年 | 67篇 |
1989年 | 53篇 |
1988年 | 54篇 |
1987年 | 40篇 |
1986年 | 38篇 |
1985年 | 45篇 |
1984年 | 42篇 |
1983年 | 15篇 |
1982年 | 23篇 |
1981年 | 14篇 |
1980年 | 11篇 |
1979年 | 14篇 |
1978年 | 4篇 |
1977年 | 17篇 |
1976年 | 7篇 |
1959年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
81.
近年来,决定椭圆型方程系数反问题在地磁、地球物理、冶金和生物等实际问题上有着广泛的应用.本文讨论了二维的决定椭圆型方程系数反问题的数值求解方法.由误差平方和最小原则,这个反问题可化为一个变分问题,并进一步离散化为一个最优化问题,其目标函数依赖于要决定的方程系数.本文着重考察非线性共轭梯度法在此最优化问题数值计算中的表现,并与拟牛顿法作为对比.为了提高算法的效率我们适当选择加快收敛速度的预处理矩阵.同时还考察了线搜索方法的不同对优化算法的影响.数值实验的结果表明,非线性共轭梯度法在这类大规模优化问题中相对于拟牛顿法更有效. 相似文献
82.
In basin modelling the thermodynamics of a multicomponent multiphase fluid flux are computationally too expensive when derived from an equation of state and the Gibbs equality constraints. In this article we present a novel implicit molar mass formulation technique using binary mixture thermodynamics. The two proposed solution methods, with and without cross derivative terms between components, are based on a preconditioned Newton‐GMRES scheme for each time‐step with analytical computation of the derivatives. These new algorithms reduce significantly the numerical effort for the computation of the molar masses, and we illustrate the behavior of these methods with numerical computations. Copyright © 2004 John Wiley & Sons Ltd. 相似文献
83.
M. A. Diniz-Ehrhardt M. A. Gomes-Ruggiero J. M. Martínez S. A. Santos 《Journal of Optimization Theory and Applications》2004,123(3):497-517
The spectral projected gradient method SPG is an algorithm for large-scale bound-constrained optimization introduced recently by Birgin, Martínez, and Raydan. It is based on the Raydan unconstrained generalization of the Barzilai-Borwein method for quadratics. The SPG algorithm turned out to be surprisingly effective for solving many large-scale minimization problems with box constraints. Therefore, it is natural to test its perfomance for solving the sub-problems that appear in nonlinear programming methods based on augmented Lagrangians. In this work, augmented Lagrangian methods which use SPG as the underlying convex-constraint solver are introduced (ALSPG) and the methods are tested in two sets of problems. First, a meaningful subset of large-scale nonlinearly constrained problems of the CUTE collection is solved and compared with the perfomance of LANCELOT. Second, a family of location problems in the minimax formulation is solved against the package FFSQP. 相似文献
84.
In this paper we focus on the problem of identifying the index sets P(x):=i|xi>0, N(x):={i|Fi(x)>0 and C(x):=i|xi=Fi(x)=0} for a solution x of the monotone nonlinear complementarity problem NCP(F). The correct identification of these sets is important from both theoretical and practical points of view. Such an identification enables us to remove complementarity conditions from the NCP and locally reduce the NCP to a system which can be dealt with more easily. We present a new technique that utilizes a sequence generated by the proximal point algorithm (PPA). Using the superlinear convergence property of PPA, we show that the proposed technique can identify the correct index sets without assuming the nondegeneracy and the local uniqueness of the solution.This work was supported in part by a Grant-in-Aid for Scientific Research from the Ministry of Education, Science, Sports and Culture of Japan.Mathematics Subject Classification (2000): 90C33, 65K10 相似文献
85.
Shea-Ming Oon 《Periodica Mathematica Hungarica》2004,49(2):107-118
In this paper we study some pseudo-random properties related to the prime factors of integers. We prove some results concerning the well distribution of the greatest prime factor modulo 4, and give some computational insight on the correlations, which seem to be beyond reach of proof. 相似文献
86.
Clemens Heuberger 《Periodica Mathematica Hungarica》2004,49(2):65-89
We study digit expansions with arbitrary integer digits in base q (q integer) and the Fibonacci base such that the sum of the absolute values of the digits is minimal. For the Fibonacci case, we describe a unique minimal expansion and give a greedy algorithm to compute it. Additionally, transducers to calculate minimal expansions from other expansions are given. For the case of even integer bases q, similar results are given which complement those given in [6]. 相似文献
87.
Periodica Mathematica Hungarica - In our paper we study the usage of partially defined Boolean functions (PDBFs) for generating cryptographically strong Boolean functions. A PDBF can be considered... 相似文献
88.
Searching in trees 总被引:1,自引:0,他引:1
Frank Recker 《Discrete Applied Mathematics》2004,140(1-3):169-183
In (Discrete Math. 17 (1977)181) Rivest introduced the search complexity of binary trees and proved that among all binary trees with a fixed search complexity the smallest ones are the so-called Fibonacci trees. This result is extended for q-trees. The structure of the smallest q-trees is again Fibonacci-like but more complicated than in the binary case. In addition an upper bound for the asymptotic growth of these trees is given. 相似文献
89.
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. 相似文献
90.
本文通过研究匹配问题的实例空间,匈牙利算法和解空间三者之间的关系,指出S实例空间的数目与问题复杂度之间的关系既不是充分也不是必要的,而如何对问题的解空间进行合理的分解才能是问题的关键。 相似文献