全文获取类型
收费全文 | 28501篇 |
免费 | 2276篇 |
国内免费 | 1916篇 |
专业分类
化学 | 1002篇 |
晶体学 | 21篇 |
力学 | 1432篇 |
综合类 | 360篇 |
数学 | 6278篇 |
物理学 | 3324篇 |
综合类 | 20276篇 |
出版年
2024年 | 151篇 |
2023年 | 346篇 |
2022年 | 657篇 |
2021年 | 723篇 |
2020年 | 600篇 |
2019年 | 610篇 |
2018年 | 615篇 |
2017年 | 821篇 |
2016年 | 896篇 |
2015年 | 921篇 |
2014年 | 1505篇 |
2013年 | 1520篇 |
2012年 | 1647篇 |
2011年 | 1838篇 |
2010年 | 1401篇 |
2009年 | 1729篇 |
2008年 | 1760篇 |
2007年 | 2283篇 |
2006年 | 1993篇 |
2005年 | 1630篇 |
2004年 | 1447篇 |
2003年 | 1177篇 |
2002年 | 1047篇 |
2001年 | 865篇 |
2000年 | 723篇 |
1999年 | 638篇 |
1998年 | 564篇 |
1997年 | 457篇 |
1996年 | 405篇 |
1995年 | 311篇 |
1994年 | 226篇 |
1993年 | 217篇 |
1992年 | 193篇 |
1991年 | 134篇 |
1990年 | 143篇 |
1989年 | 99篇 |
1988年 | 97篇 |
1987年 | 70篇 |
1986年 | 48篇 |
1985年 | 41篇 |
1984年 | 33篇 |
1983年 | 11篇 |
1982年 | 26篇 |
1981年 | 6篇 |
1980年 | 8篇 |
1979年 | 7篇 |
1976年 | 5篇 |
1973年 | 5篇 |
1959年 | 6篇 |
1955年 | 13篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
61.
62.
63.
无线搜索已成为一个新的研究、开发领域.并且它主要用到信息检索、人工智能、数据挖掘、自然语言处理、排序算法等多领域的理论和技术.此外,它拥有大量的用户,有很好的经济价值,所以引起了世界各国计算机科学界和信息产业界的高度关注,目前的研究、开发十分活跃,并出现了很多值得注意的动向. 相似文献
64.
65.
We present a practical polynomial-time algorithm for computing the
zeta function of a Kummer curve over a finite field of small
characteristic. Such algorithms have recently been obtained using a
method of Kedlaya based upon Monsky–Washnitzer cohomology, and are of
interest in cryptography. We take a different approach.
The problem is reduced to that of computing the L-function
of a multiplicative character sum. This latter task is achieved via a
cohomological formula based upon the work of Dwork and Reich. We show,
however, that our method and that of Kedlaya are very closely related.Dedicated to the memory of Gian-Carlo Rota 相似文献
66.
Anatoliy Samoilenko Manuel Pinto Sergei Trofimchuk 《Proceedings of the American Mathematical Society》2005,133(1):145-154
We apply the Krylov and Bogolyubov asymptotic integration procedure to asymptotically autonomous systems. First, we consider linear systems with quasi-periodic coefficient matrix multiplied by a scalar factor vanishing at infinity. Next, we study the asymptotically autonomous Van-der-Pol oscillator.
67.
Cyclic Hypomonotonicity,Cyclic Submonotonicity,and Integration 总被引:9,自引:1,他引:8
Rockafellar has shown that the subdifferentials of convex functions are always cyclically monotone operators. Moreover, maximal cyclically monotone operators are necessarily operators of this type, since one can construct explicitly a convex function, which turns out to be unique up to a constant, whose subdifferential gives back the operator. This result is a cornerstone in convex analysis and relates tightly convexity and monotonicity. In this paper, we establish analogous robust results that relate weak convexity notions to corresponding notions of weak monotonicity, provided one deals with locally Lipschitz functions and locally bounded operators. In particular, the subdifferentials of locally Lipschitz functions that are directionally hypomonotone [respectively, directionally submonotone] enjoy also an additional cyclic strengthening of this notion and in fact are maximal under this new property. Moreover, every maximal cyclically hypomonotone [respectively, maximal cyclically submonotone] operator is always the Clarke subdifferential of some directionally weakly convex [respectively, directionally approximately convex] locally Lipschitz function, unique up to a constant, which in finite dimentions is a lower C2 function [respectively, a lower C1 function]. 相似文献
68.
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 相似文献
69.
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]. 相似文献
70.
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... 相似文献