全文获取类型
收费全文 | 666篇 |
免费 | 244篇 |
国内免费 | 64篇 |
出版年
2024年 | 3篇 |
2023年 | 8篇 |
2022年 | 13篇 |
2021年 | 10篇 |
2020年 | 23篇 |
2019年 | 17篇 |
2018年 | 18篇 |
2017年 | 63篇 |
2016年 | 63篇 |
2015年 | 43篇 |
2014年 | 47篇 |
2013年 | 47篇 |
2012年 | 60篇 |
2011年 | 47篇 |
2010年 | 38篇 |
2009年 | 53篇 |
2008年 | 36篇 |
2007年 | 57篇 |
2006年 | 52篇 |
2005年 | 43篇 |
2004年 | 44篇 |
2003年 | 24篇 |
2002年 | 22篇 |
2001年 | 22篇 |
2000年 | 22篇 |
1999年 | 18篇 |
1998年 | 16篇 |
1997年 | 18篇 |
1996年 | 6篇 |
1995年 | 6篇 |
1994年 | 5篇 |
1993年 | 9篇 |
1992年 | 10篇 |
1991年 | 8篇 |
1990年 | 1篇 |
1989年 | 2篇 |
排序方式: 共有974条查询结果,搜索用时 15 毫秒
961.
关于圆柱壳在水下爆炸冲击波作用下二次加载现象的数值模拟研究 总被引:8,自引:3,他引:5
运用大型商业有限元程序MSC.DYTRAN数值模拟了水下爆炸冲击波载荷作用下自由环肋圆柱壳的非线性动态响应.采用一般耦合算法(generalcoupling)模拟流体与结构的耦合效应,计算中考虑了材料的应变率强化效应,几何非线性的影响,分析了空穴现象的产生和二次加载对结构响应的影响.仿真结果表明,相同工况和厚度下的无限自由平板和自由环肋圆柱壳,后者的空化时间比前者长,而壳体运动的最大速度后者比前者低. 相似文献
962.
动态项重写计算(DTRC)是项重写系统(TRS)的元计算模型,具有层次化结构和动态重写等特征,可应用于归纳定理的形式自动证明以及项重写系统弱终止性的形式自动证明等方面.文中介绍了一个基于DTRC的形式自动证明平台及其在TRS弱终止性自动证明上的应用. 相似文献
963.
ASP .NET为Web应用系统开发提供了一种全新的灵活的基础结构,是迄今为止最先进的Web应用服务系统开发平台.动态网页是Web应用服务系统的核心.提出了采用ASP .NET技术实现动态网页的方法,在数字化油库与油库信息可视化项目研究中得到很好的应用. 相似文献
964.
基于模糊推理的机动目标自适应多模型跟踪算法 总被引:2,自引:0,他引:2
针对当前空中来袭目标的主要特点,运用模糊理论和多模型理论探索空中机动目标跟踪问题,并设计了一种模糊自适应多模型(FAMM)目标跟踪算法,该算法采用五个基本模型,以加速度估值作为模糊推理系统的输入,经模糊推理融合得到系统状态和方差的估计值以及下一时刻的滤波模型(最多三个).经Monte Carlo仿真研究,与IMM算法相比较,该算法不仅在目标弱机动或不机动条件下,而且在复杂机动时能更稳定、精确地跟踪目标,较好地满足了海上对空防御作战中跟踪机动目标的需求. 相似文献
965.
This article analyzes a capacity/inventory planning problem with a one‐time uncertain demand. There is a long procurement leadtime, but as some partial demand information is revealed, the firm is allowed to cancel some of the original capacity reservation at a certain fee or sell off some inventory at a lower price. The problem can be viewed as a generalization of the classic newsvendor problem and can be found in many applications. One key observation of the analysis is that the dynamic programming formulation of the problem is closely related to a recursion that arises in the study of a far more complex system, a series inventory system with stochastic demand over an infinite horizon. Using this equivalence, we characterize the optimal policy and assess the value of the additional demand information. We also extend the analysis to a richer model of information. Here, demand is driven by an underlying Markov process, representing economic conditions, weather, market competition, and other environmental factors. Interestingly, under this more general model, the connection to the series inventory system is different. © 2012 Wiley Periodicals, Inc. Naval Research Logistics 2012 相似文献
966.
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 相似文献
967.
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 相似文献
968.
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 相似文献
969.
970.