ppxscal/embedding_network huggingface dataset:
Configware and morphware going mainstream
Authors: Jürgen Becker, Reiner Hartenstein
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2003)

The paper addresses a broad readership in information technology, computer science and related areas, and gives an introduction to fine grain and coarse grain morphware, reconfigurable computing, and its impact on classical computer science and business models. It points out trends driven by microelectronics technology, EDA, and the mind set of data-stream-based computing.
XVerter: querying XML data with OR-DBMS
Authors: Humberto Vieira, Gabriela Ruberg, Marta Mattoso
Venue: Proceedings of the 5th ACM international workshop on Web information and data management (2003)

Storage techniques and queries over XML databases are being widely studied. Most works store XML documents in traditional DBMSs in order to take advantage of a well established technology and also to store both structured data and XML data within a single system. This work proposes a translation mechanism to execute queries expressed on XQuery on top of XML documents that are stored in an object DBMS using the DOM implementation in disk. Rules for automatic translation from XQuery to SQL3 are presented, where an object-based representation of XML documents is exploited.
Some connectivity properties for excluded minors of the graph invariant v(G)
Authors: Hein van der Holst
Venue: European Journal of Combinatorics (2003)

Let v(G) be the graph invariant introduced by Colin de Verdière in J. Combin. Theory Ser. B. 74 (1998) 121. Let k ≥ 0, and let H be an excluded minor of the class of graphs G with v(G) ≤ k. We show that H has no vertex cuts of size at most two and that, if S is a vertex cut of size three of H, then G - S has two components, and S is the neighbourhood of a vertex v and the subgraph induced by S ∪ {v} is isomorphic to one of the graphs in a certain collection of six graphs.
Active Sampling for Feature Selection
Authors: Sriharsha Veeramachaneni, Paolo Avesani
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

In knowledge discovery applications, where new featuresare to be added, an acquisition policy can help select thefeatures to be acquired based on their relevance and thecost of extraction. This can be posed as a feature selectionproblem where the feature values are not known in advance.We propose a technique to actively sample the featurevalues with the ultimate goal of choosing between alternativecandidate features with minimum sampling cost.Our heuristic algorithm is based on extracting candidatefeatures in a region of the instance space where the featurevalue is likely to alter our knowledge the most. An experimentalevaluation on a standard database shows that it ispossible outperform a random subsampling policy in termsof the accuracy in feature selection.
Buffer and Controller Minimisation for Time-Constrained Testing of System-On-Chip
Authors: Anders Larsson, Erik Larsson, Petru Eles, Zebo Peng
Venue: Proceedings of the 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2003)

Test scheduling and Test Access Mechanism (TAM) design are two important tasks in thedevelopment of a System-on-Chip (SOC) test solution. Previous test scheduling techniques assume a dedicated designed TAM which have the advantage of high flexibility in the scheduling process. However, hardware overhead for implementing the TAM and additional routing is required of the TAMs. In this paper we propose a technique that makes use of the existing functional buses for the test data transportation inside the SOC. We have dealt with the test scheduling problem with this new assumption and developed a technique to minimise the test-controller and buffer size for a bus-based multi-core SOC. We have solved the problem by using a constraint logic programming (CLP) technique and demonstrated the efficiency of our approach by running experiments on benchmark designs.
Computing homotopic shortest paths in the plane
Authors: Sergei Bespamyatnikh
Venue: Journal of Algorithms (2003)

We address the problem of computing homotopic shortest paths in the presence of obstacles in the plane. Problems on homotopy of paths received attention very recently [Cabello et al., in: Proc. 18th Annu. ACM Sympos. Comput. Geom., 2002, pp. 160-169; Efrat et al., in: Proc. 10th Annu. European Sympos. Algorithms, 2002, pp. 411-423]. We present two output-sensitive algorithms, for simple paths and non-simple paths. The algorithm for simple paths improves the previous algorithm [Efrat et al., in: Proc. 10th Annu. European Sympos. Algorithms, 2002, pp. 411-423]. The algorithm for non-simple paths achieves O(log2n) time per output vertex which is an improvement by a factor of O(n/log2n) of the previous algorithm [Hershberger, Snoeyink, Comput. Geom. Theory Appl. 4 (1994) 63-98], where n is the number of obstacles. The running time has an overhead O(n2+ε) for any positive constant ε. In the case k < n2+ε, where k is the total size of the input and output, we improve the running to O((n + k + (nk)2/3) logO(1) n).
The need for government-wide information capacity
Authors: Patrick R. Mullen
Venue: Social Science Computer Review (2003)

Jane Fountain discussed the need for government-wide or federal interagency information capacity. She concluded that the constraints of the Clinger-Cohen Act's reporting mechanisms have caused the U.S. General Accounting Office (GAO) to lose sight of the big picture--the need for interagency networking and information technology (IT) oversight. However, there has been considerable behind-the-scenes work by GAO to bring about passage of legislation to increase government-wide information capacity through, for example, the E-Government Act of 2002. The act establishes (a) an Office of Electronic Government within the Office of Management and Budget and (b) data sharing between certain agencies. Much of GAO's work tends not to be reflected in reports on individual agency IT problems. However, GAO has testified of the need for more government-wide focus on IT challenges, lending support to Dr. Fountain's overall point about the need for government-wide information capacity.
Using CITIDEL resources to support documenting objectives and outcomes
Authors: Lillian N. Cassel
Venue: Proceedings of the 8th annual conference on Innovation and technology in computer science education (2003)

This poster demonstrates connecting objectives, outcomes and CITIDEL resources to improve course preparation. The example used is mobile computing.
A Framework for Assessing HMIS in Developing Countries: Latvia as a Case Study
Authors: Dominic S. Haazen, Dennis J. Streveler
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 6 - Volume 6 (2004)

The health systems in many developing countries lag seriously behind the developed world in the use of Health Management Information Systems (HMIS). The World Bank, like other international donor organizations, is increasingly called upon to provide technical andfinancial assistance in this area, but success stories remain rare. Because HMIS are critical to developing and improving health systems delivery and finance, the Bank must find ways to increase effectiveness of the interventions it supports.This paper attempts to contribute to this process by proposing a new conceptual framework for the assessment of HMIS interventions, and then demonstrating the framework by applying it to an existing project to support national health insurance in Latvia.The paper documents the key characteristics of the HMIS project, discusses successes and failures to date, and presents lessons learned that may be applicable to other HMIS projects in developing countries. The case study focuses on a functional classification of the HMIS implementation, and critical success factors that have emerged with regard to systems implementation in developed countries.
Ant Colony Optimization Technique for Macrocell Overlap Removal
Authors: Stelian Alupoaei, Srinivas Katkoori
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

We present a novel macrocell overlap removal algorithm,based on the ant colony optimization (ACO) metaheuristic.The algorithm generates a feasible placement from arelative placement with overlaps produced by some placementalgorithms such as quadratic programming and force-directed.It uses the concept of ant colonies, a set of agentsthat work together to improve an existing solution. Each antin the colony will generate a placement based on the relativepositions of the cells and feedback information aboutthe best placements generated by previous colonies. The solutionof each ant is improved by using a local optimizationprocedure.
Enhancing network object caches through cross-domain prediction
Authors: Joseph D. Touch
Venue:  (2002)

User-perceived latency prevents the web and other request/response applications from being truly interactive. Some delays can be reduced by upgrading equipment and links, but the only way to completely avoid latency is to predict which objects will be requested and prefetch them. The main contribution of this dissertation is a method for providing new structure to support prefetching. To prefetch objects that will be requested by the user, a function that determines likely future requests must exist. Some applications lack structure useful for making predictions. For these applications, it may be possible to import predictive structure from other applications that are related through shared data or functional dependencies. This document presents a model for single-application predictors highlighting predictive structure. It extends the model to create more sophisticated predictors by homomorphically composing multiple applications, which is called cross-domain prediction. Two example applications presented in detail are Web-DNS prediction and E-mail-Web prediction. Web-DNS prediction forecasts future DNS requests using web documents, enabling prediction in a system where none was previously possible. A log-based simulation shows that DNS prefetching based on web requests reduces the miss rate by 15% with only a threefold increase in the DNS cache size. With E-mail-Web prediction, incoming e-mail messages predict web requests. A six-month, multi-user study examining e-mail messages and web requests showed that e-mailed URLs enable prediction for about a 25% of previously unpredictable requests, with negligible impact on overall load.
Qos measurement and management for internet real-time multimedia services
Authors: Henning Schulzrinne
Venue:  (2003)

In recent years real-time multimedia services have become increasingly popular over the Internet, in particular voice over IP (VoIP). Nevertheless, several issues remain outstanding before the wide acceptance of these services. First of all, due to the Internet's best-effort nature, users may experience less than desirable quality and sometimes intermittent service. For example, Internet phone calls are often less clear than calls carried over the public switched telephone network (PSTN). Second, despite increasing popularity of consumer VoIP services, wide-area enterprise deployment remains rare. Third, for a service as critical as VoIP, the provider must offer a high level of service availability, where availability refers to how often the service is available, that is, a call can be successfully made and maintained, as opposed to the voice quality of a call. We tackle the first issue in two parts. In Part I of this dissertation, we present our measurement of Quality of Service (QoS) for Internet real-time multimedia services, which is important for both customer-provider service level agreement validation and for providing feedback to adaptive applications. First we discuss the analytical modeling of objective QoS metrics (loss, delay, jitter) and the techniques for measuring them. Second, we investigate the relationship between objective QoS and subjective quality, notably the Mean Opinion Score (MOS). This is done through a series of MOS listening tests, particularly on the effect of loss burstiness on subjective quality. Third, because MOS listening tests are time-consuming and labor intensive, we will introduce and evaluate an automated MOS estimation algorithm that we designed based on automatic speech recognition (ASR). In Part II, we analyze and compare QoS improvement measures. We first examine end-to-end based approaches, with an original study comparing the subjective quality and trade-off of loss recovery methods based on forward error correction (FEC), low bit-rate redundancy (LBR) and packet loss concealment (design of more error resilient codecs). Next, we study network-based QoS improvement approaches, specifically how the on-off patterns of human speech produced by modern silence detectors differ from the traditionally believed exponential model, and how this affects voice traffic aggregation performance. In Part III of this dissertation, we investigate the state of the art of VoIP in three aspects. First, since the quality of a service is no better than that of its weakest component, we evaluate VoIP end-points (IP phones and software clients), and discuss the level of quality that existing products provide. Second, to address the issue of enterprise VoIP deployment, we present a case study of IP telephony deployment in the department of Computer Science, particularly in the aspect of PSTN-IP integration. Finally, to investigate the last issue, we will describe an Internet measurement experiment we have conducted, and assess through various metrics the service availability of VoIP in today's Internet.
Graphs, networks, and linear unbiased estimates
Authors: Gregory M. Constantine
Venue: Discrete Applied Mathematics (2003)

It is shown how a best linear unbiased estimate (blue) in the additive variety-block setting can be interpreted as a network flow, that is, a function on edges that obeys the Kirkhhoff laws, of minimum square norm. An explicit expression is then obtained for the coefficients of the blue in terms of invariants of the underlying network; specifically, the invariants are: the total number of spanning trees and the number of certain selective yet specific spanning forests with just two trees. The blue is also expressed as a linear combination of bases of paths in a constructive manner. It remains a conjecture as to whether there always exists a basis of paths in which the blue is a convex combination. Consequences to design optimality are explored.
The dimensions of individual strings and sequences
Authors: Jack H. Lutz
Venue: Information and Computation (2003)

A constructive version of Hausdorff dimension is developed using constructive supergales, which are betting strategies that generalize the constructive supermartingales used in the theory of individual random sequences. This constructive dimension is used to assign every individual (infinite, binary) sequence S a dimension, which is a real number dim(S) in the interval [0, 1]. Sequences that are random (in the sense of Martin-Löf) have dimension 1, while sequences that are decidable, Σ10, or Π10, have dimension 0. It is shown that for every Δ20-computable real number α in [0, 1] there is a Δ20 sequence S such that dim(S) = α. A discrete version of constructive dimension is also developed using termgales, which are supergale-like functions that bet on the terminations of (finite, binary) strings as well as on their successive bits. This discrete dimension is used to assign each individual string w a dimension, which is a nonnegative real number dim(w). The dimension of a sequence is shown to be the limit inferior of the dimensions of its prefixes. The Kolmogorov complexity of a string is proven to be the product of its length and its dimension. This gives a new characterization of algorithmic information and a new proof of Mayordomo's recent theorem stating that the dimension of a sequence is the limit inferior of the average Kolmogorov complexity of its first n bits. Every sequence that is random relative to any computable sequence of coin-toss biases that converge to a real number β in (0, 1) is shown to have dimension H(β), the binary entropy of β.
SIGCSE special projects showcase
Authors: Sally Fincher
Venue: ACM SIGCSE Bulletin (2004)

This session showcases the projects that have received support from a SIGCSE Special Project Award in the previous year.
High-Speed Optoelectronics Receivers in SiGe
Authors: Amit Gupta, Steven P. Levitan, Leo Selavo, Donald M. Chiarulli
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

This paper focuses on the investigation of integratedCMOS and Silicon/Germanium (SiGe) devices for high-speedoptical receiver circuits. In this paper, we presentseveral competitive designs of front-end transimpedanceamplifiers (TIA) for optical receiver applications using theIBM 5HP (0.5micron) SiGe technology. This technologyexhibits fT and fMAX of 47GHz and 65GHz respectively.Spectre simulations in the Cadence Affirma analog designenvironment are conducted for both the TIA's and acomplete receiver circuit consisting of a TIA, a cascadedmulti-stage differential amplifier and a multi-stageinverting amplifier at the single supply voltage of 3.3V. Wealso discuss the practicality of using SiGe basedphotodetectors for 1.3-1.5um wavelength light and the useof Neolinear's NeoCircuit/NeoCell mixed signal designtools for optimization of the analog circuits.
Low-power DoS attacks in data wireless LANs and countermeasures
Authors: Guevara Noubir, Guolong Lin
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2003)

In this paper we investigate the resiliency to jamming of data protocols, such as IP, over WLAN. We show that, on existing WLAN, an adversary can successfully jam data packets at a very low energy cost. Such attacks allow a set of adversary nodes disseminated over an area to prevent communication, partition an ad hoc network, or force packets to be routed over adversary chosen paths. The ratio of the jamming pulses duration to the transmission duration can be as low as 10--4. We investigate and analyze the performance of using various coding schemes to improve the robustness of wireless LANs for IP packets transmission. A concatenated code that is simple to decode and can maintain a low Frame Error Rate (FER) under a jamming effort ratio of 15%. We argue that LDPC codes will be very suitable to prevent this type of jamming. We investigate the theoretical limits by analyzing the performance derived from upper bounds on binary error-control codes. We also propose an efficient anti-jamming technique for IEEE802.11b.
A model for multimodal reference resolution
Authors: Luis Pineda
Venue: Computational Linguistics (2000)

An important aspect of the interpretation of multimodal messages is the ability to identify when the same object in the world is the referent of symbols in different modalities. To understand the caption of a picture, for instance, one needs to identify the graphical symbols that are referred to by names and pronouns in the natural language text. One way to think of this problem is in terms of the notion of anaphora; however, unlike linguistic anaphoric inference, in which antecedents for pronouns are selected from a linguistic context, in the interpretation of the textual part of multimodal messages the antecedents are selected from a graphical context. Under this view, resolving multimodal references is like resolving anaphora across modalities. Another way to see the same problem is to look at pronouns in texts about drawings as deictic. In this second view, the context of interpretation of a natural language term is defined as a set of expressions of a graphical language with well-defined syntax and semantics. Natural language and graphical terms are thought of as standing in a relation of translation similar to the translation relation that holds between natural languages. In this paper a theory based on this second view is presented. In this theory, the relations between multimodal representation and spatial deixis, on the one hand, and multimodal reasoning and deictic inference, on the other, are discussed. An integrated model of anaphoric and deictic resolution in the context of the interpretation of multimodal discourse is also advanced.
Effective Software-Based Self-Test Strategies for On-Line Periodic Testing of Embedded Processors
Authors: Antonis Paschalis, Dimitris Gizopoulos
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

Software-based self-test (SBST) strategies are particularly useful for periodic testing of deeply embedded processors in low-cost embedded systems that do not require immediate detection of errors and cannot afford the well-known hardware, software, or time redundancy mechanisms.In this paper, first, we identify the stringent characteristics of an SBST test program to be suitable for on-line periodic testing. Then, we introduce a new SBST methodology with a newclassification scheme for processor components. After that, we analyze the self-test routine code styles for the three more effective test pattern generation (TPG) strategies in order to select the most effective self-test routine for on-line periodic testing of a component under test. Finally, we demonstrate the effectiveness of the proposed SBST methodology for on-line periodic testing by presenting experimental results for a RISC pipeline processor.
Thermal response of MOCVD hafnium silicate
Authors: Patrick Lysaght, Brendan Foran, Susanne Stemmer, Gennadi Bersuker, Joe Bennett, Robin Tichy, Larry Larson, Howard R. Huff
Venue: Microelectronic Engineering (2003)

As complementary metal oxide semiconductor (CMOS) devices continue to scale along the rapid performance and miniaturization pace of Moore's Law, the unacceptably high direct tunneling leakage current through the thin transistor gate insulator layer is of increasing concern. To this end, gate insulator materials with significantly higher dielectric constants (k = 10-25) continue to be investigated as potential replacements for silicon dioxide, SiO2 (k = 3.9), and silicon oxynitride. This challenge provides opportunities for integration of a physically thicker film with lower leakage current and with capacitance equivalent to <1.0 nm SiO2. Local changes in the composition of the candidate material, uncapped metal-organic chemical vapor deposited (MOCVD) hafnium silicate, (HfO2)x-1 (SiO2)x, have been evaluated by several techniques, including grazing incidence X-ray diffraction (GI-XRD), time-of-flight secondary ion mass spectroscopy (ToF-SIMS) and high angle annular dark field scanning transmission electron microscopy (HAADF-STEM). Hafnium silicate gate dielectric transistor performance data comparing high-k films with post-deposition anneal (PDA) treatments of NH3 and N2 at various process temperatures are presented. Changes in the material microstructLtre associated with phase segregation and crystallization as a function of Hf silicate composition and anneal temperature have been observed and discussions of the corresponding reaction mechanisms are presented.