全文获取类型
收费全文 | 255篇 |
免费 | 22篇 |
国内免费 | 13篇 |
专业分类
化学 | 5篇 |
力学 | 4篇 |
综合类 | 8篇 |
数学 | 263篇 |
物理学 | 10篇 |
出版年
2024年 | 1篇 |
2023年 | 1篇 |
2022年 | 8篇 |
2021年 | 4篇 |
2020年 | 15篇 |
2019年 | 10篇 |
2018年 | 12篇 |
2017年 | 7篇 |
2016年 | 9篇 |
2015年 | 6篇 |
2014年 | 8篇 |
2013年 | 18篇 |
2012年 | 14篇 |
2011年 | 20篇 |
2010年 | 11篇 |
2009年 | 13篇 |
2008年 | 24篇 |
2007年 | 12篇 |
2006年 | 26篇 |
2005年 | 9篇 |
2004年 | 8篇 |
2003年 | 3篇 |
2002年 | 7篇 |
2001年 | 9篇 |
2000年 | 6篇 |
1999年 | 8篇 |
1998年 | 6篇 |
1997年 | 4篇 |
1996年 | 2篇 |
1995年 | 2篇 |
1994年 | 1篇 |
1993年 | 3篇 |
1992年 | 2篇 |
1991年 | 1篇 |
排序方式: 共有290条查询结果,搜索用时 31 毫秒
161.
Paratopism is a well‐known action of the wreath product on Latin squares of order n. A paratopism that maps a Latin square to itself is an autoparatopism of that Latin square. Let Par(n) denote the set of paratopisms that are an autoparatopism of at least one Latin square of order n. We prove a number of general properties of autoparatopisms. Applying these results, we determine Par(n) for . We also study the proportion of all paratopisms that are in Par(n) as . 相似文献
162.
163.
Permutation polynomials of finite fields have many applications in Coding Theory, Cryptography and Combinatorics. In the first part of this paper we present a new family of local permutation polynomials based on a class of symmetric subgroups without fixed points, the so called e-Klenian groups. In the second part we use the fact that bivariate local permutation polynomials define Latin Squares, to discuss several constructions of Mutually Orthogonal Latin Squares (MOLS) and, in particular, we provide a new construction of MOLS on size a prime power. 相似文献
164.
利用不同的序列作为波长跳频序列和时间扩频序列可以构造出不同的二维光正交码在众多文献中已有所报道.在经过正交拉丁方(OLS)与跳频序列的相关性研究之后.做了以下主要工作:首先,将正交拉丁方(OLS)序列作为波长跳频序列,结合一维时间扩频序列(OOC),构造了一种OLS/OOC二维光正交码.然后,本文对构造的OLS/OOC进行了多种性能仿真和分析.相对于PC/OOC、OCFHC/OOC等二维光正交码而言,OLS/OOC的波长数并不局限于素数,更能充分利用MWOCDMA系统中的有效波长数.仿真和分析表明:码字具有很好的相关性能,码字容量直逼理论极限,为一种渐近最优二维光正交码. 相似文献
165.
Manouchehr Zaker 《Discrete Applied Mathematics》2007,155(4):558-565
In a partial Latin square P a set of distinct entries, such that no two of which are in the same row or column is called a transversal. By the size of a transversal T, we mean the number of its entries. We define a duplex to be a partial Latin square of order n containing 2n entries such that exactly two entries lie in each row and column and each of n symbols occurs exactly twice. We show that determining the maximum size of a transversal in a given duplex is an NP-complete problem. This problem relates to independent sets in certain subfamilies of cubic graphs. Generalizing the concept of transversals in edge coloring of graphs we are led to introduce the concept of rainbow matching. We show that if each color appears at most twice then it is a polynomial time problem to know whether there exists a rainbow matching of size at least ⌊n/2⌋-t for each fixed t, where n is the order of the graph. As an application we show that for any fixed t, there is a polynomial time algorithm which decides whether α(G)?n-t, for any graph G on 2n vertices containing a perfect matching. At the end we mention some other applications of rainbow matching. 相似文献
166.
The study of a class of optimal constant weight codes over arbitrary alphabets was initiated by Etzion, who showed that such codes are equivalent to special GDDs known as generalized Steiner systems GS(t,k,n,g) Etzion. This paper presents new constructions for these systems in the case t=2, k=3. In particular, these constructions imply that the obvious necessary conditions on the length n of the code for the existence of an optimal weight 3, distance 3 code over an alphabet of arbitrary size are asymptotically sufficient. 相似文献
167.
168.
We study equitable partitions of Latin‐square graphs and give a complete classification of those whose quotient matrix does not have an eigenvalue ?3. 相似文献
169.
170.