首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   551篇
  免费   284篇
  国内免费   44篇
  2024年   4篇
  2023年   12篇
  2022年   10篇
  2021年   14篇
  2020年   12篇
  2019年   18篇
  2018年   15篇
  2017年   33篇
  2016年   45篇
  2015年   42篇
  2014年   49篇
  2013年   38篇
  2012年   47篇
  2011年   65篇
  2010年   46篇
  2009年   53篇
  2008年   30篇
  2007年   46篇
  2006年   38篇
  2005年   37篇
  2004年   35篇
  2003年   25篇
  2002年   22篇
  2001年   22篇
  2000年   25篇
  1999年   22篇
  1998年   17篇
  1997年   12篇
  1996年   4篇
  1995年   3篇
  1994年   8篇
  1993年   10篇
  1992年   6篇
  1991年   6篇
  1990年   4篇
  1989年   3篇
  1988年   1篇
排序方式: 共有879条查询结果,搜索用时 15 毫秒
231.
吊放声纳非探测时间的计算公式   总被引:1,自引:1,他引:0  
使用吊放声纳探测潜艇是直升机反潜的主要样式。在评价直升机跟踪潜艇和潜艇规避其跟踪的方法中,吊放声纳非探测时间是最主要的参数。此外给出了计算非探测时间的公式。  相似文献   
232.
内可逆卡诺热泵的生态学优化性能   总被引:1,自引:0,他引:1  
本文导出了内可逆卡诺热泵的供热量、供热率和供热系数的耗散量,以反映热泵供热率π与其耗散φ_cT_Lσ,即热泵熵产率σ、低温热源温度T_L和可逆供热系数φ_c乘积之间最佳折衷的“生态学”性能E=π-φ_cT_Lσ为目标,基于牛顿和线性唯象传热定律,研究内可逆卡诺热泵的优化问题,得到最大E性能时的供热系数界限及相应的供热率和熵产率。  相似文献   
233.
非线性传热条件下的内可逆卡诺热机最优性能有了一些讨论,本文将导出不可逆卡诺热泵工作于非线性传热 Q■条件下,最佳供热系数д与泵热率π的关系。据此可确定任意泵热率时所对应的供热系数界限。最后,讨论了这一关系的一些应用,所得结果包含了经典热力学及内可逆线性传热情况下的有关结论,为实际热泵设计提供新的理论依据。  相似文献   
234.
采用RLS算法的功率倒置阵列的性能   总被引:7,自引:3,他引:7       下载免费PDF全文
为解决功率倒置阵列采用LMS算法时收敛速度和稳态失调误差不能兼顾的缺点,提出了采用RLS算法实现功率倒置阵列的方法。仿真结果表明,功率倒置阵列采用RLS算法和LMS算法都能达到较好的抗干扰效果。和LMS算法相比,RLS算法同时具有收敛速度快和稳态失调误差小的优点,代价是计算量增大。  相似文献   
235.
Degradation experiments are widely used to assess the reliability of highly reliable products which are not likely to fail under the traditional life tests. In order to conduct a degradation experiment efficiently, several factors, such as the inspection frequency, the sample size, and the termination time, need to be considered carefully. These factors not only affect the experimental cost, but also affect the precision of the estimate of a product's lifetime. In this paper, we deal with the optimal design of a degradation experiment. Under the constraint that the total experimental cost does not exceed a predetermined budget, the optimal decision variables are solved by minimizing the variance of the estimated 100pth percentile of the lifetime distribution of the product. An example is provided to illustrate the proposed method. Finally, a simulation study is conducted to investigate the robustness of this proposed method. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 689–706, 1999  相似文献   
236.
Scheduling a set of n jobs on a single machine so as to minimize the completion time variance is a well‐known NP‐hard problem. In this paper, we propose a sequence, which can be constructed in O(n log n) time, as a solution for the problem. Our primary concern is to establish the asymptotical optimality of the sequence within the framework of probabilistic analysis. Our main result is that, when the processing times are randomly and independently drawn from the same uniform distribution, the sequence is asymptotically optimal in the sense that its relative error converges to zero in probability as n increases. Other theoretical results are also derived, including: (i) When the processing times follow a symmetric structure, the problem has 2⌊(n−1)/2⌋ optimal sequences, which include our proposed sequence and other heuristic sequences suggested in the literature; and (ii) when these 2⌊(n−1)/2⌋ sequences are used as approximate solutions for a general problem, our proposed sequence yields the best approximation (in an average sense) while another sequence, which is commonly believed to be a good approximation in the literature, is interestingly the worst. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 373–398, 1999  相似文献   
237.
The paper deals with a problem of scheduling a set of jobs on a single machine. Before a job is released for processing, it must undergo some preprocessing treatment that consumes resources. It is assumed that the release date of a job is a linear decreasing continuous function of the amount of a locally and globally constrained, continuously divisible resource (e.g., energy, catalyzer, financial outlay, gas). The problem is to find a sequence of jobs and a resource allocation that will minimize the maximum job completion time. Such a problem appears, for example, in the ingot preheating and hot-rolling process in steel mills. It is shown that the problem is strongly NP-hard. Some polynomially solvable cases of the problem and approximate algorithms with both experimental and worst-case analysis are presented. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 99–113, 1998  相似文献   
238.
为实现低频电磁发信系统的小型化和低功耗,对基于旋转永磁体的机械天线,即利用永磁体机械旋转直接激励电磁波的新型低频电磁发信技术进行了理论研究与工程实践。提出基于钕铁硼永磁体和永磁同步电机的旋转永磁式机械天线技术方案及其信息加载方法,构建基于电-机械-电磁能量转换的系统模型,对其辐射效率和辐射功率进行初步分析,研究旋转永磁体在不同无限均匀介质中产生时变磁场的分布与衰减特性,研制了原理样机,并对其近区磁场和2FSK信号的加载特性进行了实验测试,验证了该方案的可行性和有效性。  相似文献   
239.
卫星导航接收机极易受到电磁干扰的影响,基于阵列接收机的空时(频)抗干扰技术被证明是目前最有效的抗干扰手段。在工程实现时,阵列通道存在通道失配,本文以统计性能的评估方法评估了通道失配对阵列抗干扰性能的影响。研究结果表明,通道间群时延偏差和幅度失配是导致阵列抗干扰性能下降的主要因素,前者可通过增加空时滤波器阶数来消除影响,而后者对空时滤波器阶数不敏感,需要进行必要的校正。  相似文献   
240.
Facing fierce competition from rivals, sellers in online marketplaces are eager to improve their sales by delivering items faster and more reliably. Because logistics quality can be known only after a transaction, sellers must identify effective ways to communicate logistics information to consumers. Drawing on the accessibility-diagnosticity framework, we theorize that the sales impacts of logistics information depend on its relative diagnostic value. Using data on 1493 items with 505,785 consumer reviews from an online marketplace, we examine how sales are affected by three information sources for logistics services: online word of mouth (WOM) about logistics, self-reported logistics services, and expected delivery time. We use an instrumental variable method to address the endogeneity issue between sales and WOM. We find that, ceteris paribus, consumers give more weight to WOM about logistics and delivery time when they make purchase decisions but less weight to self-reported logistics service. The effects of logistics information on sales are asymmetric for large and small sellers.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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