全文获取类型
收费全文 | 1343篇 |
免费 | 391篇 |
国内免费 | 144篇 |
出版年
2024年 | 2篇 |
2023年 | 6篇 |
2022年 | 23篇 |
2021年 | 27篇 |
2020年 | 26篇 |
2019年 | 17篇 |
2018年 | 18篇 |
2017年 | 79篇 |
2016年 | 88篇 |
2015年 | 54篇 |
2014年 | 87篇 |
2013年 | 136篇 |
2012年 | 173篇 |
2011年 | 161篇 |
2010年 | 73篇 |
2009年 | 81篇 |
2008年 | 70篇 |
2007年 | 90篇 |
2006年 | 107篇 |
2005年 | 120篇 |
2004年 | 96篇 |
2003年 | 67篇 |
2002年 | 34篇 |
2001年 | 53篇 |
2000年 | 45篇 |
1999年 | 25篇 |
1998年 | 13篇 |
1997年 | 19篇 |
1996年 | 15篇 |
1995年 | 15篇 |
1994年 | 5篇 |
1993年 | 5篇 |
1992年 | 17篇 |
1991年 | 13篇 |
1990年 | 11篇 |
1989年 | 5篇 |
1988年 | 2篇 |
排序方式: 共有1878条查询结果,搜索用时 15 毫秒
921.
独立分量排序是独立分量分析的热点问题,是提高特征空间鲁棒性和减少计算复杂度的必要前提。结合ICA在时间序列预测的应用,给出了基于一阶差分和最小方差误差的多分量联合重构预测排序准则。为了避免联合优化中出现的海量计算问题,提出了添加-测试-接受机制(ATA)的次优搜索方法。实验结果表明,和传统排序方法比较,新方法具有优异的预测能力和搜索效率。 相似文献
922.
结合PML边界条件的傅立叶时域伪谱(PSTD)算法已被广泛用于模拟电磁波传播和目标散射,但传统的PSTD方法在每个坐标方向上需要均匀分布的空间坐标网格点,因而不能够很好地模拟曲面目标和与网格空间尺寸不一致的目标,基于变空间非均匀网格的PSTD(TSNU-PSTD)方法可以很好地克服这些不足。将CFS-PML边界条件应用在PSTD算法中,并将其与TSNU-PSTD方法相结合模拟了大范围有耗媒质中介质体目标的电磁散射,部分计算结果与FDTD计算结果进行了比较。仿真结果表明,TSNU-PSTD算法只需平均每波长分成3个网格就可以得到令人满意的计算结果,可高效地分析大范围有耗媒质中曲面形状目标体的散射特性。 相似文献
923.
924.
This study introduces one modeling methodology that describes a broad range of multiple stage production planning issues, including multiple limited resources with setup times and joint fixed cost relationships. An existing production system is modeled in this fashion, creating a new set of 1350 highly generalized benchmark problems. A computational study is conducted with the 1350 benchmark problems introduced in this paper and 2100 benchmark problems, with more restrictive assumptions, from the existing literature. The relative merits of a decomposition‐based algorithm and a neighborhood search technique known as NIPPA, or the Non‐sequential Incremental Part Period Algorithm, are assessed. NIPPA is generally the more successful of the two techniques, although there are specific instances in which the decomposition‐based algorithm displayed a distinct advantage. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
925.
A 2‐dimensional rectangular k‐within‐consecutive‐(r, s)‐out‐of‐(m, n):F system consists of m × n components, and fails if and only if k or more components fail in an r × s submatrix. This system can be treated as a reliability model for TFT liquid crystal displays, wireless communication networks, etc. Although an effective method has been developed for evaluating the exact system reliability of small or medium‐sized systems, that method needs extremely high computing time and memory capacity when applied to larger systems. Therefore, developing upper and lower bounds and accurate approximations for system reliability is useful for large systems. In this paper, first, we propose new upper and lower bounds for the reliability of a 2‐dimensional rectangular k‐within‐consecutive‐(r, s)‐out‐of‐(m, n):F system. Secondly, we propose two limit theorems for that system. With these theorems we can obtain accurate approximations for system reliabilities when the system is large and component reliabilities are close to one. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
926.
Following work of Stroud and Saeger (Proceedings of ISI, Springer Verlag, New York, 2006) and Anand et al. (Proceedings of Computer, Communication and Control Technologies, 2003), we formulate a port of entry inspection sequencing task as a problem of finding an optimal binary decision tree for an appropriate Boolean decision function. We report on new algorithms for finding such optimal trees that are more efficient computationally than those presented by Stroud and Saeger and Anand et al. We achieve these efficiencies through a combination of specific numerical methods for finding optimal thresholds for sensor functions and two novel binary decision tree search algorithms that operate on a space of potentially acceptable binary decision trees. The improvements enable us to analyze substantially larger applications than was previously possible. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
927.
We consider a supplier with finite production capacity and stochastic production times. Customers provide advance demand information (ADI) to the supplier by announcing orders ahead of their due dates. However, this information is not perfect, and customers may request an order be fulfilled prior to or later than the expected due date. Customers update the status of their orders, but the time between consecutive updates is random. We formulate the production‐control problem as a continuous‐time Markov decision process and prove there is an optimal state‐dependent base‐stock policy, where the base‐stock levels depend upon the numbers of orders at various stages of update. In addition, we derive results on the sensitivity of the state‐dependent base‐stock levels to the number of orders in each stage of update. In a numerical study, we examine the benefit of ADI, and find that it is most valuable to the supplier when the time between updates is moderate. We also consider the impact of holding and backorder costs, numbers of updates, and the fraction of customers that provide ADI. In addition, we find that while ADI is always beneficial to the supplier, this may not be the case for the customers who provide the ADI. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
928.
提出了一种在球坐标系下的无源时差定位算法,该算法解决了参变量法中难于解决的模糊和无解问题,计算量小,定位结果可信。当布站接近平面时,本算法可独立进行定位,当站址高度差较大时本算法可以与参变量法相配合解决模糊和无解问题,适合于工程应用。 相似文献
929.
930.
武器系统概率指标的贝叶斯决策评定方法 总被引:1,自引:1,他引:0
剖析了武器系统试验工程领域中常用二项分布经典假设检验方法存在的问题,从贝叶斯决策思想和理论出发提出了概率指标评定的新方法,通过实例对比证明了贝叶斯决策评定方法有效解决了二项分布经典假设检验方法中存在的问题。 相似文献