全文获取类型
收费全文 | 832篇 |
免费 | 194篇 |
国内免费 | 109篇 |
出版年
2024年 | 2篇 |
2023年 | 3篇 |
2022年 | 10篇 |
2021年 | 6篇 |
2020年 | 16篇 |
2019年 | 13篇 |
2018年 | 2篇 |
2017年 | 42篇 |
2016年 | 51篇 |
2015年 | 41篇 |
2014年 | 45篇 |
2013年 | 47篇 |
2012年 | 75篇 |
2011年 | 67篇 |
2010年 | 49篇 |
2009年 | 97篇 |
2008年 | 62篇 |
2007年 | 71篇 |
2006年 | 83篇 |
2005年 | 65篇 |
2004年 | 57篇 |
2003年 | 42篇 |
2002年 | 27篇 |
2001年 | 23篇 |
2000年 | 19篇 |
1999年 | 12篇 |
1998年 | 18篇 |
1997年 | 16篇 |
1996年 | 12篇 |
1995年 | 9篇 |
1994年 | 7篇 |
1993年 | 9篇 |
1992年 | 7篇 |
1991年 | 12篇 |
1990年 | 14篇 |
1989年 | 2篇 |
1988年 | 2篇 |
排序方式: 共有1135条查询结果,搜索用时 0 毫秒
81.
对模糊入侵事件进行了描述,分析了模糊入侵事件间的相似性,提出了基于模糊ECA规则的入侵检测知识表示方法,并阐述了模糊ECA规则的分析过程,以解决入侵行为的不确定性。 相似文献
82.
针对一类状态变量具有时滞的非线性系统,研究了其模糊控制器的设计问题。采用线性矩阵不等式(LMI)的方法,设计了与状态变量导数有关的模糊控制器,得到了系统存在模糊控制器的充分条件,并利用线性矩阵不等式的解给出具体的形式,最后通过仿真说明了控制器的有效性。 相似文献
83.
从齿面接触分析的角度,分析了设计参数中心距、模数和蜗轮齿宽对一包TI蜗杆传动啮合性能的影响。结果表明:相对于理想啮合情况,在蜗轮分度圆直径一定的情况下,较大的中心距及较小的模数可以获得较理想的接触线的形状及分布;蜗轮齿宽的变化对接触线和啮合界限线的分布规律没有影响,但会影响接触线的长度。这些结论为合理选择设计参数提供了理论指导。 相似文献
84.
85.
86.
87.
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 相似文献
88.
We study a stochastic scenario‐based facility location problem arising in situations when facilities must first be located, then activated in a particular scenario before they can be used to satisfy scenario demands. Unlike typical facility location problems, fixed charges arise in the initial location of the facilities, and then in the activation of located facilities. The first‐stage variables in our problem are the traditional binary facility‐location variables, whereas the second‐stage variables involve a mix of binary facility‐activation variables and continuous flow variables. Benders decomposition is not applicable for these problems due to the presence of the second‐stage integer activation variables. Instead, we derive cutting planes tailored to the problem under investigation from recourse solution data. These cutting planes are derived by solving a series of specialized shortest path problems based on a modified residual graph from the recourse solution, and are tighter than the general cuts established by Laporte and Louveaux for two‐stage binary programming problems. We demonstrate the computational efficacy of our approach on a variety of randomly generated test problems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
89.
We consider a finite horizon periodic review, single product inventory system with a fixed setup cost and two stochastic demand classes that differ in their backordering costs. In each period, one must decide whether and how much to order, and how much demand of the lower class should be satisfied. We show that the optimal ordering policy can be characterized as a state dependent (s,S) policy, and the rationing structure is partially obtained based on the subconvexity of the cost function. We then propose a simple heuristic rationing policy, which is easy to implement and close to optimal for intensive numerical examples. We further study the case when the first demand class is deterministic and must be satisfied immediately. We show the optimality of the state dependent (s,S) ordering policy, and obtain additional rationing structural properties. Based on these properties, the optimal ordering and rationing policy for any state can be generated by finding the optimal policy of only a finite set of states, and for each state in this set, the optimal policy is obtained simply by choosing a policy from at most two alternatives. An efficient algorithm is then proposed. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
90.
基于模糊-组合神经网络的信息系统安全风险评估 总被引:1,自引:0,他引:1
针对信息系统的安全风险评估问题,提出了一种将模糊理论与神经网络进行"浅层次"结合的评估方法。通过对信息系统所涉及的风险因素分别从资产影响、威胁频度、脆弱性严重程度三方面进行分析,建立了信息系统的安全风险层次化结构,并构造了各因素所对应评判集的隶属度矩阵;综合运用模糊推理算法与神经网络仿真技术,对信息系统的安全风险进行评估,进而判定信息系统安全风险等级。最后,通过实例分析说明了算法的应用,并借助误差分析检测了模型的有效性。 相似文献