全文获取类型
收费全文 | 1246篇 |
免费 | 152篇 |
国内免费 | 74篇 |
专业分类
化学 | 148篇 |
晶体学 | 2篇 |
力学 | 198篇 |
综合类 | 33篇 |
数学 | 511篇 |
物理学 | 580篇 |
出版年
2023年 | 8篇 |
2022年 | 15篇 |
2021年 | 27篇 |
2020年 | 33篇 |
2019年 | 37篇 |
2018年 | 25篇 |
2017年 | 20篇 |
2016年 | 34篇 |
2015年 | 24篇 |
2014年 | 65篇 |
2013年 | 82篇 |
2012年 | 67篇 |
2011年 | 82篇 |
2010年 | 68篇 |
2009年 | 70篇 |
2008年 | 81篇 |
2007年 | 81篇 |
2006年 | 65篇 |
2005年 | 76篇 |
2004年 | 80篇 |
2003年 | 50篇 |
2002年 | 69篇 |
2001年 | 49篇 |
2000年 | 28篇 |
1999年 | 27篇 |
1998年 | 30篇 |
1997年 | 32篇 |
1996年 | 22篇 |
1995年 | 14篇 |
1994年 | 18篇 |
1993年 | 17篇 |
1992年 | 17篇 |
1991年 | 5篇 |
1990年 | 10篇 |
1989年 | 5篇 |
1988年 | 3篇 |
1987年 | 8篇 |
1986年 | 4篇 |
1985年 | 6篇 |
1984年 | 4篇 |
1983年 | 1篇 |
1982年 | 5篇 |
1981年 | 1篇 |
1980年 | 2篇 |
1978年 | 4篇 |
1974年 | 1篇 |
排序方式: 共有1472条查询结果,搜索用时 31 毫秒
1.
研究采用有误差的数值计算来获得无误差的准确值具有重要的理论价值和应用价值.这种通过近似的数值方法获得准确结果的计算被称为零误差计算.本文首先指出,只有一致离散集合中的数才能够开展零误差计算,即有非零隔离界的数集,这也是"数"可以进行零误差计算的一个充要条件.以此为基本出发点,本文分析代数数零误差计算的最低理论精度,该精度对应于恢复近似代数数的准确值时必要的误差控制条件,但由于所采用恢复算法的局限性,这一理论精度往往不能保证成功恢复出代数数的准确值.为此,本文给出采用PSLQ (partial-sum-LQ-decomposition)算法进行代数数零误差计算所需的精度控制条件,与基于LLL (Lenstra-Lenstra-Lovász)算法相比,该精度控制条件关于代数数次数的依赖程度由二次降为拟线性,从而可降低相应算法的复杂度.最后探讨零误差计算未来的发展趋势. 相似文献
2.
Hyper-parallel quantum information processing is a promising and beneficial research field. Herein, a method to implement a hyper-parallel controlled-phase-flip (hyper-CPF) gate for frequency-, spatial-, and time-bin-encoded qubits by coupling flying photons to trapped nitrogen vacancy (NV) defect centers is presented. The scheme, which differs from their conventional parallel counterparts, is specifically advantageous in decreasing against the dissipate noise, increasing the quantum channel capacity, and reducing the quantum resource overhead. The gate qubits with frequency, spatial, and time-bin degrees of freedom (DOF) are immune to quantum decoherence in optical fibers, whereas the polarization photons are easily disturbed by the ambient noise. 相似文献
3.
4.
Leah B. Casabianca 《Magnetic resonance in chemistry : MRC》2020,58(7):611-624
The nuclear magnetic resonance (NMR) chemical shift is extremely sensitive to molecular geometry, hydrogen bonding, solvent, temperature, pH, and concentration. Calculated magnetic shielding constants, converted to chemical shifts, can be valuable aids in NMR peak assignment and can also give detailed information about molecular geometry and intermolecular effects. Calculating chemical shifts in solution is complicated by the need to include solvent effects and conformational averaging. Here, we review the current state of NMR chemical shift calculations in solution, beginning with an introduction to the theory of calculating magnetic shielding in general, then covering methods for inclusion of solvent effects and conformational averaging, and finally discussing examples of applications using calculated chemical shifts to gain detailed structural information. 相似文献
5.
《Physics letters. A》2020,384(24):126595
The Harrow-Hassidim-Lloyd (HHL) algorithm is a method to solve the quantum linear system of equations that may be found at the core of various scientific applications and quantum machine learning models including the linear regression, support vector machines and recommender systems etc. After reviewing the necessary background on elementary quantum algorithms, we provide detailed account of how HHL is exploited in different quantum machine learning (QML) models, and how it provides the desired quantum speedup in all these models. At the end, we briefly discuss some of the remaining challenges ahead for HHL-based QML models and related methods. 相似文献
6.
Marién Abreu Jan Goedgebeur Domenico Labbate Giuseppe Mazzuoccolo 《Journal of Graph Theory》2019,92(4):415-444
A -bisection of a bridgeless cubic graph is a -colouring of its vertex set such that the colour classes have the same cardinality and all connected components in the two subgraphs induced by the colour classes ( monochromatic components in what follows) have order at most . Ban and Linial Conjectured that every bridgeless cubic graph admits a -bisection except for the Petersen graph. A similar problem for the edge set of cubic graphs has been studied: Wormald conjectured that every cubic graph with has a -edge colouring such that the two monochromatic subgraphs are isomorphic linear forests (ie, a forest whose components are paths). Finally, Ando conjectured that every cubic graph admits a bisection such that the two induced monochromatic subgraphs are isomorphic. In this paper, we provide evidence of a strong relation of the conjectures of Ban-Linial and Wormald with Ando's Conjecture. Furthermore, we also give computational and theoretical evidence in their support. As a result, we pose some open problems stronger than the above-mentioned conjectures. Moreover, we prove Ban-Linial's Conjecture for cubic-cycle permutation graphs. As a by-product of studying -edge colourings of cubic graphs having linear forests as monochromatic components, we also give a negative answer to a problem posed by Jackson and Wormald about certain decompositions of cubic graphs into linear forests. 相似文献
7.
8.
9.
作为重要的化石能源,褐煤资源潜力巨大、分布广泛但综合利用率低。研究褐煤的分子结构模型,有助于预测褐煤在热解、液化和气化过程中的化学反应机理及反应路径,进而提高褐煤的综合应用水平。以云南峨山褐煤为研究对象,利用傅里叶变换红外光谱、13C核磁共振波谱及X射线光电子能谱等分析测试方法,获取了峨山褐煤的含碳、含氧及含氮结构参数。在此基础上,借助Gaussian 09计算平台,采用量子化学建模的方法构建并优化了峨山褐煤的分子结构模型。研究结果表明:峨山褐煤的芳碳率为39.20%,芳香碳结构主要为苯和萘,且芳香桥头碳与周边碳的比值χb为0.07;脂碳率为49.51%,脂肪碳结构主要为亚甲基,季碳和氧接脂碳;氧原子主要存在于羟基、醚氧、羰基和羧基结构中;含氮结构则以吡啶为主。基于元素分析、13C 核磁共振波谱分析,又经过热重实验消除褐煤中残余水分的影响后,计算出峨山褐煤的分子式为C153H137O35N2。依据分子式及分析结果计算出峨山褐煤的结构单元含量并构建出其初始结构模型,采用半经验法PM 3基组及密度泛函理论M06-2X/3-21G基组对初始分子构型进行优化。优化后的分子模型具有明显的三维立体特征,芳香环之间较为分散且在空间中排列不规则,芳香簇主要通过亚甲基、醚氧基、羰基、酯基和脂肪环连接,含氧官能团主要分布在分子边缘,脂肪族侧链较多。对优化后的分子模型进行振动频率计算进而获得了分子模型的模拟红外光谱,其与实验红外谱图吻合度良好,证明了峨山褐煤分子结构模型的准确性、合理性。分子结构模型的构建有利于直观地了解峨山褐煤的分子结构特征,从而有助于从微观分子角度研究峨山褐煤的宏观性质。同时,峨山褐煤分子结构模型可为其在热解、液化和气化等领域研究中提供理论指导。 相似文献
10.
Dang Van Hieu 《Mathematical Methods in the Applied Sciences》2017,40(11):4065-4079
Based on the extended extragradient‐like method and the linesearch technique, we propose three projection methods for finding a common solution of a finite family of equilibrium problems. The linesearch used in the proposed algorithms has allowed to reduce some conditions imposed on equilibrium bifunctions. The strongly convergent theorems are established without the Lipschitz‐type condition of bifunctions. The paper also helps in the design and analysis of practical algorithms and gives us a generalization of some previously known problems. Copyright © 2017 John Wiley & Sons, Ltd. 相似文献