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

arXiv 2017年

作者： He, Kun Li, Liang Liu, Xingwu Wang, Yuyi Xia, Mingji Institute of Computing Technology Chinese Academy of Sciences University of Chinese Academy of Sciences Beijing China Department of Artificial Intelligence Ant Financial Services Group China Institute of Computing Technology Chinese Academy of Sciences University of Chinese Academy of Sciences Beijing China Disco Group ETH Zürich Switzerland State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences University of Chinese Academy of Sciences Beijing China

A tight criterion under which the abstract version Lovász Local Lemma (abstract-LLL) holds was given by Shearer [43] decades ago. However, little is known about that of the variable version LLL (variable-LLL) where events are generated by independent random variables, though this model of events is applicable to almost all applications of LLL. We introduce a necessary and sufficient criterion for variable-LLL, in terms of the probabilities of the events and the event-variable graph specifying the dependency among the events. Based on this new criterion, we obtain boundaries for two families of event-variable graphs, namely, cyclic and treelike bigraphs. These are the first two non-trivial cases where the variable-LLL boundary is fully determined. As a byproduct, we also provide a universal constructive method to find a set of events whose union has the maximum probability, given the probability vector and the event-variable graph. Though it is #P-hard in general to determine variable-LLL boundaries, we can to some extent decide whether a gap exists between a variable-LLL boundary and the corresponding abstract-LLL boundary. In particular, we show that the gap existence can be decided without solving Shearer's conditions or checking our variable-LLL criterion. Equipped with this powerful theorem, we show that there is no gap if the base graph of the event-variable graph is a tree, while gap appears if the base graph has an induced cycle of length at least 4. The problem is almost completely solved except when the base graph has only 3-cliques, in which case we also get partial solutions. A set of reduction rules are established that facilitate to infer gap existence of an event-variable graph from known ones. As an application, various event-variable graphs, in particular combinatorial ones, are shown to be gapful/gapless. Copyright © 2017, The Authors. All rights reserved.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

OpenFunction: An extensible data plane abstraction protocol for platform-independent software-defined middleboxes

OpenFunction: An extensible data plane abstraction protocol ...

引用

International Conference on Network Protocols

作者： Chen Tian Alex X. Liu Ali Munir Jie Yang State Key Laboratory for Novel Software Technology Nanjing University China Department of Computer Science and Engineering Michigan State University USA

ISBN: (纸本)9781509032822

We propose OpenFunction, an extensible data plane abstraction protocol for platform-independent software-defined middleboxes. The main challenge is how to abstract packet operations, flow states and event generations with elements. The key decision of OpenFunction is: actions/states/events operations should be defined in a uniform pattern and independent from each other. We implemented a working SDM system including one OpenFunction controller and OpenFunction boxes based on Netmap, DPDK and FPGA to verify OpenFunction abstraction.

关键词： Middleboxes Protocols Hardware Process control Logic gates Semantics Technological innovation

来源：评论

学校读者我要写书评

暂无评论

Macroflow: A fine-grained networking abstraction for job completion time oriented scheduling in datacenters

Macroflow: A fine-grained networking abstraction for job com...

引用

International Conference on Network Protocols

作者： Chen Tian Junhua Yan Alex X. Liu Yizhou Tang Yuankun Zhong Zi Li State Key Laboratory for Novel Software Technology Nanjing University China Department of Computer Science and Engineering Michigan State University USA

ISBN: (纸本)9781509032822

For a datacenter running a data-parallel analytic framework, minimizing job completion time (JCT) is crucial for application performance. The key observation is that JCT could be improved, if network scheduling can exploit the opportunity of decreasing the amount of occupied machine slot-time spend on communication. We propose Macroflow, a networking abstraction that captures the primitive resource granularity of data-parallel frameworks. We study the inter-macroflow scheduling problem for decreasing application JCT. We propose the Smallest-Macroflow-First (SMF) and Smallest-Average-Macroflow-First (SAMF) heuristics that greedily schedule macroflows based on their network footprint. Trace-driven simulations demonstrate that our algorithms can reduce the average and tail JCT of network-intensive jobs by up to 20% and 25%, respectively; at the same time, the throughput of computation-intensive jobs is increased by up to 2.2×.

关键词： Throughput Measurement Ports (computers) Processor scheduling Conferences Protocols Fabrics

来源：评论

学校读者我要写书评

暂无评论

Test Case Prioritization Using Adaptive Random Sequence with Category-Partition-Based Distance

Test Case Prioritization Using Adaptive Random Sequence with...

引用

IEEE International Conference on software Quality, Reliability and Security (QRS)

作者： Xiaofang Zhang Xiaoyuan Xie Tsong Yueh Chen School of Computer Science and Technology Nanjing University Nanjing China State Key Laboratory of Software Engineering Wuhan University Wuhan China Department of Computer Science and Software Engineering Swinburne University of Technology Hawthorn Australia

Test case prioritization schedules test cases in a certain order aiming to improve the effectiveness of regression testing. Random sequence is a basic and simple prioritization technique, while Adaptive Random Sequence (ARS) makes use of extra information to improve the diversity of random sequence. Some researchers have proposed prioritization techniques using ARS with white-box information, such as code coverage information, or with black-box information, such as string distances of the input data. In this paper, we propose new black-box test case prioritization techniques using ARS, and the diversity of test cases is assessed by category-partition-based distance. Our experimental studies show that these new techniques deliver higher fault-detection effectiveness than random prioritization, especially in the case of smaller ratio of failed test cases. In addition, in the comparison of different distance metrics, techniques with category-partition-based distance generally deliver better fault-detection effectiveness and efficiency, meanwhile in the comparison of different ordering algorithms, our ARS-based ordering algorithms usually have comparable fault-detection effectiveness but much lower computation overhead, and thus are much more cost-effective.

关键词： Random sequences Measurement Testing Subspace constraints Fault detection Algorithm design and analysis Semantics

来源：评论

学校读者我要写书评

暂无评论

Solving All-SAT Problems by P Systems

引用

Chinese Journal of Electronics 2015年第4期24卷 744-749页

作者： GUO Ping JI Jinfang CHEN Haizhu LIU Ran College of Computer Science Chongqing University Chongqing Key Laboratory of Software Theory & Technology Department of Software Engineering Chongqing College of Electronic Engineering

The satisfiability problem(SAT) is a well known NP-complete problem. Obtaining All of the truth assignments of SAT is called All-SAT and it has numerous applications in artificial intelligence and computer theories. Many algorithms about SAT have been built, but how to solve All-SAT is still difficult. P system is a new distributed and parallel computation model. We use membrane division, which is frequently investigated to obtain an exponential working space in a linear time, to design a family of P systems to solve All-SAT in polynomial *** work provides a new and effective solution to All-SAT in a distributed and parallel manner.

关键词： All solutions for Satisfiability problem(All-SAT) Satisfiability problem(SAT problem) Conjunctive normal form(CNF) P system Memb

来源：评论

学校读者我要写书评

暂无评论

Ranking in evolving complex networks

arXiv

引用

arXiv 2017年

作者： Liao, Hao Mariani, Manuel Sebastian Medo, Matúš Zhang, Yi-Cheng Zhou, Ming-Yang Guangdong Province Key Laboratory of Popular High Performance Computers College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Department of Physics University of Fribourg Fribourg1700 Switzerland Institute of Fundamental and Frontier Sciences University of Electronic Science and Technology of China Chengdu610054 China Department of Radiation Oncology Inselspital Bern University Hospital University of Bern Bern3010 Switzerland

Complex networks have emerged as a simple yet powerful framework to represent and analyze a wide range of complex systems. The problem of ranking the nodes and the edges in complex networks is critical for a broad range of real-world problems because it affects how we access online information and products, how success and talent are evaluated in human activities, and how scarce resources are allocated by companies and policymakers, among others. This calls for a deep understanding of how existing ranking algorithms perform, and which are their possible biases that may impair their effectiveness. Well-established ranking algorithms (such as the popular Google's PageRank) are static in nature and, as a consequence, they exhibit important shortcomings when applied to real networks that rapidly evolve in time. The recent advances in the understanding and modeling of evolving networks have enabled the development of a wide and diverse range of ranking algorithms that take the temporal dimension into account. The aim of this review is to survey the existing ranking algorithms, both static and time-aware, and their applications to evolving networks. We emphasize both the impact of network evolution on well-established static algorithms and the benefits from including the temporal dimension for tasks such as prediction of real network traffic, prediction of future links, and identification of highly-significant nodes. Copyright © 2017, The Authors. All rights reserved.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

Petri nets-based method to model and analyse the self-healing web service composition

引用

International Journal of High Performance Computing and Networking 2016年第1-2期9卷 8-18页

作者： Chen, Liqiong Xiao, Lizhong Fan, Guisheng Zhang, Huanhuan Department of Computer Science and Information Engineering Shanghai Institute of Technology Shanghai China Shanghai Key Laboratory of Computer Software Evaluating and Testing Shanghai China Department of Computer Science and Engineering East China University of Science and Technology Shanghai China

Service composition is an important means for integrating the individual web services to create new value added systems that can satisfy complex requirements. Such applications are subject to unexpected failure owing to the distributive and heterogeneous environment of web service. In this paper, we propose a Petri nets-based method to model and analyse the self-healing service composition. Aspect oriented programming is used to extract composition processes and self-healing strategy as the core and crosscutting concerns. A self-healing strategy of component and service composition is proposed, and the related operations of self-healing are abstracted as meta-objects by using reflection mechanism. Petri nets are used to construct the base layer model, meta layer model, meta-object protocol and other components, thus forming the self-healing model. The operational semantics and related theories of Petri nets help prove its effectiveness and correctness. A simulation example shows that our approach correctly describes the self-healing process of service composition, and contributes to improving the quality. Copyright © 2016 Inderscience Enterprises Ltd.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

Analysis on the Content Features and Their Correlation of Web Pages for Spam Detection

引用

China Communications 2015年第3期12卷 84-94页

作者： JI Hua ZHANG Huaxiang Department of computer science Shandong Normal University Shandong Provincial key laboratory for novel distributed computer software technology

In the global information era,people acquire more and more information from the Internet,but the quality of the search results is degraded strongly because of the presence of web *** spam is one of the serious problems for search engines,and many methods have been proposed for spam *** exploit the content features of non-spam in contrast to those of *** content features for non-spam pages always possess lots of statistical regularities; but those for spam pages possess very few statistical regularities,because spam pages are made randomly in order to increase the page *** this paper,we summarize the regularities distributions of content features for non-spam pages,and propose the calculating probability formulae of the entropy and independent n-grams ***,we put forward the calculation formulae of multi features *** them,the notable content features may be used as auxiliary information for spam detection.

关键词： web spam content features feature correlation spam detection

来源：评论

学校读者我要写书评

暂无评论

Securing big data in the Cloud by protected mapping over multiple providers

Securing big data in the Cloud by protected mapping over mul...

引用

Digital Media Industry & Academic Forum (DMIAF)

作者： Chunming Rong Hongbing Cheng Martin Gilje Jaatun Department of Electronic Engineering & Computer Science University of Stavanger Norway State Key Laboratory for Novel Software Technology Nanjing University China

ISBN: (纸本)9781509010011

The Cloud is increasingly being used to store and process big data, and conventional security mechanisms using encryption are either not sufficiently efficient or not suited to the task of protecting big data in the Cloud. In this paper we present an alternative approach which divides big data among multiple Cloud providers, and instead of protecting the data itself, protects the mapping of the various data elements to each provider using a trapdoor function. Our initial analysis indicates that this is an efficient and secure approach for securing big data.

关键词： Cloud computing Big data Encryption Partitioning algorithms Memory

来源：评论

学校读者我要写书评

暂无评论

Secure Big Data Storage and Sharing Scheme for Cloud Tenants

引用

China Communications 2015年第6期12卷 106-115页

作者： CHENG Hongbing RONG Chunming HWANG Kai WANG Weihong LI Yanyan College of Computer Science Zhejiang University of Technology State Key Laboratory for Novel Software Technology Nanjing University Department of Electronic Engineering & Computer Science University of Stavanger Electrical Engineering and Computer Science University of Southern California

The Cloud is increasingly being used to store and process big data for its tenants and classical security mechanisms using encryption are neither sufficiently efficient nor suited to the task of protecting big data in the *** this paper,we present an alternative approach which divides big data into sequenced parts and stores them among multiple Cloud storage service *** of protecting the big data itself,the proposed scheme protects the mapping of the various data elements to each provider using a trapdoor ***,comparison and simulation prove that the proposed scheme is efficient and secure for the big data of Cloud tenants.

关键词： cloud computing big data stor-age and sharing security

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：