全文获取类型
收费全文 | 1150篇 |
免费 | 93篇 |
国内免费 | 100篇 |
专业分类
化学 | 581篇 |
晶体学 | 1篇 |
力学 | 14篇 |
综合类 | 8篇 |
数学 | 593篇 |
物理学 | 146篇 |
出版年
2023年 | 1篇 |
2022年 | 16篇 |
2021年 | 16篇 |
2020年 | 31篇 |
2019年 | 20篇 |
2018年 | 21篇 |
2017年 | 18篇 |
2016年 | 36篇 |
2015年 | 32篇 |
2014年 | 39篇 |
2013年 | 66篇 |
2012年 | 34篇 |
2011年 | 34篇 |
2010年 | 44篇 |
2009年 | 55篇 |
2008年 | 70篇 |
2007年 | 70篇 |
2006年 | 94篇 |
2005年 | 98篇 |
2004年 | 102篇 |
2003年 | 91篇 |
2002年 | 43篇 |
2001年 | 44篇 |
2000年 | 61篇 |
1999年 | 32篇 |
1998年 | 41篇 |
1997年 | 47篇 |
1996年 | 21篇 |
1995年 | 15篇 |
1994年 | 4篇 |
1993年 | 7篇 |
1992年 | 2篇 |
1991年 | 1篇 |
1990年 | 5篇 |
1989年 | 3篇 |
1988年 | 2篇 |
1986年 | 1篇 |
1985年 | 7篇 |
1984年 | 8篇 |
1983年 | 3篇 |
1982年 | 2篇 |
1981年 | 2篇 |
1980年 | 3篇 |
1936年 | 1篇 |
排序方式: 共有1343条查询结果,搜索用时 0 毫秒
1.
2.
3.
4.
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. 相似文献
5.
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 相似文献
6.
7.
Dmitry I. Belov Ronald D. Armstrong 《Computational Optimization and Applications》2006,33(2-3):319-332
This paper introduces a novel approach for extracting the maximum number of non-overlapping test forms from a large collection
of overlapping test sections assembled from a given item bank. The approach involves solving maximum set packing problems
(MSPs). A branch-and-bound MSP algorithm is developed along with techniques adapted from constraint programming to estimate
lower and upper bounds on the optimal MSP solution. The algorithm is general and can be applied in other applications including
combinatorial auctions. The results of computer simulations and experiments with an operational item bank are presented.
An erratum to this article is available at . 相似文献
8.
We prove that a locally compact ANR-space X is a Q-manifold if and only if it has the Disjoint Disk Property (DDP), all points of X are homological Z
∞-points and X has the countable-dimensional approximation property (cd-AP), which means that each map f: K → X of a compact polyhedron can be approximated by a map with the countable-dimensional image. As an application we prove that
a space X with DDP and cd-AP is a Q-manifold if some finite power of X is a Q-manifold. If some finite power of a space X with cd-AP is a Q-manifold, then X
2 and X × [0, 1] are Q-manifolds as well. We construct a countable family χ of spaces with DDP and cd-AP such that no space X ∈ χ is homeomorphic to the Hilbert cube Q whereas the product X × Y of any different spaces X, Y ∈ χ is homeomorphic to Q. We also show that no uncountable family χ with such properties exists.
This work was supported by the Slovenian-Ukrainian (Grant No. SLO-UKR 04-06/07) 相似文献
9.
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. 相似文献
10.
Youssef Saab 《Journal of Heuristics》1997,3(3):207-224
A heuristic optimization methodology, Dynamic Contraction (DC), is introduced as an approach for solving a wide variety of hard combinatorial problems. Contraction is an operation that maps an instance of a problem to a smaller instance of the same problem. DC is an iterative improvement strategy that relies on contraction as a mechanism for escaping local minima. As a byproduct of contraction, efficiency is improved due to a reduction of problem size. Effectiveness of DC is shown through simple applications to two classical combinatorial problems: The graph bisection problem and the traveling salesman problem. 相似文献