全文获取类型
收费全文 | 15366篇 |
免费 | 1576篇 |
国内免费 | 1580篇 |
专业分类
化学 | 2151篇 |
晶体学 | 34篇 |
力学 | 854篇 |
综合类 | 255篇 |
数学 | 12261篇 |
物理学 | 2967篇 |
出版年
2024年 | 39篇 |
2023年 | 183篇 |
2022年 | 174篇 |
2021年 | 288篇 |
2020年 | 335篇 |
2019年 | 386篇 |
2018年 | 396篇 |
2017年 | 453篇 |
2016年 | 516篇 |
2015年 | 377篇 |
2014年 | 669篇 |
2013年 | 1203篇 |
2012年 | 710篇 |
2011年 | 768篇 |
2010年 | 712篇 |
2009年 | 908篇 |
2008年 | 987篇 |
2007年 | 1048篇 |
2006年 | 940篇 |
2005年 | 882篇 |
2004年 | 740篇 |
2003年 | 662篇 |
2002年 | 702篇 |
2001年 | 599篇 |
2000年 | 550篇 |
1999年 | 559篇 |
1998年 | 444篇 |
1997年 | 400篇 |
1996年 | 314篇 |
1995年 | 218篇 |
1994年 | 188篇 |
1993年 | 143篇 |
1992年 | 133篇 |
1991年 | 109篇 |
1990年 | 83篇 |
1989年 | 66篇 |
1988年 | 64篇 |
1987年 | 59篇 |
1986年 | 53篇 |
1985年 | 80篇 |
1984年 | 77篇 |
1983年 | 29篇 |
1982年 | 54篇 |
1981年 | 31篇 |
1980年 | 42篇 |
1979年 | 39篇 |
1978年 | 26篇 |
1977年 | 24篇 |
1976年 | 18篇 |
1974年 | 10篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
91.
92.
Linear complexity and linear complexity profile are important characteristics of a sequence for applications in cryptography
and Monte-Carlo methods.
The nonlinear congruential method is an attractive alternative to the classical linear congruential method for pseudorandom
number generation.
Recently, a weak lower bound on the linear complexity profile of a general nonlinear congruential pseudorandom number generator
was proven by Gutierrez, Shparlinski and the first author. For most nonlinear generators a much stronger lower bound is expected.
Here, we obtain a much stronger lower bound on the linear complexity profile of nonlinear congruential pseudorandom number
generators with Dickson polynomials. 相似文献
93.
利用Ditzian-Totik光滑模,研究了推广的Kantorovich算子在Ba空间中的逼近,得到逼近的正定理与等价定理.所得结果改进、推广和统一了一些作者的结果. 相似文献
94.
Frank Morgan 《Annals of Global Analysis and Geometry》2006,30(1):73-79
In a product M
1 × M
2 of Riemannian manifolds, the least perimeter required to enclose given volume among general regions is at least 1/√ 2 times that among regions of product form, assuming that the isoperimetric profiles of M
1 and M
2 are concave. This result sharpens earlier work of Grigor'yan, generalizes results of Bollobás and Leader and of Barthe, and yields a lower bound on the Cheeger isoperimetric constant of a product. 相似文献
95.
We introduce the notion of n-nuanced MV-algebra by performing a Łukasiewicz–Moisil nuancing construction on top of MV-algebras. These structures extend both MV-algebras and Łukasiewicz–Moisil algebras, thus unifying two important types of structures in the algebra of logic. On a logical level, n-nuanced MV-algebras amalgamate two distinct approaches to many valuedness: that of the infinitely valued Łukasiewicz logic, more related in spirit to the fuzzy approach, and that of Moisil n-nuanced logic, which is more concerned with nuances of truth rather than truth degree. We study n-nuanced MV-algebras mainly from the algebraic and categorical points of view, and also consider some basic model-theoretic aspects. The relationship with a suitable notion of n-nuanced ordered group via an extension of the Γ construction is also analyzed. 相似文献
96.
全生寅 《数学的实践与认识》2006,36(1):253-256
证明了线性规划的K uhn-Tucker条件蕴含着它的对偶问题,解释了L agrange乘子的意义.进而显示了K-T条件中的互补松驰性与对偶线性规划的互补松紧定理之间的联系. 相似文献
97.
利用已知弹性函数级联上高非线性度多输出布尔函数的方法构造(n,m,t)弹性函数,其非线性度为2^n-1-2^n-l/2-1+2^l/2.nlmax(n-l,m,t),在相同条件下改进了Kurosawa的非线性度2^n-1-2^n-l/2-1.特别地,本文构造了两类具体的向量弹性函数,得到两个不同的非线性度.本文所得函数的非线性度在大多数情况下是比较好的. 相似文献
98.
99.
Hadi Mohammadi Bidhandi 《Annals of Operations Research》2006,143(1):237-250
This paper develops a mathematical model for project time compression problems in CPM/PERT type networks. It is noted this
formulation of the problem will be an adequate approximation for solving the time compression problem with any continuous
and non-increasing time-cost curve. The kind of this model is Mixed Integer Linear Program (MILP) with zero-one variables,
and the Benders' decomposition procedure for analyzing this model has been developed. Then this paper proposes a new approach
based on the surrogating method for solving these problems. In addition, the required computer programs have been prepared
by the author to execute the algorithm. An illustrative example solved by the new algorithm, and two methods are compared
by several numerical examples. Computational experience with these data shows the superiority of the new approach. 相似文献
100.
The objective of this paper is to analyze under what well-known operations the class of quasipolyhedral convex functions,
which can be regarded as an extension of that of polyhedral convex functions, is closed. The operations that will be considered
are those that preserve polyhedral convexity, such that the image and the inverse image under linear transformations, right
scalar multiplication (including the case where λ=0+) and pointwise addition.
相似文献