全文获取类型
收费全文 | 1362篇 |
免费 | 49篇 |
国内免费 | 106篇 |
专业分类
化学 | 110篇 |
力学 | 24篇 |
综合类 | 30篇 |
数学 | 626篇 |
物理学 | 86篇 |
综合类 | 641篇 |
出版年
2024年 | 7篇 |
2023年 | 14篇 |
2022年 | 15篇 |
2021年 | 20篇 |
2020年 | 15篇 |
2019年 | 25篇 |
2018年 | 17篇 |
2017年 | 25篇 |
2016年 | 35篇 |
2015年 | 26篇 |
2014年 | 67篇 |
2013年 | 70篇 |
2012年 | 80篇 |
2011年 | 92篇 |
2010年 | 73篇 |
2009年 | 85篇 |
2008年 | 73篇 |
2007年 | 84篇 |
2006年 | 73篇 |
2005年 | 63篇 |
2004年 | 58篇 |
2003年 | 69篇 |
2002年 | 53篇 |
2001年 | 50篇 |
2000年 | 41篇 |
1999年 | 34篇 |
1998年 | 27篇 |
1997年 | 41篇 |
1996年 | 33篇 |
1995年 | 23篇 |
1994年 | 22篇 |
1993年 | 13篇 |
1992年 | 10篇 |
1991年 | 16篇 |
1990年 | 11篇 |
1989年 | 8篇 |
1988年 | 8篇 |
1987年 | 4篇 |
1986年 | 2篇 |
1985年 | 7篇 |
1984年 | 6篇 |
1983年 | 2篇 |
1982年 | 4篇 |
1981年 | 3篇 |
1980年 | 4篇 |
1979年 | 5篇 |
1978年 | 3篇 |
1974年 | 1篇 |
排序方式: 共有1517条查询结果,搜索用时 15 毫秒
101.
利用标量化方法建立对称向量拟均衡问题有效解的存在性定理.作为标量化方法的应用,利用这一方法得到向量变分不等式和拟向量变分不等式有效解的存在性定理. 相似文献
102.
集值映射向量优化问题的ε—超有效解 总被引:4,自引:1,他引:4
本文引进了集值映射向量优化问题的ε-超有效解概念,并在集值映射为近似广义锥次似凸的假设下,建立了关于ε-超有效解的标量化定理和Lagrange乘子定理。 相似文献
103.
On the Computation of Square Roots in Finite Fields 总被引:1,自引:0,他引:1
Siguna Müller 《Designs, Codes and Cryptography》2004,31(3):301-312
In this paper, two improvements for computing square roots in finite fields are presented. Firstly, we give a simple extension of a method by O. Atkin, which requires two exponentiations in FM
q
, when q9 mod 16. Our second method gives a major improvement to the Cipolla–Lehmer algorithm, which is both easier to implement and also much faster. While our method is independent of the power of 2 in q–1, its expected running time is equivalent to 1.33 as many multiplications as exponentiation via square and multiply. Several numerical examples are given that show the speed-up of the proposed methods, compared to the routines employed by Mathematica, Maple, respectively Magma. 相似文献
104.
Lihong Wang 《Annals of the Institute of Statistical Mathematics》2004,56(2):251-264
The purpose of this paper is to investigate the asymptotic properties of the least squares estimates (L
2-estimates) and the least absolute deviation estimates (L
1-estimates) of the parameters of a nonlinear regression model subject to a set of equality and inequality restrictions, which
has a long-range dependent stationary process as its stochastic errors. Then we will compare the asymptotic relative efficiencies
of the above estimators. 相似文献
105.
This paper introduces a new class of non-convex vector functions strictly larger than that of P-quasiconvexity, with P m being the underlying ordering cone, called semistrictly ( m\ –int P)-quasiconvex functions. This notion allows us to unify various results on existence of weakly efficient (weakly Pareto) optima. By imposing a coercivity condition we establish also the compactness of the set of weakly Pareto solutions. In addition, we provide various characterizations for the non-emptiness, convexity and compactness of the solution set for a subclass of quasiconvex vector optimization problems on the real-line. Finally, it is also introduced the notion of explicit ( m\ –int P)-quasiconvexity (equivalently explicit (int P)-quasiconvexity) which plays the role of explicit quasiconvexity (quasiconvexity and semistrict quasiconvexity) of real-valued functions.Acknowldegements.The author wishes to thank both referees for their careful reading of the paper, their comments, remarks, helped to improve the presentation of some results. One of the referee provided the references [5, 6] and indirectly [20]. 相似文献
106.
本文研究拓扑空间中锥拟凸多目标优化问题的有效解集的连通性.在目标映射是上连续和拟凸(次严格拟凸)的条件下,证明了锥弱有效(有效)解集是连通的.进一步,在是连续和强拟凸的条件下,证明了锥有效解集是路连通的. 相似文献
107.
基于条件VaR(CVaR)的投资组合优化模型及比较研究 总被引:6,自引:0,他引:6
在总结投资组合优化模型的基础上 ,详细分析了 Va R和 CVa R的概念及重要性质 ,分析了将 Va R和 CVa R应用于决策问题的处理技巧 .针对传统均值—方差模型 ,提出不考虑各种限定条件的基于条件Va R( CVa R)的投资组合优化模型以及考虑限定条件的一般模型 .针对模型的适用性 ,详细比较了 CVa R模型和均值—方差模型的应用复杂性 ,并利用实际数据进行了对比 . 相似文献
108.
109.
We examine a single machine scheduling problem with random processing times and deadline. Given a set of independent jobs having specified initiation costs and terminal revenues, the objective is to select a subset of the jobs and sequence the selected jobs such that the expected profit is maximized. The job selection aspect considered by us marks a clear departure from the pure sequencing focus found in the traditional scheduling literature. In this paper, we assume an exponentially distributed deadline and do not allow preemption. Even under these conditions, the selection and sequencing problem remains quite difficult (unlike its pure sequencing counterpart); we in fact conjecture that the problem is NP-hard. However, we show that the problem can be efficiently solved as long as the cost parameter is agreeable or an approximate solution is acceptable. To this end, we describe several solution properties, present dynamic programming algorithms (one of which exhibits a pseudo-polynomial time worst-case complexity), and propose a fully-polynomial time approximation scheme. In addition, we study a number of special cases which can be solved in polynomial time. Finally, we summarize our work and discuss an extension where the jobs are precedence related. 相似文献
110.