ppxscal/embedding_network huggingface dataset:
The InfoSky visual explorer: exploiting hierarchical structure and document similarities
Authors: Keith Andrews, Wolfgang Kienreich, Vedran Sabol, Jutta Becker, Georg Droschl, Frank Kappe, Michael Granitzer, Peter Auer, Klaus Tochtermann
Venue: Information Visualization (2002)

InfoSky is a system enabling users to explore large, hierarchically structured document collections. Similar to a real-world telescope, InfoSky employs a planar graphical representation with variable magnification. Documents of similar content are placed close to each other and are visualised as stars, forming clusters with distinct shapes. For greater performance, the hierarchical structure is exploited and force-directed placement is applied recursively at each level on much fewer objects, rather than on the whole corpus. Collections of documents at a particular level in the hierarchy are visualised with bounding polygons using a modified weighted Voronoi diagram. Their area is related to the number of documents contained. Textual labels are displayed dynamically during navigation, adjusting to the visualisation content. Navigation is animated and provides a seamless zooming transition between summary and detail view. Users can map metadata such as document size or age to attributes of the visualisation such as colour and luminance. Queries can be made and matching documents or collections are highlighted. Formative usability testing is ongoing; a small baseline experiment comparing the telescope browser to a tree browser is discussed.
Common Concept Apparatus within Corrective Software Maintenance
Authors: Mira Kajko-Mattsson
Venue: Proceedings of the IEEE International Conference on Software Maintenance (1999)

Software engineering is the fastest growing field of engineering today. Due to this revolutionary development, many conflicts have arisen when defining and using new concepts. This has involved the need for standards, such as the IEEE standard. Despite this, there is still non-uniformity in the use of standard definitions. This could be due to the fact that most of the standard definitions are expressed in natural language. Furthermore, ambiguity may arise when relating some of these concepts to other concepts.In this paper, we propose a conceptual model of the basic concepts utilised within corrective software maintenance. The goal is to clarify the fundamental concept apparatus. This model should constitute a common forum for communication when conceptualising software problems and defects, and for suggesting maintenance frameworks, models and/or measures.
MPC: A New Message Passing Library in Corba
Authors: T. Es-sqalli, J. Guyard, E. Fleury
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

The need for interoperability among the rapidly proliferating number of hardware and software led to the definition of CORBA (Common Object Request Broker Architecture), which standardizes the execution support of distributed object applications. This architecture offers a good interoperability and encapsulation support. In addition, the method invocation mechanism offers several features and can be used as a good communication model. Consequently, the use of such architecture for distributed meta-computing applications seems interesting and promising. However, its implementation is difficult because of protocol diversity and communication modes used by parallel applications. Moreover, this diversity of protocols is added to the intrinsic difficulty of the use of object design approach and basic mechanisms of CORBA components. To cure this problem, we develop a message-passing library in CORBA environment called MPC (Message Passing in CORBA). In this paper, we quickly present the basic concepts of this library and the point-to-point communication protocol used.
Microflow: A Fine-Grain Parallel Processing Approach
Authors: Jon A. Solworth, Alexandru Nicolau
Venue:  (1985)

NOT SUPPLIED
Modeling Decisions for Digital Content
Authors: Naomi Dushay, Carl Lagoze
Venue:  (2000)

The organization of digital information poses unique challenges not only due to rapidly evolving data formats and software, but also because digital content may be dynamic, distributed, or executable. Managers of digital information need flexible, extensible architectures that facilitate maintainability as well as accessibility and long-term utility of content. However, the flexibility of these architectures presents difficult organizational, or modeling, decisions. To explore these modeling decisions and their consequences, we introduce four dimensions of digital content modeling: aggregation, interfaces, transformations and indirection. We discuss these dimensions individually and also examine their interaction; in essence, this paper examines general design patterns for digital content modeling. As new and powerful architecture evolve, it is vital that information mangers understand and consider these design decisions.
A Bidirectional Matching Algorithm for Deformable Pattern Detection with Application to Handwritten Word Retrieval
Authors: Kwok-Wai Cheung, Dit-Yan Yeung, Roland T. Chin
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

A Bayesian framework for deformable pattern classification has been proposed in [1] with promising results for isolated handwritten character recognition. Its performance, however, degrades significantly when it is applied to detect deformable patterns in complex scenes, where the amount of outliers due to other neighboring objects or the background is usually large. Also, the fact that the associated evidence measure does not penalize models resting on white space results in a high false alarm rate.In this paper, another Bayesian framework for deformable pattern detection is proposed. The framework possesses the intrinsic property of matching with only part of an image (segmentation) and its associated evidence measure can penalize white space implicitly. However, limited data exploration capability is the major trade-off. By properly combining the two frameworks, a new matching algorithm called bi-directional matching is proposed.This combined approach possesses the advantages of the two frameworks and gives robust results for non-rigid shape extraction. To evaluate the performance of the proposed approach, we have applied it to shape-based handwritten word retrieval. Using a subset of the bb data-set in the CEDAR database, we can achieve a recall rate of 59% and a precision rate of 43%.
Enhancement of Environments for Analysis of Trace Files of Parallel Programs
Authors: Veena Avula
Venue:  (1994)

One of the important phases of parallel programming is performance analysis. Trace data provides information about where time is spent in programs. Since this data is huge, a tool for analyzing and visualizing the trace data is convenient and necessary for performance analysis of parallel programs. Environments which provide such a faclility are many and varied. In this report, we discuss our work on the enhancement of one such environment for accessibility over more platforms and better visualization capabilities. The environment is Pablo.
Multiple-Valued Content-Addressable Memory Using Metal-Ferroelectric-Semiconductor FETs
Authors: Takahiro Hanyu, Hiromitsu Kimura, Michitaka Kameyama
Venue: Proceedings of the Twenty Ninth IEEE International Symposium on Multiple-Valued Logic (1999)

This paper presents a design of a non-volatile multiple-valued content-addressable memory (MVCAM) using metal-ferroelectric-semiconductor (MFS) FETs. An MFSFET is an important device with, a non-destructive read scheme. Multiple-valued stored data are directly represented by remnant polarization states that correspond to threshold voltages of an MFSFET. Since one-digit comparison between, multiple-valued input and stored data is performed by the combination of two different threshold operations, a one-digit comparator can be designed by two MFSFETs. The use of the one-digit comparator makes it possible to design a compactMVCAM cell. It is evaluated that the performance of the proposed MVCAM is superior to that of some binary and multiple-valued CAMs in terms of bit density, peripheral-circuit complexity, access speed and functionality.
Design and Performance of Active Messages on the IBM SP-2
Authors: Chi Chang, Grzegorz Czajkowski, Thorsten von Eicken
Venue:  (1996)

This technical report describes the design, implementation, and evaluation of Active Messages on the IBM SP-2. The implementation benchmarked here uses the standard TB2 network adapter firmware but does not use any IBM software on the Power2 processor. We assume familiarity with the concepts underlying Active Messages. The main performance characteristics are a one-word message round-trip time of 51.0 $\mu$s and an asymptotic network bandwidth of 34.3 MB/s. After presenting selected implementation details, the paper focuses on detailed performance analysis, including a comparison with IBM''s Message Passing Layer (MPL) and Split-C benchmarks.
Australian Approaches to Regulation of On-Line Content
Authors: James M. Hogan, Peter C.J. James
Venue:  (1996)

The goal of the Computer Architecture for Secure Systems (CASS) project (Mohay et al., 1993) is to develop an architecture and tools to ensure the security and integrity of software in distributed systems. As part of that work -we have been investigating the use of the Intel 80286'' segmentation hardware to enhance the security and integrity of small objects. Object oriented design and programming are considered by their proponents to facilitate the development of quality software. None the less the static semantics of an OOP language cannot, of its own nor even when combined with systematic and comprehensive testing, guarantee the correctness of a program. In this paper, we outline a novel way of combining object oriented programming with the under-exploited hardware level security mechanisms provided by the Intel 80286@'' processor family to provide additional integrity for such programs and to assist with program debugging. The hardware protection mechanisms which are intended to provide process isolation are used at a lower level of granularity to isolate the objects that exist within a process.
From the Ground Up: The DIMACS Software Security Workshop
Authors: Gary McGraw
Venue: IEEE Security and Privacy (2003)

The recent DIMACS Software Security Workshop explored issues such as security engineering, architecture and implementation risks, security analysis, mobile and malicious code, education and training, and open research issues. Many promising techniques have grown from connections between computer security, programming languages, and software engineering, and one workshop goal was to bring these communities closer together to crystallize the software security subfield. The author reports the workshop's results in this article.
Design and simulation of a reliable token-ring protocol for realtime communications
Authors: J. Cao, R. Steele, L. J. Yao, W. Jia
Venue: Proceedings of the 2nd International Computer Performance and Dependability Symposium (IPDS '96) (1996)

The key to the successful use of computer networks to support realtime communications is an adequate set of network communication protocols that ensure not only timely but also reliable message transmission. Traditional fault tolerance techniques may become invalid in a realtime environment as the latency introduced by those error recovery mechanisms may become unacceptably high. This paper presents the design and simulation of a reliable, realtime token ring protocol. The data link layer design of the protocol provides efficient error detection and recovery, reducing the total message loss rate. The performance of the protocol is evaluated through analysis and simulation.
A non-stationary approximation scheme on scattered centers in Rd by radial basis functions
Authors: Jungho Yoon
Venue: Journal of Computational and Applied Mathematics (2003)

A nonstationary approximation scheme on Rd using scattered translates of a smooth radial basis function (e.g., Gaussian) is developed. The scheme is nonstationary and shown to provide spectral approximation orders, i.e., approximation orders that depend only on the smoothness of the approximands.
StartleCam: A Cybernetic Wearable Camera
Authors: Jennifer Healey, Rosalind W. Picard
Venue: Proceedings of the 2nd IEEE International Symposium on Wearable Computers (1998)

StartleCam is a wearable video camera, computer, and sensing system, which enables the camera to be controlled via both conscious and preconscious events involving the wearer. Traditionally, a wearer consciously hits record on the video camera, or runs a computer script to trigger the camera according to some pre-specified frequency. The system described here offers an additional option: images are saved by the system when it detects certain events of supposed interest to the wearer. The implementation described here aims to capture events that are likely to get the user's attention and to be remembered. Attention and memory are highly correlated with what psychologists call arousal level, and the latter is often signaled by skin conductivity changes; consequently, StartleCam monitors the wearer's skin conductivity. StartleCam looks for patterns indicative of a ''startle response'' in the skin conductivity signal. When this response is detected, a buffer of digital images, recently captured by the wearer's digital camera, is downloaded and optionally transmitted wirelessly to a webserver. This selective storage of digital images creates a ``flashbulb'' memory archive for the wearable which aims to mimic the wearer' Using a startle detection filter, the StartleCam system has been demonstrated to work on several wearers in both indoor and outdoor ambulatory environments.
Generating Test Cases for XML-Based Web Component Interactions Using Mutation Analysis
Authors: Suet Chun Lee Lee, Jeff Offutt
Venue: Proceedings of the 12th International Symposium on Software Reliability Engineering (2001)

Web software systems are built using heterogeneous software components.They interact by passing messages that exchange data and activity state information.Such heterogeneous message transfers can be struct red sing the eXtensible Markup Language (XML), which allows a flexible common data exchange.Parsers have been developed to check syntax of component interactions, but there are as yet no techniques for checking the semantic correctness of the interactions.This paper presents a technique for sing mutation analysis to test the semantic correctness of XML-based component interactions.In this paper, the web software interactions are specified using an Interaction Specification Model (ISM) that consists of document type definitions, messaging specifications, and a set of constraints.Test cases are XML messages that are passed between the web software components.Classes of interaction-specific mutation operators are introduced and applied to the ISMto generate mutant interactions and test cases.
Abstractions and Implementations forArchitectural Connections
Authors: Mary Shaw, Robert DeLine, Gregory Zelesnik
Venue: Proceedings of the 3rd International Conference on Configurable Distributed Systems (1996)

The architecture of a software system shows how the system is realized by a collection of components together with the interactions among these components. Conventional design focuses on the components, but the properties of the system depend critically on the character of the interactions. Although software designers have good informal abstractions for these interactions, these abstractions are poorly supported by the available languages and tools. As a result, the choice of interaction is often defaulted or made implicitly rather than deliberately chosen. Further, interactions are usually programmed in terms of underlying mechanisms rather than the designers' natural abstractions. UniCon supports a rich selection of abstractions for the connectors that mediate interactions among components. Connector implementation presents special challenges. The "compiler" must produce and integrate not only the object code for components, but also a variety of other run-time products. The definition of a connector requires many connector-specific kinds of information in the compiler, graphical editor, and associated tools. Extending the set of connectors supported by Unicon requires this information to be provided by the connector designer and automatically integrated in the compiler. This paper describes the role of connector abstractions in software design, the connector abstractions currently supported by UniCon, and implementation issues associated with supporting an open-ended collection of connectors.
Agent programming in dribble: from beliefs to goals using plans
Authors: Birna van Riemsdijk, Wiebe van der Hoek, John-Jules Ch. Meyer
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

To support the practical development of intelligent agents, several programming languages have been introduced that incorporate concepts from agent logics: on the one hand, we have languages that incorporate beliefs and plans (i.e., procedural goals), and on the other hand, languages that implement the concepts of beliefs and (declarative) goals. We propose the agent programming language Dribble, in which these features of procedural and declarative goals are combined. The language Dribble thus incorporates beliefs and goals as well as planning features. The idea is, that a Dribble agent should be able to select a plan to reach a goal from where it is at a certain point in time. In order to do that, the agent has beliefs, goals and rules to select plans and to create and modify plans. Dribble comes with a formally defined operational semantics and, on top of this semantics, a dynamic logic is constructed that can be used to specify and verify properties of Dribble agents. The correspondence between the logic and the operational semantics is established.
Approximation by neural networks with a bounded number of nodes at each level
Authors: G. Gripenberg
Venue: Journal of Approximation Theory (2003)

It is shown that the general approximation property of feed-forward multilayer perceptron networks can be achieved in networks where the number of nodes in each layer is bounded, but the number of layers grows to infinity. This is the case provided the node function is twice continuously differentiable and not linear.
Load Distribution via Static Scheduling and Client Redirection for Replicated Web Servers
Authors: Wenting Tang, Matt W. Mutka
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

Significant increases in WWW traffic motivates the need for high performance web servers constructed from networked low cost computers. Load distribution within a distributed web server is required to sustain high web traffic demands. We propose an approach based on the web servers themselves for web server load distribution. Although it might seem counter-intuitive, w e introduce an effective form of ¿static scheduling,¿ which we call SSCR, in which each network has an associated preferable server predetermined by a static scheduler at the server site using access history. When the associated server is overloaded, the server redirects accesses to other servers temporarily. Our approach exploits temporal, spatial and geographical localities associated with web accesses. Results from trace file simulations show improvements in load distribution and low overhead in comparison to some recently proposed approaches that use aggressive DNS TTL-based schemes. Since SSCR exploits standard features of the DNS and web, servers and browsers have supported redirection already, SSCR has potential to be quickly implemented and deployed.
Empirical Validation of Class Diagram Metrics
Authors: Marcela Genero, Mario Piattini, Coral Calero
Venue: Proceedings of the 2002 International Symposium on Empirical Software Engineering (2002)

As a key early artefact in the development of OO software, the quality of class diagrams is crucial for all later design work and could be a major determinant for the quality of the software product that is finally delivered. Quantitative measurement instruments are useful to assess class diagram quality in an objective way, thus avoiding bias in the quality evaluation process. This paper presents a set of metrics -based on UML relationships- which measure UML class diagram structural complexity following the idea that it is related to the maintainability of such diagrams. Also summarized are two controlled experiments carried out in order to gather empirical evidence in this sense. As a result of all the experimental work, we can conclude that most of the metrics we proposed (NAssoc, NAgg, NaggH, MaxHAgg, NGen, NgenH and MaxDIT) are good indicators of class diagram maintainability. We cannot, however, draw such firm conclusions regarding the NDep metric.
Timed Dependence Flow Graphs, an Intermediate Form for Verified High-Level Synthesis
Authors: Richard Chapman
Venue:  (1994)

We present timed dependence flow graphs, an intermediate form for high-level synthesis from specifications written in behavioral hardware description languages. Timed dependence flow graphs express data, control, resource access, and timing dependencies, and can be constructed in linear time from behavioral VHDL descriptions. We also present a formal execution semantics for timed dependence flow graphs, which we are using in verification of our high-level synthesis tools.
Enabling technology for migrating legacy systems to client-server systems
Authors: M. R. Olsem
Venue: Proceedings of the International Conference on Software Maintenance (1997)

Increasingly, the goal of software reengineering projects is the migration of legacy systems to client server systems based around discrete objects. Although we are far from being able to fully automate this migration, tools and technology can assist an organization with the process. The author discusses two major strategies for the reallocation and redistribution of data and functionality to a client server environment. The first involves the identification of functionality with its associated sub-subsystems. The second is the identification of business rules and the redevelopment of supporting source code.
A formal approach to requirements based testing in open systems standards
Authors: J. F. Leathrum, K. A. Liburdy
Venue: Proceedings of the 2nd International Conference on Requirements Engineering (ICRE '96) (1996)

Experience with an innovative approach to requirements based testing in the IEEE POSIX arena is presented. The work described in this paper is based on a full scale conformance test suite development for the standard IEEE Std 10035-The Ada Language Binding to POSIX. The approach taken in this work is based on a formal description of test requirements which can be automatically translated into executable tests by the Clemson Automated Testing System (CATS). A brief design overview of CATS, as well as a design taxonomy for the testing requirements is presented. Lessons learned from this experienced recommendations for future work conclude the paper.