全文获取类型
收费全文 | 3242篇 |
免费 | 764篇 |
国内免费 | 64篇 |
专业分类
化学 | 444篇 |
力学 | 38篇 |
综合类 | 26篇 |
数学 | 1800篇 |
物理学 | 331篇 |
无线电 | 1431篇 |
出版年
2024年 | 6篇 |
2023年 | 42篇 |
2022年 | 134篇 |
2021年 | 161篇 |
2020年 | 185篇 |
2019年 | 162篇 |
2018年 | 158篇 |
2017年 | 153篇 |
2016年 | 177篇 |
2015年 | 177篇 |
2014年 | 298篇 |
2013年 | 290篇 |
2012年 | 259篇 |
2011年 | 270篇 |
2010年 | 235篇 |
2009年 | 182篇 |
2008年 | 161篇 |
2007年 | 189篇 |
2006年 | 152篇 |
2005年 | 118篇 |
2004年 | 88篇 |
2003年 | 74篇 |
2002年 | 55篇 |
2001年 | 47篇 |
2000年 | 50篇 |
1999年 | 30篇 |
1998年 | 30篇 |
1997年 | 16篇 |
1996年 | 21篇 |
1995年 | 19篇 |
1994年 | 15篇 |
1993年 | 11篇 |
1992年 | 18篇 |
1991年 | 7篇 |
1990年 | 7篇 |
1989年 | 5篇 |
1988年 | 5篇 |
1987年 | 4篇 |
1986年 | 3篇 |
1985年 | 9篇 |
1984年 | 8篇 |
1983年 | 6篇 |
1982年 | 11篇 |
1981年 | 4篇 |
1980年 | 3篇 |
1979年 | 4篇 |
1977年 | 2篇 |
1976年 | 5篇 |
1970年 | 1篇 |
1957年 | 1篇 |
排序方式: 共有4070条查询结果,搜索用时 78 毫秒
1.
Claudius Gros 《Entropy (Basel, Switzerland)》2021,23(2)
Human societies are characterized by three constituent features, besides others. (A) Options, as for jobs and societal positions, differ with respect to their associated monetary and non-monetary payoffs. (B) Competition leads to reduced payoffs when individuals compete for the same option as others. (C) People care about how they are doing relatively to others. The latter trait—the propensity to compare one’s own success with that of others—expresses itself as envy. It is shown that the combination of (A)–(C) leads to spontaneous class stratification. Societies of agents split endogenously into two social classes, an upper and a lower class, when envy becomes relevant. A comprehensive analysis of the Nash equilibria characterizing a basic reference game is presented. Class separation is due to the condensation of the strategies of lower-class agents, which play an identical mixed strategy. Upper-class agents do not condense, following individualist pure strategies. The model and results are size-consistent, holding for arbitrary large numbers of agents and options. Analytic results are confirmed by extensive numerical simulations. An analogy to interacting confined classical particles is discussed. 相似文献
2.
3.
分析了韩国、日本及国内运营商手机游戏业务的发展状况.探讨了手机游戏业务的模式.论述了该业务的战略定位和市场前景。从地区提供给移动通信市场对外部环境、产业链的准备是否充分以及运营商内部的资源和运营状况等三个方面阐明了手机游戏业务发展的关键因素。 相似文献
4.
After the remarkable increase of Internet users and broadband Internet subscribers at the end of the 20th century, the size of Korean Internet and e-commerce market steadily increased but the growth rate has been either stagnant or decreased. Trends of Korean Internet and e-commerce market are summarized in this paper the trends on Internet usage are introduced. Trends of online games, blogs and wireless Internet are introduced. The trends of Korean Internet market may have implications for China and Japan. 相似文献
5.
On Quantum Team Games 总被引:2,自引:0,他引:2
E. Ahmed M. F. Elettreby A. S. Hegazi 《International Journal of Theoretical Physics》2006,45(5):880-886
Recently Liu and Simaan (2004) convex static multi-team classical games have been introduced. Here they are generalized to both nonconvex, dynamic and quantum games. Puu's incomplete information dynamical systems are modified and applied to Cournot team game. The replicator dynamics of the quantum prisoner's dilemma game is also studied. 相似文献
6.
Shunlong Luo 《Foundations of Physics》2002,32(11):1757-1772
We formulate an elementary statistical game which captures the essence of some fundamental quantum experiments such as photon polarization and spin measurement. We explore and compare the significance of the principle of maximum Shannon entropy and the principle of minimum Fisher information in solving such a game. The solution based on the principle of minimum Fisher information coincides with the solution based on an invariance principle, and provides an informational explanation of Malus' law for photon polarization. There is no solution based on the principle of maximum Shannon entropy. The result demonstrates the merits of Fisher information, and the demerits of Shannon entropy, in treating some fundamental quantum problems. It also provides a quantitative example in support of a general philosophy: Nature intends to hide Fisher information, while obeying some simple rules. 相似文献
7.
We study a model of a queueing system with two complementary products/services. In our model, there is one M/M/1 system and another facility that provides instantaneous service. The two services are complementary and the customer has no benefit from obtaining just one of them. We investigate the model under various price structures and ownership assumptions.AMS subject classification: 90B22, 91A10The authors are equal in their contribution to this paper. This paper is submitted by the first author to the Tokyo Institute of Technology as partial fulfillment of the requirements for the Ph.D. program in the Department of Value and Decision Sciences, and the order of names was chosen in compliance with program conditions. This research was supported by the Israel Science Foundation (grant No. 237/02). 相似文献
8.
9.
基于CSCW的协同编著系统的设计 总被引:3,自引:0,他引:3
讨论了计算机支持的协同工作(CSCW)的主要技术,其中重点讨论了协同编著系统设计中的并发控制技术,指出了其与传统的并发控制技术的区别。根据CSCW的基本原理设计出了一个基于Browse/Server结构的协同编著系统的系统模型。该系统模型比传统的模型更加方便了用户之间通过Internet的浏览器进行协作。 相似文献
10.
C. -H. L. Ong 《Annals of Pure and Applied Logic》2004,130(1-3):125-171
We prove that the observational equivalence of third-order finitary (i.e. recursion-free) Idealized Algol (IA) is decidable using Game Semantics. By modelling the state explicitly in our games, we show that the denotation of a term M of this fragment of IA is a compactly innocent strategy-with-state, i.e. the strategy is generated by a finite view function fM. Given any such fM, we construct a real-time deterministic pushdown automaton (DPDA) that recognizes the complete plays of the knowing-strategy denotation of M. Since such plays characterize observational equivalence, and there is an algorithm for deciding whether any two DPDAs recognize the same language, we obtain a procedure for deciding the observational equivalence of third-order finitary IA. Restricted to second-order terms, the DPDA representation cuts down to a deterministic finite automaton; thus our approach gives a new proof of Ghica and McCusker’s regular-expression characterization for this fragment. Our algorithmic representation of program meanings, which is compositional, provides a foundation for model-checking a wide range of behavioural properties of IA and other cognate programming languages. Another result concerns second-order IA with full recursion: we show that observational equivalence for this fragment is undecidable. 相似文献