全文获取类型
收费全文 | 817篇 |
免费 | 262篇 |
国内免费 | 141篇 |
出版年
2024年 | 7篇 |
2023年 | 6篇 |
2022年 | 9篇 |
2021年 | 19篇 |
2020年 | 16篇 |
2019年 | 9篇 |
2018年 | 10篇 |
2017年 | 41篇 |
2016年 | 51篇 |
2015年 | 28篇 |
2014年 | 76篇 |
2013年 | 44篇 |
2012年 | 75篇 |
2011年 | 76篇 |
2010年 | 55篇 |
2009年 | 65篇 |
2008年 | 73篇 |
2007年 | 58篇 |
2006年 | 70篇 |
2005年 | 72篇 |
2004年 | 59篇 |
2003年 | 38篇 |
2002年 | 36篇 |
2001年 | 36篇 |
2000年 | 31篇 |
1999年 | 24篇 |
1998年 | 24篇 |
1997年 | 19篇 |
1996年 | 17篇 |
1995年 | 10篇 |
1994年 | 14篇 |
1993年 | 12篇 |
1992年 | 16篇 |
1991年 | 7篇 |
1990年 | 9篇 |
1989年 | 6篇 |
1988年 | 1篇 |
1987年 | 1篇 |
排序方式: 共有1220条查询结果,搜索用时 15 毫秒
311.
根据系统的拓扑结构、离散步长和旋转矩阵的旋转角,确定系统的渐近行为,给出多智能体系统达成二阶一致性的充要条件。证明了当0是拉普拉斯矩阵的一个简单特征值且离散步长、旋转角小于由代数方程确定的临界值时,会出现渐近一致性。数值模拟结果证明理论结果的正确性。设计了特征参数影响二阶一致性的相关案例,说明特征参数相关结论可为控制理论的一致收敛分析提供重要判据和理论支撑。 相似文献
312.
针对高动态环境下飞行器组合导航系统因不确定故障导致导航精度下降的问题,提出了一种基于矢量信息分配的容错联邦滤波算法。设计矢量形式的故障检测函数,对各观测量进行单独的故障程度划分,克服了将故障子系统所有观测量同时隔离的缺陷;根据观测量是否异常,重构时变量测噪声矩阵和信息分配矢量系数,对子滤波器的状态变量进行信息分配,在隔离故障子系统异常观测量的同时,最大限度地利用正确观测信息。仿真结果表明,采用该算法能够充分发挥各导航子系统的优势,极大提高了导航子系统信息利用率,具有较高的精确性和容错性。 相似文献
313.
信息与通信技术是影响国家政治、经济和军事等重要领域的高精尖技术。本文认为,美国政府通过启动"301调查"和建立出口管制实体清单等多种方式对中国信息与通信领域实施技术封锁和产品禁运,将延缓中国信息与通信技术的发展进度,加大全球信息与通信技术产业发展的成本消耗,但同时也刺激并加快了中国信息与通信技术自主可控的转型步伐。据此,本文提出加强顶层设计和统筹谋划、营造自主可控的产业生态环境、加强专业化人才队伍培养、构建合作共赢的命运共同体,努力突破信息与通信技术封锁等几项措施,以期为我国信息与通信技术领域的发展提供一定的借鉴意义。 相似文献
314.
《防务技术》2020,16(2):392-400
The optocoupler is a weak link in the inertial navigation platform of a kind of guided munitions. It is necessary to use accelerated storage test to verify the storage life of long storage products. Especially for small sample products, it is very important to obtain prior information for the design and implementation of accelerated degradation test. In this paper, the optocoupler failure mechanism verification test is designed and the experimental results are analyzed and the prior information is obtained. The results show that optocouplers have two failure modes, one is sudden failure and the other is degradation failure; the maximum temperature stress of optocoupler can't exceed 140 °C; the increase of leakage current of optocoupler is caused by movable ions contaminating the LED chip. The surface leakage current is proportional to the adsorption amount. The increase of leakage current makes p-n junction tunneling effect occur which LEDs the failure of the optocoupler. The lifetime distribution model of the optocoupler is determined by the failure physics. The lifetime of the optocoupler is subject to the lognormal distribution. The degeneracy orbit of the optocoupler leakage current is described by a power law model. The estimated values of the orbital parameters are initially calculated and the parameters of its life distribution function are deduced. The above information lays a good foundation for the optimization design and data processing of the accelerated degradation experiment. 相似文献
315.
We consider a processing network in which jobs arrive at a fork‐node according to a renewal process. Each job requires the completion of m tasks, which are instantaneously assigned by the fork‐node to m task‐processing nodes that operate like G/M/1 queueing stations. The job is completed when all of its m tasks are finished. The sojourn time (or response time) of a job in this G/M/1 fork‐join network is the total time it takes to complete the m tasks. Our main result is a closed‐form approximation of the sojourn‐time distribution of a job that arrives in equilibrium. This is obtained by the use of bounds, properties of D/M/1 and M/M/1 fork‐join networks, and exploratory simulations. Statistical tests show that our approximation distributions are good fits for the sojourn‐time distributions obtained from simulations. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
316.
T.C. Edwin Cheng Qing Ding Mikhail Y. Kovalyov Aleksander Bachman Adam Janiak 《海军后勤学研究》2003,50(6):531-554
We study the problems of scheduling a set of nonpreemptive jobs on a single or multiple machines without idle times where the processing time of a job is a piecewise linear nonincreasing function of its start time. The objectives are the minimization of makespan and minimization of total job completion time. The single machine problems are proved to be NP‐hard, and some properties of their optimal solutions are established. A pseudopolynomial time algorithm is constructed for makespan minimization. Several heuristics are derived for both total completion time and makespan minimization. Computational experiments are conducted to evaluate their efficiency. NP‐hardness proofs and polynomial time algorithms are presented for some special cases of the parallel machine problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 531–554, 2003 相似文献
317.
The service‐provision problem described in this paper comes from an application of distributed processing in telecommunications networks. The objective is to maximize a service provider's profit from offering computational‐based services to customers. The service provider has limited capacity and must choose which of a set of software applications he would like to offer. This can be done dynamically, taking into consideration that demand for the different services is uncertain. The problem is examined in the framework of stochastic integer programming. Approximations and complexity are examined for the case when demand is described by a discrete probability distribution. For the deterministic counterpart, a fully polynomial approximation scheme is known 2 . We show that introduction of stochasticity makes the problem strongly NP‐hard, implying that the existence of such a scheme for the stochastic problem is highly unlikely. For the general case a heuristic with a worst‐case performance ratio that increases in the number of scenarios is presented. Restricting the class of problem instances in a way that many reasonable practical problem instances satisfy allows for the derivation of a heuristic with a constant worst‐case performance ratio. Worst‐case performance analysis of approximation algorithms is classical in the field of combinatorial optimization, but in stochastic programming the authors are not aware of any previous results in this direction. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003 相似文献
318.
319.
数字化部队指挥网络系统效能评价模型 总被引:5,自引:0,他引:5
以结构熵理论为基础,分析数字化部队作战指挥信息网络系统组织结构对系统内信息流的影响,从信息的角度对系统组织结构的有序度进行评价,引入信息流的时效和质量的概念,建立定量评价系统结构有序度计算的时效质量模型,结合系统数据传输业务效能的评价方法,形成作战指挥信息网络系统整体综合效能的评价模型。最后辅以实例。 相似文献
320.