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

21st ACM International Conference on Information and Knowledge Management, CIKM 2012

作者： Yin, Wenpeng Pei, Yulong Zhang, Fan Huang, Lian'en Shenzhen Key Lab. for Cloud Computing Technology and Application Peking University Shenzhen Graduate School Shenzhen 518055 China

ISBN: (纸本)9781450311564

Query-oriented relevance, information richness and novelty are important requirements in query-focused summarization, which, to a considerable extent, determine the summary quality. Previous work either rarely took into account all above demands simultaneously or dealt with part of them in the dynamic process of choosing sentences to generate a summary. In this paper, we propose a novel approach that integrates all these requirements skillfully by treating them as sentence features, making that the finally generated summary could fully reflect the combinational effect of these properties. Experimental results on the DUC2005 and DUC2006 datasets demonstrate the effectiveness of our approach. © 2012 ACM.

关键词： Vector spaces

来源：评论

学校读者我要写书评

暂无评论

A novel biased diversity ranking model for Query-oriented multidocument summarization

A novel biased diversity ranking model for Query-oriented mu...

引用

2013 International Conference on Vehicle and Mechanical Engineering and Information technology, VMEIT 2013

作者： Lei, Kai Zeng, Yi Fan The Shenzhen Key Lab for Cloud Computing Technology and Application Peking University Shenzhen Graduate School Shenzhen Guangdong 518055 China

ISBN: (纸本)9783037858202

Query-oriented multi-document summarization (QMDS) attempts to generate a concise piece of text byextracting sentences from a target document collection, withthe aim of not only conveying the key content of that corpus,also, satisfying the information needs expressed by that *** to its great applicable value, QMDS has been intensively studied in recent decades. Three properties are supposed crucial for a good summary, i.e., relevance, prestige and low redundancy (orso-called diversity). Unfortunately, most existing work either disregarded the concern of diversity, or handled it with non-optimized heuristics, usually based on greedy sentences election. Inspired by the manifold-ranking process, which deals with query-biased prestige, and DivRank algorithm which captures query-independent diversity ranking, in this paper, we propose a novel biased diversity ranking model, namedManifoldDivRank, for query-sensitive summarization tasks. The top-ranked sentences discovered by our algorithm not only enjoy query-oriented high prestige, more importantly, they are dissimilar with each other. Experimental results on DUC2005and DUC2006 benchmark data sets demonstrate the effectivenessof our proposal. © (2013) Trans Tech Publications, Switzerland.

关键词： Conveying

来源：评论

学校读者我要写书评

暂无评论

Prologue: Unified polymorphic routing towards flexible architecture of reconfigurable infrastructure 9

Prologue: Unified polymorphic routing towards flexible archi...

引用

9th International ICST Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities, TridentCom 2014

作者： Pan, Kai Li, Hui Liu, Weiyang Zhu, Zhipu Chen, Fuxing Zhu, Bing Shenzhen Engineering Lab of Converged Networks Technology Shenzhen Key Lab of Cloud Computing Technology and Application Peking University Shenzhen Graduate School Shenzhen518055 China

ISBN: (纸本)9783319133256

Today’s Internet architecture was designed and proposed in the 60s and 70s with the intention to interconnect several computing resources across a geographically distributed user group. With the advent of substantially various Internet businesses, traditional Internet is increasingly powerless to satisfy the unprecedented demands. This paper probed the polymorphic routing prototype based on proposed Flexible Architecture of Reconfigurable Infrastructure (FARI) which attempts to emerge as a clean-slate revolution of future Internet and resorts to centralized control manner. Routers in FARI were reconfigurable to adapt to different businesses in terms of identifier type. Moreover, a preliminary framework of FARI is proposed in the end of the article. © Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2014.

关键词： Reconfigurable architectures

来源：评论

学校读者我要写书评

暂无评论

Semi-centralized name routing mechanism for reconfigurable network 9

Semi-centralized name routing mechanism for reconfigurable n...

引用

9th International ICST Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities, TridentCom 2014

作者： Chen, Fuxing Liu, Weiyang Li, Hui Zhu, Zhipu Shenzhen Engineering Lab of Converged Networks Technology Shenzhen Key Lab of Cloud Computing Technology and Application Peking University Shenzhen Graduate School Shenzhen518055 China

ISBN: (纸本)9783319133256

Dedicated to overcoming weakness of current Internet architecture, some novel internet architectures have been proposed recently. Examples of these architectures contain Information Centric Networking (ICN), Name Data Networking (NDN), reconfigurable networking etc. As far as we know, the most efficient name based routing mechanism which suites the new architectures has not been found yet. This paper proposed a Semi-Centralized Name Routing (SCNR) protocol for reconfigurable network to enhance the routing efficiency. Results of this paper show that SCNR has good performance in ICN, which can be regarded as one of the many sub-networks in reconfigurable network. © Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2014.

关键词： Network architecture

来源：评论

学校读者我要写书评

暂无评论

Optimization-based atomic capability routing model for flexible architecture of reconfigurable infrastructure 9

Optimization-based atomic capability routing model for flexi...

引用

9th International ICST Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities, TridentCom 2014

作者： Liu, Weiyang Li, Hui Chen, Fuxing Pan, Kai Shenzhen Engineering Lab of Converged Networks Technology Shenzhen Key Lab of Cloud Computing Technology and Application Peking University Shenzhen Graduate School Shenzhen518055 China

ISBN: (纸本)9783319133256

There are more and more emerging problems in today’s Internet, indicating today’s Internet architecture can not meet the quality requirement of various applications and service. With conventional Internet under mounting pressure, a new future Internet architecture named as Flexible Architecture of Reconfigurable Infrastructure (FARI) has been developed and implemented in China. Aiming at designing a routing mechanism which is one of the most essential issue in any Internet architecture, this paper explores to establish an optimization-based atomic capability routing model that is able to optimally select or generate a routing protocol based on the current network quality of service (QoS) requirement. In experiments, the feasibility of this routing model is verified and results of complexity analysis are satisfying. ©Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2014.

关键词： Routing protocols

来源：评论

学校读者我要写书评

暂无评论

Revisiting benchmarking principles and methodologies for big data benchmarking 6th

Revisiting benchmarking principles and methodologies for big...

引用

6th Workshop on Big Data Benchmarks, Performance Optimization, and Emerging Hardware, BPOE 2015

作者： Zhao, Liutao Gao, Wanling Jin, Yi Key Laboratory of Cloud Computing Technology and Application Beijing Computing Center Beijing China State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing China

ISBN: (纸本)9783319290058

Benchmarking as yardsticks for system design and evaluation, has developed a long period and plays a pivotal role in many domains, such as database systems and high performance computing. Through prolonged and unremitting efforts, benchmarks on these domains have been reaching their maturity gradually. However, in terms of emerging scenarios of big data, its different properties in data volume, data types, data processing requirements and techniques, make that existing benchmarks are rarely appropriate for big data systems and further make us wonder how to define a good big data benchmark. In this paper, we revisit successful benchmarks in other domains from two perspectives: benchmarking principles which define fundamental rules, and methodologies which guide the benchmark constructions. Further, we conclude the benchmarking principle and methodology on big data benchmarking from a recent open-source effort – BigDataBench. © Springer International Publishing Switzerland 2016.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Unsupervised feature selection based on Markov blanket and particle swarm optimization

引用

Journal of Systems Engineering and Electronics 2017年第1期28卷 151-161页

作者： Yintong Wang Jiandong Wang Hao Liao Haiyan Chen College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Key Laboratory of Trusted Cloud Computing and Big Data Analysis Nanjing Xiaozhuang University College of Computer Science and Software Engineering Shenzhen University

Feature selection plays an important role in data mining and recognition, especially in the large scale text, image and biological data. Specifically, the class label information is unavailable to guide the selection of minimal feature subset in unsupervised feature selection, which is challenging and interesting. An unsupervised feature selection based on Markov blanket and particle swarm optimization is proposed named as UFSMB-PSO. The proposed method seeks to find the high-quality feature subset through multi-particles' cooperation of particle swarm optimization without using any learning algorithms. Moreover, the features' relevance will be computed based on an information metric of relevance gain, which provides an information theoretical foundation for finding the minimization of the redundancy between features. Our results on several benchmark datasets demonstrate that UFSMB-PSO can achieve significant improvement over state of the art unsupervised methods. © 1990-2011 Beijing Institute of Aerospace Information.

关键词： Character recognition Data mining Feature extraction Information theory

来源：评论

学校读者我要写书评

暂无评论

Huge Page Friendly Virtualized Memory Management

引用

Journal of Computer Science & technology 2020年第2期35卷 433-452页

作者： Sai Sha Jing-Yuan Hu Ying-Wei Luo Xiao-Lin Wang Zhenlin Wang School of Electronics Engineering and Computer Science Peking UniversityBeijing 100871China Peng Cheng Laboratory Shenzhen 518052China Shenzhen Key Laboratory for Cloud Computing Technology&Applications School of Electronic and Computer EngineeringPeking University ShenzhenShenzhen 518000China Department of Computer Science Michigan Technological UniversityMichigan 49246U.S.A.

With the rapid increase of memory consumption by applications running on cloud data centers,we need more efficient memory management in a virtualized *** huge pages becomes more critical for a virtual machine's performance when it runs large working set size *** with large working set sizes are more sensitive to memory allocation,which requires us to quickly adjust the virtual machine's memory to accommodate memory phase *** would be much more efficient if we could adjust virtual machines'memory at the granularity of huge ***,existing virtual machine memory reallocation techniques,such as ballooning,do not support huge *** addition,in order to drive effective memory reallocation,we need to predict the actual memory demand of a virtual *** find that traditional memory demand estimation methods designed for regular pages cannot be simply ported to a system adopting huge *** to adjust the memory of virtual machines timely and effectively according to the periodic change of memory demand is another challenge we *** paper proposes a dynamic huge page based memory balancing system(HPMBS)for efficient memory management in a virtualized *** first rebuild the ballooning mechanism in order to dispatch memory in the granularity of huge *** then design and implement a huge page working set size estimation mechanism which can accurately estimate a virtual machine's memory demand in huge pages *** these two mechanisms,we finally use an algorithm based on dynamic programming to achieve dynamic memory *** show that our system saves memory and improves overall system performance with low overhead.

关键词： virtualization huge page ballooning memory balancing

来源：评论

学校读者我要写书评

暂无评论

Gradient-Based Differential kWTA Network With application to Competitive Coordination of Multiple Robots

引用

IEEE/CAA Journal of Automatica Sinica 2022年第8期9卷 1452-1463页

作者： Mei Liu Xiaoyan Zhang Mingsheng Shang Long Jin School of Information Science and Engineering Lanzhou UniversityLanzhou 730000 State Key Laboratory of Tibetan Intelligent Information Processing and Application Xining 810016China Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent TechnologyChinese Academy of SciencesChongqing 400714China Shenzhen Research Institute Lanzhou UniversityShenzhen 518063China

Aiming at the k-winners-take-all(kWTA)operation,this paper proposes a gradient-based differential kWTA(GDk WTA)*** obtaining the network,theorems and related proofs are provided to guarantee the exponential convergence and noise resistance of the proposed GD-kWTA ***,numerical simulations are conducted to substantiate the preferable performance of the proposed network as compared with the traditional ***,the GD-k WTA network,backed with a consensus filter,is utilized as a robust control scheme for modeling the competition behavior in the multi-robot coordination,thereby further demonstrating its effectiveness and feasibility.

关键词： Consensus filter k-winners-take-all(kWTA) multirobot coordination noise resistance

来源：评论

学校读者我要写书评

暂无评论

TheWire-speed multicast switch fabric based on distributive lattice

TheWire-speed multicast switch fabric based on distributive ...

引用

作者： Chen, Fuxing Liu, Weiyang Li, Hui Wu, Dongcheng Shenzhen Engineering Lab of Converged Networks Technology Shenzhen Key Lab of Cloud Computing Technology and Application Shenzhen Graduate School Shenzhen 518055 China Graduate School of Information Production and Systems Waseda University Kitakyushu-shi 808- 0135 Japan

The traditional multicast switch fabrics, which were mainly developed from the unicast switch fabrics, currently are not able to achieve high efficiency and flexible large-scale scalability. In the light of lattice theory and multicast concentrator, a novel multistage interconnection multicast switch fabric is proposed in this paper. Comparing to traditional multicast switch fabrics, this multicast switch fabric has the advantages of superior scalability, wire-speed, jitter-free multicast with low delay, and no queuing buffer. This paper thoroughly analyzes the performance of the proposed multicast switch fabric with supporting prioritybased multicast. Simulations on packet loss rate and delay are discussed and presented at normalized load. Moreover, a detailed FPGA implementation is given. Practical network traffic tests provide evidence supporting the feasibility and stability of the proposed fabric. © 2014 The Institute of Electronics, Information and Communication Engineers.

关键词： Switching networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：