首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   77篇
  免费   0篇
化学   13篇
数学   49篇
物理学   15篇
  2020年   4篇
  2018年   1篇
  2017年   2篇
  2014年   1篇
  2013年   3篇
  2012年   3篇
  2011年   2篇
  2010年   1篇
  2009年   4篇
  2008年   4篇
  2007年   4篇
  2006年   2篇
  2005年   1篇
  2004年   3篇
  2003年   1篇
  2002年   2篇
  2001年   3篇
  2000年   6篇
  1998年   2篇
  1995年   1篇
  1994年   4篇
  1993年   2篇
  1992年   3篇
  1988年   2篇
  1987年   2篇
  1986年   1篇
  1984年   1篇
  1983年   2篇
  1982年   1篇
  1981年   1篇
  1980年   1篇
  1979年   1篇
  1978年   1篇
  1977年   1篇
  1976年   1篇
  1975年   1篇
  1974年   1篇
  1973年   1篇
排序方式: 共有77条查询结果,搜索用时 31 毫秒
71.
Let m be a fixed integer, m = {0,1,?,m ? 1}; let C be a family of nonvoid subsets of m, and let R be a hereditary subfamily of C. Given finite sets Am,…,Am?1 such that ∩ i?BAi = Ø for all B ? m, B ? C, the vector of |∩i?RAi| (Rj?R) is called a C-supported R-intersection pattern. The characterization of the YRC of such patterns is a difficult combinatorial problem even for m=5 and simple families R and C. We study the algebraic structure of the convex cone YRC and its dual, and an integer linear-programming aspect of the problem; in particular we introduce the notion of content and pseudocontent. A relaxation leads to quadratic and higher forms over certain subsets of reals. As an application we study the natural link between highly symmetric patterns and two-symbol balanced arrays.  相似文献   
72.
The Hamming distance between two permutations of a finite setX is the number of elements ofX on which they differ. In the first part of this paper, we consider bounds for the cardinality of a subset (or subgroup) of a permutation groupP onX with prescribed distances between its elements. In the second part. We consider similar results for sets ofs-tuples of permutations; the role of Hamming distance is played by the number of elements ofX on which, for somei, the ith permutations of the two tuples differ.  相似文献   
73.
Inspired by Barany’s Colourful Caratheodory Theorem, we introduce a colourful generalization of Liu's simplicial depth. We prove a parity property and conjecture that the minimum colourful simplicial depth of any core point in any d-dimensional configuration is d2 + 1 and that the maximum is dd+1 + 1. We exhibit configurations attaining each of these depths, and apply our results to the problem of bounding monochrome (non-colourful) simplicial depth.  相似文献   
74.
F-squashed geometries, one of the many recent generalizations of matroids, include a wide range of combinatorial structures but still admit a direct extension of many matroidal axiomatizations and also provide a good framework for studying the performance of the greedy algorithm in any independence system. Here, after giving all necessary preliminaries in section 1, we consider in section 2F-squashed geometries which are exactly the shadow structures coming from the Buekenhout diagram:, i.e. bouquets of matroids. We introduce d-injective planes: (generalizing the case of dual net for d=1) which provide a diagram representation for high rank d-injective geometries. In section 3, after a brief survey of known constructions for d-injective geometries, we give two new constructions using pointwise and setwise action of a class of mappings. The first one, using some features of permutation geometries (i.e. 2-injection geometries), produces bouquets of pairwise isomorphic matroids. The last section 4 presents briefly some related problems for squashed geometries.  相似文献   
75.
Recent massive numerical simulations have shown that the response of a "stochastic resonator" is enhanced as a consequence of spatial coupling. Similar results have been analytically obtained in a reaction-diffusion model, using nonequilibrium potential techniques. We now consider a field-dependent diffusivity and show that the selectivity of the coupling is more efficient for achieving stochastic-resonance enhancement than its overall value in the constant-diffusivity case.  相似文献   
76.
We consider sequences that encode boundary circuits of fused polycycles made up of polygonal faces with p sides, p < or = 6. We give a constructive algorithm for recognizing such sequences when p = 5 or 6. A simpler algorithm is given for planar hexagonal sequences. Hexagonal and pentagonal sequences of length at most 8 are tabulated, the former corresponding to planar benzenoid hydrocarbons CxHy with y up to 14.  相似文献   
77.
We show that any point in the convex hull of each of (d+1) sets of (d+1) points in general position in ℝ d is contained in at least ⌈(d+1)2/2⌉ simplices with one vertex from each set. This improves the known lower bounds for all d≥4.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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