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

International Conference on Microelectronics, ICM

作者： Paolo Meloni Daniela Loi Gianfranco Deriu Andy D. Pimentel Dolly Saprat Maura Pintort Battista Biggio Oscar Ripolles David Solans Francesco Conti Luca Benini Todor Stefanov Svetlana Minakova Bernhard Moser Natalia Shepeleva Michael Masin Francesca Palumbo Nikos Fragoulis Ilias Theodorakopoulos Department of Electrical and Electronic Engineering University of Cagliari Italy Institute of Informatics University of Amsterdam The Netherlands Pluribus One Italy CA Technologies Spain Integrated Systems Laboratory ETH Zurich Switzerland Institute of Advanced Computer Science Leiden University The Netherlands Software Competence Center Hagenberg Austria IBM Research - Haifa Israel IDEA Lab University of Sassari Italy IRIDA Labs Computer Vision Systems Greece

ISBN: (纸本)9781538681688;9781538681671

The use of Deep Learning (DL) algorithms is increasingly evolving in many application domains. Despite the rapid growing of algorithm size and complexity, performing DL inference at the edge is becoming a clear trend to cope with low latency, privacy and bandwidth constraints. Nevertheless, traditional implementation on low-energy computing nodes often requires experience-based manual intervention and trial-and-error iterations to get to a functional and effective solution. This work presents a computer-aided design (CAD) support for effective implementation of DL algorithms on embedded systems, aiming at automating different design steps and reducing cost. The proposed tool flow comprises capabilities to consider architecture-and hardware-related variables at very early stages of the development process, from pre-training hyperparameter optimization and algorithm configuration to deployment, and to adequately address security, power efficiency and adaptivity requirements. This paper also presents some preliminary results obtained by the first implementation of the optimization techniques supported by the tool flow.

关键词： Tools Inference algorithms Engines computer architecture Computational modeling Microelectronics Training

来源：评论

学校读者我要写书评

暂无评论

Random asynchronous iterations in distributed coordination algorithms

arXiv

引用

arXiv 2018年

作者： Chen, Yao Xia, Weiguo Cao, Ming Lü, Jinhu Department of Computer Science Southwestern University of Finance and Economics Chengdu611130 China School of Control Science and Engineering Dalian University of Technology Dalian116024 China Faculty of Science and Engineering ENTEG University of Groningen Groningen9747 AG Netherlands School of Automation Science and Electrical Engineering State Key Laboratory of Software Development Environment Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University Beijing100191 China Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China

Distributed coordination algorithms (DCA) carry out information processing processes among a group of networked agents without centralized information fusion. Though it is well known that DCA characterized by an SIA (stochastic, indecomposable, aperiodic) matrix generate consensus asymptotically via synchronous iterations, the dynamics of DCA with asynchronous iterations have not been studied extensively, especially when viewed as stochastic processes. This paper aims to show that for any given irreducible stochastic matrix, even non-SIA, the corresponding DCA lead to consensus successfully via random asynchronous iterations under a wide range of conditions on the transition probability. Particularly, the transition probability is neither required to be independent and identically distributed, nor characterized by a Markov chain. Copyright © 2018, The Authors. All rights reserved.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

VFlash: Virtualized Flash for Optimizing the I/O Performance in Mobile Devices

VFlash: Virtualized Flash for Optimizing the I/O Performance...

引用

作者： Chen, Renhai Wang, Yi Hu, Jingtong Liu, Duo Shao, Zili Guan, Yong Beijing Advanced Innovation Center for Imaging Technology Beijing100048 China College of Information Engineering Capital Normal University Beijing China College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China School of Electrical and Computer Engineering Oklahoma State University StillwaterOK74074 United States College of Computer Science Chongqing University Chongqing400044 China Embedded Systems and CPS Laboratory Department of Computing Hong Kong Polytechnic University Hong Kong

I/O is becoming one of major performance bottlenecks in NAND-flash-based mobile devices. Novel nonvolatile memories (NVMs), such as phase change memory and spin-transfer torque random access memory, can provide fast read/write operations. In this paper, we propose a unified NVM/flash architecture to improve the I/O performance. A transparent scheme, virtualized flash (vFlash), is also proposed to manage the unified architecture. Within vFlash, interapp and intra-app techniques are proposed to optimize the application performance by exploiting the historical locality and I/O access patterns of applications. Since vFlash is on the bottom of the I/O stack, the application features will be lost. Therefore, we also propose a cross-layer technique to transfer the application information from the application layer to the vFlash layer. The proposed scheme is evaluated based on an Android platform, and the experimental results show that the proposed scheme can effectively improve the I/O performance of mobile devices. © 1982-2012 IEEE.

关键词： Phase change memory

来源：评论

学校读者我要写书评

暂无评论

A Pattern Division Multiple Access Scheme with Low Complexity Iterative Receiver for 5G Wireless Communication systems

A Pattern Division Multiple Access Scheme with Low Complexit...

引用

IEEE Vehicular Technology Conference

作者： Kai Zhang Jin Xu Changchuan Yin Chunyu Pan Weiqiang Tan Guixian Xu Beijing University of Posts and Telecommunications Beijing Key Laboratory of Network System Architecture and Convergence Beijing 100876 P. R. China Zhengzhou University of Light Industry School of Computer and Communication Engineering Zhengzhou 450001 P. R. China Guangzhou University School of Computer Science and Educational Software Guangzhou 510006 P. R. China Aalborg University Department of Electronic Systems Aalborg 9400 Denmark

ISBN: (纸本)9781538663592;9781538663585

Non-orthogonal multiple access schemes with higher spectral efficiency and the capability of accessing more users than orthogonal multiple access (OMA) scheme is preferred for the fifth generation (5G) wireless networks. In this work, a non-orthogonal transmission scheme called pattern division multiple access (PDMA) is proposed for the 5G wireless communication systems. Two pattern matrices are proposed for 150% and 200% overloaded PDMA systems. Then, a low complexity symbol-wise belief propagation iterative detection and decoding (BPIDD) algorithm for multiple user detection is proposed. Numerical results and analysis provided by utilizing extrinsic information transfer chart show that the proposed scheme outperforms the traditional OMA systems significantly, and the performance of the proposed scheme is better than that of the existing schemes up to 1 dB. Finally, simulation results show that the proposed scheme is superior to the existing schemes and the proposed BPIDD algorithm is better than that of the BP algorithm over 0.5 dB.

关键词： 5G mobile communication iterative decoding matrix algebra multi-access systems multiuser detection Multi access systems matrix algebra Multiuser detection Iterative decoding multiple access Wireless communication systems Scheme iterative receiver spectral efficiency Information Transfer

来源：评论

学校读者我要写书评

暂无评论

Joint product numerical range and geometry of reduced density matrices

引用

science China(Physics,Mechanics & Astronomy) 2017年第2期60卷 9-17页

作者： Jianxin Chen Cheng Guo Zhengfeng Ji Yiu-Tung Poon Nengkun YU Bei Zeng Jie Zhou Joint Center for Quantum Information and Computer Science University of Maryland College Park 20740 USA Institute for Advanced Study Tsinghua University Beijing 100084 China Centre for Quantum Computation ＆ Intelligent Systems School of Software Faculty of Engineering and Information Technology University of Technology Sydney Sydney 2007 Australia State Key Laboratory of Computer Science.Institute of Software Chinese Academy of Sciences Beijing 100084 China Department of Mathematics Iowa State University Ames 50011-2140 USA Institute for Quantum Computing University of Waterloo Waterloo N2L 3G1 Canada Department of Mathematics ＆ Statistics University of Guelph Guelph N1G 2 W1 Canada Perimeter Institute for Theoretical Physics Waterloo N2L 2Y5 Canada

The reduced density matrices of a many-body quantum system form a convex set, whose three-dimensional projection is convex in R3. The boundary of may exhibit nontrivial geometry, in particular ruled surfaces. Two physical mechanisms are known for the origins of ruled surfaces： symmetry breaking and gapless. In this work, we study the emergence of ruled surfaces for systems with local Hamiltonians in infinite spatial dimension, where the reduced density matrices are known to be separable as a consequence of the quantum de Finetti＇s theorem. This allows us to identify the reduced density matrix geometry with joint product numerical range II of the Hamiltonian interaction terms. We focus on the case where the interaction terms have certain structures, such that a ruled surface emerges naturally when taking a convex hull of ∏. We show that, a ruled surface on sitting in ∏ has a gapless origin, otherwise it has a symmetry breaking origin. As an example, we demonstrate that a famous ruled surface, known as the oloid, is a possible shape of , with two boundary pieces of symmetry breaking origin separated by two gapless lines.

关键词： reduced density matrices quantum tomography numerical range quantum information oloid ruled surface

来源：评论

学校读者我要写书评

暂无评论

Physical origins of ruled surfaces on the reduced density matrices geometry

引用

science China(Physics,Mechanics & Astronomy) 2017年第2期60卷 1-8页

作者： Ji-Yao Chen Zhengfeng Ji Zheng-Xin Liu Xiaofei Qi Nengkun Yu Bei Zeng Duanlu Zhou State Key Laboratory of Low Dimensional Quantum Physics Department of Physics Tsinghua University Beijing 100084 China Perimeter Institute for Theoretical Physics Waterloo N2L 2Y5 Canada Centre for Quantum Computation ＆ Intelligent Systems School of Software Faculty of Engineering and Information Technology University of Technology Sydney Sydney 2007 Australia State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing 100190 China Department of Physics Renmin University of China Beijing 100872 China Department of Mathematics Shanxi University Taiyuan 030000 China Institute for Quantum Computing University of Waterloo Waterloo N2L 3G1 Canada Department of Mathematics ＆ Statistics University of Guelph Guelph N1G 2W1 Canada Institute of Physics Chinese Academy of Sciences Beijing 100190 China

The reduced density matrices （RDMs） of many-body quantum states form a convex set. The boundary of low dimensional projections of this convex set may exhibit nontrivial geometry such as ruled surfaces. In this paper, we study the physical origins of these ruled surfaces for bosonic systems. The emergence of ruled surfaces was recently proposed as signatures of symmetry- breaking phase. We show that, apart from being signatures of symmetry-brealdng, ruled surfaces can also be the consequence of gapless quantum systems by demonstrating an explicit example in terms of a two-mode Ising model. Our analysis was largely simplified by the quantum de Finetti＇s theorem--in the limit of large system size, these RDMs are the convex set of all the symmetric separable states. To distinguish ruled surfaces originated from gapless systems from those caused by symmetry- breaking, we propose to use the finite size scaling method for the corresponding geometry. This method is then applied to the two-mode XY model, successfully identifying a ruled surface as the consequence of gapless systems.

关键词： ruled surfaces reduced density matrices bosonic system geometry

来源：评论

学校读者我要写书评

暂无评论

Bayesian Modeling of COTS Power MOSFET Ionizing Dose Impact on Circuit Response

Bayesian Modeling of COTS Power MOSFET Ionizing Dose Impact ...

引用

European Conference on Radiation and its Effects on Components and systems (RADECS)

作者： A. F. Witulski M. B. Smith N. Mahadevan A. L. Sternberg C. Barnes D. Sheldon R. D. Schrimpf G. Karsai M. W. McCurdy Department of Electrical Engineering and Computer Science Vanderbilt University USA Department of Electrical Engineering and Computer Science Vanderbilt University Nashville CA Office of Safety and Mission Success Jet Propulsion Laboratory 4800 Oak Grove Drive Pasadena USA Institute for Software Integrated Systems at Vanderbilt University

Threshold voltage variation with ionizing dose was measured for a commercial power MOSFET. Variation of radiation response was captured using a Bayesian linear model, which enabled a Monte Carlo simulation of variatio... 详细信息

ISBN: (纸本)9781538612620;9781538612613

关键词： Threshold voltage Semiconductor device modeling Bayes methods Integrated circuit modeling MOSFET Degradation

来源：评论

学校读者我要写书评

暂无评论

Improving missing issue-commit link recovery using positive and unlabeled data 17

Improving missing issue-commit link recovery using positive ...

引用

IEEE International Conference on Automated software engineering (ASE)

作者： Yan Sun Celia Chen Qing Wang Barry Boehm Laboratory for Internet Software Technologies State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing P.R. China University of Chinese Academy of Sciences Beijing P.R. China Department of Computer Science Occidental College Los Angeles CA Center for Systems and Software Engineering University of Southern California Los Angeles USA

ISBN: (纸本)9781538626849

Links between issue reports and corresponding fix commits are widely used in software maintenance. The quality of links directly affects maintenance costs. Currently, such links are mainly maintained by error-prone manual efforts, which may result in missing links. To tackle this problem, automatic link recovery approaches have been proposed by building traditional classifiers with positive and negative links. However, these traditional classifiers may not perform well due to the inherent characteristics of missing links. Positive links, which can be used to build link recovery model, are quite limited as the result of missing links. Since the construction of negative links depends on the number of positive links in many existing approaches, the available negative links also become restricted. In this paper, we point out that it is better to consider the missing link problem as a model learning problem by using positive and unlabeled data, rather than the construction of traditional classifier. We propose PULink, an approach that constructs the link recovery model with positive and unlabeled links. Our experiment results show that compared to existing state-of-the-art technologies built on traditional classifier, PULink can achieve competitive performance by utilizing only 70% positive links that are used in those approaches.

关键词： Feature extraction Indexes Metadata Training software maintenance

来源：评论

学校读者我要写书评

暂无评论

Understanding feature requests by leveraging fuzzy method and linguistic analysis 17

Understanding feature requests by leveraging fuzzy method an...

引用

IEEE International Conference on Automated software engineering (ASE)

作者： Lin Shi Celia Chen Qing Wang Shoubin Li Barry Boehm Laboratory for Internet Software Technologies Institute of Software Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China Department of Computer Science Occidental College Los Angeles CA Center for Systems and Software Engineering University of Southern California Los Angeles USA State Key Laboratory of Computer Sciences Institute of Software Chinese Academy of Sciences Beijing China

ISBN: (纸本)9781538626849

In open software development environment, a large number of feature requests with mixed quality are often posted by stakeholders and usually managed in issue tracking systems. Thoroughly understanding and analyzing the real intents that feature requests imply is a labor-intensive and challenging task. In this paper, we introduce an approach to understand feature requests automatically. We generate a set of fuzzy rules based on natural language processing techniques that classify each sentence in feature requests into a set of categories: Intent, Explanation, Benefit, Drawback, Example and Trivia. Consequently, the feature requests can be automatically structured based on the classification results. We conduct experiments on 2,112 sentences taken from 602 feature requests of nine popular open source projects. The results show that our method can reach a high performance on classifying sentences from feature requests. Moreover, when applying fuzzy rules on machine learning methods, the performance can be improved significantly.

关键词： Pragmatics software Terminology Semantics Syntactics Natural language processing Learning systems

来源：评论

学校读者我要写书评

暂无评论

Fusing R Features and Local Features with Context-Aware Kernels for Action Recognition

引用

International Journal of computer Vision 2016年第2期118卷 151-171页

作者： Yuan, Chunfeng Wu, Baoxin Li, Xi Hu, Weiming Maybank, Stephen Wang, Fangshi National Laboratory of Pattern Recognition Institute of Automation CAS Beijing China College of Computer Science and Technology Zhejiang University Hangzhou China Department of Computer Science and Information Systems Birkbeck College London United Kingdom School of Software Engineering Beijing Jiaotong University Beijing China

The performance of action recognition in video sequences depends significantly on the representation of actions and the similarity measurement between the representations. In this paper, we combine two kinds of features extracted from the spatio-temporal interest points with context-aware kernels for action recognition. For the action representation, local cuboid features extracted around interest points are very popular using a Bag of Visual Words (BOVW) model. Such representations, however, ignore potentially valuable information about the global spatio-temporal distribution of interest points. We propose a new global feature to capture the detailed geometrical distribution of interest points. It is calculated by using the 3D R transform which is defined as an extended 3D discrete Radon transform, followed by the application of a two-directional two-dimensional principal component analysis. For the similarity measurement, we model a video set as an optimized probabilistic hypergraph and propose a context-aware kernel to measure high order relationships among videos. The context-aware kernel is more robust to the noise and outliers in the data than the traditional context-free kernel which just considers the pairwise relationships between videos. The hyperedges of the hypergraph are constructed based on a learnt Mahalanobis distance metric. Any disturbing information from other classes is excluded from each hyperedge. Finally, a multiple kernel learning algorithm is designed by integrating the l2 norm regularization into a linear SVM classifier to fuse the R feature and the BOVW representation for action recognition. Experimental results on several datasets demonstrate the effectiveness of the proposed approach for action recognition. © 2015, Springer science+Business Media New York.

关键词： Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：