全文获取类型
收费全文 | 1151篇 |
免费 | 80篇 |
国内免费 | 101篇 |
专业分类
化学 | 574篇 |
力学 | 9篇 |
综合类 | 6篇 |
数学 | 645篇 |
物理学 | 98篇 |
出版年
2023年 | 4篇 |
2022年 | 18篇 |
2021年 | 19篇 |
2020年 | 25篇 |
2019年 | 25篇 |
2018年 | 29篇 |
2017年 | 17篇 |
2016年 | 35篇 |
2015年 | 31篇 |
2014年 | 35篇 |
2013年 | 68篇 |
2012年 | 32篇 |
2011年 | 32篇 |
2010年 | 41篇 |
2009年 | 60篇 |
2008年 | 65篇 |
2007年 | 62篇 |
2006年 | 93篇 |
2005年 | 98篇 |
2004年 | 97篇 |
2003年 | 91篇 |
2002年 | 44篇 |
2001年 | 44篇 |
2000年 | 62篇 |
1999年 | 31篇 |
1998年 | 47篇 |
1997年 | 46篇 |
1996年 | 24篇 |
1995年 | 13篇 |
1994年 | 4篇 |
1993年 | 5篇 |
1992年 | 3篇 |
1991年 | 2篇 |
1990年 | 4篇 |
1989年 | 1篇 |
1988年 | 2篇 |
1986年 | 1篇 |
1985年 | 5篇 |
1984年 | 8篇 |
1983年 | 2篇 |
1981年 | 3篇 |
1980年 | 2篇 |
1978年 | 1篇 |
1936年 | 1篇 |
排序方式: 共有1332条查询结果,搜索用时 15 毫秒
1.
2.
Employing a cleavable carbohydrate–peptide linker, a new strategy for single-bead analysis of multivalent cyclic neoglycopeptides based on Edman degradation is described. Edman degradation of glycopeptides is hampered by the acid lability of the glycosidic bond and potential incompatibilities of phenylthiohydantoin (PTH) derivatives of glycosylated amino acids with PTH derivatives of the proteinogenic amino acids. To overcome this problem, carbohydrates are detached from the cyclopeptide templates before single-bead analysis, allowing for micro sequencing under routine conditions. With this strategy, application of multivalent cyclic neoglycopeptides in split-mix libraries with a subsequent screening process becomes possible for the first time. 相似文献
3.
By extracting combinatorial structures in well-solved nonlinear combinatorial optimization problems, Murota (1996,1998) introduced the concepts of M-convexity and L-convexity to functions defined over the integer lattice. Recently, Murota–Shioura (2000, 2001) extended these concepts to polyhedral convex functions and quadratic functions in continuous variables. In this paper, we consider a further extension to more general convex functions defined over the real space, and provide a proof for the conjugacy relationship between general M-convex and L-convex functions.Mathematics Subject Classification (1991): 90C10, 90C25, 90C27, 90C35This work is supported by Grant-in-Aid of the Ministry of Education, Culture, Sports, Science and Technology of Japan 相似文献
4.
5.
Protein Conformation of a Lattice Model Using Tabu Search 总被引:1,自引:0,他引:1
We apply tabu search techniques to the problem of determining the optimal configuration of a chain of protein sequences on a cubic lattice. The problem under study is difficult to solve because of the large number of possible conformations and enormous amount of computations required. Tabu search is an iterative heuristic procedure which has been shown to be a remarkably effective method for solving combinatorial optimization problems. In this paper, an algorithm is designed for the cubic lattice model using tabu search. The algorithm has been tested on a chain of 27 monomers. Computational results show that our method outperforms previously reported approaches for the same model. 相似文献
6.
利用概率论与组合数学的方法,研究了与Riemann-zeta函数ξ(k)的部分和ξ_n(k)有关的一些级数,计算出了一些重要的和式.特别的,Euler的著名结果5ξ(4)= 2ξ~2(2)能够从四阶和式直接推出.因此,通过计算全部的11个六阶和式,研究它们之间的非平凡关系,就有可能得到ξ(3)的数值. 相似文献
7.
We investigate function spaces of generalised smoothness of Besov and Triebel–Lizorkin type. Equivalent quasi-norms in terms
of maximal functions and local means are given. An atomic decomposition theorem for this type of spaces is proved.
Mathematics Subject Classification (2000) 46E35 相似文献
8.
K. C. Nicolaou Dionisios Vourloumis Tianhu Li Joaquin Pastor Nicolas Winssinger Yun He Sacha Ninkovic Francisco Sarabia Hans Vallberg Frank Roschangar N. Paul King M. Ray V. Finlay Pareskevi Giannakakou Pascal Verdier-Pinard Ernest Hamel 《Angewandte Chemie (International ed. in English)》1997,36(19):2097-2103
9.
箱覆盖问题是NP困难问题中的经典问题,得到了广泛地研究,九十年代以来,半定松驰策略被用来求解组合优化问题,取得了很好的结果[13],本文首次给箱覆盖问题的半定松驰算法,算法的理论分析结果表明它适合于求解大规模的箱覆盖问题。 相似文献
10.
Grundel D. A. Oliveira C. A. S. Pardalos P. M. 《Journal of Optimization Theory and Applications》2004,122(3):487-500
The multidimensional assignment problem (MAP) is a NP-hard combinatorial optimization problem, occurring in many applications, such as data association. In this paper, we prove two conjectures made in Ref. 1 and based on data from computational experiments on MAPs. We show that the mean optimal objective function cost of random instances of the MAP goes to zero as the problem size increases, when assignment costs are independent exponentially or uniformly distributed random variables. We prove also that the mean optimal solution goes to negative infinity when assignment costs are independent normally distributed random variables. 相似文献