全文获取类型
收费全文 | 2596篇 |
免费 | 339篇 |
国内免费 | 338篇 |
专业分类
化学 | 170篇 |
晶体学 | 2篇 |
力学 | 152篇 |
综合类 | 93篇 |
数学 | 2146篇 |
物理学 | 710篇 |
出版年
2024年 | 5篇 |
2023年 | 17篇 |
2022年 | 47篇 |
2021年 | 55篇 |
2020年 | 58篇 |
2019年 | 68篇 |
2018年 | 79篇 |
2017年 | 84篇 |
2016年 | 83篇 |
2015年 | 66篇 |
2014年 | 106篇 |
2013年 | 259篇 |
2012年 | 129篇 |
2011年 | 141篇 |
2010年 | 155篇 |
2009年 | 148篇 |
2008年 | 200篇 |
2007年 | 199篇 |
2006年 | 169篇 |
2005年 | 156篇 |
2004年 | 131篇 |
2003年 | 127篇 |
2002年 | 122篇 |
2001年 | 104篇 |
2000年 | 118篇 |
1999年 | 97篇 |
1998年 | 59篇 |
1997年 | 59篇 |
1996年 | 55篇 |
1995年 | 37篇 |
1994年 | 23篇 |
1993年 | 15篇 |
1992年 | 9篇 |
1991年 | 16篇 |
1990年 | 13篇 |
1989年 | 10篇 |
1988年 | 2篇 |
1987年 | 5篇 |
1986年 | 7篇 |
1985年 | 7篇 |
1984年 | 4篇 |
1983年 | 2篇 |
1982年 | 7篇 |
1981年 | 5篇 |
1980年 | 5篇 |
1979年 | 2篇 |
1977年 | 3篇 |
1976年 | 1篇 |
1973年 | 1篇 |
1936年 | 2篇 |
排序方式: 共有3273条查询结果,搜索用时 15 毫秒
31.
CHAOS FOR MIXING TRANSFORMATIONS 总被引:3,自引:0,他引:3
Liao Gongfu 《数学年刊B辑(英文版)》1994,15(4):501-506
CHAOSFORMIXINGTRANSFORMATIONS¥LIAOGONGFU(DepartmentofMathematics,JilinUniversity,Changchun130023,China.)Abstract:Foraclassofm... 相似文献
32.
Let and be real Banach spaces. A map between and is called an -bi-Lipschitz map if for all . In this note we show that if is an -bi-Lipschitz map with from onto , then is almost linear. We also show that if is a surjective -bi-Lipschitz map with , then there exists a linear isomorphism such that
where as and .
33.
Robert W. Baddeley 《Journal of Algebraic Combinatorics》1993,2(3):215-237
The paper addresses a part of the problem of classifying all 2-arc transitive graphs: namely, that of finding all groups acting 2-arc transitively on finite connected graphs such that there exists a minimal normal subgroup that is nonabelian and regular on vertices. A construction is given for such groups, together with the associated graphs, in terms of the following ingredients: a nonabelian simple group T, a permutation group P acting 2-transitively on a set , and a map F : Tsuch that x = x
–1 for all x
F() and such that Tis generated by F(). Conversely we show that all such groups and graphs arise in this way. Necessary and sufficient conditions are found for the construction to yield groups that are permutation equivalent in their action on the vertices of the associated graphs (which are consequently isomorphic). The different types of groups arising are discussed and various examples given. 相似文献
34.
35.
36.
C. Ogle 《K-Theory》1992,6(3):235-265
Following Connes and Moscovici, we show that the Baum-Connes assembly map forK
*(C*v) is rationally injective when is word-hyperbolic, implying the Equivariant Novikov conjecture for such groups. Using this result in topologicalK-theory and Borel-Karoubi regulators, we also show that the corresponding generalized assembly map in algebraicK-theory is rationally injective. 相似文献
37.
在项目开发前期通过优化电驱动桥扭矩特性的设计,可以规避噪声大问题。根据电驱动桥台架在对应扭矩下的振动噪声特性,提出了一套稳定高效的测试流程和分析方法。首先设计了一套完整的试验流程,制定了精准的数据分析方法。然后绘制出能够全面反映电驱动桥振动噪声特性的等高图。最后利用电驱动桥台架的振动噪声等高图,准确评估电驱动桥加速工况下振动噪声风险,为主机厂和电驱动桥零部件企业提供电驱动桥扭矩特性设计前期指导。利用该方法成功识别到某电驱动桥匀速及加速工况下电机及齿轮的啸叫问题。通过优化电驱动桥扭矩特性设计,电机48阶噪声峰值降低了8.5dB(A),确认该方法准确可靠,具备推广应用价值。 相似文献
38.
The authors introduce a notion of a weak graph map homotopy (they call it
M-homotopy), discuss its properties and applications. They prove that the weak graph
map homotopy equivalence between graphs coincides with the graph homotopy equivalence
defined by Yau et al in 2001. The difference between them is that the weak graph map
homotopy transformation is defined in terms of maps, while the graph homotopy transformation is defined by means of combinatorial operations. They discuss its advantages over
the graph homotopy transformation. As its applications, they investigate the mapping
class group of a graph and the 1-order MP-homotopy group of a pointed simple graph.
Moreover, they show that the 1-order MP-homotopy group of a pointed simple graph is
invariant up to the weak graph map homotopy equivalence. 相似文献
39.
提出一种微混合器混合性能的评价方法.在样品盒中注入不同浓度罗丹明B溶液并用体视显微镜观察捕获图像,通过Image J软件读取图像灰度值,建立不同深度下溶液的浓度-灰度值函数关系,运用此关系式将T型微混合器3种不同深度(0.1、 0.2和0.4 mm,质量浓度0.05 %的罗丹明B溶液和去离子水作为配对流体)混合实验中捕获的图像中各像素点上的灰度值转换为浓度值,绘制浓度等高线图及浓度频数分布图,分析各自混合情况,最后引入浓度混合指数概念及计算公式,分析3种深度混合器内不同截面上的混合程度.此方法从定性和定量两方面分析了微尺度下混合腔深度对微混合的影响程度,具有一定的应用价值. 相似文献
40.
Xin Meng Jinqing Li Xiaoqiang Di Yaohui Sheng Donghua Jiang 《Entropy (Basel, Switzerland)》2022,24(7)
Today, with the rapid development of the Internet, improving image security becomes more and more important. To improve image encryption efficiency, a novel region of interest (ROI) encryption algorithm based on a chaotic system was proposed. First, a new 1D -cos-cot (1D-ECC) with better chaotic performance than the traditional chaotic system is proposed. Second, the chaotic system is used to generate a plaintext-relate keystream based on the label information of a medical image DICOM (Digital Imaging and Communications in Medicine) file, the medical image is segmented using an adaptive threshold, and the segmented region of interest is encrypted. The encryption process is divided into two stages: scrambling and diffusion. In the scrambling stage, helical scanning and index scrambling are combined to scramble. In the diffusion stage, two-dimensional bi-directional diffusion is adopted, that is, the image is bi-directionally diffused row by column to make image security better. The algorithm offers good encryption speed and security performance, according to simulation results and security analysis. 相似文献