ppxscal/embedding_network huggingface dataset:
Retiming for Wire Pipelining in System-On-Chip
Authors: Chuan Lin, Hai Zhou
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

At the integration scale of System-On-Chips (SOCs), the conflicts between communication and computation will become prominent even on a chip. A big fraction of system time willshift from computation to communication. In synchronoussystems, a large amount of communication time is spent onmultiple-clock period wires. In this paper, we explore retimingto pipeline long interconnect wires in SOC designs. Behaviorally,it means that both computation and communicationare rescheduled for parallelism. The retiming is applied to anetlist of macro-blocks, where the internal structures may notbe changed and ip- ops may not be able to be inserted onsome wire segments. This problem is different from that on agate level netlist and is formulated as a wire retiming problem.Theoretical treatment and a polynomial time algorithmare presented in the paper. Experimental results showed thebenefits and effectiveness of our approach.
Selfish load balancing and atomic congestion games
Authors: Subhash Suri, Csaba D. Tóth, Yunhong Zhou
Venue: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures (2004)

We revisit a classical load balancing problem in the modern context of decentralized systems and self-interested clients. In particular, there is a set of clients, each of whom must choose a server from a permissible set. Each client selfishly wants to minimize its own latency (job completion time). A server's latency is inversely proportional to its speed, but it grows linearly with or, more generally, as the pth power of the number of clients matched to it. This interaction is naturally modeled as an atomic congestion game, which we call selfish load balancing. We analyze the Nash equilibria of this game and prove nearly tight bounds on the price of anarchy (worst-case ratio between a Nash solution and the social optimum). In particular, for linear latency functions, we show that if the server speeds are relatively bounded and the number of clients is large compared to the number of servers, then every Nash assignment approaches social optimum. Without any assumptions on the number of clients, servers, and server speeds, the price of anarchy is at most 2.5. If all servers have the same speed, then the price of anarchy further improves to 1 + 2/√3 ≈ 2.15. We also exhibit a lower bound of 2.01. Our proof techniques can also be adapted for the coordinated load balancing problem under L2 norm, where it slightly improves the best previously known upper bound on the competitive ratio of a simple greedy scheme.
Congestion, Dilation, and Energy in Radio Networks
Authors: Friedhelm Meyer auf der Heide, Christian Schindelhauer, Klaus Volbert, Matthias Gr&#x00fc;newald
Venue: Theory of Computing Systems (2004)

We investigate the problem of path selection in radio networks for a given static set of n sites in two- and three-dimensional space. For static point-to-point communication we define measures for congestion, dilation, and energy consumption that take interferences among communication links into account.We show that energy-optimal path selection for radio networks can be computed in polynomial time. Then we introduce the diversity g(V) of a set V \subseteq &#x211d;d for any constant d. It can be used to upper bound the number of interfering edges. For real-world applications it can be regarded as &#x0398;(log n). A main result is that a c-spanner construction as a communication network allows one to approximate the congestion-optimal path system by a factor of O(g(V)2).Furthermore, we show that there are vertex sets where only one of the performance parameters congestion, dilation, and energy can be optimized at a time. We show trade-offs lower bounding congestion &#x00d7; dilation and dilation &#x00d7; energy. The trade-off between congestion and dilation increases with switching from two-dimensional to three-dimensional space. For congestion and energy the situation is even worse. It is only possible to find a reasonable approximation for either congestion or energy minimization, while the other parameter is at least a polynomial factor worse than in the optimal network.
Cane-Toad
Venue: ACM SIGGRAPH 2003 video review on Animation theater program: part 1 - Volume 145 (2003)

This animated short film is a toad's perspective of the dangers involved in being a wanted species. Young Baz has gone missing and his good mate Dazza gives an insight into what may have happened to the little fella. Cane-Toad was made in a Brisbane "share house" by independent animators Dave Clayton and Andrew Silke. Copyright held by creator.
Storage device performance prediction with CART models
Authors: Mengzhi Wang, Kinman Au, Anastassia Ailamaki, Anthony Brockwell, Christos Faloutsos, Gregory R. Ganger
Venue: ACM SIGMETRICS Performance Evaluation Review (2004)

This work explores the application of a machine learning tool, CART modeling, to storage devices. We have developed approaches to predict a device's performance as a function of input workloads, requiring no knowledge of the device internals. Two uses of CART models are considered: one that predicts per-request response times (and then derives aggregate values) and one that predicts aggregate values directly from workload characteristics. After training on the device in question, both provide reasonably-accurate black box models across a range of test traces from real environments. An expanded version of this paper is available as a technical report [1].
Error Sensitivity of the Linux Kernel Executing on PowerPC G4 and Pentium 4 Processors
Authors: Weining Gu, Zbigniew Kalbarczyk, Ravishankar K. Iyer
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

The goals of this study are: (i) to compare Linuxkernel (2.4.22) behavior under a broad range of errors ontwo target processors-the Intel Pentium 4 (P4) runningRedHat Linux 9.0 and the Motorola PowerPC (G4) runningYellowDog Linux 3.0-and (ii) to understand how architecturalcharacteristics of the target processors impact the errorsensitivity of the operating system. Extensive error injectionexperiments involving over 115,000 faults/errors are conductedtargeting the kernel code, data, stack, and CPU systemregisters. Analysis of the obtained data indicates significantdifferences between the two platforms in how errorsmanifest and how they are detected in the hardware and theoperating system. In addition to quantifying the observeddifferences and similarities, the paper provides several examplesto support the insights gained from this research.
Three-Dimensional Whole Body of Virtual Character Animation for its Behavior in a Virtual Environment Using H-Anim and Inverse Kinematics
Authors: A. Ortiz, D. Oyarzun, I. Aizpurua, J. Posada
Venue: Proceedings of the Computer Graphics International (2004)

The article presents the development of anarticulated three-dimensional avatar, which is capableof speaking in several languages and moving througha virtual environment. The work has been centred inthe following tasks: modelling a whole articulatedbody avatar based on H-Anim specification;developing body animation techniques based on VRMLand Inverse kinematics, facial expressions (Emotionsand Lip Synch) and behavioural rules for the avatar.The resulting avatar was integrated in a Virtualenvironment. We also explain the collision techniquesused during integration.
The numerical interface coupling of nonlinear hyperbolic systems of conservation laws: I. The scalar case
Authors: E. Godlewski, P.-A. Raviart
Venue: Numerische Mathematik (2004)

We study the theoretical and numerical coupling of two general hyperbolic conservation laws. The coupling preserves in a weak sense the continuity of the solution at the interface without imposing the overall conservativity of the coupled model. In order to analyze the convergence of the coupled numerical scheme, we first revisit the approximation of the boundary value problems. We then prove the convergence and characterize the limit solution of the coupled schemes in a few simple but significative coupling situations. The general coupling problem is analyzed for Riemann initial data and illustrated by numerical simulations. R&#x00e9;sum&#x00e9;. Nous nous int&#x00e9;ressons &#x00e0; une nouvelle forme de couplage de deux syst&#x00e8;mes hyperboliques de lois de conservation. Ce couplage assure de fa&#x00e7;on faible la continuit&#x00e9; de la solution &#x00e0; l&#x2019;interface sans imposer la conservativit&#x00e9; du mod&#x00e8;le coupl&#x00e9;. Pour &#x00e9;tudier la convergence du sch&#x00e9;ma d&#x2019;approximation num&#x00e9;rique, nous commen&#x00e7;ons par reprendre les r&#x00e9;sultats concernant l&#x2019;approximation du probl&#x00e8;me aux limites. Nous d&#x00e9;montrons ensuite la convergence du sch&#x00e9;ma coupl&#x00e9; dans un certain nombre de cas int&#x00e9;ressants. Le cas g&#x00e9;n&#x00e9;ral du couplage est &#x00e9;tudi&#x00e9; et illustr&#x00e9; num&#x00e9;riquement pour une donn&#x00e9;e initiale de Riemann.
Feedback, causality and distance between arma models
Authors: Umberto Triacca
Venue: Mathematics and Computers in Simulation (2004)

The purpose of this paper is to analyze in bivariate vector autoregression the relationship between feedback in stochastic systems, Granger causality and a measure of dissimilarity between ARMA models. In particular, we consider a bivariate vector autoregressive processes of order p (a bivariate VAR(p) process) and we prove if the distance between the univariate ARMA models implied by the VAR representation is greater than a certain number that is a function of p, then Granger causality must exist in at least one direction in the variables.
Smith normal form of dense integer matrices fast algorithms into practice
Authors: David Saunders, Zhendong Wan
Venue: Proceedings of the 2004 international symposium on Symbolic and algebraic computation (2004)

We present a variation of the fast Monte Carlo algorithm of Eberly, Giesbrecht and Villard for computing the Smith form of an integer matrix. It is faster in practice, but with the same asymptotic complexity, and it also handles the singular case. Then we will apply the key principle to improve Storjohann's algorithm and Iliopoulos' algorithm. We have a soft linear time algorithm for the special case of a diagonal matrix. A local Smith form Algorithm is also considered.We offer analysis and experimental results regarding these algorithms, with a view to the construction of an adaptive algorithm exploiting each algorithm at it's best range of performance. Finally, based on this information, we sketch the proposed structure of an adaptive Smith form algorithm for matrices over the integers. Our experiments use implementations in LinBox, a library for exact computational linear algebra available at linalg.org.
Utilization of Histories for Advanced Learning and Creation Systems
Authors: Hideyuki Takada, Tetsuo Ogino, Yasumasa Mita, Yahiko Kambayashi
Venue: Proceedings of the International Conference on Informatics Research for Development of Knowledge Society Infrastructure (2004)

In recent years, many computer-based learning systemshave been developed and practically utilized in real classrooms,due to the spread of computers and networks toschools. In order to make this infrastructure valuable, wehave to discuss how computers can be useful for learningand creation to students.We are focusing on the utilization of histories of useroperations, as the possibilities for building effective learningenvironment. In this paper, we present the utilizationschemes of histories for computer-based learning and creationsystems. The first one is utilization of user operationhistories for the dynamic problem extraction. We show theresult of the analysis on the time interval between user actionsand the system model based on the analysis. The secondone is the visualization of user operations during creationprocess on SqueakToys. In order to provide the capabilityof focusing on interesting points of the creation process,we introduce the semantics layers of user operationevents and illustrate the mechanism to handle them.
Enhancing GI Discovery with ISO Feature Type Catalogues - A Metamodelling Approach
Authors: U. Einspanier
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

This paper describes a specification approach for feature type catalogues based on metamodelling techniques. Currently catalogues usually lack the capability to describe the precise definition of feature types and their properties in underlying information sources. In contrast, a metamodelling architecture allows using the elements and rules of a specialized conceptual schema language for feature types as the fundamental building blocks for the specification of a catalogue suitable for this task.
A Novel D-Latch in Multiple-Valued Semi-Floating-Gate Recharged Logic
Venue: Proceedings of the 34th International Symposium on Multiple-Valued Logic (2004)

In this paper we present several different proposals forimplementing a multiple-valued (MV) semi-floating-gate(SFG) D-latch. This paper aims to illustrate the advantagesand disadvantages of each approach. Measurements froma fabricated chip at a 0.6µm CUP process is included forverifying the detailed arguments.
On evaluating web search with very few relevant documents
Authors: Ian Soboroff
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

Many common web searches by their nature have a very small number of relevant documents. Homepage and "namedpage" searching are known-item searches where there is only a single relevant document. Topic distillation is a special kind of topical relevance search where the user wishes to find a few key web sites rather than every relevant web page. Because these types of searches are so common, web search evaluations have come to focus on tasks where there are very few relevant documents. Evaluations with few relevant documents pose special challenges for current metrics. In particular, the TREC 2003 topic distillation evaluation is unable to distinguish most submitted runs from each other.
Davenport&#x2013;Schinzel Trees
Authors: Pavel Valtr
Venue: Combinatorica (2003)

In this paper we study labeled&#x2013;tree analogues of (generalized) Davenport&#x2013;Schinzel sequences.We say that two sequences a1 ... ak, b1 ... bk of equal length k are isomorphic, if ai = aj i&#xfb00;bi = bj (for all i, j). For example, the sequences 11232, 33141 are isomorphic. We investigate the maximum size of a labeled (rooted) tree with each vertex labeled by one of n labels in such a way that, besides some technical conditions, the sequence of labels along any path (starting from the root) contains no subsequence isomorphic to a fixed &#x201c;forbidden&#x201d; sequence u.We study two models of such labeled trees. Each of the models is known to be essentially equivalent also to other models. The labeled paths in a special case of one of our models correspond to classical Davenport&#x2013;Schinzel sequences.We investigate, in particular, for which sequences u the labeled tree has at most O(n) vertices. In both models, we answer this question for any forbidden sequence u over a two-element alphabet and also for a large class of other sequences u.
Towards Autonomous Service Composition in A Grid Environment
Authors: William K. Cheung, Jiming Liu, Kevin H. Tsang, Raymond K. Wong
Venue: Proceedings of the IEEE International Conference on Web Services (2004)

Web services are becoming important in applicationsfrom electronic commerce to applicationinteroperation. While numerous efforts have focusedon service composition, service selection amongsimilar services from multiple providers has not beenaddressed. Such issue is more serious when servicesare embraced in Grid platforms, which are usuallyresource-conscious. Experimental results show thatour considerations are valid and our preliminarysolution works well in our Globus grid network.
Estimation of Stationary Loss Probability in a Queuing System with Recurrent Input Flows
Authors: A. A. Shumskaya
Venue: Cybernetics and Systems Analysis (2004)

A multiserver queuing system with recurrent input flows is considered. A fast simulation method is proposed for evaluation of stationary loss probability. It is based on the joint use of importance sampling and the central limit theorem. The estimates are asymptotically unbiased. Two examples demonstrate high accuracy of the estimates.
Modified p-median approach for efficient GT cell formation
Authors: Youkyung Won, Kun Chang Lee
Venue: Computers and Industrial Engineering (2004)

The objective of this paper is to propose the modified formulations over the classical p-median model for efficiently solving the cell formation (CF) problem with which production managers are faced in implementing group technology (GT) to manufacturing. In spite of its merits as the robust solution approach to GT cell formation, the classical p-median model is limited to small-size CF problems since it requires many binary variables. Necessity of many binary variables makes it difficult for cell designer to use the classical p-median model for solving even medium-sized CF problems, let alone large-size CF problems even though large-memory main frame computer and highly expensive commercial software are used. To resolve this sort of problems, we propose two modified p-median formulations which are even applicable to largest CF problems among the ones found in literature. Their main virtues are as follows. First, the modified p-median formulations encourage speedy implementation of the models. Secondly, the proposed formulations that are applied to moderately large-size CF problems with 30 or more machines can run effectively even on personal computer and education-purpose softwares such as the HYPER LINDO which are available at such a low cost compared with commercial software. Computational results from applying to moderately large-size CF problems with 30 to 50 machines show that the CF using the modified p-median formulations provides very promising implications as compared with the CF using the classical p-median model.
Maintaining Data Freshness in Distributed Real-Time Databases
Authors: Yuan Wei, Sang H. Son, John A. Stankovic
Venue: Proceedings of the 16th Euromicro Conference on Real-Time Systems (2004)

Many real-time systems need to maintain fresh viewswhich are derived from shared data that are distributedamong multiple sites. When a base data item changes,all derived views that are based on it need to be recomputed.There are two major derived data recomputationstrategies - immediate update and on-demandupdate. However, they both have their advantagesand limitations. In this paper, we study the performanceof derived data update using immediate andon-demand strategies in distributed real-time databasesand identify several criteria for choosing proper updatepolicies. Based on these criteria, we propose a deriveddata update algorithm. In our algorithm, the updatepolicy of a particular derived data item is determineddynamically by its access frequency, current transactionmiss ratio and the system utilization. A thoroughsimulation study shows that our algorithm outperformsimmediate and on-demand update in most cases.
The Ada language and environment
Authors: Peter Wegner
Venue: ACM SIGSOFT Software Engineering Notes (1980)

A brief outline of the history and current status of Ada is followed by a description of salient language features and a discussion of the proposed Ada environment. Language-level support of modularity may result in substantially cheaper program development and maintenance, and will have a profound effect on both programming style and methods of teaching. Environment requirements include a data base for program development and maintenance, a kernel which is the interface for portability, and a minimal toolset which provides a common base for individual environments. The UNIX approach could be used as a starting point for developing Ada environments, but would have to be modified to reflect military embedded computer requirements and the fact that Ada rather than C would be the system programming language. It is predicted that Ada usage will overtake Fortran usage by 1995.
View-Dependent Streaming of Progressive Meshes
Venue: Proceedings of the Shape Modeling International 2004 (2004)

Multiresolution geometry streaming has been well studiedin recent years. The client can progressively visualizea triangle mesh from the coarsest resolution to the finestone while a server successively transmits detail information.However, the streaming order of the detail data usuallydepends only on the geometric importance, since basicallya mesh simplification process is performed backwardsin the streaming. Consequently, the resolution of the modelchanges globally during streaming even if the client doesnot want to download detail information for the invisibleparts from a given view point.In this paper, we introduce a novel framework for view-dependentstreaming of multiresolution meshes. The transmissionorder of the detail data can be adjusted dynamicallyaccording to the visual importance with respect tothe clientýs current view point. By adapting the truly selectiverefinement scheme for progressive meshes, our frameworkprovides efficient view-dependent streaming that minimizesmemory cost and network communication overhead.Furthermore, we reduce the per-client session data on theserver side by using a special data structure for encodingwhich vertices have already been transmitted to each client.Experimental results indicate that our framework is efficientenough for a broadcast scenario where one server streamsgeometry data to multiple clients with different view points.
Semi-Supervised Learning on Riemannian Manifolds
Authors: Mikhail Belkin, Partha Niyogi
Venue: Machine Learning (2004)

We consider the general problem of utilizing both labeled and unlabeled data to improve classification accuracy. Under the assumption that the data lie on a submanifold in a high dimensional space, we develop an algorithmic framework to classify a partially labeled data set in a principled manner. The central idea of our approach is that classification functions are naturally defined only on the submanifold in question rather than the total ambient space. Using the Laplace-Beltrami operator one produces a basis (the Laplacian Eigenmaps) for a Hilbert space of square integrable functions on the submanifold. To recover such a basis, only unlabeled examples are required. Once such a basis is obtained, training can be performed using the labeled data set.Our algorithm models the manifold using the adjacency graph for the data and approximates the Laplace-Beltrami operator by the graph Laplacian. We provide details of the algorithm, its theoretical justification, and several practical applications for image, speech, and text classification.
Designing a Collaborative Learning Environment for Knowledge Integration
Authors: Naomi Miyake
Venue: Proceedings of the Second International Conference on Creating, Connecting and Collaborating through Computing (2004)

A collaborative learning environment has beencreated and tested to encourage college students integrateknowledge by mutually reflecting on their externalized ideas.We will report a two-year undergraduate cognitive sciencecurricular with technological scaffolds for collaborativereflection and knowledge integration, with some evaluation.