ppxscal/embedding_network huggingface dataset:
A Note on VC-Dimension and Measure of Sets of Reals
Authors: Shai Ben-David, Leonid Gurvits
Venue: Combinatorics, Probability and Computing (2000)

Vapnik and Chervonenkis proposed in [7] a combinatorial notion of dimension that reflects the &lsquo;combinatorial complexity&rsquo; of families of sets. In the three decades that have passed since that paper, this notion &ndash; the Vapnik&ndash;Chervonenkis dimension (VC-dimension) &ndash; has been discovered to be of primal importance in quite a wide variety of topics in both pure mathematics and theoretical computer science.In this paper we turn our attention to classes with infinite VC-dimension, a realm thrown into one big bag by the usual VC-dimension analysis. We identify three levels of combinatorial complexity of classes with infinite VC-dimension. We show that these levels fall under the set-theoretic definition of &sigma;-ideals (in particular, each of them is closed under countable unions), and that they are all distinct. The first of these levels (i.e., the family of &lsquo;small&rsquo; infinite-dimensional classes) coincides with the family of classes which are non-uniformly PAC-learnable.Maybe the most surprising contribution of this work is the discovery of an intimate relation between the VC-dimension of a class of subsets of the natural numbers and the Lebesgue measure of the set of reals defined when these subsets are viewed as binary representations of real numbers.As a by-product, our investigation of the VC-dimension-induced ideals over the reals yields a new proper extension of the Lebesgue measure. Another offshoot of this work is a simple result in probability theory, showing that, given any sequence of pairwise independent events, any random event is eventually independent of the members of the sequence.
A lightweight Java taskspaces framework for scientific computing on computational grids
Authors: H. De Sterck, R. S. Markel, T. Phol, U. Rüde
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

A prototype Taskspaces framework for grid computing of scientific computing problems that require intertask communication is presented. The Taskspaces framework is characterized by three major design choices: decentralization provided by an underlying tuple space concept, enhanced direct communication between tasks by means of a communication tuple space distributed over the worker hosts, and object orientation and platform independence realized by implementation in Java. Grid administration tasks, for example resetting worker nodes, are performed by mobile agent objects. We report on large-scale grid computing experiments for iterative linear algebra applications showing that our prototype framework scales well for scientific computing problems that require neighbor-neighbor intertask communication. It is shown in a computational fluid dynamics simulation using a Lattice Boltzmann method that the Taskspaces framework can be used naturally in interactive collaboration mode. The scalable Taskspaces framework runs fully transparently on heterogeneous grids while maintaining a low complexity in terms of installation, maintenance, application programming and grid operation. It thus offers a promising roadway to push scientific grid computing with intertask communication beyond the experimental research setting.
Opinion: The Demise of the Waterfall Model Is Imminent
Authors: Phillip A. Laplante, Colin J. Neill
Venue: Queue (2004)

Rumors of the demise of the Waterfall Life-cycle Model are greatly exaggerated. We discovered this and other disappointing indicators about current software engineering practices in a recent survey of almost 200 software professionals. These discoveries raise questions about perception versus reality with respect to the nature of software engineers, software engineering practice, and the industry.
Higher order sparse grid methods for elliptic partial differential equations with variable coefficients
Authors: S. Achatz
Venue: Computing (2003)

We present a method for discretizing and solving general elliptic partial differential equations on sparse grids employing higher order finite elements. On the one hand, our approach is charactarized by its simplicity. The calculation of the occurring functionals is composed of basic pointwise or unidirectional algorithms. On the other hand, numerical experiments prove our method to be robust and accurate. Discontinuous coefficients can be treated as well as curvilinearly bounded domains. When applied to adaptively refined sparse grids, our discretization results to be highly efficient, yielding balanced errors on the computational domain.
Multi-Processor SoC Design Methodology Using a Concept of Two-Layer Hardware-Dependent Software
Authors: Sungjoo Yoo, Mohamed-Wassim Youssef, Aimen Bouchhima, Ahmed A. Jerraya, Mario Diaz-Nava
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 2 (2004)

In conventional multiprocessor SoC (MPSoC) design methods, we find two problems: lack of SW code portability and lack of early SW validation. The problems cause a long design cycle. To resolve them, we present a concept of two-layer hardware-dependent software (HdS). The presented HdS consists of hardware abstraction layer to abstract the subsystem architecture and SoC abstraction layer to abstract the global MPSoC architecture. During the exploration of global and sub-system architectures, the application programming interfaces of presented two-layer HdS allow to keep the SW independent from architectural change. The simulationmodels of two-layer HdS enable to validate the entire system including the SW and HW design early in the design steps. We show the effectiveness of the presented methodology inthe MPSoC architecture exploration of an OpenDiVX encoder system design.
On the specification of software components
Authors: Michael Goedicke, Harald Schumann, Joachim Cramer
Venue: Proceedings of the 6th international workshop on Software specification and design (1991)

In this paper we discuss how the notion of <u>software component</u> can be turned into a specification language concept. Such component description languages (CDL) would directly support reuse, flexible construction of large systems and team-work. First we analyze important requirements to CDLs and discuss the component support of different languages. Finally we discuss extensions necessary to cover also quantitative aspects in component descriptions.
Practical, Unified, Motion and Missing Data Treatment in Degraded Video
Authors: Anil Kokaram
Venue: Journal of Mathematical Imaging and Vision (2004)

Recently, the problem of automated restoration of archived sequences has caught the attention of the Video Broadcast industry. One of the main problems is deadling with Blotches caused by film abrasion or dirt adhesion. This paper presents a new framework for the simultaneous treatment of missing data and motion in degraded video sequences. Using simple, translational models of motion, a joint solution for the detection, and reconstruction of missing data is proposed. The framework also incorporates the unique notion of dealing with occlusion and uncovering as it pertains to picture building. The idea is to use MCMC to solve the resulting problem articulated under a Bayesian framework, but to deploy purely deterministic mechanisms for dealing with the solution. This results in a relatively fast implementation that unifies many of the pixel-by-pixel schemes previously described in the literature.
On the total number of prime factors of an odd perfect number
Authors: D. E. Iannucci, R. M. Sorli
Venue: Mathematics of Computation (2003)

We say n ∈ N is perfect if σ(n) = 2n, where σ(n) denotes the sum of the positive divisors of n. No odd perfect numbers are known, but it is well known that if such a number exists, it must have prime factorization of the form n = pα Φj=1k qj2βj, where p,q1,..., qk are distinct primes and p ≡ α ≡ 1 (mod 4). We prove that if βj ≡ 1 (mod 3) or βj ≡ 2 (mod 5) for all j, 1 ≤ j ≤ k, then 3|n. We also prove as our main result that Ω(n) ≥ 37, where Ω(n) = α + 2 Σj=1k βj. This improves a result of Sayers (Ω(n) ≥ 29) given in 1986.
A comparison of interobserver agreement and quantity of usability data obtained using graphics-based and text-based data collection tools
Authors: Frances L. Palacio, Douglas R. Bloch, Carol Righi
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: distributed computing - Volume 2 (1993)

This study compares two data collection tools to determine whether graphical and textbased observational systems yield different degrees of interobserver agreement, and different quantities of usability data. Consistency across observers is a necessary element of the reliability of data [3,10]. Additionally, increasing the quantity of data obtained in an observational study has a positive effect on the reliability of the data, and provides more complete information about the product being evaluated [1,4,7,9]. If the tool used to collect data affects interobserver agreement and quantity of data obtained, the tool itself must be considered a factor in the reliable collection and interpretation of usability data. Examining the particular characteristics of the tool can yield important information for improving the quality and quantity of usability data collected in an observational study.In this study we compare usability data obtained using a graphics-based observation database system designed to enable observers to log data by using point and click rather than keystroke (typing) data entry, and a stand-alone, text-based, online logging program. Four monitors trained in the use of both tools simultaneously observed and recorded the behavior of the same test participant in an in vitro situation. Each monitor used each tool once. Trials were counterbalanced to account for order and test subject effects. Data collected included task completion, task time, subject and monitor comments and subject behaviors, and an evaluation of each tool by the monitors. Data were analyzed for interobserver agreement within and between tools, and for quantity of anecdotal data collected with each. Additional analyses included monitor comments about and ratings of the tools. Results indicate somewhat similar interobserver reliability measures for the two tools. The graphics tool yielded somewhat more anecdotal data than the text-based system. Most monitors expressed no preference in favor of either tool, and gave the text-based tool a more favorable overall evaluation than the graphics-based tool. These results are examined with respect to these particular tools, and to the use of graphical and text-based observational database tools in general.
Towards a Standard Family of Languages for Matching Patterns in Source Code
Authors: Uri Dekel, Tal Cohen, Sara Porat
Venue: Proceedings of the IEEE International Conference on Software-Science, Technology & Engineering (2003)

This paper makes a case for the definition of a family oflanguages for expressing patterns over both the structureand semantics of source code. Our proposal is unique inthat it attempts to provide a unified solution to the problemof searching for patterns in multiple programming languages,and in that it focuses on the semantics of the programrather than on its syntactic structure, all while strivingto ensure simplicity and ease-of-use. We present the motivationand the unique difficulties involved in defining suchlanguages, discuss strategies for dealing with these problems,and propose a prototype family of Code Pattern Languages(CPLs).
DRC: A Dependence Relationships Based Cohesion Measure for Classes
Authors: Yuming Zhou, Lijie Wen, Jianmin Wang, Yujian Chen, Hongmin Lu, Baowen Xu
Venue: Proceedings of the Tenth Asia-Pacific Software Engineering Conference Software Engineering Conference (2003)

In last decade, a large number of cohesion measuresbased on method-attribute references have beenproposed. However, virtually no attention has been paidto the abstract representation that objectively depicts therelationships among the members of a class. Specially,the flow dependence relationship among attributes, theindirect and potential dependence relationships amongclass members, and the direction of method-attributereferences are ignored. To address this problem, thispaper first identifies four types of basic dependencerelationships and uses a class member dependence graphto represent all dependences among the members of aclass. Then, a dependence relationships based measurefor measuring the class cohesiveness is proposed. Finally,this paper compares our class cohesion measure withtypical cohesion measures.
Herbrand Award Acceptance Speech
Authors: Peter B. Andrews
Venue: Journal of Automated Reasoning (2003)

This is a slightly enhanced version of the acceptance speech given by the author after receiving the Herbrand Award at the 19th International Conference on Automated Deduction (CADE-19) in Miami, Florida, on August 1, 2003. Historical matters related to Herbrand's theorem, higher-order logic, and the author's work are discussed. Contributions by others that have been helpful to the author are noted.
An evaluation of multi-resolution storage for sensor networks
Authors: Deepak Ganesan, Ben Greenstein, Denis Perelyubskiy, Deborah Estrin, John Heidemann
Venue: Proceedings of the 1st international conference on Embedded networked sensor systems (2003)

Wireless sensor networks enable dense sensing of the environment, offering unprecedented opportunities for observing the physical world. Centralized data collection and analysis adversely impact sensor node lifetime. Previous sensor network research has, therefore, focused on in network aggregation and query processing, but has done so for applications where the features of interest are known a priori. When features are not known a priori, as is the case with many scientific applications in dense sensor arrays, efficient support for multi-resolution storage and iterative, drill-down queries is essential.Our system demonstrates the use of in-network wavelet-based summarization and progressive aging of summaries in support of long-term querying in storage and communication-constrained networks. We evaluate the performance of our linux implementation and show that it achieves: (a) low communication overhead for multi-resolution summarization, (b) highly efficient drill-down search over such summaries, and (c) efficient use of network storage capacity through load-balancing and progressive aging of summaries.
Moving Towards Quality Attribute Driven Software Architecture Reconstruction
Authors: Christoph Stoermer, Liam O'Brien, Chris Verhoef
Venue: Proceedings of the 10th Working Conference on Reverse Engineering (2003)

There are many good reasons why organizations shouldperform software architecture reconstructions. However,few organizations are willing to pay for the effort. Softwarearchitecture reconstruction must be viewed not as an efforton its own but as a contribution in a broader technicalcontext, such as the streamlining of products into a productline or the modernization of systems that hit theirarchitectural borders. In these contexts software architectsfrequently need to reason about existing systems, forexample to lower adoption and technical barriers for newtechnology approaches. We propose a Quality AttributeDriven Software Architecture Reconstruction (QADSAR)approach where this kind of reasoning is driven by theanalysis of quality attribute scenarios.This paper introduces a quality attribute driven perspectiveon software architecture reconstruction. It presents atechnical reasoning framework and illuminates theinformation that is required from the reconstruction processto link the knowledge gained back to the business goals ofan organization. The paper illustrates the techniques bypresenting a real-world case study.
Java as the lingua franca for teaching graduate students
Authors: T. F. Lunney, P. J. McCullagh, P. J. Lundy
Venue: Proceedings of the 2nd international conference on Principles and practice of programming in Java (2003)

Choosing an appropriate language to introduce students to computer programming has been a matter of debate for many years. The choice is arguably more critical in the case of one-year graduate courses, than for students from a non-computing background. Students on these courses are strongly focused towards employment, but the intensive format gives limited time to equip them with the necessary core computing skills. This paper explores an OO-light teaching approach to Java as a first language. This approach has sustained progression rates in large cohorts, and the knowledge of Java accumulated, facilitates progress to useful project work, in the current Web and networks dominated computing climate.
Techniques for high-bandwidth, low-latency interconnection network operation at high offered loads
Authors: Mithuna Shamabhat Thottethodi
Venue:  (2002)

While there are a number of techniques that have enhanced interconnection network performance significantly, known performance problems due to network saturation at high offered loads that result in poor bandwidth and high latencies continue to pose a challenge to system designers. The symptoms of the problems are as follows: the achieved throughput goes up with offered load steadily till a certain point beyond which there is a sudden and significant drop in throughput (and a corresponding increase in latency). This occurs due to imbalances in network resource usage as well as the lack of fast feedback resulting in routers making decisions using only locally available information that may be globally detrimental. Solutions to this problem can be broadly classified into two categories: (a) congestion control solutions and (b) load balancing solutions. This thesis proposes and evaluates one congestion control technique and two load balancing techniques to overcome the performance problems in k-ary, n-cube networks at high loads. The first technique is a self-tuned congestion control mechanism&mdash; Tune&mdash;that has two key features: (a) it uses global congestion information to throttle the offered load when saturation is imminent and thus ensures that the network stays in the high-bandwidth, low latency region of operation and (b) it has a global throughput-driven self-tuning mechanism that enables it to adapt to various communication patterns. Simulations with various communication patterns show that Tune is able to prevent the sudden drop in performance that occurs at saturation. Tune can be used with both wormhole and virtual cut-through switched networks. The second technique&mdash;congestion-aware via routing&mdash;attempts to achieve load balancing to prevent saturation. In this technique, packets are directed away from congested network regions using global congestion information by requiring them to go via certain intermediate nodes. I demonstrate that this technique achieves limited improvements for non-uniform traffic patterns. Simulations show that the benefits of congestion aware via-routing , even with perfect global knowledge, are not compelling. Finally, I propose a new non-minimal routing (i.e. packets can be routed on hops that take them farther from the destination) algorithm&mdash; BLAM&mdash;that goes beyond the constraints of minimal routing which I assumed for the first two techniques. (Abstract shortened by UMI.)
Goal-directed e-unification: completeness, decidability and complexity
Authors: Christopher Lynch
Venue:  (2003)

In this thesis a new approach to solving the E-unification problem is laid out and explored. This approach is goal-directed, because it searches for a solution for an equation by analyzing the structure of this equation, as opposed to procedures based on a completion of an equational theory. It is top-down, since it analyzes the goal and applies inference rules to the goal only with respect to the top symbols in the terms in the goal equation. Such a goal-directed, top-down procedure is presented and proved to be complete for a general E-unification problem for any equational theory. This is a semi-decision procedure. Next we examine different ways to put syntactic restrictions on an equational theory for which we want to solve an E-unification problem, so that this semi-decision procedure becomes a decision procedure (it always terminates). Hence we are able to prove complexity results for E-unification in classes of equational theories. Finally we prove completeness of the goal-directed, top-down procedure with Variable Elimination eagerly applied. Solving this problem opens new ways to find still more classes of equational theories for which some form of E-unification is decidable and the complexity may be found.
Systems of Strings with High Mutual Complexity
Authors: M. V. Vyugin
Venue: Problems of Information Transmission (2003)

Consider a binary string x0 of Kolmogorov complexity K(x0) &ge; n. The question is whether there exist two strings x1 and x2 such that the approximate equalities K(xi &mid; xj) &ap; n and K(xi &mid; xj, xk) &ap; n hold for all 0 &le; i, j, k &le; 2, i &ne; j &ne; k, i &ne; k. We prove that the answer is positive if we require the equalities to hold up to an additive term O(log K(x0)). It becomes negative in the case of better accuracy, namely, O(log n).
The Architecture of the Earth System Modeling Framework
Authors: Chris Hill, Cecelia DeLuca, V. Balaji, Max Suarez, Arlindo da Silva
Venue: Computing in Science and Engineering (2004)

The Earth System Modeling Framework (ESMF) project aims to develop a standard software platform for Earth system models based on open-software practices. Target applications range from operational numerical weather prediction to climate system change and predictability studies.
Composition Analysis of QoS Properties for Adaptive Integration of Embedded Software Components
Authors: Hui Ma, I-Ling Yen, Farokh Bastani, Kendra Cooper
Venue: Proceedings of the 14th International Symposium on Software Reliability Engineering (2003)

Component-based development (CBD) techniques havebeen widely used to enhance the productivity and reducethe cost for software systems development. However,applying CBD techniques to embedded softwaredevelopment faces additional challenges. For embeddedsystems, it is crucial to consider the QoS attributes, suchas timeliness, memory requirement, output precision,power consumption, etc. When a system is composed ofcomponents, the appropriate components have to beselected such that the composed system is guaranteed tosatisfy its QoS requirements.In this paper, we investigate the model for compositionanalysis. Based on the analysis model, we developalgorithms for selecting components to compose thedesignated system such that the overall system QoSproperties can be Pareto optimal. An overview of arepository-based embedded software developmentmethodology was first presented. Then we discuss thecomposition analysis techniques. A case study ispresented to illustrate our approach finally.