ppxscal/embedding_network huggingface dataset:
Owl: next generation system monitoring
Authors: Martin Schulz, Brian S. White, Sally A. McKee, Hsien-Hsin S. Lee, Jürgen Jeitner
Venue: Proceedings of the 2nd conference on Computing frontiers (2005)

As microarchitectural and system complexity grows, comprehending system behavior becomes increasingly difficult, and often requires obtaining and sifting through voluminous event traces or coordinating results from multiple, non-localized sources. Owl is a proposed framework that overcomes limitations faced by traditional performance counters and monitoring facilities in dealing with such complexity by pervasively deploying programmable monitoring elements throughout a system. The design exploits reconfigurable or programmable logic to realize hardware monitors located at event sources, such as memory buses. These monitors run and writeback results autonomously with respect to the CPU, mitigating the system impact of interrupt-driven monitoring or the need to communicate irrelevant events to higher levels of the system. The monitors are designed to snoop any kind of system transaction, e.g., within the core, on a bus, across the wire, or within I/O devices
On equivalence checking and logic synthesis of circuits with a common specification
Authors: Eugene Goldberg
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

In this paper we develop a theory of equivalence checking (EC) and logic synthesis of circuits with a common specification (CS). We show that two combinational circuits N1 N2 have a CS iff they can be partitioned into subcircuits that are connected "in the same way" and are toggle equivalent. This fact allows one to represent a specification of a circuit implicitly as a partitioning into subcircuits. We give an efficient procedure for checking if circuits N1, N2 have the same predefined specification. As a "by-product", this procedure performs EC of N1 and N2. We show how, given a circuit N1 with a predefined specification, one can efficiently build a circuit N2 satisfying the same specification. We give experimental evidence that EC of N1 N2 is hard if their CS is unknown.
A data structure for non-manifold simplicial d-complexes
Authors: Leila De Floriani, David Greenfieldboyce, Annie Hui
Venue: Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing (2004)

We propose a data structure for d-dimensional simplicial complexes, that we call the Simplified Incidence Graph (SIG). The simplified incidence graph encodes all simplices of a simplicial complex together with a set of boundary and partial co-boundary topological relations. It is a dimension-independent data structure in the sense that it can represent objects of arbitrary dimensions. It scales well to the manifold case, i.e. it exhibits a small overhead when applied to simplicial complexes with a manifold domain, Here, we present efficient navigation algorithms for retrieving all topological relations from a SIG, and an algorithm for generating a SIG from a representation of the complex as an incidence graph. Finally, we compare the simplified incidence graph with the incidence graph, with a widely-used data structure for d-dimensional pseudo-manifold simplicial complexes, and with two data structures specific for two-and three-dimensional simplicial complexes.
Statistics on the use of mathematical subroutines from a computer center library
Authors: T. Aird, D. Dodson, E. Houstis, J. Rice
Venue: ACM SIGNUM Newsletter (1973)

The Purdue University Computing Center has introduced a monitor into its operating system to gather statistics on the use of various system elements. A summary of these statistics for mathematical subroutines is presented here for a 3 month period (January 24, 1973, to April 20, 1973). Two tables are presented; Table 1 covers the use of the standard or built-in functions of high level languages (primarily Fortran). These functions have been grouped somewhat including putting complex and double-precision together with the ordinary versions of the functions. The maximum use of a complex and double-precision function occurs for ABS (2.2%) and EXPONENTIATION (1.5%), respectively. The total percentage of the use of complex and double-precision functions is 4.4% and 7.5% respectively. These values give estimates of the use of complex and double-precision arithmetic as follows:
Maintaining Longest Paths Incrementally
Authors: Irit Katriel, Laurent Michel, Pascal Hentenryck
Venue: Constraints (2005)

Modeling and programming tools for neighborhood search often support invariants, i.e., data structures specified declaratively and automatically maintained incrementally under changes. This paper considers invariants for longest paths in directed acyclic graphs, a fundamental abstraction for many applications. It presents bounded incremental algorithms for arc insertion and deletion which run in O(¿¿¿ + |¿| log|¿|) time and O(¿¿¿) time respectively, where |¿| and ¿¿¿ are measures of the change in the input and output. The paper also shows how to generalize the algorithm to various classes of multiple insertions/deletions encountered in scheduling applications. Preliminary experimental results show that the algorithms behave well in practice.
Orthogonal Hessenberg Reduction and Orthogonal Krylov Subspace Bases
Authors: Jörg Liesen, Paul E. Saylor
Venue: SIAM Journal on Numerical Analysis (2004)

We study necessary and sufficient conditions that a nonsingular matrix A can be B-orthogonally reduced to upper Hessenberg form with small bandwidth. By this we mean the existence of a decomposition AV=VH, where H is upper Hessenberg with few nonzero bands, and the columns of V are orthogonal in an inner product generated by a hermitian positive definite matrix B. The classical example for such a decomposition is the matrix tridiagonalization performed by the hermitian Lanczos algorithm, also called the orthogonal reduction to tridiagonal form. Does there exist such a decomposition when A is nonhermitian? In this paper we completely answer this question. The related (but not equivalent) question of necessary and sufficient conditions on A for the existence of short-term recurrences for computing B-orthogonal Krylov subspace bases was completely answered by the fundamental theorem of Faber and Manteuffel [SIAM J. Numer. Anal.}, 21 (1984), pp. 352--362]. We give a detailed analysis of B-normality, the central condition in both the Faber--Manteuffel theorem and our main theorem, and show how the two theorems are related. Our approach uses only elementary linear algebra tools. We thereby provide new insights into the principles behind Krylov subspace methods, that are not provided when more sophisticated tools are employed.
PORT: a portable subroutine library
Authors: Phyllis A. Fox
Venue: ACM SIGNUM Newsletter (1978)

PORT is a structured library of Fortran subprograms for numerical computation. The library has been under development at Bell Laboratories for three years and is now in its second edition. One of the most important aspects of the project has been the emphasis on the portability of the library. This note outlines the techniques used to make the library portable, and also discusses the error handling and scratch storage allocation in the library. The report concludes with an overview of the structure and contents of the library.
The Erlangen speech understanding project: U. of Erlangen-Nuernberg, FRG
Authors: Heinrich Niemann, Astrid Brietzmann, Hans-Werner Hein, Peter Regel
Venue: Issue 79 (January 1982) (1982)

Since 1979 a project about the automatic understanding of normally spoken German sentences has been running at Erlangen /1-4/. The evolved speech understanding system should be able to speaker-independently process signals of telephone bandwidth quality. It should not be a one-purpose solution but an experimental tool to aid the development of optimized and specialized future speech understanders for many applications. This requires the ability of modular and easy exchange of its vocabulary, grammar and task specific knowledge. The vocabulary should at least include 1000 wordforms and the language accepted be as natural as possible.
The unification of language understanding and problem solving: Brown University
Authors: Eugene Charniak, Graeme Hirst, Matthew Kaplan, Douglas Wong
Venue: Issue 79 (January 1982) (1982)

We are interested in the role that "common-sense knowledge" plays in our ability to understand natural language. Because problemsolving systems have similar knowledge requirements, we are studying the relation between language comprehension on one hand, and problem-solving systems, including much of what goes under the heading of "knowledge engineering", on the other. The current focus of our research therefore is a system that can function in several areas. Some of these will be typical of the language comprehension literature ("stories" about stereotypic situations) while others will involve problem-solving (the blocks world, geometry, and inventory control). This system is based upon a unified set of programs for deductive information retrieval, syntactic parsing, and "low-level" problem solving, as well as a single "frame" representation[1].
A Formal Description of Design Patterns Using OWL
Authors: Jens Dietrich, Chris Elgar
Venue: Proceedings of the 2005 Australian conference on Software Engineering (2005)

Design patterns have been used successfully in the last decade to re-use and communicate object-oriented design. However, the documentation of pattern usage is often very poor. This motivates the use of tools which can detect and document design patterns found in software. A couple of approaches have been proposed in recent years. The approach introduced here is based on a formal description of design patterns using the web ontology language OWL. Software artefacts used to define design patterns in a formal and machine processable fashion are represented by uniform resource identifiers (URIs). This yields a description that is open and extensible, and facilitates the sharing of design among software engineers. We discuss the developed software design ontology, and how this approach relates to themeta-modelling architecture of the OMG. In the second part, an effective pattern scanner for the java language is presented. This scanner is based on the ontology developed in part one and uses reflection and AST analysis to verify constraints. Various applications of this scanner are discussed.
Factorization method for second order functional equations
Authors: Tomasz Goliński, Anatol Odzijewicz
Venue: Journal of Computational and Applied Mathematics (2005)

We apply general difference calculus in order to obtain solutions to the functional equations of the second order. We show that factorization method can be successfully applied to the functional case. This method is equivariant under the change of variables. Some examples of applications are presented.
A Simple Way to Estimate the Cost of Downtime
Venue: Proceedings of the 16th USENIX conference on System administration (2002)

Systems that are more dependable and less expensive to maintain may be more expensive to purchase. If ordinary customers cannot calculate the costs of downtime, such systems may not succeed because it will be difficult to justify a higher price. Hence, we propose an easy-to-calculate estimate of downtime.As one reviewer commented, the cost estimate we propose "is simply a symbolic translation of the most obvious, common sense approach to the problem." We take this remark as a complement, noting that prior work has ignored pieces of this obvious formula.We introduce this formula, argue why it will be important to have a formula that can easily be calculated, suggest why it will be hard to get a more accurate estimate, and give some examples.Widespread use of this obvious formula can lay a foundation for systems that reduce downtime.
Reconfigurable Amplifier Circuits for Adaptive Sensor Systems Employing Bio - Inspiration
Authors: Senthil Kumar Lakshmanan, Andreas Konig
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

In particular primary electronics of sensor systems is strongly subject to deviations and degradations caused by environmental and manufacturing conditions. Current approaches cope with these challenges by calibration or trimming techniques. More recent approaches from the field of evolutionary electronics offer considerable extensions, incorporating also issues of fault-tolerance and self-repair. State-of-the-art evolvable analog hardware bases on field-programmable-transistor-arrays (FPTA) and start from primal soup for each new problem. Our work deals with the crucial issue to efficiently include the wealth of existing engineering design knowledge into the otherwise attractive concept. For the practically relevant task of sensor amplifiers, a particular flexible FPTA architecture is developed, verified and physically implemented in a 0.35 µm CMOS technology.
The ASpect project case: a model for SME adoption of ICT innovation
Authors: Piet Boekhoudt, Petra van der Stappen
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

The process of adoption of technological innovations in Small and Medium sized Enterprises (SMEs) is highly complex. Whereas SMEs are particularly important to the Dutch economy, the innovation potential of SMEs is still highly unused. Information and Communication Technology (ICT) is seen as a modern catalyst for innovation. In this paper we propose the use of a network of SMEs, industry organizations, intermediary parties and knowledge institutes, to achieve adoption of new information and communication technologies. This proposed network is motivated by our experiences in the ASPect project, which intends to enable the adoption and diffusion of Application Service Providing within SMEs. We discuss the project's organization, the results and effects and the lessons learned. The ASPect project thus serves as a case of how a knowledge network can foster ICT innovation. Finally, we argue that this knowledge network may serve as a model for an R&D network of SME companies.
International workshop on realising evidence-based software engineering
Authors: David Budgen, Pearl Brereton, Barbara Kitchenham, Stephen Linkman
Venue: Proceedings of the 27th international conference on Software engineering (2005)

This workshop is concerned with defining the procedures that are needed to establish a sound empirical foundation for the practices of Software Engineering. Our goal is to begin building a community that will review, analyse, codify and promulgate software engineering experiences as well as to identify the processes and infrastructure that are needed to support these activities.
Efficient Data Management on Lightweight Computing Devices
Authors: Rajkumar Sen, Krithi Ramamritham
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

Lightweight computing devices are becoming ubiquitous and an increasing number of applications are being developed for these devices. Many of these applications deal with significant amounts of data and involve complex joins and aggregate operations which necessitate a local database management system on the device. This is a challenge as these devices are constrained by limited stable storage and main memory. Hence new storage models that reduce storage costs are needed and a storage scheme should be selected based on data characteristics, nature of queries, and updates. Also, query execution plan should be chosen depending on the amount of available memory and the underlying storage scheme; memory should be optimally allocated among the database operators involved in the query. To achieve these goals, we utilize a novel storage model, ID based Storage, which reduces storage costs considerably. We present an exact algorithm for allocating memory among the database operators. Because of its high complexity, we also propose a heuristic solution based on the benefit of an operator per unit memory allocation.
On algorithms for discrete and approximate brouwer fixed points
Authors: Xi Chen, Xiaotie Deng
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

We study the algorithmic complexity of the discrete fixed point problem and develop an asymptotic matching bound for a cube in any constantly bounded finite dimension. To obtain our upper bound, we derive a new fixed point theorem, based on a novel characterization of boundary conditions for the existence of fixed points.In addition, exploring a linkage with the approximation problem of the continuous fixed point problem, we obtain asymptotic matching bounds for complexity of the approximate Brouwer fixed point problem in the continuous case for Lipschitz functions that close a previous exponential gap. It settles a fifteen years old open problem of Hirsch, Papadimitriou and Vavasis by improving both the upper and lower bounds.Our new characterization for existence of a fixed point is also applicable to functions defined on non-convex domain and makes it a potentially useful tool for design and analysis of algorithms for fixed points in general domain.
From UML models to software performance results: an SPE process based on XML interchange formats
Authors: Connie U. Smith, Catalina M. Lladó, Vittorio Cortellessa, Antinisca Di Marco, Lloyd G. Williams
Venue: Proceedings of the 5th international workshop on Software and performance (2005)

The SPE process uses multiple performance assessment tools depending on the state of the software and the amount of performance data available. This paper describes two XML based interchange formats that facilitate using a variety of performance tools in a plug-and-play manner thus enabling the use of the tool best suited to the analysis. The Software Performance Model Interchange Format (S-PMIF) is a common representation that is used to exchange information between (UML-based) software design tools and software performance engineering tools. On the other hand, the performance model interchange format (PMIF 2.0) is a common representation for system performance model data that can be used to move models among system performance modeling tools that use a queueing network model paradigm. This paper first defines an XML based S-PMIF based on an updated SPE meta-model Then it demonstrates the feasibility of using both the S-PMIF and the PMIF 2.0 to automatically translate an architecture description in UML into both a software performance model and a system performance model to study the performance characteristics of the architecture. This required the implementation of some extensions to the XPRIT software in order to export UML models into the S-PMIF and a new function in the SPEED software to import S-PMIF models, which are also described. The SPE process and an experimental proof of concept are presented.
Opportunities for women in IT security
Authors: Martha Myers, Amy Woszczynski, Sherri Shade
Venue: Proceedings of the 2005 ACM SIGMIS CPR conference on Computer personnel research (2005)

Much prior research has examined the dearth of women in the IT industry. The purpose of this study is to examine the questions surrounding women in IT within the context of Information Security and Assurance. This research-in-progress report describes results from one phase in a study of a relatively new career path to see if there are female-friendly opportunities that have not existed in previous IT career paths. Research methodology focuses on a qualitative analysis of in-depth interviews with women who are self-described IT security professionals. The next phase will focus on interviews with men in the IT security field as a basis for comparison. A primary goal of the study is to determine whether or not women in security face the same challenges and opportunities as they do in other IT fields. Further, does the security area offer equivalent opportunities for women and men? Finally, implications are explored, including those for IT educators in terms of recruiting and retaining diverse groups of students to pursue security related careers.
Leather features selection for defects' recognition using fuzzy logic
Authors: Kaloyan Krastev, Lidia Georgieva, Nikola Angelov
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

In the present work are investigated 12 histogram and statistical features for analysis of leather surface images. A research of the features suitability for surface defects detection is done. For the image analysis was used the quadtree decomposition method - a technique that partitions an image into homogeneous blocks. This method gave the possibility of investigation the changes of the features values depending on the area size. It is proposed a scheme for defective regions identification using fuzzy set theory.
Study of the TCP upstream&#x002F;downstream unfairness issue with per-flow queuing over infrastructure-mode WLANs: Research Articles
Authors: Yi Wu, Zhisheng Niu, Junli Zheng
Venue: Wireless Communications Mobile Computing (2005)

Fairness is an important issue in WLANs due to their shared media nature. Essentially, IEEE 802.11 MAC protocols have been designed to provide fair access for all the competing mobile hosts. However, the fairness at MAC layer cannot be maintained at TCP layer in the presence of both mobile senders and receivers accessing to wired networks. In this paper, we investigate the TCP upstream&#x002F;downstream unfairness issue over WLANs with per-flow queuing employed at the access point (AP). The interactions between the IEEE 802.11 MAC protocol and TCP are evaluated through analysis and simulation. Based on the derived analytical model, an efficient solution is proposed to be implemented at the AP for fairness achievement. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Segmentation and Feature Extraction to Evaluate the Stomach Dynamic
Authors: Mohammed Benjelloun
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

Our work is motivated by a practical application of motion study induced by breathing in the abdomen under the influence of diaphragm pressure. In this article, we present an image processing method to analyze the motion of the stomach between expiration and inspiration. Our approach is based on a preliminary edge detection. To extract useful information, we propose two techniques lying respectively on filling and active contour algorithms. The results of both methods are analysed and compared to those obtained manually. In order to improve the results and to overcome the limitations of the proposed edge detector, an edge closing method based on a polynomial contour fitting is applied.