全文获取类型
收费全文 | 1785篇 |
免费 | 43篇 |
国内免费 | 68篇 |
专业分类
化学 | 96篇 |
晶体学 | 4篇 |
力学 | 51篇 |
综合类 | 4篇 |
数学 | 1416篇 |
物理学 | 325篇 |
出版年
2024年 | 1篇 |
2023年 | 21篇 |
2022年 | 22篇 |
2021年 | 22篇 |
2020年 | 30篇 |
2019年 | 28篇 |
2018年 | 30篇 |
2017年 | 35篇 |
2016年 | 41篇 |
2015年 | 29篇 |
2014年 | 101篇 |
2013年 | 149篇 |
2012年 | 98篇 |
2011年 | 85篇 |
2010年 | 77篇 |
2009年 | 146篇 |
2008年 | 140篇 |
2007年 | 119篇 |
2006年 | 123篇 |
2005年 | 72篇 |
2004年 | 75篇 |
2003年 | 48篇 |
2002年 | 28篇 |
2001年 | 41篇 |
2000年 | 47篇 |
1999年 | 41篇 |
1998年 | 53篇 |
1997年 | 35篇 |
1996年 | 33篇 |
1995年 | 18篇 |
1994年 | 17篇 |
1993年 | 15篇 |
1992年 | 10篇 |
1991年 | 5篇 |
1990年 | 9篇 |
1989年 | 5篇 |
1988年 | 3篇 |
1987年 | 3篇 |
1986年 | 6篇 |
1985年 | 5篇 |
1984年 | 8篇 |
1983年 | 4篇 |
1982年 | 5篇 |
1981年 | 1篇 |
1980年 | 5篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1977年 | 3篇 |
1976年 | 1篇 |
1974年 | 1篇 |
排序方式: 共有1896条查询结果,搜索用时 15 毫秒
1.
2.
Yoel Shkolnisky Mark Tygert Vladimir Rokhlin 《Applied and Computational Harmonic Analysis》2006,21(3):413-420
Many signals encountered in science and engineering are approximated well by bandlimited functions. We provide suitable error bounds for the approximation of bandlimited functions by linear combinations of certain special functions—the prolate spheroidal wave functions of order 0. The coefficients in the approximating linear combinations are given explicitly via appropriate quadrature formulae. 相似文献
3.
Vivek F. Farias 《Operations Research Letters》2006,34(2):180-190
We consider a problem of allocating limited quantities of M types of resources among N independent activities that evolve over T epochs. In each epoch, we assign to each activity a task which consumes resources, generates utility, and determines the subsequent state of the activity. We study the complexity of, and approximation algorithms for, maximizing average utility. 相似文献
4.
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. 相似文献
5.
A server needs to compute a broadcast schedule for n pages whose request times are known in advance. Outputting a page satisfies all outstanding requests for the page. The goal is to minimize the average waiting time of a client. In this paper, we show the equivalence of two apparently different relaxations that have been considered for this problem. 相似文献
6.
Asaf Levin 《Operations Research Letters》2004,32(6):530-534
Consider the following problem: given a ground set and two minimization objectives of the same type find a subset from a given subset-class that minimizes the first objective subject to a budget constraint on the second objective. Using Megiddo's parametric method we improve an earlier weakly polynomial time algorithm. 相似文献
7.
本文研究了具有三角形波基函数的Bernstein-Fan值算子的收敛定理和逼近阶估计,并给出了它的算法程序。 相似文献
8.
Xu Tianzhou 《东北数学》1997,(1)
ModulesoverOperatorAlgebrasandItsModuleMapsXuTianzhou(许天周)(DepartmentofMathematics,NanjingUniersity,Nanjing,210093)AbstractLe... 相似文献
9.
当s∈ R,0,〈q, p〈∈∞,0,〈β≤∞且 max{-n/q,-nδ2/qδ1}〈a时,定义了加权Herz—type Triebel-Lizorkin空间kq^q,pF^s β(R^n,ω1,ω2)和Kq^a,pF^sβ(R^n,ω1,ω2),并给出这些空间的一些特征及在这些空间上的Hard—Littlewood极大算子不等式. 相似文献
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. 相似文献