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

16th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)

作者： Negrean, Mircea Neukirchner, Moritz Stein, Steffen Schliecker, Simon Ernst, Rolf Tech Univ Carolo Wilhelmina Braunschweig Inst Comp & Network Engn D-38106 Braunschweig Germany

ISBN: (纸本)9781457700187

Predicting timing behaviour is essential for the design of embedded real-time systems that can switch between different operational modes at runtime. The settling time of a mode change, called mode change transition latency, is an important system parameter. Known approaches that address the problem of timing analysis for multi-mode real-time systems are restricted to applications without communicating tasks. Also, these assume that transitions are initiated only during a steady state, however, without indicating when a system executes in a steady state. In this paper, we present an analysis algorithm which gives a maximum bound on each mode change transition latency of multi-mode distributed applications thereby overcoming limitations of previous work. We explain the algorithm, prove its correctness, illustrate the steps and provide experimental data that show its usefulness.

关键词： State Change analysis of algorithm system parameter time series analysis Steady state accuracy class embedded real time system operational mode real-time systems

来源：评论

学校读者我要写书评

暂无评论

Decomposing Time Series Data by a Non-negative Matrix Factorization algorithm with Temporally Constrained Coefficients 37

Decomposing Time Series Data by a Non-negative Matrix Factor...

引用

37th Annual International Conference of the IEEE-Engineering-in-Medicine-and-Biology-Society (EMBC)

作者： Cheung, Vincent C. K. Devarajan, Karthik Severini, Giacomo Turolla, Andrea Bonato, Paolo Chinese Univ Hong Kong Sch Biomed Sci Shatin Hong Kong Peoples R China Fox Chase Canc Ctr Philadelphia PA 19111 USA IRCCS San Camillo Hosp Fdn Venice Italy Harvard Univ Sch Med Dept Phys Med & Rehabil Boston MA 02129 USA

ISBN: (纸本)9781424492701

The non-negative matrix factorization algorithm (NMF) decomposes a data matrix into a set of non-negative basis vectors, each scaled by a coefficient. In its original formulation, the NMF assumes the data samples and dimensions to be independently distributed, making it a lessthan-ideal algorithm for the analysis of time series data with temporal correlations. Here, we seek to derive an NMF that accounts for temporal dependencies in the data by explicitly incorporating a very simple temporal constraint for the coefficients into the NMF update rules. We applied the modified algorithm to 2 multi-dimensional electromyographic data sets collected from the human upper-limb to identify muscle synergies. We found that because it reduced the number of free parameters in the model, our modified NMF made it possible to use the Akaike Information Criterion to objectively identify a model order (i.e., the number of muscle synergies composing the data) that is more functionally interpretable, and closer to the numbers previously determined using ad hoc measures.

关键词： NMF Non-negative Matrix Factorization algorithm Temporally Constrained Coefficients NMF protocol time series data Data sampling Nonnegative matrix decomposition analysis of algorithm Akaike Information Criteria (AIC) decomposition

来源：评论

学校读者我要写书评

暂无评论

The analysis of evolutionary optimisation on the TSP(1,2) problem

引用

INTERNATIONAL JOURNAL OF COMPUTATIONAL SCIENCE AND ENGINEERING 2019年第3期18卷 261-268页

作者： Xia, Xiaoyun Lai, Xinsheng Yi, Chenfu Jiaxing Univ Coll Math Phys & Informat Engn Jiaxing 314001 Zhejiang Peoples R China Jiangxi Univ Sci & Technol Sch Informat Engn Ganzhou 341000 Peoples R China Shangrao Normal Univ Sch Math & Comp Sci Shangrao 334001 Peoples R China

TSP(1,2) problem is a special case of the travelling salesperson problem which is NP-hard. Many heuristics including evolutionary algorithms (EAs) are proposed to solve the TSP(1,2) problem. However, we know little about the performance of the EAs for the TSP(1,2) problem. This paper presents an approximation analysis of the (1+1) EA on this problem. It is shown that both the (1+1) EA and (mu+lambda) EA can obtain 3/2 approximation ratio for this problem in expected polynomial runtime O(n(3)) and O ((mu/lambda)n(3) + n), respectively. Furthermore, we prove that the (1+1) EA can provide a much tighter upper bound than a simple ACO on the TSP(1,2) problem.

关键词： evolutionary algorithms TSP(1,2) approximation performance analysis of algorithm computational complexity

来源：评论

学校读者我要写书评

暂无评论

PHILIPPE FLAJOLET 1 December 1948-22 March 2011

引用

COMBINATORICS PROBABILITY & COMPUTING 2011年第5期20卷 647-649页

作者： Salvy, Bruno Sedgewick, Bob Soria, Michele Szpankowski, Wojciech Vallee, Brigitte INRIA Rocquencourt France Princeton Univ Princeton NJ 08544 USA Univ Paris 06 Paris France Purdue Univ W Lafayette IN 47907 USA Univ Caen F-14032 Caen France

Philippe Flajolet, mathematician and computer scientist extraordinaire, the father of analytic combinatorics, suddenly passed away on 22 March 2011, at the prime of his career. He is celebrated for opening new lines of research in the analysis of algorithms, developing powerful new methods, and solving difficult open problems. His research contributions will have an impact for generations, and his approach to research, based on curiosity, discriminating taste, broad knowledge and interests, intellectual integrity, and a genuine sense of camaraderie, will serve as an inspiration to those who knew him, for years to come.

关键词： Computer personnel Curiosity line feed new methods Prime career Combinatorics Fathers analysis of algorithm Histidine

来源：评论

学校读者我要写书评

暂无评论

Ad-hoc Wireless Sensor Network Based Underwater Diffusive Source Localization

Ad-hoc Wireless Sensor Network Based Underwater Diffusive So...

引用

4th International Conference on Intelligent and Advanced Systems (ICIAS) and A Conference of World Engineering, Science and Technology Congress (ESTCON)

作者： Hakim, Kamrul Jayaweera, Sudharman K. El-Howayek, Georges Univ New Mexico Dept Elect & Comp Engn Albuquerque NM 87131 USA

ISBN: (纸本)9781457719677

In this paper, we develop a statistical method for estimating the location of a diffusive source using an ad-hoc network of wireless sensors capable of sensing a diffusive field/environment. In particular, we focus on an underwater oil spill scenario along with statistical algorithms for analysis of sensor data leading to efficient estimation of the parameters of interest. We derive a maximum likelihood (ML) based parametric estimation method for localizing the diffusive source. The Cramer-Rao lower bound (CRLB) for the ML estimator performance is also derived as a measure of the theoretical performance bound. The effectiveness of the proposed method is also shown through numerical simulations.

关键词： Position measurement Underwater Statistical methods Ad hoc networks Sensor Data Parameter estimation based analysis of algorithm

来源：评论

学校读者我要写书评

暂无评论

Phase transitions and complexity in computer science: an overview of the statistical physics approach to the random satisfiability problem

引用

PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS 2002年第1-4期306卷 381-394页

作者： Biroli, G Cocco, S Monasson, R ENS CNRS Phys Theor Lab F-75005 Paris France Rutgers State Univ Dept Phys & Astron Ctr Mat Theory Piscataway NJ 08854 USA Univ Illinois Dept Phys Chicago IL 60607 USA Univ Chicago James Franck Inst Chicago IL 60637 USA

Phase transitions, ubiquitous in condensed matter physics, are encountered in computer science too. The existence of critical phenomena has deep consequences on computational complexity, that is the resolution times of various optimization or decision problems, Concepts and methods borrowed from the statistical physics of disordered and out-of-equilibrium systems shed new light on the dynamical operation of solving algorithms. (C) 2002 Published by Elsevier Science B.V.

关键词： statistical physics phase transitions optimization satisfiability analysis of algorithm

来源：评论

学校读者我要写书评

暂无评论

SEMI-ON-LINE SCHEDULING PROBLEMS FOR MAXIMIZING THE MINIMUM MACHINE COMPLETION TIME

引用

Acta Mathematicae Applicatae Sinica 2001年第1期17卷 107-113页

作者：何勇 Department of Mathematics Zhejiang University Hangzhou China

This paper investigates several different semi-on-line two-machine scheduling problems for maximizing the minimum machine completion time. For each problem, we propose a best possible algorithm.

关键词： On-line analysis of algorithm worst-case analysis

来源：评论

学校读者我要写书评

暂无评论

A unifying look at the Apostolico-Giancarlo string-matching algorithm

引用

Journal of Discrete algorithms 2003年第1期1卷 37-52页

作者： Crochemore, Maxime Hancart, Christophe Lecroq, Thierry Department of Computer Science King's College London Strand London WC2R 2LS United Kingdom IGM (Institut Gaspard-Monge) Université de Marne-la-Vallée 77454 Marne-la-Vallée Cedex 2 France LIFAR (Laboratoire d'Informatique Fondamentale et Appliquée de Rouen) Faculté des Sciences et des Techniques Université de Rouen 76821 Mont-Saint-Aignan Cedex France LIFAR (Laboratoire d'Informatique Fondamentale et Appliquée de Rouen) ABISS (Atelier Biologie Informatique Statistiques Sociolinguistique) Université de Rouen 76821 Mont-Saint-Aignan Cedex France

String matching is the problem of finding all the occurrences of a pattern in a text. We present a new method to compute the combinatorial shift function ("matching shift") of the well-known Boyer-Moore string matching algorithm. This method implies the computation of the length of the longest suffixes of the pattern ending at each position in this pattern. These values constituted an extra-preprocessing for a variant of the Boyer-Moore algorithm designed by Apostolico and Giancarlo. We give here a new presentation of this algorithm that avoids extra preprocessing together with a tight bound of 1.5n character comparisons (where n is the length of the text). © 2003 Elsevier B.V. All rights reserved.

关键词： analysis of algorithm String matching

来源：评论

学校读者我要写书评

暂无评论

A recursive algorithm for computing steady state probabilities

A recursive algorithm for computing steady state probabiliti...

引用

14th World Multi-Conference on Systemics, Cybernetics and Informatics

作者： Valakevicius, Eimutis Snipas, Mindaugas Kaunas Univ Technol Dept Math Res Syst LT-51368 Kaunas Lithuania

ISBN: (纸本)9781934272985

One of the most important problems using Markov chains for modeling of the systems is computation of steady state probabilities. One of three major classes of numerical solution methods of this problem are direct methods, which usually are perceived as variants of Gaussian elimination. In this paper we introduce the embedded chains algorithm, which is a recursive direct algorithm, designed specifically to compute steady state probabilities of Markov chains. We have analytically evaluated run time complexity of embedded chains algorithm for the worst case scenario. We have also introduced the modified embedded chains algorithm and showed that it is effective when infinitesimal generator matrix is very sparse. Empirical run time analysis of the algorithms was performed using infinitesimal generator matrixes with different number of nonzero elements.

关键词： Markov chain steady state probabilities direct methods recursion analysis of algorithm

来源：评论

学校读者我要写书评

暂无评论

Turning an Urban Scene Video into a Cinemagraph 30

Turning an Urban Scene Video into a Cinemagraph

引用

30th IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Yan, Hang Liu, Yebin Furukawa, Yasutaka Washington Univ St Louis MO 63130 USA Tsinghua Univ Beijing Peoples R China

ISBN: (纸本)9781538604571

This paper proposes an algorithm that turns a regular video capturing urban scenes into a high-quality endless animation, known as a Cinemagraph. The creation of a Cinemagraph usually requires a static camera in a carefully configured scene. The task becomes challenging for a regular video with a moving camera and objects. Our approach first warps an input video into the viewpoint of a reference camera. Based on the warped video, we propose effective temporal analysis algorithms to detect regions with static geometry and dynamic appearance, where geometric modeling is reliable and visually attractive animations can be created. Lastly, the algorithm applies a sequence of video processing techniques to produce a Cinemagraph movie. We have tested the proposed approach on numerous challenging real scenes. To our knowledge, this work is the first to automatically generate Cinemagraph animations from regular movies in the wild.

关键词： Videotapes Animation Turning Cameras Cinema Comment algorithms Regular analysis of algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：