全文获取类型
收费全文 | 196篇 |
免费 | 3篇 |
国内免费 | 2篇 |
专业分类
化学 | 1篇 |
力学 | 4篇 |
数学 | 155篇 |
物理学 | 4篇 |
综合类 | 37篇 |
出版年
2023年 | 6篇 |
2022年 | 5篇 |
2021年 | 1篇 |
2020年 | 7篇 |
2019年 | 8篇 |
2018年 | 12篇 |
2017年 | 1篇 |
2015年 | 5篇 |
2014年 | 7篇 |
2013年 | 7篇 |
2012年 | 2篇 |
2011年 | 18篇 |
2010年 | 11篇 |
2009年 | 24篇 |
2008年 | 10篇 |
2007年 | 11篇 |
2006年 | 14篇 |
2005年 | 5篇 |
2004年 | 9篇 |
2003年 | 7篇 |
2002年 | 4篇 |
2001年 | 3篇 |
2000年 | 2篇 |
1999年 | 1篇 |
1998年 | 6篇 |
1997年 | 3篇 |
1993年 | 2篇 |
1992年 | 1篇 |
1991年 | 2篇 |
1989年 | 3篇 |
1987年 | 1篇 |
1982年 | 2篇 |
1980年 | 1篇 |
排序方式: 共有201条查询结果,搜索用时 15 毫秒
31.
指令集是计算机系统结构的重要研究内容之一,众多学者对指令完全性进行了描述,但至今未见极小指令集的报道。在文中,寻找既具有基本功能,又无法由其它指令编程实现的计算机基本指令,研究计算机现有的最基本的计算行为。提出了指令的功能完全性和独立性概念,并在此基础上定义了极小指令集,这为计算机指令集的优化设计建立了理论基础。还从Intel 80486指令集中选定了一个子集I9,并构造性地证明了I9是IA-32处理器指令集的极小指令集。 相似文献
32.
Jens-P. Bode 《Discrete Mathematics》2003,272(1):27-35
For three kinds of chess-like knights, one on triangle and two on hexagon boards, the independence numbers for their knight graphs are considered. We determine these numbers completely for two kinds of these knights, and for one residue class modulo 4 in the case of the third kind. 相似文献
33.
For some integer k0 and two graph parameters π and τ, a graph G is called πτ(k)-perfect, if π(H)−τ(H)k for every induced subgraph H of G. For r1 let αr and γr denote the r-(distance)-independence and r-(distance)-domination number, respectively. In (J. Graph Theory 32 (1999) 303–310), I. Zverovich gave an ingenious complete characterization of α1γ1(k)-perfect graphs in terms of forbidden induced subgraphs. In this paper we study αrγs(k)-perfect graphs for r,s1. We prove several properties of minimal αrγs(k)-imperfect graphs. Generalizing Zverovich's main result in (J. Graph Theory 32 (1999) 303–310), we completely characterize α2r−1γr(k)-perfect graphs for r1. Furthermore, we characterize claw-free α2γ2(k)-perfect graphs. 相似文献
34.
设α(G)表示简单图G=(V,E)的独立数.本文给出了α(G)的一个新的下界:α(G)≥∑v∈V(λd(v)+1)/(d(v)+λd(v)+1),其中λd(v)=max{0,βN(v)-d(v)},d(v)=|N(v)|,N(v)={w∈V|(v,w)∈E},βN(v)=minw∈N(v)d(w). 相似文献
35.
A class K of structures is controlled if for all cardinals λ, the relation of L∞,λ-equivalence partitions K into a set of equivalence classes (as opposed to a proper class). We prove that no pseudo-elementary class with the independence property is controlled. By contrast, there is a pseudo-elementary class with the strict order property that is controlled (see Arch. Math. Logic 40 (2001) 69–88). 相似文献
36.
Let β(G), Γ(G) and IR(G) be the independence number, the upper domination number and the upper irredundance number, respectively. A graph G is called Γ-perfect if β(H) = Γ(H), for every induced subgraph H of G. A graph G is called IR-perfect if Γ(H) =IR(H), for every induced subgraph H of G. In this paper, we present a characterization of Γ-perfect graphs in terms of a family of forbidden induced subgraphs, and show that the class of Γ-perfect graphs is a subclass of IR-perfect graphs and that the class of absorbantly perfect graphs is a subclass of Γ-perfect graphs. These results imply a number of known theorems on Γ-perfect graphs and IR-perfect graphs. Moreover, we prove a sufficient condition for a graph to be Γ-perfect and IR-perfect which improves a known analogous result. 相似文献
37.
The problem of dependency between two random variables has been studied throughly in the literature. Many dependency measures have been proposed according to concepts such as concordance, quadrant dependency, etc. More recently, the development of the Theory of Copulas has had a great impact in the study of dependence of random variables specially in the case of continuous random variables. In the case of the multivariate setting, the study of the strong mixing conditions has lead to interesting results that extend some results like the central limit theorem to the case of dependent random variables.In this paper, we study the behavior of a multidimensional extension of two well-known dependency measures, finding their basic properties as well as several examples. The main difference between these measures and others previously proposed is that these ones are based on the definition of independence among n random elements or variables, therefore they provide a nice way to measure dependency.The main purpose of this paper is to present a sample version of one of these measures, find its properties, and based on this sample version to propose a test of independence of multivariate observations. We include several references of applications in Statistics. 相似文献
38.
A bouquet of matroids is a combinatorial structure that generalizes the properties of matroids. Given an independence system, there exist several bouquets of matroids having the same family of independent sets. We show that the collection of these geometries forms in general a meet semi-lattice and, in some cases, a lattice (for instance, when is the family of the stable sets in a graph). Moreover, one of the bouquets that correspond to the highest elements in the meet semi-lattice provides the smallest decomposition of into matroidal families, such that the rank functions of the different matroids have the same values for common sets. In the last section, we give sharp bounds on the performance of the greedy algorithm, using parameters of some special bouquets in the semi-lattice. 相似文献
39.
Reinhardt Euler 《Mathematical Programming》1982,24(1):269-283
Let (E,I) be an independence system over the finite setE = {e
1, ,e
n
}, whose elements are orderede
1 e
n
. (E,I) is called regular, if the independence of {e
l
, ,e
l
k
},l
1 < <l
k
, implies that of {e
m
l
, ,e
m
k
}, wherem
l
< ··· <m
k
andl
1 m
1, ,l
k
m
k
. (E,I) is called a 2-system, if for anyI I,e E I the setI {e } contains at most 2 distinct circuitsC, C I and the number 2 is minimal with respect to this property. If, in addition, for any two independent setsI andJ the family (C J, C
C
(J, I)), whereC(J, I) denotes {C C:e J I C
{e}}, can be partitioned into 2 subfamilies each of which possesses a transversal, then (E,I) is called a (2, 2)-system. In this paper we characterize regular 2-systems and we show that the classes of regular 2-systems resp. regular (2, 2)-systems are identical. 相似文献
40.
《Discrete Mathematics》2022,345(3):112706
The power of a graph , , is the graph whose vertex set is V and in which two distinct vertices are adjacent if and only if their distance in G is at most k. This article proves various eigenvalue bounds for the independence number and chromatic number of which purely depend on the spectrum of G, together with a method to optimize them. Our bounds for the k-independence number also work for its quantum counterpart, which is not known to be a computable parameter in general, thus justifying the use of integer programming to optimize them. Some of the bounds previously known in the literature follow as a corollary of our main results. Infinite families of graphs where the bounds are sharp are presented as well. 相似文献