全文获取类型
收费全文 | 1494篇 |
免费 | 40篇 |
国内免费 | 128篇 |
专业分类
化学 | 302篇 |
力学 | 42篇 |
综合类 | 4篇 |
数学 | 817篇 |
物理学 | 497篇 |
出版年
2024年 | 4篇 |
2023年 | 19篇 |
2022年 | 35篇 |
2021年 | 49篇 |
2020年 | 23篇 |
2019年 | 39篇 |
2018年 | 33篇 |
2017年 | 39篇 |
2016年 | 62篇 |
2015年 | 41篇 |
2014年 | 89篇 |
2013年 | 137篇 |
2012年 | 90篇 |
2011年 | 98篇 |
2010年 | 71篇 |
2009年 | 125篇 |
2008年 | 100篇 |
2007年 | 106篇 |
2006年 | 70篇 |
2005年 | 52篇 |
2004年 | 57篇 |
2003年 | 31篇 |
2002年 | 38篇 |
2001年 | 34篇 |
2000年 | 29篇 |
1999年 | 23篇 |
1998年 | 33篇 |
1997年 | 25篇 |
1996年 | 16篇 |
1995年 | 8篇 |
1994年 | 17篇 |
1993年 | 7篇 |
1992年 | 2篇 |
1991年 | 2篇 |
1990年 | 3篇 |
1989年 | 3篇 |
1988年 | 6篇 |
1987年 | 3篇 |
1986年 | 2篇 |
1985年 | 9篇 |
1984年 | 10篇 |
1983年 | 2篇 |
1981年 | 3篇 |
1980年 | 4篇 |
1979年 | 4篇 |
1978年 | 2篇 |
1977年 | 3篇 |
1976年 | 1篇 |
1974年 | 1篇 |
1970年 | 1篇 |
排序方式: 共有1662条查询结果,搜索用时 93 毫秒
1.
An Improved Gradient Projection-based Decomposition Technique for Support Vector Machines 总被引:2,自引:0,他引:2
Luca Zanni 《Computational Management Science》2006,3(2):131-145
In this paper we propose some improvements to a recent decomposition technique for the large quadratic program arising in
training support vector machines. As standard decomposition approaches, the technique we consider is based on the idea to
optimize, at each iteration, a subset of the variables through the solution of a quadratic programming subproblem. The innovative
features of this approach consist in using a very effective gradient projection method for the inner subproblems and a special
rule for selecting the variables to be optimized at each step. These features allow to obtain promising performance by decomposing
the problem into few large subproblems instead of many small subproblems as usually done by other decomposition schemes. We
improve this technique by introducing a new inner solver and a simple strategy for reducing the computational cost of each
iteration. We evaluate the effectiveness of these improvements by solving large-scale benchmark problems and by comparison
with a widely used decomposition package. 相似文献
2.
3.
For vector quasivariational inequalities involving multifunctions in topological vector spaces, an existence result is obtained without a monotonicity assumption and with a convergence assumption weaker than semicontinuity. A new type of quasivariational inequality is proposed. Applications to quasicomplementarity problems and traffic network equilibria are considered. In particular, definitions of weak and strong Wardrop equilibria are introduced for the case of multivalued cost functions. 相似文献
4.
Huseyin Ince 《Computational Management Science》2006,3(2):161-174
The nature of the financial time series is complex, continuous interchange of stochastic and deterministic regimes. Therefore,
it is difficult to forecast with parametric techniques. Instead of parametric models, we propose three techniques and compare
with each other. Neural networks and support vector regression (SVR) are two universally approximators. They are data-driven
non parametric models. ARCH/GARCH models are also investigated. Our assumption is that the future value of Istanbul Stock
Exchange 100 index daily return depends on the financial indicators although there is no known parametric model to explain
this relationship. This relationship comes from the technical analysis. Comparison shows that the multi layer perceptron networks
overperform the SVR and time series model (GARCH). 相似文献
5.
In this paper, the authors deal with bifunctions defined on complete metric spaces and with values in locally convex spaces ordered by closed convex cones. The aim is to provide a vector version of Ekeland’s theorem related to equilibrium problems. To prove this principle, a weak notion of continuity of a vector-valued function is considered, and some of its properties are presented. Via the vector Ekeland’s principle, existence results for vector equilibria are proved in both compact and noncompact domains. 相似文献
6.
In this paper, the notion of gap functions is extended from scalar case to vector one. Then, gap functions and generalized
functions for several kinds of vector equilibrium problems are shown. As an application, the dual problem of a class of optimization
problems with a system of vector equilibrium constraints (in short, OP) is established, the concavity of the dual function,
the weak duality of (OP) and the saddle point sufficient condition are derived by using generalized gap functions.
This work was supported by the National Natural Science Foundation of China (10671135) and the Applied Research Project of
Sichuan Province (05JY029-009-1). 相似文献
7.
Strong Vector Equilibrium Problems 总被引:3,自引:0,他引:3
Gong Xunhua 《Journal of Global Optimization》2006,36(3):339-349
In this paper, the existence of the solution for strong vector equilibrium problems is studied by using the separation theorem for convex sets. The arc-wise connectedness and the closedness of the strong solution set for vector equilibrium problems are discussed; and a necessary and sufficient condition for the strong solution is obtained. 相似文献
8.
梅家骝 《高校应用数学学报(A辑)》1989,4(4):541-549
本文讨论了笔者在[1]中提出的伪凸集,拟凸集的支撑函数与障碍锥的性质,并通过这些性质得出了二个闭性准则。 相似文献
9.
TAN Xiaojiang 《数学年刊B辑(英文版)》2002,23(4):531-538
Lei X be an arbitrary smooth irreducible complex projective curve, E (?) X a rank two vector bundle generated by its sections. The author first represents E as a triple {D1,D2,f}, where D1 , D2 are two effective divisors with d = deg(D1) + deg(D2), and f ∈ H0(X, [D1] |D2) is a collection of polynomials. E is the extension of [D2] by [D1] which is determined by f. By using f and the Brill-Noether matrix of D1 + D2, the author constructs a 2g X d matrix WE whose zero space gives Im{H0(X,[D1]) (?) H0(X, [D1] |D1)}(?)Im{H0(X, E) (?) H0(X,[D2]) (?) H0(X,[D2] |D2)}. From this and H0(X,E) = H0(X, [D1]) (?) Im{H0(X, E) (?) H0(X, [D2])}, it is got in particular that dimH0(X, E) = deg(E) - rank(WE) + 2. 相似文献
10.
本文我们利用一个可微函数给出了一对高阶对称规划问题 ,其中目标函数包含了Rn 中一紧凸集的支撑函数 .在引入高阶F 凸性 (F 伪凸性 ,F 拟凸性 )后 ,证明了高阶弱、高阶强及高阶逆对称对偶性质 . 相似文献