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

Design, Refinement and Accuracy of PID Controllers

IFAC Proceedings Volumes 2001年第13期34卷 675-680页

作者： Dumitru Popescu Catalin Petrescu Alexandru Fanea "Politehnica" University of Bucharest Department of Automatic Control and Computer Science 313 Splaiul Independentei Sector 6 77206 Bucharest ROMANIA

The paper presents some considerations about the design, refinement and accuracy of digital PID controllers. Starting from the robust-optimal design based on the sensitivity function of a continuous time PID controller, a discrete time equivalent is built. Several methods of quantization are introduced which improve the performances compared to the standard digital PID algorithm. Computational aspects and the efficiency of choosing the specific hardware support for PID algorithm implementation is discussed. Simulated results known that the achieved performances in closed loop implementation depend on the quality of design, but also of the rafinament and accuraccy of computed PID algorithm.

关键词： controller design robust control incremental algorithms PID rafinament computational accuracy simulation

来源：评论

学校读者我要写书评

暂无评论

Integrating pointer variables into one-way constraint models

引用

ACM Transactions on Computer-Human Interaction 1994年第2期1卷 161–213页

作者： Brad Vander Zanden Brad A. Myers Dario A. Giuse Pedro Szekely Univ. of Tennessee Knoxville Carnegie Mellon Univ. Pittsburgh PA USC/Information Sciences Institute Marina del Rey CA

Pointer variables have long been considered useful for constructing and manipulating data structures in traditional programming languages. This article discusses how pointer variables can be integrated into one-way constraint models and indicates how these constraints can be usefully employed in user interfaces. Pointer variables allow constraints to model a wide array of dynamic application behavior, simplify the implementation of structured objects and demonstrational systems, and improve the storage and efficiency of constraint-based applications. This article presents two incremental algorithms—one lazy and one eager— for solving constraints with pointer variables. Both algorithms are capable of handling (1) arbitrary systems of one-way constraints, including constraints that involve cycles, and (2) editing models that allow multiple changes between calls to the constraint solver. These algorithms are fault tolerant in that they can handle and recover gracefully from formulas that crash due to programmer error. Constraints that use pointer variables have been implemented in a comprehensive user interface toolkit, Garnet, and our experience with applications written in Garnet have proven the usefulness of pointer variable constraints. Many large-scale applications have been implemented using these constraints.

关键词： Garnet constraints development tools incremental algorithms

来源：评论

学校读者我要写书评

暂无评论

Forgetful Forests: Data Structures for Machine Learning on Streaming Data under Concept Drift

引用

algorithms 2023年第6期16卷 278-278页

作者： Yuan, Zhehu Sun, Yinqi Shasha, Dennis NYU Courant Inst Math Sci New York NY 10012 USA

Database and data structure research can improve machine learning performance in many ways. One way is to design better algorithms on data structures. This paper combines the use of incremental computation as well as sequential and probabilistic filtering to enable "forgetful" tree-based learning algorithms to cope with streaming data that suffers from concept drift. (Concept drift occurs when the functional mapping from input to classification changes over time). The forgetful algorithms described in this paper achieve high performance while maintaining high quality predictions on streaming data. Specifically, the algorithms are up to 24 times faster than state-of-the-art incremental algorithms with, at most, a 2% loss of accuracy, or are at least twice faster without any loss of accuracy. This makes such structures suitable for high volume streaming applications.

关键词： concept drift machine learning incremental algorithms tree data structures

来源：评论

学校读者我要写书评

暂无评论

A Novel Approach Based on Relevance Learning Vector Quantization Applied to the Inference of High-Order SNPs Interactions 29

A Novel Approach Based on Relevance Learning Vector Quantiza...

引用

29th Annual IEEE International Conference on Tools with Artificial Intelligence (ICTAI)

作者： Araujo, Flavia R. B. Guimaraes, Katia S. Univ Fed Pernambuco Ctr Informat BR-50740560 Recife PE Brazil

ISBN: (纸本)9781538638767

Single Nucleotide Polymorphism (SNP) is the most common variation present in the genome. Correlated SNPs interactions, called SNPs interaction, have been associated with different phenotype expressions, such as increased risk of some complex diseases. Computationally identifying SNPs interactions involving more than two SNPs, which are called high-order interactions, has proven to be a challenging problem. In this paper, we propose a new approach, called incremental Generalized Relevance Learning Vector Quantization for SNP inference (iGRLVQ-SNPi), that can efficiently infer SNPs involved in high-order interactions with high accuracy. In our experiments, iGRLVQ-SNPi obtained very good results and it achieves better results than the other methods compared. Our innovation to the learning process of LVQ is a promising approach for inference of SNPs interactions in high-order.

关键词： SNPs LVQs incremental algorithms High-order Interactions

来源：评论

学校读者我要写书评

暂无评论

AN ONLINE ALGORITHM FOR FITTING STRAIGHT-LINES BETWEEN DATA RANGES

引用

COMMUNICATIONS OF THE ACM 1981年第9期24卷 574-578页

作者： OROURKE, J John Hopkins Univ. Baltimore MD

Focuses on the use of on-line algorithm for fitting straight lines between data ranges. Problems in finding straight lines between data ranges; Interpretations of data ranges; Computations of data using incremental pr... 详细信息

关键词： computational complexity computational geometry half-plane intersection incremental algorithms on-line algorithms piecewise linear approximation

来源：评论

学校读者我要写书评

暂无评论

Sliding-Window Aggregation algorithms: Tutorial 17

Sliding-Window Aggregation Algorithms: Tutorial

引用

Proceedings of the 11th ACM International Conference on Distributed and Event-based Systems

作者： Martin Hirzel Scott Schneider Kanat Tangwongsan IBM Research Mahidol University International College

ISBN: (纸本)9781450350655

Stream processing is important for analyzing continuous streams of data in real time. Sliding-window aggregation is both needed for many streaming applications and surprisingly hard to do efficiently. Picking the wrong aggregation algorithm causes poor performance, and knowledge of the right algorithms and when to use them is scarce. This paper was written to accompany a tutorial, but can be read as a stand-alone survey that aims to better educate the community about fast sliding-window aggregation algorithms for a variety of common aggregation operations and window types.

关键词： Survey incremental algorithms aggregation windows

来源：评论

学校读者我要写书评

暂无评论

The furthest neighbor query of space K

The furthest neighbor query of space K

引用

International Conference on Wavelet Analysis and Pattern Recognition (ICWAPR)

作者： Cheng Chang Run-Tao Liu Department of applied mathematics Harbin University of Science and Technology Institute of information and scientific computing technology Harbin University of Science and Technology

ISBN: (纸本)9781467372251

In the spatial database, the furthest neighbor query is a jumped-up method. If different distances and pruning strategies are properly selected, we can greatly reduce the node number in search space. Through using data cube and edge detection method, we catch up with the traverse pruning method that is based on FNC spatial index tree of incremental and query algorithms. The experimental result turns out that the algorithms have a good pruning effect, at the same time promoting the query efficiency of space k farthest neighbors.

关键词： database indexing edge detection query processing search problems trees (mathematics) visual databases FNC spatial index tree data cube edge detection method furthest neighbor query incremental algorithms jumped-up method node number pruning effect pruning strategies query algorithms query efficiency search space space k farthest neighbors spatial database traverse pruning method FNC-Tree Spatial databases Sub cube The furthest neighbor query visual databases boundary detection algorithm database indexing tabu search query analysis Edge detection data cubes Neighbor

来源：评论

学校读者我要写书评

暂无评论

Adapting Stable Matchings to Forced and Forbidden Pairs 23

Adapting Stable Matchings to Forced and Forbidden Pairs

引用

Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems

作者： Niclas Boehmer Klaus Heeger Technische Universität Berlin Berlin Germany

ISBN: (纸本)9781450394321

We introduce the problem of adapting a stable matching to forced and forbidden pairs. Specifically, given a stable matching M1, a set Q of forced pairs, and a set P of forbidden pairs, we want to find a stable matching that includes all pairs from Q, no pair from P, and that is as close as possible to M1. We study this problem in four classical stable matching settings: Stable Roommates (with Ties) and Stable Marriage (with Ties).As our main contribution, we employ the theory of rotations for Stable Roommates to develop a polynomial-time algorithm for adapting Stable Roommates matchings to forced pairs. In contrast to this, we show that the same problem for forbidden pairs is NP-hard. However, our polynomial-time algorithm for the case of only forced pairs can be extended to a fixed-parameter tractable algorithm with respect to the number of forbidden pairs when both forced and forbidden pairs are present. Moreover, we also study the setting where preferences contain ties. Here, depending on the chosen stability criterion, we show either that our algorithmic results can be extended or that formerly tractable problems become intractable.

关键词： FPT NP-hardness incremental algorithms W-hardness forced and forbidden pairs polynomial-time algorithm stable marriage rotations stable roommates

来源：评论

学校读者我要写书评

暂无评论

Improved Delaunay Growing algorithms and Application

Improved Delaunay Growing Algorithms and Application

引用

2011 International Symposium on Water Resource and Environmental Protection(ISWREP 2011)

作者： ZHANG Wei-jun Shool of Earth Science and Resources Management Chang’an University Xi’an. China KONG jin-ling Shool of Earth Science and Resources Management Chang’an University Xi’an. China

An improved algorithm on the basis of growing algorithms is developed for highly-efficient establishment of Delaunay-triangulation. The algorithm makes use of a dynamic list of points. With the growth of the Delaunay-triangulation, the available points in the list decrease constantly, resulting in simplified calculation procedures. Moreover, the improved algorithm makes the triangle to grow from the last pressed edge in the edge table against the two possible edges of the conventional growing algorithms and ensures correct growth of the triangle. Earthwork calculation shows that the improved algorithm establishes Delaunay-triangulation faster than traditional algorithms.

关键词： Delaunay-triangulation divide-conquer algorithms incremental algorithms growing algorithms pointlist

来源：评论

学校读者我要写书评

暂无评论

Mining GPS data to augment road models 99

Mining GPS data to augment road models

引用

Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining

作者： Seth Rogers Pat Langley Christopher Wilson DaimlerChrysler Research and Technology Center 1510 Page Mill Road Palo Alto CA

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：