全文获取类型
收费全文 | 480篇 |
免费 | 23篇 |
国内免费 | 51篇 |
专业分类
化学 | 14篇 |
力学 | 12篇 |
综合类 | 6篇 |
数学 | 466篇 |
物理学 | 56篇 |
出版年
2023年 | 2篇 |
2022年 | 16篇 |
2021年 | 4篇 |
2020年 | 5篇 |
2019年 | 10篇 |
2018年 | 9篇 |
2017年 | 8篇 |
2016年 | 12篇 |
2015年 | 10篇 |
2014年 | 20篇 |
2013年 | 43篇 |
2012年 | 14篇 |
2011年 | 16篇 |
2010年 | 25篇 |
2009年 | 29篇 |
2008年 | 17篇 |
2007年 | 31篇 |
2006年 | 28篇 |
2005年 | 21篇 |
2004年 | 21篇 |
2003年 | 16篇 |
2002年 | 27篇 |
2001年 | 17篇 |
2000年 | 20篇 |
1999年 | 17篇 |
1998年 | 11篇 |
1997年 | 19篇 |
1996年 | 10篇 |
1995年 | 4篇 |
1994年 | 2篇 |
1993年 | 3篇 |
1992年 | 6篇 |
1991年 | 3篇 |
1990年 | 3篇 |
1989年 | 4篇 |
1988年 | 3篇 |
1987年 | 4篇 |
1985年 | 7篇 |
1984年 | 7篇 |
1983年 | 4篇 |
1982年 | 2篇 |
1981年 | 3篇 |
1980年 | 1篇 |
1979年 | 4篇 |
1978年 | 4篇 |
1977年 | 1篇 |
1976年 | 2篇 |
1974年 | 2篇 |
1973年 | 5篇 |
1971年 | 1篇 |
排序方式: 共有554条查询结果,搜索用时 31 毫秒
1.
A (di)graph is supereulerian if it contains a spanning eulerian sub(di)graph. This property is a relaxation of hamiltonicity. Inspired by this analogy with hamiltonian cycles and by similar results in supereulerian graph theory, we analyze a number of sufficient Ore type conditions for a digraph to be supereulerian. Furthermore, we study the following conjecture due to Thomassé and the first author: if the arc‐connectivity of a digraph is not smaller than its independence number, then the digraph is supereulerian. As a support for this conjecture we prove it for digraphs that are semicomplete multipartite or quasitransitive and verify the analogous statement for undirected graphs. 相似文献
2.
Dan Voiculescu 《Reports on Mathematical Physics》2005,55(1):127-133
This short note summarizes the circumstances of the birth of free probability theory andsome of the recent achievements. 相似文献
3.
加权建模是必要的,微分建模是重要的,把二者结合起来,进行加权微分建模既必要也重要.给出了常用模型的微分建模结果,讨论了加权建模中的计算和权重选择问题,探讨了加权微分建模的思路和方法,并结合典型数据验证了该方法的有效性和稳定性.象加权建模一样,加权微分建模的精度、实用价值等,是和权重确定得合理与否紧密相联;应先进行模拟,以与近期实际值或典型样本相差最小的参数所对应的模型为准. 相似文献
4.
H. Ansari-Toroghy 《Southeast Asian Bulletin of Mathematics》2002,25(4):571-576
In this paper we will introduce the concepts of analytic independence and analytic spread for ideals relative to certain injective module over a commutative Noetherian ring. 相似文献
5.
Jan Hamhalter 《International Journal of Theoretical Physics》2004,43(10):2101-2111
We summarize and deepen recent results on the interplay between properties of states and the structure of von Neumann algebras. We treat Jauch–Piron states and the concept of independence in noncommutative probability theory. 相似文献
6.
Enrique Casanovas 《Mathematical Logic Quarterly》2003,49(5):475-478
We prove a property of generic homogeneity of tuples starting an infinite indiscernible sequence in a simple theory and we use it to give a shorter proof of the Independence Theorem for Lascar strong types. We also characterize the relation of starting an infinite indiscernible sequence in terms of coheirs. 相似文献
7.
We first note that Gentzen's proof-reduction for his consistency proof of PA can be directly interpreted as moves of Kirby-Paris' Hydra Game, which implies a direct independence proof of the game (Section 1 and Appendix). Buchholz's Hydra Game for labeled hydras is known to be much stronger than PA. However, we show that the one-dimensional version of Buchholz's Game can be exactly identified to Kirby-Paris' Game (which is two-dimensional but without labels), by a simple and natural interpretation (Section 2). Jervell proposed another type of a combinatorial game, by abstracting Gentzen's proof-reductions and showed that his game is independent of PA. We show (Section 3) that this Jervell's game is actually much stronger than PA, by showing that the critical ordinal of Jervell's game is φω (0) (while that of PA or of Kirby-Paris' Game is φ1 (0) = ?0) in the Veblen hierarchy of ordinals. 相似文献
8.
Sergio Albeverio Yeneng Sun Jiang-Lun Wu 《Transactions of the American Mathematical Society》2007,359(2):517-527
It is shown that for a large collection of independent martingales, the martingale property is preserved on the empirical processes. Under the assumptions of independence and identical finite-dimensional distributions, it is proved that a large collection of stochastic processes are martingales essentially if and only if the empirical processes are also martingales. These two results have implications on the testability of the martingale property in scientific modeling. Extensions to submartingales and supermartingales are given.
9.
Bernhard Von Stengel 《Annals of Operations Research》1988,16(1):161-183
This paper integrates and extends the theory of the decomposition of multiattribute expected-utility functions based on utility independence. In a preliminary section, the standard decision model of expected utility is briefly discussed, including the fact that the decision maker's preference forlotteries with two outcomes determines the utility function uniquely. The decomposition possibilities of a utility function are captured by the concept ofautonomous sets of attributes, an affine separability of some kind known as generalized utility independence.Overlapping autonomous sets lead to biaffine-associative, i.e.multiplicative oradditive decompositions. The multiplicative representation shows that autonomy has strongerclosure properties than utility independence, for instance with respect to set-theoretic difference. Autonomy is also a concept with a wider scope since it applies to the decomposition of Boolean functions, games and a number of other topics in combinatorial optimization. This relationship to the well-known theory ofsubstitution decomposition in discrete mathematics also reveals a kind of discrete core behind the decomposition of utility functions. The entirety of autonomous sets can be represented by a compact data structure, the so-calledcomposition tree, which frequently corresponds to a natural hierarchy of attributes. Multiplicative/additive ormulti-affine functions correspond to the hierarchy steps. The known representation of multi-affine functions is shown to be given by aMoebius inversion formula. The entire approach has the advantage that it allows the application of more sophisticated representation methods on a detailed level, whereas it employs onlyfinite set theory andarithmetic on the main levels in the hierarchy. 相似文献
10.
Topological indices are graph invariants used in computational chemistry to encode molecules. A frequent problem when performing structure-activity studies is that topological indices are inter-correlated. We consider a simple topological index and show asymptotic independence for a random tree model. This continues previous work on the correlation among topological indices. These findings suggest that a size-dependence in a certain class of distance-based topological indices can be eliminated.AMS subject classification: 05C80, 60E10, 92E10 相似文献