首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   106篇
  免费   29篇
  国内免费   14篇
  2024年   1篇
  2023年   1篇
  2021年   2篇
  2020年   4篇
  2019年   1篇
  2018年   1篇
  2017年   3篇
  2016年   6篇
  2015年   2篇
  2014年   8篇
  2013年   11篇
  2012年   16篇
  2011年   8篇
  2010年   7篇
  2009年   12篇
  2008年   13篇
  2007年   11篇
  2006年   9篇
  2005年   4篇
  2004年   6篇
  2003年   5篇
  2002年   2篇
  2001年   1篇
  2000年   1篇
  1999年   4篇
  1998年   5篇
  1996年   2篇
  1994年   1篇
  1993年   1篇
  1988年   1篇
排序方式: 共有149条查询结果,搜索用时 31 毫秒
81.
边界扫描测试的数学描述模型   总被引:4,自引:0,他引:4       下载免费PDF全文
IEEE1149.1边界扫描机制是一种新型的VLSI电路测试及可测试性设计的有效方法,为了高效地应用边界扫描机制对电路系统进行测试,必须对其所涉及的理论方法进行深入探讨。本文应用布尔矩阵理论建立起边界扫描测试的数学描述模型,并基于所建立的模型导出了边界扫描测试中的故障检测条件和故障隔离条件。为边界扫描测试生成算法的深入研究奠定了理论基础。  相似文献   
82.
线性调频基带数字产生的关键技术研究   总被引:1,自引:0,他引:1       下载免费PDF全文
介绍超宽带线性调频信号基带的数字产生方法及其实现技术。首先对线性调频信号的两种主要数字产生方法进行了简要阐述和比较,然后根据波形存储直读法提出了一种超宽带线性调频信号产生方案,分析了基带数字产生的主要关键技术,并进行了系统实现和测试。测试结果表明本文所提出的方法是可行的。  相似文献   
83.
火控系统作为各种武器装备的中枢和大脑,控制着武器系统的运转,其有效性直接关系着射击的成败甚至武器系统的综合效能。诸元解算程序是将各种输入条件依据弹道模型经过多次迭代转换为射击诸元,由于其复杂性,当前软件测试用例只是在几个关键点上进行校验,很难覆盖程序所有分支和路径,存在着测试不充分。针对这个问题,提出了一种基于符号执行的用例自动生成技术,结合解弹道方程组约束条件和程序分支控制变量使用符号执行框架内能够得到覆盖所有可能的执行路径,从而保证测试的充分性。  相似文献   
84.
We present a stochastic optimization model for planning capacity expansion under capacity deterioration and demand uncertainty. The paper focuses on the electric sector, although the methodology can be used in other applications. The goals of the model are deciding which energy types must be installed, and when. Another goal is providing an initial generation plan for short periods of the planning horizon that might be adequately modified in real time assuming penalties in the operation cost. Uncertainty is modeled under the assumption that the demand is a random vector. The cost of the risk associated with decisions that may need some tuning in the future is included in the objective function. The proposed scheme to solve the nonlinear stochastic optimization model is Generalized Benders' decomposition. We also exploit the Benders' subproblem structure to solve it efficiently. Computational results for moderate‐size problems are presented along with comparison to a general‐purpose nonlinear optimization package. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:662–683, 2001  相似文献   
85.
Most machine scheduling models assume that the machines are available all of the time. However, in most realistic situations, machines need to be maintained and hence may become unavailable during certain periods. In this paper, we study the problem of processing a set of n jobs on m parallel machines where each machine must be maintained once during the planning horizon. Our objective is to schedule jobs and maintenance activities so that the total weighted completion time of jobs is minimized. Two cases are studied in this paper. In the first case, there are sufficient resources so that different machines can be maintained simultaneously if necessary. In the second case, only one machine can be maintained at any given time. In this paper, we first show that, even when all jobs have the same weight, both cases of the problem are NP-hard. We then propose branch and bound algorithms based on the column generation approach for solving both cases of the problem. Our algorithms are capable of optimally solving medium sized problems within a reasonable computational time. We note that the general problem where at most j machines, 1 ≤ jm, can be maintained simultaneously, can be solved similarly by the column generation approach proposed in this paper. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 145–165, 2000  相似文献   
86.
We consider the multitasking scheduling problem on unrelated parallel machines to minimize the total weighted completion time. In this problem, each machine processes a set of jobs, while the processing of a selected job on a machine may be interrupted by other available jobs scheduled on the same machine but unfinished. To solve this problem, we propose an exact branch‐and‐price algorithm, where the master problem at each search node is solved by a novel column generation scheme, called in‐out column generation, to maintain the stability of the dual variables. We use a greedy heuristic to obtain a set of initial columns to start the in‐out column generation, and a hybrid strategy combining a genetic algorithm and an exact dynamic programming algorithm to solve the pricing subproblems approximately and exactly, respectively. Using randomly generated data, we conduct numerical studies to evaluate the performance of the proposed solution approach. We also examine the effects of multitasking on the scheduling outcomes, with which the decision maker can justify making investments to adopt or avoid multitasking.  相似文献   
87.
于力  孙艺笑  徐磊 《国防科技》2018,39(4):114-118
为加快建设现代化武警部队,解决配属装备与日益增长的任务需求之间的矛盾,论文以武警部队指挥体系变更、警种部队调整的现实背景,围绕武警部队遂行任务情况,整理分析出新编各警种对装备的任务需求,为推动武警部队装备体系发展提供理论参考。  相似文献   
88.
对第四代战斗机综合航电系统的构想   总被引:1,自引:0,他引:1  
通过对战斗机综合航电系统的回顾,分析了第四代战斗机及其航电系统的主要特征和关键技术,并对我国新一代综合航电系统的能力、功能等进行了展望.为提高我国航空电子技术的水平,要充分研究国外先进技术,对第四代战斗机综合航电系统进行分析和预先研究.  相似文献   
89.
针对武器装备建设过程中需求不够明确、不够准确和不够科学的现状,从联合作战的角度出发,以“基于能力”的武器装备建设思想为指导,对“任务体系→能力体系→装备体系”的装备体系需求生成过程进行了深入研究,并与传统装备体系需求生成过程进行了比较。  相似文献   
90.
We study the problem of designing a two‐echelon spare parts inventory system consisting of a central plant and a number of service centers each serving a set of customers with stochastic demand. Processing and storage capacities at both levels of facilities are limited. The manufacturing process is modeled as a queuing system at the plant. The goal is to optimize the base‐stock levels at both echelons, the location of service centers, and the allocation of customers to centers simultaneously, subject to service constraints. A mixed integer nonlinear programming model (MINLP) is formulated to minimize the total expected cost of the system. The problem is NP‐hard and a Lagrangian heuristic is proposed. We present computational results and discuss the trade‐off between cost and service. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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