首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   84篇
  免费   31篇
  国内免费   10篇
  2024年   1篇
  2023年   1篇
  2022年   1篇
  2021年   2篇
  2020年   1篇
  2019年   3篇
  2018年   2篇
  2017年   4篇
  2016年   5篇
  2015年   2篇
  2014年   10篇
  2013年   7篇
  2012年   9篇
  2011年   8篇
  2010年   8篇
  2009年   5篇
  2008年   10篇
  2007年   5篇
  2006年   7篇
  2005年   4篇
  2004年   6篇
  2003年   4篇
  2002年   2篇
  2001年   1篇
  2000年   1篇
  1999年   4篇
  1998年   4篇
  1996年   3篇
  1995年   1篇
  1994年   1篇
  1993年   1篇
  1990年   1篇
  1988年   1篇
排序方式: 共有125条查询结果,搜索用时 34 毫秒
21.
新一代人工智能技术已经成为当前研究的重点和热点,并逐渐成为提升国防力量、军事能力和国家竞争力的有效途径。本文在总结人工智能概念的基础上,给出了新一代人工智能的定义和发展的重要意义,从掌握未来战争主动权、支撑军工装备研制生产模式转型和保障国防科技先进性三个方面梳理了国防科技领域发展新一代人工智能的必要性,并从基础技术支撑和国防特色应用两个方向提出了国防科技领域发展新一代人工智能涉及的基础软硬件、标准规范、智能装备/系统、辅助作战指挥、智能研发等重点内容,在此基础上给出了相关的发展建议。以上研究可为新一代人工智能技术在国防科技领域的研究、应用和发展提供参考。  相似文献   
22.
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.  相似文献   
23.
针对基于威胁和基于能力的作战能力需求研究存在的不足,在描述作战能力需求要素的基础上,提出了基于效果驱动和探索性分析的作战能力需求生成方法:通过作战目标及效果、作战行动及效果双重驱动,依次探索生成逻辑作战任务、作战能力、物理作战任务、任务条件和任务标准,将多元不确定威胁转化生成作战能力需求。此方法能有效综合作战指挥人员和军事需求人员的观点,其分析结果在实际应用中具有良好的适应性和健壮性。  相似文献   
24.
Environmentally friendly energy resources open a new opportunity to tackle the problem of energy security and climate change arising from wide use of fossil fuels. This paper focuses on optimizing the allocation of the energy generated by the renewable energy system to minimize the total electricity cost for sustainable manufacturing systems under time‐of‐use tariff by clipping the peak demand. A rolling horizon approach is adopted to handle the uncertainty caused by the weather change. A nonlinear mathematical programming model is established for each decision epoch based on the predicted energy generation and the probability distribution of power demand in the manufacturing plant. The objective function of the model is shown to be convex, Lipchitz‐continuous, and subdifferentiable. A generalized benders decomposition method based on the primal‐dual subgradient descent algorithm is proposed to solve the model. A series of numerical experiments is conducted to show the effectiveness of the solution approach and the significant benefits of using the renewable energy resources.  相似文献   
25.
灭雷具在动力上受海流和电缆的非线性耦合作用力影响,其水下操控十分复杂。针对灭雷具CGF(Computer Generation Force)系统行为建模的需求,建立了简化的四自由度动力学模型,同时考虑了海流和电缆扰动的影响并对缆长和动力分配进行优化计算以实现最优缆长控制和最短路径规划;综合分析了灭雷具水下操控规则,从动力控制和路径规划两个层次来建立其行为规则库,得到了与实际相符的灭雷具智能体仿人操控轨迹。仿真结果表明了该行为模型的正确性和有效性,能较好的满足仿真系统的需求。  相似文献   
26.
In many practical manufacturing environments, jobs to be processed can be divided into different families such that a setup is required whenever there is a switch from processing a job of one family to another job of a different family. The time for setup could be sequence independent or sequence dependent. We consider two particular scheduling problems relevant to such situations. In both problems, we are given a set of jobs to be processed on a set of identical parallel machines. The objective of the first problem is to minimize total weighted completion time of jobs, and that of the second problem is to minimize weighted number of tardy jobs. We propose column generation based branch and bound exact solution algorithms for the problems. Computational experiments show that the algorithms are capable of solving both problems of medium size to optimality within reasonable computational time. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 823–840, 2003.  相似文献   
27.
内燃机台架试验测定功率的方法对维修和使用人员所关心的现场测试十分不便,通过分析内燃机在无负荷自由加速过程中的瞬时角加速度值,提出了内燃机功率的现场测试原理,并给出以8031单片机为核心的实现方案。  相似文献   
28.
本文比较了实时仿真计算机系统中配备A/D、D/A变换器的两种方案。分析了几种检索算法,并且提出了一种新的全并行检索方法——映象检索。文中论述了仿真计算任务的特点及其并行性的开发。本文在分析了AD-10的缺点之后指出,纯异构型仿真专用多处理机的局限性较大,不能充分开发仿真计算任务的并行性。较好的结构形式应是以同构型多处理机为核心。  相似文献   
29.
This paper presents a new methodology to solve the cyclic preference scheduling problem for hourly workers. The focus is on nurse rostering but is applicable to any organization in which the midterm scheduling decision must take into account a complex of legal, institutional, and preferential constraints. The objective is to strike a balance between satisfying individual preferences and minimizing personnel costs. The common practice is to consider each planning period independently and to generate new rosters at the beginning of each. To reduce some of the instability in the process, there is a growing trend toward cyclic schedules, which are easier to manage and are generally perceived to be more equitable. To address this problem, a new integer programming model is presented that combines the elements of both cyclic and preference scheduling. To find solutions, a branch‐and‐price algorithm is developed that makes use of several branching rules and an extremely effective rounding heuristic. A unique feature of the formulation is that the master problem contains integer rather than binary variables. Computational results are reported for problem instances with up to 200 nurses. Most were solved within 10 minutes and many within 3 minutes when a double aggregation approach was applicable. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007.  相似文献   
30.
特大规模组合电路高速测试生成系统ATGTA-1   总被引:2,自引:0,他引:2       下载免费PDF全文
针对特大规模组合电路和全扫描设计电路提出了一种高速测试生成方法,并建成了相应的测试生成系统ATGTA-1。该系统采用有限回溯测试模式产生方法生成测试码,采用n(机器字长)个测试码并行的单故障传播方法模拟验证测试覆盖。测试生成与故障模拟为n对1紧耦合集成方式。该系统运行10个Benchmark电路,取得了低测试长度、高故障覆盖、高效率的良好效果。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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