全文获取类型
收费全文 | 578篇 |
免费 | 40篇 |
国内免费 | 21篇 |
专业分类
化学 | 43篇 |
力学 | 9篇 |
综合类 | 10篇 |
数学 | 555篇 |
物理学 | 22篇 |
出版年
2024年 | 3篇 |
2023年 | 3篇 |
2022年 | 15篇 |
2021年 | 5篇 |
2020年 | 20篇 |
2019年 | 17篇 |
2018年 | 16篇 |
2017年 | 13篇 |
2016年 | 16篇 |
2015年 | 7篇 |
2014年 | 20篇 |
2013年 | 36篇 |
2012年 | 18篇 |
2011年 | 30篇 |
2010年 | 25篇 |
2009年 | 36篇 |
2008年 | 43篇 |
2007年 | 32篇 |
2006年 | 49篇 |
2005年 | 22篇 |
2004年 | 21篇 |
2003年 | 17篇 |
2002年 | 19篇 |
2001年 | 27篇 |
2000年 | 19篇 |
1999年 | 28篇 |
1998年 | 26篇 |
1997年 | 13篇 |
1996年 | 10篇 |
1995年 | 7篇 |
1994年 | 4篇 |
1993年 | 4篇 |
1992年 | 3篇 |
1991年 | 1篇 |
1990年 | 2篇 |
1989年 | 1篇 |
1988年 | 1篇 |
1987年 | 2篇 |
1986年 | 1篇 |
1985年 | 4篇 |
1984年 | 2篇 |
1980年 | 1篇 |
排序方式: 共有639条查询结果,搜索用时 46 毫秒
71.
In this paper, we consider regular automorphism groups of graphs in the RT2 family and the Davis‐Xiang family and amorphic abelian Cayley schemes from these graphs. We derive general results on the existence of non‐abelian regular automorphism groups from abelian regular automorphism groups and apply them to the RT2 family and Davis‐Xiang family and their amorphic abelian Cayley schemes to produce amorphic non‐abelian Cayley schemes. 相似文献
72.
《Random Structures and Algorithms》2018,52(2):181-196
An intercalate in a Latin square is a 2 × 2 Latin subsquare. Let be the number of intercalates in a uniformly random n × n Latin square. We prove that asymptotically almost surely , and that (therefore asymptotically almost surely for any ). This significantly improves the previous best lower and upper bounds. We also give an upper tail bound for the number of intercalates in 2 fixed rows of a random Latin square. In addition, we discuss a problem of Linial and Luria on low‐discrepancy Latin squares. 相似文献
73.
《组合设计杂志》2018,26(8):387-400
Let X be a ‐set and be a partition of X into n groups of size 2 and one group G0 of size 4. A large‐set‐plus denoted by LS is a partition of all ‐transverse triples of X into block sets of 3‐GDD(2n41)s with group set , and two block sets of 3‐GDD(2n)s with group set . In this paper, we study the existence problem of LSs and give a nearly complete solution. 相似文献
74.
《组合设计杂志》2018,26(7):344-355
We derive a previously unknown lower bound of 41 for the frequency of of an E(s2)‐optimal and minimax‐optimal supersaturated design (SSD) with 20 rows and 76 columns. This is accomplished by an exhaustive computer search that uses the combinatorial properties of resolvable 2 − (20, 10, 36) designs and the parallel class intersection pattern method. We also classify all nonisomorphic E(s2)‐optimal 4‐circulant SSDs with 20 rows and . 相似文献
75.
Ganesh Dutta 《Discrete Mathematics》2010,310(5):1037-1049
The choice of covariates values for a given block design attaining minimum variance for estimation of each of the regression parameters of the model has attracted attention in recent times. In this article, we consider the problem of finding the optimum covariate design (OCD) for the estimation of covariate parameters in a binary proper equi-replicate block (BPEB) design model with covariates, which cover a large class of designs in common use. The construction of optimum designs is based mainly on Hadamard matrices. 相似文献
76.
针对具有正态分布随机变量的多属性决策问题,依据属性均值聚类思想,提出了一种计算机编程求解方法.方法避开了区间数的运算和比较,评价结果不具有主观随意性.最后,我们给出了一个实际应用的例子,验证了方法的有效性. 相似文献
77.
本文证明了若群G旗传递地作用于4-(v,k,2)设计,且G是仿射型群,则SL(ad,pa)G0,这里v=pd,a|d,0是p元域上的d维向量空间的零向量。 相似文献
78.
Dragomir
.
okovi 《组合设计杂志》2010,18(4):254-259
We show that 138 odd values of n<10000 for which a Hadamard matrix of order 4n exists have been overlooked in the recent handbook of combinatorial designs. There are four additional odd n=191, 5767, 7081, 8249 in that range for which Hadamard matrices of order 4n exist. There is a unique equivalence class of near‐normal sequences NN(36), and the same is true for NN(38) and NN(40). This means that the Yang conjecture on the existence of near‐normal sequences NN(n) has been verified for all even n⩽40, but it still remains open. © 2010 Wiley Periodicals, Inc. J Combin Designs 18: 254–259, 2010 相似文献
79.
Douglas S. Stones 《Journal of Combinatorial Theory, Series A》2010,117(2):204-215
A k×n Latin rectangle on the symbols {1,2,…,n} is called reduced if the first row is (1,2,…,n) and the first column is T(1,2,…,k). Let Rk,n be the number of reduced k×n Latin rectangles and m=⌊n/2⌋. We prove several results giving divisors of Rk,n. For example, (k−1)! divides Rk,n when k?m and m! divides Rk,n when m<k?n. We establish a recurrence which determines the congruence class of for a range of different t. We use this to show that Rk,n≡((−1)k−1(k−1)!)n−1. In particular, this means that if n is prime, then Rk,n≡1 for 1?k?n and if n is composite then if and only if k is larger than the greatest prime divisor of n. 相似文献
80.
Aleš Drápal 《Discrete Applied Mathematics》2010,158(14):1479-1495
We enumerate all dissections of an equilateral triangle into smaller equilateral triangles up to size 20, where each triangle has integer side lengths. A perfect dissection has no two triangles of the same side, counting up- and down-oriented triangles as different. We computationally prove Tutte’s conjecture that the smallest perfect dissection has size 15 and we find all perfect dissections up to size 20. 相似文献