首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   321篇
  免费   190篇
  国内免费   25篇
  2024年   4篇
  2023年   11篇
  2022年   8篇
  2021年   16篇
  2020年   6篇
  2019年   9篇
  2018年   9篇
  2017年   17篇
  2016年   27篇
  2015年   20篇
  2014年   34篇
  2013年   19篇
  2012年   38篇
  2011年   25篇
  2010年   21篇
  2009年   22篇
  2008年   24篇
  2007年   29篇
  2006年   19篇
  2005年   21篇
  2004年   24篇
  2003年   15篇
  2002年   15篇
  2001年   15篇
  2000年   17篇
  1999年   13篇
  1998年   7篇
  1997年   3篇
  1996年   8篇
  1995年   7篇
  1994年   4篇
  1993年   8篇
  1992年   3篇
  1991年   8篇
  1990年   6篇
  1989年   3篇
  1988年   1篇
排序方式: 共有536条查询结果,搜索用时 15 毫秒
21.
在基于SAR回波的数据处理中,多普勒调频率具有很高的估计精度且对场景的依赖性很小,可以更广泛地用于自聚焦处理。基于多普勒调频率参数估计,针对回波包络及相位分别提出了误差提取模型,并通过包络误差校正和相位误差补偿两个步骤实现了高精度的运动补偿处理。实测数据表明,本文方法可以在低精度导航信息情况下获取高分辨率雷达图像。  相似文献   
22.
针对满足率只有统计定义的问题,从不同角度研究了备件满足率的概率性质,给出了满足率的两种概率模型,揭示了满足率的内涵和实际工程意义。在此基础上,给出了系统备件保障满足率的概率定义,建立了以系统备件满足率为约束、备件总重量最小为目标的随舰备件配置优化模型,研究了优化模型的边际效益算法。实例分析表明:该方法为合理制定舰艇随舰备件保障方案提供了决策依据。  相似文献   
23.
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  相似文献   
24.
In this article, we study aging properties of parallel and series systems with a random number of components. We show that the decreasing likelihood ratio property is closed under the formation of random minima. We also show, by counterexamples, that other aging properties are not closed under the formation of random minima or maxima. Some mistakes in the literature are corrected. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 238–243, 2014  相似文献   
25.
Most of the research, on the study of the reliability properties of technical systems, assume that the components of the system operate independently. However, in real life situation, it is more reasonable to assume that there is dependency among the components of the system. In this article, we give sufficient conditions based on the signature and the joint distribution of component lifetimes to obtain stochastic ordering results for coherent and mixed systems with exchangeable components. Some stochastic orders on dynamic (or conditional) signature of coherent systems are also provided. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 549–556, 2014  相似文献   
26.
针对目前大多数多核处理器任务分配优化算法没有考虑关键路径上节点对任务完成时间的重要影响,导致任务完成总时间延迟的问题,提出了基于关键路径和任务复制(CPTD)的单任务调度算法。CPTD算法通过复制任务图中fork节点的方式将任务图转化为与之相对应的产品加工树;再在生成的产品加工树中找到关键路径,并采取使关键路径上节点的紧前节点尽早调度的方式,使关键路径上节点尽早开始执行,进而使产品加工树中节点完成时间得以提前,达到缩短任务执行总时间的目的。理论分析表明,CPTD算法能够实现应用程序在多核上充分并行处理,并能缩短任务完成时间。  相似文献   
27.
本文通过把一类分段线性费用网络流问题化成线性费用网络流问题,给出了求解这类分段线性费用网络流问题的算法。  相似文献   
28.
本文给出了层流化学平衡粘性激波层方程对于细长解析体的数值解。这些求解结果是通过空间步进方法得到的,并且与参考文献里的计算结果作了比较,以估价该方法的精确度。结果表明,这种控制方程完全耦合求解的方法能够给出相当精确和稳定的结果,这些结果与参考文献的计算结果相当吻合。  相似文献   
29.
We consider the problem of scheduling customer orders in a flow shop with the objective of minimizing the sum of tardiness, earliness (finished goods inventory holding), and intermediate (work‐in‐process) inventory holding costs. We formulate this problem as an integer program, and based on approximate solutions to two different, but closely related, Dantzig‐Wolfe reformulations, we develop heuristics to minimize the total cost. We exploit the duality between Dantzig‐Wolfe reformulation and Lagrangian relaxation to enhance our heuristics. This combined approach enables us to develop two different lower bounds on the optimal integer solution, together with intuitive approaches for obtaining near‐optimal feasible integer solutions. To the best of our knowledge, this is the first paper that applies column generation to a scheduling problem with different types of strongly ????‐hard pricing problems which are solved heuristically. The computational study demonstrates that our algorithms have a significant speed advantage over alternate methods, yield good lower bounds, and generate near‐optimal feasible integer solutions for problem instances with many machines and a realistically large number of jobs. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.  相似文献   
30.
An age‐dependent repair model is proposed. The notion of the “calendar age” of the product and the degree of repair are used to define the virtual age of the product. The virtual failure rate function and the virtual hazard function related to the lifetime of the product are discussed. Under a nonhomogeneous Poisson process scenario the expected warranty costs for repairable products associated with linear pro‐rata, nonrenewing free replacement and renewing free replacement warranties are evaluated. Illustration of the results is given by numerical and graphical examples. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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