检索结果-内蒙古大学图书馆

Fault Diagnosis of Dynamic System by Means of parameter estimation

IFAC Proceedings Volumes 1988年第9期21卷 1159-1164页

作者： Li Zhi Zheng Yong Department of Electrical Engineering Southwestern Jiao-tong University Sichuan PRC

An on-line algorithm of parameter estimation for dynamic system fault diagnosis is proposed in this paper. The method of ‘recursion in groups’ is put forward for the recursive estimation of system parameter. Combining with the innovation detection of parameter jumping, it is particularly suitable for system fault diagnosis. The method can also be used in other areas as a way of data process. The algorithm is implemented on microcomputer with assembler language. In order to be testified, it is used to monitor the operation of a d.c. driving system. The system is composed of a d.c. motor and a generator. Faults are simulated by changing the parameters of motor such as load, flux linkage, armature inductance and resistance. Experiment results are given out and prove that the algorithm is of good quality. It requires small amount of computer memory and can estimate time-varying system parameter (including jumping parameter) accurately. In the end, we point out the further work and the possible uses of the system fault diagnosis method.

关键词： Fault diagnosis parameter estimation on-line algorithm recursion in groups d.c. motors time-varying systems

来源：评论

学校读者我要写书评

暂无评论

Online Algebraic Identification of the Payload Changes in a Single-Link Flexible Manipulator Moving under Gravity

引用

IFAC Proceedings Volumes 2014年第3期47卷 8397-8402页

作者： Andres San-Millan Rodriguez Juan Carlos Cambera Ibañez Vicente Feliu Battle Department of Electrical Electronic and Automatic Control Engineering University of Castilla-La Mancha Ciudad Real Spain

This paper presents a method for the on-line identification of the payload carried by a single-link flexible manipulator whose movement is constrained to the vertical plane. The vertical movement of the robot makes the effect of gravity not negligible, and determines therefore, the non-linear behaviour of the analysed system. The proposed estimator is based on the algebraic derivative approach in the frequency domain. The short period of time it takes for the algorithm to make an estimate, and its low computational burden make it suitable for real-time and adaptive control applications. The proposed estimator is experimentally tested in several situations carefully chosen to reproduce routine operations of the flexible manipulator.

关键词： Flexible Robot Estimation Parameters Algebraic Estimator on-line algorithm

来源：评论

学校读者我要写书评

暂无评论

The Bounded Single-Machine Parallel-batching Scheduling Problem with Family Jobs for Minimizing Makespan

引用

Procedia Environmental Sciences 2011年 10卷 374-378页

作者： Jintao Meng Xiaoxu Lu Zhengzhou Institute of Aeronautical Industry Management Zhengzhou 450015 China

In this paper we consider the problem of scheduling family jobs on a parallel-batching machine under on-line setting, our objective is to minimize the maximum completion time of the jobs (makespan). A batch processing machine can handle up to B jobs simultaneously. The jobs that are processed together form a batch, and all jobs in a batch start and complete at the same time. The processing time of a batch is given by the longest processing time of any job in the batch. The jobs from different families are incompatible and thus cannot be put in the same batch. We construct our schedule irrevocably as time proceeds and do not know of the existence of any job until its arrival. We deal with the schedule problem: the bounded model in which the capacity of the machine is limited, and all jobs come from m families. We provide an on-line approximation algorithm with a worst case ratio 2.

关键词： single machine scheduling worst-case analysis family on-line algorithm Parallel-batching Scheduling

来源：评论

学校读者我要写书评

暂无评论

An Online algorithm for Routing an Unmanned Aerial Vehicle for Road Network Exploration Operations after Disasters under Different Refueling Strategies

引用

algorithmS 2022年第6期15卷

作者： Reyes-Rubiano, Lorena Voegl, Jana Hirsch, Patrick Otto von Guericke Univ Operat Management D-39016 Magdeburg Germany Univ La Sabana Int Sch Econ & Adm Sci Bogota 53753 Colombia Univ Nat Resources & Life Sci Vienna Inst Prod & Logist A-331180 Vienna Austria

This paper is dedicated to studying on-line routing decisions for exploring a disrupted road network in the context of humanitarian logistics using an unmanned aerial vehicle (UAV) with flying range limitations. The exploration aims to extract accurate information for assessing damage to infrastructure and road accessibility of victim locations in the aftermath of a disaster. We propose an algorithm to conduct routing decisions involving the aerial and road network simultaneously, assuming that no information about the state of the road network is available in the beginning. Our solution approach uses different strategies to deal with the detected disruptions and refueling decisions during the exploration process. The strategies differ mainly regarding where and when the UAV is refueled. We analyze the interplay of the type and level of disruption of the network with the number of possible refueling stations and the refueling strategy chosen. The aim is to find the best combination of the number of refueling stations and refueling strategy for different settings of the network type and disruption level.

关键词： disrupted road network immediate response operations on-line algorithm refueling strategies online exploration strategies network cutting procedure labeled network

来源：评论

学校读者我要写书评

暂无评论

Improved lower bound on the on-line chain partitioning of semi-orders with representation

引用

DISCRETE MATHEMATICS 2023年第12期346卷

作者： Biro, Csaba Curbelo, Israel R. Univ Louisville Dept Math Louisville KY 40292 USA Kean Univ Dept Math & Comp Sci Union NJ 07083 USA

An on-line chain partitioning algorithm receives a poset, one element at a time, and irrevocably assigns the element to one of the chains in the partition. The on-line chain partitioning problem involves finding the minimal number of chains needed by an on-line algorithm. Chrobak and S ' lusarek considered variants of the on-line chain partitioning problem in which the elements are presented as intervals and intersecting intervals are incomparable. They constructed an on-line algorithm which uses at most 3w - 2 chains, where w is the width of the interval order, and showed that this algorithm is optimal. They also considered the problem restricted to intervals of unit-length and while they showed that first-fit needs at most 2w -1 chains, over 30 years later, it remains unknown whether this is an optimal algorithm. In this paper, we improve upon previously known bounds and show that any on-line algorithm can be forced to use [3/2 w] chains to partition an order presented in the form of its unit interval representation. As a consequence, we completely solve the problem for w = 3. Lastly, we show that loosening the restriction from unit intervals to proper intervals in the bandwidth variant allows us to improve the lower bound by w/3. (c) 2023 Elsevier B.V. All rights reserved.

关键词： on-line algorithm Chain partitioning Semiorder Bandwidth

来源：评论

学校读者我要写书评

暂无评论

An on-line wavelet transform for de-noising of high performance liquid chromatograms

引用

ANALYTICAL LETTERS 1999年第12期32卷 2507-2520页

作者： Shao, XG Hou, SQ Univ Sci & Technol China Dept Chem Hefei 230026 Anhui Peoples R China

A novel algorithm of wavelet transform, called the on-line wavelet transform, which can be used in on-line processing of signals of an instrumental analysis, is proposed. And application of the on-line wavelet transform in de-noising of high performance liquid chromatograms was investigated. Results showed that the noise in chromatograms was cleanly removed by the method, peak position after the on-line de-noising dose not change, and the linearity of calibration curves of concentration versus peak area remained and even was improved. Quantitative determination of three mixed samples were investigated with five standard samples;the recoveries were between 94.0-105.0%.

关键词： wavelet transform on-line algorithm de-noising chromatogram

来源：评论

学校读者我要写书评

暂无评论

Direct Transient Stability Assessment with Two-Axis Generator Models

引用

IFAC Proceedings Volumes 1990年第8期23卷 7-12页

作者： Yusheng Xue Yiwei Zhang Nanjing Automation Research Institute P.O. Box 323 Nanjing PRC

The recently developed Extended Equal Area Criterion (EEAC) method has proved to be an accurate and extremely fast transient stability assessment method for the classical model. This model may be too rough for some practical engineering uses. In this paper, the EEAC method is successfully extended to managing the two-axis generator model, i.e. the constant Eq’ model, which may be accepted by more utilities for both planning and operation purposes. The proposed EEAC(Eq’) method has been extensively tested for hundreds cases with faults at all buses in the GREEK system and a Chinese regional system; and very promising results have been obtained. This generalization of EEAC method preserves its accuracy and extremely fast speed.

关键词： Power system transient stability direct methods model refinement model reduction on-line algorithm

来源：评论

学校读者我要写书评

暂无评论

On-line edge-coloring algorithms for degree-bounded bipartite graphs

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2002年第5期E85A卷 1062-1065页

作者： Taki, M Sugiura, M Kashiwabara, T Nara Natl Coll Technol Dept Informat Engn Yamato Koriyama 6391080 Japan Matsushita Tsuushin Co Yokohama Kanagawa 2238639 Japan Osaka Univ Dept Informat & Math Sci Toyonaka Osaka 5608531 Japan

A kind of online edge-coloring problems on bipartite graphs is considered. The input is a graph (typically with no edges) and a sequence of operations (edge addition and edge deletion) under the restriction that at any time the graph is bipartite and degree-bounded by k, where k is a prescribed integer. At the time of edge addition;the added edge can be irrevocably assigned a color or be left uncolored. No other coloring or color alteration is allowed. The problem is to assign colors as many times as possible using k colors. Two algorithms are presented: one with competitiveness coefficient 1/4 against oblivious adversaries;and one with competitiveness coefficient between 1/4 and 1/2 with the cost of requiring more random bits than the former algorithm, also against oblivious adversaries.

关键词： on-line algorithm randomization edge-coloring

来源：评论

学校读者我要写书评

暂无评论

Greedy algorithms for on-line set-covering and related problems 06

Greedy algorithms for on-line set-covering and related probl...

引用

Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51

作者： Giorgio Ausiello Aristotelis Giannakos Vangelis Th. Paschos Dipartimento di Informatica e Sistemistica Università degli Studi di Roma "La Sapienza" Roma Italy LAMSADE Université Paris-Dauphine Paris Cedex France

ISBN: (纸本)9781920682330

We study the following on-line model for set-covering: elements of a ground set of size n arrive one-by-one and with any such element ci, arrives also the name of some set Si0 containing ci and covering the most of the uncovered ground set-elements (obviously, these elements have not been yet revealed). For this model we analyze a simple greedy algorithm consisting of taking Si0 into the cover, only if ci is not already covered. We prove that the competitive ratio of this algorithm is √n and that it is asymptotically optimal for the model dealt, since no on-line algorithm can do better than √n/2. We next show that this model can also be used for solving minimum dominating set with competitive ratio bounded above by the square root of the size of the input graph. We finally deal with the maximum budget saving problem. Here, an initial budget is allotted that is destined to cover the cost of an algorithm for solving set-covering. The objective is to maximize the savings on the initial budget. We show that when this budget is at least equal to √n times the size of the optimal (off-line) solution of the instance under consideration, then the natural greedy off-line algorithm is asymptotically optimal.

关键词： budget saving set-covering on-line algorithm dominating set competitive ratio

来源：评论

学校读者我要写书评

暂无评论

Greedy algorithms for on-line set-covering and related problems 06

Greedy algorithms for on-line set-covering and related probl...

引用

Proceedings of the Twelfth Computing: The Australasian Theory Symposium - Volume 51

作者： Giorgio Ausiello Aristotelis Giannakos Vangelis Th. Paschos Università degli Studi di Roma "La Sapienza" Roma Italy Université Paris-Dauphine and CNRS UMR Paris Cedex France

ISBN: (纸本)9781920682330

关键词： on-line algorithm dominating set competitive ratio budget saving set-covering

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：