全文获取类型
收费全文 | 1696篇 |
免费 | 137篇 |
国内免费 | 168篇 |
专业分类
化学 | 581篇 |
力学 | 23篇 |
综合类 | 21篇 |
数学 | 1172篇 |
物理学 | 204篇 |
出版年
2024年 | 1篇 |
2023年 | 13篇 |
2022年 | 13篇 |
2021年 | 24篇 |
2020年 | 44篇 |
2019年 | 40篇 |
2018年 | 50篇 |
2017年 | 41篇 |
2016年 | 53篇 |
2015年 | 43篇 |
2014年 | 65篇 |
2013年 | 148篇 |
2012年 | 40篇 |
2011年 | 64篇 |
2010年 | 75篇 |
2009年 | 103篇 |
2008年 | 118篇 |
2007年 | 92篇 |
2006年 | 130篇 |
2005年 | 114篇 |
2004年 | 125篇 |
2003年 | 117篇 |
2002年 | 74篇 |
2001年 | 63篇 |
2000年 | 76篇 |
1999年 | 45篇 |
1998年 | 61篇 |
1997年 | 63篇 |
1996年 | 30篇 |
1995年 | 22篇 |
1994年 | 4篇 |
1993年 | 5篇 |
1992年 | 5篇 |
1991年 | 2篇 |
1990年 | 3篇 |
1989年 | 2篇 |
1988年 | 2篇 |
1986年 | 1篇 |
1985年 | 7篇 |
1984年 | 7篇 |
1983年 | 3篇 |
1982年 | 2篇 |
1981年 | 2篇 |
1980年 | 2篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1975年 | 1篇 |
1957年 | 1篇 |
1936年 | 2篇 |
排序方式: 共有2001条查询结果,搜索用时 15 毫秒
1.
This paper infers from a generalized Picone identity the uniqueness of the stable positive solution for a class of semilinear equations of superlinear indefinite type, as well as the uniqueness and global attractivity of the coexistence state in two generalized diffusive prototypes of the symbiotic and competing species models of Lotka–Volterra. The optimality of these uniqueness theorems reveals the tremendous strength of the Picone identity. 相似文献
2.
3.
Jing Yu Jingwei Han Chuanzhong Li 《Mathematical Methods in the Applied Sciences》2020,43(6):3076-3085
For the orthosymplectic Lie superalgebra , we choose a set of basis matrices. A linear combination of those basis matrices presents a spatial spectral matrix. The compatible condition of the spatial part and the corresponding temporal parts of the spectral problem leads to a generalized super AKNS (GSAKNS) hierarchy. By making use of the supertrace identity, the obtained GSAKNS hierarchy can be written as the super bi-Hamiltonian structures. 相似文献
4.
5.
This paper presents an adaptive memory-based method for solving the Capacitated Vehicle Routing Problem (CVRP), called BoneRoute. The CVRP deals with the problem of finding the optimal sequence of deliveries conducted by a fleet of homogeneous vehicles, based at one depot, to serve a set of customers. The computational performance of the BoneRoute was found to be very efficient, producing high quality solutions over two sets of well known case studies examined. 相似文献
6.
The annealing algorithm (Ref. 1) is modified to allow for noisy or imprecise measurements of the energy cost function. This is important when the energy cannot be measured exactly or when it is computationally expensive to do so. Under suitable conditions on the noise/imprecision, it is shown that the modified algorithm exhibits the same convergence in probability to the globally minimum energy states as the annealing algorithm (Ref. 2). Since the annealing algorithm will typically enter and exit the minimum energy states infinitely often with probability one, the minimum energy state visited by the annealing algorithm is usually tracked. The effect of using noisy or imprecise energy measurements on tracking the minimum energy state visited by the modified algorithms is examined.The research reported here has been supported under Contracts AFOSR-85-0227, DAAG-29-84-K-0005, and DAAL-03-86-K-0171 and a Purdue Research Initiation Grant. 相似文献
7.
8.
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. 相似文献
9.
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 相似文献
10.
Continuous dependence on a modelling parameter is established for solutions of a problem for a complex Ginzburg–Landau equation. A homogenizing boundary condition is also used to discuss the continuous dependence results. We derive a priori estimates that indicate that solutions depend continuously on a parameter in the governing differential equation. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献