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

IEEE Winter Applications and computer Vision Workshops (WACVW)

作者： Michael Maynord Sambit Bhattacharya David W. Aha Computer Science Dept. University of Maryland College Park MD Dept. of Math & Computer Science Fayetteville State University Fayetteville NC Navy Center for Applied Research in AI Naval Research Laboratory Washington DC

Security watchstanders who monitor multiple videos over long periods of time can be susceptible to information overload and fatigue. To address this, we present a configurable perception pipeline architecture, called the Image Surveillance Assistant (ISA), for assisting watchstanders with video surveillance tasks. We also present ISA1, an initial implementation that can be configured with a set of context specifications which watchstanders can select or provide to indicate what imagery should generate notifications. ISA1's inputs include (1) an image and (2) context specifications, which contain English sentences and a decision boundary defined over object detection vectors. ISA1 assesses the match of the image with the contexts by comparing (1) detected versus specified objects and (2) automatically-generated versus specified captions. Finally, we present a study to assess the utility of using captions in ISA1, and found that they substantially improve the performance of image context detection.

关键词： Context Surveillance computer architecture Feature extraction Videos Security Object detection

来源：评论

学校读者我要写书评

暂无评论

Strong edge coloring for channel assignment in wireless radio networks

Strong edge coloring for channel assignment in wireless radi...

引用

IEEE Annual Conference on Pervasive Computing and Communications Workshops (PerCom)

作者： C.L. Barrett G. Istrate V.S.A. Kumar M.V. Marathe S. Thite S. Thulasidasan Virginia Bio-Informatics Institute and Department of Computer Science Virginia Polytechnic Institute and State University USA Basic and Applied Simulation Science (CCS-5) Los Alamos National Laboratory USA Department of Math & Computer Science Technische Universiteit Eindhoven Netherlands

We give efficient sequential and distributed approximation algorithms for strong edge coloring graphs modeling wireless networks. Strong edge coloring is equivalent to computing a conflict-free assignment of channels ... 详细信息

关键词： Intelligent networks Radio networks Transceivers Interference Radio network Approximation algorithms Frequency computer science Media Access Protocol Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Control of a Wind Turbine Emulator Based on Variable Pitch Angle with a Self-Excited Induction Generator

Control of a Wind Turbine Emulator Based on Variable Pitch A...

引用

Innovative Research in applied science, Engineering and Technology (IRASET),Conference on

作者： Chaymaâ Boutahiri Ayoub Nouaiti Abdelouahed Mesbahi Abdallah Marhraoui Hsaini Aziz Bouazi Laboratory of Computer Science Applied Math and Electrical Engineering Moulay Ismail University IEVIA Team EST Meknès Morocco Laboratory of Energy & Electrical Systems Hassan II University ENSEM Casablanca Morocco

ISBN: (数字)9798350309508

ISBN: (纸本)9798350309515

This article highlights the control of an electromechanical wind emulator designed to mimic the behavior of a wind turbine. The emulator employs a self-excited induction generator, which is driven by a DC motor. A DC-DC Buck converter adjusts the rotation speed, adapting to changes in the wind profile. A PI controller is employed to oversee and fine-tune the output current from the converter, ensuring alignment with the characteristics of the wind turbine model in use. The control strategy is crafted to oversee the wind turbine power based on the wind speed. This is achieved by adjusting the pitch angle value and tip speed, aiming to prevent wind turbine from stalling. The efficacy of the implemented control strategy is demonstrated in the Matlab-Simulink environment, where the proposed system is evaluated. The results show accurate tracking and no overshoot.

关键词： Adaptation models Buck converters PI control Induction generators Wind speed DC motors mathematical models

来源：评论

学校读者我要写书评

暂无评论

A note on proximity spaces and connection based mereology 01

A note on proximity spaces and connection based mereology

引用

Formal Ontology in Information Systems: Collected Papers from the Second International Conference

作者： Vakarelov, Dimiter Düntsch, Ivo Bennett, Brandon Laboratory for Applied Logic Fac. of Math. and Computer Science Sofia University blvd James Bouchier 5 1126 Sofia Bulgaria Faculty of Informatics University of Ulster Newtownabbey BT 370QB United Kingdom School of Computing University of Leeds Leeds LS2 9JT United Kingdom Department of Computer Science Brock University St. Catherines Ont. L2S 3AI Canada

ISBN: (纸本)1581133774

Representation theorems for systems of regions have been of interest for some time, and various contexts have been used for this purpose: Mormann has demonstrated the fruitfulness of the methods of continuous lattices to obtain a topological representation theorem for his formalisation of Whiteheadian ontological theory of space;similar results have been obtained by Roeper. In this note, we prove a topological representation theorem for a connection based class of systems, using methods and tools from the theory of proximity spaces. The key novelty is a new proximity semantics for connection relations.

关键词： Information science

来源：评论

学校读者我要写书评

暂无评论

Randomness-efficient low degree tests and short PCPs via epsilon-biased sets

Randomness-efficient low degree tests and short PCPs via eps...

引用

35th Annual ACM Symposium on Theory of Computing

作者： Ben-Sasson, Eli Vadhan, Salil Sudan, Madhu Wigderson, Avi LCS MIT Harvard University Cambridge MA United States Harvard University Div. of Eng. Sci./Applied Sciences Maxwell Dworkin 337 33 Oxford St. Cambridge MA 02138 United States Laboratory for Computer Science Massachussettes Inst. of Technology Cambridge MA United States Institute for Advanced Study School of Math. Einstein Drive Princeton NJ 08540 United States Hebrew University Jerusalem Israel

We present the first explicit construction of Probabilistically Checkable Proofs (PCPs) and Locally Testable Codes (LTCs) of fixed constant query complexity which have almost-linear (= n · 2Õ(√log n) size. Such objects were recently shown to exist (nonconstructively) by Goldreich and Sudan. Previous explicit constructions required size n1+ω(Ε) with 1/Ε queries. The key to these constructions is a nearly optimal randomness-efficient version of the low degree test. In a similar way we give a randomness-efficient version of the BLR linearity test (which is used, for instance, in locally testing the Hadamard code). The derandomizations are obtained through Ε-biased sets for vector spaces over finite fields. The analysis of the derandomized tests rely on alternative views of Ε-biased sets - as generating sets of Cayley expander graphs for the low degree test, and as defining linear error-correcting codes for the linearity test.

关键词： Codes (symbols)

来源：评论

学校读者我要写书评

暂无评论

Decay property for solutions in the three-phase-lag heat conduction

引用

Communications in mathematical Analysis 2013年第1期15卷 99-114页

作者： Djouamai, Leila Said-Houariy, Belkacem Applied Math Laboratory University Badji Mokhtar-Annaba Annaba 23000 P.O. Box 12 Algeria Division of Mathematical and Computer Sciences and Engineering King Abdullah University of Science and Technology (KAUST) Thuwal Saudi Arabia

In this paper, we consider the Cauchy problem of two models of the theory of heat conduction with three-phase-lag. Under appropriate assumptions on the material parameters, we show the optimal decay rate of the L²-norm of solutions. More precisely, we prove that in each model the L²-norm of the solution is decaying with the rate (1 + t)^-1/4 for initial data in L¹(R). This decay rate is similar to the one of the heat kernel. Some faster decay rates have been also given for some weighted initial data in L¹(R). © 2013 Project Euclid.

关键词： Decay rate Energy method Heat conduction Stability Three-phase-lag

来源：评论

学校读者我要写书评

暂无评论

Direct methods for matrix Sylvester and Lyapunov equations

引用

Journal of applied mathematics 2003年第6期2003卷 277-303页

作者： Sorensen, Danny C. Zhou, Yunkai Department of Computational and Applied Mathematics Rice University Houston TX 77005-1892 United States Department of Computational and Applied Mathematics Rice University Houston TX 77005-1892 United States Argonne National Laboratory Math and Computer Science Division Argonne IL 60439 United States

We revisit the two standard dense methods for matrix Sylvester and Lyapunov equations: The Bartels-Stewart method for A1X+XA2+D=0 and Hammarling's method for AX+XAT+BBT=0 with A stable. We construct three schemes for solving the unitarily reduced quasitriangular systems. We also construct a new rank-1 updating scheme in Hammarling's method. This new scheme is able to accommodate a B with more columns than rows as well as the usual case of a B with more rows than columns, while Hammarling's original scheme needs to separate these two cases. We compared all of our schemes with the Matlab Sylvester and Lyapunov solver lyap.m;the results show that our schemes are much more efficient. We also compare our schemes with the Lyapunov solver sllyap in the currently possibly the most efficient control library package SLICOT;numerical results show our scheme to be competitive. © 2003 Hindawi Publishing Corporation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Semi-Implicit Lagrangian Voronoi Approximation for Compressible Viscous Fluid Flows

arXiv

引用

arXiv 2024年

作者： Kincl, Ondřej Peshkov, Ilya Boscheri, Walter Laboratory of Applied Mathematics DICAM University of Trento Trento38123 Italy Laboratoire de Mathématiques UMR 5127 CNRS Université Savoie Mont Blanc Le Bourget du Lac73376 France Department of Mathematics and Computer Science University of Ferrara Ferrara44121 Italy

This paper contributes to the recent investigations of Lagrangian methods based on Voronoi meshes. The aim is to design a new conservative numerical scheme that can simulate complex flows and multi-phase problems with more accuracy than SPH (Smoothed Particle Hydrodynamics) methods but, unlike diffuse interface models on fixed grid topology, does not suffer from the deteriorating quality of the computational grid. The numerical solution is stored at particles, which move with the fluid velocity and also play the role of the generators of the computational mesh, that is efficiently re-constructed at each time step. The main novelty stems from combining a Lagrangian Voronoi scheme with a semi-implicit integrator for compressible flows. This allows to model low-Mach number flows without the extremely stringent stability constraint on the time step and with the correct scaling of numerical viscosity. The implicit linear system for the unknown pressure is obtained by splitting the reversible from the irreversible (viscous) part of the dynamics, and then using entropy conservation of the reversible sub-system to derive an auxiliary elliptic equation. The method, called SILVA (Semi-Implicit Lagrangian Voronoi Approximation), is validated in a variety of test cases that feature diverse Mach numbers, shocks and multi-phase flows. Copyright © 2024, The Authors. All rights reserved.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

SCORE: A Second-Order Conic Initialization for Range-Aided SLAM

SCORE: A Second-Order Conic Initialization for Range-Aided S...

引用

IEEE International Conference on Robotics and Automation (ICRA)

作者： Alan Papalia Joseph Morales Kevin J. Doherty David M. Rosen John J. Leonard Computer Science and Artificial Intelligence Laboratory (CSAIL) Massachusetts Institute of Technology (MIT) Cambridge MA USA Department of Applied Ocean Physics & Engineering Woods Hole Oceanographic Institution Woods Hole MA USA Department of Electrical & Computer Engineering Northeastern University Boston MA USA Department of Math Northeastern University Boston MA USA

We present a novel initialization technique for the range-aided simultaneous localization and mapping (RA-SLAM) problem. In RA-SLAM we consider measurements of point-to-point distances in addition to measurements of rigid transformations to landmark or pose variables. Standard formulations of RA-SLAM approach the problem as non-convex optimization, which requires a good initialization to obtain quality results. The initialization technique proposed here relaxes the RA-SLAM problem to a convex problem which is then solved to determine an initialization for the original, non-convex problem. The relaxation is a second-order cone program (SOCP), which is derived from a quadratically constrained quadratic program (QCQP) formulation of the RA-SLAM problem. As a SOCP, the method is highly scalable. We name this relaxation Second-order COnic RElaxation for RA-SLAM (SCORE). To our knowledge, this work represents the first convex relaxation for RA-SLAM. We present real-world and simulated experiments which show SCORE initialization permits the efficient recovery of quality solutions for a variety of challenging single- and multi-robot RA-SLAM problems with thousands of poses and range measurements.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Semi-implicit Lagrangian Voronoi Approximation for the incompressible Navier-Stokes equations

arXiv

引用

arXiv 2024年

作者： Kincl, Ondřej Peshkov, Ilya Boscheri, Walter Laboratory of Applied Mathematics DICAM University of Trento via Mesiano 77 Trento38123 Italy Laboratoire de Mathématiques UMR 5127 CNRS Université Savoie Mont Blanc Le Bourget du Lac73376 France Department of Mathematics and Computer Science University of Ferrara Ferrara Italy

We introduce Semi-Implicit Lagrangian Voronoi Approximation (SILVA), a novel numerical method for the solution of the incompressible Euler and Navier-Stokes equations, which combines the efficiency of semi-implicit time marching schemes with the robustness of time-dependent Voronoi tessellations. In SILVA, the numerical solution is stored at particles, which move with the fluid velocity and also play the role of the generators of the computational mesh. The Voronoi mesh is rapidly regenerated at each time step, allowing large deformations with topology changes. As opposed to the reconnection-based Arbitrary-Lagrangian-Eulerian schemes, we need no remapping stage. A semi-implicit scheme is devised in the context of moving Voronoi meshes to project the velocity field onto a divergence-free manifold. We validate SILVA by illustrative benchmarks, including viscous, inviscid, and multi-phase flows. Compared to its closest competitor, the Incompressible Smoothed Particle Hydrodynamics (ISPH) method, SILVA offers a sparser stiffness matrix and facilitates the implementation of no-slip and free-slip boundary conditions. Copyright © 2024, The Authors. All rights reserved.

关键词： Stiffness matrix

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：