全文获取类型
| 收费全文 | 629篇 |
| 免费 | 25篇 |
| 国内免费 | 2篇 |
专业分类
| 656篇 |
出版年
| 2025年 | 2篇 |
| 2024年 | 5篇 |
| 2023年 | 24篇 |
| 2022年 | 11篇 |
| 2021年 | 11篇 |
| 2020年 | 13篇 |
| 2019年 | 20篇 |
| 2018年 | 17篇 |
| 2017年 | 26篇 |
| 2016年 | 31篇 |
| 2015年 | 27篇 |
| 2014年 | 46篇 |
| 2013年 | 54篇 |
| 2012年 | 45篇 |
| 2011年 | 39篇 |
| 2010年 | 21篇 |
| 2009年 | 32篇 |
| 2008年 | 24篇 |
| 2007年 | 33篇 |
| 2006年 | 21篇 |
| 2005年 | 20篇 |
| 2004年 | 18篇 |
| 2003年 | 20篇 |
| 2002年 | 16篇 |
| 2001年 | 16篇 |
| 2000年 | 15篇 |
| 1999年 | 5篇 |
| 1998年 | 6篇 |
| 1997年 | 4篇 |
| 1996年 | 3篇 |
| 1995年 | 5篇 |
| 1994年 | 6篇 |
| 1993年 | 4篇 |
| 1992年 | 4篇 |
| 1991年 | 3篇 |
| 1990年 | 3篇 |
| 1989年 | 5篇 |
| 1988年 | 1篇 |
排序方式： 共有656条查询结果，搜索用时 15 毫秒
81.
82.
出于以导频通道为代表的北斗全球导航卫星系统现代化信号结构升级以及后向兼容的需求,北斗系统近几年提出了多种新型恒包络调制和复用技术,包括适用于北斗系统B1频点的正交复用二进制偏移载波(QMBOC)调制和非对称双正交相移键控(ADualQPSK)调制,适用于B2频点的时分复用AltBOC(TDAlt BOC)调制与非对称恒包络二进制偏移载波(ACE-BOC)调制,适用于B3频点的双正交相移键控(DualQPSK)调制,适用于双边带任意信号路数、任意功率配比的广义恒包络二进制偏移载波(GCE-BOC)调制。本文系统性地论述了北斗全球系统中提出的多种新型恒包络调制和复用技术,在此基础上基于GCEBOC调制总结出了一种恒包络调制的统一解析表示形式,对全面理解北斗全球系统信号设计思路及在此基础上发展设计新型的恒包络调制和复用技术均能提供重要的借鉴。 相似文献
83.
预报潜艇上浮运动是探索研究潜艇上浮运动控制规律以及潜艇安全上浮的前提。就潜艇上浮运动的数值计算方法和计算流程进行了详细介绍,对数值计算方法中的湍流模型及离散格式等进行了优选。基于模型上浮试验结果,对数值计算的不确定度进行了分析且对数值计算结果进行了验证。证明了该数值计算的可靠性,并发现数值计算结果与试验结果很接近,验证了该数值计算方法的可行性,说明该数值计算方法和试验可为潜艇上浮运动的研究提供参考和借鉴。 相似文献
84.
We study a setting with a single type of resource and with several players, each associated with a single resource (of this type). Unavailability of these resources comes unexpectedly and with player‐specific costs. Players can cooperate by reallocating the available resources to the ones that need the resources most and let those who suffer the least absorb all the costs. We address the cost savings allocation problem with concepts of cooperative game theory. In particular, we formulate a probabilistic resource pooling game and study them on various properties. We show that these games are not necessarily convex, do have non‐empty cores, and are totally balanced. The latter two are shown via an interesting relationship with Böhm‐Bawerk horse market games. Next, we present an intuitive class of allocation rules for which the resulting allocations are core members and study an allocation rule within this class of allocation rules with an appealing fairness property. Finally, we show that our results can be applied to a spare parts pooling situation. 相似文献
85.
John-Paul Safunu Banchani 《African Security Review》2016,25(4):420-426
Africa and for that matter the Gulf of Guinea cannot be indifferent to the global energy politics of the 21st century. The increasing importance of the region has attracted major actors in the energy sector. The competing interests of these actors are played out in various forms. This heightened interest in the region, especially with the discovery of oil in huge commercial quantities, has brought the importance of the area into focus in global oil politics. This paper looks at the importance of the region in light of the huge energy potentials of the Gulf of Guinea and how the institution of proper governance systems could serve as an important factor in ensuring the proper management of the resource. 相似文献
86.
基于离散事件系统建模与仿真的军事仿真系统在军事筹划阶段扮演着至关重要的作用。因果追溯与分析是军事仿真中重要的技术,它可以在大量的数据与复杂的交互关系中找出时序上的关联关系,帮助研究人员确定作战行动中的一些关键实体或事件,用于探究战争的发展脉络与蕴含其中的因果关系。首先对作战仿真领域的因果追溯分析做了简要介绍,然后提出了一种基于离散事件仿真要素的因果追溯分析方法,这种方法可以分析军事仿真中的因果关系,并且有很高的通用性和良好的实用性。 相似文献
87.
An area defense consists of several groups that act independently, i.e., do not communicate with each other. Each group has a fixed number of defenders and a controller that allocates these defenders optimally against the individual attackers comprising an attack. We analyze the effectiveness of this partially coordinated defense against a simultaneous attack of known size in which all attackers are considered to be equally lethal. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
88.
We consider a short‐term capacity allocation problem with tool and setup constraints that arises in the context of operational planning in a semiconductor wafer fabrication facility. The problem is that of allocating the available capacity of parallel nonidentical machines to available work‐in‐process (WIP) inventory of operations. Each machine can process a subset of the operations and a tool setup is required on a machine to change processing from one operation to another. Both the number of tools available for an operation and the number of setups that can be performed on a machine during a specified time horizon are limited. We formulate this problem as a degree‐constrained network flow problem on a bipartite graph, show that the problem is NP‐hard, and propose constant factor approximation algorithms. We also develop constructive heuristics and a greedy randomized adaptive search procedure for the problem. Our computational experiments demonstrate that our solution procedures solve the problem efficiently, rendering the use of our algorithms in real environment feasible. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
89.
A. Garnaev 《海军后勤学研究》2007,54(1):109-114
This paper deals with a two searchers game and it investigates the problem of how the possibility of finding a hidden object simultaneously by players influences their behavior. Namely, we consider the following two‐sided allocation non‐zero‐sum game on an integer interval [1,n]. Two teams (Player 1 and 2) want to find an immobile object (say, a treasure) hidden at one of n points. Each point i ∈ [1,n] is characterized by a detection parameter λi (μi) for Player 1 (Player 2) such that pi(1 ? exp(?λixi)) (pi(1 ? exp(?μiyi))) is the probability that Player 1 (Player 2) discovers the hidden object with amount of search effort xi (yi) applied at point i where pi ∈ (0,1) is the probability that the object is hidden at point i. Player 1 (Player 2) undertakes the search by allocating the total amount of effort X(Y). The payoff for Player 1 (Player 2) is 1 if he detects the object but his opponent does not. If both players detect the object they can share it proportionally and even can pay some share to an umpire who takes care that the players do not cheat each other, namely Player 1 gets q1 and Player 2 gets q2 where q1 + q2 ≤ 1. The Nash equilibrium of this game is found and numerical examples are given. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
90.
基于离散降雨衰耗状态的卫星信道模型 总被引：1，自引：0，他引：1
针对Ka频段卫星信道中降雨衰耗的统计分布特点,建立了基于离散降雨衰耗状态的卫星信道模型,模型中各状态组成离散的Markov链并由其转移概率矩阵来表示,分析此模型下的信道误比特性能和数据包丢失性能。此模型能够适用于链路层以及高层通信协议。 相似文献