Big data systems help organizations store, manipulate, and derive value from vast amounts of data. Relational database and MapRe- duce are two, arguably competing implementations of such systems. In this position paper, we combine experiences from the TPC-C benchmark with emerging insights from MapReduce application domains to argue for using a model based on functions of abstraction to construct future benchmarks for big data systems.

关键词：大数据系统；TPC-C基准测试；COM器件

查看摘要 索取原文[17页]

本刊以七大战略性新兴产业——节能环保、新一代信息技术、生物、高端装备制造、新能源、新材料、新能源汽车为研究重点，关注国家高层和各部委的动态，剖析国家和地方的新兴产业政策。本刊设有政策导读、领导讲话、七大战略性新兴产业本周国内外行业动态和重点企业新闻、投资专题四大板块，能够实时监测新兴产业和重点企业动态，把握新兴产业发展方向，研究发展重点，寻求发展机遇。

关键词：节能环保；新一代信息技术；生物；高端装备制造；新能源；新材料；新能源汽车

查看摘要 索取原文[55页]

Energy efficiency of computing devices has become a dominant area of research interest in recent years. Most of this work is focused on architectural techniques to improve power and energy efficiency; only a few consider saving energy at the algorithmic level. We prove that a region of perfect strong scaling in energy exists for matrix multiplication (classical and Strassen) and the direct (O(n2)) n-body problem via the use of 5D algorithms: This means that we can increase the number of processors by a constant factor, with the runtime (both computation and communication) decreasing by the same factor, and the total energy used remaining constant.

关键词：能量效率；计算设备；时间模型；能量模型；机器模型；5D算法

查看摘要 索取原文[17页]

The running time of an algorithm depends on both arithmetic and communication (i.e., data movement) costs, and the relative costs of communication are growing over time. In this work, we present sequential and parallel algorithms for tridiagonalizing a symmetric band matrix that asymptotically reduce communication compared to previous approaches. The tridiagonalization of a symmetric band matrix is a key kernel in solving the symmetric eigenvalue problem for both full and band matrices. In order to preserve sparsity, tridiagonalization routines use annihilate-and-chase procedures that previously have su ered from poor data locality. We improve data locality by reorganizing the computation and obtain asymptotic improvements. We consider the cases of computing eigenvalues only and of computing eigenvalues and all eigenvectors.

关键词：算法；通信；对称矩阵；并行算法

查看摘要 索取原文[27页]

One of the most significant market structure developments in recent years is high frequency trading ("HFT"). By utilizing modern high-speed computers and computation technologies, HFT firms are able to execute electronic transactions within milliseconds even microseconds and therefore taking advantage of small discrepancies in prices, and regulator are weighing new rules for high-speed trading. Although the equity market is drastically competitive, the potential opportunities are to develop advanced technologies including trading models and algorithms. The technical part mainly discussed mathematical models to process the Limit Order Book (LOB) Information, especially for the discrete model, which is quite popular in research on high frequency trading. This article mainly focus on the market making strategies, we developed two major strategies and tested them using real market data. Details of implementations of these strategies and their pros and cons are also provided.

关键词：高频交易（HFT）；交易模型；算法

查看摘要 索取原文[22页]

A standard technique is to adopt a vocabulary of commutative operations; this avoids the risk of inconsistency due to message reordering. A more powerful approach was recently captured by the CALM theorem, which proves that logically monotonic programs are guaranteed to be eventually consistent.We show how the Bloom interpreter can be generalized to support efficient evaluation of lattice-based code using well-known strategies from logic programming. Finally, we use BloomL to develop several practical distributed programs.

关键词：A标准技术；基于格的代码；分布式程序

查看摘要 索取原文[16页]

While the Internet is designed to accommodate multipletransport and application layer protocols, a large andgrowing fraction of Internet traffic runs directly overHTTP. Observing that HTTP is poised to become thede-facto “narrow waist” of the modern Internet, thispaper asks whether an HTTP narrow waist, comparedwith the an IP-layer waist, facilitates a more evolvableInternet. Evolvability is highly desirable for the Internet,since communication patterns change must faster thanthe underlying infrastructure. Furthermore, the narrow waist plays in important role in enabling or preventingarchitectural evolvability. We argue that HTTP is highlyevolvable, due to (i) naming flexibility, (ii) indirectionsupport, and (iii) explicit middleboxes. We point toevolving uses of HTTP on today’s Internet, and designingour own publisher/subscribe service, HTTP RelayService (HTTP-RS), on top of HTTP.

关键词：HTTP协议；互联网；传输层；应用层

查看摘要 索取原文[15页]

P2P systems provide a scalable solution for distributing large les in a network. The le is split into many chunks, and peers contact other peers to collect missing chunks to eventually complete the entire le. The so-called `rare chunk' phenomenon, where a single chunk becomes rare and prevents peers from completing the le, is a threat to the stability of such systems. A protocol that forces peers to download the rarest chunk in the network rst would solve this issue, however this solution requires global chunk availability information that is not readily available. We look for a distributed approximation to this solution. Although heuristics exist which perform well in practice, formal proofs of stability of such systems were lacking. In this document, we demonstrate a new system based on an approximate rare-chunk rule, allowing for completely distributed le sharing while retaining scalability and stability. We assume non-altruistic peers and the seed is required to make only a minimal contribution.

关键词：P2P系统；分布式大型LES网络；稳定性；罕见块规则

查看摘要 索取原文[30页]

Computer users trust web applications to protect their nancial transactions and online identities from attacks by cyber criminals. However, web applications today are riddled with security aws which can compromise the security of their web sessions. In this thesis, we address the problem of automatically nding and preventing script injection vulnerabilities, one of the most prominent classes of web application vulnerabilities at present. Speci cally, this thesis makes three contributions towards addressing script injection vulnerabilities. First, we propose two techniques that together automatically uncover script injection vulnerabilities in client-side JavaScript components of web applications without raising false positives. Second,we empirically study the use of sanitization, which is the predominant defense technique to prevent these attacks today. We expose two new classes of errors in the practical use of sanitization in shipping web applications and demonstrate weaknesses of emerging defenses employed in widely used web application frameworks. Third, we propose a type-based approach to automatically perform correct sanitization for applications authored in emerging web application frameworks. Finally, we propose a conceptual framework for a sanitizationfree defense against script injection vulnerabilities, which can form a robust second line of defense.

关键词：应用程序漏洞；新兴防御；第二行防御；脚本注入漏洞；安全

查看摘要 索取原文[167页]

Middleboxes are ubiquitous in today’s networks and perform a variety of important functions,In this paper, we analyze several natural packet scheduling algorithms for multiple resources and show that they have undesirable properties. We propose a new algorithm, Dominant Resource Fair Queuing (DRFQ), that retains the attractive properties that fair sharing provides for one resource.

关键词：中间件；加权公平分享链；资源公平队列

查看摘要 索取原文[33页]