ppxscal/embedding_network huggingface dataset:
Performance coupling for sequential and parallel applications
Authors: Valerie Taylor
Venue:  (2003)

In this disserataion, we generalize an approach to performance optimization outlined in a previous Master's work[12]. The approach takes into account the context of the kernel being optimized. The equation cS=pS Fk&isin;S k 1 is used to evaluate how well various kernels interact with other portions of the application. The value (cS ) can be put into one of three sets: (1) No interaction: yielding no change in performance; (2) Constructive coupling: some resource(s) are being shared between the kernels, producing a performance gain; (3) Destructive coupling: the kernels interfere with each other, resulting in a performance loss. The coupling parameter has the following uses: (1) Identify application bottlenecks for optimization. This insight led to an improvement of up to 41% fewer L1 cache misses in one application. (2) Provide insight to an algorithm on a particular architecture to come up with a new algorithm more suited to the architecture. We applied this technique on a second application and saw an improvement of up to 14% faster execution times. (3) Provide system designers with a method for evaluating overlap between the computational and communication subsystems. We characterized the overlapping of asynchronous messages with computation on the BlueHorizon machine at SDSC and demonstrated how the LogGP model fails to capture the actual run-time produced by the ping-with-computation microbenchmark. We also show how this benchmark captures a feature not captured by the more pervasive ping and pingpong microbenchmarks and argue that it should be included as a regular part of characterizing a message passing system. (4) Provide a factor that application models should consider when producing full application predictions. We defined a model that incorporates coupling parameters to produce highly accurate predictions typically exceeding a popular technique by a wide margin. These uses allow us to take into account the interaction between kernels that is most important to the measurement consumer. The coupling parameter can take various measurements of interest and provide the user with good ways of presenting them succinctly such that more insight is gained into the algorithm or application running on a specific architecture.
Wireless network interface energy consumption: implications for popular streaming formats
Authors: Surendar Chandra
Venue: Multimedia Systems (2003)

With the proliferation of mobile streaming multimedia, available battery capacity constrains the end-user experience. Since streaming applications are expected to be long running, wireless network interface card's (WNIC) energy consumption is particularly an acute problem. In this work, we explore various mechanisms to conserve client WNIC energy consumption for popular streaming formats such as Microsoft Windows media, Real and Apple Quicktime. First, we investigate the WNIC energy consumption characteristics for these popular multimedia streaming formats under varying stream bandwidth and network loss rates. We show that even for a high bandwidth 2000 kbps stream, the WNIC unnecessarily spent over 56% of the time in idle state; illustrating the potential for significant energy savings.Based on these observations, we explore two mechanisms to conserve the client WNIC energy consumption. First we show the limitations of IEEE 802.11 power saving mode for multimedia streams. Without an understanding of the stream requirements, these scheduled rendezvous mechanisms do not offer any energy savings for multimedia streams over 56 kbps. We also develop history-based client-side strategies to reduce the energy consumed by transitioning the WNICs to a lower power consuming sleep state. We show that streams optimized for 28.8 kbps can save over 80% in energy consumption with 2% data loss. A high bandwidth stream (768 kbps) can still save 57% in energy consumption with less than 0.3% data loss. We also show that Real and Quicktime packets are harder to predict at the network level without understanding the packet semantics. As the amount of cross traffic generated by other clients that share the same wireless segment increases, the potential energy savings from our client side policies deteriorate further. Our work enables multimedia proxy and server developers to suitably customize the stream to lower client energy consumption.
How to Build Virtual Environment Systems with Component Frameworks
Authors: Manuel Oliveira, Mel Slater, Jon Crowcroft
Venue: Proceedings of the 2003 International Conference on Cyberworlds (2003)

The Internet, as an accessible network with globalconnectivity, presents itself as the likely solution for thesupporting infrastructure of cyberspace. In contrast, thefield of Virtual Environments (VE) is fragmented with awide proliferation of different systems, as a result of thecurrent development trend. However, these divergentsystems present a significant overlap of functionality thatrepresents a waste of development resources and adetriment to innovation.This paper proposes Mayhem as a new approach tothe design and development of VE systems. Our approachrelies heavily on component design methodology coupledwith a simple layered approach to system architectures.The combination of the two promotes the construction ofsystems from smaller building blocks, which may havebeen developed by different sources, each specializing inthe supported functionality. Although Mayhem promotesthe trend of middleware, it requires a common baseinfrastructure - the Java Adaptive Dynamic Environment(JADE). To demonstrate how to build a VE system usingMayhem, the paper describes a simple prototype of a VEand some of its key building blocks.
EM-based maximum likelihood parameter estimation for multivariate generalized hyperbolic distributions with fixed &lambda;
Authors: Rostislav S. Protassov
Venue: Statistics and Computing (2004)

Generalized Hyperbolic distribution (Barndorff-Nielsen 1977) is a variance-mean mixture of a normal distribution with the Generalized Inverse Gaussian distribution. Recently subclasses of these distributions (e.g., the hyperbolic distribution and the Normal Inverse Gaussian distribution) have been applied to construct stochastic processes in turbulence and particularly in finance, where multidimensional problems are of special interest. Parameter estimation for these distributions based on an i.i.d. sample is a difficult task even for a specified one-dimensional subclass (subclass being uniquely defined by &lambda;) and relies on numerical methods. For the hyperbolic subclass (&lambda; &equals; 1), computer program &lsquo;hyp&rsquo; (Bl&aelig;sild and S&oslash;rensen 1992) estimates parameters via ML when the dimensionality is less than or equal to three. To the best of the author's knowledge, no successful attempts have been made to fit any given subclass when the dimensionality is greater than three. This article proposes a simple EM-based (Dempster, Laird and Rubin 1977) ML estimation procedure to estimate parameters of the distribution when the subclass is known regardless of the dimensionality. Our method relies on the ability to numerically evaluate modified Bessel functions of the third kind and their logarithms, which is made possible by currently available software. The method is applied to fit the five dimensional Normal Inverse Gaussian distribution to a series of returns on foreign exchange rates.
The iridescent system: an automated data mining method to identify, evaluate, and analyze sets of relationships within textual databases
Authors: Jonathan Daniel Wren
Venue:  (2003)

Individuals are limited in their ability to read, remember and compare relationships within the vast amount of scientific literature available. This is not only because the amount of literature is increasing exponentially, but the number of things being researched within is as well. Adding to the scale of analysis are new technologies that increase the rate by which data is being gathered from scientific experiments. For most areas of research interest, the scale of analysis exceeds an individual's ability to be aware of all the relationships contained within. Thus, an informatics approach is necessary to identify large-scale trends, shared relationships and novel relationships that are not contained within the literature, but are the logical consequence of relationships that are. A system has been designed to establish a network of relationships between &ldquo;objects&rdquo; of research interest (e.g. genes, chemical compounds, drugs, diseases and clinical phenotypes) by extracting information from scientific text in an automated manner. This system, called IRIDESCENT (Implicit Relationship IDEntification by in-Silico Construction of an Entity-based Network from Text), enables the discovery of novel relationships by identifying and scoring objects sharing large sets of relationships with an object of interest. IRIDESCENT also allows sets of objects to be analyzed for shared relationships, such as responding genes from a microarray experiment. Herein is described the development and workings of IRIDESCENT as well as several well-developed applications of the system.
RACCOOM: A Rate-Based Congestion Control Approach for Multicast
Authors: Yuan Gao, Jennifer C. Hou, Sanjoy Paul
Venue: IEEE Transactions on Computers (2003)

Abstract--As multicast applications have become widely deployed on the Internet, it is increasingly important to ensure these applications respond to network congestion in a TCP-friendly manner so as to coexist with TCP connections (which constitute the majority of the Internet traffic). In this paper, we present a RAte-based Congestion COntrOl scheme for Multicast, called RACCOOM, for applications that deploy source-based multicast trees as the communication paradigm. In the absence of packet loss, a RACCOOM session keeps track of the congestion status of the on-tree path with the largest round trip time (called the target path) and adjusts its sending rate using a TCP Vegas-like method. Upon detection of packet loss anywhere in the multicast tree, RACCOOM then responds by reducing its sending rate by half in a TCP-Reno manner. The ACK aggregation method used in RACCOOM prevents ACK implosion and yet provides the sender with a simple but comprehensive view of congestion conditions in the multicast tree. Finally, RACCOOM is equipped with mechanisms to deal with changes of the target path due to traffic change and member join/leave. To achieve TCP-friendliness, we have devised a simple method in RACCOOM to emulate how a TCP connection would behave under the same packet loss and delay characteristics. The results thus derived are used by RACCOOM to online adjust the parameters of its rate adjustment method. Alternatively, we can achieve (weighted) fairness (in terms of bandwidth sharing) among competing RACCOOM connections based on results obtained from feedback control theory. We validate the design, and demonstrate the features, of RACCOOM in ns-2. The encouraging simulation results, coupled with the fact that all the RACCOOM operations except acknowledgment aggregation (which requires modest router support) can be performed at end hosts, suggest that RACCOOM is a practical and yet effective congestion control solution for multicast applications.
Computational methods for transcription analysis using oligonucleotide microarrays
Authors: Brian Curtis Tjaden
Venue:  (2003)

With the rapid growth in genomic information in recent years comes the computational challenge of extracting biological insight from this wealth of data. This thesis focuses on computational techniques for analysis of one particular source of high-throughput biological information, oligonucleotide microarrays. Oligonucleotide microarrays are an emerging technology which allow the simultaneous measurement of the expression levels of thousands of gene transcripts. Traditionally, microarrays have been used to assay only the translated regions of genes. In this thesis, we present an algorithm for the analysis of oligonucleotide microarray data which identifies transcripts throughout an entire genome, including intergenic regions. Our results demonstrate that this is an effective approach for identifying untranslated transcripts on a genome-wide scale. The application of our algorithm to oligonucleotide microarray data from the microorganism Escherichia coli enabled us to identify a number of new transcripts, including previously undiscovered small RNA genes. We then improve our transcript identification algorithm to a probabilistic approach using hidden Markov models which allows us more accurate transcript detection. In addition, we develop a novel clustering algorithm for gene expression data which incorporates error information about gene expression measurements. The clustering algorithm is motivated by the repeat gene expression measurements from oligonucleotide microarrays which enable us to estimate the error of these measurements. We find that the high density of oligonucleotide microarrays and the specificity of the short oligonucleotide probes on these microarrays provide data which enables us to extract new biological understanding of an organism's transcriptome.
Universal Covers of Geometries of Far Away Type
Authors: Antonio Pasini
Venue: Journal of Algebraic Combinatorics: An International Journal (2003)

The geometries studied in this paper are obtained from buildings of spherical type by removing all chambers at non-maximal distance from a given element or flag. I consider a number of special cases of the above construction chosen among those which most frequently appear in the literature, proving that the resulting geometry is always simply connected but for three cases of small rank defined over GF(2) and GF(4). I also compute the universal cover in those exceptional cases.
Explaining the enjoyment of playing video games: the role of competition
Authors: Peter Vorderer, Tilo Hartmann, Christoph Klimmt
Venue: Proceedings of the second international conference on Entertainment computing (2003)

The tremendous and still growing popularity of computer and video games has inspired Communication Researchers and Media Psychologists to investigate the factors of the enjoyment experienced by the players. Apparently, the games' interactivity allows for a continuous stream of challenging and competitive situations that have to be resolved by the players. Competition is therefore regarded a key element of the explanation of players' entertainment experience. Subsequent to a theoretical explication, empirical evidence for the role of competition in the playing process and the impact of competitiveness for selective exposure to computer games is reported from a field experiment (N = 349) and an online survey study (N = 795).
Distributed information retrieval: a multi-objective resource selection approach
Authors: Shengli Wu, Fabio Crestani
Venue: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (2003)

Information retrieval is becoming increasingly concerned with resource selection and data fusion for distributed archives. In distributed information retrieval, a user submits a query to a broker, which determines a solution for how to yield a given number of documents from all available resources. In this paper, we present a multi-objective model for resource selection, in which four aspects: a document's relevance to the given query, time, monetary cost, and the chance of getting document duplicates from resources, are considered simultaneously. Some variants of this multi-objective model, aimed at achieving better implementation efficiency, are also proposed.
A dictionary-based en/decoding scheme for low-power data buses
Authors: Tiehan Lv, Jörg Henkel, Haris Lekatsas, Wayne Wolf
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2003)

As bus lengths on multihundred-million transistor systems-on-a-chip (SOC) grow, and as interwire capacitances of sub-0.10/µm technologies advance, the resulting high-switching capacitances of buses (and interconnects in general) have a nonnegligible impact on the power consumption of a whole SOC. This trend has been recognized and recently addressed by various research groups.We address this problem by introducing our bus encoding technique, adaptive dictionary-encoding scheme "ADES" that minimizes the power consumption of data buses through a dictionary-based encoding technique. Based on exploration of data properties on buses, our technique saves on average more than 25% of bus energy compared to the nonencoded cases using a large set of real-world applications for both address and data buses. Furthermore, we compare our technique to the best-known data bus encoding techniques to date and we find that it exceeds all of them in terms of energy savings for the same set of applications.
A Low Power Strategy for Future Mobile Terminals
Authors: Mladen Nikitovic, Mats Brorsson
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

In this paper, we have investigated the efficiency of two power-saving strategies that reduces both static and dynamic power consumption when applied to a chip-multiprocessor (CMP). They are evaluated under two workload scenarios and compared against a conventional uni-processor architecture and a CMP without any power-aware scheduling. The results show that energy due to static and dynamic power consumption can be reduced by up to 78% and that further 8% energy can be saved at the expense of response-time of non-critical applications.Furthermore, a small study on the potential impact of system-level events showed that system calls can contribute significantly to the total energy consumed.
Synthesis of 3-D Separable-Denominator State-Space Digital Filters with Minimum L2-Sensitivity
Authors: Takao Hinamoto, Yuji Sugie, Akimitsu Doi, Mitsuji Muneyasu
Venue: Multidimensional Systems and Signal Processing (2004)

This paper deals with the analysis and minimization of L2-sensitivity for three-dimensional state-space digital filters which are separable in the denominator. First, a novel expression for evaluating the L2-sensitivity is developed in closed form. An iterative procedure for synthesizing the optimal filter structures is then presented so as to minimize the L2-sensitivity. Finally, a numerical example is given to illustrate the utility of the proposed technique.
Bootstrapping Rule Induction
Authors: Lemuel R. Waitman, Douglas H. Fisher, Paul H. King
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

Most rule learning systems posit hard decision boundariesfor continuous attributes and point estimates of ruleaccuracy, with no measures of variance, which may seemarbitrary to a domain expert. These hard boundaries/pointschange with small perturbations to the training data. Moreover,rule induction typically produces a large number ofrules that must be filtered and interpreted by an analyst.This paper describes a method of combining rules over multiplebootstrap replications of rule induction so as to reducethe total number of rules presented to an analyst and to providemeasures of variance to continuous attribute decisionboundaries and accuracy-point estimates. The method isillustrated with perioperative data.
Computerized conferencing for the deaf and handicapped
Authors: Murray Turoff
Venue: Issue 16 (June 1975) (1975)

This summary paper briefly describes a unique an d relatively new medium for human communication utilizing current computer and communication technology. However, emphasis is placed on the tremendous potential benefits that this form of communication can have for the deaf and physically handicapped since this form of communication eliminates restrictions on communication imposed by lack of mobility or transportation, lack of speech, and requirements of time coincidence among members of a discussion.
The AD-MIX Protocol for Encouraging Participation in Mobile Ad Hoc Networks
Authors: Swaminathan Sundaramurthy, Elizabeth M. Belding-Royer
Venue: Proceedings of the 11th IEEE International Conference on Network Protocols (2003)

Mobile ad hoc networks are autonomous self-organized networks in which each node relies on the other nodes in the network to perform routing on its behalf. Proper functioning of the network is dependent on participation and cooperation of the nodes in routing and packet forwarding. Unfortunately, providing these services may not be in the best interest of a mobilenode, since it results in the depletion of the node's resources. Selfish behavior by a node may result in degraded network performance due to denial of service, decrease in network throughput and partitioning of the network. Because it is in a node's interest to not forward traffic, nodes should be given some form of incentive for the services they provide.In this paper, we address the problem of selfishness in mobile ad hoc networks by proposing a protocol called AD-MIX that encourages participation. AD-MIX discourages selfishness by concealing the true destination of packets from intermediate nodes along the path, forcing a node to participate or risk dropping packets destined for itself. Simulation results show that employing AD-MIX encourages participation without a significant increase in overhead. In addition to encouraging participation, AD-MIX also facilitates anonymization and secure communication between nodes.
TLC: Transmission Line Caches
Authors: Bradford M. Beckmann, David A. Wood
Venue: Proceedings of the 36th annual IEEE/ACM International Symposium on Microarchitecture (2003)

It is widely accepted that the disproportionate scalingof transistor and conventional on-chip interconnect performancepresents a major barrier to future high performancesystems. Previous research has focused on wire-centricdesigns that use parallelism, locality, and on-chipwiring bandwidth to compensate for long wire latency.An alternative approach to this problem is to exploitnewly-emerging on-chip transmission line technology toreduce communication latency. Compared to conventionalRC wires, transmission lines can reduce delay by up to afactor of 30 for global wires, while eliminating the needfor repeaters. However, this latency reduction comes at thecost of a comparable reduction in bandwidth.In this paper, we investigate using transmission linesto access large level-2 on-chip caches. We propose a familyof Transmission Line Cache (TLC) designs that representdifferent points in the latency/bandwidth spectrum.Compared to the recently-proposed Dynamic Non-UniformCache Architecture (DNUCA) design, the base TLCdesign reduces the required cache area by 18% andreduces the interconnection network's dynamic powerconsumption by an average of 61%. The optimized TLCdesigns attain similar performance using fewer transmis-sionlines but with some additional complexity. Simulationresults using full-system simulation show that TLC providesmore consistent performance than the DNUCAdesign across a wide variety of workloads. TLC caches arelogically simpler than DNUCA designs, but requiregreater circuit and manufacturing complexity.
Temporal web log mining using olap techniques
Authors: I. Petrounias, A. Assaid
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

This paper is concerned with mining temporal features from web logs. We present two methods. The first one concerns the temporal mining of sequential patterns in which we use sequence data which are used as support for discovered patterns in order to find periodicity in web log data. The second one concerns an efficient method for finding periodicity in web log sequence data which handles missing sequences by dealing with the overlap problem.