全文获取类型
收费全文 | 2480篇 |
免费 | 313篇 |
国内免费 | 163篇 |
专业分类
化学 | 459篇 |
晶体学 | 6篇 |
力学 | 153篇 |
综合类 | 56篇 |
数学 | 1799篇 |
物理学 | 483篇 |
出版年
2024年 | 4篇 |
2023年 | 55篇 |
2022年 | 79篇 |
2021年 | 102篇 |
2020年 | 129篇 |
2019年 | 79篇 |
2018年 | 76篇 |
2017年 | 97篇 |
2016年 | 114篇 |
2015年 | 78篇 |
2014年 | 112篇 |
2013年 | 178篇 |
2012年 | 94篇 |
2011年 | 108篇 |
2010年 | 87篇 |
2009年 | 120篇 |
2008年 | 156篇 |
2007年 | 133篇 |
2006年 | 139篇 |
2005年 | 111篇 |
2004年 | 96篇 |
2003年 | 85篇 |
2002年 | 120篇 |
2001年 | 84篇 |
2000年 | 92篇 |
1999年 | 99篇 |
1998年 | 58篇 |
1997年 | 59篇 |
1996年 | 45篇 |
1995年 | 22篇 |
1994年 | 18篇 |
1993年 | 21篇 |
1992年 | 11篇 |
1991年 | 9篇 |
1990年 | 6篇 |
1989年 | 9篇 |
1988年 | 10篇 |
1987年 | 10篇 |
1986年 | 10篇 |
1985年 | 4篇 |
1984年 | 9篇 |
1983年 | 2篇 |
1982年 | 6篇 |
1981年 | 2篇 |
1980年 | 2篇 |
1979年 | 3篇 |
1978年 | 3篇 |
1977年 | 4篇 |
1974年 | 2篇 |
1936年 | 1篇 |
排序方式: 共有2956条查询结果,搜索用时 15 毫秒
31.
Jesús M. Velásquez Bermúdez 《Annals of Operations Research》2002,117(1-4):21-31
This document presents theoretical considerations about the solution of dynamic optimization problems integrating the Benders Theory, the Dynamic Programming approach and the concepts of Control Theory. The so called Generalized Dual Dynamic Programming Theory (GDDP) can be considered as an extension of two previous approaches known as Dual Dynamic Programming (DDP): The first is the work developed by Pereira and Pinto [3–5], which was revised by Velásquez and others [8,9]. The second is the work developed by Read and others [2,6,7]. 相似文献
32.
Duan-zhi ZHANG School of Mathematical Sciences Peking University Beijing China 《中国科学A辑(英文版)》2007,50(6):761-772
In this paper, we study the Maslov-type index theory for linear Hamiltonian systems with brake orbits boundary value conditions and its applications to the existence of multiple brake orbits of nonlinear Hamiltonian systems. 相似文献
33.
34.
Anuradha Sharma Gurmeet K. Bakshi Madhu Raka 《Finite Fields and Their Applications》2007,13(4):1071-1085
Polyadic codes constitute a special class of cyclic codes and are generalizations of quadratic residue codes, duadic codes, triadic codes, m-adic residue codes and split group codes, which have good error-correcting properties. In this paper, we give necessary and sufficient conditions for the existence of polyadic codes of prime power length. Examples of some good codes arising from the family of polyadic codes of prime power length are also given. 相似文献
35.
We study algebraic geometric codes obtained from rational normal scrolls. We determine the complete weight hierarchy and spectrum
of these codes.
相似文献
36.
We introduce new classes of 2-weight cyclic codes which are direct sums of 1-weight irreducible cyclic codes
相似文献
37.
Chang-jian Zhao 《中国科学A辑(英文版)》2007,50(9):1347-1360
In this paper, we first introduce a concept of L
p
-dual Quermassintegral sum function of convex bodies and establish the polar projection Minkowski inequality and the polar
projection Aleksandrov-Fenchel inequality for L
p
-dual Quermassintegral sums. Moreover, by using Lutwak’s width-integral of index i, we establish the L
p
-Brunn-Minkowski inequality for the polar mixed projection bodies. As applications, we prove some interrelated results.
This work was partially supported by the National Natural Science Foundation of China (Grant No. 10271071), Zhejiang Provincial
Natural Science Foundation of China (Grant No. Y605065) and Foundation of the Education Department of Zhejiang Province of
China (Grant No. 20050392) 相似文献
38.
Vince Grolmusz 《Designs, Codes and Cryptography》2006,38(3):363-372
We define, construct and sketch possible applications of a new class of non-linear codes: co-orthogonal codes, with possible
applications in cryptography and parallel processing. We also describe a fast and general method for generating (non-linear)
codes with prescribed dot-products with the help of multi-linear polynomials. 相似文献
39.
Lars Eirik Danielsen 《Journal of Combinatorial Theory, Series A》2006,113(7):1351-1367
We consider additive codes over GF(4) that are self-dual with respect to the Hermitian trace inner product. Such codes have a well-known interpretation as quantum codes and correspond to isotropic systems. It has also been shown that these codes can be represented as graphs, and that two codes are equivalent if and only if the corresponding graphs are equivalent with respect to local complementation and graph isomorphism. We use these facts to classify all codes of length up to 12, where previously only all codes of length up to 9 were known. We also classify all extremal Type II codes of length 14. Finally, we find that the smallest Type I and Type II codes with trivial automorphism group have length 9 and 12, respectively. 相似文献
40.