2
2.0

Jun 29, 2018
06/18

by
Yanpei Liu; Guilherme Cox; Qingyuan Deng; Stark C. Draper; Ricardo Bianchini

texts

#
eye 2

#
favorite 0

#
comment 0

Future servers will incorporate many active lowpower modes for different system components, such as cores and memory. Though these modes provide flexibility for power management via Dynamic Voltage and Frequency Scaling (DVFS), they must be operated in a coordinated manner. Such coordinated control creates a combinatorial space of possible power mode configurations. Given the rapid growth of the number of cores, it is becoming increasingly challenging to quickly select the configuration that...

Topics: Performance, Computing Research Repository

Source: http://arxiv.org/abs/1603.01313

3
3.0

Jun 29, 2018
06/18

by
Yanpei Liu; Xinyun Chen; Chang Liu; Dawn Song

texts

#
eye 3

#
favorite 0

#
comment 0

An intriguing property of deep neural networks is the existence of adversarial examples, which can transfer among different architectures. These transferable adversarial examples may severely hinder deep neural network-based applications. Previous works mostly study the transferability using small scale datasets. In this work, we are the first to conduct an extensive study of the transferability over large models and a large scale dataset, and we are also the first to study the transferability...

Topics: Computing Research Repository, Learning

Source: http://arxiv.org/abs/1611.02770

40
40

Sep 22, 2013
09/13

by
Gauri Joshi; Yanpei Liu; Emina Soljanin

texts

#
eye 40

#
favorite 0

#
comment 0

We study the fundamental trade-off between storage and content download time. We show that the download time can be significantly reduced by dividing the content into chunks, encoding it to add redundancy and then distributing it across multiple disks. We determine the download time for two content access models - the fountain and fork-join models that involve simultaneous content access, and individual access from enqueued user requests respectively. For the fountain model we explicitly...

Source: http://arxiv.org/abs/1210.3012v1

42
42

Sep 20, 2013
09/13

by
Linfan Mao; Yanpei Liu

texts

#
eye 42

#
favorite 0

#
comment 0

A map is a connected topological graph $\Gamma$ cellularly embedded in a surface. In this paper, applying Tutte's algebraic representation of map, new ideas for enumerating non-equivalent orientable or non-orientable maps of graph are presented. By determining automorphisms of maps of Cayley graph $\Gamma={\rm Cay}(G:S)$ with ${\rm Aut} \Gamma\cong G\times H$ on locally, orientable and non-orientable surfaces, formulae for the number of non-equivalent maps of $\Gamma$ on surfaces (orientable,...

Source: http://arxiv.org/abs/math/0607791v1

38
38

Jul 20, 2013
07/13

by
Guanghua Dong; Ning Wang; Yuanqiu Huang; Yanpei Liu

texts

#
eye 38

#
favorite 0

#
comment 0

The vertex v of a graph G is called a 1-critical-vertex for the maximum genus of the graph, or for simplicity called 1-critical-vertex, if G-v is a connected graph and {\deg}M(G - v) = {\deg}M(G) - 1. In this paper, through the joint-tree model, we obtained some types of 1-critical-vertex, and get the upper embeddability of the Spiral Snm .

Source: http://arxiv.org/abs/1203.0843v1

45
45

Sep 23, 2013
09/13

by
Yanpei Liu; Stark C. Draper; Nam Sung Kim

texts

#
eye 45

#
favorite 0

#
comment 0

In this paper we study the power-performance relationship of power-efficient computing from a queuing theoretic perspective. We investigate the interplay of several system operations including processing speed, system on/off decisions, and server farm size. We identify that there are oftentimes "sweet spots" in power-efficient operations: there exist optimal combinations of processing speed and system settings that maximize power efficiency. For the single server case, a widely...

Source: http://arxiv.org/abs/1303.1561v1

44
44

Sep 21, 2013
09/13

by
Yanpei Liu; Jing Yang; Stark. C. Draper

texts

#
eye 44

#
favorite 0

#
comment 0

We consider the resource allocation problem in cooperative wireless networks wherein nodes perform mutual information accumulation. We consider a unicast setting and arbitrary arrival processes at the source node. Source arrivals can be broken down into numerous packets to better exploit the spatial and temporal diversity of the routes available in the network. We devise a linear-program-based algorithm which allocates network resource to meet a certain transmission objective. Given a network,...

Source: http://arxiv.org/abs/1108.3097v1

114
114

Jul 20, 2013
07/13

by
Yanpei Liu; Stark C. Draper; Akbar M. Sayeed

texts

#
eye 114

#
favorite 0

#
comment 0

We design and analyze a method to extract secret keys from the randomness inherent to wireless channels. We study a channel model for multipath wireless channel and exploit the channel diversity in generating secret key bits. We compare the key extraction methods based both on entire channel state information (CSI) and on single channel parameter such as the received signal strength indicators (RSSI). Due to the reduction in the degree-of-freedom when going from CSI to RSSI, the rate of key...

Source: http://arxiv.org/abs/1107.3534v2

35
35

Sep 23, 2013
09/13

by
Jing Yang; Yanpei Liu; Stark C. Draper

texts

#
eye 35

#
favorite 0

#
comment 0

In this paper we develop scheduling policies that maximize the stability region of a wireless network under the assumption that mutual information accumulation is implemented at the physical layer. When the link quality between nodes is not sufficiently high that a packet can be decoded within a single slot, the system can accumulate information across multiple slots, eventually decoding the packet. The result is an expanded stability region. The accumulation process over weak links is...

Source: http://arxiv.org/abs/1109.2583v2

43
43

Jul 20, 2013
07/13

by
Guanghua Dong; Ning Wang; Yuanqiu Huang; Han Ren; Yanpei Liu

texts

#
eye 43

#
favorite 0

#
comment 0

The weak minor G of a graph G is the graph obtained from G by a sequence of edge-contraction operations on G. A weak-minor-closed family of upper embeddable graphs is a set G of upper embeddable graphs that for each graph G in G, every weak minor of G is also in G. Up to now, there are few results providing the necessary and sufficient conditions for characterizing upper embeddability of graphs. In this paper, we studied the relation between the vertex splitting operation and the upper...

Source: http://arxiv.org/abs/1203.0840v1

46
46

Sep 20, 2013
09/13

by
Linfan Mao; Yanpei Liu; Feng Tian

texts

#
eye 46

#
favorite 0

#
comment 0

A map is a connected topological graph cellularly embedded in a surface and a complete map is a cellularly embedded complete graph in a surface. In this paper, all automorphisms of complete maps of order n are determined by permutations on its vertices. Applying a scheme for enumerating maps on surfaces with a given underlying graph, the numbers of unrooted complete maps on orientable or non-orientable surfaces are obtained.

Source: http://arxiv.org/abs/math/0607790v1

4
4.0

Jun 30, 2018
06/18

by
Yanpei Liu; Stark C. Draper; Nam Sung Kim

texts

#
eye 4

#
favorite 0

#
comment 0

Power consumption in data centers has been growing significantly in recent years. To reduce power, servers are being equipped with increasingly sophisticated power management mechanisms. Different mechanisms offer dramatically different trade-offs between power savings and performance penalties. Considering the complexity, variety, and temporally varying nature of the applications hosted in a typical data center, intelligently determining which power management policy to use and when is a...

Topics: Performance, Systems and Control, Computing Research Repository

Source: http://arxiv.org/abs/1404.5121

A map is a 2-cell decomposition of surface, which can be seen as a connected graphs in development from partition to permutation, also a basis for constructing Smarandache systems, particularly, Smarandache 2-manifolds for Smarandache geometry. As an introductory book, this book contains the elementary materials in map theory, including embeddings of a graph, abstract maps, duality, orientable and non-orientable maps, isomorphisms of maps and the enumeration of rooted or unrooted maps,...