全文获取类型
收费全文 | 1028篇 |
免费 | 78篇 |
国内免费 | 38篇 |
专业分类
化学 | 175篇 |
晶体学 | 1篇 |
力学 | 43篇 |
综合类 | 18篇 |
数学 | 652篇 |
物理学 | 92篇 |
无线电 | 163篇 |
出版年
2023年 | 8篇 |
2022年 | 16篇 |
2021年 | 18篇 |
2020年 | 21篇 |
2019年 | 30篇 |
2018年 | 27篇 |
2017年 | 34篇 |
2016年 | 35篇 |
2015年 | 26篇 |
2014年 | 45篇 |
2013年 | 79篇 |
2012年 | 53篇 |
2011年 | 43篇 |
2010年 | 39篇 |
2009年 | 54篇 |
2008年 | 57篇 |
2007年 | 48篇 |
2006年 | 54篇 |
2005年 | 41篇 |
2004年 | 31篇 |
2003年 | 31篇 |
2002年 | 23篇 |
2001年 | 29篇 |
2000年 | 28篇 |
1999年 | 29篇 |
1998年 | 25篇 |
1997年 | 22篇 |
1996年 | 16篇 |
1995年 | 9篇 |
1994年 | 18篇 |
1993年 | 14篇 |
1992年 | 15篇 |
1991年 | 14篇 |
1990年 | 13篇 |
1989年 | 7篇 |
1988年 | 15篇 |
1987年 | 6篇 |
1986年 | 4篇 |
1985年 | 3篇 |
1984年 | 7篇 |
1983年 | 2篇 |
1982年 | 9篇 |
1981年 | 5篇 |
1980年 | 5篇 |
1979年 | 4篇 |
1978年 | 5篇 |
1977年 | 14篇 |
1976年 | 6篇 |
1974年 | 4篇 |
1971年 | 1篇 |
排序方式: 共有1144条查询结果,搜索用时 250 毫秒
71.
72.
This paper addresses itself to the algorithm for minimizing the product of two nonnegative convex functions over a convex set. It is shown that the global minimum of this nonconvex problem can be obtained by solving a sequence of convex programming problems. The basic idea of this algorithm is to embed the original problem into a problem in a higher dimensional space and to apply a branch-and-bound algorithm using an underestimating function. Computational results indicate that our algorithm is efficient when the objective function is the product of a linear and a quadratic functions and the constraints are linear. An extension of our algorithm for minimizing the sum of a convex function and a product of two convex functions is also discussed. 相似文献
73.
To achieve robustness against the outliers or heavy-tailed sampling distribution, we consider an Ivanov regularized empirical risk minimization scheme associated with a modified Huber's loss for nonparametric regression in reproducing kernel Hilbert space. By tuning the scaling and regularization parameters in accordance with the sample size, we develop nonasymptotic concentration results for such an adaptive estimator. Specifically, we establish the best convergence rates for prediction error when the conditional distribution satisfies a weak moment condition. 相似文献
74.
Patrizio Neff 《Mathematical Methods in the Applied Sciences》2005,28(9):1031-1060
We prove the local existence and uniqueness to a geometrically exact, observer‐invariant membrane‐plate model introduced by the author. The model consists of an elliptic partial differential system of equations describing the equilibrium response of the membrane which is non‐linearly coupled with a viscoelastic evolution equation for exact rotations, taking on the role of an orthonormal triad of directors. This coupling introduces a viscoelastic transverse shear resistance. Refined elliptic regularity results together with a new extended Korn's first inequality for plates and shells allow to proceed by a fixed point argument in appropriately chosen Sobolev‐spaces in order to prove existence and uniqueness. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
75.
Equivalence of the generalized complementarity problem to differentiable unconstrained minimization 总被引:4,自引:0,他引:4
We consider an unconstrained minimization reformulation of the generalized complementarity problem (GCP). The merit function introduced here is differentiable and has the property that its global minimizers coincide with the solutions of GCP. Conditions for its stationary points to be global minimizers are given. Moreover, it is shown that the level sets of the merit function are bounded under suitable assumptions. We also show that the merit function provides global error bounds for GCP. These results are based on a condition which reduces to the condition of the uniform P-function when GCP is specialized to the nonlinear complementarity problem. This condition also turns out to be useful in proving the existence and uniqueness of a solution for GCP itself. Finally, we obtain as a byproduct an error bound result with the natural residual for GCP.We thank Jong-Shi Pang for his valuable comments on error bound results with the natural residual for the nonlinear complementarity problem. We are also grateful to the anonymous referees for some helpful comments. The research of the second author was supported in part by the Science Research Grant-in-Aid from the Ministry of Education, Science, and Culture, Japan. 相似文献
76.
首先将一个具有多个约束的规划问题转化为一个只有一个约束的规划问题,然后通过利用这个单约束的规划问题,对原来的多约束规划问题提出了一些凸化、凹化的方法,这样这些多约束的规划问题可以被转化为一些凹规划、反凸规划问题.最后,还证明了得到的凹规划和反凸规划的全局最优解就是原问题的近似全局最优解. 相似文献
77.
A simplicial branch and bound-outer approximation technique for solving nonseparable, nonlinearly constrained concave minimization problems is proposed which uses a new simplicial cover rather than classical simplicial partitions. Some geometric properties and convergence results are demonstrated. A report on numerical aspects and experiments is given which shows that the most promising variant of the cover technique can be expected to be more efficient than comparable previous simplicial procedures. 相似文献
78.
H. P. Benson 《Journal of Optimization Theory and Applications》2007,135(1):1-17
This article presents an algorithm for globally solving a sum of ratios fractional programming problem. To solve this problem,
the algorithm globally solves an equivalent concave minimization problem via a branch-and-bound search. The main work of the
algorithm involves solving a sequence of convex programming problems that differ only in their objective function coefficients.
Therefore, to solve efficiently these convex programming problems, an optimal solution to one problem can potentially be used
to good advantage as a starting solution to the next problem. 相似文献
79.
We study some minimization problems for Hamiltonian stationaryLagrangian surfaces in R4. We show that the flat Lagrangian torusS
1 × S
1 minimizes the Willmore functional among Hamiltonianstationary tori of its isotopy class, which gives a new proof of thefact that it is area minimizing in the same class. Considering theLagrangian flat cylinder as a torus in some quotient space R4/v Z, we show that it is also area minimizing in its isotopy class. 相似文献
80.
The paper studies a train scheduling problem faced by railway infrastructure managers during real-time traffic control. When train operations are perturbed, a new conflict-free timetable of feasible arrival and departure times needs to be re-computed, such that the deviation from the original one is minimized. The problem can be viewed as a huge job shop scheduling problem with no-store constraints. We make use of a careful estimation of time separation among trains, and model the scheduling problem with an alternative graph formulation. We develop a branch and bound algorithm which includes implication rules enabling to speed up the computation. An experimental study, based on a bottleneck area of the Dutch rail network, shows that a truncated version of the algorithm provides proven optimal or near optimal solutions within short time limits. 相似文献