全文获取类型
收费全文 | 5866篇 |
免费 | 552篇 |
国内免费 | 499篇 |
专业分类
化学 | 60篇 |
力学 | 145篇 |
综合类 | 116篇 |
数学 | 2912篇 |
物理学 | 302篇 |
综合类 | 3382篇 |
出版年
2024年 | 23篇 |
2023年 | 82篇 |
2022年 | 97篇 |
2021年 | 155篇 |
2020年 | 132篇 |
2019年 | 134篇 |
2018年 | 142篇 |
2017年 | 211篇 |
2016年 | 198篇 |
2015年 | 195篇 |
2014年 | 343篇 |
2013年 | 354篇 |
2012年 | 371篇 |
2011年 | 338篇 |
2010年 | 343篇 |
2009年 | 367篇 |
2008年 | 421篇 |
2007年 | 462篇 |
2006年 | 392篇 |
2005年 | 325篇 |
2004年 | 234篇 |
2003年 | 202篇 |
2002年 | 203篇 |
2001年 | 173篇 |
2000年 | 161篇 |
1999年 | 138篇 |
1998年 | 104篇 |
1997年 | 104篇 |
1996年 | 73篇 |
1995年 | 64篇 |
1994年 | 60篇 |
1993年 | 35篇 |
1992年 | 50篇 |
1991年 | 32篇 |
1990年 | 25篇 |
1989年 | 32篇 |
1988年 | 35篇 |
1987年 | 34篇 |
1986年 | 5篇 |
1985年 | 26篇 |
1984年 | 14篇 |
1983年 | 8篇 |
1982年 | 3篇 |
1981年 | 4篇 |
1980年 | 4篇 |
1979年 | 3篇 |
1977年 | 1篇 |
1975年 | 1篇 |
1955年 | 1篇 |
1936年 | 2篇 |
排序方式: 共有6917条查询结果,搜索用时 26 毫秒
51.
带到达时间的单机排序中的资源分配问题 总被引:1,自引:0,他引:1
讨论两个单机排序的资源分配问题1|rj,pj=bj-ajuj,Cmax≤|∑uj和1|rj,prec,pj=bj-ajuj C max≤|∑uj并给出求其最优资源分配的多项式算法. 相似文献
52.
A hybrid technique using constraint programming and linear programming is applied to the problem of scheduling with earliness and tardiness costs. The linear model maintains a set of relaxed optimal start times which are used to guide the constraint programming search heuristic. In addition, the constraint programming problem model employs the strong constraint propagation techniques responsible for many of the advances in constraint programming for scheduling in the past few years. Empirical results validate our approach and show, in particular, that creating and solving a subproblem containing only the activities with direct impact on the cost function and then using this solution in the main search, significantly increases the number of problems that can be solved to optimality while significantly decreasing the search time. 相似文献
53.
姜波 《新疆大学学报(理工版)》2004,21(3):325-328
无线资源管理是CDMA蜂窝移动通信系统保证业务质量(QoS)和提高频谱利用率的关键技术,本文提出了CDMA系统中无线资源管理算法的一般模型,阐述了三种重要的无线资源管理算法,即功率控制算法、呼叫接纳控制算法和分组调度算法的主要研究情况,并分析了目前研究中仍然存在和需要解决的问题。 相似文献
54.
This paper investigates regression quantiles (RQ) for unstable autoregressive models. The uniform Bahadur representation of the RQ process is obtained. The joint asymptotic distribution of the RQ process is derived in a unified manner for all types of characteristic roots on or outside the unit circle. It involves stochastic integrals in terms of a sequence of independent and identically distributed multivariate Brownian motions with correlated components. The related L-estimator is also discussed. The asymptotic distributions of the RQ and the L-estimator corresponding to the nonstationary componentwise arguments can be transformed into a function of a normal random variable and a sequence of i.i.d. univariate Brownian motions. This is different from the analysis based on the LSE in the literature. As an auxiliary theorem, a weak convergence of a randomly weighted residual empirical process to the stochastic integral of a Kiefer process is established. The results obtained in this paper provide an asymptotic theory for nonstationary time series processes, which can be used to construct robust unit root tests. 相似文献
55.
SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES AND COMPRESSION COSTS (PART I:EQUAL TIMES AND COSTS) 总被引:1,自引:0,他引:1
Most papers in scheduling research have treated individual job processing times as fixed parameters. However, in many practical situations, a manager may control processing time by realloeating resources. In this paper, authors consider a machine scheduling problemwith controllable processing times. In the first part of this paper, a special case where the pro-cessing times and compression costs are uniform among jobs is discussed. Theoretical results are derived that aid in developing an O(n^2) algorithm to slove the problem optimally. In the second part of this paper, authors generalize the discussion to general case, An effective heuristic to the genera/ problem will be presented. 相似文献
56.
丁宣浩 《四川大学学报(自然科学版)》1993,30(2):173-175
给出了一个内射单侧权位移,其权序列空间H~2(β)≠H~∞(β),但对任意φ(z)属于H~∝(β),其部分和序列按算子范数收敛于φ(z).从而否定回答了Shields在文献[1]中的第12问题. 相似文献
57.
Lufthansa Technical Training GmbH (LTT) performs training courses for Lufthansa Technik AG as well as for several other international airlines. Courses of about 670 different types are offered of which several hundred take place each year. The course scheduling problem faced by LTT is to construct a yearly schedule which maximizes the profit margin incurred while meeting a variety of complex precedence, temporal, and resource-related constraints. A “good” operational schedule should also meet a number of additional subordinate objectives. We formalize the problem and develop a heuristic scheme along with several priority rules, as well as a local search algorithm to determine well-suited weights for weighted composite rules. The operational planning situation of 1996 served as our major test instance; additional test instances were constructed by modifying this data. Several computational experiments were carried out to evaluate the performance of the algorithms. It turned out that the best so-found schedule is substantially better in terms of the profit margin incurred than the solution manually constructed by LTT. 相似文献
58.
In this paper, we analyze a discrete-time preemptive repeat priority queue with resampling. High-priority packets have preemptive
repeat priority, and interrupted low-priority packets are subjected to independent retransmission attempts. Both classes contain
packets with generally distributed transmission times. We show that the use of generating functions is beneficial for analyzing
the system contents and packet delay of both classes. The influence of the priority scheduling on the performance measures
is illustrated by some numerical examples.
This work has been supported by the Interuniversity Attraction Poles Programme–Belgian Science Policy. 相似文献
59.
Most successful heuristics for solving 1||∑wjTj are based on swap moves. We present an algorithm which improves the complexity of searching the swap neighborhood from O(n3) to O(n2). We show that this result also improves the complexity of the recently developed dynasearch heuristics. 相似文献
60.
基于像素特征的路面裂缝图像自适应滤噪 总被引:1,自引:1,他引:0
朱其刚 《山东师范大学学报(自然科学版)》2005,20(3):37-39
分析了破损路面图像的像素点区域特征,针对不同区域提出加权邻域滤波和自适加权中值滤波算法。其权值是通过对图像中区域特征的推理得到的,所以算法中能根据图像的区域特征自适应的进行滤波。试验表明,本算法能够有效滤除噪声,并具有很好的细节保护能力。 相似文献