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

American Control Conference

作者： Domagoj Tolic Rafael Fierro Faculty of Electrical Engineering and Computing University of Zagreb Zagreb Croatia MARHES Lab Department of Electrical and Computer Engineering University of New Mexico Albuquerque New Mexico 87131-0001 USA

ISBN: (纸本)9781479901777

In this paper, we investigate a decentralized output synchronization problem of heterogeneous linear systems. Motivated by recent results in the literature, we develop a self-triggered output broadcasting policy for the interconnected systems. In other words, each system broadcasts its outputs only when necessary in order to achieve output synchronization. Consequently, the control signal of each system is updated based on currently available (but outdated) information received from the neighbors. These broadcasting time instants adapt to the current communication topology. For a fixed topology, our broadcasting policy yields global exponential output synchronization, and L_p-stable output synchronization in the presence of disturbances. Employing a converse Lyapunov theorem for impulsive systems, we provide an average dwell-time condition that yields disturbance-to-state stable output synchronization in case of switching topology. The proposed approach is applicable to directed and unbalanced communication topologies. Finally, our results are corroborated by numerical simulations.

关键词： literature interconnected interconnected systems

来源：评论

学校读者我要写书评

暂无评论

A comprehensive QoS determination model for Infrastructure-as-a-Service clouds

A comprehensive QoS determination model for Infrastructure-a...

引用

2013 IEEE International Conference on Automation Science and engineering, CASE 2013

作者： Xia, Yunni Zhou, Mengchu Luo, Xin Zhu, Qingsheng Software Theory and Technology Chongqing Key Lab Chongqing University Chongqing 400030 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 201804 China Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ 07102 United States

ISBN: (纸本)9781479915156

Cloud computing is a recently developed new technology for complex systems with massive service sharing, which is different from the resource sharing of the grid computing systems. In a cloud environment, service requests from users go through numerous provider specific steps from the instant it is submitted to when the service is fully delivered. Quality modeling and analysis of clouds are not easy tasks because of the complexity of the provisioning mechanism and the dynamic cloud environment. This study proposes an analytical modelbased approach for quality evaluation of Infrastructure-as-a-Service cloud and consider expected request completion time, rejection probability, and system overhead rate as key QoS metrics. It also features with the modeling of different warming and cooling strategies of machines and the ability to identify the optimal balance between system overhead and performance. © 2013 IEEE.

关键词： Quality control

来源：评论

学校读者我要写书评

暂无评论

Leveraging Performance Counters and Execution Logs to Diagnose Memory-Related Performance Issues

Leveraging Performance Counters and Execution Logs to Diagno...

引用

International Conference on Software Maintenance (ICSM)

作者： Mark D. Syer Zhen Ming Jiang Meiyappan Nagappan Ahmed E. Hassan Mohamed Nasser Parminder Flora Software Analysis and Intelligence Lab Queen's University Canada Department of Electrical Engineering & Computer Science York University Canada Performance Engineering School of Computing BlackBerry Canada

Load tests ensure that software systems are able to perform under the expected workloads. The current state of load test analysis requires significant manual review of performance counters and execution logs, and a high degree of system-specific expertise. In particular, memory-related issues (e.g., memory leaks or spikes), which may degrade performance and cause crashes, are difficult to diagnose. Performance analysts must correlate hundreds of megabytes or gigabytes of performance counters (to understand resource usage) with execution logs (to understand system behaviour). However, little work has been done to combine these two types of information to assist performance analysts in their diagnosis. We propose an automated approach that combines performance counters and execution logs to diagnose memory-related issues in load tests. We perform three case studies on two systems: one open-source system and one large-scale enterprise system. Our approach flags ≤ 0.1% of the execution logs with a precision ≥ 80%.

关键词： Radiation detectors Standards Transient analysis Lifting equipment Memory management Couplings visualization

来源：评论

学校读者我要写书评

暂无评论

Fast $\ell_{1}$-Minimization Algorithms for Robust Face Recognition

引用

IEEE Transactions on Image Processing 2013年第8期22卷 3234-3246页

作者： Allen Y. Yang Zihan Zhou Arvind Ganesh Balasubramanian S. Shankar Sastry Yi Ma Department of Electrical Engineering and Computer Sciences University of California Berkeley CA USA College of Information Sciences and Technology Pennsylvania State University University Park PA USA IBM Research Bangalore India Visual Computing Group Microsoft Research Asia Beijing China

l 1 -minimization refers to finding the minimum l 1 -norm solution to an underdetermined linear system \mbi b = A \mbi x . Under certain conditions as described in compressive sensing theory, the minimum l 1 -norm solution is also the sparsest solution. In this paper, we study the speed and scalability of its algorithms. In particular, we focus on the numerical implementation of a sparsity-based classification framework in robust face recognition, where sparse representation is sought to recover human identities from high-dimensional facial images that may be corrupted by illumination, facial disguise, and pose variation. Although the underlying numerical problem is a linear program, traditional algorithms are known to suffer poor scalability for large-scale applications. We investigate a new solution based on a classical convex optimization framework, known as augmented Lagrangian methods. We conduct extensive experiments to validate and compare its performance against several popular l 1 -minimization solvers, including interior-point method, Homotopy, FISTA, SESOP-PCD, approximate message passing, and TFOCS. To aid peer evaluation, the code for all the algorithms has been made publicly available.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Grand challenges in modeling and simulation: Expanding our horizons 13

Grand challenges in modeling and simulation: Expanding our h...

引用

2013 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation, SIGSIM-PADS 2013

作者： Taylor, Simon J.E. Balci, Osman Cai, Wentong Loper, Margaret L. Nicol, David M. Riley, George ICT Innovation Group Department of Information Systems and Computing Brunel University Uxbridge United Kingdom Department of Computer Science Virginia Tech. Blacksburg VA United States School of Computer Engineering Nanyang Technological University Singapore Singapore Information and Communications Lab. Georgia Tech. Research Institute Atlanta GA United States Information Trust Institute University of Illinois at Urbana-Champaign Urbana-Champaign IL United States School of Electrical and Computer Engineering Georgia Tech. Atlanta GA United States

ISBN: (纸本)9781450319201

There continues to be many advances in the theory and practice of Modeling and Simulation (M&S). However, some of these can be considered as Grand Challenges;issues whose solutions require significant focused effort across a community, sometimes with ground-breaking collaborations with new disciplines. In 2002, the first M&S Grand Challenges Workshop was held in Dagstuhl, Germany, in an attempt to focus efforts on key areas. In 2012, a new initiative was launched to continue these Grand Challenge efforts. Panel members of this third Grand Challenge present their views on M&S Grand Challenges. Themes presented in this panel include M&S Methodology;Agent-based M M&S in Systems engineering;Cyber Systems Modeling;and Network Simulation. © 2013 ACM.

关键词： Life cycle

来源：评论

学校读者我要写书评

暂无评论

Accelerating GPGPU architecture simulation 13

Accelerating GPGPU architecture simulation

引用

Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems

作者： Zhibin Yu Lieven Eeckhout Nilanjan Goswami Tao Li Lizy John Hai Jin Chengzhong Xu Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Shenzhen China ELIS Department Ghent University Ghent Belgium Intelligent Design of Efficient Architectures Lab University of Florida Gainesville USA Department of Electrical and Computer Engineering University of Texas at Austin Austin USA Service Computing Technologies and System Lab/Cluster and Grid Computing Lab HUST Wuhan China Department of Electrical and Computer Engineering Wayne State University Detroit USA

ISBN: (纸本)9781450319003

Recently, graphics processing units (GPUs) have opened up new opportunities for speeding up general-purpose parallel applications due to their massive computational power and up to hundreds of thousands of threads enabled by programming models such as CUDA. However, due to the serial nature of existing micro-architecture simulators, these massively parallel architectures and workloads need to be simulated sequentially. As a result, simulating GPGPU architectures with typical benchmarks and input data sets is extremely time-consuming. This paper addresses the GPGPU architecture simulation challenge by generating miniature, yet representative GPGPU kernels. We first summarize the static characteristics of an existing GPGPU kernel in a profile, and analyze its dynamic behavior using the novel concept of the divergence flow statistics graph (DFSG). We subsequently use a GPGPU kernel synthesizing framework to generate a miniature proxy of the original kernel, which can reduce simulation time significantly. The key idea is to reduce the number of simulated instructions by decreasing per-thread iteration counts of loops. Our experimental results show that our approach can accelerate GPGPU architecture simulation by a factor of 88X on average and up to 589X with an average IPC relative error of 5.6%.

关键词： micro-architecture simulation performance general purpose graphics processing unit (GPGPU)

来源：评论

学校读者我要写书评

暂无评论

Radio tomographic imaging and tracking of stationary and moving people via kernel distance

Radio tomographic imaging and tracking of stationary and mov...

引用

International Symposium on Information Processing in Sensor Networks (IPSN)

作者： Yang Zhao Neal Patwari Jeff M. Phillips Suresh Venkatasubramanian GE Global Research Sensor and Signal Analytics Lab Niskayuna NY USA Department of Electrical and Computer Engineering University of Utah Salt Lake City Utah USA School of Computing University of Utah Salt Lake City Utah USA

Network radio frequency (RF) environment sensing (NRES) systems pinpoint and track people in buildings using changes in the signal strength measurements made by a wireless sensor network. It has been shown that such systems can locate people who do not participate in the system by wearing any radio device, even through walls, because of the changes that moving people cause to the static wireless sensor network. However, many such systems cannot locate stationary people. We present and evaluate a system which can locate stationary or moving people, without calibration, by using kernel distance to quantify the difference between two histograms of signal strength measurements. From five experiments, we show that our kernel distance-based radio tomographic localization system performs better than the state-of-the-art NRES systems in different non line-of-sight environments.

关键词： Educational institutions Abstracts Radio frequency Kernel Histograms Imaging

来源：评论

学校读者我要写书评

暂无评论

VMckpt:lightweight and live virtual machine checkpointing

引用

Science China(Information Sciences) 2012年第12期55卷 2865-2880页

作者： LIU HaiKun 1,JIN Hai 1,LIAO XiaoFei 1,MA Bo 1 & XU ChengZhong 2 1 Services computing Technology and System lab,Cluster and Grid computing lab,School of computer Science and Technology,Huazhong University of Science and Technology,Wuhan 430074,China 2 department of electrical and computer engineering,Wayne State University,Detroit,MI 48202,USA 1. Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China2. Department of Electrical and Computer Engineering Wayne State University Detroit MI [48202 USA

Recent advance of virtualization technology provides a new approach to check-point/restart at the virtual machine(VM) *** contrast to traditional process-level checkpointing,checkpointing at the virtualization layer brings up several advantages,such as compatibility,transparence,flexibility and ***,because the virtualization layer has little semantic knowledge about the operation system and the applications running atop,VM-layer checkpointing requires saving the entire operating system state rather than a single *** overhead may render the approach *** reduce the size of VM checkpoint,in this paper we propose a page eviction scheme and an incremental checkpointing mechanism to avoid saving unnecessary VM pages in the *** keep the system online transparently,we propose a live checkpointing mechanism by saving the memory image in a copy-on-write(COW) *** implement the performance optimization mechanisms in a prototype system,called *** results with a group of representative applications show that our page eviction scheme and incremental checkpointing can significantly reduce the checkpoint file size by up to 87% and shorten the total checkpointing/restart time by a factor of up to 71%,in comparison with the Xens default checkpointing *** observed application downtimes due to checkpointing can be reduced to as small as 300 ms.

关键词： checkpoint/restart copy-on-write page eviction virtual machine

来源：评论

学校读者我要写书评

暂无评论

Utilizing RFID-WSNs for reducing the footprint of the Oil Sands industry

Utilizing RFID-WSNs for reducing the footprint of the Oil Sa...

引用

2012 IEEE Globecom Workshops, GC Wkshps 2012

作者： Al-Fagih, Ashraf Kouche, Ahmad El Oteafy, Sharief Alma'Aitah, Abdallah Telecommunications Research Lab School of Computing Department of Electrical and Computer Engineering Queen's University Kingston ON K7L 3N6 Canada Department of Electrical and Computer Engineering Queen's University Kingston ON K7L 3N6 Canada

ISBN: (纸本)9781467349413

In harsh operational conditions, machines lose components on a frequent basis, causing a significant footprint to the surrounding environment. This affects operational up-time, safety measures and cost effectiveness. This paper proposes the use of an integrated RFID-WSN architecture to reduce the footprint of mining equipment used in the Canadian Oil Sands industry. Sensors and RFID tags provide both identification and positioning data for detecting broken parts from Ground Engaging Tools (GETs), such as huge shovel teeth. A delay-tolerant delivery approach utilizes mobile couriers, placed on loading trucks available in the vicinity, to store and carry data from readers and relays to remote base-stations. Delivering data in such harsh mining environments poses several challenges including power scarcity, vast transmission distances and the lack of an accessible communication infrastructure. We provide a use case to demonstrate how this architecture successfully overcomes these challenges within the harsh industrial environment of the Oil Sands. © 2012 IEEE.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Principal Component Pursuit with reduced linear measurements

Principal Component Pursuit with reduced linear measurements

引用

IEEE International Symposium on Information Theory

作者： Arvind Ganesh Kerui Min John Wright Yi Ma Department of Electrical and Computer Engineering University of Illinois Urbana-Champaign USA Department of Electrical Engineering Columbia University USA Visual Computing Group Microsoft Research Asia China

ISBN: (纸本)9781467325790

In this paper, we study the problem of decomposing a superposition of a low-rank matrix and a sparse matrix when a relatively few linear measurements are available. This problem arises in many data processing tasks such as aligning multiple images or rectifying regular texture, where the goal is to recover a low-rank matrix with a large fraction of corrupted entries in the presence of nonlinear domain transformation. We consider a natural convex heuristic to this problem which is a variant to the recently proposed Principal Component Pursuit. We prove that under suitable conditions, this convex program guarantees to recover the correct low-rank and sparse components despite reduced measurements. Our analysis covers both random and deterministic measurement models.

关键词： Sparse matrices Manganese Matrix decomposition Information theory Linear matrix inequalities Numerical models Robustness

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：