全文获取类型
收费全文 | 159篇 |
免费 | 3篇 |
国内免费 | 2篇 |
专业分类
化学 | 1篇 |
力学 | 4篇 |
数学 | 155篇 |
物理学 | 4篇 |
出版年
2023年 | 6篇 |
2022年 | 5篇 |
2021年 | 1篇 |
2020年 | 7篇 |
2019年 | 8篇 |
2018年 | 12篇 |
2017年 | 1篇 |
2015年 | 5篇 |
2014年 | 5篇 |
2013年 | 6篇 |
2012年 | 1篇 |
2011年 | 15篇 |
2010年 | 10篇 |
2009年 | 23篇 |
2008年 | 10篇 |
2007年 | 6篇 |
2006年 | 9篇 |
2005年 | 4篇 |
2004年 | 6篇 |
2003年 | 3篇 |
2002年 | 2篇 |
2001年 | 2篇 |
2000年 | 1篇 |
1999年 | 1篇 |
1998年 | 5篇 |
1997年 | 2篇 |
1993年 | 1篇 |
1992年 | 1篇 |
1991年 | 1篇 |
1989年 | 2篇 |
1982年 | 2篇 |
1980年 | 1篇 |
排序方式: 共有164条查询结果,搜索用时 15 毫秒
1.
《Annals of Pure and Applied Logic》2022,173(10):103088
We study hidden-variable models from quantum mechanics and their abstractions in purely probabilistic and relational frameworks by means of logics of dependence and independence, which are based on team semantics. We show that common desirable properties of hidden-variable models can be defined in an elegant and concise way in dependence and independence logic. The relationship between different properties and their simultaneous realisability can thus be formulated and proven on a purely logical level, as problems of entailment and satisfiability of logical formulae. Connections between probabilistic and relational entailment in dependence and independence logic allow us to simplify proofs. In many cases, we can establish results on both probabilistic and relational hidden-variable models by a single proof, because one case implies the other, depending on purely syntactic criteria. We also discuss the ‘no-go’ theorems by Bell and Kochen-Specker and provide a purely logical variant of the latter, introducing non-contextual choice as a team-semantical property. 相似文献
2.
Mireille Bousquet-Mélou Svante Linusson Eran Nevo 《Journal of Algebraic Combinatorics》2008,27(4):423-450
The enumeration of independent sets of regular graphs is of interest in statistical mechanics, as it corresponds to the solution
of hard-particle models. In 2004, it was conjectured by Fendley et al., that for some rectangular grids, with toric boundary conditions, the alternating number of independent sets is extremely simple. More precisely, under a coprimality condition on the sides of the rectangle,
the number of independent sets of even and odd cardinality always differ by 1. In physics terms, this means looking at the
hard-particle model on these grids at activity −1. This conjecture was recently proved by Jonsson.
Here we produce other families of grid graphs, with open or cylindric boundary conditions, for which similar properties hold
without any size restriction: the number of independent sets of even and odd cardinality always differ by 0, ±1, or, in the
cylindric case, by some power of 2.
We show that these results reflect a stronger property of the independence complexes of our graphs. We determine the homotopy
type of these complexes using Forman’s discrete Morse theory. We find that these complexes are either contractible, or homotopic
to a sphere, or, in the cylindric case, to a wedge of spheres.
Finally, we use our enumerative results to determine the spectra of certain transfer matrices describing the hard-particle
model on our graphs at activity −1. These results parallel certain conjectures of Fendley et al., proved by Jonsson in the toric case. 相似文献
3.
We introduce a method to reduce the study of the topology of a simplicial complex to that of a simpler one. Applying this
method to complexes arising from graphs, we give topological meaning to classical graph invariants. As a consequence, we answer
some questions raised in (Ehrenborg and Hetyei in Eur. J. Comb. 27(6):906–923, 2006) on the independence complex and the dominance complex of a forest and obtain improved algorithms to compute their homotopy
types. 相似文献
4.
5.
《International Journal of Approximate Reasoning》2014,55(8):1708-1727
The inclusion–exclusion principle is a well-known property in probability theory, and is instrumental in some computational problems such as the evaluation of system reliability or the calculation of the probability of a Boolean formula in diagnosis. However, in the setting of uncertainty theories more general than probability theory, this principle no longer holds in general. It is therefore useful to know for which families of events it continues to hold. This paper investigates this question in the setting of belief functions. After exhibiting original sufficient and necessary conditions for the principle to hold, we illustrate its use on the uncertainty analysis of Boolean and non-Boolean systems in reliability. 相似文献
6.
The validity of many efficiency measurement methods rely upon the assumption that variables such as input quantities and output mixes are independent of (or uncorrelated with) technical efficiency, however few studies have attempted to test these assumptions. In a recent paper, Wilson (2003) investigates a number of independence tests and finds that they have poor size properties and low power in moderate sample sizes. In this study we discuss the implications of these assumptions in three situations: (i) bootstrapping non-parametric efficiency models; (ii) estimating stochastic frontier models and (iii) obtaining aggregate measures of industry efficiency. We propose a semi-parametric Hausmann-type asymptotic test for linear independence (uncorrelation), and use a Monte Carlo experiment to show that it has good size and power properties in finite samples. We also describe how the test can be generalized in order to detect higher order dependencies, such as heteroscedasticity, so that the test can be used to test for (full) independence when the efficiency distribution has a finite number of moments. Finally, an empirical illustration is provided using data on US electric power generation. 相似文献
7.
The independence polynomial, ω(G,x)=∑wkxk, of a graph, G, has coefficients, wk, that enumerate the ways of selecting k vertices from G so that no two selected vertices share an edge. The independence number of G is the largest value of k for which wk≠0. Little is known of less straightforward relationships between graph structure and the properties of ω(G,x), in part because of the difficulty of calculating values of wk for specific graphs. This study presents a new algorithm for these calculations which is both faster than existing ones and easily adaptable to high-level computer languages. 相似文献
8.
An arc of a graph is an oriented edge and a 3-arc is a 4-tuple (v,u,x,y) of vertices such that both (v,u,x) and (u,x,y) are paths of length two. The 3-arc graph of a graph G is defined to have the arcs of G as vertices such that two arcs uv,xy are adjacent if and only if (v,u,x,y) is a 3-arc of G. In this paper, we study the independence, domination and chromatic numbers of 3-arc graphs and obtain sharp lower and upper bounds for them. We introduce a new notion of arc-coloring of a graph in studying vertex-colorings of 3-arc graphs. 相似文献
9.
Roland Glantz 《Discrete Mathematics》2006,306(24):3253-3266
The recursive computation of the interlace polynomial introduced by Arratia, Bollobás and Sorkin is defined in terms of a new pivoting operation on undirected simple graphs. In this paper, we interpret the new pivoting operation on graphs in terms of standard pivoting (on matrices). Specifically, we show that, up to swapping vertex labels, Arratia et al.'s pivoting operation on a graph is equivalent to a principal pivot transform on the graph's adjacency matrix, provided that all computations are performed in the Galois field F2. Principal pivoting on adjacency matrices over F2 has a natural counterpart on isotropic systems. Thus, our view of the interlace polynomial is closely related to the one by Aigner and van der Holst.The observations that adjacency matrices of undirected simple graphs are skew-symmetric in F2 and that principal pivoting preserves skew-symmetry in all fields suggest to extend Arratia et al.'s pivoting operation to fields other than F2. Thus, the interlace polynomial extends to polynomials on gain graphs, namely bidirected edge-weighted graphs whereby reversed edges carry non-zero weights that differ only by their sign. Extending a proof by Aigner and van der Holst, we show that the extended interlace polynomial can be represented in a non-recursive form analogous to the non-recursive form of the original interlace polynomial, i.e., the Martin polynomial.For infinite fields it is shown that the extended interlace polynomial does not depend on the (non-zero) gains, as long as they obey a non-singularity condition. These gain graphs are all supported by a single undirected simple graph. Thus, a new graph polynomial is defined for undirected simple graphs. The recursive computation of the new polynomial can be done such that all ends of the recursion correspond to independent sets. Moreover, its degree equals the independence number. However, the new graph polynomial is different from the independence polynomial. 相似文献
10.
主要研究了B-值双随机Dirichlet级数在不同条件(i){Xn}服从强大数定律,且 (ii){Xn}独立不同分布,且 等条件下的收敛性,得出了收敛横坐标的简洁公式. 相似文献