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

workshop on Engineering applications - international Congress on Engineering, WEA 2015

ISBN: (纸本)9781509002283

The proceedings contain 39 papers. The topics discussed include: path tracking control for an autonomous underwater vehicle;failure modeling in a WDM optical burst switched network;estimation of longitudinal and lateral tire forces in a commercial vehicle;comparative analysis between voltage unbalance definitions;a mixed integer optimization model to design a selective collection routing problem for domestic solid waste;local and global path generation for autonomous vehicles using splines;instrumentation and control of a DC motor through the UBI dots platform;review of NTC 2050 and NFPA 70 on their section dedicated to equipments for electrical vehicles recharge systems;configuration of propagation models for computational simulation of different telecommunications services;prototypes selection based on similarity relations for classification problems;communications system for a soil monitoring network in Valle del Cauca, Colombia;and three-phase multilevel inverter with selective harmonic elimination.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Correctness Analysis and Power optimization for Probabilistic Boolean Circuits

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 2015年第4期34卷 615-628页

作者： Huang, Ching-Yi Yu, Zheng-Shan Hu, Yung-Chun Tsou, Tung-Chen Wang, Chun-Yao Chen, Yung-Chih Natl Tsing Hua Univ Dept Comp Sci Hsinchu 30013 Taiwan Natl Tsing Hua Univ Inst Stat Hsinchu 30013 Taiwan Yuan Ze Univ Dept Comp Sci & Engn Chungli 32003 Taiwan

Traditionally, we expect that circuit designs can be executed without errors. However, for error resilient applications such as image processing, 100% correctness is not necessary. By pursuing less than 100% correctness, power consumption can be significantly reduced. Recently, probabilistic CMOS and probabilistic Boolean circuits (PBCs) have been proposed to deal with power consumption issue. However, to the best of our knowledge, no correctness analysis and power optimization algorithms have been proposed for PBCs. Thus, in this paper, we first propose a statistical approach for evaluating the correctness of PBCs. Then, we propose strategies for power optimization of PBCs. Finally, we integrate these strategies with the correctness analysis as a power optimization algorithm for PBCs. The experimental results show that the proposed correctness analysis method is highly efficient and accurate, and that the power optimization algorithm saves 36% of total power-delay-product on average under a correctness constraint of 90% on a set of international workshop on Logic and Synthesis (IWLS) 2005 benchmarks.

关键词： Analysis logic synthesis low-power design power optimization synthesis for low power

来源：评论

学校读者我要写书评

暂无评论

Joint Power and Spectrum optimization in Wireless Localization Networks

Joint Power and Spectrum Optimization in Wireless Localizati...

引用

IEEE international Conference on Communications (ICC)

作者： Qin, Chuan Song, Liyuan Zhang, Tingting Shen, Yuan Molisch, Andreas F. Zhang, Qinyu Harbin Inst Technol Shenzhen Grad Sch Commun Engn Res Ctr Shenzhen Peoples R China Tsinghua Univ Dept Elect Engn Beijing Peoples R China Univ Southern Calif Dept Elect Engn Los Angeles CA 90089 USA

ISBN: (纸本)9781467363051

Network localization is a key feature in many wireless services and applications. In typical rang-based localization techniques, "agents" try to perform position estimation through ranging with respect to "anchors" with known positions. Based on the definition of squared positional error bound (SPEB), the localization accuracy can be determined by the transmit power, carrier frequency and signal bandwidth, etc. This paper analyzes the joint power and spectrum allocation (JPSA) optimization problems in resource restricted wireless localization systems. We first formulate both interference-free and interference-limited JPSA problems. Since both problems are non-convex, we then develop two approximation algorithms based on single condensation and Taylor linearization. Both algorithms are able to find solutions close the global optimum. Numeric results validate our analysis, and show that, we are able to find optimal resource deployment in wireless localization networks based on the proposed frameworks.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

IDENTIFICATION OF HYBRID SYSTEMS USING STABLE SPLINE KERNELS 25

IDENTIFICATION OF HYBRID SYSTEMS USING STABLE SPLINE KERNELS

引用

IEEE international workshop on Machine Learning for Signal Processing

作者： Pillonetto, Gianluigi Univ Padua Dept Informat Engn I-35100 Padua Italy

ISBN: (纸本)9781467374545

All the approaches for identification of hybrid systems appeared in the literature assume known the model complexity. Widely used models are e.g. piecewise ARX with a priori fixed orders. In addition, the developed algorithms are typically tested only on quite simple systems, e.g. with ARX subsystems of order 1 or at most 2. This is a significant limitation for real applications. Here, we propose a new regularized technique for identification of piecewise affine systems, which we dub the hybrid stable spline algorithm (HSS). HSS exploits the recently introduced stable spline kernel to model the submodels impulse responses as zero-mean Gaussian processes, embedding information on submodels predictor stability. Using the Bayesian interpretation of regularization, the problem of classifying and distributing the data to the subsystems is cast as marginal likelihood optimization. An approximated optimization is performed by a Markov chain Monte Carlo scheme. Then, the stable spline algorithm is used to reconstruct each subsystem. Numerical experiments show that HSS can identify high-order piecewise affine systems, without having exact information on ARX subsystems order.

关键词： Bayes methods Gaussian processes Markov processes Monte Carlo methods continuous systems discrete systems identification optimisation splines (mathematics) stability Bayesian interpretation Gaussian process HSS Markov chain Monte Carlo scheme hybrid stable spline algorithm hybrid system marginal likelihood optimization piecewise affine system submodel predictor stability Indexes Kernel optimization Random variables Splines (mathematics) Bayes methods Markov chain Gaussian processes hybrid systems Markov chain monte carlo methods continuous systems Discrete systems Random variable Monte Carlo technique splines (mathematics) Kernel SUB-SYSTEM Seeds ARX gene

来源：评论

学校读者我要写书评

暂无评论

Toward online virtual network function placement in Software Defined Networks

Toward online virtual network function placement in Software...

引用

international workshop on Quality of Service

作者： Bowu Zhang Jinho Hwang Timothy Wood Marist College IBM T.J Watson Research Center The George Washington University

Network function virtualization (NFV) and Software Defined Networks (SDN) separate and abstract network functions from underlying hardware, creating a flexible virtual networking environment that reduces cost and allows policy-based decisions. One of the biggest challenges in NFV-SDN is to map the required virtual network functions (VNFs) to the underlying hardware in substrate networks in a timely manner. In this paper, we formulate the VNF placement problem via Graph Pattern Matching, with an objective function that can be easily adapted to fit various applications. Previous work only considers off-line VNF placement as it is time consuming to find an appropriate mapping path while considering all software and hardware constraints. To reduce this time, we investigate the feasibility and effectiveness of path-precomputing, where paths are calculated prior to placement. Our approach enables online VNF placement in SDNs, allowing VNF requests to be processed as they arrive. An online placement approach (OPA) is proposed to place VNF requests on substrate networks. To the best of our knowledge, this is the first work in the literature that considers the online chaining VNF placement in SDNs. In addition, we present an application of OPA over cost minimization. Simulation results demonstrate that our online approach provides competitive performance compared with off-line algorithms.

关键词： Substrates Software Hardware optimization Servers Electronic mail

来源：评论

学校读者我要写书评

暂无评论

A Multi-Agent Intelligence Hybrid System Technique for Detection and Defense of DDoS Attacks

A Multi-Agent Intelligence Hybrid System Technique for Detec...

引用

workshop on Computer Architecture, Embedded Systems, SoC, and VLSI/EDA / international Computer Symposium (ICS)

作者： Chen, Hsia-Hsiang Huang, Shih-Kun Natl Chiao Tung Univ Dept Comp Sci Hsinchu Taiwan Natl Chiao Tung Univ Informat Technol Serv Ctr Hsinchu Taiwan

ISBN: (纸本)9781614994848;9781614994831

In the paper, we propose the distributed detection and identification multi-agent system (DDIMAS) framework that is the first attempt to apply in solving distributed denial of service (DDoS) problem. It includes three stages which are information heuristic rule, meta-heuristic algorithm and backward and forward search (BFS) rule, respectively. Moreover, the framework is a flexible architecture that can incorporate into other algorithms or rules to improve the overall performance. From the evaluation design, the experiment results show that our method is with higher detection rate and better accuracy than standard repositories. The proposed framework resolves issues in other swarm optimization algorithms and reveals that the performance of DDIMAS is better than existing methods and the adaptive meta-heuristic algorithm framework outperforms other methods for detecting DDoS attacks.

关键词： distributed denial of service meta-heuristic algorithm swarm optimization algorithm

来源：评论

学校读者我要写书评

暂无评论

optimization of the Hausdorff distance between convex polyhedrons in R3 16

Optimization of the Hausdorff distance between convex polyhe...

引用

16th IFAC workshop on Control applications of optimization, CAO 2015

作者： Ushakov, V.N. Lebedev, P.D. Tarasyev, A.M. Ushakov, A.V. Institute of Mathematics and Mechanics Named after N.N. Krasovskii Ural Branch of the Russian Academy of Sciences S. Kovalevskaya str. 16 Yekaterinburg620990 Russia Ural Federal University Named after B.N. Yeltsin Mira str. 19 620002 Russia

In this article, approximation of sets is under consideration using convex polyhedrons in the three dimensional Euclidean space. In the problem statement, it is necessary to find such disposition of two given polyhedrons A and B that the Hausdorff distance between them obtains the minimal value. Elements of convex analysis, non-smooth analysis, and numerical geometry are used for construction numerical algorithms solving this problem. Numerical algorithms are implemented in the software whose efficiency is demonstrated in applications. © 2015, IFAC Hosting by Elsevier Ltd.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

On optimization of R&D project selection and scheduling 16

On optimization of R&D project selection and scheduling

引用

16th IFAC workshop on Control applications of optimization, CAO 2015

作者： Latipova, Alina T. Southern Ural State University Chelyabinsk Russia

There is discussed the multi-period problem of project selection and scheduling for research and development (R&D) projects. The problem is a NP-hard RCPSP problem with discrete time periods (weeks), available budget constraints, deadlines, interruption of stages and dynamic change of initial data. Due to this peculiarities and the computational complexity, splitting the problem into series of subproblems for each period is proposed. These subproblems can be solved using GPU programming. © 2015, IFAC (international Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Improved algorithm of unsatisfiability-based maximum satisfiability 1

Improved algorithm of unsatisfiability-based maximum satisfi...

引用

1st international workshop on Semantic Technologies, IWOST 2015

作者： Wang, Yiyuan Ouyang, Dantong Zhang, Liming Symbol Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China College of Computer Science and Technology Jilin University Changchun130012 China

Recently, the Maximum Satisfiability (MaxSAT) discovers a rapidly increasing number of practical applications in a wide range of different areas. Unsatisfiability-based MaxSAT algorithms have been put forward aimed at improving the performance of solving MaxSAT problem. In these algorithms, several excellent Boolean Satisfiability (SAT) solvers are employed to iteratively identify unsatisfiable sub-formulas and the additional blocking variables are also applied to relax some of initial clauses or encode Boolean constraints into a CNF formula. Firstly, this paper proposes two novel optimizations to reduce the search space: finding all disjoint unsatisfiable cores with the original clauses removed and no blocking variables added;avoiding generating the largest number of blocking variables' clauses with heuristic strategy. Moreover, in order to reduce the number of satisfying iterations, the partial assignment is introduced into satisfiability-based framework as the tight bound accelerator which could find a smaller number of blocking variables. Experimental results show that the unsatisfiability-based algorithm with these optimizations results in an improved and more effective solver for MaxSAT problem than previous algorithms. In addition, this results in consistent performance gains in most cases and on average 1.5 times speed-up for MaxSAT with state-of-the-art algorithms.

关键词： optimization

来源：评论

学校读者我要写书评

暂无评论

9th international workshop on Frontiers in Algorithmics, FAW 2015

9th International Workshop on Frontiers in Algorithmics, FAW...

引用

9th international workshop on Frontiers in Algorithmics, FAW 2015

ISBN: (纸本)9783319196466

The proceedings contain 32 papers. The special focus in this conference is on Frontiers in Algorithmics. The topics include: On r-gatherings on the line;A new algorithm for intermediate dataset storage in a cloud-based dataflow;efficient computation of the characteristic polynomial of a threshold graph;a fast and practical method to estimate volumes of convex polytopes;social models and algorithms for optimization of contact immunity of oral polio vaccine;generalized leaf removal and belief propagation;a linear time algorithm for ordered partition;machine scheduling with a maintenance interval and job delivery coordination;lower and upper bounds for random mimimum satisfiability problem;on solving systems of diagonal polynomial equations over finite fields;pattern backtracking algorithm for the workflow satisfiability problem with user-independent constraints;on the sound covering cycle problem in paired de bruijn graphs;approximation algorithms for the multilevel facility location problem with linear/submodular penalties;smaller kernels for several FPT problems based on simple observations;parameterized minimum cost partition of a tree with supply and demand;the online storage strategy for automated storage and retrieval system with single open in one dimension;union closed tree convex sets;fast quantum algorithms for least squares regression and statistic leverage scores;a new distributed algorithm for computing a dominating set on grids;approximate model counting via extension rule;improved information set decoding for code-based cryptosystems with constrained memory and truthful strategy and resource integration for multi-tenant data center demand response.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：