全文获取类型
收费全文 | 10310篇 |
免费 | 988篇 |
国内免费 | 829篇 |
专业分类
化学 | 1576篇 |
晶体学 | 23篇 |
力学 | 750篇 |
综合类 | 161篇 |
数学 | 7309篇 |
物理学 | 2308篇 |
出版年
2024年 | 18篇 |
2023年 | 85篇 |
2022年 | 107篇 |
2021年 | 175篇 |
2020年 | 201篇 |
2019年 | 232篇 |
2018年 | 223篇 |
2017年 | 273篇 |
2016年 | 332篇 |
2015年 | 242篇 |
2014年 | 461篇 |
2013年 | 798篇 |
2012年 | 519篇 |
2011年 | 505篇 |
2010年 | 491篇 |
2009年 | 588篇 |
2008年 | 635篇 |
2007年 | 639篇 |
2006年 | 597篇 |
2005年 | 566篇 |
2004年 | 476篇 |
2003年 | 431篇 |
2002年 | 437篇 |
2001年 | 408篇 |
2000年 | 345篇 |
1999年 | 356篇 |
1998年 | 291篇 |
1997年 | 260篇 |
1996年 | 224篇 |
1995年 | 178篇 |
1994年 | 141篇 |
1993年 | 111篇 |
1992年 | 111篇 |
1991年 | 93篇 |
1990年 | 68篇 |
1989年 | 57篇 |
1988年 | 43篇 |
1987年 | 53篇 |
1986年 | 46篇 |
1985年 | 54篇 |
1984年 | 56篇 |
1983年 | 20篇 |
1982年 | 39篇 |
1981年 | 19篇 |
1980年 | 25篇 |
1979年 | 25篇 |
1978年 | 15篇 |
1977年 | 15篇 |
1976年 | 13篇 |
1974年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 46 毫秒
71.
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. 相似文献
72.
全生寅 《数学的实践与认识》2006,36(1):253-256
证明了线性规划的K uhn-Tucker条件蕴含着它的对偶问题,解释了L agrange乘子的意义.进而显示了K-T条件中的互补松驰性与对偶线性规划的互补松紧定理之间的联系. 相似文献
73.
利用已知弹性函数级联上高非线性度多输出布尔函数的方法构造(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.特别地,本文构造了两类具体的向量弹性函数,得到两个不同的非线性度.本文所得函数的非线性度在大多数情况下是比较好的. 相似文献
74.
75.
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. 相似文献
76.
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.
相似文献
77.
A. A. Maleev 《Computational Mathematics and Mathematical Physics》2006,46(12):2031-2039
Stationary and nonstationary Jacobi-like iterative processes for solving systems of linear algebraic equations are examined. For a system whose coefficient matrix A is an H-matrix, it is shown that the convergence rate of any Jacobi-like process is at least as high as that of the point Jacobi method as applied to a system with 〈A〉 as the coefficient matrix, where 〈A〉 is a comparison matrix of A. 相似文献
78.
79.
Patrizio Frosini 《Geometriae Dedicata》2004,108(1):105-110
In this paper we prove that for every real-valued Morse function φ on a smooth closed manifold ℳ and every neighborhood U of its critical points a suitable Riemannian metric μ
U
exists such that φ is linear outside
U 相似文献
80.
This paper develops a theory for the global solution of nonconvex optimization problems with parameter-embedded linear dynamic systems. A quite general problem formulation is introduced and a solution is shown to exists. A convexity theory for integrals is then developed to construct convex relaxations for utilization in a branch-and-bound framework to calculate a global minimum. Interval analysis is employed to generate bounds on the state variables implied by the bounds on the embedded parameters. These bounds, along with basic integration theory, are used to prove convergence of the branch-and-bound algorithm to the global minimum of the optimization problem. The implementation of the algorithm is then considered and several numerical case studies are examined thoroughly 相似文献