首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   141篇
  免费   55篇
  国内免费   8篇
  2024年   1篇
  2023年   4篇
  2022年   3篇
  2021年   8篇
  2020年   7篇
  2019年   8篇
  2018年   4篇
  2017年   9篇
  2016年   9篇
  2015年   11篇
  2014年   9篇
  2013年   15篇
  2012年   7篇
  2011年   13篇
  2010年   10篇
  2009年   11篇
  2008年   16篇
  2007年   5篇
  2006年   13篇
  2005年   6篇
  2004年   3篇
  2003年   2篇
  2002年   2篇
  2001年   4篇
  2000年   5篇
  1999年   6篇
  1998年   2篇
  1996年   2篇
  1995年   2篇
  1994年   2篇
  1993年   3篇
  1992年   1篇
  1991年   1篇
排序方式: 共有204条查询结果,搜索用时 15 毫秒
131.
Stochastic transportation networks arise in various real world applications, for which the probability of the existence of a feasible flow is regarded as an important performance measure. Although the necessary and sufficient condition for the existence of a feasible flow represented by an exponential number of inequalities is a well‐known result in the literature, the computation of the probability of all such inequalities being satisfied jointly is a daunting challenge. The state‐of‐the‐art approach of Prékopa and Boros, Operat Res 39 (1991) 119–129 approximates this probability by giving its lower and upper bounds using a two‐part procedure. The first part eliminates all redundant inequalities and the second gives the lower and upper bounds of the probability by solving two well‐defined linear programs with the inputs obtained from the first part. Unfortunately, the first part may still leave many non‐redundant inequalities. In this case, it would be very time consuming to compute the inputs for the second part even for small‐sized networks. In this paper, we first present a model that can be used to eliminate all redundant inequalities and give the corresponding computational results for the same numerical examples used in Prékopa and Boros, Operat Res 39 (1991) 119–129. We also show how to improve the lower and upper bounds of the probability using the multitree and hypermultitree, respectively. Furthermore, we propose an exact solution approach based on the state space decomposition to compute the probability. We derive a feasible state from a state space and then decompose the space into several disjoint subspaces iteratively. The probability is equal to the sum of the probabilities in these subspaces. We use the 8‐node and 15‐node network examples in Prékopa and Boros, Operat Res 39 (1991) 119–129 and the Sioux‐Falls network with 24 nodes to show that the space decomposition algorithm can obtain the exact probability of these classical examples efficiently. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 479–491, 2016  相似文献   
132.
Concavity Cuts play an important role in concave minimization. In Porembski, J Global Optim 15 ( 17 ), 371–404 we extended the concept underlying concavity cuts which led to the development of decomposition cuts. In numerical experiments with pure cutting plane algorithms for concave minimization, decomposition cuts have been shown to be superior to concavity cuts. However, three points remained open. First, how to derive decomposition cuts in the degenerate case. Second, how to ensure dominance of decomposition cuts over concavity cuts. Third, how to ensure the finite convergence of a pure cutting plane algorithm solely by decomposition cuts. These points will be addressed in this paper. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008  相似文献   
133.
针对快速传递对准中主子惯导相对姿态存在大角度的情况,推导了捷联惯导大失准角误差模型.该模型采用欧拉角表示姿态误差,并用欧拉运动方程准确描述其传播规律.鉴于该模型中的姿态观测方程是复杂的非线性函数,采用无需求导的UKF算法,并采用奇异值分解(SVD)解决方差阵的病态问题.仿真结果表明,该算法在小角度误差条件下滤波精度优于线性模型,并且适用于大角度误差条件.  相似文献   
134.
利用四元数矩阵的奇异值分解(SVD),对两个四元数长矩阵给出了其同时复对角化的充要条件,进一步对一个四元数长矩阵集合,针对其同时复对角化问题,给出了一系列充分必要条件.  相似文献   
135.
支架式教学法在小学语文课堂教学中的应用对培养学生解决问题能力和自主学习能力具有明显效果。基于最近发展区理论和建构主义学习理论,从支架式教学法在小学语文课堂教学实施的五个环节,即尊重学生原有基础、创设教学情境、启发学生独立思考、鼓励学生协作学习和最终结果评价,阐述了支架式教学法在小学语文课堂教学中的应用。  相似文献   
136.
随着战争复杂性剧增,作战构想的地位和作用日益凸显。美军以逻辑链为作战构想的基本表现形式,以作战设计为作战构想生成的思维工具,强调发挥作战艺术,提升作战构想质量,并构建了"四步一体"的作战构想生成流程。  相似文献   
137.
利用自学习粒子群优化算法的全局寻优能力克服梯度下降法过分依赖初始解,易陷入局部极值的缺点,从而提高梯度下降法的优化性能。以径向基函数神经网络为前向模型,基于自学习粒子群与梯度下降混杂的反演方法用于漏磁缺陷轮廓重构中。实验结果表明,该反演方法重构的缺陷轮廓比较准确,且在漏磁信号存在噪声的情况下,重构结果到与实际轮廓相近,并具有一定的噪声鲁棒性。  相似文献   
138.
为降低异常证据对合成结果的影响,提出了基于投影分解与k最近邻距离的异常证据检测算法。该算法在对证据集中所有证据进行焦元单一元素投影分解的基础上,重新构造证据的基本概率赋值,然后利用证据之间形成的欧式距离,采用k最近邻距离算法对异常证据进行检测。无线传感器网络应用实验分析表明:该算法可有效地对异常证据进行检测。对检测前后的证据利用证据合成规则进行融合对比结果发现,剔除了异常证据的合成结果并具有良好的峰值性和可分辨性,合成结果有利于融合决策。  相似文献   
139.
Up to the present, there is only very little research on how the population perceives terrorism and its threats, even though support from the population is crucial for effective counterterrorism. By eliciting beliefs and subjecting them to content analyses, six factors were found that determine the protection worthiness of a target in the people's view: the potential damage to “people,” “symbolism,” “economy,” “politics,” “nature,” and “image/publicity.” These empirically found factors are in line with factors specified by terrorist target selection models. They differ in the strength of their cognitive representation among participants and, thus, their subjective importance to the people. The first three factors are shared among all participants, whereas the latter ones could only be found in a part of the participant sample. People's judgments of the targets' protection worthiness differ substantially from their judgments of the targets' attractiveness to terrorists, even though the same factors seem to be involved. This study offers an insight into the people's mental model about protection worthiness of targets. Together with classical risk analysis and knowledge about terrorists, these results can form a basis for setting up a holistic scheme for critical infrastructure protection.  相似文献   
140.
为揭示合成双射流冲击平板流场结构特征,通过大涡模拟方法对合成双射流冲击平板流动进行了仿真,采用有限时间Lyapunov指数方法对流场的拉格朗日涡结构进行了识别,并与欧拉框架下的速度矢量和涡量结果进行了对比分析。结果表明,在合成双射流两股射流交替作用下,射流核心区涡系结构较为复杂且涡量丰富,远离核心区存在一对稳定的涡结构,且拉格朗日涡结构与涡量对应较好,为合成双射流冲击冷却的布局设计提供了指导。另外,流场本征正交分解表明,第一阶模态关于激励器出口中心轴线大致对称,其能量占总体能量的35%,前6阶模态的能量占80%;根据前6阶模态所反映的流场特性,合成双射流冲击平板流场具有高度的对称性。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号