ppxscal/embedding_network huggingface dataset:
ERP-DDRR: An Efficient and Robust Scheduler for Providing Proportional Delay Differentiation in Terabit Networks
Authors: Chin-Chi Wu, Hsien-Ming Wu, Ding-Jyh Tsaur, Woei Lin
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

In recent years, many research efforts focus on relative differentiated service due to the increasing requirements on quality of service for time-sensitive applications. Most of the prior research relies on timestamping arriving packets or periodically monitoring the arrival traffic to arrange the service rate or priority for each class of packets. In this paper, we propose a new efficient and robust packet scheduling scheme, called ERP-DDRR. The ERP-DDRR scheduler not only can provide proportional delay differentiation under various traffic load conditions with very small overhead but also can be implemented in terabit networks. In addition, we propose a pipelining approach to further improve the performance of the ERP-DDRR scheduler. Simulation results show that the ERP-DDRR scheduler provides excellent short-term and long-term performance. The ERP-DDRR scheduler is an excellent alternative solution for future high-speed networks.
Photo LOI: browsing multi-user photo collections
Authors: Rahul Nair, Nick Reid, Marc Davis
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

The number of digital photographs is growing beyond the abilities of individuals to easily manage and understand their own photo collections. Photo LOI (Level of Interest) is a technique that filters, aggregates, and visualizes photographs taken by multiple users who shared temporal, spatial, and/or social context at the point of photo capture. Photo LOI enables groups of photographers to see and manipulate visualizations of their photographic activities over time and social space in order to help cluster and select photos, and enables researchers to study contextual patterns in the phototaking habits of different users and groups of users. In this paper we give a brief overview of Photo LOI's features and describe some of its applications.
MOSFET Mismatch Modeling: A New Approach
Authors: Hamilton Klimach, Carlos Galup-Montoro, Marcio C. Schneider, Alfredo Arnaud
Venue: IEEE Design Test (2006)

Editor's note: Handling component mismatch represents a great challenge in analog and even digital design for current and future submicron technologies. This article, a special selection from the Symposium on Integrated Circuits and Systems Design (SBCCI), presents a matching model to help designers account for real effects while maintaining simplicity and easing the design effort.--Luigi Carro, Federal University of Rio Grande do Sul
Rule-based Verification of Scenarios with Pre-conditions and Post-conditions
Authors: Tatsuya Toyama, Atsushi Ohnishi
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

Scenarios that describe concrete situations of software operation play an important role in software development, especially in requirements engineering. Since scenarios are informal, the correctness of scenarios is hard to be verified. The authors have developed a language for describing scenarios in which simple action traces are embellished. The purposes are to include typed frames based on a simple case grammar of actions and to describe the sequence among events. Based on this scenario language, this paper describes both (1) a correctness-verification method using rules to detect errors (lack of events, extra events, and wrong sequence among events) in a scenario and (2) a retrieval method of rules from rule DB that applicable to scenarios using pre and post- conditions.
MPEG-4 Stream Transmission and Synchronization Schemes for Parallel Servers
Authors: Kwang-Sik Shin, Wan-Oh Yoon, Jin-Ha Jung, Sang-Bang Choi
Venue: IEEE MultiMedia (2006)

Our new multimedia transmission and synchronization scheme for parallel servers in a wireless environment enables servers to store MPEG-4 data according to video object plane type. In developing the enhanced multimedia transmission scheme to cope with load imbalance, congestion, and jitter, we investigated three issues: data striping, priority queuing, and multimedia synchronization.
Managing jobs with an interpreted language for dynamic adaptation
Authors: Anolan Milanés, Noemi Rodriguez, Bruno Schulze
Venue: Proceedings of the 3rd international workshop on Middleware for grid computing (2005)

In this paper we explore the advantages of using interpreted languages for building submitting engines for the grid. In particular, we discuss an example engine, developed using ALua, for submitting jobs in a cluster, which can be extended to a grid environment. We claim that the flexibility offered by interpreted languages justifies the problems related to the intrinsic loss of efficiency associated with this kind of languages. The focus of this work is on adaptation and ease of use.
From the Editor in Chief: Taking Back the Web
Authors: Robert E. Filman
Venue: IEEE Internet Computing (2006)

The Greasemonkey Firefox extension could change the way people view Web pages. It lets users load and execute JavaScripts on Web pages, allowing them to manipulate the page's content in certain ways.
FPGA oriented design of parity sharing RS codecs
Authors: G. C. Cardarilli, S. Pontarelli, M. Re, A. Salsano
Venue: Proceedings of the 20th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2005)

Reed Solomon codes are widely used to protect the information from errors in transmission and storage systems. RS codes rely on arithmetic in finite, or Galois fields. Most of the RS coders are based on the field GF(28), using a byte as a symbol and providing codewords up to 255 symbols. The drawback of this choice is the complexity of the arithmetic operation on the field GF(28), in particular with respect to fields with less number of elements, like GF(24). The use of the GF(24) field provides codewords up to 15 symbols. To supersede this limitation parity sharing RS codecs has been proposed recently, even if no hardware implementation has been provided. In this paper we analyze the hardware implementation of this kind of codes, providing a comparison with a standard RS code with the same code rate, and showing that the implementation is comparable in terms of area and there is a gain in terms of speed, in particular when the target technology is a LUT based FPGA.
Syntax-Directed Implementation of Visual Languages Based on Automaton Graphical Grammars
Authors: O. G. Sharov, A. N. Afanas'Ev
Venue: Programming and Computing Software (2005)

A growing interest in visual languages results in the development of methods and means of their implementation. In this paper, a formalism for analyzing visual language diagrams in the form of an automaton graphical grammar and structure of a syntax-directed graphical editor are suggested.
On Vector Variational Inequalities in Reflexive Banach Spaces
Authors: Nan-Jing Huang, Ya-Ping Fang
Venue: Journal of Global Optimization (2005)

In this paper, we study the solvability for a class of vector variational inequalities in reflexive Banach spaces. By using Brouwer fixed point theorem, we prove the solvability for this class of vector variational inequalities without monotonicity assumption. The solvability results for this class of vector variational inequalities with monotone mappings are also presented by using the KKM-Fan lemma
Streaming with causality: a practical approach
Authors: Cezar Pleşca, Romulus Grigoraş, Philippe Quéinnec, Gérard Padiou
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

Highly interactive collaborative streaming applications express the need for causality. Solutions exist but we argue that more work needs to be done especially from a perceptual point of view. The key question is: given the current state of the Internet and the perceptual tolerance of causal desynchronization, does causality make any difference? This paper proposes a practical answer to this question by comparing different solutions. We support this comparison by producing video results for a live streaming scenario on an experimental platform. Further, this paper proposes a novel approach for handling causality in multimedia and shows that it can perform better than Δ-causality, usually considered the best solution.
A Camera-Projector System for Real-Time 3D Video
Authors: Marcelo Bernardes Vieira, Luiz Velho, Asla Sa, Paulo Cezar Carvalho
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

In this paper, we describe a real-time 3D video system that is based on active stereo. Combining a NTSC standard camera/ projector equipment and a suitable color code, the geometric and photometric information of a scene is robustly obtained in 30fps. Our main motivation to develop this system is to create a platform for investigating the issues that will be posed by the next generation of digital video and how it can shape up new media.
Characterization of Wavelet-Based Image Coding Systems for Algorithmic Fault Detection
Authors: Lucia Costas, Juan J. Rodriguez-Andina
Venue: Proceedings of the 8th Euromicro Conference on Digital System Design (2005)

This paper presents a methodology for characterizing the behaviour of wavelet-based image coding systems in the presence of faults. This is a previous step in the development of efficient concurrent error detection techniques for such systems. The faulty behaviour of complex signal processing systems is better described at the algorithmic level (i.e., checking the accomplishment of a given functional property by large blocks of data) rather than using the "classical" approach at the structural (i.e., building block) level. Therefore, the issues related to algorithmic fault detection are addressed. Two different platforms for error characterization are presented and their main characteristics are discussed. Experimental results are presented that prove the suitability of the proposed methodology for the target application.
Personal media sharing and authoring on the web
Authors: Xian-Sheng Hua, Shipeng Li
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

In this paper, we propose a novel system working on the Web for personal media sharing and authoring. Three primary technologies enable this end-to-end system, including scalable video coding, intelligent multimedia content analysis, and template-based media authoring. Scalable video codec tackles the issue of huge data transmission, multimedia content analysis facilitates automatic video editing, and template-based media authoring scheme further reduces the workload of media sharing and authoring. Experiment and a demo system on a real Internet environment show that this novel system is effective.
Structure Learning Based on Ordering of Sets
Authors: Tao DU, Shensheng ZHANG, Zongjiang WANG
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

When learning Bayesian networks from data, in many real circumstances, experts of domains could give the relationships between the classes of variables. In this paper, the problem of 'learning Bayesian networks based on ordering of sets' is formulated. To solve this problem, we propose a partitioned greedy search algorithm for learning structures of Bayesian networks based on the ordering of sets. The results of experiments show that, with the ordering of sets, compared with traditional greedy DAG search algorithm, the score of the structure obtained by our algorithm is improved, and the search time is greatly reduced.
A comparison of CORBA and ada's distributed systems annex
Authors: Andrew Berns
Venue: ACM SIGAda Ada Letters (2005)

With the recent advent of affordable computers, and the increased computing needs in numerous different fields, distributed computing has become quite popular. Along with this popularity has come several different approaches for creating distributed systems. Ada is fortunate to have multiple approaches available, each distinctively different from each other. One approach is to use a separate middle layer to allow different parts of the Ada distributed program to communicate. The Common Object Request Broker Architecture, or CORBA, uses this approach. Another approach is to use an extension of the language made for the creation of distributed systems, meaning no extra layers need to be added. This language extension approach is used by Ada's Distributed Systems Annex. While both approaches have their merits, CORBA has received much more attention than Ada's Distributed Systems Annex. This paper is the result of an undergraduate research project to examine how easy each approach was, and to see if the extra attention given to CORBA is deserved.
Generic Object Recognition with Boosting
Authors: Andreas Opelt Axel Pinz
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2006)

This paper explores the power and the limitations of weakly supervised categorization. We present a complete framework that starts with the extraction of various local regions of either discontinuity or homogeneity. A variety of local descriptors can be applied to form a set of feature vectors for each local region. Boosting is used to learn a subset of such feature vectors (weak hypotheses) and to combine them into one final hypothesis for each visual category. This combination of individual extractors and descriptors leads to recognition rates that are superior to other approaches which use only one specific extractor/descriptor setting. To explore the limitation of our system, we had to set up new, highly complex image databases that show the objects of interest at varying scales and poses, in cluttered background, and under considerable occlusion. We obtain classification results up to 81 percent ROC-equal error rate on the most complex of our databases. Our approach outperforms all comparable solutions on common databases.
Optimized Data Loading for a Multi-Terabyte Sky Survey Repository
Authors: Y. Dora Cai, Ruth Aydt, Robert J. Brunner
Venue: Proceedings of the 2005 ACM/IEEE conference on Supercomputing (2005)

Advanced instruments in a variety of scientific domains are collecting massive amounts of data that must be postprocessed and organized to support research activities. Astronomers have been pioneers in the use of databases to host sky survey data. Increasing data volumes from more powerful telescopes pose enormous challenges to state-ofthe- art database systems and data-loading techniques. In this paper we present SkyLoader, our novel framework for data loading that is being used to populate a multi-table, multi-terabyte database repository for the Palomar-Quest sky survey. SkyLoader consists of an efficient algorithm for bulk loading, an effective data structure to support data integrity, optimized parallelism, and guidelines for system tuning. Performance studies show the positive effects of these techniques, with load time for a 40-gigabyte data set reduced from over 20 hours to less than 3 hours. Our framework offers a promising approach for loading other large and complex scientific databases.
Low-frequency noise conversion modeling in RF devices under forced nonlinear operation: Research Articles
Authors: Gabriele Conte, Francesco Bertazzi, Simona Donati Guerrieri, Fabrizio Bonani, Giovanni Ghione
Venue: International Journal of RF and Microwave Computer-Aided Engineering (2006)

The article addresses the frequency conversion of low-frequency noise deriving from trap-assisted generation-recombination (GR) noise in RF devices under forced, nonlinear operation through a physics-based noise model. The superposition of the stationary (small-signal) GR spectra originating from noninteracting trap levels with properly distributed energies is shown, in simple yet significant device case studies, to yield a 1&#x002F;f or 1&#x002F;f-like behaviour over a prescribed frequency range. The same trap distribution is also exploited for large-signal, cyclostationary noise simulation in forced periodic conditions. In this case, low-frequency 1&#x002F;f-like noise is shown to be upconverted from the baseband to all noise sidebands. Circuit-level compact modeling strategies for noise-frequency conversion based on the modulation of small-signal low-frequency noise are also investigated and compared to the fundamental approach. &copy; 2005 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2006.
A Linux DVR is no myth-it's MythTV!
Authors: James Turner
Venue: Linux Journal (2005)

Although commercial Digital Video Recorders (like TiVo) charge more and restrict your options, Linux alternatives are free and rock!
Learning predictive state representations in dynamical systems without reset
Authors: Britton Wolfe, Michael R. James, Satinder Singh
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

Predictive state representations (PSRs) are a recently-developed way to model discrete-time, controlled dynamical systems. We present and describe two algorithms for learning a PSR model: a Monte Carlo algorithm and a temporal difference (TD) algorithm. Both of these algorithms can learn models for systems without requiring a reset action as was needed by the previously available general PSR-model learning algorithm. We present empirical results that compare our two algorithms and also compare their performance with that of existing algorithms, including an EM algorithm for learning POMDP models.
RFID technology
Authors: Joël Dansou-Eloi
Venue: Proceedings of the 2005 joint conference on Smart objects and ambient intelligence: innovative context-aware services: usages and technologies (2005)

At the end of the 19th century, Lord Kelvin, one of the world's greatest physicists and president of The Royal Society, was asked if machines might fly. No, he replied, only balloons could fly. "Heavier-than-air flying machines are impossible", he said. Yet several years later, the Wright brothers flew. Today we all do! The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
ERMETH: The First Swiss Computer
Authors: Hans Neukom
Venue: IEEE Annals of the History of Computing (2005)

In 1948 the Federal Institute of Technology in Zürich, Switzerland, (ETH), established a new institute in its mathematics division, the Institute of Applied Mathematics. Its first director, Professor Eduard Stiefel, recognized from the beginning, that the newly emerging computers would be adamant to this new field of mathematics. The early use of the Zuse Z4 Computer at Stiefel's Institute is well known, however no detailed description about Stiefel's own construction, the ERMETH computer have been published so far. This article describes why Stiefel decided to build his own computer and what objectives he set for it. The article also gives insight into the construction of ERMET, how it was programmed, and what it was used for.
A Statistical Method for Fast and Accurate Capacitance Extraction in the Presence of Floating Dummy Fills
Authors: Shabbir Batterywala, Rohit Ananthakrishna, Yansheng Luo, Alex Gyure
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

Dummy fills are being extensively used to enhance CMP planarity. However presence of these fills can have a significant impact on the values of interconnect capacitances. Accurate capacitance extraction accounting for these dummies is CPU intensive and cumbersome. For one, there are typically hundreds to thousands of dummy fills in a small layout region, which stress the general purpose capacitance extractor. Second, since these dummy fills are not introduced by the designers, it is of no interest for them to see the capacitances to dummy fills in the extraction reports; they are interested in equivalent capacitances associated with signal power and ground nets. Hence extracting equivalent capacitances across nets of interest in the presence of large number of dummy fills is an important and challenging problem. We present a novel extension to the widely popular Monte-Carlo capacitance extraction technique. Our extension handles the dummy fills efficiently. We demonstrate the accuracy and scalability of our approach by two methods (i) classical and golden technique of finding equivalent interconnect capacitances by eliminating dummy fills through the network reduction method and (ii) comparing extracted capacitances with measurement data from a test chip.
Rigid Carnot Algebras: A Classification
Authors: A. Agrachev, A. Marigo
Venue: Journal of Dynamical and Control Systems (2005)

A Carnot algebra is a graded nilpotent Lie algebra L = L1 ¿ ¿ ¿ Lr generated by L1. The bidimension of the Carnot algebra L is the pair (dim L1, dim L). A Carnot algebra is said to be rigid if it is isomorphic to any of its small perturbations in the space of Carnot algebras of the prescribed bidimension. In this paper, we give a complete classification of rigid Carnot algebras. In addition to free nilpotent Lie algebras, there are two infinite series and 29 exceptional rigid algebras of 16 exceptional bidimensions.
Enhancement of Layout-based Identification of Low-resolution Documents using Geometrical Color Distribution
Authors: Ardhendu Behera, Denis Lalanne, Rolf Ingold
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

This paper proposes a multi-signature document identification method that works robustly with lowresolution documents captured from handheld devices. The proposed method is based on the extraction of a visual signature containing both (a) the color content distribution in the image plane of the document, i.e. the color signature, and (b) the shallow layout structure of the document, i.e. the layout signature. The color distribution is first considered, in order to filter documents with very dissimilar colors, and the identification is finally done on the remaining set using the layout signature. An evaluation, that compares our color and layout-based method with the layout signature alone, is finally presented.
Are wikis usable?
Authors: Alain Désilets, Sébastien Paquet, Norman G. Vinson
Venue: Proceedings of the 2005 international symposium on Wikis (2005)

Wikis are simple to use, asynchronous, Web-based collaborative hypertext authoring systems which are quickly gaining in popularity. In spite of much anecdotal evidence to the effect that wikis are usable by non technical experts, this has never been studied formally. In this paper, we studied the usability of a wiki through observation and problem-solving interaction with several children who used the tool to collaboratively author hypertext stories over several sessions. The children received a minimal amount of instruction, but were able to ask for help during their work sessions. Despite minimal instruction, 5 out of 6 teams were able to complete their story. Our data indicate that the major usability problems were related to hyperlink management. We report on this and other usability issues, and provide suggestions for improving the usability of wikis. Our analysis and conclusions also apply to hypertext authoring with non wiki-based tools.