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

2nd International Workshop on Nonlinear Dynamics and Synchronization (INDS'09)

作者： Kontorovich, V. Lovtchikova, Z. CINVESTAV IPN Mexico DF Commun Sect Dept Elect Engn Av IPN 2508 Mexico City 07360 DF Mexico IPN Mexico City DF Mexico

ISBN: (纸本)9783832279431

A comparative study related to the approximate methods of nonlinear filtering for chaotic signals is presented in this paper. In the following, we considered chaos models given as the output signals of three well known strange attractors: Lorenz, Chua and Rossler. From the Implementation point of view for real time applications of the approximate nonlinear filtering algorithms, the extended Kalman filtering (EKF) could be the most prospective one.

关键词： Nonlinear filtering chaotic signals approximate algorithms

来源：评论

学校读者我要写书评

暂无评论

algorithms for Quantitative-Based Possibilistic Lightweight Ontologies 29th

Algorithms for Quantitative-Based Possibilistic Lightweight ...

引用

29th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems (IEA/AIE)

作者： Benferhat, Salem Boutouhami, Khaoula Khellaf, Faiza Nouioua, Farid Univ Artois Artois Univ CRIL CNRS UMR 8188 F-62307 Lens France Univ Sci & Technol Houari Boumediene RIIMA Bab Ezzouar Algeria Aix Marseille Univ LSIS UMR 7296 Marseille France

ISBN: (纸本)9783319420073;9783319420066

This paper proposes approximate algorithms for computing inconsistency degree and answering instance checking queries in the framework of uncertain lightweight ontologies. We focus on an extension of lightweight ontologies, encoded here in DL-Lite languages, to the product-based possibility theory framework. We provide an encoding of the problem of computing inconsistency degree in product-based possibility DL-Lite as a weighted set cover problem and we use a greedy algorithm to compute an approximate value of the inconsistency degree. We also propose an approximate algorithm for answering instance checking queries in product-based possibilistic DL-Lite. Experimental studies show the good results obtained by both algorithms.

关键词： Lightweight ontologies Possibility theory Product based possibility theory approximate algorithms Set cover problem Instance checking

来源：评论

学校读者我要写书评

暂无评论

On Optimal Control of Discounted Cost Infinite-Horizon Markov Decision Processes Under Local State Information Structures 21st

On Optimal Control of Discounted Cost Infinite-Horizon Marko...

引用

21st IFAC World Congress on Automatic Control - Meeting Societal Challenges

作者： Peng, Guanze Kavitha, Veeraruna Zhu, Quanyan NYU Dept Elect & Comp Engn Brooklyn NY 11201 USA Indian Inst Technol Ind Engn & Operat Res Dept Bombay Maharashtra India

This paper investigates a class of optimal control problems associated with Markov processes with local state information. The decision-maker has only a local access to a subset of a state vector information as often encountered in decentralized control problems in multi-agent systems. Under this information structure, part of the state vector cannot be observed. We leverage ab initio principles and find a new form of Bellman equations to characterize the optimal policies of the control problem under local information structures. The dynamic programming solutions feature a mixture of dynamics associated unobservable state components and the local state-feedback policy based on the observable local information. We further characterize the optimal local-state feedback policy using linear programming methods. To reduce the computational complexity of the optimal policy, we propose an approximate algorithm based on virtual beliefs to find a sub-optimal policy. We show the performance bounds on the sub-optimal solution and corroborate the results with numerical case studies. Copyright (C) 2020 The Authors.

关键词： Partially Observable Markov Decision Process Bellman Equation Linear Programming approximate algorithms Distributed Control

来源：评论

学校读者我要写书评

暂无评论

Answering Why-questions by Exemplars in Attributed Graphs 19

Answering Why-questions by Exemplars in Attributed Graphs

引用

ACM SIGMOD International Conference on Management of Data (SIGMOD)

作者： Namaki, Mohammad Hossein Song, Qi Wu, Yinghui Yang, Shengqi Washington State Univ Pullman WA 99164 USA WeWork Technol Tel Aviv Israel

ISBN: (纸本)9781450356435

This paper studies the problem of answering Why-questions for graph pattern queries. Given a query Q, its answers Q(G) in a graph G, and an exemplar 8 that describes desired answers, it aims to compute a query rewrite Q', such that Q'(G) incorporates relevant entities and excludes irrelevant ones wrt. 8 under a closeness measure. (1) We characterize the problem by Q-Chase. It rewrites Q by applying a sequence of applicable operators guided by 8, and backtracks to derive optimal query rewrite. (2) We develop feasible Q-Chase -based algorithms, from anytime solutions to fixed -parameter approximations to compute query rewrites. These algorithms implement Q -Chase by detecting picky operators at run time, which discriminately enforce 8 to retain answers that are closer to exemplars, and effectively prune both operators and irrelevant matches, by consulting a cache of star patterns (called star views). Using real -world graphs, we experimentally verify the efficiency and effectiveness of Q -Chase techniques and their applications.

关键词： data provenance query by examples query suggestion approximate algorithms why-questions property graphs

来源：评论

学校读者我要写书评

暂无评论

MULTI-LEVEL MODELING AND SIMULATION OF CELL BIOLOGICAL SYSTEMS WITH ML-RULES - A TUTORIAL

MULTI-LEVEL MODELING AND SIMULATION OF CELL BIOLOGICAL SYSTE...

引用

Winter Simulation Conference

作者： Helms, Tobias Maus, Carsten Haack, Fiete Uhrmacher, Adelinde M. Univ Rostock Inst Comp Sci Albert Einstein Strabe 22 D-18059 Rostock Germany German Canc Res Ctr Div Theoret Syst Biol Neuenheimer Feld 280 D-69120 Heidelberg Germany

ISBN: (纸本)9781479974863

Multi-level modeling is concerned with describing a system at different levels of organization and relating their dynamics. ML-Rules is a rule-based language developed for supporting the modeling of cell biological systems. It supports nested rule schemata, the hierarchical dynamic nesting of species, the assignment of attributes and solutions to species at each level, and a flexible definition of reaction rate kinetics. As ML-Rules allows the compact description of rather complex models, means for an efficient execution were developed, e.g., approximate and adaptive algorithms. Experimentation with ML-Rules models is further supported by domain-specific languages for instrumentation and experimentation which have been developed in the context of the modeling and simulation framework JAMES II. A signaling pathway example will illustrate modeling and simulation with ML-Rules.

关键词： bioinformatics cellular biophysics logic programming reaction kinetics JAMES-II modeling-and-simulation framework ML-Rules adaptive algorithms approximate algorithms attribute assignment cell biological system modeling cell biological systems domain-specific languages hierarchical dynamic species nesting multilevel modeling multilevel simulation nested rule schemata reaction rate kinetics rule-based language signaling pathway Adaptation models Biological system modeling Biological systems Computational modeling Context modeling Mathematical model Proteins

来源：评论

学校读者我要写书评

暂无评论

Über eine spezielle lineare 0-1-optimierungsaufgabe

引用

Optimization 1986年第6期17卷 785-791页

作者： Donath, G. Hofstedt, K. Pädagogisehe Hoehschule Halle Sektion Mathematik/Physik Germany

Starting with the empty container problem a special linear 0-1-programming problem is stated. The application of this problem allows the optimal use of the main storage of a computing system in a certain sense. An app... 详细信息

关键词： approximate algorithms Empty container problem Linear 0-1-programming

来源：评论

学校读者我要写书评

暂无评论

Lower Bounds on Near Neighbor Search via Metric Expansion

Lower Bounds on Near Neighbor Search via Metric Expansion

引用

IEEE 51st Annual Symposium on Foundations of Computer Science (FOCS)

作者： Panigrahy, Rina Talwar, Kunal Wieder, Udi Microsoft Research United States

ISBN: (纸本)9780769542447

In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we look at the graph obtained by connecting every pair of points within a certain distance r. We then look at various notions of expansion in this graph relating them to the cell probe complexity of NNS for randomized and deterministic, exact and approximate algorithms. For example if the graph has node expansion Phi then we show that any deterministic t-probe data structure for n points must use space S where (St/n)(t) > Phi. We show similar results for randomized algorithms as well. These relationships can be used to derive most of the known lower bounds in the well known metric spaces such as l1, l2, l infinity, and some new ones, by simply computing their expansion. In the process, we strengthen and generalize our previous results [18]. Additionally, we unify the approach in [18] and the communication complexity based approach. Our work reduces the problem of proving cell probe lower bounds of near neighbor search to computing the appropriate expansion parameter. In our results, as in all previous results, the dependence on t is weak;that is, the bound drops exponentially in l. We show a much stronger (tight) time-space tradeoff for the class of dynamic low contention data structures. These are data structures that supports updates in the data set and that do not look up any single cell too often. A full version of the paper could be found in [19].

关键词： Data Structures Expansion Metric Spaces approximate algorithms approximation theory communication complexity computational complexity data structures dynamic low contention data structures graph graph theory lower bounds metric expansion nearest neighbor search random processes randomized algorithms search problems

来源：评论

学校读者我要写书评

暂无评论

Resource Allocation and Request Handling for User-Aware Content Retrieval in the Cloud 39

Resource Allocation and Request Handling for User-Aware Cont...

引用

39th Annual IEEE Conference on Local Computer Networks (LCN)

作者： Yu, Boyang Pan, Jianping Univ Victoria Dept Comp Sci Victoria BC Canada

ISBN: (纸本)9781479937806

The user-aware content retrieval services are always data-intensive and require much resource to satisfy the user demand, which incurs the high cost of implementation. Considering that they could largely exploit the pay-as-you-go paradigm and the almost unlimited resource pool of the cloud, we investigate the design issues of deploying the services to the cloud in a cost-effective way. We formulate the resource allocation and request handling problem which aims at lowering the deployment cost and guaranteeing the service quality simultaneously. Due to the hardness of obtaining an optimal solution, we design two approximate algorithms with different points of emphasis and analyze their approximation ratios as well. In addition, we discuss the implementation issues in applying the proposed algorithms to the practical systems. Finally, the algorithms are evaluated and validated through both trace-based and synthesized simulations where they show a large improvement in terms of the total system cost.

关键词： resource allocation data placement request handling optimization problem approximate algorithms

来源：评论

学校读者我要写书评

暂无评论

Web User Identification with Fuzzy Fingerprints

Web User Identification with Fuzzy Fingerprints

引用

IEEE International Conference on Fuzzy Systems (FUZZ 2011)

作者： Homem, Nuno Carvalho, Joao Paulo Univ Tecn Lisboa Inst Super Tecn INESC ID P-1000029 Lisbon Portugal

ISBN: (纸本)9781424473175

Fingerprint identification is a well-known technique in forensic sciences. The basic idea of identifying a subject based on a set of features left by the subject actions or behavior can be applied to other domains. Identifying a web user based on a user fingerprint is one such application. This paper considers the problem of extracting fingerprints from web usage logs and matching them with those obtained from a set of known users. It presents an innovative fuzzy fingerprint algorithm based on vector valued fuzzy sets. Used sites are used as base features to create the fingerprint. The assumption is that sites accessed by each user remain approximately stable and are distinctive. The paper presents the proposed algorithm and shows some experimental results that validate the approach. The use of fast and compact algorithms is critical due to the possible huge number of users, and allows this method to be used on near real time.

关键词： component fuzzy fingerprints vector valued fuzzy sets similarity frequent elements approximate algorithms data streams

来源：评论

学校读者我要写书评

暂无评论

Adaptive Filter based Strategy for Data Collection in Wireless Sensor Networks 6

Adaptive Filter based Strategy for Data Collection in Wirele...

引用

2016 IEEE International Conferences on BDCloud/SocialCom/SustainCom 2016

作者： Bi, Ran Sun, Liang Zheng, Xu Tan, Guozhen Dalian Univ Technol Sch Comp Sci & Technol Dalian 116024 Peoples R China Harbin Inst Technol Sch Comp Sci & Technol Harbin 150001 Peoples R China

ISBN: (纸本)9781509039364

Data collection is a fundamental task in many wireless sensor networks applications. It is impracticable to send all sensed data to base station for each sensor node, due to the constraints in communication cost and the bandwidth. Filter can provide sensed data estimation with the error bound guarantee. For given filter [l(i),u(i)] node i sends data if and only if the sensed data is beyond the range of [l(i),u(i)]. The main idea of the filter based approach is to maintain the filters of each node at both sensor node and base station. In this paper, we investigate the adaptive filter based strategy for data collection. The variation of sensed data is modeled as a one-dimensional random walk and the formulas for model parameter estimation are provided. The problem of filter assignment with error bound guarantee is formalized as an optimization problem. A greedy heuristic based algorithm for filter assignment subject to the error bound constraints is proposed, whose time and space complexities are O(n tau/alpha(min)) and O(n) respectively. And a light-weight filter update strategy is provided, when a filter is failure. Experimental results show that our algorithms have better performance in terms of communication cost and expected time of valid filters.

关键词： approximate algorithms Data collection Filter

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：