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

55th IEEE Conference on Decision and Control, CDC 2016

作者： Wang, Chu Li, Qianxiao Weinan, E. Chazelle, Bernard Program in Applied and Computational Mathematics Princeton University PrincetonNJ08540 United States Nokia Bell Labs 600 Mountain Avenue Murray HillNJ07974 United States Department of Mathematics Program in Applied and Computational Mathematics Princeton University NJ08540 United States Department of Computer Science Princeton University PrincetonNJ08540 United States

ISBN: (纸本)9781509018376

The classic Hegselmann-Krause (HK) model for opinion dynamics consists of a set of agents on the real line, each one instructed to move, at every time step, to the mass center of the agents within a fixed distance R. In this work, we investigate the effects of noise in the continuous-time version of the model as described by its mean-field Fokker-Planck equation. In the presence of a finite number of agents, the system exhibits a phase transition from order to disorder as the noise increases. We introduce an order parameter to track the phase transition and resolve the corresponding phase diagram. The system undergoes a phase transition for small R but none for larger R. Based on the stability analysis of the mean-field equation, we derive the existence of a forbidden zone for the disordered phase to emerge. We also provide a theoretical explanation for the well-known 2R conjecture, which states that, for a random initial distribution in a fixed interval, the final configuration consists of clusters separated by a distance of roughly 2R. Our theoretical analysis confirms previous simulations and predicts properties of the noisy HK model in higher dimension. © 2016 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SUPP & MAPP: ADAPTABLE STRUCTURE-BASED REPRESENTATIONS FOR MIR TASKS 21

SUPP & MAPP: ADAPTABLE STRUCTURE-BASED REPRESENTATIONS FOR M...

引用

21st International Society for Music Information Retrieval Conference, ISMIR 2020

作者： Savard, Claire Bugbee, Erin H. McGuirl, Melissa R. Kinnaird, Katherine M. Department of Physics University of Colorado Boulder United States Department of Biostatistics Brown University United States Division of Applied Mathematics Brown University United States Department of Computer Science and Program in Statistical and Data Sciences Smith College United States

ISBN: (纸本)9780981353708

Accurate and flexible representations of music data are paramount to addressing MIR tasks, yet many of the existing approaches are difficult to interpret or rigid in nature. This work introduces two new song representations for structure-based retrieval methods: Surface Pattern Preservation (SuPP), a continuous song representation, and Matrix Pattern Preservation (MaPP), SuPP’s discrete counterpart. These representations come equipped with several user-defined parameters so that they are adaptable for a range of MIR tasks. Experimental results show MaPP as successful in addressing the cover song task on a set of Mazurka scores, with a mean precision of 0.965 and recall of 0.776. SuPP and MaPP also show promise in other MIR applications, such as novel-segment detection and genre classification, the latter of which demonstrates their suitability as inputs for machine learning problems. © Claire Savard, Erin H. Bugbee, Melissa R. McGuirl, Katherine M. Kinnaird.

关键词： Information retrieval

来源：评论

学校读者我要写书评

暂无评论

The differential geometry of shape from shading: Biology reveals curvature structure

The differential geometry of shape from shading: Biology rev...

引用

IEEE computer Society Conference on computer Vision and Pattern Recognition Workshops (CVPRW)

作者： Benjamin Kunsberg Steven W. Zucker Applied Mathematics Program Yale University USA Departments of Computer Science and Applied Mathematics Yale University USA

Shape from shading is a classical inverse problem in computer vision. We introduce a novel mathematical formulation for calculating local surface shape based on covariant derivatives, rather than the customary integral minimization or P.D.E approaches. Motivated by neurobiology, we introduce the shading flow field (the tangent map to the image isophotes) between the image and the surface levels. Just as in the perceptual organization of texture, we use the parallel transport of our shading flow field to move the isophote field at different points on the unknown surface to a single point, amassing restrictions on our surface curvatures. Under simplifying assumptions we solve exactly for the light source/surface pairs needed for a local image patch to have a given shading flow. The magnitude of the brightness gradient then restricts this family to a single light source and surface estimate pair, up to the concave/convex ambiguity and an additional elliptical/saddle ambiguity. Example calculations illustrate our approach.

关键词： Light sources Mathematical model Equations Shape Vectors Brightness computer vision

来源：评论

学校读者我要写书评

暂无评论

Physics-informed neural networks for modeling water flows in a river channel

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第3期5卷 1001-1015页

作者： Nazari, Luis Fernando Camponogara, Eduardo Seman, Laio Oriel Department of Mathematics Federal Institute of Education Science and Technology Catarinense Rio do Sul89160-202 Brazil Department of Automation and Systems Engineering Federal University of Santa Catarina Florianopolis88040-900 Brazil Program in Applied Computer Science Universidade Do Vale Do Itajai Itajai88302-901 Brazil

The impacts incurred by floods regularly affect the planets population, inflicting social and economic problems. Optimal control strategies based on reservoir management may aid in controlling floods and mitigating the resulting damage. To this end, an accurate dynamic representation of water systems is needed. In practice, flood control strategies rely on hydrological forecasting models obtained fromconceptual or data-drivenmethods. Encouraged by recent works, this research proposes a novel surrogate model for water flow in a river channel based on physics-informed neural networks (PINNs). This approach achieved promising results regarding the assimilation of real-data measurements and the parameter identification of differential equations that govern the underlying dynamics. This article investigates PINN performance in a simulated environment built directly from a configuration of the Saint-Venant equations. The objective is to create a suitable model with high prediction accuracy and scientifically consistent behavior for use in real-Time applications. The experiments revealed promising results for hydrological modeling and presented alternatives to solve the main challenges found in conventional methods while assisting in synthesizing real-world representations. Impact Statement-The research seeks to contribute to the hydrological modeling area with a surrogate model based on physicsinformed neural networks (PINNs) to water flow in a watershed. In practice, thesemodels use conceptual or *** models to reach the precision provided by themethodology use large numbers of physical parameters. These parameters can demand deep knowledge about the environment and are possibly hard to identify in a complex basin. On the other hand, while data-driven methods do not require such knowledge about the dynamic system, they depend on a reliable and useful database to guarantee the accuracy of system *** introduce PINNs as a viable solution for

关键词： Floods

来源：评论

学校读者我要写书评

暂无评论

Prognostic Kalman Filter Based Bayesian Learning Model for Data Accuracy Prediction

引用

computers, Materials & Continua 2022年第7期72卷 243-259页

作者： S.Karthik Robin Singh Bhadoria Jeong Gon Lee Arun Kumar Sivaraman Sovan Samanta A.Balasundaram Brijesh Kumar Chaurasia S.Ashokkumar Department of ECE College of Engineering and TechnologySRM Institute of Science and TechnologyVadapalaniChennai600026India Department of CSE Birla Institute of Applied Sciences(BIAS)BhimtalUttarakhand263136India Division of Applied Mathematics Wonkwang University460Iksan-DaeroIksan-SiJeonbuk54538Korea School of Computer Science and Engineering Vellore Institute of Technology(VIT)Chennai600127India Department of Mathematics Tamralipta MahavidyalayaWest Bengal721636India School of Computer Science and Engineering Center for Cyber Physical SystemsVellore Institute of Technology(VIT)Chennai600127India Indian Institute of Information Technology(IIIT) LucknowUttar Pradesh226002India Department of Computer Science and Engineering Saveetha School of EngineeringSIMATSChennai602105India

Data is always a crucial issue of concern especially during its prediction and computation in digital *** paper exactly helps in providing efficient learning mechanism for accurate predictability and reducing redundant data *** also discusses the Bayesian analysis that finds the conditional probability of at least two parametric based predictions for the *** paper presents a method for improving the performance of Bayesian classification using the combination of Kalman Filter and *** method is applied on a small dataset just for establishing the fact that the proposed algorithm can reduce the time for computing the clusters from *** proposed Bayesian learning probabilistic model is used to check the statistical noise and other inaccuracies using unknown *** scenario is being implemented using efficient machine learning algorithm to perpetuate the Bayesian probabilistic *** also demonstrates the generative function forKalman-filer based prediction model and its *** paper implements the algorithm using open source platform of Python and efficiently integrates all different modules to piece of code via Common Platform Enumeration(CPE)for Python.

关键词： Bayesian learning model kalman filter machine learning data accuracy prediction

来源：评论

学校读者我要写书评

暂无评论

Algorithmic aspects of vertex ellmination 7

Algorithmic aspects of vertex ellmination

引用

7th Annual ACM Symposium on Theory of Computing, STOC 1975

作者： Rose, Donald J. TarJan, R. Endre Applied Mathematics Aiken Computation Laboratory Harvard University CambridgeMA United States Computer Science Division Department of Electrical Engineering and Computer Sciences Electronics Research Laboratory University of California Berkeley United States

We consider a graph-theoretic elimination process which is related to performin~ Gaussian elimination on sparse symmetric and unsymmetrlc systems of linear equations. We discuss good al~orlthms for finding elimination orderings, showing that a generalization of breadth-flrst search, called lexicographlc search, can be used to find perfect orderlngs in O(n+e) time and minimal orderlngs in O(ne) time, if the problem graph is undirected and has n vertices and e edges. We also give efficient (though slower) algorithms for generating such orderings on directed graphs. We claim that the minimum ordering problem for directed graphs is NP-complete, and conjecture that it is also NP-complete for undirected graphs. We include a brief discussion of the relation of elimination to transitive closure and discuss some unresolved, more general, issues. © 1975 Association for Computing Machinery. All rights reserved.

关键词： Directed graphs

来源：评论

学校读者我要写书评

暂无评论

Efficient utilization of bus idle times in CAN-based networked control systems

Efficient utilization of bus idle times in CAN-based network...

引用

作者： Martí, Pau Camacho, Antonio Velasco, Manel El Mongi Ben Gaid, Mohamed Automatic Control Department Technical University of Catalonia Pau Gargallo 5 08028 Barcelona Spain Technology Computer Science and Applied Mathematics Division IFP 92852 Rueil-Malmaison France

ISBN: (纸本)9783902661821

This paper presents a novel approach to networked control systems (NCS) analysis and design that provides increased control performance for a set of control loops that exchange control data over the Controller Area Network (CAN). This is achieved by enabling the following functionality for each control loop: first, standard periodic messaging is guaranteed to ensure stability, and second, non-periodic additional messaging is added whenever the bus is idle in such a way that the aggregated control performance for all control loops is improved. The proposed approach, named Maximum Difference (MD) policy, is computable in a distributed manner, and is practically feasible (computationally efficient and CAN-implementable). We theoretically prove that the MD policy behaves better than static strategies. Simulation results complement the theoretical derivations and show that the MD policy outperforms static, random and Largest Error First policies. © 2010 IFAC.

关键词： Networked control systems

来源：评论

学校读者我要写书评

暂无评论

Direct method for reconstructing shape from shading

Direct method for reconstructing shape from shading

引用

1992 IEEE computer Society Conference on computer Vision and Pattern Recognition, CVPR 1992

作者： Dupuis, P. Oliensis, J. Division of Applied Mathematics Brown University Box F ProvidenceRI02912 United States Department of Computer Science University of Massachusetts at Amherst AmherstMA01003 United States

ISBN: (纸本)0818628553

An approach to shape-from-shading that is based on a connection with a calculus of variations/optimal control problem is proposed. An explicit representation corresponding to a shaded image is given for the surface;uniqueness of the surface (under suitable conditions) is an immediate consequence. The approach leads naturally to an algorithm for shape reconstruction that is simple, fast, provably convergent (in many cases, provably convergent to the correct solution), and does not require regularization. Given a continuous image, the algorithm can be proved to converge to the continuous surface solution as the image sampling frequency is taken to infinity. Experimental results are presented for synthetic and real images. © 1992 IEEE.

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

ARCHIE-an essential component in mechatronic aids for the disabled

ARCHIE-an essential component in mechatronic aids for the di...

引用

IEE Colloquium on Mechatronic Aids for the Disabled

作者： I.W. Ricketts A.Y. Cairns A.F. Newell Applied Computer Studies Division Department of Mathematics and Computer Science University of Dundee UK

ARCHIE (A Reliable computer Human Interaction Environment) is a 3 year project to develop a general solution to improving the reliability of human-computer interaction and to demonstrate the benefits. The project is funded under the European Commission (EC) Open Microprocessor Systems Initiative (OMI) and involves a consortium of developers including the University of Dundee (UK), GEC-Marconi Avionics (UK), computer Resources International (Denmark), Bertin et Cie (France), Sofreavia/CENA (France), and the CAA/DRA (UK). The ARCHIE software kernel runs in parallel with the existing user interface of any application. Its role is to monitor the operator, the environment and the current state of the application and on the basis of this to offer advice to the user which will dynamically improve the reliability of the interaction across the human-computer interface. A further feature is the offer of advice to the human on the use of alternative input devices and prediction of a possible error situation (which may prevent errors before they become serious).< >

关键词： Handicapped aids Mechatronics Reliability User interfaces

来源：评论

学校读者我要写书评

暂无评论

Why Gabor frames? Two fundamental measures of coherence and their role in model selection

Why Gabor frames? Two fundamental measures of coherence and ...

引用

作者： Bajwa, Waheed U. Calderbank, Robert Jafarpour, Sina Department of Electrical Engineering Program in Applied and Computational Mathematics Princeton University Princeton NJ 08544 United States Department of Computer Science Princeton University Princeton NJ 08544 United States

The problem of model selection arises in a number of contexts, such as subset selection in linear regression, estimation of structures in graphical models, and signal denoising. This paper studies non-asymptotic model selection for the general case of arbitrary (random or deterministic) design matrices and arbitrary nonzero entries of the signal. In this regard, it generalizes the notion of incoherence in the existing literature on model selection and introduces two fundamental measures of coherence- termed as the worst-case coherence and the average coherence-among the columns of a design matrix. It utilizes these two measures of coherence to provide an in-depth analysis of a simple, model-order agnostic one-step thresholding (OST) algorithm for model selection and proves that OST is feasible for exact as well as partial model selection as long as the design matrix obeys an easily verifiable property, which is termed as the coherence property. One of the key insights offered by the ensuing analysis in this regard is that OST can successfully carry out model selection even when methods based on convex optimization such as the lasso fail due to the rank deficiency of the submatrices of the design matrix. In addition, the paper establishes that if the design matrix has reasonably small worst-case and average coherence then OST performs near-optimally when either (i) the energy of any nonzero entry of the signal is close to the average signal energy per nonzero entry or (ii) the signal-to-noise ratio in the measurement system is not too high. Finally, two other key contributions of the paper are that (i) it provides bounds on the average coherence of Gaussian matrices and Gabor frames, and (ii) it extends the results on model selection using OST to low-complexity, model-order agnostic recovery of sparse signals with arbitrary nonzero entries. In particular, this part of the analysis in the paper implies that an Alltop Gabor frame together with OST can successfully carr

关键词： Recovery

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：