Results 1  10
of
996
Generating Representative Web Workloads for Network and Server Performance Evaluation
, 1997
"... One role for workload generation is as a means for understanding how servers and networks respond to variation in load. This enables management and capacity planning based on current and projected usage. This paper applies a number of observations of Web server usage to create a realistic Web worklo ..."
Abstract

Cited by 944 (11 self)
 Add to MetaCart
workload generation tool which mimics a set of real users accessing a server. The tool, called Surge (Scalable URL Reference Generator) generates references matching empirical measurements of 1) server file size distribution; 2) request size distribution; 3) relative file popularity; 4) embedded file
Scheduling Algorithms for Inputqueued Cell Switches
, 1995
"... The algorithms described in this thesis are designed to schedule cells in a very highspeed, parallel, inputqueued crossbar switch. We present several novel scheduling algorithms that we have devised, each aims to match the set of inputs of an inputqueued switch to the set of outputs more effici ..."
Abstract

Cited by 174 (5 self)
 Add to MetaCart
switch on a single chip. In Chapter 3 we present iSLIP, an iterative algorithm that improves upon SLIP by converging on a maximal size match. The performance of iSLIP improves with up to log 2 N iterations. We show that although it has a longer running time than SLIP, an iSLIP scheduler is little more
A classification of natural rivers.
 Catena
, 1994
"... Abstract A classification system for natural rivers is presented in which a morphological arrangement of stream characteristics is organized into relatively homogeneous stream types. This paper describes morphologically similar stream reaches that are divided into 7 major stream type categories tha ..."
Abstract

Cited by 173 (1 self)
 Add to MetaCart
specific hydraulic and sediment relations for a given morphological channel type and state; 3. Provide 'a mechanism to extrapolate sitespecific data collected on a given stream reach to those of similar character; 4. Provide a consistent and reproducible frame of reference of communication for those
Intersecting families of separated sets
 J. London Math. Soc
"... A set A ⊆ {1, 2,..., n} is said to be kseparated if, when considered on the circle, any two elements of A are separated by a gap of size at least k. We prove a conjecture due to Holroyd and Johnson [3],[4] that an analogue of the ErdősKoRado theorem holds for kseparated sets. In particular the r ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
A set A ⊆ {1, 2,..., n} is said to be kseparated if, when considered on the circle, any two elements of A are separated by a gap of size at least k. We prove a conjecture due to Holroyd and Johnson [3],[4] that an analogue of the ErdősKoRado theorem holds for kseparated sets. In particular
Longerterm effects of Head Start
 American Economic Review
, 2002
"... Abstract Public early intervention programs like Head Start are often justified as investments in children. Yet nothing is known about the longterm effects of Head Start. This paper draws on unique data from the Panel Study of Income Dynamics to provide new evidence on the effects of Head Start on ..."
Abstract

Cited by 131 (5 self)
 Add to MetaCart
term panel, we know family income when the respondent was a child. We have calculated average per capita family income (in 1999 prices) at the time the respondent was age 3, 4, 5 and 6, and, as shown in III. Empirical methods The aim of this study is to ask whether participation in Head Start results
Whom You Know Matters: Venture Capital Networks and Investment Performance,
 Journal of Finance
, 2007
"... Abstract Many financial markets are characterized by strong relationships and networks, rather than arm'slength, spotmarket transactions. We examine the performance consequences of this organizational choice in the context of relationships established when VCs syndicate portfolio company inv ..."
Abstract

Cited by 138 (8 self)
 Add to MetaCart
focus on how each measure captures a slightly different aspect of a VC's economic role in the network. 3 See Wasserman and Faust (1997) for a detailed review of network analysis methods. 4 For tractability, the graph excludes biotechfocused VC firms that have no syndication relationships during
HigherOrder Matching and Tree Automata
 Proc. Conf. on Computer Science Logic
, 1997
"... ions x 1 : : : xn are assumed to have arity one. For instance, x 1 x 2 :c(x 3 :x 3 ; x 2 (x 1 )) (assumed in normal form) has the following representation as a tree: x 1 x 2 c \Gamma \Gamma @ @ x 3 x 2 x 3 x 1 In what follows, we assume that F is finite. This is not a restriction as, for countab ..."
Abstract

Cited by 26 (0 self)
 Add to MetaCart
, we will keep the standard notations instead of using the encodings of F . 3.2 2automata We will use a slight modification of tree automata. The main difference with the definitions of [13, 4] is the presence of special symbols 2 ø which should be interpreted as any term of type ø . This slight
Continuity and discontinuity of behavioral inhibition and exuberance: Psychophysiological and behavioral influences across the first four years of life.
 Child Development,
, 2001
"... Abstract: Fourmonthold infants were screened (N = 433) for temperamental patterns thought to predict behavioral inhibition, including motor reactivity and the expression of negative affect. Those selected (N = 153) were assessed at multiple age points across the first 4 years of life for behavior ..."
Abstract

Cited by 124 (47 self)
 Add to MetaCart
set, as well as a score of 4 or more on Positive Affect during the same presentations. The Low Reactive group was comprised of infants who had scores of 3 or less on Motor Reactivity, Positive Affect, and Negative Affect during both the first and second sets of presentations. Also, an infant had
StringMatching With Automata
, 1997
"... . We present an algorithm to search in a text for the patterns of a regular set. Unlike many classical algorithms, we assume that the input of the algorithm is a deterministic automaton and not a regular expression. Our algorithm is based on the notion of failure function and mainly consists of effi ..."
Abstract

Cited by 10 (5 self)
 Add to MetaCart
of efficiently constructing a new deterministic automaton. This construction is shown to be efficient. In particular, its space complexity is linear in the size of the obtained automaton. Key words: Finite automata, patternmatching, strings. CR Classification: F.1.1, F.2.0, F.2.2, F.4.3 1. Introduction
LARGE MATCHINGS WITH FEW COLORS
, 2012
"... Let Krn denote the complete runiform hypergraph on n vertices. A matching M in a hypergraph is a set of pairwise vertex disjoint edges, and an scolored matching is a matching using edges from at most s colors. Recent Ramseytype results rely on lemmas about the size of monochromatic matchings in ..."
Abstract
 Add to MetaCart
the smallest n such that every tcoloring of Krn contains an scolored matching of size k. It has been conjectured that in every coloring of the edges of Krn with 3 colors there is a 2colored matching of size at least k provided that n ≥ kr+ k−1 r+1. The smallest nontrivial case is when r = 3 and k = 4. We
Results 1  10
of
996