全文获取类型
收费全文 | 3606篇 |
免费 | 138篇 |
国内免费 | 7篇 |
出版年
2021年 | 41篇 |
2019年 | 91篇 |
2018年 | 53篇 |
2017年 | 88篇 |
2016年 | 78篇 |
2015年 | 74篇 |
2014年 | 80篇 |
2013年 | 725篇 |
2012年 | 51篇 |
2011年 | 56篇 |
2010年 | 61篇 |
2009年 | 61篇 |
2008年 | 78篇 |
2007年 | 64篇 |
2006年 | 48篇 |
2005年 | 46篇 |
2004年 | 65篇 |
2003年 | 45篇 |
2002年 | 62篇 |
2001年 | 48篇 |
1999年 | 54篇 |
1998年 | 54篇 |
1997年 | 56篇 |
1996年 | 69篇 |
1995年 | 45篇 |
1994年 | 62篇 |
1993年 | 67篇 |
1992年 | 63篇 |
1991年 | 77篇 |
1990年 | 40篇 |
1989年 | 73篇 |
1988年 | 78篇 |
1987年 | 68篇 |
1986年 | 71篇 |
1985年 | 66篇 |
1983年 | 42篇 |
1982年 | 43篇 |
1981年 | 46篇 |
1980年 | 51篇 |
1979年 | 46篇 |
1978年 | 49篇 |
1977年 | 45篇 |
1976年 | 45篇 |
1975年 | 46篇 |
1974年 | 52篇 |
1973年 | 50篇 |
1972年 | 52篇 |
1971年 | 43篇 |
1970年 | 40篇 |
1969年 | 40篇 |
排序方式: 共有3751条查询结果,搜索用时 15 毫秒
341.
为了解决传统的自适应均衡技术需发送训练序列的问题,采用盲均衡技术,利用接收信号本身的特征使均衡器收敛。提出了一种新的盲均衡算法(C&D算法),该算法将CRIMNO算法和判决引导(Decision Directed,DD)算法相结合,利用信号序列间的互不相关特性,从而使其具有全局收敛性能。实验结果表明:与CRIMNO算法相比,在相同的信噪比下,该算法具有收敛快速、运算量少和残留误差小的特点。 相似文献
342.
343.
Calculations for large Markovian finite source, finite repair capacity two-echelon repairable item inventory models are shown to be feasible using the randomization technique and a truncated state space approach. More complex models (involving transportation pipelines, multiple-item types and additional echelon levels) are also considered. 相似文献
344.
The general problem we are concerned with here is the estimation of Pθ(C) where C is some fixed event and Pθ is unknown in some class. The various available estimation procedures seem to involve the choice of some random probability measure. In particular we consider this problem when C is a disk in R2 centered at o and Pθ is restricted to be bivariate normal. Details concerning the implementation of the estimation procedures and a Monte Carlo study are discussed for this case. This particular problem arises when we are concerned with assessing the accuracy of a targeting procedure. 相似文献
345.
The problem is to protect a set of t targets by n perfect interceptors against an attack by m perfect weapons. If the defender solves for an optimal preallocated preferential defense and associated game value assuming m1 attackers, and the attacker knows the assumption of the defender and utilizes m2 attackers, he may be able to achieve significantly more damage than had the defender assumed that there would be m2 attackers. The article treats the robustness of preallocated preferential defense to assumptions about the size of the attack and presents results of an alternative approach. 相似文献
346.
Joseph Y.‐T. Leung 《海军后勤学研究》2002,49(4):422-431
We consider the problem of sequencing n jobs on a single machine, with each job having a processing time and a common due date. The common due date is assumed to be so large that all jobs can complete by the due date. It is known that there is an O(n log n)‐time algorithm for finding a schedule with minimum total earliness and tardiness. In this article, we consider finding a schedule with dual criteria. The primary goal is to minimize the total earliness and tardiness. The secondary goals are to minimize: (1) the maximum earliness and tardiness; (2) the sum of the maximum of the squares of earliness and tardiness; (3) the sum of the squares of earliness and tardiness. For the first two criteria, we show that the problems are NP‐hard and we give a fully polynomial time approximation scheme for both of them. For the last two criteria, we show that the ratio of the worst schedule versus the best schedule is no more than . © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 422–431, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10020 相似文献
347.
Variations of Hale's channel assignment problem, the L(j, k)‐labeling problem and the radio labeling problem require the assignment of integers to the vertices of a graph G subject to various distance constraints. The λj,k‐number of G and the radio number of G are respectively the minimum span among all L(j, k)‐labelings, and the minimum span plus 1 of all radio labelings of G (defined in the Introduction). In this paper, we establish the λj,k‐number of ∏ K for pairwise relatively prime integers t1 < t2 < … < tq, t1 ≥ 2. We also show the existence of an infinite class of graphs G with radio number |V(G)| for any diameter d(G). © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
348.
CM已成为当今局部战争中实施常规威慑的主要兵器。在详细论述CM的基础上,围绕打击目标、杀伤能力、突防能力、研制成本4个方面进行了分析。 相似文献
349.
Christopher G. Pernin Angela O’Mahony Thomas S. Szayna Derek Eaton Katharina Ley Best Elizabeth Bodine-Baron 《Defense & Security Analysis》2017,33(3):209-222
US national security guidance, as well as the US Army’s operational experiences since 2001, emphasizes the importance of working closely with partner countries to achieve US strategic objectives. The US Army has introduced the global landpower network (GLN) concept as a means to integrate, sustain and advance the Army’s considerable ongoing efforts to meet US national security guidance. This study develops the GLN concept further, and addresses three questions. What benefits can the GLN provide the Army? What are the essential components of the GLN? What options exist for implementing the GLN concept? By developing the GLN concept, the Army has the opportunity to transition the GLN from an often ad hoc and reactive set of relationships to one that the Army more self-consciously prioritizes and leverages as a resource to meet US strategic objectives. 相似文献
350.
This article introduces the use of Benders' cuts to guide a large neighborhood search to solve the traveling umpire problem, a sports scheduling problem inspired by the real‐life needs of the officials of a sports league. At each time slot, a greedy matching heuristic is used to construct a schedule. When an infeasibility is recognized first a single step backtracking is tried to resolve the infeasibility. If unsuccessful, Benders' cuts are generated to guide a large neighborhood search to ensure feasibility and to improve the solution. Realizing the inherent symmetry present in the problem, a large family of cuts are generated and their effectiveness is tested. The resulting approach is able to find better solutions to many instances of this problem. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献