全文获取类型
收费全文 | 113篇 |
免费 | 4篇 |
国内免费 | 12篇 |
专业分类
化学 | 2篇 |
力学 | 2篇 |
综合类 | 5篇 |
数学 | 110篇 |
物理学 | 10篇 |
出版年
2023年 | 2篇 |
2022年 | 2篇 |
2021年 | 2篇 |
2020年 | 2篇 |
2019年 | 4篇 |
2018年 | 1篇 |
2017年 | 1篇 |
2016年 | 1篇 |
2015年 | 1篇 |
2014年 | 3篇 |
2013年 | 1篇 |
2012年 | 1篇 |
2011年 | 4篇 |
2010年 | 4篇 |
2009年 | 7篇 |
2008年 | 4篇 |
2007年 | 3篇 |
2006年 | 5篇 |
2005年 | 7篇 |
2004年 | 7篇 |
2003年 | 6篇 |
2002年 | 12篇 |
2001年 | 6篇 |
2000年 | 5篇 |
1999年 | 4篇 |
1998年 | 4篇 |
1997年 | 7篇 |
1996年 | 5篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1993年 | 2篇 |
1992年 | 4篇 |
1990年 | 3篇 |
1989年 | 2篇 |
1984年 | 2篇 |
1982年 | 2篇 |
1978年 | 1篇 |
排序方式: 共有129条查询结果,搜索用时 15 毫秒
21.
利用连通集上有关上半连续点集映射的连通性质,本文证明了拓扑向量空间中向量最优化问题的弱锥-有效解集与相应目标空间中的弱锥-有效点集连通性之间的一个等价定理. 相似文献
22.
本文研究拓扑空间中锥拟凸多目标优化问题的有效解集的连通性.在目标映射是上连续和拟凸(次严格拟凸)的条件下,证明了锥弱有效(有效)解集是连通的.进一步,在是连续和强拟凸的条件下,证明了锥有效解集是路连通的. 相似文献
23.
In this paper, the concepts of quasiconcave set and strictly quasiconcave set are introduced. By using these concepts, we get a new sufficient condition for the efficient outcome set to be connected. This leads to the connectedness of the efficient solution set in strictly quasiconcave vector maximization under the mild condition that the efficient frontier is closed.The authors would like to thank Professor E. U. Choo and the referees for their many valuable comments and helpful suggestions. 相似文献
24.
Hans-Gert Gräbe 《Journal of Algebraic Combinatorics》1993,2(2):137-145
In the first part we generalize the notion of strongly independent sets, introduced in [10] for polynomial ideals, to submodules of free modules and explain their computational relevance. We discuss also two algorithms to compute strongly independent sets that rest on the primary decomposition of squarefree monomial ideals.Usually the initial ideal in(I) of a polynomial ideal I is worse than I. In [9] the authors observed that nevertheless in(I) is not as bad as one should expect, showing that in(I) is connected in codimension one if I is prime.In the second part of the paper we add more evidence to that observation. We show that in(I) inherits (radically) unmixedness, connectedness in codimension one and connectedness outside a finite set of points from I and prove the same results also for initial submodules of free modules. The proofs use a deformation from I to in(I ). 相似文献
25.
26.
无限维空间中强拟凸向量优化问题有效解集的连通性 总被引:3,自引:0,他引:3
本文在无穷维空间引进增强凸变换的概念,在约束集是紧和凸的条件下目标函数是连续和强拟凸的,我们得取到向量极小问题有效解集的连通性。 相似文献
27.
徐俊明 《新疆大学学报(理工版)》1989,(1)
设λ(G)表示G的棱连通度,图G称为临界h棱连通的,如果λ(G)=h而且对任何x∈V(G),λ(G-x)≤h-1,具有最大棱数的临界h棱连通图称为最大临界h棱连通图.本文首先证明对h≥3的临界h棱连通图的若干性质,然后证明最大临界3棱连通图的每个顶点都与3度点相邻,并由此给出了此类图的结构刻划和最大棱数. 相似文献
28.
《Random Structures and Algorithms》2018,53(2):238-288
The phase transition in the size of the giant component in random graphs is one of the most well‐studied phenomena in random graph theory. For hypergraphs, there are many possible generalizations of the notion of a connected component. We consider the following: two j‐sets (sets of j vertices) are j‐connected if there is a walk of edges between them such that two consecutive edges intersect in at least j vertices. A hypergraph is j‐connected if all j‐sets are pairwise j‐connected. In this paper, we determine the asymptotic size of the unique giant j‐connected component in random k‐uniform hypergraphs for any and . 相似文献
29.
It is well known that Universal cycles (U-cycles) of k-letter words on an n-letter alphabet exist for all k and n. In this paper, we prove that Universal cycles exist for several restricted classes of words, including non-bijections, “equitable” words (under suitable restrictions), ranked permutations, and “passwords”. In each case, proving the connectedness of the underlying de Bruijn digraph is a non-trivial step. 相似文献
30.