全文获取类型
收费全文 | 46327篇 |
免费 | 3498篇 |
国内免费 | 2604篇 |
专业分类
化学 | 4843篇 |
晶体学 | 42篇 |
力学 | 1805篇 |
综合类 | 507篇 |
数学 | 7336篇 |
物理学 | 5187篇 |
综合类 | 32709篇 |
出版年
2024年 | 183篇 |
2023年 | 491篇 |
2022年 | 994篇 |
2021年 | 1035篇 |
2020年 | 1034篇 |
2019年 | 926篇 |
2018年 | 893篇 |
2017年 | 1220篇 |
2016年 | 1321篇 |
2015年 | 1454篇 |
2014年 | 2306篇 |
2013年 | 2223篇 |
2012年 | 2585篇 |
2011年 | 2878篇 |
2010年 | 2265篇 |
2009年 | 2652篇 |
2008年 | 2700篇 |
2007年 | 3402篇 |
2006年 | 3050篇 |
2005年 | 2604篇 |
2004年 | 2353篇 |
2003年 | 2079篇 |
2002年 | 1780篇 |
2001年 | 1508篇 |
2000年 | 1311篇 |
1999年 | 1118篇 |
1998年 | 983篇 |
1997年 | 802篇 |
1996年 | 709篇 |
1995年 | 620篇 |
1994年 | 507篇 |
1993年 | 464篇 |
1992年 | 402篇 |
1991年 | 316篇 |
1990年 | 294篇 |
1989年 | 252篇 |
1988年 | 206篇 |
1987年 | 171篇 |
1986年 | 91篇 |
1985年 | 71篇 |
1984年 | 45篇 |
1983年 | 14篇 |
1982年 | 26篇 |
1981年 | 8篇 |
1980年 | 11篇 |
1979年 | 18篇 |
1978年 | 8篇 |
1977年 | 11篇 |
1976年 | 6篇 |
1955年 | 14篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
71.
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 相似文献
72.
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]. 相似文献
73.
S. Aravinda N. Shamala Rituparna S. Roy P Balaram 《Journal of Chemical Sciences》2003,115(5-6):373-400
An overview of the use of non-protein amino acids in the design of conformationally well-defined peptides, based on work from
the author’s laboratory, is discussed. The crystal structures of several designed oligopeptides illustrate the useα-aminoisobutyric acid (Aib) in the construction of helices, D-amino acids in the design of helix termination segments andDPro-Xxx segments for nucleating ofβ-hairpin structures.β- andγ-amino acid residues have been used to expand the range of designed polypeptide structures.
Dedicated to Professor C N R Rao on his 70th birthday 相似文献
74.
本文通过研究匹配问题的实例空间,匈牙利算法和解空间三者之间的关系,指出S实例空间的数目与问题复杂度之间的关系既不是充分也不是必要的,而如何对问题的解空间进行合理的分解才能是问题的关键。 相似文献
75.
两段级联掺铒光纤放大器的优化研究 总被引:7,自引:4,他引:3
基于Giles模型,研究了980 nm和1480 nm泵浦的两段级联掺铒光纤放大器(EDFA)的设计,得出了掺铒光纤(EDF)的最佳长度和光隔离器的最佳位置随泵浦功率和信号功率的变化关系.比较980 nm和1480 nm泵浦的两段级联EDFA,可以发现,前者的最佳EDF长度短,而光隔离器最佳位置距EDFA输入端远. 相似文献
76.
Kenneth Weber Vilmar Trevisan Luiz Felipe Martins 《Journal of Algorithms in Cognition, Informatics and Logic》2005,54(2):152-167
This paper describes the first algorithm to compute the greatest common divisor (GCD) of two n-bit integers using a modular representation for intermediate values U, V and also for the result. It is based on a reduction step, similar to one used in the accelerated algorithm [T. Jebelean, A generalization of the binary GCD algorithm, in: ISSAC '93: International Symposium on Symbolic and Algebraic Computation, Kiev, Ukraine, 1993, pp. 111–116; K. Weber, The accelerated integer GCD algorithm, ACM Trans. Math. Softw. 21 (1995) 111–122] when U and V are close to the same size, that replaces U by (U−bV)/p, where p is one of the prime moduli and b is the unique integer in the interval (−p/2,p/2) such that . When the algorithm is executed on a bit common CRCW PRAM with O(nlognlogloglogn) processors, it takes O(n) time in the worst case. A heuristic model of the average case yields O(n/logn) time on the same number of processors. 相似文献
77.
基于改进遗传算法的布局优化子问题 总被引:2,自引:0,他引:2
本针对子问题,构造了布局子问题(关于同构布局等价类)的改进遗传算法。将该算法应用于二维布局优化子问题,数值实验表明该算法能够在很好地保持图元的邻接关系的前提下找到子问题的最优解。由于布局优化问题可分解为有限个子问题,所以利用该算法可以找到整个布局优化问题的全局最优解。 相似文献
78.
HANXI'AN HUANGXILI 《高校应用数学学报(英文版)》1998,13(4):445-450
For two rational quadratic B-spline curves with same control vertexes, the cross ratio of four eollinear points are represented; which are any one of the vertexes, and the two points that the ray initialing from the vertex intersects with the corresponding segments of the twocurves, and the point the ray intersecting with the connecting line between the two neighboring vertexes. Different from rational quadratic Beeier curves, the value is generally related with the loeation of the ray, and the necessary and sufficient condition o5 the ratio being independent of the ray‘s loeation is showed. Alsn another cross ratio o5 the following four collinear points are suggested, i.e. one vertex, the points that the ray from the initlal vertex intersects respectivdy with the curve segmentt the line connecting the segments end points, and the line connecting the two neighboring vertexes. This cross ratio is concerned only whh the ray‘s location, butnot with the weights of the curve. Furthermore, the cross ratio is projective invariant under the projective transformation between the two segments. 相似文献
79.
This paper presents a unified analysis of decomposition algorithms for continuously differentiable optimization problems defined on Cartesian products of convex feasible sets. The decomposition algorithms are analyzed using the framework of cost approx imation algorithms. A convergence analysis is made for three decomposition algorithms: a sequential algorithm which extends the classical Gauss-Seidel scheme, a synchronized parallel algorithm which extends the Jacobi method, and a partially asynchronous parallel algorithm. The analysis validates inexact computations in both the subproblem and line search phases, and includes convergence rate results. The range of feasible step lengths within each algorithm is shown to have a direct correspondence to the increasing degree of parallelism and asynchronism, and the resulting usage of more outdated information in the algorithms. 相似文献
80.
神经网络法计算镉(Ⅱ),羟基及碳酸根三元体系的形态分布 总被引:2,自引:0,他引:2
采用前馈线笥网络BP算法,计算了Cd62+-OH^-CO^2-3三元体系的累积稳定常数。用Hopfield反馈网络研究了体系中络合物的形态分布。溶液中溶解的CO2对lgβ1的计算结果有重要影响,对lgβ2,lgβ3,lgβ4的结果影响不大。 相似文献