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

2011 6th International Conference on Pervasive computing and Applications, ICPCA 2011

作者： Zongmin, Li Yang, Liu Hua, Li School of Computer and Communication Engineering China University 0f Petroleum Shandong 257061 China Key Laboratory Intelligent Information Processing Institute of Computing Technology Chinese Academy of Science Beijing l0080 China

ISBN: (纸本)9781457702082

Relevance feedback based on SVM classifier shows a good performance recently but the finite feedback counts limited by user's patience and the small sample size problem are not solved well, Co-SVM does a good job in solving these problems but still has some flaws. We propose three strategies to try to improve this algorithm: (1) different kernel functions are used to characterize the color and texture visual similarities;(2) a new method is proposed to caculate the confident scores of the contention samples;(3) a bunch of the most irrelevant images with the highest confident score are added into the labeled images to extend the size of labeled data while choosing a bunch of images for user labeling. Experimental results verify the superiority of our method over Co-SVM. © 2011 IEEE.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

SelectCast: Scalable data aggregation scheme in wireless sensor networks

SelectCast: Scalable data aggregation scheme in wireless sen...

引用

IEEE INFOCOM 2011

作者： Wang, Cheng Tang, Shaojie Li, Xiang-Yang Jiang, Changjun Department of Computer Science Tongji University Shanghai China Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China Department of Computer Science Illinois Institute of Technology Chicago IL 60616 United States TNLIST School of Software Tsinghua University China

ISBN: (纸本)9781424499212

In this work, for a wireless sensor network (WSN) of n randomly placed sensors with node density λ ∈ [1, n], we study the tradeoffs between the aggregation throughput and gathering efficiency. The gathering efficiency refers to the ratio of the number of the sensors whose data have been gathered to the total number of sensors. Specifically, we design two efficient aggregation schemes, called single-hop-length (SLH) scheme and multiple-hop-length (MLH) scheme. By novelly integrating these two schemes, we theoretically prove that our protocol achieves the optimal tradeoffs, and derive the optimal aggregation throughput depending on a given threshold value (lower bound) on gathering efficiency. Particularly, we show that under the MLH scheme, for a practically important set of symmetric functions called perfectly compressible functions, including the mean, max, or various kinds of indicator functions, etc., the data from Θ(n) sensors can be aggregated to the sink at the throughput of a constant order Θ(1), implying that our MLH scheme is indeed scalable. © 2011 IEEE.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

Dynamic Resource Allocation Based on User experience in Virtualized Servers

引用

Procedia Engineering 2011年 15卷 3780-3784页

作者： Wei Zhang Jiajun Liu Ying Song Mingfa Zhu Limin Xiao Yuzhong Sun Li Ruan State Key Laboratory of Software Development Environment Beijing 100191 China School of Computer Science and Engineering Beihang University Beijing 100191 China Key Laboratory of Computer System and Architecture Chinese Academy of SciencesBeijing Institute of Computing Technology Chinese Academy of Sciences Beijing China

Web workloads are known to vary dynamically with time which poses a challenge to resource allocation among the applications. In this paper, we argue that the existing dynamic resource allocation based on resource utilization has some drawbacks in virtualized servers. Dynamic resource allocation directly based on real-time user experience is more reasonable and also has practical significance. To address the problem, we propose a system architecture that combines real time measurements and analysis of user experience for resource allocation. We evaluate our proposal using Webbench. The experiment results show that these techniques can judiciously allocate system resources.

关键词： resource allocation virtualized servers user experience

来源：评论

学校读者我要写书评

暂无评论

基于SSD的多级缓存预取优化研究

基于SSD的多级缓存预取优化研究

引用

第18届全国信息存储技术学术会议

作者： Ma Jiu-yue 马久跃 Zhang Zhe 张喆 Xiong Jin 熊劲 Ma Xiao-song 马晓松 State Key Laboratory of Computer Architecture Institute Of Computing Technology Chinese Academy Of 计算机体系结构国家重点实验室中国科学院计算技术研究所北京 100190 中国科学院研究生院北京 100049 IBM T.J.Watson Research Center USA IBM T.J.Watson研究中心 USA State Key Laboratory of Computer Architecture Institute Of Computing Technology Chinese Academy Of 计算机体系结构国家重点实验室中国科学院计算技术研究所北京 100190 North Carolina State University USA

面向海量数据的互联网应用导致存储系统并发访问量猛增，使得存储系统成为整个体系结构中的性能瓶颈，缓存预取作为解决存储系统性能瓶颈的主要解决方案被广泛应用。传统基于全内存的缓存架构在面对海量数据应用时，其容量、功耗和价格... 详细信息

面向海量数据的互联网应用导致存储系统并发访问量猛增，使得存储系统成为整个体系结构中的性能瓶颈，缓存预取作为解决存储系统性能瓶颈的主要解决方案被广泛应用。传统基于全内存的缓存架构在面对海量数据应用时，其容量、功耗和价格等问题是影响其扩展性的主要因素。随着固态存储技术的引入，内存与固态硬盘( SSD)混合的缓存架构有望解决这些问题。但由于SSD读写性能相差较大，且有擦写次数的限制，所以直接使用传统的缓存预取策略来管理SSD缓存不能很好地发挥其作用，且增加了额外的I/O开销，影响系统的整体性能。本文提出了一种基于SSD多级缓存的预取优化策略，并在DRAM/SSD两级缓存架构下对其进行评测，结果表明我们的优化在请求平均响应时间上能够取得15％-50％的性能提升，并能够有效减少SSD缓存的写操作，延长SSD使用寿命。

关键词：存储系统固态硬盘多级缓存预取优化

来源：评论

学校读者我要写书评

暂无评论

Estimate-piloted regularization and fast ALS algorithm for collaborative filtering

Estimate-piloted regularization and fast ALS algorithm for c...

引用

2011 International Conference on Future computer Science and Education, ICFCSE 2011

作者： Zhang, Zhenyue Zhao, Keke Zha, Hongyuan Xue, Guirong Department of Mathematics State Key Laboratory of CAD and CG Zhejiang University China College of Computing Georgia Institute of Technology Atlanta GA 30332 United States Department of Computer Science Shanghai Jiao Tong University Shanghai 200240 China

ISBN: (纸本)9780769545332

Regularized Low-rank approximation with missing data is an effective approach for Collaborative Filtering since it generates high quality rating predictions for recommender systems. Alternative LS (ALS) method is one of the commonly used algorithms for the CF problem. However, ALS did not work very well in some applications, due to the over-fitting to observations. This paper proposes a novel estimate-piloted regularization that uses a pre-estimate of the unobserved entries and uses the approximation errors to the pre-estimates as a regularize term. This new regularization can reduce the risk of over-fitting and improve the approximation accuracy of ALS. We also proposed a fast implementation of the modified ALS method, which is also very suitable for parallel computing. The proposed algorithm PALS has higher accuracy than ALS for original model in three real-world data sets. © 2011 IEEE.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

A hybrid watermarking technique to resist tampering and copy attacks

A hybrid watermarking technique to resist tampering and copy...

引用

2011 International Symposium on Intelligence Information Processing and Trusted computing, IPTC 2011

作者： Zheng, Peng Wang, Weihua Wang, Juan School of Computer Wuhan University Wuhan Hubei 430072 China School of Software Anyang Institute of Technology Anyang Henan 455000 China Key Laboratory of Aerospace Information Security and Trust Computing Ministry of Education Wuhan Hubei 430072 China

ISBN: (纸本)9780769544984

Digital watermarking is an efficient method to protect multimedia documents. Robust watermarks, which survive to any change or alteration of the protected documents, are typically used for copyright protection. Fragile watermarks, which are vulnerable to a little alteration, are typically used for content authentication. In the paper, we propose a hybrid watermarking method joining a robust and a fragile watermark, and thus combining copyright protection and content authentication. As a result this approach is at the same time resistant against tampering and copy attacks. Our contribution is setting up the relationship between fragile watermark and robust watermark. We make use of DCT coefficients to embed watermark information. The experimental results show that the proposed method can resist tampering and copy attacks at the same time. © 2011 IEEE.

关键词： Digital watermarking

来源：评论

学校读者我要写书评

暂无评论

Context-specific miRNA regulation network predicts cancer prognosis

Context-specific miRNA regulation network predicts cancer pr...

引用

5th IEEE International Conference on Systems Biology, ISB 2011

作者： Zhou, Xionghui Liu, Juan Liu, Changning Rayner, Simon Liang, Fengji Ju, Jingfang Li, Yinghui Chen, Shanguang Xiong, Jianghui School of Computer Science Wuhan University Wuhan China Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China State Key Laboratory of Virology Wuhan Institute of Virology Chinese Academy of Sciences Wuhan China Department of Pathology Stony Brook University Medical Center NY United States

ISBN: (纸本)9781457716669

MicroRNAs can regulate hundreds of target genes and play a pivotal role in a broad range of biological process. However, relatively little is known about how these highly connected miRNAs-target networks are remodelled in the context of various diseases. Here we examine the dynamic alteration of context-specific miRNA regulation to determine whether modified microRNAs regulation on specific biological processes is a useful information source for predicting cancer prognosis. A new concept, Context-specific miRNA activity (CoMi activity) is introduced to describe the statistical difference between the expression level of a miRNA's target genes and non-targets genes within a given gene set (context). The microarray gene expression profile of brain tumors from 356 patients (The Cancer Genome Atlas dataset) was converted into a CoMi activity pattern, and showed significant positive correlation with the corresponding miRNA expression pattern. In a breast cancer cohort, the differential CoMi activity between good prognosis (longer survival) vs. bad prognosis patients forms a scale-free network, which highlighted a group of important cancer-related microRNAs and GO terms, e.g. hsa-miR-34a and 'cell adhesion'. Then two breast cancer cohorts were used in outcome prediction in an independent test. Using a popular T-test feature selection method and a support vector machine (SVM) classifier with 10-fold cross-validation, the CoMi activity feature achieves an area under curve (AUC) of 0.7155, better than the AUC value of 0.6339 for feature selection based on mRNA expression. In an independent test, CoMi feature selection achieved an AUC of 0.6874. Survival analysis also shows signatures defined by CoMi activity was predictive of survival and superior to mRNAs signatures. In short, we have demonstrated the first interrogation of dynamic remodeling of context specific miRNAs regulation networks in cancer. The altered microRNAs regulation on specific contexts could be used to predi

关键词： Diseases

来源：评论

学校读者我要写书评

暂无评论

An ultra-fast hybrid simulation framework for ASIP

An ultra-fast hybrid simulation framework for ASIP

引用

IEEE International Conference on Electronics, Circuits and Systems (ICECS)

作者： Ji Qiu Xiang Gao Yifei Jiang Xu Xiao Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences (CAS) Beijing China Department of Electrical and Computer Engineering University of Illinois at Urbana-Champaign Urbana IL USA

ISS (Instruction Set Simulator) plays an important role in pre-silicon software development for ASIP. However, the speed of traditional simulation is too slow to effectively support full-scale software development. In this paper, we propose a hybrid simulation framework which further improves the previous simulation methods by aggressively utilizing the host machine resources. The utilization is achieved by categorizing instructions of ASIP application into two types, namely custom and basic instructions, via binary instrumentation. Then in a way of hybrid simulation, only custom instructions are simulated on the ISS and basic instructions are executed fast and natively on the host machine. We implement this framework for an industrial ASIP to validate our approach. Experimental results show that when the implemented ISS, namely GS-Sim, is applied to practical multimedia decoders, an average simulation speed up to 1058.5MIPS can be achieved, which is 34.7 times of the state-of-art dynamic binary translation simulator and is the fastest to the best of our knowledge.

关键词： Instruments Context Programming Decoding Switches Prototypes Context modeling

来源：评论

学校读者我要写书评

暂无评论

Theoretical treatment of sink scheduling problem in wireless sensor networks

Theoretical treatment of sink scheduling problem in wireless...

引用

2011 IEEE Conference on computer Communications Workshops, INFOCOM WKSHPS 2011

作者： Gu, Yu Ji, Yusheng Li, Jie Zhao, Baohua Information Systems Architecture Science Research Division National Institute of Informatics Tokyo Japan State Key Laboratory of Networking and Switching Technology Beijing 100876 China School of Computer Science Univ. of Science and Technology of China Hefei Anhui 230027 China Department of Computer Science University of Tsukuba Ibaraki 305-8573 Japan

ISBN: (纸本)9781457702488

Sink Scheduling, in the form of scheduling multiple sinks among sink sites to leverage traffic burden, is an effective mechanism for the energy-efficiency of wireless sensor networks (WSNs). Due to the inherent difficulty (NP-hard in general), existing works on this topic mainly focus on heuristic/greedy algorithms and theoretic results remain unknown. In this paper, we fill in the research blank with two algorithms. The first one is based on the Column Generation (CG). It decomposes the original problem into two sub problems and solve them iteratively to approach the optimal solution. However, due to its high computational complexity, this algorithm is only suitable for small scale networks. The other one is a polynomial-time algorithm based on relaxation techniques to obtain an upperbound, which can serve as a performance benchmark for other algorithms on this problem. Through comprehensive simulations, we evaluate the efficiency of proposed algorithms. © 2011 IEEE.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

RESTful web service composition: Extracting a process model from Linear Logic theorem proving

RESTful web service composition: Extracting a process model ...

引用

2011 7th International Conference on Next Generation Web Services Practices, NWeSP 2011

作者： Zhao, Xia Liu, Enjie Clapworthy, Gordon J. Ye, Na Lu, Yueming Department of Computer Science and Technology University of Bedfordshire Luton United Kingdom School of Information and Control Engineering Xi'An University of Architecture and Technology Xi'an China School of Electronic and Information Engineering Xi'An Jiao Tong University Xi'an China Key Laboratory of Trustworthy Distributed Computing and Service Beijing University of Posts and Telecommunications Ministry of Education Beijing China

ISBN: (纸本)9781457711268

This paper introduces a two-stage Linear Logic based program synthesis approach to automatic RESTful web service composition. The Linear Logic theorem proof is applied at both resource and service invocation method levels, which greatly improves the searching efficiency and guarantees the correctness and completeness of the service composition. Furthermore, the process calculus is used as formalism for the composition process, which enables the approach to be executable at the business management level. The process calculus is attached to the Linear Logic inference rules in the style of type theory, so the process model is extracted directly from the complete proof. An example is given to show the extraction of a process model from a Linear Logic proof search. © 2011 IEEE.

关键词： computer circuits

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：