首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   84篇
  免费   1篇
化学   23篇
力学   3篇
数学   10篇
物理学   49篇
  2022年   1篇
  2016年   1篇
  2015年   2篇
  2013年   2篇
  2011年   1篇
  2010年   1篇
  2009年   1篇
  2008年   4篇
  2006年   7篇
  2005年   2篇
  2004年   2篇
  2003年   3篇
  2002年   2篇
  2000年   2篇
  1999年   1篇
  1996年   1篇
  1995年   2篇
  1994年   2篇
  1993年   7篇
  1992年   3篇
  1991年   3篇
  1990年   3篇
  1989年   3篇
  1988年   4篇
  1987年   1篇
  1986年   1篇
  1985年   4篇
  1982年   1篇
  1981年   1篇
  1980年   2篇
  1978年   1篇
  1976年   1篇
  1975年   1篇
  1974年   1篇
  1972年   1篇
  1943年   1篇
  1941年   1篇
  1940年   4篇
  1935年   2篇
  1920年   2篇
排序方式: 共有85条查询结果,搜索用时 0 毫秒
21.
22.
23.
This paper examines stochastic processes generated by sequential games each of whose “states” includes a distribution and whose up-dating rules for state transitions may include Bayes operators. General properties of discrete-time Markov processes are applied to specific games such as iterated matrix games, including Prisoners' Dilemma, and to a new model for the Asch experiments on conflict and conformity.  相似文献   
24.
In the recently published atlas of graphs [9] the general listing of graphs with diagrams went up to V=7 vertices but the special listing for connected bipartite graphs carried further up to V=8. In this paper we wish to study the random accessibility of these connected bipartite graphs by means of random walks on the graphs using the degree of the gratis starting point as a weighting factor. The accessibility is then related to the concept of reliability of the graphs with only edge failures. Exact expectation results for accessibility are given for any complete connected bipartite graph N1 cbp N2 (where cbp denotes connected bipartite) for several values of J (the number of new vertices searched for). The main conjecture in this paper is that for any complete connected bipartite graph N1 cbp N2: if |N1–N2| 1, then the graph is both uniformly optimal in reliability and optimal in random accessibility within its family. Numerical results are provided to support the conjecture.  相似文献   
25.
26.
We have previously reported the stability of europium oxalate compared to ammonium europium bis-salen and europium benzoate. We now extend the dicoarboxylic acid chain of the oxalate by introducing additional-CH2-groups in the dicarboxylate ligands by using malonate, succinate, glutarate and adipate. Additionally, we have examined the effect of alterations in the succinate dianion by introducing functional groups such as [C = C]in the case of the maleide and-OH group in the case of the malide. This study is an attempt to further characterize these compounds. Infrared spectra were used to characterize bridging and chelating dicarboxylates while Mössbauer spectroscopy measurements were used to gain better insight into the structure of heterocyclic “cages” containing two Eu3?+? ions and two dianions.  相似文献   
27.
Sobel, Uppuluri, and Frankowski, (Selected Tables in Math. Statistics, Vol. IV. Amer. Math. Soc., Providence, R. I., 1977) consider an incomplete Dirichlet integral of type I with several interesting applications connected with the multinomial distribution and provide tables of this integral along with other useful tables. Two incomplete Dirichlet integrals are discussed here along with some useful recurrence relations, providing simple methods of deriving the distribution theory of ordered uniform spacings.  相似文献   
28.
A search for the relic neutrinos from all past core-collapse supernovae was conducted using 1496 days of data from the Super-Kamiokande detector. This analysis looked for electron-type antineutrinos that had produced a positron with an energy greater than 18 MeV. In the absence of a signal, 90% C.L. upper limits on the total flux were set for several theoretical models; these limits ranged from 20 to 130 macro nu(e) cm(-2) s(-1). Additionally, an upper bound of 1.2 macro nu(e) cm(-2) s(-1) was set for the supernova relic neutrino flux in the energy region E(nu)>19.3 MeV.  相似文献   
29.
30.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号