全文获取类型
收费全文 | 1255篇 |
免费 | 255篇 |
国内免费 | 188篇 |
出版年
2024年 | 1篇 |
2023年 | 13篇 |
2022年 | 8篇 |
2021年 | 25篇 |
2020年 | 17篇 |
2019年 | 26篇 |
2018年 | 14篇 |
2017年 | 75篇 |
2016年 | 100篇 |
2015年 | 51篇 |
2014年 | 101篇 |
2013年 | 75篇 |
2012年 | 95篇 |
2011年 | 124篇 |
2010年 | 75篇 |
2009年 | 132篇 |
2008年 | 96篇 |
2007年 | 99篇 |
2006年 | 113篇 |
2005年 | 90篇 |
2004年 | 68篇 |
2003年 | 49篇 |
2002年 | 44篇 |
2001年 | 37篇 |
2000年 | 30篇 |
1999年 | 30篇 |
1998年 | 22篇 |
1997年 | 17篇 |
1996年 | 10篇 |
1995年 | 9篇 |
1994年 | 12篇 |
1993年 | 9篇 |
1992年 | 13篇 |
1991年 | 7篇 |
1990年 | 6篇 |
1989年 | 4篇 |
1988年 | 1篇 |
排序方式: 共有1698条查询结果,搜索用时 31 毫秒
91.
研究了正反向量子斯特林循环的最优性能.在经典极限下,导出了循环的有限时间热力学性能界限和优化准则.得到了斯特林热机、制冷机和热泵特性参数之间的优化关系. 相似文献
92.
为实现对警用装备综合保障效能的定量评估,构建了包括战备完好性、保障资源适量性、保障经济性、保障时效性、保障信息化、保障精确性、保障弹性、保障综合性8个评估指标的综合保障效能评估体系,建立了基于熵权-双基点方法的综合效能评估模型,通过编程计算对某警用装备的5种综合保障方案进行了定量评估,根据效能优属度确立了较为优化的综合保障方案。该模型克服了主观赋权的缺陷,可以为警用装备综合保障方案的优选提供科学依据。 相似文献
93.
各类卫星在现代战争中发挥着重要和关键作用。我国传统的卫星试验和鉴定具有很强的科研试验性质,承制单位和用户重点关注的是性能检验,较少考虑作战效能和部队适用性等指标。为推动卫星装备建设和应用,装备试验鉴定部门初步组织开展了相应的在役考核工作。文章对比了美军装备作战试验与鉴定、我国作战试验与在役考核的概念;提出卫星在役考核的六大特点;分析卫星在役考核的组织方式、组织机构和组织保障的不足,提出相应发展建议;研究卫星在役考核指标体系设计、分析评估方法、问题反馈与整改等方面的不足,并提出相应措施建议。 相似文献
94.
95.
为解决当样本数据不断增加时,利用传统方法反复计算样本协方差迹耗时多的缺点,提出了一种快速递推算法。理论分析和仿真试验都表明,算法的时间复杂度比传统的方法降低了一个数量级,从而大大减少了计算时间。 相似文献
96.
Bivariate life distribution models are of importance for studying interdependent components. We present a generic approach by introducing a new concept of characterized model in stead of a characterized distribution. It strikes a balance between characterization and modeling approaches to eliminate their individual limitations and incorporate their respective strengths. The proposed model, being a characterized one, admits many important properties irrespective of the choice of marginal distributions. The retention of univariate IFR, DFR, IFRA, DFRA, NBU, and NWU class properties in the bivariate setup has been ensured along with some results on series combinations and convolution. No other models, available in the literature, can ensure simultaneous retention of these fundamental and extremely important class properties. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
97.
We state a balancing problem for mixed model assembly lines with a paced moving conveyor as: Given the daily assembling sequence of the models, the tasks of each model, the precedence relations among the tasks, and the operations parameters of the assembly line, assign the tasks of the models to the workstations so as to minimize the total overload time. Several characteristics of the problem are investigated. A line‐balancing heuristic is proposed based on a lower bound of the total overload time. A practical procedure is provided for estimating the deviation of any given line‐balance solution from the theoretical optimum. Numerical examples are given to illustrate the methodology. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
98.
Products with short life cycles are becoming increasingly common in many industries, such as the personal computer (PC) and mobile phone industries. Traditional forecasting methods and inventory policies can be inappropriate for forecasting demand and managing inventory for a product with a short life cycle because they usually do not take into account the characteristics of the product life cycle. This can result in inaccurate forecasts, high inventory cost, and low service levels. Besides, many forecasting methods require a significant demand history, which is available only after the product has been sold for some time. In this paper, we present an adaptive forecasting algorithm with two characteristics. First, it uses structural knowledge on the product life cycle to model the demand. Second, it combines knowledge on the demand that is available prior to the launch of the product with actual demand data that become available after the introduction of the product to generate and update demand forecasts. Based on the forecasting algorithm, we develop an optimal inventory policy. Since the optimal inventory policy is computationally expensive, we propose three heuristics and show in a numerical study that one of the heuristics generates near‐optimal solutions. The evaluation of our approach is based on demand data from a leading PC manufacturer in the United States, where the forecasting algorithm has been implemented. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
99.
Chen and Bhattacharyya [Exact confidence bounds for an exponential parameter under hybrid censoring, Commun Statist Theory Methods 17 (1988), 1857–1870] considered a hybrid censoring scheme and obtained the exact distribution of the maximum likelihood estimator of the mean of an exponential distribution along with an exact lower confidence bound. Childs et al. [Exact likelihood inference based on Type‐I and Type‐II hybrid censored samples from the exponential distribution, Ann Inst Statist Math 55 (2003), 319–330] recently derived an alternative simpler expression for the distribution of the MLE. These authors also proposed a new hybrid censoring scheme and derived similar results for the exponential model. In this paper, we propose two generalized hybrid censoring schemes which have some advantages over the hybrid censoring schemes already discussed in the literature. We then derive the exact distribution of the maximum likelihood estimator as well as exact confidence intervals for the mean of the exponential distribution under these generalized hybrid censoring schemes. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
100.
Extending Sastry's result on the uncapacitated two‐commodity network design problem, we completely characterize the optimal solution of the uncapacitated K‐commodity network design problem with zero flow costs for the case when K = 3. By solving a set of shortest‐path problems on related graphs, we show that the optimal solutions can be found in O(n3) time when K = 3, where n is the number of nodes in the network. The algorithm depends on identifying a list of “basic patterns”; the number of basic patterns grows exponentially with K. We also show that the uncapacitated K‐commodity network design problem can be solved in O(n3) time for general K if K is fixed; otherwise, the time for solving the problem is exponential. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献