全文获取类型
收费全文 | 367篇 |
免费 | 195篇 |
国内免费 | 33篇 |
出版年
2024年 | 2篇 |
2023年 | 2篇 |
2022年 | 6篇 |
2021年 | 6篇 |
2020年 | 12篇 |
2019年 | 11篇 |
2018年 | 30篇 |
2017年 | 34篇 |
2016年 | 36篇 |
2015年 | 22篇 |
2014年 | 44篇 |
2013年 | 55篇 |
2012年 | 41篇 |
2011年 | 35篇 |
2010年 | 23篇 |
2009年 | 28篇 |
2008年 | 20篇 |
2007年 | 23篇 |
2006年 | 23篇 |
2005年 | 27篇 |
2004年 | 23篇 |
2003年 | 11篇 |
2002年 | 13篇 |
2001年 | 14篇 |
2000年 | 9篇 |
1999年 | 7篇 |
1998年 | 7篇 |
1997年 | 4篇 |
1996年 | 3篇 |
1995年 | 2篇 |
1994年 | 3篇 |
1993年 | 6篇 |
1992年 | 4篇 |
1991年 | 4篇 |
1990年 | 5篇 |
排序方式: 共有595条查询结果,搜索用时 921 毫秒
51.
为高精度模拟高动态条件下GNSS信号的多普勒特性,提出一种任意阶直接数字合成信号合成器的设计方法。设计任意阶直接数字合成信号合成器的结构;通过理论分析,推导各级累加器相位初值的计算公式;给出字长选择方法。经仿真验证,该方法能精确模拟GNSS信号的多普勒特性。此外,提出的直接数字合成器设计方法不受阶数的限制,可普遍应用于各类信号模拟器的设计。 相似文献
52.
53.
We consider a general linear filtering operation on an autoregressive moving average (ARMA) time series. The variance of the filter output, which is an important quantity in many applications, is not known with certainty because it depends on the true ARMA parameters. We derive an expression for the sensitivity (i.e., the partial derivative) of the output variance with respect to deviations in the model parameters. The results provide insight into the robustness of many common statistical methods that are based on linear filtering and also yield approximate confidence intervals for the output variance. We discuss applications to time series forecasting, statistical process control, and automatic feedback control of industrial processes. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
54.
55.
基于对电磁力以及热应力的解析计算公式的推导,运用ANSYS有限元仿真软件对固定电抗器顶底端面情况下的铜箔进行电磁-温度-结构耦合分析,分别得出热应力及所受总应力与应变的分布情况。进一步对电抗器的结构进行优化,综合考虑其结构强度要求与连发温度要求,确定电抗器的最优设计结构,最终通过试验验证出仿真与设计方案真实可信。 相似文献
56.
In this article, the Building Evacuation Problem with Shared Information (BEPSI) is formulated as a mixed integer linear program, where the objective is to determine the set of routes along which to send evacuees (supply) from multiple locations throughout a building (sources) to the exits (sinks) such that the total time until all evacuees reach the exits is minimized. The formulation explicitly incorporates the constraints of shared information in providing online instructions to evacuees, ensuring that evacuees departing from an intermediate or source location at a mutual point in time receive common instructions. Arc travel time and capacity, as well as supply at the nodes, are permitted to vary with time and capacity is assumed to be recaptured over time. The BEPSI is shown to be NP‐hard. An exact technique based on Benders decomposition is proposed for its solution. Computational results from numerical experiments on a real‐world network representing a four‐story building are given. Results of experiments employing Benders cuts generated in solving a given problem instance as initial cuts in addressing an updated problem instance are also provided. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
57.
指纹细节点的提取对于指纹识别系统的性能至关重要,文中在二值细化指纹图像的细节点提取算法基础上,对细节点提取范围进行了算法改进,用C++语言实现了一种限制提取范围的算法和一种去除伪细节点的算法。实验表明,改进算法提取细节点的速度和精度都有了明显改进,相对原始的未加限制和去除伪细节点的算法,文中算法耗时减少了约2/3,细节点有效性提升了约3/4。 相似文献
58.
李霞 《兵团教育学院学报》2001,11(2):92-93
信息时代对图书馆工作提出了新的要求。通过继续教育可使图书馆员增加知识储备 ,提高业务素质和掌握新技术的能力 ,以便更迅速、准确地为读者提供信息服务。 相似文献
59.
60.
Pirja Heiskanen 《海军后勤学研究》2001,48(3):210-225
In this paper a constraint proposal method is developed for computing Pareto‐optimal solutions in multiparty negotiations over continuous issues. Constraint proposal methods have been previously studied in a case where the decision set is unconstrained. Here we extend the method to situations with a constrained decision set. In the method the computation of the Pareto‐optimal solutions is decentralized so that the DMs do not have to know each others' value functions. During the procedure they have to indicate their optimal solutions on different sets of linear constraints. When the optimal solutions coincide, the common optimum is a candidate for a Pareto‐optimal point. The constraint proposal method can be used to generate either one Pareto‐optimal solution dominating the status quo solution or several Pareto‐optimal solutions. In latter case a distributive negotiation among the efficient points can be carried out afterwards. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 210–225, 2001 相似文献