全文获取类型
收费全文 | 9050篇 |
免费 | 895篇 |
国内免费 | 876篇 |
专业分类
化学 | 7213篇 |
晶体学 | 21篇 |
力学 | 38篇 |
综合类 | 103篇 |
数学 | 2500篇 |
物理学 | 946篇 |
出版年
2024年 | 17篇 |
2023年 | 139篇 |
2022年 | 202篇 |
2021年 | 265篇 |
2020年 | 373篇 |
2019年 | 353篇 |
2018年 | 274篇 |
2017年 | 296篇 |
2016年 | 343篇 |
2015年 | 359篇 |
2014年 | 425篇 |
2013年 | 756篇 |
2012年 | 679篇 |
2011年 | 569篇 |
2010年 | 561篇 |
2009年 | 690篇 |
2008年 | 671篇 |
2007年 | 652篇 |
2006年 | 633篇 |
2005年 | 512篇 |
2004年 | 391篇 |
2003年 | 348篇 |
2002年 | 255篇 |
2001年 | 191篇 |
2000年 | 154篇 |
1999年 | 159篇 |
1998年 | 106篇 |
1997年 | 102篇 |
1996年 | 63篇 |
1995年 | 56篇 |
1994年 | 39篇 |
1993年 | 29篇 |
1992年 | 24篇 |
1991年 | 20篇 |
1990年 | 20篇 |
1989年 | 17篇 |
1988年 | 12篇 |
1987年 | 4篇 |
1986年 | 7篇 |
1985年 | 14篇 |
1984年 | 13篇 |
1983年 | 6篇 |
1982年 | 4篇 |
1981年 | 2篇 |
1980年 | 3篇 |
1979年 | 2篇 |
1978年 | 4篇 |
1973年 | 2篇 |
1970年 | 1篇 |
1969年 | 3篇 |
排序方式: 共有10000条查询结果,搜索用时 46 毫秒
1.
2.
For an integer , a graph is -hamiltonian if for any vertex subset with , is hamiltonian, and is -hamiltonian connected if for any vertex subset with , is hamiltonian connected. Thomassen in 1984 conjectured that every 4-connected line graph is hamiltonian (see Thomassen, 1986), and Ku?zel and Xiong in 2004 conjectured that every 4-connected line graph is hamiltonian connected (see Ryjá?ek and Vrána, 2011). In Broersma and Veldman (1987), Broersma and Veldman raised the characterization problem of -hamiltonian line graphs. In Lai and Shao (2013), it is conjectured that for , a line graph is -hamiltonian if and only if is -connected. In this paper we prove the following.(i) For an integer , the line graph of a claw-free graph is -hamiltonian if and only if is -connected.(ii) The line graph of a claw-free graph is 1-hamiltonian connected if and only if is 4-connected. 相似文献
3.
Ronald Pethig 《Electrophoresis》2019,40(18-19):2575-2583
Dielectrophoresis (DEP) studies have progressed from the microscopic scale of cells and bacteria, through the mesoscale of virions to the molecular scale of DNA and proteins. The Clausius‐Mossotti function, based on macroscopic electrostatics, is invariably employed in the analyses of all these studies. The limitations of this practice are explored, with the conclusion that it should be abandoned for the DEP study of proteins and modified for native DNA. For macromolecular samples in general, a DEP theory that incorporates molecular‐scale interactions and the influence of permanent dipoles is more appropriate. Experimental ways to test these conclusions are proposed. 相似文献
4.
Synthesis,spectral investigation and development of tetrahedral copper(II) complexes as artificial metallonucleases and antimalarial agents
下载免费PDF全文
![点击此处可从《应用有机金属化学》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Seven new copper(II) complexes of type [Cu(A)(L)]?H2O (A = sparfloxacin, ciprofloxacin, levofloxacin, gatifloxacin, pefloxacin, ofloxacin, norfloxacin; L = 5‐[(3‐chlorophenyl)diazenyl]‐4‐hydroxy‐1,3‐thiazole‐2(3H)‐thione) were synthesized and characterized using elemental and thermogravimetric analyses, and electronic, electron paramagnetic resonance (EPR), Fourier transform infrared and liquid chromatography–mass spectroscopies. Tetrahedral geometry around copper is assigned in all complexes using EPR and electronic spectral analyses. All complexes were investigated for their interaction with herring sperm DNA utilizing absorption titration (Kb = 1.27–3.13 × 105 M?1) and hydrodynamic volume measurement studies. The studies suggest the classical intercalative mode of DNA binding. The cleavage reaction on pUC19 DNA was monitored by agarose gel electrophoresis. The results indicate that the Cu(II) complexes can more effectively promote the cleavage of plasmid DNA. The superoxide dismutase mimic activity of the complexes was evaluated by nitroblue tetrazolium assay, and the complexes catalysed the dismutation of superoxide at pH = 7.8 with IC50 values in the range 0.597–0.900 μM. The complexes were screened for their in vitro antibacterial activity against five pathogenic bacteria. All the complexes are good cytotoxic agents and show LC50 values ranging from 5.559 to 11.912 µg ml?1. All newly synthesized Cu(II) complexes were also evaluated for their in vitro antimalarial activity against Plasmodium falciparum strain (IC50 = 0.62–2.0 µg ml?1). Copyright © 2015 John Wiley & Sons, Ltd. 相似文献
5.
Functional Binding Surface of a β‐Hairpin VEGF Receptor Targeting Peptide Determined by NMR Spectroscopy in Living Cells
下载免费PDF全文
![点击此处可从《Chemistry (Weinheim an der Bergstrasse, Germany)》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Dr. Donatella Diana Anna Russomanno Dr. Lucia De Rosa Dr. Rossella Di Stasi Dr. Domenica Capasso Dr. Sonia Di Gaetano Dr. Alessandra Romanelli Dr. Luigi Russo Dr. Luca D. D'Andrea Prof. Roberto Fattorusso 《Chemistry (Weinheim an der Bergstrasse, Germany)》2015,21(1):91-95
In this study, the functional interaction of HPLW peptide with VEGFR2 (Vascular Endothelial Growth Factor Receptor 2) was determined by using fast 15N‐edited NMR spectroscopic experiments. To this aim, 15N uniformly labelled HPLW has been added to Porcine Aortic Endothelial Cells. The acquisition of isotope‐edited NMR spectroscopic experiments, including 15N relaxation measurements, allowed a precise characterization of the in‐cell HPLW epitope recognized by VEGFR2. 相似文献
6.
7.
8.
Given an ‐vertex pseudorandom graph and an ‐vertex graph with maximum degree at most two, we wish to find a copy of in , that is, an embedding so that for all . Particular instances of this problem include finding a triangle‐factor and finding a Hamilton cycle in . Here, we provide a deterministic polynomial time algorithm that finds a given in any suitably pseudorandom graph . The pseudorandom graphs we consider are ‐bijumbled graphs of minimum degree which is a constant proportion of the average degree, that is, . A ‐bijumbled graph is characterised through the discrepancy property: for any two sets of vertices and . Our condition on bijumbledness is within a log factor from being tight and provides a positive answer to a recent question of Nenadov. We combine novel variants of the absorption‐reservoir method, a powerful tool from extremal graph theory and random graphs. Our approach builds on our previous work, incorporating the work of Nenadov, together with additional ideas and simplifications. 相似文献
9.
10.