全文获取类型
收费全文 | 2122篇 |
免费 | 124篇 |
国内免费 | 33篇 |
专业分类
化学 | 72篇 |
晶体学 | 1篇 |
力学 | 40篇 |
综合类 | 13篇 |
数学 | 1846篇 |
物理学 | 307篇 |
出版年
2023年 | 23篇 |
2022年 | 65篇 |
2021年 | 86篇 |
2020年 | 64篇 |
2019年 | 64篇 |
2018年 | 50篇 |
2017年 | 47篇 |
2016年 | 80篇 |
2015年 | 52篇 |
2014年 | 82篇 |
2013年 | 200篇 |
2012年 | 72篇 |
2011年 | 103篇 |
2010年 | 94篇 |
2009年 | 102篇 |
2008年 | 112篇 |
2007年 | 94篇 |
2006年 | 75篇 |
2005年 | 69篇 |
2004年 | 53篇 |
2003年 | 64篇 |
2002年 | 42篇 |
2001年 | 54篇 |
2000年 | 50篇 |
1999年 | 41篇 |
1998年 | 45篇 |
1997年 | 20篇 |
1996年 | 25篇 |
1995年 | 25篇 |
1994年 | 27篇 |
1993年 | 12篇 |
1992年 | 21篇 |
1991年 | 21篇 |
1990年 | 22篇 |
1989年 | 16篇 |
1988年 | 21篇 |
1987年 | 25篇 |
1986年 | 18篇 |
1985年 | 21篇 |
1984年 | 19篇 |
1983年 | 4篇 |
1982年 | 14篇 |
1981年 | 12篇 |
1980年 | 14篇 |
1979年 | 17篇 |
1978年 | 6篇 |
1977年 | 7篇 |
1976年 | 18篇 |
1974年 | 5篇 |
1973年 | 3篇 |
排序方式: 共有2279条查询结果,搜索用时 18 毫秒
1.
《Physics letters. A》2020,384(35):126904
Exploring the evolution of cooperation has been one of the most challenging topics and attracted increasing attention in various realms. Hereby, we institute an analytic model where the relationship between the common benefits and contributions is the typical saturation nonlinearity. We investigate the evolutionary dynamics of cooperation with and without consensual incentives respectively. The population always evolves to full defection when the incentives are absent. Cooperation, however, can be promoted by consensual incentives when the degree of cooperators' preferences for incentives is great. There exists an intermediate amount of resources at which the positive effect of consensual incentives on cooperation is minimized. Furthermore, there is a U-shape relationship between the degree of cooperators' preference for an incentive and the evolution of cooperation. A greater basin of full cooperation can be induced when the cooperators' preference for reward is more pronounced than that for punishment. 相似文献
2.
Dean A. Carlson 《Journal of Mathematical Analysis and Applications》2002,276(2):561-588
The method of equivalent variational methods, originally due to Carathéodory for free problems in the calculus of variations is extended to investigate feedback Nash equilibria for a class of n-person differential games. Both the finite-horizon and infinite-horizon cases are considered. Examples are given to illustrate the presented results. 相似文献
3.
4.
Differential game formulations provide an adequate basis for a guidance law synthesis against highly maneuvering targets. This paper deals with a guidance law based on a linear-quadratic differential game formulation. This guidance law has many attractive properties: it is continuous, linear with respect to the state variables, and its gain coefficients can be precalculated offline. Nevertheless, due to the lack of hard control constraints in the formulation, the magnitude of the control can exceed the admissible level imposed by the nature of the problem. In this paper, the upper bound of the interceptor control is obtained depending on the system parameters and the penalty coefficients of the game performance index. It is shown that the interceptor can guarantee an arbitrarily small miss distance without exceeding the control constraints if it has sufficient maneuverability and if the penalty coefficients are chosen properly. By manipulating the penalty coefficients, it is possible to reduce significantly the maneuverability requirements compared to the case of zero interceptor penalty coefficient. 相似文献
5.
Defining speed of diffusion as the amount of time it takes to get from one penetration level to a higher one, we introduce a dynamic model in which we study the link between pricing policy, speed of diffusion, and number of competitors in the market. Our analysis shows that, in the case of strategic (oligopolistic) competition, the speed of diffusion has an important influence on the optimal pricing policy. In particular, we find that higher speeds of diffusion create an incentive to strategically interacting firms to lower their prices. 相似文献
6.
本文提出了一类特殊的n人合作对策模型─—弱1—凸对策,研究了弱1—凸对策的解的性质,并证明弱1—凸对策的解满足所有常见的公理化特征. 相似文献
7.
In this note we study uncertainty sequencing situations, i.e., one-machine sequencing situations in which no initial order
is specified. We associate cooperative games with these sequencing situations, study their core, and provide links with the
classic sequencing games introduced by Curiel et al. (Eur J Oper Res 40:344–351, 1989). Moreover, we propose and characterize
two simple cost allocation rules for uncertainty sequencing situations with equal processing times. 相似文献
8.
P. Q. Khanh 《Journal of Optimization Theory and Applications》1995,87(2):359-378
We prove the Kuhn-Tucker sufficient optimality condition, the Wolfe duality, and a modified Mond-Weir duality for vector optimization problems involving various types of invex-convexlike functions. The class of such functins contains many known generalized convex functions. As applications, we demonstrate that, under invex-convexlikeness assumptions, the Pontryagin maximum principle is a sufficient optimality condition for cooperative differential games. The Wolfe duality is established for these games.The author is indebted to the referees and Professor W. Stadler for valuable remarks and comments, which have been used to revise considerably the paper. 相似文献
9.
Some properties of the bilevel programming problem 总被引:8,自引:0,他引:8
J. F. Bard 《Journal of Optimization Theory and Applications》1991,68(2):371-378
The purpose of this paper is to elaborate on the difficulties accompanying the development of efficient algorithms for solving the bilevel programming problem (BLPP). We begin with a pair of examples showing that, even under the best of circumstances, solutions may not exist. This is followed by a proof that the BLPP is NP-hard.This work was partially supported by a grant from the Advanced Research Program of the Texas Higher Education Coordinating Board. 相似文献
10.
Dan Hefetz Michael Krivelevich Tibor Szabó 《Journal of Combinatorial Theory, Series A》2007,114(5):840-853
Let p and q be positive integers and let H be any hypergraph. In a (p,q,H) Avoider-Enforcer game two players, called Avoider and Enforcer, take turns selecting previously unclaimed vertices of H. Avoider selects p vertices per move and Enforcer selects q vertices per move. Avoider loses if he claims all the vertices of some hyperedge of H; otherwise Enforcer loses. We prove a sufficient condition for Avoider to win the (p,q,H) game. We then use this condition to show that Enforcer can win the (1,q) perfect matching game on K2n for every q?cn/logn for an appropriate constant c, and the (1,q) Hamilton cycle game on Kn for every q?cnloglogloglogn/lognlogloglogn for an appropriate constant c. We also determine exactly those values of q for which Enforcer can win the (1,q) connectivity game on Kn. This result is quite surprising as it substantially differs from its Maker-Breaker analog. Our method extends easily to improve a result of Lu [X. Lu, A note on biased and non-biased games, Discrete Appl. Math. 60 (1995) 285-291], regarding forcing an opponent to pack many pairwise edge disjoint spanning trees in his graph. 相似文献