首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   723篇
  免费   231篇
  国内免费   33篇
  2024年   3篇
  2023年   5篇
  2022年   5篇
  2021年   17篇
  2020年   10篇
  2019年   27篇
  2018年   11篇
  2017年   39篇
  2016年   44篇
  2015年   29篇
  2014年   46篇
  2013年   98篇
  2012年   41篇
  2011年   70篇
  2010年   47篇
  2009年   54篇
  2008年   38篇
  2007年   70篇
  2006年   49篇
  2005年   46篇
  2004年   43篇
  2003年   24篇
  2002年   31篇
  2001年   26篇
  2000年   30篇
  1999年   25篇
  1998年   13篇
  1997年   12篇
  1996年   2篇
  1995年   3篇
  1994年   5篇
  1993年   7篇
  1992年   6篇
  1991年   5篇
  1990年   4篇
  1989年   1篇
  1988年   1篇
排序方式: 共有987条查询结果,搜索用时 375 毫秒
51.
对某小型电动无人机(以下简称SEPUAV)在其左翼破损40%面积矩下的操稳特性进行详细分析。首先在此损伤下典型大侧滑角定常工作点附近进行特殊的小扰动线性化,然后进行特征根和飞行运动模态的分析;其次对此特殊构型SEPUAV进行操稳特性、时频响应特性进行分析。分析结果表明:左翼破损40%面积矩SEPUAV出现特有运动模态并影响全部纵侧向运动状态的响应;部分传递函数出现较多非最小相位零点从而导致初始响应发生反向;部分通道的Bode图中出现多个波峰波谷并有相角提前等现象。分析结果对后续容损飞行控制器的设计起到铺垫的作用。  相似文献   
52.
In scheduling problems with two competing agents, each one of the agents has his own set of jobs to be processed and his own objective function, and both share a common processor. In the single‐machine problem studied in this article, the goal is to find a joint schedule that minimizes the total deviation of the job completion times of the first agent from a common due‐date, subject to an upper bound on the maximum deviation of job completion times of the second agent. The problem is shown to be NP‐hard even for a nonrestrictive due‐date, and a pseudopolynomial dynamic program is introduced and tested numerically. For the case of a restrictive due‐date (a sufficiently small due‐date that may restrict the number of early jobs), a faster pseudopolynomial dynamic program is presented. We also study the multiagent case, which is proved to be strongly NP‐hard. A simple heuristic for this case is introduced, which is tested numerically against a lower bound, obtained by extending the dynamic programming algorithm. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 1–16, 2014  相似文献   
53.
Service systems such as call centers and hospital emergency rooms typically have strongly time‐varying arrival rates. Thus, a nonhomogeneous Poisson process (NHPP) is a natural model for the arrival process in a queueing model for performance analysis. Nevertheless, it is important to perform statistical tests with service system data to confirm that an NHPP is actually appropriate, as emphasized by Brown et al. [8]. They suggested a specific statistical test based on the Kolmogorov–Smirnov (KS) statistic after exploiting the conditional‐uniform (CU) property to transform the NHPP into a sequence of i.i.d. random variables uniformly distributed on [0,1] and then performing a logarithmic transformation of the data. We investigate why it is important to perform the final data transformation and consider what form it should take. We conduct extensive simulation experiments to study the power of these alternative statistical tests. We conclude that the general approach of Brown et al. [8] is excellent, but that an alternative data transformation proposed by Lewis [22], drawing upon Durbin [10], produces a test of an NHPP test with consistently greater power. We also conclude that the KS test after the CU transformation, without any additional data transformation, tends to be best to test against alternative hypotheses that primarily differ from an NHPP only through stochastic and time dependence. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 66–90, 2014  相似文献   
54.
We develop the first approximation algorithm with worst‐case performance guarantee for capacitated stochastic periodic‐review inventory systems with setup costs. The structure of the optimal control policy for such systems is extremely complicated, and indeed, only some partial characterization is available. Thus, finding provably near‐optimal control policies has been an open challenge. In this article, we construct computationally efficient approximate optimal policies for these systems whose demands can be nonstationary and/or correlated over time, and show that these policies have a worst‐case performance guarantee of 4. We demonstrate through extensive numerical studies that the policies empirically perform well, and they are significantly better than the theoretical worst‐case guarantees. We also extend the analyses and results to the case with batch ordering constraints, where the order size has to be an integer multiple of a base load. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 304–319, 2014  相似文献   
55.
56.
卫星工程中广泛采用的有效载荷支架结构可能会与卫星主体结构发生动力耦合,进而造成有效载荷响应显著放大。进一步将有效载荷支架与卫星主体结构考虑为一个整体系统(称为星架系统)。采用有限元方法建立某型卫星系统级动力学分析模型,从中提取结构参数建立集中参数模型,并针对结构参数进行单变量影响分析。结果表明:所建集中参数模型能够反映支架结构与卫星主体结构之间动力耦合规律,载荷响应对两者频率参数的敏感程度远高于其阻尼和质量参数,卫星结构设计阶段应重点考量主体结构和支架结构频率关系以优化卫星载荷的动力学环境。  相似文献   
57.
研究了正反向量子斯特林循环的最优性能.在经典极限下,导出了循环的有限时间热力学性能界限和优化准则.得到了斯特林热机、制冷机和热泵特性参数之间的优化关系.  相似文献   
58.
为解决当样本数据不断增加时,利用传统方法反复计算样本协方差迹耗时多的缺点,提出了一种快速递推算法。理论分析和仿真试验都表明,算法的时间复杂度比传统的方法降低了一个数量级,从而大大减少了计算时间。  相似文献   
59.
We consider the problem of scheduling a set of jobs on a single machine subject to random breakdowns. We focus on the preemptive‐repeat model, which addresses the situation where, if a machine breaks down during the processing of a job, the work done on the job prior to the breakdown is lost and the job will have to be started from the beginning again when the machine resumes its work. We allow that (i) the uptimes and downtimes of the machine follow general probability distributions, (ii) the breakdown process of the machine depends upon the job being processed, (iii) the processing times of the jobs are random variables following arbitrary distributions, and (iv) after a breakdown, the processing time of a job may either remain a same but unknown amount, or be resampled according to its probability distribution. We first derive the optimal policy for a class of problems under the criterion to maximize the expected discounted reward earned from completing all jobs. The result is then applied to further obtain the optimal policies for other due date‐related criteria. We also discuss a method to compute the moments and probability distributions of job completion times by using their Laplace transforms, which can convert a general stochastic scheduling problem to its deterministic equivalent. The weighted squared flowtime problem and the maintenance checkup and repair problem are analyzed as applications. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004  相似文献   
60.
There is a finite cyclic graph. The hider chooses one of all nodes except the specified one, and he hides an (immobile) object there. At the beginning the seeker is at the specified node. After the seeker chooses an ordering of the nodes except the specified one, he examines each nodes in that order until he finds the object, traveling along edges. It costs an amount when he moves from a node to an adjacent one and also when he checks a node. While the hider wishes to maximize the sum of the traveling costs and the examination costs which are required to find the object, the seeker wishes to minimize it. The problem is modeled as a two‐person zero‐sum game. We solve the game when unit costs (traveling cost + examination cost) have geometrical relations depending on nodes. Then we give properties of optimal strategies of both players. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号