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

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： Ákos Zarándy Csaba Rekeczky Peter Szolgay Leon O. Chua Institute for Computer Science and Control of the Hungarian Academy of Sciences (MTA-SZTAKI) Budapest P´zm´ny Péter Catholic University The Faculty of Information Technology Budapest Hungary Eutecus Inc. Berkeley California USA University of California of Berkeley USA

Cellular Neural/Nonlinear Networks (CNN) were invented in 1988, as an easy to implement, easy to program computer architecture for image and signal processing. This initiated intensive international research activities that lead to both theoretical (e.g. universality, stability studies in array dynamics) and experimental results (e.g. cellular sensor-processor chips and cellular algorithms). This overview paper summarizes the history of the CNN research and overviews the current activities in this field. Other areas are also discussed which were fostered by the results of the 25 years of CNN research: memristor architectures and processing, spin-torque oscillator architectures, many-core FPGA processing and industrial vision chips.

关键词： Arrays Neural networks Circuit theory Visualization Very large scale integration

来源：评论

学校读者我要写书评

暂无评论

Dynamic Sensor Allocation Framework for Fault Tolerant Flight control

引用

IFAC Proceedings Volumes 2014年第3期47卷 3477-3482页

作者： Tamás Peni Bálint Vanek Zoltán Szabó József Bokor Institute for Computer Science and Control Hungarian Academy of Sciences (MTA SZTAKI

This paper proposes a novel method for sensor allocation based fault tolerant control. Fault tolerance is achieved with optimal combination of healthy sensor sources while the baseline controller remains unchanged. The measurements are subjected to various sensor dynamics, hence the resulting sensor allocation framework is also dynamic. The proposed approach can fit into a hierarchical fault tolerant control framework, where certain sensor faults are handled by the lower level allocation while more severe faults are handled by controller reconfiguration. The decision of which reconfiguration level has to be initiated in response to a fault is determined by a supervisor unit. The method is demonstrated on the simulation model of the Nasa AirStar test vehicle.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Closed-Loop Applicability of the Sign-Perturbed Sums Method

Closed-Loop Applicability of the Sign-Perturbed Sums Method

引用

IEEE Annual Conference on Decision and control

作者： Balazs Csanad Csaji Erik Weyer Fraunhofer Project Center at MTA SZTAKI: The Institute for Computer Science and Control Hungarian Academy of Sciences Kende utca 13-17 Budapest Hungary H-1111 Department of Electrical and Electronic Engineering Melbourne School of Engineering The University of Melbourne 240 Grattan Street Victoria 3010 Australia

ISBN: (纸本)9781479978878

Sign-Perturbed Sums (SPS) is a non-asymptotic system identification method that can construct confidence regions for general linear systems. It works under mild statistical assumptions, such as symmetric and independent noise terms. The SPS confidence region includes the prediction error estimate (PEM) and, for any finite sample and user-chosen confidence probability, it contains the true system parameter with exactly the given probability. Originally, SPS was introduced for open-loop systems, this paper overviews its applicability in closed-loop setups. The three main PEM approaches of closed-loop identification are addressed: direct, indirect and joint input-output, and it is discussed whether SPS can be applied to construct guaranteed finite sample confidence regions around these PEM estimates. Some parametrization issues are also highlighted and, finally, two numerical experiments are presented demonstrating SPS for closed-loop systems.

关键词： Induction loop systems system parameter Closed loop systems CLOSED LOOP sums Linear system confidence CENTROSYMMETRIC

来源：评论

学校读者我要写书评

暂无评论

DIRECTION SELECTIVE VECTOR FIELD CONVOLUTION FOR CONTOUR DETECTION

DIRECTION SELECTIVE VECTOR FIELD CONVOLUTION FOR CONTOUR DET...

引用

IEEE International Conference on Image Processing

作者： Andrea Manno-Kovacs MTA SZTAKI Institute for Computer Science and Control Budapest Hungary

Active contour methods are widely used for efficient contour detection. This paper proposes a novel contribution for the Harris based Vector Field Convolution (HVFC) method, using the orientation information of feature points in the image by analyzing the gradient information in the small neighborhood. Based on the orientation information, relevant edges are emphasized and an improved edge map is used in the iterative process. The main advantage of the introduced Directional HVFC (DHVFC) method is the ability of exploiting orientation information for increased contour detection accuracy even in case of high curvature boundaries and strong background clutter. The quantitative and qualitative evaluation and comparison with other state-of-the-art methods show that the additional directional information increases the detection performance.

关键词： Vectors Image edge detection Active contours Feature extraction Convolution Clutter Force

来源：评论

学校读者我要写书评

暂无评论

Finding small patterns in permutations in linear time 14

Finding small patterns in permutations in linear time

引用

Annual ACM-Society for Industrial and Applied Mathmatics Symposium on Discrete Algorithms

作者： Sylvain Guillemot Daniel Marx Institute for Computer Science and Control Hungarian Academy of Sciences (MTA SZTAKI)

ISBN: (纸本)9781611973389

Given two permutations σ and π, the Permutation Pattern problem asks if σ is a subpattern of π. We show that the problem can be solved in time 2~(O(l~2log l)), n, where l = |σ| and n = |π|. In other words, the problem is fixed-parameter tractable parameterized by the size of the subpattern to be found. We introduce a novel type of decompositions for permutations and a corresponding width measure. We present a linear-time algorithm that either finds σ as a subpattern of π, or finds a decomposition of π whose width is bounded by a function of |σ|. Then we show how to solve the Permutation Pattern problem in linear time if a bounded-width decomposition is given in the input.

关键词： Permutation subschema

来源：评论

学校读者我要写书评

暂无评论

Energy-aware VM scheduling in IaaS clouds using pliant logic

Energy-aware VM scheduling in IaaS clouds using pliant logic

引用

4th International Conference on Cloud Computing and Services science, CLOSER 2014

作者： Benyi, Attila Dombi, Jozsef Daniel Kertesz, Attila Software Engineering Department University of Szeged 6720 Szeged Dugonics ter 13 Hungary MTA SZTAKI Institute for Computer Science and Control H-1111 Budapest Kende u. 13-17 Hungary

ISBN: (纸本)9789897580192

Cloud Computing is facing an increasing attention nowadays as it is present in many consumer appliances by advertising the illusion of infinite resources towards its customers. Nevertheless it raises severe issues with energy consumption: The higher levels of quality and availability require irrational energy expenditures. This paper proposes a Pliant system based virtual machine scheduling approach for reducing energy consumption of IaaS datacenters. In order to evaluate our proposed solution, we have designed a CloudSim-based simulation environment, and applied real-world traces for the experiments. We show that significant savings can be achieved in energy consumption with our proposed Pliant-based algorithms, and by fine-tuning the parameters of the proposed Pliant strategy, a beneficial trade-off can be set between energy consumption and execution time. Copyright © 2014 SCITEPRESS - science and Technology Publications.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

Aircraft trajectory tracking with large sideslip angles for sense and avoid intruder state estimation

Aircraft trajectory tracking with large sideslip angles for ...

引用

Mediterranean Conference on control and Automation (MED)

作者： Peter Bauer Balint Vanek Tamas Peni Tamas Zsedrovits Borbala Pencz Akos Zarandy Jozsef Bokor Institute for Computer Science and Control Hungarian Academy of Sciences (MTA SZTAKI) Budapest Hungary

ISBN: (纸本)9781479959020

This paper deals with the problem of trajectory tracking and definition in monocular vision based sense and avoid scenarios for small UAVs where the intruder aerial vehicle should be held in camera field of view. After defining effective field of view (EFOV) and introducing its possible calculation tracking of a triangular waveform trajectory by a conventional roll angle based tracker is examined. This results in zero EFOV and so probably impossible sensing and avoidance. In the next step the authors propose a new tracking solution which uses large sideslip angles to hold aircraft roll angle around zero. This way an acceptable EFOV can be provided. Further improvements in EFOV are gained through the definition of a sinusoidal trajectory which gives smoother tracking. All the results are demonstrated with software-in-the-loop simulation data.

关键词： Trajectory Cameras Aircraft Silicon compounds Transient analysis Vehicles Acceleration

来源：评论

学校读者我要写书评

暂无评论

Complexity of Counting Subgraphs: Only the Boundedness of the Vertex-Cover Number Counts

Complexity of Counting Subgraphs: Only the Boundedness of th...

引用

Annual IEEE Symposium on Foundations of computer science

作者： Radu Curticapean Dániel Marx Department of Computer Science Saarland University Institute for Computer Science and Control Hungarian Academy of Sciences (MTA SZTAKI)

For a class C of graphs, #Sub(C) is the counting problem that, given a graph H from C and an arbitrary graph G, asks for the number of subgraphs of G isomorphic to H. It is known that if C has bounded vertex-cover number (equivalently, the size of the maximum matching in C is bounded), then #Sub(C) is polynomial-time solvable. We complement this result with a corresponding lower bound: if C is any recursively enumerable class of graphs with unbounded vertexcover number, then #Sub(C) is #W[1]-hard parameterized by the size of H and hence not polynomial-time solvable and not even fixed-parameter tractable, unless FPT is equal to #W[1]. As a first step of the proof, we show that counting kmatchings in bipartite graphs is #W[1]-hard. Recently, Curticapean [ICALP 2013] proved the #W[1]-hardness of counting k-matchings in general graphs; our result strengthens this statement to bipartite graphs with a considerably simpler proof and even shows that, assuming the Exponential Time Hypothesis (ETH), there is no f(k)*n^o(k/log(k)) time algorithm for counting k-matchings in bipartite graphs for any computable function f. As a consequence, we obtain an independent and somewhat simpler proof of the classical result of Flum and Grohe [SICOMP 2004] stating that counting paths of length k is #W[1]-hard, as well as a similar almost-tight ETH-based lower bound on the exponent.

关键词： Color Bipartite graph Complexity theory Polynomials computer science Context Standards

来源：评论

学校读者我要写书评

暂无评论

Sign-Perturbed Sums (SPS) with Instrumental Variables for the Identification of ARX Systems

Sign-Perturbed Sums (SPS) with Instrumental Variables for th...

引用

IEEE Annual Conference on Decision and control

作者： Valerio Volpe Balazs Cs. Csaji Algo Care Erik Weyer Marco C. Campi Department of Information Engineering University of Brescia Via Branze 38 25123 Brescia Italy Fraunhofer Project Center at the Institute for Computer Science and Control (SZTAKI) Hungarian Academy of Sciences (MTA) Kende utca 13-17 Budapest Hungary H-1111 Department of Electrical and Electronic Engineering Melbourne School of Engineering The University of Melbourne 240 Grattan Street Parkville Melbourne Victoria 3010 Australia

ISBN: (纸本)9781479978878

We propose a generalization of the recently developed system identification method called Sign-Perturbed Sums (SPS). The proposed construction is based on the instrumental variables estimate and, unlike the original SPS, it can construct non-asymptotic confidence regions for linear regression models where the regressors contain past values of the output. Hence, it is applicable to ARX systems, as well as systems with feedback. We show that this approach provides regions with exact confidence under weak assumptions, i.e., the true parameter is included in the regions with a (user-chosen) exact probability for any finite sample. The paper also proves the strong consistency of the method and proposes a computationally efficient generalization of the previously proposed ellipsoidal outer-approximation. Finally, the new method is demonstrated through numerical experiments, using both real-world and simulated data.

关键词： Instruments Approximation algorithms Electronic mail Signal processing algorithms Linear regression Signal processing Standards

来源：评论

学校读者我要写书评

暂无评论

Interoperating Cloud Services for Enhanced Data Management

Interoperating Cloud Services for Enhanced Data Management

引用

IEEE International Conference on Big Data and Cloud Computing (BdCloud)

作者： Attila Kertesz Institute for Computer Science and Control MTA SZTAKI Hungary Software Engineering Department University of Szeged Hungary

Cloud Computing has reached a maturity state and high level of popularity that various Cloud services have become a part of our lives. The Internet of Things provides a way to improve social networking by interdisciplinary efforts that can be effectively supported by Cloud Computing solutions. In this article we propose novel approaches for composing and interoperating Cloud solutions to support IoT functionality. We exemplify how to manage, share and process user data produced by mobile devices in different IaaS clouds.

关键词： Cloud computing Mobile handsets Clouds Internet of things Big data Mobile communication Europe

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：