全文获取类型
收费全文 | 11159篇 |
免费 | 303篇 |
国内免费 | 215篇 |
专业分类
化学 | 1734篇 |
晶体学 | 16篇 |
力学 | 340篇 |
综合类 | 42篇 |
数学 | 7946篇 |
物理学 | 1599篇 |
出版年
2024年 | 26篇 |
2023年 | 101篇 |
2022年 | 174篇 |
2021年 | 297篇 |
2020年 | 354篇 |
2019年 | 231篇 |
2018年 | 302篇 |
2017年 | 444篇 |
2016年 | 408篇 |
2015年 | 461篇 |
2014年 | 763篇 |
2013年 | 843篇 |
2012年 | 640篇 |
2011年 | 657篇 |
2010年 | 608篇 |
2009年 | 585篇 |
2008年 | 475篇 |
2007年 | 510篇 |
2006年 | 559篇 |
2005年 | 347篇 |
2004年 | 198篇 |
2003年 | 207篇 |
2002年 | 247篇 |
2001年 | 271篇 |
2000年 | 104篇 |
1999年 | 242篇 |
1998年 | 159篇 |
1997年 | 138篇 |
1996年 | 165篇 |
1995年 | 64篇 |
1994年 | 49篇 |
1993年 | 58篇 |
1992年 | 72篇 |
1991年 | 39篇 |
1990年 | 57篇 |
1989年 | 43篇 |
1988年 | 192篇 |
1987年 | 251篇 |
1986年 | 72篇 |
1985年 | 38篇 |
1984年 | 49篇 |
1983年 | 33篇 |
1982年 | 27篇 |
1981年 | 18篇 |
1980年 | 27篇 |
1979年 | 12篇 |
1978年 | 16篇 |
1977年 | 8篇 |
1976年 | 10篇 |
1974年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
991.
The purpose of the paper is to propose a bargaining game to interpret the kernel non-cooperatively. Based on the idea of the Davis-Maschler reduced game, a bilateral bargaining procedure is provided in our game model. We show that the set of all subgame perfect equilibrium outcomes of our non-cooperative game coincides with the kernel for transferable utility games. 相似文献
992.
Ouayl Chadli Qamrul Hasan Ansari Suliman Al-Homidan 《Journal of Optimization Theory and Applications》2017,172(3):726-758
The main goal of this paper is to introduce and study bilevel vector equilibrium problems. We first establish some existence results for solutions of vector equilibrium problems and mixed vector equilibrium problems. We study the existence of solutions of bilevel vector equilibrium problems by considering a vector Thikhonov-type regularization procedure. By using this regularization procedure and existence results for mixed vector equilibrium problems, we establish some existence results for solutions of bilevel vector equilibrium problems. By using the auxiliary principle, we propose an algorithm for finding the approximate solutions of bilevel vector equilibrium problems. The strong convergence of the proposed algorithm is also studied. 相似文献
993.
Le Quang Thuy Bui Thi Thanh Nguyen Thi Toan 《Journal of Optimization Theory and Applications》2017,173(2):421-442
Motivated by our recent works on optimality conditions in discrete optimal control problems under a nonconvex cost function, in this paper, we study second-order necessary and sufficient optimality conditions for a discrete optimal control problem with a nonconvex cost function and state-control constraints. By establishing an abstract result on second-order optimality conditions for a mathematical programming problem, we derive second-order necessary and sufficient optimality conditions for a discrete optimal control problem. Using a common critical cone for both the second-order necessary and sufficient optimality conditions, we obtain “no-gap” between second-order optimality conditions. 相似文献
994.
Charl Ras Konrad Swanepoel Doreen Anne Thomas 《Journal of Optimization Theory and Applications》2017,172(3):845-873
An approximate Steiner tree is a Steiner tree on a given set of terminals in Euclidean space such that the angles at the Steiner points are within a specified error from \(120^{\circ }\). This notion arises in numerical approximations of minimum Steiner trees. We investigate the worst-case relative error of the length of an approximate Steiner tree compared to the shortest tree with the same topology. It has been conjectured that this relative error is at most linear in the maximum error at the angles, independent of the number of terminals. We verify this conjecture for the two-dimensional case as long as the maximum angle error is sufficiently small in terms of the number of terminals. In the two-dimensional case we derive a lower bound for the relative error in length. This bound is linear in terms of the maximum angle error when the angle error is sufficiently small in terms of the number of terminals. We find improved estimates of the relative error in length for larger values of the maximum angle error and calculate exact values in the plane for three and four terminals. 相似文献
995.
Very large nonlinear unconstrained binary optimization problems arise in a broad array of applications. Several exact or heuristic techniques have proved quite successful for solving many of these problems when the objective function is a quadratic polynomial. However, no similarly efficient methods are available for the higher degree case. Since high degree objectives are becoming increasingly important in certain application areas, such as computer vision, various techniques have been recently developed to reduce the general case to the quadratic one, at the cost of increasing the number of variables by introducing additional auxiliary variables. In this paper we initiate a systematic study of these quadratization approaches. We provide tight lower and upper bounds on the number of auxiliary variables needed in the worst-case for general objective functions, for bounded-degree functions, and for a restricted class of quadratizations. Our upper bounds are constructive, thus yielding new quadratization procedures. Finally, we completely characterize all “minimal” quadratizations of negative monomials. 相似文献
996.
997.
Rui Shen Zhiqing Meng Chuangyin Dang Min Jiang 《Numerical Functional Analysis & Optimization》2017,38(11):1473-1489
In this paper, an algorithm of barrier objective penalty function for inequality constrained optimization is studied and a conception–the stability of barrier objective penalty function is presented. It is proved that an approximate optimal solution may be obtained by solving a barrier objective penalty function for inequality constrained optimization problem when the barrier objective penalty function is stable. Under some conditions, the stability of barrier objective penalty function is proved for convex programming. Specially, the logarithmic barrier function of convex programming is stable. Based on the barrier objective penalty function, an algorithm is developed for finding an approximate optimal solution to an inequality constrained optimization problem and its convergence is also proved under some conditions. Finally, numerical experiments show that the barrier objective penalty function algorithm has better convergence than the classical barrier function algorithm. 相似文献
998.
We introduce the concept of cumulative Parisian ruin, which is based on the time spent in the red by the underlying surplus process. Our main result is an explicit representation for the distribution of the occupation time, over a finite-time horizon, for a compound Poisson process with drift and exponential claims. The Brownian ruin model is also studied in details. Finally, we analyse for a general framework the relationships between cumulative Parisian ruin and classical ruin, as well as with Parisian ruin based on exponential implementation delays. 相似文献
999.
1000.
We introduce a new solution concept for -person bargaining problems, which can be considered as the dual of the Equal-Area solution (EA) (see Anbarc? and Bigelow (1994)). Hence, we call it the Dual Equal-Area solution (DEA). We show that the point selected by the Kalai–Smorodinsky solution (see Kalai and Smorodinsky (1975)) lies in between those that are selected by EA and DEA. We formulate an axiom–area-based fairness–and offer three characterizations of the Kalai–Smorodinsky solution in which this axiom plays a central role. 相似文献