全文获取类型
收费全文 | 1772篇 |
免费 | 68篇 |
国内免费 | 85篇 |
出版年
2023年 | 1篇 |
2022年 | 5篇 |
2021年 | 11篇 |
2020年 | 15篇 |
2019年 | 5篇 |
2018年 | 8篇 |
2017年 | 36篇 |
2016年 | 34篇 |
2015年 | 25篇 |
2014年 | 155篇 |
2013年 | 66篇 |
2012年 | 79篇 |
2011年 | 199篇 |
2010年 | 162篇 |
2009年 | 169篇 |
2008年 | 177篇 |
2007年 | 163篇 |
2006年 | 79篇 |
2005年 | 93篇 |
2004年 | 74篇 |
2003年 | 73篇 |
2002年 | 51篇 |
2001年 | 50篇 |
2000年 | 36篇 |
1999年 | 29篇 |
1998年 | 20篇 |
1997年 | 13篇 |
1996年 | 14篇 |
1995年 | 14篇 |
1994年 | 16篇 |
1993年 | 18篇 |
1992年 | 14篇 |
1991年 | 9篇 |
1990年 | 9篇 |
1989年 | 3篇 |
排序方式: 共有1925条查询结果,搜索用时 78 毫秒
71.
基于SNMP的局域网用户地址管理 总被引:2,自引:0,他引:2
对当前局域网管理中普遍存在的用户地址管理问题进行了分析 ,重点对利用SNMP协议实现地址管理进行了深入的研究 ,设计出用户地址管理的体系结构 ,给出了完整的基于LINUX系统的局域网用户地址管理解决方案 ,较好地解决了用户地址盗用、用户信息跟踪等网络用户管理问题 相似文献
72.
计算机网络日益复杂和异构化,迫切需要提高可靠、跨平台的网络管理系统保证网络稳定、高效运行。分析了传统网络管理系统的不足,提出了一层次分布式网络管理系统故障管理算法,并讨论了算法的性能。最后采用CORBA,Web和Java技术实现了该算法。 相似文献
73.
在并行离散事件仿真系统中实现仿真模型间的互操作机制需要引入类似HLA中定义的声明管理(DM)和数据分发管理(DDM)服务.我们开发的KD-PADSE高性能并行离散事件仿真环境采用谓词断言和对象代理方法在面向对象的并行离散事件仿真系统中实现了基于平行结构和事件调度机制的声明管理(DM)和数据分发管理(DDM)服务.在以千兆以太网互联的10节点Linux集群计算机上,采用DDM机制后仿真模型每秒(物理时间)可以进行1万次属性更新,是没有采用DDM机制时的20倍,在功能性和性能上验证了该DDM机制在并行离散事件仿真系统中的适用性. 相似文献
74.
In this article, we consider a classic dynamic inventory control problem of a self‐financing retailer who periodically replenishes its stock from a supplier and sells it to the market. The replenishment decisions of the retailer are constrained by cash flow, which is updated periodically following purchasing and sales in each period. Excess demand in each period is lost when insufficient inventory is in stock. The retailer's objective is to maximize its expected terminal wealth at the end of the planning horizon. We characterize the optimal inventory control policy and present a simple algorithm for computing the optimal policies for each period. Conditions are identified under which the optimal control policies are identical across periods. We also present comparative statics results on the optimal control policy. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2008 相似文献
75.
An attacker‐defender model for analyzing the vulnerability of initial attack in wildfire suppression
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Wildfire managers use initial attack (IA) to control wildfires before they grow large and become difficult to suppress. Although the majority of wildfire incidents are contained by IA, the small percentage of fires that escape IA causes most of the damage. Therefore, planning a successful IA is very important. In this article, we study the vulnerability of IA in wildfire suppression using an attacker‐defender Stackelberg model. The attacker's objective is to coordinate the simultaneous ignition of fires at various points in a landscape to maximize the number of fires that cannot be contained by IA. The defender's objective is to optimally dispatch suppression resources from multiple fire stations located across the landscape to minimize the number of wildfires not contained by IA. We use a decomposition algorithm to solve the model and apply the model on a test case landscape. We also investigate the impact of delay in the response, the fire growth rate, the amount of suppression resources, and the locations of fire stations on the success of IA. 相似文献
76.
77.
Magnetic resonance imaging and other multifunctional diagnostic facilities, which are considered as scarce resources of hospitals, typically provide services to patients with different medical needs. This article examines the admission policies during the appointment management of such facilities. We consider two categories of patients: regular patients who are scheduled in advance through an appointment system and emergency patients with randomly generated demands during the workday that must be served as soon as possible. According to the actual medical needs of patients, regular patients are segmented into multiple classes with different cancelation rates, no‐show probabilities, unit value contributions, and average service times. Management makes admission decisions on whether or not to accept a service request from a regular patient during the booking horizon to improve the overall value that could be generated during the workday. The decisions should be made by considering the cancelation and no‐show behavior of booked patients as well as the emergency patients that would have to be served because any overtime service would lead to higher costs. We studied the optimal admission decision using a continuous‐time discrete‐state dynamic programming model. Identifying an optimal policy for this discrete model is analytically intractable and numerically inefficient because the state is multidimensional and infinite. We propose to study a deterministic counterpart of the problem (i.e., the fluid control problem) and to develop a time‐based fluid policy that is shown to be asymptotically optimal for large‐scale problems. Furthermore, we propose to adopt a mixed fluid policy that is developed based on the information obtained from the fluid control problem. Numerical experiments demonstrate that this improved policy works effectively for small‐scale problems. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 287–304, 2016 相似文献
78.
79.
基于通用多核架构的网络分组处理系统性能受到诸如分组IO开销高、多核共享内存及进程调度竞争大、页表缓冲表项失效率高等问题的困扰。为此提出一种基于通用多核网络分组处理系统、面向高速分组转发应用的线程亲和缓冲区硬件管理机制,并在网络专用协处理引擎上实现。该机制采用无中断的线程亲和调度策略,将包含控制信息与缓冲区地址信息的描述符和分组数据按照分组处理的线程号链式地对应加载在多个地址连续的共享缓冲区中。基于通用多核和现场可编程门阵列平台进行报文转发测试,实验结果表明,采用线程亲和缓冲区管理机制能使平均报文转发处理性能提升12.4%,有效地降低IO开销和TLB表项失效率。 相似文献
80.