全文获取类型
收费全文 | 30801篇 |
免费 | 2214篇 |
国内免费 | 1572篇 |
专业分类
化学 | 8277篇 |
晶体学 | 66篇 |
力学 | 2521篇 |
综合类 | 534篇 |
数学 | 16223篇 |
物理学 | 6966篇 |
出版年
2024年 | 157篇 |
2023年 | 913篇 |
2022年 | 993篇 |
2021年 | 986篇 |
2020年 | 1936篇 |
2019年 | 1559篇 |
2018年 | 1426篇 |
2017年 | 1419篇 |
2016年 | 1511篇 |
2015年 | 1144篇 |
2014年 | 1737篇 |
2013年 | 4170篇 |
2012年 | 1438篇 |
2011年 | 1152篇 |
2010年 | 1006篇 |
2009年 | 1220篇 |
2008年 | 1261篇 |
2007年 | 1244篇 |
2006年 | 1109篇 |
2005年 | 1051篇 |
2004年 | 937篇 |
2003年 | 791篇 |
2002年 | 742篇 |
2001年 | 611篇 |
2000年 | 574篇 |
1999年 | 518篇 |
1998年 | 495篇 |
1997年 | 424篇 |
1996年 | 325篇 |
1995年 | 243篇 |
1994年 | 192篇 |
1993年 | 195篇 |
1992年 | 150篇 |
1991年 | 92篇 |
1990年 | 97篇 |
1989年 | 71篇 |
1988年 | 67篇 |
1987年 | 49篇 |
1986年 | 52篇 |
1985年 | 78篇 |
1984年 | 71篇 |
1983年 | 33篇 |
1982年 | 67篇 |
1981年 | 62篇 |
1980年 | 52篇 |
1979年 | 32篇 |
1978年 | 28篇 |
1977年 | 29篇 |
1976年 | 24篇 |
1975年 | 13篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
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实例空间的数目与问题复杂度之间的关系既不是充分也不是必要的,而如何对问题的解空间进行合理的分解才能是问题的关键。 相似文献
74.
基于粗糙集理论的知识约简及应用实例 总被引:5,自引:0,他引:5
在保持分类能力不变的前提下 ,通过利用粗糙集理论中的知识约简方法 ,在保护知识库分类不变的条件下 ,删除其中不相关或不重要的知识 ,从而导出问题的决策 .利用基于决策表的粗糙集模型算法 ,实例分析如何数字化表示决策表 ,并对其进行属性约简和属性值的约简 ,从而提取决策规则 . 相似文献
75.
Mean value in invexity analysis 总被引:1,自引:0,他引:1
In this paper, a generalization of the mean value theorem is considered in the case of functions defined on an invex set with respect to η (which is not necessarily connected). 相似文献
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.
Annegret K. Wagler 《4OR: A Quarterly Journal of Operations Research》2005,3(4):329-336
Shepherd95 proved that the stable set polytopes of near-bipartite graphs are given by constraints associated with the complete
join of antiwebs only. For antiwebs, the facet set reduces to rank constraints associated with single antiwebs by Wagler2004.
We extend this result to a larger graph class, the complements of fuzzy circular interval graphs, recently introduced in ChudnovskySeymour2004.
Received: November 2004 / Revised version: June 2005 相似文献
78.
Yao Ping HOU 《数学学报(英文版)》2005,21(4):955-960
A signed graph is a graph with a sign attached to each edge. This paper extends some fundamental concepts of the Laplacian matrices from graphs to signed graphs. In particular, the relationships between the least Laplacian eigenvalue and the unbalancedness of a signed graph are investigated. 相似文献
79.
基于改进遗传算法的布局优化子问题 总被引:2,自引:0,他引:2
本针对子问题,构造了布局子问题(关于同构布局等价类)的改进遗传算法。将该算法应用于二维布局优化子问题,数值实验表明该算法能够在很好地保持图元的邻接关系的前提下找到子问题的最优解。由于布局优化问题可分解为有限个子问题,所以利用该算法可以找到整个布局优化问题的全局最优解。 相似文献
80.
Krzysztof Pawaowski 《K-Theory》1998,13(1):41-55
The paper presents a procedure for constructing smooth actions of finite perfect groups on spheres with fixed point sets having certain prescribed properties (Theorem A); in particular, having any prescribed configuration of Chern and Pontryagin numbers (Corollary C). The main ingredients used are equivariant thickening and equivariant surgery. 相似文献