全文获取类型
收费全文 | 752篇 |
免费 | 239篇 |
国内免费 | 35篇 |
出版年
2024年 | 3篇 |
2023年 | 6篇 |
2022年 | 3篇 |
2021年 | 13篇 |
2020年 | 15篇 |
2019年 | 23篇 |
2018年 | 13篇 |
2017年 | 35篇 |
2016年 | 44篇 |
2015年 | 30篇 |
2014年 | 49篇 |
2013年 | 97篇 |
2012年 | 47篇 |
2011年 | 73篇 |
2010年 | 47篇 |
2009年 | 57篇 |
2008年 | 41篇 |
2007年 | 69篇 |
2006年 | 52篇 |
2005年 | 44篇 |
2004年 | 49篇 |
2003年 | 25篇 |
2002年 | 31篇 |
2001年 | 32篇 |
2000年 | 32篇 |
1999年 | 24篇 |
1998年 | 19篇 |
1997年 | 10篇 |
1996年 | 3篇 |
1995年 | 5篇 |
1994年 | 8篇 |
1993年 | 9篇 |
1992年 | 7篇 |
1991年 | 4篇 |
1990年 | 4篇 |
1989年 | 2篇 |
1988年 | 1篇 |
排序方式: 共有1026条查询结果,搜索用时 15 毫秒
51.
Adjacency‐based local top‐down search method for finding maximal efficient faces in multiple objective linear programming 下载免费PDF全文
It is well‐known that the efficient set of a multiobjective linear programming (MOLP) problem can be represented as a union of the maximal efficient faces of the feasible region. In this paper, we propose a method for finding all maximal efficient faces for an MOLP. The new method is based on a condition that all efficient vertices (short for the efficient extreme points and rays) for the MOLP have been found and it relies on the adjacency, affine independence and convexity results of efficient sets. The method uses a local top‐down search strategy to determine maximal efficient faces incident to every efficient vertex for finding maximal efficient faces of an MOLP problem. To our knowledge, the proposed method is the first top‐down search method that uses the adjacency property of the efficient set to find all maximal efficient faces. We discuss this and other advantages and disadvantages of the algorithm. We also discuss some computational experience we have had with our computer code for implementing the algorithm. This computational experience involved solving several MOLP problems with the code. 相似文献
52.
分布式飞行视景仿真平台的设计与实现 总被引:1,自引:0,他引:1
基于多机空战战法训练设备的开发,对视景平台的组成、接口、网络结构、运行机制进行了总体设计,构建了一个具有基本仿真功能,并且相对通用的分布式可视化实时视景仿真平台.重点对飞行动力学仿真系统、视景显示系统和接口网络数据驱动进行了研究与实现.为提高平台的通用性和扩展性,采用了仿真控制主机和目标仿真机运行模式.仿真建模(Simulink)、三维建模(creator)和视景驱动(vega+vc)均采用商业软件,降低了平台的开发难度,缩短了开发周期,并且获得了高质量效果. 相似文献
53.
在模拟试验平台上进行了铝导线短路熔珠引燃棉布、聚氨酯泡沫塑料和纸张的试验,得到了不同材料的临界加栽电压值和引燃规律。初步分析了加栽电压与短路熔珠粒径及引燃能力的关系。结果表明,随着短路电压增大,导线熔珠的粒径逐渐增大,熔珠对固体材料的引燃能力逐渐增强,氧指数越低、表面粗糙、易蓄热的材料越容易被点燃。棉布、聚氨酯泡沫塑料和纸屑被引燃的短路临界电压分别为50V、35V和45V。 相似文献
54.
对热辐射传热定律q∝Δ(T4)下,给定初态内能、体积,末态体积以及过程时间时,加热气体膨胀的最优构型进行了研究,利用最优控制理论得出最大膨胀功输出时膨胀的最优构型由两个瞬时绝热分支和一个E-L分支组成的结论.给出了各分支之间转换点参数的求解方法及最优构型的数值算例,最后将线性唯象传热定律、牛顿传热定律、平方传热定律、立方传热定律和辐射传热定律下加热气体膨胀的最优构型进行了比较.结果显示,随着传热指数的增加,理想气体的内能呈现出明显的整体增加趋势,而体积则呈现出明显的整体减小趋势. 相似文献
55.
研究一类具有时滞和阶段结构的SI传染病模型。讨论了系统平衡点的存在性和局部稳定性,并讨论了无病平衡点和地方病平衡点的全局稳定性。最后对所得理论结果进行了数值模拟。 相似文献
56.
时问是分布仿真中的核心概念;时间管理是分布交互仿真的关键技术.探讨了分布交互仿真中高层体系结构(HLA)的时间管理机制,针对HLA在实时系统仿真方面的不足,分析其原因,提出了时间管理在实时仿真中的改进方法,对HLA在实时系统仿真中的应用有一定的参考价值. 相似文献
57.
We consider a general linear filtering operation on an autoregressive moving average (ARMA) time series. The variance of the filter output, which is an important quantity in many applications, is not known with certainty because it depends on the true ARMA parameters. We derive an expression for the sensitivity (i.e., the partial derivative) of the output variance with respect to deviations in the model parameters. The results provide insight into the robustness of many common statistical methods that are based on linear filtering and also yield approximate confidence intervals for the output variance. We discuss applications to time series forecasting, statistical process control, and automatic feedback control of industrial processes. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
58.
We study the assignment of flexible servers to stations in tandem lines with service times that are not necessarily exponentially distributed. Our goal is to achieve optimal or near‐optimal throughput. For systems with infinite buffers, it is already known that the effective assignment of flexible servers is robust to the service time distributions. We provide analytical results for small systems and numerical results for larger systems that support the same conclusion for tandem lines with finite buffers. In the process, we propose server assignment heuristics that perform well for systems with different service time distributions. Our research suggests that policies known to be optimal or near‐optimal for Markovian systems are also likely to be effective when used to assign servers to tasks in non‐Markovian systems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
59.
The nucleolus solution for cooperative games in characteristic function form is usually computed numerically by solving a sequence of linear programing (LP) problems, or by solving a single, but very large‐scale, LP problem. This article proposes an algebraic method to compute the nucleolus solution analytically (i.e., in closed‐form) for a three‐player cooperative game in characteristic function form. We first consider cooperative games with empty core and derive a formula to compute the nucleolus solution. Next, we examine cooperative games with nonempty core and calculate the nucleolus solution analytically for five possible cases arising from the relationship among the value functions of different coalitions. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
60.
We consider supply chain coordination in which a manufacturer supplies some product to multiple heterogeneous retailers and wishes to coordinate the supply chain via wholesale price and holding cost subsidy. The retail price is either exogenous or endogenous. The market demand is described by the market share attraction model based on all retailers'shelf‐spaces and retail prices. We obtain optimal solutions for the centralized supply chain, where the optimal retail pricing is a modified version of the well‐known cost plus pricing strategy. We further get feasible contracts for the manufacturer to coordinate the hybrid and decentralized supply chains. The manufacturer can allocate the total profit free to himself and the retail market via the wholesale price when the retail price is exogenous, but otherwise he cannot. Finally, we point out that different characteristics of the retail market are due to different powers of the manufacturer, and the more power the manufacturer has, the simpler the contract to coordinate the chain will be. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献