全文获取类型
收费全文 | 2054篇 |
免费 | 42篇 |
国内免费 | 96篇 |
专业分类
化学 | 1748篇 |
晶体学 | 1篇 |
力学 | 53篇 |
综合类 | 3篇 |
数学 | 185篇 |
物理学 | 202篇 |
出版年
2024年 | 6篇 |
2023年 | 77篇 |
2022年 | 30篇 |
2021年 | 25篇 |
2020年 | 49篇 |
2019年 | 93篇 |
2018年 | 49篇 |
2017年 | 96篇 |
2016年 | 64篇 |
2015年 | 49篇 |
2014年 | 69篇 |
2013年 | 102篇 |
2012年 | 110篇 |
2011年 | 139篇 |
2010年 | 93篇 |
2009年 | 92篇 |
2008年 | 122篇 |
2007年 | 122篇 |
2006年 | 105篇 |
2005年 | 115篇 |
2004年 | 130篇 |
2003年 | 68篇 |
2002年 | 34篇 |
2001年 | 37篇 |
2000年 | 44篇 |
1999年 | 42篇 |
1998年 | 33篇 |
1997年 | 38篇 |
1996年 | 35篇 |
1995年 | 21篇 |
1994年 | 14篇 |
1993年 | 11篇 |
1992年 | 6篇 |
1991年 | 8篇 |
1990年 | 9篇 |
1989年 | 9篇 |
1988年 | 5篇 |
1987年 | 9篇 |
1986年 | 5篇 |
1985年 | 3篇 |
1984年 | 3篇 |
1983年 | 3篇 |
1982年 | 4篇 |
1981年 | 2篇 |
1980年 | 3篇 |
1979年 | 7篇 |
1978年 | 2篇 |
排序方式: 共有2192条查询结果,搜索用时 187 毫秒
1.
Varsha J. Thombare Craig A. Hutton 《Angewandte Chemie (Weinheim an der Bergstrasse, Germany)》2019,131(15):5052-5056
Peptide macrocyclization is often a slow process, plagued by epimerization and cyclodimerization. Herein, we describe a new method for peptide macrocyclization employing the AgI‐promoted transformation of peptide thioamides. The AgI has a dual function: chemoselectively activating the thioamide and tethering the N‐terminal thioamide to the C‐terminal carboxylate. Extrusion of Ag2S generates an isoimide intermediate, which undergoes acyl transfer to generate the native cyclic peptide, resulting in a rapid, traceless macrocylization process. Cyclic peptides are furnished in high yields within 1 hour, free of epimerization and cyclodimerization. 相似文献
2.
Lígia M. Rodrigues 《Tetrahedron》2004,60(40):8929-8936
Tetrapeptides containing one of a set of four different α,α-dialkyl glycines at the C-terminus were synthesized by conventional methods in solution and their conformational behavior investigated by 1H NMR spectroscopy in connection with molecular mechanics calculations. The results were consistent with conformations stabilized by a γ-turn in the case of compounds with alkyl groups larger than methyl, while the corresponding Aib derivative did not exhibit intramolecular hydrogen bonding. 相似文献
3.
4.
Optimization of the Heck reaction of 4-bromoacetophenone with styrene by a polymer supported, sulfur-containing palladacycle, varying 6 factors at a total of 28 different levels, corresponding to 5760 different possibilities was undertaken. Conversion improved from 34%, with large observable leaching to 88% with no leaching. This was accomplished using a Design of Experiments approach facilitated by the Statistical Design Package, MODDE 7.0TM. 相似文献
5.
S. Aravinda N. Shamala Rituparna S. Roy P Balaram 《Journal of Chemical Sciences》2003,115(5-6):373-400
An overview of the use of non-protein amino acids in the design of conformationally well-defined peptides, based on work from
the author’s laboratory, is discussed. The crystal structures of several designed oligopeptides illustrate the useα-aminoisobutyric acid (Aib) in the construction of helices, D-amino acids in the design of helix termination segments andDPro-Xxx segments for nucleating ofβ-hairpin structures.β- andγ-amino acid residues have been used to expand the range of designed polypeptide structures.
Dedicated to Professor C N R Rao on his 70th birthday 相似文献
6.
混合位级正交试验设计的极差分析方法 总被引:3,自引:0,他引:3
本文指出,在混合位级的正交试验设计中,以往的极差分析方法存在着不足。本文给出了极差的修正方法,并用大量实例做了数值验证,说明这个修正确实很有效 相似文献
7.
8.
9.
10.
Joseph Y.-T. Leung 《Discrete Applied Mathematics》2007,155(8):945-970
We consider the problem of scheduling orders for multiple different product types in an environment with m dedicated machines in parallel. The objective is to minimize the total weighted completion time. Each product type is produced by one and only one of the m dedicated machines; that is, each machine is dedicated to a specific product type. Each order has a weight and may also have a release date. Each order asks for certain amounts of various different product types. The different products for an order can be produced concurrently. Preemptions are not allowed. Even when all orders are available at time 0, the problem has been shown to be strongly NP-hard for any fixed number (?2) of machines. This paper focuses on the design and analysis of efficient heuristics for the case without release dates. Occasionally, however, we extend our results to the case with release dates. The heuristics considered include some that have already been proposed in the literature as well as several new ones. They include various static and dynamic priority rules as well as two more sophisticated LP-based algorithms. We analyze the performance bounds of the priority rules and of the algorithms and present also an in-depth comparative analysis of the various rules and algorithms. The conclusions from this empirical analysis provide insights into the trade-offs with regard to solution quality, speed, and memory space. 相似文献