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

32nd Conference on Uncertainty in Artificial Intelligence 2016, UAI 2016

作者： Du, Changying Du, Changde Long, Guoping He, Qing Li, Yucheng Beijing100190 China Key Lab of Intelligent Information Processing of CAS Institute of Computing Technology CAS Beijing100190 China Key Laboratory of Optical Astronomy National Astronomical Observatories CAS Beijing100012 China University of Chinese Academy of Sciences Beijing100049 China

ISBN: (纸本)9781510827806

Bipartite ranking aims to maximize the area under the ROC curve (AUC) of a decision function. To tackle this problem when the data appears sequentially, existing online AUC maximization methods focus on seeking a point estimate of the decision function in a linear or predefined single kernel space, and cannot learn effective kernels automatically from the streaming data. In this paper, we first develop a Bayesian multiple kernel bipartite ranking model, which circumvents the kernel selection problem by estimating a posterior distribution over the model weights. To make our model applicable to streaming data, we then present a kernelized online Bayesian passive-aggressive learning framework by maintaining a variational approximation to the posterior based on data augmentation. Furthermore, to efficiently deal with large-scale data, we design a fixed budget strategy which can effectively control online model complexity. Extensive experimental studies confirm the superiority of our Bayesian multi-kernel approach.

关键词： Budget control

来源：评论

学校读者我要写书评

暂无评论

Real-Time Task Scheduling for Joint Energy Efficiency Optimization in Data Centers

Real-Time Task Scheduling for Joint Energy Efficiency Optimi...

引用

IEEE Symposium on Computers and Communications

作者： Youshi Wang Fa Zhang Rui Wang Yangguang Shi Hua Guo Zhiyong Liu Chinese Academy of Sciences (CAS) Institute of Computing Technology (ICT) Beijing China University of Chinese Academy of Sciences Beijing China ICT Key Laboratory of Intelligent Information Processing Beijing China Hong Kong University of Science and Technology Hong Kong China Technion - Israel Institute of Technology Haifa Israel State Grid Jingzhou Electric Power Company Jingzhou Hubei China ICT State Key Laboratory for Computer Architecture Beijing China

The high energy consumption has become one bottleneck in the development of the data centers (DCs), where the main energy consumers are the cooling system and the servers. Therefore, the joint optimization for the energy efficiency of the cooling system and the servers is a crucial problem, while most of previous works on energy saving only studies one of these two components in an isolated manner. In this paper, we propose a real-time strategy, rTCS (real-time Task Classification and Scheduling strategy), to jointly optimize the energy efficiency of these two components in the scenario where the tasks arrive dynamically. Strategy rTCS first labels the tasks to classify them according to their run time and end time with a time complexity of O(1) and a bounded space complexity. Then, rTCS schedules the tasks in real time based on their labels and the energy consumption model of the DC. Simulation results show that rTCS can effectively improve the energy efficiency of DCs.

关键词： Energy efficiency Data center Cooling system Task classification Real-time scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

The sound and complete R-calculus for revising propositional theories

引用

Science China(information Sciences) 2015年第9期58卷 5-16页

作者： LI Wei SUI YueFei SUN MeiYing State Key Laboratory of Software Development Environment Beihang University Key Laboratory of Intelligent Information Processing Institute of Computing TechnologyChinese Academy of Sciences University of Chinese Academy of Sciences

The AGM postulates are for the belief revision(revision by a single belief), and the DP postulates for the iterated revision(revision by a finite sequence of beliefs). Li gave an R-calculus for R-configurations?|Γ,where ? is a set of atomic formulas or the negations of atomic formulas, and Γ is a finite set of formulas. In this paper, two deduction systems for the revision of a theory by another theory are given such that the systems are sound and complete, that is, if ?|Γ■Γ′ is provable then Γ′■ ? is consistent and Γ′- ? is a maximal subset of Γ such that(Γ′- ?) ∪ ? is consistent; and for any finite theories ? and Γ, there is a finite theoryΓ′ such that Γ′- ? is a maximal subset of Γ such that(Γ′- ?) ∪ ? is consistent, and ?|Γ ? Γ′ is ***, if?|Γ■Γ′ is provable then Γ′ satisfies the AGM and the DP postulates.

关键词： belief revision R-calculus minimal change the AGM postulates the DP postulates

来源：评论

学校读者我要写书评

暂无评论

A New Acquisition Method Based on Differential Correlation

A New Acquisition Method Based on Differential Correlation

引用

2016 8th IEEE International Conference on Communication Software and Networks(ICCSN 2016)

作者： Sujuan Shang Yanjun Hu Jufeng Luo Yingguan Wang Key laboratory of Intelligent Computing & Signal Processing (Anhui University) Ministry of Education Shanghai Institute of Microsystem and Information Technology Chinese Academy of Sciences

Acquisition is a key technology in DSSS *** differential correlation is usually employed to eliminate the effect of frequency ***,as the length of pseudo-code grows and the decrease of the SNR,the traditional differential acquisition algorithms will result in great loss of *** paper presents an improved differential acquisition method,named as M-orders Auto-Correlation based on Differential correlation（MAC-DF）.In the proposed method,the input signal is multiplied by the complex conjugate of the pseudo-code to eliminate its *** that,the product is applied to the M-orders Auto-Correlation to compensate the SNR loss caused by the differential *** means of mathematical model to analyze its acquisition *** compare MAC-DF acquisition algorithm with the differential coherent and non-coherent acquisition algorithms through *** simulation results indicate that this algorithm is approximately 5-6dB superior to the traditional differential acquisition algorithms in improving acquisition sensitivity and more adaptive to work under low SNR.

关键词： DSSS Pseudo-code acquisition low SNR differential correlation acquisition algorithm

来源：评论

学校读者我要写书评

暂无评论

The comparison between optical and homogeneous pumping with FDTD method

The comparison between optical and homogeneous pumping with ...

引用

IEEE International Conference on Computational Electromagnetics (ICCEM)

作者： Kaikun Niu Fang Ming Zhixiang Huang Bo Wu Lihua Wang Xianliang Wu Key Laboratory of Intelligent Computing and Signal Processing Anhui University Hefei China School of Electronic and Information Engineering Hefei Normal University Hefei China

The finite-difference time-domain (FDTD) method is proposed to model Maxwell-Bloch equations with a four-level quantum system for investigating the nano-structures incorporated with gain materials. To understand the lasing behavior and loss compensation mechanism of the gain material, a self-consistent computational scheme is presented. Comparisons between optical and homogeneous Pumping are given. Our self-consistent computational scheme can be used to design new loss-compensation structures with metamaterials.

关键词： Slabs Optical pumping Mathematical model Metamaterials Stimulated emission Finite difference methods

来源：评论

学校读者我要写书评

暂无评论

UNSUPERVISED PERSON RE-IDENTIFICATION WITH LOCALITY-CONSTRAINED EARTH MOVER'S DISTANCE

UNSUPERVISED PERSON RE-IDENTIFICATION WITH LOCALITY-CONSTRAI...

引用

IEEE International Conference on Image processing

作者： Dan Wang Canxiang Yan Shiguang Shan Xilin Chen Key Laboratory of Intelligent Information Processing of Chinese Academy of Sciences (CAS) Institute of Computing Technology CAS Institute of Deep Learning Baidu Inc.

ISBN: (纸本)9781467399623

The difficult acquisition of labeled data and the misalignment of local matching are major obstacles to apply person re-identification in real scenarios. To alleviate these problems, we propose an unsupervised method, called locality-constrained Earth Mover's Distance (LC-EMD), to learn the optimal measure between image pairs. Specifically, Gaussian mixture models (GMMs) are learned as signatures. By imposing locality constraints, LC-EMD can naturally achieve partial matching between Gaussian components. Moreover, LC-EMD has the analytical solution which can be efficiently computed. Experiments on two public datasets demonstrate LC-EMD is robust to misalignment and performs better than other unsupervised methods.

关键词： Identification of persons Distance learning Gaussian mixture model Distance learning Misalignment Mixture models EARTHMOVER

来源：评论

学校读者我要写书评

暂无评论

Ranking Node Influence in Social Networks

Ranking Node Influence in Social Networks

引用

International Symposium on Parallel and Distributed computing

作者： Zheyi Chen Yuli Liu Weiping Zhu Department of Computer Science National Laboratory for Information Science and Technology Beijing China College of Mathematics and Computer Science Fujian Provincial Key Laboratory of Networking Computing and Intelligent Information Processing Fuzhou China

ISBN: (纸本)9781509041534

In the study of social networks, analyzing node influence and identifying influential nodes in social networks is of great theoretical and practical significance. To effectively evaluate node influence, a novel concept of influence label is introduced, which can measure node influence through two label attributes called influence level and node degree. Then, a novel influence model called LDM (Level and Degree Model) is proposed. LDM updates the influence label of each node iteratively by the quality of neighbors and the number of neighbors. A gain function that conforms to power-law distribution is also introduced to further optimize the accuracy of LDM. In the experiment part, to prove the effectiveness of LDM, LDM is compared with other typical methods by employing IC model to simulate the information diffusion process on four real-world social networks. Experimental results show that LDM can rank node influence more accurately than other methods.

关键词： social networking (online) CYP51A1 gene LDM Social Networks Line of nodes Social Capital

来源：评论

学校读者我要写书评

暂无评论

A local-optimization refinement algorithm in single particle analysis for macromolecular complex with multiple rigid modules

引用

Protein & Cell 2016年第1期7卷 46-62页

作者： Hong Shan Zihao wang Fa Zhang Yong Xiong Chang-Cheng Yin Fei Sun Department of Biophysics College of Basic Medical Sciences Peking University Health Science Center Beijing 100191China National Laboratory of Biomacromolecules Institute of Biophysics Chinese Academy of Sciences Beijing 100101 China Key Lab of Intelligent Information Processing and Advanced Computing Research Lab Institute of Computing TechnologyChinese Academy of Sciences Beijing 100190 China University of Chinese Academy of Sciences Beijing 100049 China Department of Molecular Biophysics and Biochemistry Yale University New Haven CT 06511 USA Center for Biological Imaging Institute of Biophysics Chinese Academy of Sciences Beijing 100101 China

Single particle analysis, which can be regarded as an average of signals from thousands or even millions of particle projections, is an efficient method to study the three-dimensional structures of biological macro- molecules. An intrinsic assumption in single particle analysis is that all the analyzed particles must have identical composition and conformation. Thus specimen heterogeneity in either composition or conformation has raised great challenges for high-resolution analysis. For particles with multiple conformations, inaccurate align- ments and orientation parameters will yield an averaged map with diminished resolution and smeared density. Besides extensive classification approaches, here based on the assumption that the macromolecular complex is made up of multiple rigid modules whose relative orien- tations and positions are in slight fluctuation around equilibriums, we propose a new method called as local optimization refinement to address this conformational heterogeneity for an improved resolution. The key idea is to optimize the orientation and shift parameters of each rigid module and then reconstruct their three-dimen- sional structures individually. Using simulated data of 80S/70S ribosomes with relative fluctuations between the large （60S/50S） and the small （40S/30S） subunits, we tested this algorithm and found that the resolutions of both subunits are significantly improved. Our method provides a proof-of-principle solution for high-resolutionsingle particle analysis of macromolecular complexes with dynamic conformations.

关键词： cryo-electron microscopy single particleanalysis conformational heterogeneity rigid module Iocaoptimization refinement

来源：评论

学校读者我要写书评

暂无评论

From standard alpha-stable Lévy motions to horizontal visibility networks: dependence of multifractal and Laplacian spectrum

引用

Journal of Statistical Mechanics: Theory and Experiment 2018年第5期2018卷

作者： Hai-Long Zou Zu-Guo Yu Vo Anh Yuan-Lin Ma Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education and Hunan Key Laboratory for Computation and Simulation in Science and Engineering Xiangtan University Hunan 411105 People's Republic of China School of Electrical Engineering and Computer Science Queensland University of Technology GPO Box 2434 Brisbane Q4001 Australia Author to whom any correspondence should be addressed. School of Mathematical Sciences Queensland University of Technology GPO Box 2434 Brisbane Q4001 Australia

In recent years, researchers have proposed several methods to transform time series (such as those of fractional Brownian motion) into complex networks. In this paper, we construct horizontal visibility networks (HVNs) based on the -stable Lévy motion. We aim to study the relations of multifractal and Laplacian spectrum of transformed networks on the parameters and of the -stable Lévy motion. First, we employ the sandbox algorithm to compute the mass exponents and multifractal spectrum to investigate the multifractality of these HVNs. Then we perform least squares fits to find possible relations of the average fractal dimension , the average information dimension and the average correlation dimension against using several methods of model selection. We also investigate possible dependence relations of eigenvalues and energy on , calculated from the Laplacian and normalized Laplacian operators of the constructed HVNs. All of these constructions and estimates will help us to evaluate the validity and usefulness of the mappings between time series and networks, especially between time series of -stable Lévy motions and HVNs.

关键词：

来源：评论

学校读者我要写书评

暂无评论

XGRouter： high-quality global router in X-architecture with particle swarm optimization

引用

Frontiers of Computer Science 2015年第4期9卷 576-594页

作者： Genggeng LIU Wenzhong GUO Rongrong LI Yuzhen NIU Guolong CHEN College of Mathematics and Computer Science Fuzhou University Fuzhou 350116 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou 350116 China

This paper presents a high-quality very large scale integration （VLSI） global router in X-architecture, called XGRouter, that heavily relies on integer linear pro- gramming （ILP） techniques, partition strategy and particle swarm optimization （PSO）. A new ILP formulation, which can achieve more uniform routing solution than other formu- lations and can be effectively solved by the proposed PSO is proposed. To effectively use the new ILP formulation, a partition strategy that decomposes a large-sized problem into some small-sized sub-problems is adopted and the routing re- gion is extended progressively from the most congested re- git）n. In the post-processing stage of XGRouter, maze rout- ing based on new routing edge cost is designed to further optimize the total wire length and mantain the congestion uniformity. To our best knowledge, XGRouter is the first work to use a concurrent algorithm to solve the global rout- ing problem in X-architecture. Experimental results show that XGRouter can produce solutions of higher quality than other global routers. And, like several state-of-the-art global touters, XGRouter has no overflow.

关键词： global routing overflow total wire length con-gestion uniformity X-architecture particle swarm optimiza-tion integer linear programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：