全文获取类型
收费全文 | 644篇 |
免费 | 13篇 |
国内免费 | 10篇 |
专业分类
化学 | 63篇 |
力学 | 29篇 |
数学 | 482篇 |
物理学 | 93篇 |
出版年
2023年 | 20篇 |
2022年 | 21篇 |
2021年 | 13篇 |
2020年 | 18篇 |
2019年 | 20篇 |
2018年 | 11篇 |
2017年 | 12篇 |
2016年 | 16篇 |
2015年 | 15篇 |
2014年 | 35篇 |
2013年 | 44篇 |
2012年 | 35篇 |
2011年 | 38篇 |
2010年 | 36篇 |
2009年 | 57篇 |
2008年 | 45篇 |
2007年 | 39篇 |
2006年 | 31篇 |
2005年 | 18篇 |
2004年 | 14篇 |
2003年 | 5篇 |
2002年 | 11篇 |
2001年 | 13篇 |
2000年 | 5篇 |
1999年 | 10篇 |
1998年 | 14篇 |
1997年 | 9篇 |
1996年 | 6篇 |
1995年 | 8篇 |
1994年 | 12篇 |
1993年 | 8篇 |
1992年 | 5篇 |
1991年 | 2篇 |
1990年 | 2篇 |
1989年 | 1篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1986年 | 1篇 |
1985年 | 1篇 |
1983年 | 1篇 |
1982年 | 2篇 |
1981年 | 3篇 |
1980年 | 4篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1976年 | 1篇 |
排序方式: 共有667条查询结果,搜索用时 15 毫秒
1.
《Operations Research Letters》2022,50(3):274-280
The minimum k-enclosing ball problem seeks the ball with smallest radius that contains at least k of m given points. This problem is NP-hard. We present a branch-and-bound algorithm on the tree of the subsets of k points to solve this problem. Our method is able to solve the problem exactly in a short amount of time for small and medium sized datasets. 相似文献
2.
We deal with MAXH0-FREE PARTIAL SUBGRAPH. We mainly prove that 3-locally optimum solutions achieve approximation ratio (δ0+1)/(B+2+ν0), where B=maxv∈VdG(v), δ0=minv∈V(H0)dH0(v) and ν0=(|V(H0)|+1)/δ0. Next, we show that this ratio rises up to 3/(B+1) when H0=K3. Finally, we provide hardness results for MAXK3-FREE PARTIAL SUBGRAPH. 相似文献
3.
We present an O(min(Kn,n2)) algorithm to solve the maximum integral multiflow and minimum multicut problems in rooted trees, where K is the number of commodities and n is the number of vertices. These problems are NP-hard in undirected trees but polynomial in directed trees. In the algorithm we propose, we first use a greedy procedure to build the multiflow then we use duality properties to obtain the multicut and prove the optimality. 相似文献
4.
设k是一个正整数,G是一个顶点数为|G|=4k的图. 假设σ\-2(G)≥4k-1, 则G有一个支撑子图含k-1个4圈和一条顶点数为4的路,使得所有这些圈和路都是相互独立的. 设G=(V\-1,V \-2;E)是一个二分图使得|V\-1|=|V\-2|=2k. 如果对G中每一对满足x∈V\-1和y∈V\-2的不 相邻的顶点x和y 都有d(x)+d(y)≥2k+1, 则G包含k-1个相互独立的4圈和一条顶点数为4的路,使得所有这些圈和路都是相互独立的,并且此度条件是最好的. 相似文献
5.
本在Glover—Klingman算法及最小费用支撑树对策的基础上,讨论了最小费用k度限制树对策问题.利用威胁、旁支付理论制订了两种规则,并利用优超、策略等价理论分别给出了在这两种规则下最小费用k度限制树对策核心中的解,从而证明了在这两种规则下其核心非空. 相似文献
6.
In Homma M and Kim SJ [2], the authors considered two-point codes on a Hermitian curve defined over fields of odd characteristic.
In this paper, we study the geometry of a Hermitian curve over fields of even characteristic and classify the two-point codes
whose minimum distances agree with the designed ones. 相似文献
7.
This paper presents a variational inequality (VI) approach to the problem of minimizing a sum of p-norms. First the original problem is reformulated as an equivalent linear VI. Then an improved extra-gradient method is presented
to solve the linear VI. Applications to the problem of p-norm Steiner Minimum Trees (SMT) shows that the proposed method is effective. Comparison with the general extra-gradient
method is also provided to show the improvements of the new method. 相似文献
8.
Quadratically constrained minimum cross-entropy analysis 总被引:3,自引:0,他引:3
Quadratically constrained minimum cross-entropy problem has recently been studied by Zhang and Brockett through an elaborately constructed dual. In this paper, we take a geometric programming approach to analyze this problem. Unlike Zhang and Brockett, we separate the probability constraint from general quadratic constraints and use two simple geometric inequalities to derive its dual problem. Furthermore, by using the dual perturbation method, we directly prove the strong duality theorem and derive a dual-to-primal conversion formula. As a by-product, the perturbation proof gives us insights to develop a computation procedure that avoids dual non-differentiability and allows us to use a general purpose optimizer to find an-optimal solution for the quadratically constrained minimum cross-entropy analysis. 相似文献
9.
The mechanism for nitrogen activation by molybdenum complexes is a complicated one, involving as it does the coupling of a quartet molybdenum reactant with a singlet nitrogen molecule, passing via a series of quartet and doublet encounter complexes to a triplet intermediate, with the subsequent spin crossing to the singlet surface which then leads via a singlet transition state to the final pair of singlet products. We have investigated in detail a variety of levels of theory to describe the crossing of these electronic surfaces and have calculated both lower-bound and actual minimum energy crossing points for the key spin inversion processes. 相似文献
10.
Stephen P. Walch 《中国化学会会志》1995,42(2):221-231
Computed potential energy surfaces are often required for computation of such observables as rate constants as a function of temperature, product branching ratios, and other detailed properties. We have found that computation of the stationary points/reaction pathways using CASSCF/derivative methods, followed by use of the internally contracted CI method with the Dunning correlation consistent basis sets to obtain accurate energetics, gives useful results for a number of chemically important systems. Applications to complex reactions leading to NOx and soot formation in hydrocarbon combustion are discussed. 相似文献