全文获取类型
收费全文 | 899篇 |
免费 | 189篇 |
国内免费 | 54篇 |
出版年
2024年 | 2篇 |
2023年 | 8篇 |
2022年 | 5篇 |
2021年 | 17篇 |
2020年 | 23篇 |
2019年 | 19篇 |
2018年 | 18篇 |
2017年 | 53篇 |
2016年 | 62篇 |
2015年 | 26篇 |
2014年 | 62篇 |
2013年 | 69篇 |
2012年 | 74篇 |
2011年 | 87篇 |
2010年 | 56篇 |
2009年 | 80篇 |
2008年 | 55篇 |
2007年 | 52篇 |
2006年 | 64篇 |
2005年 | 52篇 |
2004年 | 44篇 |
2003年 | 23篇 |
2002年 | 28篇 |
2001年 | 31篇 |
2000年 | 27篇 |
1999年 | 26篇 |
1998年 | 16篇 |
1997年 | 14篇 |
1996年 | 3篇 |
1995年 | 10篇 |
1994年 | 7篇 |
1993年 | 6篇 |
1992年 | 7篇 |
1991年 | 6篇 |
1990年 | 8篇 |
1989年 | 1篇 |
1988年 | 1篇 |
排序方式: 共有1142条查询结果,搜索用时 82 毫秒
71.
72.
韦耀阳 《兵团教育学院学报》2014,(6):38-41
目的:研究高师生社会支持与信息焦虑的相关关系,旨在找出能够用社会支持改善信息焦虑状况的办法。方法:采用信息焦虑量表和领悟社会支持量表238名高师生进行测查。结果:1高师生社会支持的整体水平有极其显著性差异(F=6.083,P0.05)。2信息搜索与选择焦虑维度上存在显著的性别差异(T=4.218,P0.05)。在信息搜索和选择焦虑、信息饥渴焦虑上存在显著的年级差异(F=3.231,P0.05)。3湖北师范学院高师生信息焦虑和社会支持各因子间呈显著负相关(R=-0.153,P0.05)。通过回归分析,社会支持对信息焦虑程度具有预测作用(F=4.617,P0.01)。结论:通过增加社会支持来缓解高师生的信息焦虑。 相似文献
73.
针对满足率只有统计定义的问题,从不同角度研究了备件满足率的概率性质,给出了满足率的两种概率模型,揭示了满足率的内涵和实际工程意义。在此基础上,给出了系统备件保障满足率的概率定义,建立了以系统备件满足率为约束、备件总重量最小为目标的随舰备件配置优化模型,研究了优化模型的边际效益算法。实例分析表明:该方法为合理制定舰艇随舰备件保障方案提供了决策依据。 相似文献
74.
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 相似文献
75.
76.
研究了正反向量子斯特林循环的最优性能.在经典极限下,导出了循环的有限时间热力学性能界限和优化准则.得到了斯特林热机、制冷机和热泵特性参数之间的优化关系. 相似文献
77.
为实现对警用装备综合保障效能的定量评估,构建了包括战备完好性、保障资源适量性、保障经济性、保障时效性、保障信息化、保障精确性、保障弹性、保障综合性8个评估指标的综合保障效能评估体系,建立了基于熵权-双基点方法的综合效能评估模型,通过编程计算对某警用装备的5种综合保障方案进行了定量评估,根据效能优属度确立了较为优化的综合保障方案。该模型克服了主观赋权的缺陷,可以为警用装备综合保障方案的优选提供科学依据。 相似文献
78.
为解决当样本数据不断增加时,利用传统方法反复计算样本协方差迹耗时多的缺点,提出了一种快速递推算法。理论分析和仿真试验都表明,算法的时间复杂度比传统的方法降低了一个数量级,从而大大减少了计算时间。 相似文献
79.
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. 相似文献
80.
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 相似文献