全文获取类型
收费全文 | 592篇 |
免费 | 103篇 |
国内免费 | 25篇 |
出版年
2023年 | 5篇 |
2022年 | 8篇 |
2021年 | 10篇 |
2020年 | 17篇 |
2019年 | 6篇 |
2018年 | 9篇 |
2017年 | 32篇 |
2016年 | 26篇 |
2015年 | 16篇 |
2014年 | 55篇 |
2013年 | 39篇 |
2012年 | 44篇 |
2011年 | 51篇 |
2010年 | 41篇 |
2009年 | 41篇 |
2008年 | 49篇 |
2007年 | 43篇 |
2006年 | 34篇 |
2005年 | 42篇 |
2004年 | 24篇 |
2003年 | 31篇 |
2002年 | 19篇 |
2001年 | 23篇 |
2000年 | 12篇 |
1999年 | 12篇 |
1998年 | 6篇 |
1997年 | 3篇 |
1996年 | 2篇 |
1995年 | 4篇 |
1994年 | 2篇 |
1993年 | 2篇 |
1992年 | 2篇 |
1991年 | 2篇 |
1990年 | 6篇 |
1989年 | 2篇 |
排序方式: 共有720条查询结果,搜索用时 15 毫秒
471.
基于系统管理理论分析武警部队执勤处突力量组织,将优化内容、优化措施与优化过程紧密联系起来,构建武警部队执勤处突力量组织优化的三维模型。 相似文献
472.
梁钦 《兵团教育学院学报》2014,24(5):50-53
"易班"作为网上班级的信息交互平台,从成立至今在班级管理中发挥了重要作用。本文在分析网络环境对高校"班级管理"影响的基础上,研究现行易班在班级管理中的优势及不足之处,并提出了加强易班班级管理的几点建议。探究易班在高校"班级管理"中的运用,丰富对于以网络班级为单位的学生管理工作的认识,以期进一步完善高校网络班级管理和发展的模式。 相似文献
473.
Capability-based planning (CBP) is considered by many defence organisations to be the best practice for enterprise-level planning, analysis and management. This approach, loosely based around investment portfolio theory, is premised on balancing the cost, benefit and risk of capability options across the defence enterprise. However a number of authors have recently noted limitations of its current applications. The authors propose a more general, insurance-based approach, which can support the evolutionary improvement of the current CBP approach. This approach is implemented as hedging-based planning and aims to better reflect the enterprise nature of defence organisations, capturing both force structure and force generation aspects of military systems. 相似文献
474.
软件密集型装备质量是决定战场胜负的关键要素之一,文章分析了软件密集型装备项目质量管理的基本概念和依据标准、探讨了加强软件密集型装备项目质量管理的主要措施,包括采用过程方法建立质量管理体系、建立全面的质量管理文件和记录、实施重点质量控制方法三方面。 相似文献
475.
营房土地三维可视化管理是实现营房土地信息化的重要手段,而营房土地三维模型的建立是实现三维可视化管理的前提.为提高营房土地管理水平和管理效率,提出了基于二维GIS数据和三维模型库的营房土地三维模型构建方法,解决了大范围、多区域数据采集和建模工作量大的难题,实现了数据的廉价采集和三维模型的快速构建,是实现营房土地三维可视化管理的有效途径. 相似文献
476.
A well‐studied problem in airline revenue management is the optimal allocation of seat inventory among different fare‐classes, given a capacity for the flight and a demand distribution for each class. In practice, capacity on a flight does not have to be fixed; airlines can exercise some flexibility on the supply side by swapping aircraft of different capacities between flights as partial booking information is gathered. This provides the airline with the capability to more effectively match their supply and demand. In this paper, we study the seat inventory control problem considering the aircraft swapping option. For theoretical and practical purposes, we restrict our attention to the class of booking limit policies. Our analytical results demonstrate that booking limits considering the swapping option can be considerably different from those under fixed capacity. We also show that principles on the relationship between the optimal booking limits and demand characteristics (size and risk) developed for the fixed‐capacity problem no longer hold when swapping is an option. We develop new principles and insights on how demand characteristics affect the optimal booking limits under the swapping possibility. We also develop an easy to implement heuristic for determining the booking limits under the swapping option and show, through a numerical study, that the heuristic generates revenues close to those under the optimal booking limits. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
477.
In this article, we develop a stochastic approximation algorithm to find good bid price policies for the joint capacity allocation and overbooking problem over an airline network. Our approach is based on visualizing the total expected profit as a function of the bid prices and searching for a good set of bid prices by using the stochastic gradients of the total expected profit function. We show that the total expected profit function that we use is differentiable with respect to the bid prices and derive a simple expression that can be used to compute its stochastic gradients. We show that the iterates of our stochastic approximation algorithm converge to a stationary point of the total expected profit function with probability 1. Our computational experiments indicate that the bid prices computed by our approach perform significantly better than those computed by standard benchmark strategies and the performance of our approach is relatively insensitive to the frequency with which we recompute the bid prices over the planning horizon. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
478.
479.
480.
HLA仿真中,数据分发管理实现基于值的过滤,可以有效减少盟员接收冗余数据的可能性和网络中的数据流量。大规模HLA仿真系统在仿真推进中需要大量的区域匹配计算以维护数据分发管理的正确性。现有的区域匹配算法大多需要对所有区域进行匹配计算,造成了大量计算资源的浪费;同时,主要基于串行匹配思想,难以充分发挥多核平台的并行计算优势。针对现有区域匹配算法的局限性,提出了一种面向大规模HLA仿真的并行区域匹配算法,该算法能够实现对一次仿真推进中多个改变区域的并行匹配计算,同时在匹配计算中采用基于移动相交的基本思想,利用区域范围移动前后的历史信息,将匹配限定在移动区间之内,减少了大量的无关计算。理论分析与实验结果表明该算法尤其适合基于多核计算平台构建大规模分布式仿真的应用需求。 相似文献