全文获取类型
收费全文 | 714篇 |
免费 | 344篇 |
国内免费 | 52篇 |
出版年
2024年 | 4篇 |
2023年 | 12篇 |
2022年 | 9篇 |
2021年 | 18篇 |
2020年 | 15篇 |
2019年 | 21篇 |
2018年 | 12篇 |
2017年 | 37篇 |
2016年 | 32篇 |
2015年 | 31篇 |
2014年 | 52篇 |
2013年 | 46篇 |
2012年 | 50篇 |
2011年 | 67篇 |
2010年 | 49篇 |
2009年 | 59篇 |
2008年 | 41篇 |
2007年 | 56篇 |
2006年 | 55篇 |
2005年 | 47篇 |
2004年 | 55篇 |
2003年 | 29篇 |
2002年 | 31篇 |
2001年 | 39篇 |
2000年 | 34篇 |
1999年 | 41篇 |
1998年 | 30篇 |
1997年 | 26篇 |
1996年 | 13篇 |
1995年 | 8篇 |
1994年 | 16篇 |
1993年 | 17篇 |
1992年 | 20篇 |
1991年 | 13篇 |
1990年 | 13篇 |
1989年 | 9篇 |
1988年 | 2篇 |
1987年 | 1篇 |
排序方式: 共有1110条查询结果,搜索用时 31 毫秒
71.
Choosing arrival process models for service systems: Tests of a nonhomogeneous Poisson process 下载免费PDF全文
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 相似文献
72.
73.
随着信息技术的发展,系统信息量的提升给军事系统效能评估带来了新的问题。针对系统效能分析数据非线性、高维数、强耦合的特点,提出了一种基于数据站场技术的效能评估决策支持方法。通过数据恢复、约减、求精与重构操作,对评估数据进行了处理,并搭建了数据站场立方体,降低了数据间的依赖性,满足了不同层面系统分析的需求。以面向任务的网络化火控系统的为例,进行了系统效能评估、时效性评估和指标分析,从三个层次验证了方法的有效性与可行性。将数据挖掘技术应用到仿真系统效能评估决策中,获得了更广泛的应用。 相似文献
74.
针对目前大多数多核处理器任务分配优化算法没有考虑关键路径上节点对任务完成时间的重要影响,导致任务完成总时间延迟的问题,提出了基于关键路径和任务复制(CPTD)的单任务调度算法。CPTD算法通过复制任务图中fork节点的方式将任务图转化为与之相对应的产品加工树;再在生成的产品加工树中找到关键路径,并采取使关键路径上节点的紧前节点尽早调度的方式,使关键路径上节点尽早开始执行,进而使产品加工树中节点完成时间得以提前,达到缩短任务执行总时间的目的。理论分析表明,CPTD算法能够实现应用程序在多核上充分并行处理,并能缩短任务完成时间。 相似文献
75.
为提高结核杆菌目标的分割精度,提出了一种区域级的光学显微结核杆菌图像分割算法。通过顶帽—底帽变换增强彩色图像对比度,融合图像局部特征和全局信息计算图像梯度,利用分水岭算法实现对图像的初始分割;对分割区域采用相邻区域最大相似度准则进行合并,从而得到完整的目标区域;根据结核杆菌图像的特点,通过分析结核杆菌目标区域的颜色特性,采用多阈值分割的方法滤除区域中的杂质,实现对结核杆菌目标的分割。实验结果表明,可以分割出目标对比度低以及饱和度过低的结核杆菌目标,并且对不同染色背景的图像均能取得较好的分割结果。 相似文献
76.
研究了正反向量子斯特林循环的最优性能.在经典极限下,导出了循环的有限时间热力学性能界限和优化准则.得到了斯特林热机、制冷机和热泵特性参数之间的优化关系. 相似文献
77.
为解决当样本数据不断增加时,利用传统方法反复计算样本协方差迹耗时多的缺点,提出了一种快速递推算法。理论分析和仿真试验都表明,算法的时间复杂度比传统的方法降低了一个数量级,从而大大减少了计算时间。 相似文献
78.
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. 相似文献
79.
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 相似文献
80.
In this paper we study higher‐order Markov chain models for analyzing categorical data sequences. We propose an efficient estimation method for the model parameters. Data sequences such as DNA and sales demand are used to illustrate the predicting power of our proposed models. In particular, we apply the developed higher‐order Markov chain model to the server logs data. The objective here is to model the users' behavior in accessing information and to predict their behavior in the future. Our tests are based on a realistic web log and our model shows an improvement in prediction. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献