首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   277篇
  免费   22篇
化学   155篇
力学   5篇
数学   102篇
物理学   37篇
  2023年   1篇
  2022年   3篇
  2021年   2篇
  2020年   5篇
  2019年   6篇
  2018年   4篇
  2017年   5篇
  2016年   13篇
  2015年   10篇
  2014年   18篇
  2013年   11篇
  2012年   22篇
  2011年   28篇
  2010年   15篇
  2009年   9篇
  2008年   28篇
  2007年   17篇
  2006年   18篇
  2005年   15篇
  2004年   12篇
  2003年   10篇
  2002年   6篇
  2001年   5篇
  2000年   5篇
  1999年   2篇
  1998年   2篇
  1997年   3篇
  1996年   2篇
  1995年   2篇
  1994年   4篇
  1992年   2篇
  1991年   2篇
  1990年   2篇
  1989年   1篇
  1987年   1篇
  1984年   4篇
  1982年   1篇
  1979年   1篇
  1976年   1篇
  1973年   1篇
排序方式: 共有299条查询结果,搜索用时 31 毫秒
101.
We show that for all and ε > 0 there is a constant c = c(ℓ, ε) > 0 such that every -coloring of the triples of an N-element set contains a subset S of size $ c\sqrt {\log N} $ c\sqrt {\log N} such that at least 1 − ε fraction of the triples of S have the same color. This result is tight up to the constant c and answers an open question of Erdős and Hajnal from 1989 on discrepancy in hypergraphs. For ≥ 4 colors, it is known that there is an -coloring of the triples of an N-element set whose largest monochromatic subset has cardinality only Θ(log log N). Thus, our result demonstrates that the maximum almost monochromatic subset that an -coloring of the triples must contain is much larger than the corresponding monochromatic subset. This is in striking contrast with graphs, where these two quantities have the same order of magnitude. To prove our result, we obtain a new upper bound on the -color Ramsey numbers of complete multipartite 3-uniform hypergraphs, which answers another open question of Erdős and Hajnal.  相似文献   
102.
A generic mechanical model for bio-composites, including stiff platelets arranged in a staggered order inside a homogeneous soft matrix, is proposed. Equations are formulated in terms of displacements and are characterized by a set of non-dimensional parameters. The displacements, stress fields and effective modulus of the composite are formulated. Two analytical models are proposed, one which includes the shear deformations along the entire medium and another simplified model, which is applicable to a slender geometry and yields a compact expression for the effective modulus. The results from the models are validated by numerical finite element simulations and found to be compatible with each other for a wide range of geometrical and material properties. Finally, the models are solved for two bio-structures, nacre and a collagen fibril, and their solutions are discussed.  相似文献   
103.
104.
The anharmonic vibrational spectra of α-D-glucose, β-D-glucose, and sucrose are computed by the vibrational self-consistent field (VSCF) method, using potential energy surfaces from electronic structure theory, for the lowest energy conformers that correspond to the gas phase and to the crystalline phase, respectively. The results are compared with ultraviolet-infrared (UV-IR) spectra of phenyl β-D-glucopyranoside in a molecular beam, with literature results for sugars in matrices and with new experimental data for the crystalline state. Car-Parrinello dynamics simulations are also used to study temperature effects on the spectra of α-D-glucose and β-D-glucose and to predict their vibrational spectra at 50, 150, and 300 K. The effects of temperature on the spectral features are analyzed and compared with results of the VSCF calculations conducted at 0 K. The main results include: (i) new potential surfaces, constructed from Hartree-Fock, adjusted to fit harmonic frequencies from M?ller-Plesset (MP2) calculations, that give very good agreement with gas phase, matrix, and solid state spectra; (ii) computed infrared spectra of the crystalline solid of α-glucose, which are substantially improved by including mimic groups that represent the effect of the solid environment on the sugar; and (iii) identification of a small number of combination-mode transitions, which are predicted to be strong enough for experimental observation. The results are used to assess the role of anharmonic effects in the spectra of the sugars in isolation and in the solid state and to discuss the spectroscopic accuracy of potentials from different electronic structure methods.  相似文献   
105.
106.
The interaction of OH(-) with the sugar β-d-galactose is studied computationally, with Ab Initio Molecular Dynamics (AIMD) as the prime tool. The main findings are: (1) the OH(-) abstracts a proton from the sugar in a barrier-less process, yielding H(2)O and a Deprotonated beta-d-Galactose anion, (Dep-beta-d-G)(-). (2) This reaction can be reversed when two additional H(2)O molecules are present in the sugar. (3) At 500 K, a ring-opening reaction occurs in (Dep-beta-d-G)(-) within a timescale of 10 ps. The (neutral) sugar itself is stable over this timescale, and well beyond. This indicates that OH(-) can catalyze the degradation of β-d-galactose. Implications of this process are briefly discussed.  相似文献   
107.
108.
For a graph G, let χ(G) denote its chromatic number and σ(G) denote the order of the largest clique subdivision in G. Let H(n) be the maximum of χ(G)=σ(G) over all n-vertex graphs G. A famous conjecture of Hajós from 1961 states that σ(G) ≥ χ(G) for every graph G. That is, H(n)≤1 for all positive integers n. This conjecture was disproved by Catlin in 1979. Erd?s and Fajtlowicz further showed by considering a random graph that H(n)≥cn 1/2/logn for some absolute constant c>0. In 1981 they conjectured that this bound is tight up to a constant factor in that there is some absolute constant C such that χ(G)=σ(G) ≤ Cn 1/2/logn for all n-vertex graphs G. In this paper we prove the Erd?s-Fajtlowicz conjecture. The main ingredient in our proof, which might be of independent interest, is an estimate on the order of the largest clique subdivision which one can find in every graph on n vertices with independence number α.  相似文献   
109.
Owing to their exceptional properties and versatility, fullerenes are in widespread use for numerous applications. Increased production and use of fullerenes will inevitably result in accelerated environmental release. However, study of the occurrence, fate, and transport of fullerenes in the environment is complicated because a variety of surface modifications can occur as a result of either intentional functionalization or natural processes. To gain a better understanding of the effect and risk of fullerenes on environmental health, it is necessary to acquire reliable data on the parent compounds and their congeners. Whereas currently established quantification methods generally focus on analysis of unmodified fullerenes, we discuss in this review the occurrence and analysis of oxidized fullerene congeners (i.e., their corresponding epoxides and polyhydroxylated derivatives) in the environment and in biological specimens. We present possible strategies for detection and quantification of parent nanomaterials and their various derivatives.  相似文献   
110.
We study two classical problems in graph Ramsey theory, that of determining the Ramsey number of bounded-degree graphs and that of estimating the induced Ramsey number for a graph with a given number of vertices. The Ramsey number r(H) of a graph H is the least positive integer N such that every two-coloring of the edges of the complete graph K N contains a monochromatic copy of H. A famous result of Chváatal, Rödl, Szemerédi and Trotter states that there exists a constant c(Δ) such that r(H) ≤ c(Δ)n for every graph H with n vertices and maximum degree Δ. The important open question is to determine the constant c(Δ). The best results, both due to Graham, Rödl and Ruciński, state that there are positive constants c and c′ such that $2^{c'\Delta } \leqslant c(\Delta ) \leqslant ^{c\Delta \log ^2 \Delta }$ . We improve this upper bound, showing that there is a constant c for which c(Δ) ≤ 2 logΔ . The induced Ramsey number r ind (H) of a graph H is the least positive integer N for which there exists a graph G on N vertices such that every two-coloring of the edges of G contains an induced monochromatic copy of H. Erd?s conjectured the existence of a constant c such that, for any graph H on n vertices, r ind (H) ≤ 2 cnlogn . We move a step closer to proving this conjecture, showing that r ind (H) ≤ 2 cnlogn . This improves upon an earlier result of Kohayakawa, Prömel and Rödl by a factor of logn in the exponent.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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