全文获取类型
收费全文 | 699篇 |
免费 | 222篇 |
国内免费 | 11篇 |
出版年
2023年 | 3篇 |
2022年 | 9篇 |
2021年 | 30篇 |
2020年 | 6篇 |
2019年 | 10篇 |
2018年 | 8篇 |
2017年 | 10篇 |
2016年 | 13篇 |
2015年 | 32篇 |
2014年 | 22篇 |
2013年 | 85篇 |
2012年 | 27篇 |
2011年 | 21篇 |
2010年 | 26篇 |
2009年 | 35篇 |
2008年 | 28篇 |
2007年 | 47篇 |
2006年 | 21篇 |
2005年 | 40篇 |
2004年 | 14篇 |
2003年 | 13篇 |
2002年 | 14篇 |
2001年 | 15篇 |
2000年 | 27篇 |
1999年 | 52篇 |
1998年 | 50篇 |
1997年 | 39篇 |
1996年 | 41篇 |
1995年 | 30篇 |
1994年 | 33篇 |
1993年 | 27篇 |
1992年 | 18篇 |
1991年 | 24篇 |
1990年 | 21篇 |
1989年 | 11篇 |
1988年 | 5篇 |
1987年 | 7篇 |
1986年 | 8篇 |
1985年 | 5篇 |
1983年 | 2篇 |
1982年 | 2篇 |
1977年 | 1篇 |
排序方式: 共有932条查询结果,搜索用时 15 毫秒
751.
752.
陈健华 《国防科技大学学报》1985,(3):95-98
本文补充了文献[1]中遗漏的二体算符矩阵元,包括玻色子(β,γ)→(α,α),(α,α)→(β,γ),(α,α)→(α,β),(α,β)→(β,β),(α,γ)→(γ,β)跃迁矩阵元和费米子(α,γ)→(γ,β)跃迁矩阵元,并给出了无遗漏地计算二体算符全部非零矩阵元的简便方法。本文结果与Stater-Condon规则一致,并已用于研究生《高等量子力学》教学。 相似文献
753.
建立了助推—滑翔式弹道中段的无量纲运动方程。采用非线性规划方法实现弹道优化。首先求解不同初始速度、速度倾角和最大升阻比的最大射程弹道,然后考虑驻点热流、过载约束,求解总气动加热最小和射程最大的最优弹道。基于前者的计算结果分析了初始条件对最大射程弹道的影响。将考虑约束的再入滑翔弹道与弹道式再入的特征参数比较,表明再入滑翔弹道的峰值热流较小,而总气动加热增加,但再入滑翔飞行时间在一般锥形体再入机动飞行器的热防护系统可承受的时间范围内。 相似文献
754.
We use the matrix‐geometric method to study the MAP/PH/1 general preemptive priority queue with a multiple class of jobs. A procedure for obtaining the block matrices representing the transition matrix P is presented. We show that the special upper triangular structure of the matrix R obtained by Miller [Computation of steady‐state probabilities for M/M/1 priority queues, Oper Res 29(5) (1981), 945–958] can be extended to an upper triangular block structure. Moreover, the subblock matrices of matrix R also have such a structure. With this special structure, we develop a procedure to compute the matrix R. After obtaining the stationary distribution of the system, we study two primary performance indices, namely, the distributions of the number of jobs of each type in the system and their waiting times. Although most of our analysis is carried out for the case of K = 3, the developed approach is general enough to study the other cases (K ≥ 4). © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 662–682, 2003. 相似文献
755.
This paper presents a deterministic approach to schedule patients in an ambulatory surgical center (ASC) such that the number of postanesthesia care unit nurses at the center is minimized. We formulate the patient scheduling problem as new variants of the no‐wait, two‐stage process shop scheduling problem and present computational complexity results for the new scheduling models. Also, we develop a tabu search‐based heuristic algorithm to solve the patient scheduling problem. Our algorithm is shown to be very effective in finding near optimal schedules on a set of real data from a university hospital's ASC. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003 相似文献
756.
This paper tackles the general single machine scheduling problem, where jobs have different release and due dates and the objective is to minimize the weighted number of late jobs. The notion of master sequence is first introduced, i.e., a sequence that contains at least an optimal sequence of jobs on time. This master sequence is used to derive an original mixed‐integer linear programming formulation. By relaxing some constraints, a Lagrangean relaxation algorithm is designed which gives both lower and upper bounds. The special case where jobs have equal weights is analyzed. Computational results are presented and, although the duality gap becomes larger with the number of jobs, it is possible to solve problems of more than 100 jobs. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 50: 2003 相似文献
757.
A method previously devised for the solution of the p-center problem on a network has now been extended to solve the analogous minimax location-allocation problem in continuous space. The essence of the method is that we choose a subset of the n points to be served and consider the circles based on one, two, or three points. Using a set-covering algorithm we find a set of p such circles which cover the points in the relaxed problem (the one with m < n points). If this is possible, we check whether the n original points are covered by the solution; if so, we have a feasible solution to the problem. We now delete the largest circle with radius rp (which is currently an upper limit to the optimal solution) and try to find a better feasible solution. If we have a feasible solution to the relaxed problem which is not feasible to the original, we augment the relaxed problem by adding a point, preferably the one which is farthest from its nearest center. If we have a feasible solution to the original problem and we delete the largest circle and find that the relaxed problem cannot be covered by p circles, we conclude that the latest feasible solution to the original problem is optimal. An example of the solution of a problem with ten demand points and two and three service points is given in some detail. Computational data for problems of 30 demand points and 1–30 service points, and 100, 200, and 300 demand points and 1–3 service points are reported. 相似文献
758.
针对OFDM系统中基于补零DFT实现信道插值的算法,对传统的时域方法和变换域方法进行了分析,并提出了一种新的补零方法。首先通过理论分析指出传统的基于补零DFT实现信道插值算法中,时域方法和变换域方法是等效的;通过对信道插值算法中冲激响应估计序列进行补零的分析,指出补零操作是为了重构出冲激响应的N点采样序列(N表示总子载波数),并针对传统补零方法在一定条件下产生的重构误差,提出了一种新的补零方法。仿真结果表明以上理论分析是正确的,新补零方法可以减小一定条件下的重构误差,增强信道插值算法对信道延迟分布的鲁棒性,有效提高系统的性能。 相似文献
759.
针对基于重复共轭对称结构前导的OFDM系统,提出了一种延迟相关与对称相关相结合的符号同步新算法,在搜索出定时度量峰值位置的基础上,使用固定门限搜索出第一条路径。理论分析表明该方法可以实现性能良好的符号同步。在静态多径信道和6径典型市区信道条件下对新提出的算法进行了仿真,仿真结果表明所提算法可有效抑制传统的基于对称定时度量同步算法中存在的定时位置偏移,获得准确的定时性能。 相似文献
760.
Plug‐in hybrid electric vehicles (PHEVs), upon market penetration, will create additional recharging loads to the electric power systems. This article considers different recharging scenarios and uses game theoretic models to study the potential impact of the recharging loads on locational marginal prices (wholesale electricity prices). Computational results from a Pennsylvania‐New Jersey‐Maryland Interconnection case study show that, under the existing recharging infrastructures, even a small magnitude of load increase caused by PHEV recharging could have a significant undesirable impact on locational marginal prices. The impact could be mitigated to a varying extent by the availability of possible future recharging infrastructures, including realtime pricing recharging meters, battery stations, or vehicle‐to‐grid technology.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献