全文获取类型
收费全文 | 853篇 |
免费 | 249篇 |
国内免费 | 93篇 |
专业分类
1195篇 |
出版年
2024年 | 5篇 |
2023年 | 14篇 |
2022年 | 18篇 |
2021年 | 15篇 |
2020年 | 31篇 |
2019年 | 15篇 |
2018年 | 14篇 |
2017年 | 53篇 |
2016年 | 68篇 |
2015年 | 36篇 |
2014年 | 56篇 |
2013年 | 58篇 |
2012年 | 73篇 |
2011年 | 78篇 |
2010年 | 42篇 |
2009年 | 84篇 |
2008年 | 73篇 |
2007年 | 56篇 |
2006年 | 62篇 |
2005年 | 55篇 |
2004年 | 58篇 |
2003年 | 34篇 |
2002年 | 39篇 |
2001年 | 24篇 |
2000年 | 13篇 |
1999年 | 16篇 |
1998年 | 24篇 |
1997年 | 19篇 |
1996年 | 7篇 |
1995年 | 16篇 |
1994年 | 9篇 |
1993年 | 6篇 |
1992年 | 8篇 |
1991年 | 7篇 |
1990年 | 7篇 |
1989年 | 2篇 |
排序方式: 共有1195条查询结果,搜索用时 15 毫秒
91.
92.
93.
Information technology (IT) infrastructure relies on a globalized supply chain that is vulnerable to numerous risks from adversarial attacks. It is important to protect IT infrastructure from these dynamic, persistent risks by delaying adversarial exploits. In this paper, we propose max‐min interdiction models for critical infrastructure protection that prioritizes cost‐effective security mitigations to maximally delay adversarial attacks. We consider attacks originating from multiple adversaries, each of which aims to find a “critical path” through the attack surface to complete the corresponding attack as soon as possible. Decision‐makers can deploy mitigations to delay attack exploits, however, mitigation effectiveness is sometimes uncertain. We propose a stochastic model variant to address this uncertainty by incorporating random delay times. The proposed models can be reformulated as a nested max‐max problem using dualization. We propose a Lagrangian heuristic approach that decomposes the max‐max problem into a number of smaller subproblems, and updates upper and lower bounds to the original problem via subgradient optimization. We evaluate the perfect information solution value as an alternative method for updating the upper bound. Computational results demonstrate that the Lagrangian heuristic identifies near‐optimal solutions efficiently, which outperforms a general purpose mixed‐integer programming solver on medium and large instances. 相似文献
94.
We consider a short‐term capacity allocation problem with tool and setup constraints that arises in the context of operational planning in a semiconductor wafer fabrication facility. The problem is that of allocating the available capacity of parallel nonidentical machines to available work‐in‐process (WIP) inventory of operations. Each machine can process a subset of the operations and a tool setup is required on a machine to change processing from one operation to another. Both the number of tools available for an operation and the number of setups that can be performed on a machine during a specified time horizon are limited. We formulate this problem as a degree‐constrained network flow problem on a bipartite graph, show that the problem is NP‐hard, and propose constant factor approximation algorithms. We also develop constructive heuristics and a greedy randomized adaptive search procedure for the problem. Our computational experiments demonstrate that our solution procedures solve the problem efficiently, rendering the use of our algorithms in real environment feasible. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
95.
集合线对对数周期偶极子天线的影响 总被引:2,自引:1,他引:2
主要研究了对数周期偶极子天线.基于Pocklington积分方程和全域基函数,采用矩量法结合网络理论建立了天线算法模型;使用该模型计算了在天线阵和集合线共同作用下天线的辐射方向图,得出了集合线在不同频段上对天线辐射性能的影响,并通过截短延长线长度改善了天线低频段的辐射特性,增强了天线轴向方向性. 相似文献
96.
基于分布式哈希表(DHT)的P2P查找经常受到在底层网络中路由时无必要的路径长度增加的影响.另外,DHT在处理复制方面也有一定的缺陷.文中探讨了解决这些问题的方法.对使用Bloom filters作为资源路由的方法做了简要回顾,并较为详细地阐述了在资源分散的覆盖网络中使用距离加权Bloom filter的网络路由算法.对该算法进行了仿真测试,证明了其有效性. 相似文献
97.
98.
99.
100.
从理论上分析了变换域数字水印嵌入和提取过程,研究了图像处理和攻击对水印产生破坏的机理,并在此基础上提出了一种基于神经网络的变换域数字水印提取算法。实验证明,该算法对各种常见攻击具有较强的鲁棒性。 相似文献