全文获取类型
收费全文 | 597篇 |
免费 | 89篇 |
国内免费 | 29篇 |
专业分类
化学 | 336篇 |
晶体学 | 1篇 |
力学 | 7篇 |
综合类 | 13篇 |
数学 | 228篇 |
物理学 | 130篇 |
出版年
2023年 | 5篇 |
2022年 | 11篇 |
2021年 | 16篇 |
2020年 | 23篇 |
2019年 | 21篇 |
2018年 | 13篇 |
2017年 | 18篇 |
2016年 | 26篇 |
2015年 | 30篇 |
2014年 | 23篇 |
2013年 | 43篇 |
2012年 | 15篇 |
2011年 | 24篇 |
2010年 | 36篇 |
2009年 | 32篇 |
2008年 | 22篇 |
2007年 | 18篇 |
2006年 | 39篇 |
2005年 | 28篇 |
2004年 | 17篇 |
2003年 | 25篇 |
2002年 | 11篇 |
2001年 | 19篇 |
2000年 | 8篇 |
1999年 | 11篇 |
1998年 | 13篇 |
1997年 | 7篇 |
1996年 | 7篇 |
1995年 | 3篇 |
1994年 | 3篇 |
1993年 | 6篇 |
1992年 | 2篇 |
1991年 | 5篇 |
1990年 | 4篇 |
1989年 | 3篇 |
1988年 | 4篇 |
1987年 | 2篇 |
1985年 | 7篇 |
1984年 | 6篇 |
1983年 | 3篇 |
1982年 | 9篇 |
1981年 | 4篇 |
1980年 | 8篇 |
1979年 | 5篇 |
1978年 | 8篇 |
1977年 | 18篇 |
1976年 | 13篇 |
1975年 | 10篇 |
1974年 | 11篇 |
1973年 | 19篇 |
排序方式: 共有715条查询结果,搜索用时 15 毫秒
1.
Facile non‐lithographic route to highly aligned silica nanopatterns using unidirectionally aligned polystyrene‐block‐polydimethylsiloxane films
下载免费PDF全文
![点击此处可从《Journal of Polymer Science.Polymer Physics》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Zhe Qiang Maurice L. Wadley Bryan D. Vogt Kevin A. Cavicchi 《Journal of Polymer Science.Polymer Physics》2015,53(15):1058-1064
Thin films (monolayer and bilayer) of cylinder forming polystyrene‐block‐polydimethylsiloxane (PS‐b‐PDMS) were shear aligned by the swelling and deswelling of a crosslinked PDMS pad that was physically adhered to the film during solvent vapor annealing. The nanostructures formed by self‐assembly were exposed to ultraviolet‐ozone to partially oxidize the PDMS, followed by calcination in air at 500 °C. In this process, the PS segments were fully decomposed, while the PDMS yielded silica nanostructures. The highly aligned PDMS cylinders were thus deposited as silica nanolines on the silicon substrate. Using a bilayer film, the center‐to‐center distance of these features were effectively halved from 38 to 19 nm. Similarly, by sequential shear‐alignment of two distinct layers, a rhombic array of silica nanolines was fabricated. This methodology provides a facile route to fabricating complex topographically patterned nanostructures. © 2015 Wiley Periodicals, Inc. J. Polym. Sci., Part B: Polym. Phys. 2015 , 53, 1058–1064 相似文献
2.
Michael T. Jury David W. Kribs 《Proceedings of the American Mathematical Society》2005,133(1):213-222
Given a row contraction of operators on a Hilbert space and a family of projections on the space that stabilizes the operators, we show there is a unique minimal joint dilation to a row contraction of partial isometries that satisfy natural relations. For a fixed row contraction the set of all dilations forms a partially ordered set with a largest and smallest element. A key technical device in our analysis is a connection with directed graphs. We use a Wold decomposition for partial isometries to describe the models for these dilations, and we discuss how the basic properties of a dilation depend on the row contraction.
3.
Shunsuke Inenaga Ayumi Shinohara Masayuki Takeda Setsuo Arikawa 《Journal of Discrete Algorithms》2004,2(1):33
Suffix trees are a well-known and widely-studied data structure highly useful for string matching. The suffix tree of a string w can be constructed in O(n) time and space, where n denotes the length of w. Larsson achieved an efficient algorithm to maintain suffix trees for a sliding window. It contributes to prediction by partial matching (PPM) style statistical data compression scheme. Compact directed acyclic word graphs (CDAWGs) are a more space-economical data structure for indexing strings. In this paper we propose a linear-time algorithm to maintain CDAWGs for a sliding window. 相似文献
4.
The synthesis of several analogues of (±)-semivioxanthin including five thiophene analogues, using directed metalation are reported. The strategy consisted of the synthesis of functionalized naphthalene or benzo[b]thiophene as building blocks followed by annelation of the pyrone. 相似文献
5.
本文证明了:(1)Exchange环R的K0群的正向凸子群格同构于R的稳定余有限半本原理想格;(2)稳定有限、半本原的exchange环R是单的当且仅当它是K0-单的并且满足逼近弱s^*—可比性,推广了Goodearl,Ara等人的结果。 相似文献
6.
Let G = (V,E) be a graph or digraph and r : V → Z+. An r‐detachment of G is a graph H obtained by ‘splitting’ each vertex ν ∈ V into r(ν) vertices. The vertices ν1,…,νr(ν) obtained by splitting ν are called the pieces of ν in H. Every edge uν ∈ E corresponds to an edge of H connecting some piece of u to some piece of ν. Crispin Nash‐Williams 9 gave necessary and sufficient conditions for a graph to have a k‐edge‐connected r‐detachment. He also solved the version where the degrees of all the pieces are specified. In this paper, we solve the same problems for directed graphs. We also give a simple and self‐contained new proof for the undirected result. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 67–77, 2003 相似文献
7.
3族新的不含紧优与几乎紧优的有向双环网络无限族 总被引:2,自引:0,他引:2
给出了3族新的不含紧优与几乎紧优的有向双环网络. 相似文献
8.
本文给出了一种方法用于构造k-紧优双环网络无限族(k≥1),并用此方法构造出了4族3-紧优无限族,3族新的4-紧比无限族,3族5-紧优无限族及2族6-紧优无限族. 相似文献
9.
10.