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

作者： Zhang, Lei Wei, Lifei Huang, Dongmei Zhang, Kai Dong, Mianxiong Ota, Kaoru College of Information Technology Shanghai Ocean University Shanghai China State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing China Department of Computer Science and Software Engineering East China Normal University Shanghai China Department of Information and Electronic Engineering Muroran Institute of Technology Muroran Japan

Because the technology of mobile cloud computing has brought several benefits to information world, many applications in mobile devices based on cloud have emerged and boomed in the last years. According to the storage limitation, data owners would like to upload and further share the data through the cloud. Because of the safety requirements, mobile data owners are requested to provide credentials such as authentication tags along with the data. However, it is impossible to require mobile data owners to provide every authenticated computational results. The solution that signers' privilege is outsourced to the cloud would be a promising way. To solve this problem, we propose three secure multi-entities delegated authentication protocols (MEDAPs) in mobile cloud computing, which enables the multiple mobile data owners to authorize a group-designated cloud servers with the signing rights. The security of MEDAPs is constructed on three cryptographic primitive identity-based multi-proxy signature, identity-based proxy multi-signature, and identity-based multi-proxy multi-signature, relied on the cubic residues, equaling to the integer factorization assumption. We also give the formal security proof under adaptively chosen message attacks and chosen identity/warrant attacks. Furthermore, compared with the pairing-based protocol, MEDAPs are quite efficient, and the communication overhead is nearly not a linear growth with the number of cloud servers. Copyright © 2016 John Wiley & Sons, Ltd. Copyright © 2016 John Wiley & Sons, Ltd.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Biterm Pseudo Document Topic Model for Short Text

Biterm Pseudo Document Topic Model for Short Text

引用

International Conference on Tools with Artificial Intelligence

作者： Lan Jiang Hengyang Lu Ming Xu Chongjun Wang National Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University

ISBN: (纸本)9781509044603

In the past few years, we have witnessed a rapid development of online social media, from which we can access various short texts. Understanding the topic patterns of these short text is significant. Traditional topic models, like LDA, are not suitable when applied to short text topic analysis due to data sparsity. A lot of efforts have been made to solve this problem. However, there is still significant space to improve the effectiveness of these short text specific methods. In this paper, we proposed a novel word co-occurrence network based method, referred to as biterm pseudo document topic model (BPDTM), which extended the previous biterm topic model (BTM) for short text. We utilized the word co-occurrence network to construct biterm pseudo documents. The proposed model is promising since it represents words with their semantic adjacent biterms and is able to model the corpus-level semantic relation between two words. Besides, BPDTM naturally lengthens the documents, which alleviate the influence for performance exerted by data sparsity. Experiments demonstrated that our model outperformed two baselines, i.e. LDA and BTM, which proved its effectiveness on short text topic modeling task.

关键词： texts laser Doppler anemometry Anterior interventricular branch of left coronary artery Left-sided displacement of abomasum Pseudo Word

来源：评论

学校读者我要写书评

暂无评论

Image Segmentation Based on Prototypes Extraction and Merging of Clusters in Multiple Spaces

Image Segmentation Based on Prototypes Extraction and Mergin...

引用

International Joint Conference on Neural Networks

作者： Xiaofeng Shi Furao Shen Jinxi Zhao The National Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University

ISBN: (纸本)9781509006212

Pixel clustering is one of the basic methods for image segmentation. A critical problem of pixel clustering is how to measure the similarity between colors of the pixels on human visual perception. In this paper, we propose an adaptive clustering method for image segmentation, namely Prototypes Extraction and Merging (PEM) method. We first build a prototype network based on the Hebbian learning rule to represent the image. Then we use the Density Peaks Based Clustering (DPBC) method on the prototypes rather than the pixels for clustering in multiple color spaces, in which we choose a tiny Euclidean distance to approximate the similarity of the neighboring prototypes and find the density peaks. Finally we conduct the Multi-Space Merging (MSM) method to merge the color regions in multiple color spaces and get the final segmentation. In PEM the similarity measuring of colors is achieved adaptively according to the complexity and local contrast ratio of the image. Thus, it is extremely close to the discriminability of human visual system.

关键词： image segmentation merger pixel prototype network color spaces PROTOTYPE Hebbian principle similar measure IMAGE CONTRAST Color Clustering methods Cluster Analysis Visual Perception

来源：评论

学校读者我要写书评

暂无评论

A Fast Manifold Learning Algorithm for Dimensionality Reduction

A Fast Manifold Learning Algorithm for Dimensionality Reduct...

引用

International Conference on Tools with Artificial Intelligence

作者： Yu Liang Furao Shen Jinxi Zhao Yi Yang National Key Laboratory for Novel Software Technology and Department of Computer Science and Technology Nanjing University

ISBN: (纸本)9781509044603

This paper proposes a new manifold learning method called "Soinnmanifold". Traditional manifold learning method needs a lot of computation and appropriate priori parameters. This has somewhat restricted the domains in which manifold learning can potentially be applied. However, with the high-dimensional inputs, our method can generate a low-dimensional manifold in the high-dimensional space and determine the intrinsic dimension automatically. Then we will use this manifold to do dimensionality reduction quickly. Experiments demonstrate that our method can get promising results with less time and memory.

关键词： Manifold learning Intrinsic Dimension Dimensionality Reduction

来源：评论

学校读者我要写书评

暂无评论

Melton： a practical and precise memory leak detection tool for C programs

引用

Frontiers of computer science 2015年第1期9卷 34-54页

作者： Zhenbo XU Jian ZHANG Zhongxing XU Department of Computer Science and Technology University of Science and Technology of China Anhui 230027 China State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing 100190 China

Memory leaks are a common type of defect that is hard to detect manually. Existing memory leak detection tools suffer from lack of precise interprocedural analysis and path-sensitivity. To address this problem, we present a static interprocedural analysis algorithm, that performs fully pathsensitive analysis and captures precise function behaviors, to detect memory leak in C programs. The proposed algorithm uses path-sensitive symbolic execution to track memory actions in different program paths guarded by path conditions. A novel analysis model called memory state transition graph （MSTG） is proposed to describe the tracking process and its results. In order to do interprocedural analysis, the proposed algorithm generates a summary for each procedure from MSTG and applies the summary at the procedure＇s call sites. A prototype tool called Melton is implemented for this procedure. Melton was applied to five open source C programs and 41 leaks were found. More than 90% of these leaks were subsequently confirmed and fixed by their maintainers. For comparison with other tools, Melton was also applied to some programs in standard performance evaluation corporation （SPEC） CPU 2000 benchmark suite and detected more leaks than the state of the art approaches.

关键词： memory leak bug finding static analysis symbolic execution

来源：评论

学校读者我要写书评

暂无评论

A Multi-Source Approach for Bug Triage

A Multi-Source Approach for Bug Triage

引用

作者： Liu, Jin Tian, Yiqiuzi Yu, Xiao Yang, Zhijiang Jia, Xiangyang Ma, Chuanxiang Xu, Zheng State Key Laboratory of Software Engineering School of Computer Science Wuhan University Wuhan Hubei China Guangxi Key Laboratory of Trusted Software Guilin University of Electronic Technology Guilin Guangxi China Department of Computer Science Western Michigan University KalamazooMI49008-5466 United States School of Computer Science and Information Engineering Hubei University Wuhan Hubei China Third Research Institute of Ministry of Public Security Shanghai201204 China

Bug triaging refers to the process of assigning a bug to the most appropriate fixer. As the scale and complexity of software increases, bug triaging becomes a tedious and time-consuming work. Existing bug triaging approaches typically treat it as a problem of optimizing recommendation accuracy. However, the time that different fixers may spend also varies. Thus, we take time cost as another optimizing objective aside from accuracy and use modern portfolio theory to strike a balance between them. In addition, for fixers with little fixing records, we need more data to build profiles about their expertise. To address these problems, we propose a bug triaging approach with awareness of accuracy and time cost, and we use bug reports from other projects to enrich the bug fixing history of fixers. We evaluate our approach with experiments on data collected from Bugzilla. The experiment results validate the effectiveness of our approach. © 2016 World Scientific Publishing Company.

关键词： Costs

来源：评论

学校读者我要写书评

暂无评论

Temporal coherent video decolorization using proximity optimization 16

Temporal coherent video decolorization using proximity optim...

引用

33rd computer Graphics International Conference, CGI 2016

作者： Tao, Yizhang Shen, Yiyi Sheng, Bin Li, Ping Wu, Enhua Shanghai Jiao Tong University 800 Dongchuan Road Shanghai China Department of Mathematics and Information Technology Hong Kong Institute of Education Hong Kong State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences China

ISBN: (纸本)9781450341233

Video decolorization has wide application, such as in film industry. However, previous works on video decolorization focus on simply reusing the image decolorization method, which is time-consuming and may lose temporal coherence. This paper proposes a novel video decolorization method | defining decolorization proximity, regarded as a criterion to determine the specific method, to do the decolorization and further preserving temporal coherence well. Experimented with vast diverse color videos, the experiment result shows that our framework can provide high efficiency and effective-ly avoid visual icker and incoherence. © 2016 ACM.

关键词： Decolorization Proximity Temporal Coherence Video Decolorazition

来源：评论

学校读者我要写书评

暂无评论

Quantum state and process tomography via adaptive measurements

引用

science China(Physics,Mechanics & Astronomy) 2016年第10期59卷 25-32页

作者： HengYan Wang WenQiang Zheng NengKun Yu KeRen Li DaWei Lu Tao Xin Carson Li ZhengFeng Ji David Kribs Bei Zeng XinHua Peng JiangFeng Du Hefei National Laboratory for Physical Sciences at Microscale and Department of Modern Physics University of Science and Technology of ChinaHefei 230026China Department of Applied Physics Zhejiang University of TechnologyHangzhou 310023China Institute for Quantum Computing University of WaterlooWaterloo N2L 3G1Canada 4Department of Mathematics&Statistics University of GuelphGuelph N1G 2W1Canada Centre for Quantum Computation&Intelligent Systems Faculty of Engineering and Information TechnologyUniversity of Technology SydneySydney NSW 2007Australia State Key Laboratory of Low-Dimensional Quantum Physics and Department of Physics Tsinghua UniversityBeijing 100084China Department of Physics University of GuelphGuelph N1G 2W1Canada State Key Laboratory of Computer Science Institute of SoftwareChinese Academy of SciencesBeijing 100190China Canadian Institute for Advanced Research Toronto M5G 1Z8Canada

We investigate quantum state tomography(QST) for pure states and quantum process tomography(QPT) for unitary channels via adaptive measurements. For a quantum system with a d-dimensional Hilbert space, we first propose an adaptive protocol where only 2d. 1 measurement outcomes are used to accomplish the QST for all pure states. This idea is then extended to study QPT for unitary channels, where an adaptive unitary process tomography(AUPT) protocol of d2+d.1measurement outcomes is constructed for any unitary channel. We experimentally implement the AUPT protocol in a 2-qubit nuclear magnetic resonance system. We examine the performance of the AUPT protocol when applied to Hadamard gate, T gate(/8 phase gate), and controlled-NOT gate,respectively, as these gates form the universal gate set for quantum information processing purpose. As a comparison, standard QPT is also implemented for each gate. Our experimental results show that the AUPT protocol that reconstructing unitary channels via adaptive measurements significantly reduce the number of experiments required by standard QPT without considerable loss of fidelity.

关键词： quantum tomography state reconstruction nuclear magnetic resonance

来源：评论

学校读者我要写书评

暂无评论

Detecting overlapping communities in networks via dominant label propagation

引用

Chinese Physics B 2015年第1期24卷 551-559页

作者：孙鹤立黄健斌田勇强宋擒豹刘怀亮 Department of Computer Science and Technology Xi’an Jiaotong University State Key Laboratory for Novel Software Technology Nanjing University School of Software Xidian University School of Economics and Management Xidian University

Community detection is an important methodology for understanding the intrinsic structure and function of a realworld network. In this paper, we propose an effective and efficient algorithm, called Dominant Label Propagation Algorithm（Abbreviated as DLPA）, to detect communities in complex networks. The algorithm simulates a special voting process to detect overlapping and non-overlapping community structure in complex networks simultaneously. Our algorithm is very efficient, since its computational complexity is almost linear to the number of edges in the network. Experimental results on both real-world and synthetic networks show that our algorithm also possesses high accuracies on detecting community structure in networks.

关键词： overlapping community detection dominant label propagation complex network

来源：评论

学校读者我要写书评

暂无评论

Online stochastic linear optimization under one-bit feedback 33

Online stochastic linear optimization under one-bit feedback

引用

33rd International Conference on Machine Learning, ICML 2016

作者： Zhang, Lijun Yang, Tianbao Jin, Rong Xiao, Yichi Zhou, Zhi-Hua National Key Laboratory for Novel Software Technology Nanjing University Nanjing210023 China Department of Computer Science University of Iowa Iowa CityIA52242 United States Alibaba Group Seattle United States

ISBN: (纸本)9781510829008

In this paper, we study a special bandit setting of online stochastic linear optimization, where only one-bit of information is revealed to the learner at each round. This problem has found many applications including online advertisement and online recommendation. We assume the binary feedback is a random variable generated from the logit model, and aim to minimize the regret defined by the unknown linear function. Although the existing method for generalized linear bandit can be applied to our problem, the high computational cost makes it impractical for real-world applications. To address this challenge, we develop an efficient online learning algorithm by exploiting particular structures of the observation model. Specifically, we adopt online Newton step to estimate the unknown parameter and derive a tight confidence region based on the exponential concavity of the logistic loss. Our analysis shows that the jjroposed algorithm achieves a regret bound of O(d√T), which matches the optimal result of stochastic linear bandits.

关键词： Linear programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：