首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   8607篇
  免费   333篇
  国内免费   548篇
化学   1451篇
晶体学   47篇
力学   21篇
综合类   31篇
数学   2931篇
物理学   5007篇
  2024年   16篇
  2023年   106篇
  2022年   123篇
  2021年   113篇
  2020年   245篇
  2019年   258篇
  2018年   265篇
  2017年   228篇
  2016年   317篇
  2015年   288篇
  2014年   423篇
  2013年   571篇
  2012年   394篇
  2011年   670篇
  2010年   495篇
  2009年   698篇
  2008年   648篇
  2007年   509篇
  2006年   545篇
  2005年   354篇
  2004年   351篇
  2003年   289篇
  2002年   244篇
  2001年   207篇
  2000年   212篇
  1999年   157篇
  1998年   193篇
  1997年   85篇
  1996年   70篇
  1995年   54篇
  1994年   49篇
  1993年   35篇
  1992年   38篇
  1991年   39篇
  1990年   30篇
  1989年   26篇
  1988年   32篇
  1987年   10篇
  1986年   20篇
  1985年   22篇
  1984年   13篇
  1983年   8篇
  1982年   6篇
  1981年   4篇
  1980年   6篇
  1979年   3篇
  1978年   4篇
  1977年   4篇
  1973年   4篇
  1970年   2篇
排序方式: 共有9488条查询结果,搜索用时 46 毫秒
1.
2.
For an integer s0, a graph G is s-hamiltonian if for any vertex subset S?V(G) with |S|s, G?S is hamiltonian, and G is s-hamiltonian connected if for any vertex subset S?V(G) with |S|s, G?S 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 s-hamiltonian line graphs. In Lai and Shao (2013), it is conjectured that for s2, a line graph L(G) is s-hamiltonian if and only if L(G) is (s+2)-connected. In this paper we prove the following.(i) For an integer s2, the line graph L(G) of a claw-free graph G is s-hamiltonian if and only if L(G) is (s+2)-connected.(ii) The line graph L(G) of a claw-free graph G is 1-hamiltonian connected if and only if L(G) is 4-connected.  相似文献   
3.
A generic strategy based on the use of CdSe/ZnS Quantum Dots (QDs) as elemental labels for protein quantification, using immunoassays with elemental mass spectrometry (ICP-MS), detection is presented. In this strategy, streptavidin modified QDs (QDs-SA) are bioconjugated to a biotinylated secondary antibody (b-Ab2). After a multi-technique characterization of the synthesized generic platform (QDs-SA-b-Ab2) it was applied to the sequential quantification of five proteins (transferrin, complement C3, apolipoprotein A1, transthyretin and apolipoprotein A4) at different concentration levels in human serum samples. It is shown how this generic strategy does only require the appropriate unlabeled primary antibody for each protein to be detected. Therefore, it introduces a way out to the need for the cumbersome and specific bioconjugation of the QDs to the corresponding specific recognition antibody for every target analyte (protein). Results obtained were validated with those obtained using UV–vis spectrophotometry and commercial ELISA Kits.  相似文献   
4.
In 1976 S. Hawking claimed that “Because part of the information about the state of the system is lost down the hole, the final situation is represented by a density matrix rather than a pure quantum state”. 1 This was the starting point of the popular “black hole (BH) information paradox”.  相似文献   
5.
6.
7.
8.
Given an n ‐vertex pseudorandom graph G and an n ‐vertex graph H with maximum degree at most two, we wish to find a copy of H in G , that is, an embedding φ : V ( H ) V ( G ) so that φ ( u ) φ ( v ) E ( G ) for all u v E ( H ) . Particular instances of this problem include finding a triangle‐factor and finding a Hamilton cycle in G . Here, we provide a deterministic polynomial time algorithm that finds a given H in any suitably pseudorandom graph G . The pseudorandom graphs we consider are ( p , λ ) ‐bijumbled graphs of minimum degree which is a constant proportion of the average degree, that is, Ω ( p n ) . A ( p , λ ) ‐bijumbled graph is characterised through the discrepancy property: | e ( A , B ) ? p | A | | B | | < λ | A | | B | for any two sets of vertices A and B . Our condition λ = O ( p 2 n / log n ) 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.
Monodisperse aqueous upconverting nanoparticles (UCNPs) were covalently immobilized on aldehyde modified cellulose paper via reduction amination to develop a luminescence resonance energy transfer (LRET)-based nucleic acid hybridization assay. This first account of covalent immobilization of UCNPs on paper for a bioassay reports an optically responsive method that is sensitive, reproducible and robust. The immobilized UCNPs were decorated with oligonucleotide probes to capture HPRT1 housekeeping gene fragments, which in turn brought reporter conjugated quantum dots (QDs) in close proximity to the UCNPs for LRET. This sandwich assay could detect unlabeled oligonucleotide target, and had a limit of detection of 13 fmol and a dynamic range spanning nearly 3 orders of magnitude. The use of QDs, which are excellent LRET acceptors, demonstrated improved sensitivity, limit of detection, dynamic range and selectivity compared to similar assays that have used molecular fluorophores as acceptors. The selectivity of the assay was attributed to the decoration of the QDs with polyethylene glycol to eliminate non-specific adsorption. The kinetics of hybridization were determined to be diffusion limited and full signal development occurred within 3 min.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号