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

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

来源：评论

学校读者我要写书评

暂无评论

Time Slotted Scheduling for Outdoor mmWave Mesh Networks with Performance Guarantee

Time Slotted Scheduling for Outdoor mmWave Mesh Networks wit...

引用

International Conference on Computing, Networking and Communications (ICNC)

作者： Wan, Xili Guan, Xinjie Wang, Jun-Bo Zhao, Miao Nanjing Tech Univ Coll Comp Sci & Technol Nanjing Jiangsu Peoples R China Southeast Univ Natl Mobile Commun Res Lab Nanjing Jiangsu Peoples R China Hong Kong Polytech Univ Dept Comp Hong Kong Hong Kong Peoples R China Univ Kent Sch Engn & Digital Arts Canterbury Kent England

ISBN: (纸本)9781509045884

The 60 GHz millimeter wave (mmWave) has become a promising technology for outdoor mmWave mesh networks. Different from mmWave enabled indoor wireless applications, outdoor mmWave mesh networks have orders of magnitude longer range and smaller transmitter density, which leads to the pseudo-wired feature. To exploit spatial reuse under the pseudo-wired abstraction, we study a frame-based scheduling algorithm for mmWave outdoor mesh networks to minimize the transmission time. By transforming this problem into a minimum weight matching decomposition problem, we propose a graph matching based decomposition algorithm, which not only provides provable performance guarantee but also comes with a lower time complexity than that of previous algorithms. Theoretic proofs for the performance are given and simulations results further validate the superiority of our proposed algorithm.

关键词： outdoor mmWave mesh networks approximate algorithms transmission scheduling graph matching

来源：评论

学校读者我要写书评

暂无评论

Two design problems for the IP/MPLS over WDM networks

Two design problems for the IP/MPLS over WDM networks

引用

5th International Workshop on Design of Reliable Communication Networks (DRCN 2005)

作者： Kubilinskas, E Pióro, M Lund Univ Dept Commun Syst SE-22100 Lund Sweden

ISBN: (纸本)0780394399

Design problems related to the Next Generation Internet core networks can be difficult to solve In an exact way. Hence, for large networks they may require approximate algorithms. The paper considers two optimization problems for off-line design of robust NGI core networks carrying elastic traffic with a two-layer IP/MPLS over WDM architecture. The problems are NP-hard and are formulated as mixed-integer programs. An efficient approximate Iterative method based on separate design of the two layers is proposed for solving the problems;the method Is Illustrated with numerical examples.

关键词： multi-layer network design resilience proportional fairness approximate algorithms

来源：评论

学校读者我要写书评

暂无评论

Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem

引用

Annals of Operations Research 1993年第4期41卷 421-451页

作者： Osman, Ibrahim Hassan Institute of Mathematics and Statistics The University Canterbury CT2 7NF Kent United Kingdom

The vehicle routing problem (VRP) under capacity and distance restrictions involves the design of a set of minimum cost delivery routes, originating and terminating at a central depot, which services a set of customers. Each customer must be supplied exactly once by one vehicle route. The total demand of any vehicle must not exceed the vehicle capacity. The total length of any route must not exceed a pre-specified bound. approximate methods based on descent, hybrid simulated annealing/tabu search, and tabu search algorithms are developed and different search strategies are investigated. A special data structure for the tabu search algorithm is implemented which has reduced notably the computational time by more than 50%. An estimate for the tabu list size is statistically derived. Computational results are reported on a sample of seventeen bench-mark test problems from the literature and nine randomly generated problems. The new methods improve significantly both the number of vehicles used and the total distances travelled on all results reported in the literature. © 1993 J.C. Baltzer AG, Science Publishers.

关键词： approximate algorithms heuristics hybrid algorithms Local search simulated annealing tabu search vehicle routing problem

来源：评论

学校读者我要写书评

暂无评论

Cold Filter: A Meta-Framework for Faster and More Accurate Stream Processing 18

Cold Filter: A Meta-Framework for Faster and More Accurate S...

引用

44th ACM SIGMOD International Conference on Management of Data

作者： Zhou, Yang Yang, Tong Jiang, Jie Cui, Bin Yu, Minlan Li, Xiaoming Uhlig, Steve Peking Univ Beijing Peoples R China Harvard Univ Cambridge MA 02138 USA Queen Mary Univ London London England

ISBN: (纸本)9781450317436

approximate stream processing algorithms, such as Count MM sketch, Space-Saving, etc., support numerous applications in databases, storage systems, networking, and other domains. However, the unbalanced distribution in real data streams poses great challenges to existing algorithms. To enhance these algorithms, we propose a meta-framework, called Cold Filter (CF), that enables faster and more accurate stream processing. Different from existing filters that mainly focus on hot items, our filter captures cold items in the first stage, and hot items in the second stage. Also, existing filters require two-direction communication - with frequent exchanges between the two stages;our filter on the other hand is one-direction - each item enters one stage at most once. Our filter can accurately estimate both cold and hot items, giving it a genericity that makes it applicable to many stream processing tasks. To illustrate the benefits of our filter, we deploy it on three typical stream processing tasks and experimental results show speed improvements of up to 4.7 times, and accuracy improvements of up to 51 times. All source code is made publicly available at Github [1].

关键词： Data streams approximate algorithms Data structures Sketch

来源：评论

学校读者我要写书评

暂无评论

Mobile Phone User Identification with Fuzzy Fingerprints

Mobile Phone User Identification with Fuzzy Fingerprints

引用

7th Biannual Conference of the European-Society-for-Fuzzy-Logic-and-Technology (EUSFLAT)/17th Annual LFA Meeting

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

ISBN: (纸本)9789078677000

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 mobile phone user based on a user fingerprint is one such application. This paper considers the problem of extracting fingerprints from call 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. Call destination numbers are used as base features to create the fingerprint. The assumption is that numbers called 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

来源：评论

学校读者我要写书评

暂无评论

Variants of Spreading Messages

Variants of Spreading Messages

引用

4th International Workshop on algorithms and Computation (WALCOM 2010)

作者： Reddy, T. V. Thirumala Krishna, D. Sai Rangan, C. Pandu Indian Inst Technol Dept Comp Sci & Engn Madras 600036 Tamil Nadu India

ISBN: (纸本)9783642114397

In a distributed computing environment a faulty node could lead other nodes in the system to behave in a faulty manor. An initial set of faults could make all the nodes in the system become faulty. Such a set is called an irreversible dynamo. This is modelled as spreading a message among individuals V in a community G = (V, E) where E represents the acquaintance relation. A particular individual will believe a message if sonic of the individual's acquaintances believe the same and forward the believed messages to its neighbours. We are interested in finding the minimum set of initial individuals to be considered as convinced, called the MIN-SEED, such that every individual in the community is finally convinced. We solve for MIN-SEED on some special classes of graphs and then give an upper bound on the cardinality of the MIN-SEED for arbitrary undirected graphs. We consider some interesting variants of the problem and analyse their complexities and give some approximate algorithms.

关键词： Vertex Cover Bipartite Graphs approximate algorithms Fault Tolerance NP-complete

来源：评论

学校读者我要写书评

暂无评论

NAVIGATE: Explainable Visual Graph Exploration by Examples 19

NAVIGATE: Explainable Visual Graph Exploration by Examples

引用

ACM SIGMOD International Conference on Management of Data (SIGMOD)

作者： Namaki, Mohammad Hossein Song, Qi Wu, Yinghui Washington State Univ Pullman WA 99164 USA

ISBN: (纸本)9781450356435

We demonstrate NAVIGATE, an explaiNAble query engine for VIsual GrAph exploraTion by Examples. NAVIGATE interleaves query rewriting and query answering to help users (1) search graphs without writing complex queries, and (2) understand answers by providing intuitive explanations. Users can visually construct queries and specify missing or unwanted example entities to guide the exploration towards desired answers. NAVIGATE can rewrite queries with answers close to examples, by minimally altering their topological and semantic constraints. Another unique feature is its ability to explain query results by tracing the query manipulation operators that are responsible for transforming the original answers to desirable ones. In addition, NAVIGATE optimizes system response time by referring to dynamically cached star views to reduce both query evaluation and rewriting cost at run time. We also demonstrate its ease-of-use, efficiency, and explainable exploration in applications such as recommendation and knowledge base search.

关键词： approximate algorithms graph query query by example property graphs why-provenance dynamic view management query suggestion

来源：评论

学校读者我要写书评

暂无评论

Decomposing Utility Functions in Bounded Max-Sum for Distributed Constraint Optimization

Decomposing Utility Functions in Bounded Max-Sum for Distrib...

引用

4th Global Congress on Intelligent Systems (GCIS)

作者： Rollon, Emma Larrosa, Javier Univ Politecn Cataluna Dept Llenguatges & Sistemes Informat Barcelona Spain

ISBN: (纸本)9781479928859

Bounded Max-Sum is a message-passing algorithm for solving Distributed Constraint Optimization Problems (DCOP) able to compute solutions with a guaranteed approximation ratio. In this paper we show that the introduction of an intermediate step that decomposes functions may significantly improve its accuracy. This is especially relevant in critical applications (e.g. automatic surveillance, disaster response scenarios) where the accuracy of solutions is of vital importance.

关键词： Distributed constraint optimization problems approximate algorithms decomposition

来源：评论

学校读者我要写书评

暂无评论

Efficient kriging via fast matrix-vector products

Efficient kriging via fast matrix-vector products

引用

2008 IEEE Aerospace Conference

作者： Memarsadeghi, Nargess Raykar, Vikas C. Duraiswami, Ramani Mount, David M. NASA Goddard Space Flight Ctr Code 587 Greenbelt MD 20771 USA Siemens Medical Solut Malvern PA USA Univ Maryland College Pk 20742 MD USA

ISBN: (纸本)9781424414871

Interpolating scattered data points is a problem of wide ranging interest. Ordinary kriging is an optimal scattered data estimator, widely used in geosciences and remote sensing. A generalized version of this technique, called cokriging, can be used for image fusion of remotely sensed data. However, it is computationally very expensive for large data sets. We demonstrate the time efficiency and accuracy of approximating ordinary kriging through the use of fast matrixvector products combined with iterative methods. We used methods based on the fast Multipole methods and nearest neighbor searching techniques for implementations of the fast matrix-vector products.

关键词： geostatistics image fusion kriging approximate algorithms fast multipole methods fast Gauss transform nearest neighbors iterative methods

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：