全文获取类型
收费全文 | 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条查询结果,搜索用时 926 毫秒
81.
介绍超宽带线性调频信号基带的数字产生方法及其实现技术。首先对线性调频信号的两种主要数字产生方法进行了简要阐述和比较,然后根据波形存储直读法提出了一种超宽带线性调频信号产生方案,分析了基带数字产生的主要关键技术,并进行了系统实现和测试。测试结果表明本文所提出的方法是可行的。 相似文献
82.
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 ≤ j ≤ m, 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.
87.
针对武器装备建设过程中需求不够明确、不够准确和不够科学的现状,从联合作战的角度出发,以“基于能力”的武器装备建设思想为指导,对“任务体系→能力体系→装备体系”的装备体系需求生成过程进行了深入研究,并与传统装备体系需求生成过程进行了比较。 相似文献
88.
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 相似文献
89.
基于QFD的陆军电子对抗装备作战需求应用 总被引:1,自引:0,他引:1
以陆军电子对抗装备为研究对象,指出了该类型装备作战需求确定过程中所存在的难点问题,阐述了工业设计中运用较为成熟的质量功能展开基本原理及方法,并将其引用到装备作战需求论证过程之中,在一定程度上改善了当前需求论证方法不足,提高了作战用户在需求论证中的主动地位,实现了用户提出的作战需求向装备特征的转化目的. 相似文献
90.