全文获取类型
收费全文 | 1947篇 |
免费 | 188篇 |
国内免费 | 111篇 |
专业分类
化学 | 169篇 |
晶体学 | 1篇 |
力学 | 78篇 |
综合类 | 41篇 |
数学 | 1379篇 |
物理学 | 578篇 |
出版年
2024年 | 3篇 |
2023年 | 35篇 |
2022年 | 68篇 |
2021年 | 58篇 |
2020年 | 75篇 |
2019年 | 68篇 |
2018年 | 63篇 |
2017年 | 66篇 |
2016年 | 64篇 |
2015年 | 45篇 |
2014年 | 87篇 |
2013年 | 274篇 |
2012年 | 63篇 |
2011年 | 95篇 |
2010年 | 67篇 |
2009年 | 116篇 |
2008年 | 138篇 |
2007年 | 112篇 |
2006年 | 123篇 |
2005年 | 93篇 |
2004年 | 93篇 |
2003年 | 53篇 |
2002年 | 62篇 |
2001年 | 66篇 |
2000年 | 40篇 |
1999年 | 53篇 |
1998年 | 32篇 |
1997年 | 24篇 |
1996年 | 21篇 |
1995年 | 12篇 |
1994年 | 19篇 |
1993年 | 7篇 |
1992年 | 3篇 |
1991年 | 5篇 |
1990年 | 7篇 |
1989年 | 7篇 |
1988年 | 8篇 |
1987年 | 1篇 |
1986年 | 2篇 |
1985年 | 3篇 |
1984年 | 3篇 |
1983年 | 3篇 |
1981年 | 1篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1977年 | 2篇 |
1971年 | 2篇 |
1969年 | 1篇 |
排序方式: 共有2246条查询结果,搜索用时 31 毫秒
51.
研究给出了一类基于循环码的常重复合码的构造,并利用指数和计算其参数.与相关的常重复合码相比,该码具有更多的码字,且渐近性较好. 相似文献
52.
We introduce the concept of a pentagonal geometry as a generalization of the pentagon and the Desargues configuration, in the same vein that the generalized polygons share the fundamental properties of ordinary polygons. In short, a pentagonal geometry is a regular partial linear space in which for all points x, the points not collinear with the point x, form a line. We compute bounds on their parameters, give some constructions, obtain some nonexistence results for seemingly feasible parameters and suggest a cryptographic application related to identifying codes of partial linear spaces. 相似文献
53.
王永平 《数学的实践与认识》2014,(6)
在语言图Γ(X*)概念的基础上,用新引入的语言竹竿l(X*)和语言竹竿集L(X*)的概念形象地刻画了前缀码与极大前缀码:A是前缀码l(X*)∈L(X*),S_l_((X*))∩A或为单点集或为Φ;A是极大前缀码l(X*)∈L(X*),i)S_(l(X*))∩A或为单点集或为Φ.ii)S_(l(X*))∩A=Φ■u∈S_(l(X*)),■a∈A,ω∈X~+使a=uw. 相似文献
54.
Dermot McCarthy 《代数通讯》2013,41(12):5133-5134
When studying the conjugacy class version of the Huppert’s ρ-σ conjecture, Jiping Zhang raised a number theory question. In this article, we provide examples to show that the question raised by Zhang is not always true in general. 相似文献
55.
Hai Q. Dinh Xiaoqiang Wang Hongwei Liu Songsak Sriboonchitta 《Discrete Mathematics》2019,342(5):1456-1470
Let be an odd prime, , be positive integers, be nonzero elements of the finite field such that . In this paper, we show that, for any positive integer , the Hamming distances of all repeated-root -constacyclic codes of length can be determined by those of certain simple-root -constacyclic codes of length . Using this result, Hamming distances of all constacyclic codes of length are obtained. As an application, we identify all MDS -constacyclic codes of length . 相似文献
56.
Is it true that every matching in the n-dimensional hypercube can be extended to a Gray code? More than two decades have passed since Ruskey and Savage asked this question and the problem still remains open. A solution is known only in some special cases, including perfect matchings or matchings of linear size. This article shows that the answer to the Ruskey–Savage problem is affirmative for every matching of size at most . The proof is based on an inductive construction that extends balanced matchings in the completion of the hypercube by edges of into a Hamilton cycle of . On the other hand, we show that for every there is a balanced matching in of size that cannot be extended in this way. 相似文献
58.
Let be a finite field of cardinality , which is a finite chain ring, and is an odd positive integer. For any , an explicit representation for the dual code of any -constacyclic code over of length is given. And some dual codes of -constacyclic codes over of length 14 are constructed. For the case of , all distinct self-dual -constacyclic codes over of length are determined. 相似文献
59.
60.
We discuss the motion of substance in a channel containing nodes of a network. Each node of the channel can exchange substance with: (i) neighboring nodes of the channel, (ii) network nodes which do not belong to the channel, and (iii) environment of the network. The new point in this study is that we assume possibility for exchange of substance among flows of substance between nodes of the channel and: (i) nodes that belong to the network but do not belong to the channel and (ii) environment of the network. This leads to an extension of the model of motion of substance and the extended model contains previous models as particular cases. We use a discrete-time model of motion of substance and consider a stationary regime of motion of substance in a channel containing a finite number of nodes. As results of the study, we obtain a class of probability distributions connected to the amount of substance in nodes of the channel. We prove that the obtained class of distributions contains all truncated discrete probability distributions of discrete random variable which can take values . Theory for the case of a channel containing infinite number of nodes is presented in Appendix A. The continuous version of the discussed discrete probability distributions is described in Appendix B. The discussed extended model and obtained results can be used for the study of phenomena that can be modeled by flows in networks: motion of resources, traffic flows, motion of migrants, etc. 相似文献