全文获取类型
收费全文 | 336篇 |
免费 | 76篇 |
国内免费 | 12篇 |
出版年
2022年 | 2篇 |
2021年 | 6篇 |
2020年 | 7篇 |
2019年 | 5篇 |
2018年 | 5篇 |
2017年 | 8篇 |
2016年 | 18篇 |
2015年 | 21篇 |
2014年 | 12篇 |
2013年 | 71篇 |
2012年 | 17篇 |
2011年 | 16篇 |
2010年 | 21篇 |
2009年 | 25篇 |
2008年 | 26篇 |
2007年 | 26篇 |
2006年 | 21篇 |
2005年 | 20篇 |
2004年 | 14篇 |
2003年 | 16篇 |
2002年 | 17篇 |
2001年 | 12篇 |
2000年 | 8篇 |
1999年 | 14篇 |
1998年 | 1篇 |
1997年 | 2篇 |
1996年 | 1篇 |
1995年 | 2篇 |
1994年 | 1篇 |
1993年 | 3篇 |
1992年 | 1篇 |
1990年 | 2篇 |
1987年 | 1篇 |
1983年 | 1篇 |
1982年 | 1篇 |
排序方式: 共有424条查询结果,搜索用时 15 毫秒
291.
292.
为了深入探索模型塔动力特性,以汉江大跨越塔为原型,按照动力相似理论制作了模型塔.试验采用施加突卸荷载的方法使模型产生自由振动,获取模型动力参数.结果表明,模型前两阶固有频率满足相似要求,模型设计合理.为更好地研究模型塔动力特性,在模型塔动力测试基础上,建立了模型塔有限元模型,对测试结果与模态分析结果进行了比较,提出了模... 相似文献
293.
A. Gmez‐Corral 《海军后勤学研究》2004,51(8):1068-1089
The model considered in this paper involves a tandem queue consisting of a sequence of two waiting lines. The main feature of our model is blocking, i.e., as soon as the second waiting line reaches a certain upper limit, the first line is blocked. The input of units to the tandem queue is the MAP (Markovian arrival process), and service requirements are of phase type. Our objective is to study the sojourn time distribution under the first‐come‐first‐serve discipline by analyzing the sojourn time through times until absorption in appropriately defined quasi‐birth‐and‐death processes and continuous‐time Markov chains. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
294.
Standard approaches to classical inventory control problems treat satisfying a predefined demand level as a constraint. In many practical contexts, however, total demand is comprised of separate demands from different markets or customers. It is not always clear that constraining a producer to satisfy all markets is an optimal approach. Since the inventory‐related cost of an item depends on total demand volume, no clear method exists for determining a market's profitability a priori, based simply on per unit revenue and cost. Moreover, capacity constraints often limit a producer's ability to meet all demands. This paper presents models to address economic ordering decisions when a producer can choose whether to satisfy multiple markets. These models result in a set of nonlinear binary integer programming problems that, in the uncapacitated case, lend themselves to efficient solution due to their special structure. The capacitated versions can be cast as nonlinear knapsack problems, for which we propose a heuristic solution approach that is asymptotically optimal in the number of markets. The models generalize the classical EOQ and EPQ problems and lead to interesting optimization problems with intuitively appealing solution properties and interesting implications for inventory and pricing management. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
295.
This article is concerned with a general multi‐class multi‐server priority queueing system with customer priority upgrades. The queueing system has various applications in inventory control, call centers operations, and health care management. Through a novel design of Lyapunov functions, and using matrix‐analytic methods, sufficient conditions for the queueing system to be stable or instable are obtained. Bounds on the queue length process are obtained by a sample path method, with the help of an auxiliary queueing system. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
296.
Coordinated pricing and inventory control problems with capacity constraints and fixed ordering cost
This article addresses a single‐item, finite‐horizon, periodic‐review coordinated decision model on pricing and inventory control with capacity constraints and fixed ordering cost. Demands in different periods are random and independent of each other, and their distributions depend on the price in the current period. Each period's stochastic demand function is the additive demand model. Pricing and ordering decisions are made at the beginning of each period, and all shortages are backlogged. The objective is to find an optimal policy that maximizes the total expected discounted profit. We show that the profit‐to‐go function is strongly CK‐concave, and the optimal policy has an (s,S,P) ‐like structure. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
297.
针对无人飞行器Ad Hoc网络的容错设计需求,基于UAV节点的可控移动特性,提出了一种基于强化边启发的节点移动控制算法.首先采用文化基因算法对给定通信网络对应的拓扑图进行搜索,求解使图获取顶点2 -连通属性所需新增的最小成本强化边组合.以强化边为启发,将连接的节点移动到彼此通信范围内来实现强化边,同时以这些节点为leader,采用基于一致性算法的leader-follower控制算法移动其他关联节点,使变化后的网络为顶点2-连通,从而实现网络容错.仿真实验结果表明算法的可行性与有效性,节点总的移动距离少于用于对比的块移动算法和紧缩算法. 相似文献
298.
采用分相控制的UDVR主电路结构,利用瞬时波形比较法,基于三角波比较的delta增量逆变技术,建立了UDVR的PSCAD/EMTDC仿真模型,解决了低压配电网线路遭受雷击、绝缘子闪络等引发的单相接地故障在线路重合闸期间引发的电压跌落问题,保证了敏感负荷在此期间的持续供电的电能质量.仿真结果表明:模型建立正确,控制方法可行. 相似文献
299.
300.
因稳定时间受限,传统的倍增公式导出的外推临界公式计算结果大于实测值,偏危险;文中根据新的中子倍增公式导出了外推临界计算的新公式,实例计算表明,该公式比传统的外推临界公式精确且偏安全. 相似文献