首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   3773篇
  免费   264篇
  国内免费   409篇
化学   1635篇
晶体学   4篇
力学   205篇
综合类   106篇
数学   2049篇
物理学   447篇
  2024年   6篇
  2023年   48篇
  2022年   102篇
  2021年   86篇
  2020年   108篇
  2019年   91篇
  2018年   79篇
  2017年   132篇
  2016年   129篇
  2015年   108篇
  2014年   166篇
  2013年   236篇
  2012年   175篇
  2011年   185篇
  2010年   166篇
  2009年   234篇
  2008年   261篇
  2007年   249篇
  2006年   207篇
  2005年   202篇
  2004年   173篇
  2003年   145篇
  2002年   161篇
  2001年   120篇
  2000年   108篇
  1999年   106篇
  1998年   117篇
  1997年   82篇
  1996年   85篇
  1995年   71篇
  1994年   62篇
  1993年   35篇
  1992年   41篇
  1991年   16篇
  1990年   29篇
  1989年   19篇
  1988年   21篇
  1987年   15篇
  1986年   9篇
  1985年   12篇
  1984年   7篇
  1983年   2篇
  1982年   13篇
  1981年   6篇
  1980年   6篇
  1979年   5篇
  1978年   2篇
  1976年   2篇
  1975年   2篇
  1959年   2篇
排序方式: 共有4446条查询结果,搜索用时 15 毫秒
1.
The minimum k-enclosing ball problem seeks the ball with smallest radius that contains at least k of m given points. This problem is NP-hard. We present a branch-and-bound algorithm on the tree of the subsets of k points to solve this problem. Our method is able to solve the problem exactly in a short amount of time for small and medium sized datasets.  相似文献   
2.
Motor Imagery Electroencephalography (MI-EEG) has shown good prospects in neurorehabilitation, and the entropy-based nonlinear dynamic methods have been successfully applied to feature extraction of MI-EEG. Especially based on Multiscale Fuzzy Entropy (MFE), the fuzzy entropies of the τ coarse-grained sequences in τ scale are calculated and averaged to develop the Composite MFE (CMFE) with more feature information. However, the coarse-grained process fails to match the nonstationary characteristic of MI-EEG by a mean filtering algorithm. In this paper, CMFE is improved by assigning the different weight factors to the different sample points in the coarse-grained process, i.e., using the weighted mean filters instead of the original mean filters, which is conductive to signal filtering and feature extraction, and the resulting personalized Weighted CMFE (WCMFE) is more suitable to represent the nonstationary MI-EEG for different subjects. All the WCMFEs of multi-channel MI-EEG are fused in serial to construct the feature vector, which is evaluated by a back-propagation neural network. Based on a public dataset, extensive experiments are conducted, yielding a relatively higher classification accuracy by WCMFE, and the statistical significance is examined by two-sample t-test. The results suggest that WCMFE is superior to the other entropy-based and traditional feature extraction methods.  相似文献   
3.
Several phenoxy-imine ligands bearing o-trityl group in phenoxy moiety RN=CHArOH (Ar = C6H2(CPh3)tBu, R = 2,6-Me2C6H3 ( L 1 H ); 2,6-iPr2C6H3 ( L 2 H ); 3,5-(CF3)2C6H3 ( L 3 H ); 3,5-(OMe)2C6H3 ( L 4 H ); CHPh2 ( L 5 H ); CPh3 ( L 6 H )) were synthesized and characterized by1H NMR and 13C NMR spectroscopy. The vanadium complexes based on these ligands LVCl2(THF)2 ( 1–6 ) were synthesized via conventional transmetalation reaction in moderate to high yields. Complexes 1–6 were fully characterized by FT-IR, elemental analyses and the molecular structures of 1 , 2 ·H2O, (2 ·H2O ) 2 (μ-Cl) 2 , 4 , and 5 were confirmed by X-ray crystallographic analysis in which the six-coordinated vanadium centers are in a typical octahedral geometry. Upon activation with Et2AlCl in toluene, complexes 1–6 showed high activities in ethylene polymerization affording polymers with moderate molecular weight (5.9–11.8 × 104 Da). Moreover, in hexane or CH2Cl2, 1–6 /Et2AlCl exhibited enhanced activities. When activated with MAO or MMAO in toluene, these complexes showed relatively low activities but afforded polymers with ultra-high molecular weight (up to 3.30 × 106 Da). 1–6 /Et2AlCl also showed high activities in ethylene/1-hexene copolymerization at room temperature giving moderate molecular-weight polymers (6.5–11.4 × 104 Da) with co-monomer incorporation being of 6.0 ~ 7.8%.  相似文献   
4.
Boundedness of commutators on homogeneous Herz spaces   总被引:9,自引:0,他引:9  
The boundedness on homogeneous Herz spaces is established for a large class of linear commutators generated by BMO(R n ) functions and linear operators of rough kernels which include the Calderón-Zygmund operators and the Ricci-Stein oRfiUatory singular integrals with rough kernels. Project supponed in pan by the National h’atural Science Foundation of China (Grant No. 19131080) and the NEDF of China.  相似文献   
5.
利用射影几何方法在小缺陷码中,NMDS码是链条件码;给出k维NμMDS(0μk-2)码满足链条件的一个充要条件与一些易判断的充分条件.  相似文献   
6.
Let ir(G) and γ(G) be the irredundance number and the domination number of a graph G, respectively. A graph G is called irredundance perfect if ir(H)=γ(H), for every induced subgraph H of G. In this article we present a result which immediately implies three known conjectures on irredundance perfect graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 292–306, 2002  相似文献   
7.
An edge e of a perfect graph G is critical if Ge is imperfect. We would like to decide whether Ge is still “almost perfect” or already “very imperfect”. Via relaxations of the stable set polytope of a graph, we define two superclasses of perfect graphs: rank-perfect and weakly rank-perfect graphs. Membership in those two classes indicates how far an imperfect graph is away from being perfect. We study the cases, when a critical edge is removed from the line graph of a bipartite graph or from the complement of such a graph.  相似文献   
8.
For 1 ≤ dk, let Kk/d be the graph with vertices 0, 1, …, k ? 1, in which ij if d ≤ |i ? j| ≤ k ? d. The circular chromatic number χc(G) of a graph G is the minimum of those k/d for which G admits a homomorphism to Kk/d. The circular clique number ωc(G) of G is the maximum of those k/d for which Kk/d admits a homomorphism to G. A graph G is circular perfect if for every induced subgraph H of G, we have χc(H) = ωc(H). In this paper, we prove that if G is circular perfect then for every vertex x of G, NG[x] is a perfect graph. Conversely, we prove that if for every vertex x of G, NG[x] is a perfect graph and G ? N[x] is a bipartite graph with no induced P5 (the path with five vertices), then G is a circular perfect graph. In a companion paper, we apply the main result of this paper to prove an analog of Haj?os theorem for circular chromatic number for k/d ≥ 3. Namely, we shall design a few graph operations and prove that for any k/d ≥ 3, starting from the graph Kk/d, one can construct all graphs of circular chromatic number at least k/d by repeatedly applying these graph operations. © 2005 Wiley Periodicals, Inc. J Graph Theory 48: 186–209, 2005  相似文献   
9.
Polyhydroxyalkanoate (PHA) synthase (PhaC) from Wautersia eutropha was expressed in a wide range of production level in Escherichia coli XL1-Blue cells and its effects on PhaC activity, poly[(R)-3-hydroxybutyrate] [P(3HB)] production and its molecular weights were investigated. The production level of PhaC was controlled both by the amount of chemical inducer (isopropyl-β-d-thiogalactopyranoside, IPTG) added into the medium and the use of different copy number of plasmids. In a flask experiment, as PhaC production level in the cells increased, the PhaC activity also increased in the range of low PhaC concentration. However, PhaC activity did not further increase in the range of high PhaC concentration, probably due to the formation of inclusion body in the cells. The molecular weight of P(3HB) was found to decrease with increasing PhaC activity. This trend was also verified in high cell density cultivation using 10-l jar fermentor. Furthermore, we demonstrated that the use of low copy number plasmid and appropriate induction of PhaC expression were effective in achieving both high productivity and high molecular weight of P(3HB).  相似文献   
10.
Compared with linear polymers, more factors may affect the glass‐transition temperature (Tg) of a hyperbranched structure, for instance, the contents of end groups, the chemical properties of end groups, branching junctions, and the compactness of a hyperbranched structure. Tg's decrease with increasing content of end‐group free volumes, whereas they increase with increasing polarity of end groups, junction density, or compactness of a hyperbranched structure. However, end‐group free volumes are often a prevailing factor according to the literature. In this work, chain‐end, free‐volume theory was extended for predicting the relations of Tg to conversion (X) and molecular weight (M) in hyperbranched polymers obtained through one‐pot approaches of either polycondensation or self‐condensing vinyl polymerization. The theoretical relations of polymerization degrees to monomer conversions in developing processes of hyperbranched structures reported in the literature were applied in the extended model, and some interesting results were obtained. Tg's of hyperbranched polymers showed a nonlinear relation to reciprocal molecular weight, which differed from the linear relation observed in linear polymers. Tg values decreased with increasing molecular weight in the low‐molecular‐weight range; however, they increased with increasing molecular weight in the high‐molecular‐weight range. Tg values decreased with increasing log M and then turned to a constant value in the high‐molecular‐weight range. The plot of Tg versus 1/M or log M for hyperbranched polymers may exhibit intersecting straight‐line behaviors. The intersection or transition does not result from entanglements that account for such intersections in linear polymers but from a nonlinear feature in hyperbranched polymers according to chain‐end, free‐volume theory. However, the conclusions obtained in this work cannot be extended to dendrimers because after the third generation, the end‐group extents of a dendrimer decrease with molecular weight. Thus, it is very possible for a dendrimer that Tg increases with 1/M before the third generation; however, it decreases with 1/M after the third generation. © 2004 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 42: 1235–1242, 2004  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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