ppxscal/embedding_network huggingface dataset:
Computation history-based prediction
Authors: Renju Thomas
Venue:  (2003)

Modern microprocessors increasingly apply aggressive speculation techniques to overcome performance barriers. Two such speculation techniques of particular interest are branch prediction and data value prediction, which attempt to overcome the effects of control dependencies and true data dependencies, respectively. These speculation schemes collect a part of the processor state from different points of time and blend these histories, creating a prediction history for predictor table lookup. Existing schemes mostly use local histories, global histories or their combinations as the prediction history. For generating an accurate prediction, the prediction history has to be highly correlated to the outcome being predicted; it is not straightforward to choose the best state components from the voluminous amount of processor state. We present an analysis and characterization of unpredictability for data values; we also overview the unpredictability of branches. We show that data flow and control flow interact in various ways that result in predictability loss for many instructions. We propose a novel framework for deriving the prediction histories. Our framework uses a class of processor state that we call computation histories. We propose several novel predictors&mdash;branch predictors as well as value predictors&mdash;that are based on the computation history concept. We introduce a novel prediction algorithm called Dynamic Dataflow-inherited Speculative Context (DDISC) predictor, based on computation history, and show how to build DDISC branch predictors and value predictors. We also present branch predictors that derive their prediction histories using another class of computation history that we term affectors. We show how to identify a subset of correlated branches from a large global history, based on the affector concept. Finally, we present the OPSHIFT branch predictor&mdash;another computation history based predictor that uses the affector concept at instruction granularity.
Scaling Web Services with Capacity Provision Networks
Authors: Xianjun Geng, Ram D. Gopal, R. Ramesh, Andrew B. Whinston
Venue: Computer (2003)

With the increasing proliferation of e-commerce and e-business activities, many service providers are turning to Web caching solutions to move important content and processes closer to end users. Uncertainties in user demand and rapid market changes pose significant impediments to effective cache planning and deployment solutions, however.
A fast algorithm for optimal alignment between similar ordered trees
Authors: Jesper Jansson, Andrzej Lingas
Venue: Fundamenta Informaticae (2002)

We present a fast algorithm for optimal alignment between two similar ordered trees with node labels. Let S and T be two such trees with |S| and |T| nodes, respectively. If there exists an optimal alignment between S and T which uses at most d blank symbols and d is known in advance, it can be constructed in O(n log n. (maxdeg)3 . d2) time, where n = max{|S|, |T|} and maxdeg is the maximum degree of all nodes in S and T. If d is not known in advance, we can construct an optimal alignment in O(n log n. (maxdeg)3. f2) time, where f is the difference between the highest possible score for any alignment between two trees having a total of |S| + |T| nodes and the score of an optimal alignment between S and T, if the scoring scheme satisfies some natural assumptions. In particular, if the degrees of both input trees are bounded by a constant, the running times reduce to O(n log n . d2) and O(n log n. f2), respectively.
Detail-Preserving Variational Design of B-Spline Curves and Surfaces
Authors: Gang Zhao, Shuhong Xu, Weishi Li
Venue: Proceedings of the 2003 International Conference on Cyberworlds (2003)

Multiresolution models provide a powerful tool forcomplex shape multiresolution editing. However, it is stillhard and not intuitive to modify the overall shape of amodel while preserving its details by manipulating itscontrol points at lower resolution levels. A better controlof deformations and a more intuitive interface shouldallow the user to control the deformation of a model bymanipulating the model directly. This can be achieved byusing variational modeling techniques. This paperpresents a variational framework for multiresolutionmodel design. The modeled shape is represented as amultiresolution B-spline curve or surface, which can beinteractively deformed by direct user inputs. The focus ofthis paper is on handling multiresolution constraints andpreserving surface details throughout the deformationprocess. To avoid smoothing out the details of the shape invariational modeling, we optimize the deformation energyalone instead of the total energy of the deformed shape.To accelerate the convergence of the iterative energyminimization process, a wavelet-based iterative method isused to compute the solution in a hierarchical fashion.
Strategic contributions of game rooms to knowledge management: some prelimenary insights
Authors: Kevin C. Desouza
Venue: Information and Management (2003)

Academics and practitioners have stressed the significance of managing knowledge in today's competitive environment. This has resulted in many efforts to increase knowledge exchange between organizational members. Much work so far has focused on the use of information technology as either a solution or enabler of knowledge management. While information technology enables easy exchange of explicit knowledge, its contributions to sharing tacit knowledge is restricted to connecting individuals via tools, such as e-mail and groupware. This research adds to the literature by reporting on a people-centered perspective for facilitating tacit knowledge exchange. The article describes an in-depth case study carried out to determine the role played by game rooms in the exchange of tacit knowledge.
Genre Characteristics -- A Front Page Analysis of 85 Swedish Online Newspapers
Authors: Carina Ihlström, Maria Åkesson
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 4 - Volume 4 (2004)

The online newspapers entered the Internet in the mid-nineties and since then it has become more and more common to read news online. There is a long tradition of designing newspapers in print but today there is a demand from both academics and practitioners for more knowledge about how to design user friendly news sites. The challenge is to design the online newspaper, in this rapidly changing media, to be the same familiar, user friendly and universally accepted product as the printed newspaper. We have designed a study in three parts to address this challenge. The overall research question is: How can design for a media in rapid development be communicated within a genre? The purpose of the first part of the study, presented in this paper, is to build a framework for identifying genre characteristics and to describe the Swedish online newspaper genre of today. We have conducted a front page analysis on the total population of 85 Swedish online newspapers. We suggest a quadruple of the genre concepts ¿content, form, functionality, positioning¿ and a grid to handlepositioning when building the framework. To describe the Swedish online newspaper genre we have used the taxonomy for the evolution of cybergenres together with the so called broadsheet metaphor. Aiming at a more comprehensive understanding of the online newspaper genre we modified the model by adding the leaf node progressed'.
The impact of background and experience on software inspections
Authors: Jeffrey Clark Carver
Venue:  (2003)

This dissertation is an initial study into the relationship between an inspector's characteristics and his or her effectiveness in an inspection. Research has shown that improving the individual effectiveness of the inspectors improves the overall effectiveness of an inspection team. But, the performance of inspectors varies widely, even when using the same inspection technique. This variation is often due to the inherent differences among the inspectors who used the technique. In order to better understand this variation and provide guidance to inspection planners, this dissertation has focused on the background and experience of the inspector as the source of variation. To study this issue I used a novel approach for software engineering, grounded theory. This methodology allowed hypotheses to be built both top-down, from the literature, as well as bottom-up, using data. The literature portion came from software engineering as well as education and psychology. The data portion came from both existing studies and newly designed studies. The data from existing studies allowed the initial hypotheses to become more concrete. Once some of the hypotheses had support from data, the final step was to design studies to test a subset of the hypotheses. I designed and ran two studies to test the selected hypotheses. The goal of the first study was to understand the type and level of experience with the software inspection process that was necessary. The earlier data had shown that process experience was important, but the effect of the type and level of experience was still unclear. The goal of the second study was to understand the interaction between an inspector's software development experience and the level of detail required in an inspection process. The earlier data had shown some indications that for experienced inspectors too much detail reduced the number of defects found, while less experienced inspectors needed more detail to overcome their lack of experience and find more defects. This dissertation presents complete list of hypotheses and the results of these studies along with some specific suggestions for both researchers and practitioners.
Conceptualizing the SMEs' assimilation of internet-based technologies
Authors: Pratyush Bharati, Abhijit Chaudhury
Venue: Managing e-commerce and mobile computing technologies (2003)

This chapter conceptualizes a model for the assimilation of Internet-based technologies in small and medium euterprises (SMEs). The research examines the factors influencing the assimilation of Internet-based technologies and the penetration of these technologies in SMEs. Internet-based technologies are complex organizational technologies. The model uses the learning related scale, related knowledge and diversity, together with several control variables like host size, IT size, specialization and education. Several external factors, such as influence of customers, suppliers, vendors and competitors, that have been suggested in studies of SMEs have also been included to explain the assimilation and diffusion of innovation. The results of an exploratory survey are presented and future research is discussed.
Working group reports from ITiCSE on Innovation and technology in computer science education
Venue: Annual Joint Conference Integrating Technology into Computer Science Education (2002)

Working Groups have been a key part of the annual ITiCSE conference from its beginning. The concept is to bring together a small number of people interested in a topic for intense interaction over the week of ITiCSE. The work actually begins long before the conference via email and continues afterwards. Arriving early, Working Groups work through the conference, taking some time out for presentations and a few talks. The coordinator tries to get the participants to take a few breaks in thee work, but it is quite intense. It is also very rewarding.Many of the groups have been meeting at ITiCSE and elsewhere for a number of years and established working communities have formed.After the conference the groups have some time to polish their reports. The reports have been commented on by referees, and have been then rewritten again in light of these comments. The reports here are the results of this long process.Five Groups met in Aarhus in 2002, and, as usual, they cover a wide range of important topics;Tom Naps and Guido Roessling continue a long lived group working on visualization. The focus this year was on improving the educational impact of visualization.John Dougherty formed a new group on Fluency in Information Technology. The starting premise is that literacy is no longer sufficient for today's students.Martin Dick and Judy led a group on academic honesty covering many aspects of this vital topic. They were seeking practical solutions for educators.Peter Henderson's group continues to work on the mathematical element of computing, this year focusing on developing materials for mathematical thinking.Pam Lawhead and Constance Bland formed a group to bring together resources on using Lego Mindstorms to teach programming and problem solving.Vicki Almstrum at Austin, Texas, has ably documented the activities of Working Groups over the years. See http://www.cs.utexas.edu/users/csed/iticse/ for full specifications of the Groups' original stated purpose, and full details (including pictures) of the participants. Equivalent information is available going back to the first ITiCSE conference in 1996.
First steps towards automatic recognition of spontaneous facial action units
Authors: B. Braathen, M. S. Bartlett, G. Littlewort, J. R. Movellan
Venue: Proceedings of the 2001 workshop on Perceptive user interfaces (2001)

We present ongoing work on a project for automatic recognition of spontaneous facial actions (FACs). Current methods for automatic facial expression recognition assume images are collected in controlled environments in which the subjects deliberately face the camera. Since people often nod or turn their heads, automatic recognition of spontaneous facial behavior requires methods for handling out-of-image-plane head rotations. There are many promising approaches to address the problem of out-of-image plane rotations. In this paper we explore an approach based on 3-D warping of images into canonical views. Since our goal is to explore the potential of this approach, we first tried with images with 8 hand-labeled facial landmarks. However the approach can be generalized in a straight-forward manner to work automatically based on the output of automatic feature detectors. A front-end system was developed that jointly estimates camera parameters, head geometry and 3-D head pose across entire sequences of video images. Head geometry and image parameters were assumed constant across images and 3-D head pose is allowed to vary. First a a small set of images was used to estimate camera parameters and 3D face geometry. Markov chain Monte-Carlo methods were then used to recover the most-likely sequence of 3D poses given a sequence of video images. Once the 3D pose was known, we warped each image into frontal views with a canonical face geometry. We evaluate the performance of the approach as a front-end for an spontaneous expression recognition task.
Spatio-musical composition strategies
Authors: Natasha Barrett
Venue: Organised Sound (2002)

Spatial elements in acousmatic music are inherent to the art form, in composition and in the projection of the music to the listener. But is it possible for spatial elements to be as important carriers of musical structure as the other aspects of sound? For a parameter to serve the requirements of musical development, it is necessary for that parameter to cover a range of perceptually different states. For &lsquo;space&rsquo; to be more than a setting within which the main active elements in the structure unfold, it needs to satisfy these requirements. This paper explains a number of important spatial composition strategies available to the acousmatic composer in light of current technology and sound reproduction situations. The analysis takes an aesthetical rather than a technical standpoint.
Flicker Reduction in Intraframe Codecs
Authors: A. Becker, W. Chan, D. Poulouin
Venue: Proceedings of the Conference on Data Compression (2004)

Videos coded with intraframe codecs show flicker. For waveletcodecs this flicker impairs the visual quality significantly which is amajor problem. It is said to be intrinsic to intraframe wavelet codecs.This paper analyses why flicker artifacts happen. We will illustrateour findings refering to Motion JPEG2000. We will present somestatistics on the flicker location in the wavelet domain. Dependingon the frequency-band flicker will be more or less significant. Basedon our analysis a flicker filter is developed which employs interframeinformation. The amount of this interframe information is minimal:2 bits per pixel often produce compelling results.The interframe information does not have to be stored. We have developedan encoder which makes use of this filter. Our encoder producesa fully compliant Motion JPEG2000 codestream.
Universal Mechanisms for Data-Parallel Architectures
Authors: Karthikeyan Sankaralingam, Stephen W. Keckler, William R. Mark, Doug Burger
Venue: Proceedings of the 36th annual IEEE/ACM International Symposium on Microarchitecture (2003)

Data-parallel programs are both growing in importanceand increasing in diversity, resulting in specialized processorstargeted at specific classes of these programs. This paperpresents a classification scheme for data-parallelprogram attributes, and proposes micro-architecturalmechanisms to support applications with diverse behaviorusing a single reconfigurable architecture. We focuson the following four broad kinds of data-parallel programs- DSP/multimedia, scientific, networking, andreal-time graphics workloads. While all of these programsexhibit high computational intensity, coarse-grainregular control behavior, and some regular memory accessbehavior, they show wide variance in the computationrequirements, fine grain control behavior, and the frequencyof other types of memory accesses. Based onthis study of application attributes, this paper proposesa set of general micro-architectural mechanismsthat enable a baseline architecture to be dynamically tailoredto the demands of a particular application. Thesemechanisms provide efficient execution across a spectrumof data-parallel applications and can be applied todiverse architectures ranging from vector cores to conventionalsuperscalar cores. Our results using a baselineTRIPS processor show that the configurability of the architectureto the application demands provides harmonicmean performance improvement of 5%-55% over scalableyet less flexible architectures, and performs competitivelyagainst specialized architectures.
Frequency-Based Reconstruction of Multi-Description Coded JPEG2000 Images
Authors: Hang Yu, Benjamin W. Wah
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

Multiple description coding (MDC), together with reconstruction, is a popular technique for concealing packets losses in a best-effort network like the Internet. In our previous study, we have developed a sample-based MDC scheme for subband images and an optimal reconstruction-based subband transform (ORB-ST) at senders that takes into account the reconstruction process at receivers. Due to the partitioning of a description into segments before coding the segments by the ORB-ST coder, our previous scheme has severe degradation in quality because, among other reasons, the coder cannot exploit redundancies across multiple segments in a description, especially at low bit rates. To address this issue, we propose in this paper to divide a description into subbands in the frequency domain, instead of segmenting a description in the sample domain. Based on the observation that the corresponding subbands across two descriptions after inverse transformation are correlated, we present a scheme that reconstructs a lost subband using the corresponding subband received in the other description. We show that our scheme is more effective than reconstruction in the full band; that it has similar quality and lower delays in low-loss scenarios and slightly degraded quality in high-loss scenarios, when compared to MDC, unsegmented,and JPEG2000-coded images sent by TCP; and that it has much better quality and similar delays when compared to MDC, segmented, and ORB-ST-coded images sent by UDP.
On the Complexity of Rate-Distortion Optimal Streaming of Packetized Media
Authors: Martin Röder, Jean Cardinal, Raouf Hamzaoui
Venue: Proceedings of the Conference on Data Compression (2004)

We consider the problem of rate-distortion optimal streaming of packetizedmedia with sender-driven transmission over a single-QoS network using feedback and retransmissions. For a single data unit, we prove that the problem isNP-hard and provide efficient branch and bound algorithms that are in practice much faster than the best known solution. For a group of interdependentdata units, we show how to compute optimal solutions with branch and boundalgorithms. The branch and bound algorithms for a group of data units areslower than the current state of the art, the heuristic sensitivity adaptation algorithm, but provide a significantly better rate-distortion performance in manyreal-world situations.
Real-time compression for dynamic 3D environments
Authors: Sang-Uok Kum, Ketan Mayer-Patel, Henry Fuchs
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

The goal of tele-immersion has long been to enable people at remote locations to share a sense of presence. A tele-immersion system acquires the 3D representation of a collaborator's environment remotely and sends it over the network where it is rendered in the user's environment. Acquisition, reconstruction, transmission, and rendering all have to be done in real-time to create a sense of presence. With added commodity hardware resources, parallelism can increase the acquisition volume and reconstruction data quality while maintaining real-time performance. However this is not as easy for rendering since all of the data need to be combined into a single display.In this paper we present an algorithm to compress data from such 3D environments in real-time to solve this imbalance. We expect the compression algorithm to scale comparably to the acquisition and reconstruction, reduce network transmission bandwidth, and reduce the rendering requirement for real-time performance. We have tested the algorithm using a synthetic office data set and have achieved a 5 to 1 compression for 22 depth streams.