全文获取类型
收费全文 | 360篇 |
免费 | 159篇 |
国内免费 | 23篇 |
出版年
2023年 | 4篇 |
2022年 | 5篇 |
2021年 | 5篇 |
2020年 | 9篇 |
2019年 | 10篇 |
2018年 | 5篇 |
2017年 | 23篇 |
2016年 | 24篇 |
2015年 | 23篇 |
2014年 | 27篇 |
2013年 | 22篇 |
2012年 | 21篇 |
2011年 | 19篇 |
2010年 | 17篇 |
2009年 | 39篇 |
2008年 | 27篇 |
2007年 | 28篇 |
2006年 | 38篇 |
2005年 | 29篇 |
2004年 | 25篇 |
2003年 | 16篇 |
2002年 | 11篇 |
2001年 | 16篇 |
2000年 | 15篇 |
1999年 | 11篇 |
1998年 | 10篇 |
1997年 | 10篇 |
1996年 | 6篇 |
1995年 | 5篇 |
1994年 | 3篇 |
1993年 | 9篇 |
1992年 | 5篇 |
1991年 | 8篇 |
1990年 | 10篇 |
1989年 | 6篇 |
1988年 | 1篇 |
排序方式: 共有542条查询结果,搜索用时 31 毫秒
451.
面向返回编程(return oriented programming, ROP)攻击是网络攻击者突破操作系统安全防护、实现漏洞攻击的一种主要手段,ROP链是ROP攻击的重要组成部分。为检测网络流量中的ROP链,提出了一种能自动提取ROP链特征、具有良好泛化性能的智能检测方法。该方法采用顺序抽取的方式将被测流量分成多个序列,利用滑动窗口和数值量化将输入的一维流量数据转换为二维特征向量,基于卷积神经网络模型实现对ROP链的检测。不同于已有的静态检测方法,该方法不依赖程序内存地址的上下文信息,实现简单、部署方便,且具有优异的检测性能。实验结果表明,模型最高准确率为99.4%,漏报率为0.6%,误报率为0.4%,时间开销在0.1 s以内,对真实ROP攻击流量的漏报率为0.2%。 相似文献
452.
In a multifunction radar, the maximum number of targets that can be managed or tracked is an important performance measure. Interleaving algorithms developed to operate radars exploit the dead‐times between the transmitted and the received pulses to allocate new tracking tasks that might involve transmitting or receiving pulses, thus increasing the capacity of the system. The problem of interleaving N targets involves a search among N! possibilities, and suboptimal solutions are usually employed to satisfy the real‐time constraints of the radar system. In this paper, we present new tight 0–1 integer programming models for the radar pulse interleaving problem and develop effective solution methods based on Lagrangian relaxation techniques. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
453.
王培铎 《中国人民武装警察部队学院学报》2004,20(1):90-93
针对目前程序设计语言发展过程中出现的语言种类过杂、语言数量过多、语言结构过于复杂、语言间重复性大以及语言功能求全问题进行讨论,从语言功能分离、符号与内容分离及语言统一的角度初步提出了解决问题的途径,同时对程序设计语言的汉化问题做了简要讨论。 相似文献
454.
自适应高斯神经网络能够对目标信号的功率谱有效识别特征进行自动提取和分类,但此网络使用BP算法,其误差能量函数是一个不规则的超曲面,容易陷入局部极小值.因此,提出了一种使用进化规则来设计和训练自适应高斯神经网络的新方法.该方法能够自动地确定网络的最优结构和联结权值,同时避免网络的局部优化.实验结果表明,将该方法用于被动声纳目标的分类识别,能够有效地克服局部最小问题,具有更好的识别率. 相似文献
455.
Irina S. Dolinskaya 《海军后勤学研究》2012,59(5):325-339
This article examines optimal path finding problems where cost function and constraints are direction, location, and time dependent. Recent advancements in sensor and data‐processing technology facilitate the collection of detailed real‐time information about the environment surrounding a ground vehicle, an airplane, or a naval vessel. We present a navigation model that makes use of such information. We relax a number of assumptions from existing literature on path‐finding problems and create an accurate, yet tractable, model suitable for implementation for a large class of problems. We present a dynamic programming model which integrates our earlier results for direction‐dependent, time and space homogeneous environment, and consequently, improves its accuracy, efficiency, and run‐time. The proposed path finding model also addresses limited information about the surrounding environment, control‐feasibility of the considered paths, such as sharpest feasible turns a vehicle can make, and computational demands of a time‐dependent environment. To demonstrate the applicability and performance of our path‐finding algorithm, computational experiments for a short‐range ship routing in dynamic wave‐field problem are presented. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
456.
In this article, we study item shuffling (IS) problems arising in the logistics system of steel production. An IS problem here is to optimize shuffling operations needed in retrieving a sequence of steel items from a warehouse served by a crane. There are two types of such problems, plate shuffling problems (PSP) and coil shuffling problems (CSP), considering the item shapes. The PSP is modeled as a container storage location assignment problem. For CSP, a novel linear integer programming model is formulated considering the practical stacking and shuffling features. Several valid inequalities are constructed to accelerate the solving of the models. Some properties of optimal solutions of PSP and CSP are also derived. Because of the strong NP‐hardness of the problems, we consider some special cases of them and propose polynomial time algorithms to obtain optimal solutions for these cases. A greedy heuristic is proposed to solve the general problems and its worst‐case performances on both PSP and CSP are analyzed. A tabu search (TS) method with a tabu list of variable length is proposed to further improve the heuristic solutions. Without considering the crane traveling distance, we then construct a rolling variable horizon heuristic for the problems. Numerical experiments show that the proposed heuristic algorithms and the TS method are effective. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
457.
This article studies the classical single‐item economic lot‐sizing problem with constant capacities, fixed‐plus‐linear order costs, and concave inventory costs, where backlogging is allowed. We propose an O(T3) optimal algorithm for the problem, which improves upon the O(T4) running time of the famous algorithm developed by Florian and Klein (Manage Sci18 (1971) 12–20). Instead of using the standard dynamic programming approach by predetermining the minimal cost for every possible subplan, we develop a backward dynamic programming algorithm to obtain a more efficient implementation. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
458.
Characteristically, a small subset of operational problems admit risk neutrality when contingent claims methodology were used in their analysis. That is, for the majority of manufacturing and production problems, operating cash flows are not directly linked to prices of traded assets. However, to the extent that correlations can be estimated, the methodology's applicability to a broader set of operational problems is supported. Our article addresses this issue with the objective of extending the use of contingent claims techniques to a larger set of operational problems. In broad terms, this objective entails a partial equilibrium approach to the problem of valuing uncertain cash flows. To this end, we assume risk aversion and cast our approach within Merton's intertemporal capital asset pricing model. In this context, we formulate a “generic” production valuation model that is framed as an exercise in stochastic optimal control. The model is versatile in its characterization and can easily be adapted to accommodate a wide‐ranging set of risk‐based operational problems where the underlying sources of uncertainty are not traded. To obtain results, the model is recast as a stochastic dynamic program to be solved numerically. The article addresses a number of fundamental issues in the analysis risk based decision problems in operations. First, in the approach provided, decisions are analyzed under a properly defined risk structure. Second, the process of analysis leads to suitably adjusted probability distributions through which, appropriately discounted expectations are derived. Third, through consolidating existing concepts into a standard and adaptable framework, we extend the applicability of contingent claims methodology to a broader set of operational problems. The approach is advantageous as it obviates the need for exogenously specifying utility functions or discount rates.© 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
459.
460.