ppxscal/embedding_network huggingface dataset:
IEEE Communications magazine: entertainment everywhere: system and networking issues in emerging network-centric entertainment sytems
Authors: Marco Roccetti
Venue: Computers in Entertainment (CIE) (2004)

FEATURE TOPIC: ENTERTAINMENT EVERYWHERE: System and Networking Issues in Emerging Network-Centric Entertainment Systems BACKGROUND: The experience of bringing the Internet into our lives deeply is now shared by millions of people. Take the USA, for example. It is reported that more than a fifth of American households has a high-speed, always-on, Internet access, and an increasing number of them is exploiting wireless technologies to distribute the broadband connection throughout the rooms of their homes. With such a high-speed, always-on, connection a drastic revolution is coming in the way people watch movies and news, listen to music, and play games. This change has been driven fundamentally by two dominant factors: First, the technological advances of computer-based digital multimedia technology (high quality video and sound) have provided consumers with good motivations to upgrade their home entertainment systems (e.g., from mechanical VHS tape drives to digital DVD). Second, (wireless) networking technologies have enabled the possibility to shift what they first consumed on their desktop PC in the office to their digital TV equipment in the living room, as well as to the front pockets in their jackets. All these mean that in an entertainment-equipped house we might easily find a broadband entertainment center built on the top of a Cat-6 Ethernet cable infrastructure or on a Wi-Fi network. Such an entertainment platform might be comprised, for example, of a connection from the computer to the digital stereo or the TV devices, as well as of an interconnected PlayStation2 or XBox governed by programmable TiVo equipment for online play. In essence, what is really new, nowadays, is that we know what tomorrow's entertainment technology will bring to us: a "magic box" where every game ever thought, every movie ever made, every song ever sung, plus news, sport events and shows, will be available for instant enjoyment with just one click on a button. While interest for conducting research in this area was moderate for a long time, recently, instead, great opportunities have arisen in academia, as well as in industry, for developing researches in the field of computer-based entertainment systems, especially focused on the provision of networking and system support to entertainment. Obviously, all these exciting technological advances have raised a number of interesting research questions: How can the Internet native language (i.e. the TCP/IP protocol) take over this complex scenario for scaling the delivery of entertainment contents to very large numbers of users? How can digital entertainment be delivered efficiently to small devices such as PDAs and cell phones? How can new system development styles, like the peer-to-peer style for example, have influence on the architecture of computer-based entertainment systems? How can the employed protocol be integrated to optimize the distribution of entertainment contents?
An Improved Bound for the Crossing Number of CmCn: a Self&#x2013;Contained Proof Using Mostly Combinatorial Arguments
Authors: Gelasio Salazar, Edgardo Ugalde
Venue: Graphs and Combinatorics (2004)

We present some surprisingly elementary arguments to prove that for every &#x03b5;>0, if m is sufficiently large, then the crossing number of the Cartesian product Cm&#x00d7;Cn is at least (0.8&#x2212;&#x03b5;)mn, for every n&#x2265;m. The self&#x2013;contained proof we give involves only one (rather elementary) geometrical result. The rest of the proof involves purely combinatorial arguments.
Analysis of the Execution of a Next Generation Application on Superscalar and Grid Processors
Authors: Juan Rubio, Lizy Kurian John
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

The astonishing advances in processing speeds andthe phenomenal increase in chip densities have enabledthe creation of very powerful microprocessorsand computer systems.Future high end computingsystems are expected to have Teraflops of computingcapability and massive amounts of storage.Such computersare expected to be important for discovery inthe fundamental sciences, pharmaceuticals, and severalother causes for the improvement of mankind.In this paper, we analyze a workload that is expectedto be instrumental in designing and architectingfuture computing systems.The workload is a groundmotion tracker indication (GMTI) application createdby the scientists at the MIT Lincoln Laboratory.Theapplication is being used to drive the design of severaladvanced future computer systems; hence it is importantto understand the computational, memory accessand parallelism features of this application.In thispaper, we first describe the various components/stagesof this application.Then, we perform detailed analysisof the execution of this application.On the basisof profiling the execution of the application, both onactual platforms and with simulations, we show thatthe parallelism in the several stages of the applicationis different.The application is seen to containa large amount of parallelism that can be exploitedby spatially or temporally parallel computer architectures.However, the non-uniformities in computingrequirements as well as memory access patterns of thedifferent stages are important considerations in thedesign of spatially/temporally parallel architectures tohandle these applications.The execution of the applicationon a superscalar processor and a grid processorare analyzed.
Real-time computation at the edge of chaos in recurrent neural networks
Authors: Nils Bertschinger, Thomas Natschläger
Venue: Neural Computation (2004)

Depending on the connectivity, recurrent networks of simple computational units can show very different types of dynamics, ranging from totally ordered to chaotic. We analyze how the type of dynamics (ordered or chaotic) exhibited by randomly connected networks of threshold gates driven by a time-varying input signal depends on the parameters describing the distribution of the connectivity matrix. In particular, we calculate the critical boundary in parameter space where the transition from ordered to chaotic dynamics takes place. Employing a recently developed framework for analyzing real-time computations, we show that only near the critical boundary can such networks perform complex computations on time series. Hence, this result strongly supports conjectures that dynamical systems that are capable of doing complex computational tasks should operate near the edge of chaos, that is, the transition from ordered to chaotic dynamics.
Automatic categorization of query results
Authors: Kaushik Chakrabarti, Surajit Chaudhuri, Seung-won Hwang
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

Exploratory ad-hoc queries could return too many answers - a phenomenon commonly referred to as "information overload". In this paper, we propose to automatically categorize the results of SQL queries to address this problem. We dynamically generate a labeled, hierarchical category structure - users can determine whether a category is relevant or not by examining simply its label; she can then explore just the relevant categories and ignore the remaining ones, thereby reducing information overload. We first develop analytical models to estimate information overload faced by a user for a given exploration. Based on those models, we formulate the categorization problem as a cost optimization problem and develop heuristic algorithms to compute the min-cost categorization.
User interface design with matrix algebra
Authors: Harold Thimbleby
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (2004)

It is usually very hard, both for designers and users, to reason reliably about user interfaces. This article shows that 'push button' and 'point and click' user interfaces are algebraic structures. Users effectively do algebra when they interact, and therefore we can be precise about some important design issues and issues of usability. Matrix algebra, in particular, is useful for explicit calculation and for proof of various user interface properties.With matrix algebra, we are able to undertake with ease unusally thorough reviews of real user interfaces: this article examines a mobile phone, a handheld calculator and a digital multimeter as case studies, and draws general conclusions about the approach and its relevance to design.
Range Image Registration via Probability Field
Authors: Haitao Zhang, Olaf Hall-Holt, Arie Kaufman
Venue: Proceedings of the Computer Graphics International (2004)

This paper presents a powerful variant of the ICP (IterativeClosest Point) algorithm for registering range imagesusing a probability field. The probability field (p-field) representsthe probability distribution of the surface position.By capitalizing on the properties of the range image, fastconstruction, compact representation, and efficient query ofthe p-field can be achieved. Different sensor models aresupported by the p-field according to the properties of therange image. Range images can be precisely aligned bymaximizing the probability of overlapping surfaces via thep-field.
An Efficient Parallel Collision Detection Algorithm for Virtual Prototype Environments
Authors: Mauro Figueiredo, Terrence Fernando
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

The automatic recognition of geometric constraints invirtual assembly and maintenance operations relies in thedetermination of intersecting surfaces between virtualprototypes. This is a key challenge in many virtualprototype applications, where it is necessary to findcollisions precisely and interactively. This paper presentsa novel algorithm to determine intersecting surfaces atinteractive speed in a virtual prototyping environment.The proposed algorithm is based on the Overlapping Axis-AlignedBounding Box (OAABB). The OAABB concept isused effectively to eliminate the number of surfaces thatcannot intersect and improve performance. The algorithmalso facilitates the implementation using parallelcomputing methods. OpenMP is used, taking advantage ofshared memory multiple processors and reducing theoverall time complexity of the collision detectionalgorithm. To achieve an efficient parallel simulation, it isnecessary to provide an efficient load balancing scheme.Our experiences in parallelising the code to achieve abetter work distribution are also described. Results showthat the proposed collision detection achieves interactiverates in real industrial applications as desired.
A search engine for imaged documents in PDF files
Authors: Yue Lu, Li Zhang, Chew Lim Tan
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

Large quantities of documents in the Internet and digital libraries are simply scanned and archived in image format, many of which are packed in PDF files. The word search tool provided by Adobe Reader/Acrobat does not work for these imaged documents. In this paper, we present a search engine to deal with this issue for imaged documents in PDF files. The experimental results show an encouraging performance.
A Critical Look at Open Source
Authors: Brian Fitzgerald
Venue: Computer (2004)

Despite many challenges, free and open source software remains a viable model.
The Fixing Block Method in Combinatorics on Words
Authors: D. Currie, W. Pierce
Venue: Combinatorica (2003)

We give an overview of the method of fixing blocks introduced by Shelton. We apply the method to words which are nonrepetitive up to mod k.
Reuse of Paths in Light Source Animation
Authors: Mateu Sbert, Francesc Castro, John Halton
Venue: Proceedings of the Computer Graphics International (2004)

In this paper we extend the reuse of paths to the shot froma moving light source. In the classical algorithm new pathshave to be cast from each new position of a light source. Weshow that we can reuse all paths for all positions, obtainingin this way a theoretical maximum speed-up equal to theaverage length of the shooting path.
Full-Chip Interconnect Power Estimation and Simulation Considering Concurrent Repeater and Flip-Flop Insertion
Authors: Weiping Liao, Lei He
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

In this paper, we study the full-chip interconnect power modeling.We show that repeater insertion is no longer sufficient toachieve the target frequencies specified by ITRS, and develop concurrentrepeater and FF insertion schemes. Considering structuralinterconnects, layer assignment and concurrent repeater andFF insertion for delay specification, we develop a cycle-accuratemicroarchitecture-level interconnect power simulation. The simulationreduces the over-estimation by up to 2:46X compared topower estimation based on purely stochastic interconnects and fixedswitching factor. Furthermore, we show that interconnect pipelininghas a lower IPC but can improve throughput by up to 2.03X.This indicates that the traditional design flow optimizing IPC andclock frequency separately may no longer be valid.
The Smarandache-Riemann zeta sequence
Authors: Maohua Le
Venue: Smarandache Notions Journal (2004)

In this paper we prove that the Smarandach-Riemann sequence is not a sequence of integers. Moreover, no two integer terms of this sequence are relatively prime.
Targeting Heterogeneous Multimedia Environments with Web Services
Authors: Stijn Decneut, Filip Hendrickx, Steven Van Assche, Lode Nachtergaele
Venue: Proceedings of the IEEE International Conference on Web Services (2004)

The number of networked multimedia platforms that areintroduced into the market has increased dramatically in recentyears. Current approaches to multimedia distributiondo not scale to this growing set of client configurations andheterogeneous dynamic networks. We propose a distributedarchitecture that offers a scalable solution to multimediapublication and distribution in such heterogeneous environments.It builds upon recent standardization efforts relatedto web services. This paper details the multimedia web servicesat the proxy server, that cooperate on a loosely coupledbasis to tailor content creators' multimedia presentationsto clients' environments. The experiments show thatour web service-oriented architecture offers a significantadded value in heterogeneous multimedia environments.
Passive Synthesis of Compact Frequency-Dependent Interconnect Models via Quadrature Spectral Rules
Authors: Traianos Yioultsis, Anne Woo, Andreas C. Cangellaris
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

In this paper, we present a reduced order modeling methodology,based on the utilization of optimal non-uniform grids generatedby Gaussian spectral rules, for the direct passive synthesis ofSPICE-compatible modeling of multi-conductor interconnectstructures. The algorithm is based on a Padé-Chebyshevapproximation of the frequency-dependent input impedancematrix of the passive interconnect system. The synthesized circuitis represented as the concatenation of a number of non-uniformsections of passive lumped coupled circuits. However, contrary tothe popular uniform segmentation-based distributed circuitmodels for interconnects, where 10 to 15 segments per minimumwavelength are needed for multi-GHz accuracy, the proposedmodel is "optimal" in the sense that highly-accurate responses canbe obtained with a number of segments per minimum wavelengthbarely exceeding the Nyquist limit of 2. This high accuracy stemsfrom the super-exponential convergence of the Padé-Chebyshevapproximation of the input impedance of the transmission-linemodel of the interconnect, and results in the synthesis of MNAstamps for the interconnect structure with five to ten timesreduction in the number of state variables compared to uniformgrids. Moreover, the passivity of the generated SPICE-compatiblemulti-port models is guaranteed through the use ofpassive equivalent circuits for the representation of the frequency-dependent,per-unit-length series impedance and shunt admittancematrices of the interconnect.
Improved combination of online algorithms for acceptance and rejection
Authors: David P. Bunde, Yishay Mansour
Venue: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures (2004)

Given two admission control algorithms that are cA-accept-competitive and cR-reject-competitive respectively, we give two ways to make an algorithm that is simultaneously O(cA)-accept-competitive and O(cAcR)-reject-competitive. The combined algorithms make no reference to the offline optimal solution. In addition, one of the algorithms does not require knowing the value of either cA or cR. This improves on work of Azar, Blum, and Mansour, whose combined algorithm was O(c2A)-accept-competitive, involved computing offline optimal solutions, and required knowing the values of both cA and cR.
RNA Motif Search Using the Structure to String (STR2) Method
Authors: Oriel Bergig, Danny Barash, Klara Kedem
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

We present a novel approach for detecting RNA shapes in given selected genes. Aside of the traditional sequence-based search methods such as BLAST and FASTA, there is a growing interest in detecting specific RNA secondary structure domains by using effective structure-based search methods such as the RNAMotif. Towards this end, we devise a new algorithm with ideas taken from computational geometry. The method, called Structure to String (STR2), was initially developed to detect structural motifs in the tertiary structure of proteins. It converts an RNA secondary structure into a shape representing string of characters that capture the various structural motifs. To transform an RNA secondary structure to a string of characters, we adopt an approach used in proteomics for generating a collection of fragments. We identify a library of fragments for use in RNA secondary structure where each fragment is represented by a character. A unique feature of our method is that the fragments represent the geometry of the transitions between the secondary structure elements, such as the curve of the transition between stems and loops. Consequently, we represent the secondary structures of the query and target sequences by their corresponding character string representation and seek shape similarities by applying string matching algorithms. For the RNA folding prediction we use mfold. The method is implemented efficiently using suffix trees and other economization procedures. We show examples of its applicability on aptamer domains that are functionally important and are well predicted by mfold before the conversion to strings.
Object-based hardware/software component interconnection model for interface design in system-on-a-chip circuits
Authors: W. Cesário, L. Gauthier, D. Lyonnard, G. Nicolescu, A. A. Jerraya
Venue: Journal of Systems and Software (2004)

The design of system-on-a-chip (SoC) circuits requires the integration of complex hardware/software components that are customized to efficiently execute a specific application. Nowadays, these components include many different embedded processors executing concurrent software tasks. In this paper, we present an object-based component interconnection model to represent both hardware and software components within a system architecture in a very high level of abstraction. This model is used in a design flow for automatic generation of hardware/software interfaces for SoC circuits. Design tools for automatic generation of embedded operating systems, hardware interfaces and associated device drivers are presented and evaluated using the results obtained with a VDSL application.
Ubiquitous Access to Cultural Tourism Portals
Authors: Franca Garzotto, Paolo Paolini, Marco Speroni, Birgit Proll, Werner Retschitzegger, Wieland Schwinger
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

Web-based tourism information systems are more and more required to provide besides traditional tourism information about hotel facilities and infrastructure also cultural content comprising material heritage, performing art, folk tradition, handicraft or simply habits of everyday life. These cultural Web applications are required not to offer on-line brochures only, but rather to provide both, value and service. This paper focuses on two crucial aspects of cultural Web applications comprising quality of content and quality of access. As an example for achieving quality of content in terms of comprehensiveness and cross-national nature, the MEDINA portal is presented, allowing one-stop access to cultural information of fourteen Mediterranean countries. In order to provide quality of access, the notion of ubiquity is introduced, allowing to customize Web applications towards different kinds of contexts, thus supporting the cultural tourist with device-independent, time-aware, location-aware, and personalized services.
Introduction by Session Chair: Different Aspects of Security
Authors: Sonja Hof
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

This special session wants to bring together the different sciences as well as practical users into one discussion, in order to improve the understanding and collaboration between each other. As security is a field that is - directly or indirectly - of utmost importance for all of us, we all end up working on security issues, i.e. we get security specialists who are also interested in maintaining good and stable systems.
Balanced dual-stage repair for dependable embedded memory cores
Authors: Minsu Choi, Nohpill Park, Vincenzo Piuri, Yong-Bin Kim, Fabrizio Lombardi
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2004)

Advances in revolutionary system-on-chip (SoC) technology mainly depend on the high-performance ultra-dependable system core components. Among those core components, embedded memory system core, currently acquiring 54% of SoC area share, will continue its domination of SoC area share as it is anticipated to approach about 94% of SoC area share by the year 2014. Since memory cells are considered as more prone to defects and faults than logic cells, redundancy and repair have been extensively practiced for enhancing defect and fault tolerance. Unlike in legacy PCB (printed circuit board) or MCM (multichip module) based systems, embedded core components cannot be physically replaced once they are fabricated onto a SoC. To realize enhanced manufacturing yield and field reliability, both ATE (automated test equipment) and BISR (built-in-self-repair) are commonly utilized to allocate redundancy for embedded memory system cores. Since ATE (for repairing manufacturing defects) and BISR (for repairing field faults) share the given redundancy, probabilistic redundancy partitioning and utilization techniques are proposed in this paper to achieve optimal combination of yield and reliability of the embedded memory system core. Parametric simulation results are shown extensively.