全文获取类型
收费全文 | 1441篇 |
免费 | 70篇 |
国内免费 | 112篇 |
专业分类
化学 | 991篇 |
晶体学 | 29篇 |
力学 | 44篇 |
综合类 | 13篇 |
数学 | 440篇 |
物理学 | 106篇 |
出版年
2024年 | 3篇 |
2023年 | 13篇 |
2022年 | 33篇 |
2021年 | 23篇 |
2020年 | 46篇 |
2019年 | 36篇 |
2018年 | 32篇 |
2017年 | 48篇 |
2016年 | 51篇 |
2015年 | 34篇 |
2014年 | 60篇 |
2013年 | 92篇 |
2012年 | 76篇 |
2011年 | 48篇 |
2010年 | 66篇 |
2009年 | 93篇 |
2008年 | 73篇 |
2007年 | 94篇 |
2006年 | 72篇 |
2005年 | 55篇 |
2004年 | 57篇 |
2003年 | 51篇 |
2002年 | 49篇 |
2001年 | 52篇 |
2000年 | 44篇 |
1999年 | 31篇 |
1998年 | 44篇 |
1997年 | 41篇 |
1996年 | 26篇 |
1995年 | 32篇 |
1994年 | 26篇 |
1993年 | 7篇 |
1992年 | 16篇 |
1991年 | 14篇 |
1990年 | 9篇 |
1989年 | 10篇 |
1988年 | 8篇 |
1987年 | 6篇 |
1986年 | 6篇 |
1985年 | 4篇 |
1984年 | 8篇 |
1983年 | 7篇 |
1982年 | 5篇 |
1981年 | 7篇 |
1980年 | 5篇 |
1979年 | 5篇 |
1978年 | 3篇 |
1976年 | 1篇 |
1969年 | 1篇 |
排序方式: 共有1623条查询结果,搜索用时 15 毫秒
961.
962.
《Discrete Mathematics》2019,342(7):1924-1948
Multiple-weight optical orthogonal signature pattern codes (OOSPCs) were introduced by Kwong and Yang for 2-D image transmission in multicore-fiber optical code-division multiple-access (OCDMA) networks with multiple quality of services (QoS) requirement. In this paper, an upper bound on the maximum code size of a -OOSPC is obtained. A link between optimal -OOSPCs and block designs is developed. Several infinite families of optimal -OOSPCs are presented by means of semi-cyclic group divisible designs (-SCGDDs) and perfect relative difference families. 相似文献
963.
964.
965.
化学接枝改进ZnO-有机硅纳米复合材料的光学性能 总被引:1,自引:0,他引:1
采用N-(三甲氧基硅丙基)-4-叠氮-2,3,5,6-四氟苯甲酰胺(PFPA-silane)改性纳米氧化锌,并将PFPA-silane接枝在有机硅聚合物链上.接枝反应改变了纳米复合物的折光指数,并使ZnO纳米粒子与有机硅基体的折光指数更加匹配.这减少了纳米氧化锌粒子对光的散射作用,增加了纳米ZnO-有机硅纳米复合物的透明性.所制备的复合物通过接枝改性后透光率最多可提高50%.研究结果表明无机物和聚合物的折光指数的匹配程度可以通过偶联剂与聚合物基体的反应来进行调控. 相似文献
966.
967.
A chromatographic technique is introduced based on single-walled carbon nanotubes (SWCNTs) as stationary phase for separation of Ar, CO2 and H2 at parts per million (ppm) levels. The efficiency of SWCNTs was compared with solid materials such as molecular sieve, charcoal, multi-walled carbon nanotubes and carbon nanofibers. The morphology of SWCNTs was optimized for maximum adsorption of H2, CO2 and Ar and minimum adsorption of gases such as N2, O2, CO and H2O vapour. To control temperature of the gas chromatography column, peltier cooler was used. Mixtures of Ar, CO2 and H2 were separated according to column temperature program. Relative standard deviation for nine replicate analyses of 0.2 mL H2 containing 10 μL of each Ar or CO2 was 2.5% for Ar, 2.8% for CO2 and 3.6% for H2. The interfering effects of CO, and O2 were investigated. Working ranges were evaluated as 40-600 ppm for Ar, 30-850 ppm for CO2 and 10-1200 ppm for H2. Significant sensitivity, small relative standard deviation (RSD) and acceptable limit of detection (LOD) were obtained for each analyte, showing capability of SWCNTs for gas separation and determination processes. Finally, the method was used to evaluate the contents of CO2 in air sample. 相似文献
968.
将球形颗粒倒入内径较窄的管状容器时,管壁的曲率会对颗粒的堆积结构产生影响,存在壁效应. 实验表明通过连续的竖直方向的振动,壁效应可以被强化,颗粒可以经由对流由无序排列转变为稳定的同轴筒形“壳层”结构. 每一壳层内,颗粒是二维的六角密堆积, 在这一转变过程中,颗粒堆积率的径向分布由初始的衰减振荡转变为等幅振荡. 分析了堆积率的不均匀性及空气在对流中的作用,以及形成“壳层”结构的动力学过程,对“壳层”结构的稳定性亦进行了讨论.
关键词:
颗粒物质
对流
有序化
毛细 相似文献
969.
《Journal of Graph Theory》2018,87(1):96-107
We generalize an unpublished result of C. Thomassen. Let be a digraph and let be a multiset of subsets of V in such a way that any backward‐infinite path in D meets all the sets . We show that if all is simultaneously reachable from the sets by edge‐disjoint paths, then there exists a system of edge‐disjoint spanning branchings in D where the root‐set of is . 相似文献
970.
The bin packing problem with conflicts (BPC) consists of minimizing the number of bins used to pack a set of items, where some items cannot be packed together in the same bin due to compatibility restrictions. The concepts of dual-feasible functions (DFF) and data-dependent dual-feasible functions (DDFF) have been used in the literature to improve the resolution of several cutting and packing problems. In this paper, we propose a general framework for deriving new DDFF as well as a new concept of generalized data-dependent dual-feasible functions (GDDFF), a conflict generalization of DDFF. The GDDFF take into account the structure of the conflict graph using the techniques of graph triangulation and tree-decomposition. Then we show how these techniques can be used in order to improve the existing lower bounds. 相似文献