全文获取类型
收费全文 | 75篇 |
免费 | 11篇 |
国内免费 | 8篇 |
专业分类
电工技术 | 4篇 |
综合类 | 5篇 |
机械仪表 | 3篇 |
武器工业 | 1篇 |
无线电 | 7篇 |
一般工业技术 | 5篇 |
冶金工业 | 1篇 |
自动化技术 | 68篇 |
出版年
2025年 | 1篇 |
2024年 | 2篇 |
2023年 | 4篇 |
2022年 | 1篇 |
2021年 | 5篇 |
2020年 | 10篇 |
2019年 | 4篇 |
2018年 | 5篇 |
2017年 | 7篇 |
2016年 | 4篇 |
2015年 | 7篇 |
2014年 | 1篇 |
2013年 | 5篇 |
2012年 | 6篇 |
2011年 | 5篇 |
2010年 | 1篇 |
2009年 | 3篇 |
2008年 | 5篇 |
2007年 | 4篇 |
2005年 | 1篇 |
2004年 | 1篇 |
2003年 | 2篇 |
2001年 | 3篇 |
2000年 | 1篇 |
1998年 | 2篇 |
1995年 | 2篇 |
1990年 | 1篇 |
1985年 | 1篇 |
排序方式: 共有94条查询结果,搜索用时 15 毫秒
41.
模拟电路故障诊断可信度研究 总被引:2,自引:0,他引:2
提出了描述标称转移矩阵Z0的各标征向量几何分布性状的Voronoi多胞体,定义了描述测量向量dU在标征向量Zi中位置的标征干扰角θui。然后利用这两个概念揭示了容差─故障电路可诊充要和充分条件,讨论了定位故障的极值法和阈值法的有效性、局限性,及提高定位准确率的可能途径。 相似文献
42.
Naoki Kanagawa 《International journal of control》2013,86(12):2598-2610
This paper considers a failure diagnosis problem for discrete event systems subject to permanent sensor failures. A notion of diagnosability subject to permanent sensor failures is introduced with respect to a certain nondeterministic observation mask. For its verification, an aggregated Mealy automaton with a deterministic and state-dependent observation mask is defined. It is shown that the diagnosability of the aggregated Mealy automaton is equivalent to the diagnosability of the original system subject to permanent sensor failures. Then, a method for verifying the diagnosability of the aggregated Mealy automaton is presented. Moreover, the delay bound within which the occurrence of any failure string can be detected subject to permanent sensor failures is computed. 相似文献
43.
44.
Intermittent faults (IFs) have the properties of unpredictability, non-determinacy, inconsistency and repeatability, switching systems between faulty and healthy status. In this paper, the fault detection and isolation (FDI) problem of IFs in a class of linear stochastic systems is investigated. For the detection and isolation of IFs, it includes: (1) to detect all the appearing time and the disappearing time of an IF; (2) to detect each appearing (disappearing) time of the IF before the subsequent disappearing (appearing) time; (3) to determine where the IFs happen. Based on the outputs of the observers we designed, a novel set of residuals is constructed by using the sliding-time window technique, and two hypothesis tests are proposed to detect all the appearing time and disappearing time of IFs. The isolation problem of IFs is also considered. Furthermore, within a statistical framework, the definition of the diagnosability of IFs is proposed, and a sufficient condition is brought forward for the diagnosability of IFs. Quantitative performance analysis results for the false alarm rate and missing detection rate are discussed, and the influences of some key parameters of the proposed scheme on performance indices such as the false alarm rate and missing detection rate are analysed rigorously. The effectiveness of the proposed scheme is illustrated via a simulation example of an unmanned helicopter longitudinal control system. 相似文献
45.
The process of identifying faulty processors is called the diagnosis of the system. Several diagnostic models have been proposed, the most popular is the PMC (Preparata, Metze and Chen) diagnostic model. The pessimistic diagnosis strategy is a classic strategy based on the PMC model in which isolates all faulty nodes within a set containing at most one fault-free node. A system is t/t-diagnosable if, provided the number of faulty processors is bounded by t, all faulty processors can be isolated within a set of size at most t with at most one fault-free node mistaken as a faulty one. The pessimistic diagnosability of a system G , denoted by tp(G), is the maximal number of faulty processors so that the system G is t/t-diagnosable. Jwo et al. [11] introduced the alternating group graph as an interconnection network topology for computing systems. The proposed graph has many advantages over hypercubes and star graphs. For example, for all alternating group graphs, every pair of vertices in the graph are connected by a Hamiltonian path and the graph can embed cycles with arbitrary length with dilation 1. In this article, we completely determine the pessimistic diagnosability of an n -dimensional alternating group graph, denoted by AGn. Furthermore, tp(AGn)=4n−11 for n≥4. 相似文献
46.
Li He Furong Li 《International Journal of Parallel, Emergent and Distributed Systems》2016,31(1):34-46
In high performance computers, a popular interconnection network, the folded hypercube (FHC), possesses smaller diameter, larger connectivity, better reliability and fault tolerance capability as compared with a hypercube counterpart. This paper addresses the fault identification of FHC multiprocessor interconncection systems under the MM* model. The pessimistic one-step diagnosability of FHC networks is first determined. On the basis, a pessimistic one-step diagnosis algorithm tailored for FHC multiprocessor systems is proposed. The presented algorithm can isolate all faulty nodes to within a set which has at most one fault-free node, and can run in linear time. 相似文献
47.
We propose a new, low-cost fault-tolerant structure for the hypercube that employs spare processors and extra links. The target of the proposed structure is to fully tolerate the first faulty node, no matter where it occurs, and almost fully tolerate the second, meaning that the underlying hypercube topology can be resumed if the second faulty node occurs at most locations—expectantly 92% of locations. The unique features of our structure are that (1) it utilizes the unused extra link-ports in the processor nodes of the hypercube to obtain the proposed topology, so that minimum extra hardware is needed in constructing the fault-tolerant structure and (2) the structure's node-degrees are low as desired—the primary and spare nodes all have node-degrees of n + 2 for an n-dimensional hypercube. The number of spare nodes is one fourth of primary nodes. The reconfiguration algorithm in the presence of faults is elegant and efficient. The proposed structure also effectively enhances the diagnosability of the hypercube system. It is shown that the diagnosability of the structure is increased to n + 2, whereas an ordinary n-dimensional hypercube has diagnosability n. 相似文献
48.
Erdal Kilic 《Information Sciences》2008,178(3):858-870
In this paper, discrete event systems (DESs) are reformulated as fuzzy discrete event systems (FDESs) and fuzzy discrete event dynamical systems (FDEDSs). These frameworks include fuzzy states, events and IF-THEN rules. In these frameworks, all events occur at the same time with different membership degrees. Fuzzy states and events have been introduced to describe uncertainties that occur often in practical problems, such as fault diagnosis applications. To measure a diagnoser’s fault discrimination ability, a fuzzy diagnosability degree is proposed. If the diagnosability of the degree of the system yields one a diagnoser can be implemented to identify all possible fault types related to a system. For any degree less than one, researchers should not devote their time to distinguish all possible fault types correctly. Thus, two different diagnosability definitions FDEDS and FDES are introduced. Due to the specialized fuzzy rule-base embedded in the FDEDS, it is capable of representing a class of non-linear dynamic system. Computationally speaking, the framework of diagnosability of the FDEDS is structurally similar to the framework of diagnosability of a non-linear system. The crisp DES diagnosability has been turned into the term fuzzy diagnosability for the FDES. The newly proposed diagnosability definition allows us to define a degree of diagnosability in a class of non-linear systems. In addition, a simple fuzzy diagnosability checking method is introduced and some numerical examples are provided to illustrate this theoretical development. Finally, the potential applications of the proposed method are discussed. 相似文献
49.
50.