ppxscal/embedding_network huggingface dataset:
Real-Time Application Domain Visionaries
Authors: E. Douglas Jensen, Jay Bayne, Kirk Rheinholtz, Michael Masters, Thomas Saunders
Venue: Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2000)

The gulf separating the real-time research, product development, and application development communities appears to be the largest in the entire computing field. This gulf has an unfortunate tendency to obscure the research opportunities of most value to the real-time application domains. It is an unsurprising consequence of factors historically intrinsic to each of those communities.Almost all academic, and much industrial, research in the area of real-time computing - and especially distributed real-time computing - suffers from two handicaps. First is the necessity for unusually extensive application domain-specific knowledge and understanding compared with what is required in most other computer science and engineering research. Second is the directly contrary reality that few real-time researchers have the option of obtaining such knowledge and understanding, because they lack access to non-trivial, deployed, real-time application environments - particularly to distributed ones (e.g., in process control or discrete manufacturing plants, defense systems, telecommunication intelligent network architectures) - and to the developers and users of those environments.The real-time application domain practitioners (real-time computer product and application developers and users) contribute to this gulf as well. First, the historical focus on traditional small, static, centralized, sampled-data subsystems has often subjected real-time computers to severe constraints on hardware cost, size, weight, and power. And although software development and maintenance costs per line of source code are generally one or two orders of magnitude greater for real-time software than for non-real-time software, the smallest scale instances of these subsystems actually have negligible costs for software compared with hardware. These two factors tend to discourage many of the application developers and users from believing that they need or can afford technology advances from the software and real-time research communities. Second, hardware parsimony makes it necessary, and application simplicity makes it possible, for the application programmers to do the majority of the system's resource management - most of it a' priori, and as little as possible at run time.The increasing importance and deployment of larger scale, more complex, more distributed real-time computer systems makes this gulf an increasingly greater obstacle to their cost-effectiveness and even viability. The purpose of this session is to assist in reducing this gulf by bringing to ISORC2K's researcher audience some of the most prominent visionaries in some of real-time computing's most important application domains.
An Empirical Study of Amorphous Slicing as a Program Comprehension Support Tool
Authors: David Binkley, L. Ross Raszewski, Christopher Smith, Mark Harman
Venue: Proceedings of the 8th International Workshop on Program Comprehension (2000)

Amorphous program slicing relaxes the syntactic constraint of traditional slicing and can therefore produce considerably smaller slices. This simplification power can be used to answer questions a software engineer might have about a program by first augmenting the program to make the question explicit and then slicing out an answer. One benefit of this technique is that the answer is in the form of a program and thus, in a language that the software engineer understands well.To test the usefulness of amorphous slicing in answering such questions, the question of array access safety is considered. A safety slice, an amorphous slice of an augmented program, is used to guide a software engineer to potential array bound violations.A series of experiments was conducted to determine whether the safety slice was an effective aid to an engineer. Seventy-six subjects participated in the controlled experiments. For experiments involving novice programmers, the null hypothesis could not be rejected, and so it was not possible to conclude that amorphous slicing assisted such programmers. However, for more experienced groups, the experimental subjects (who were able to consult amorphous slices) significantly outperformed the control group. The study lends empirical support to the assertion that amorphous slicing assists program comprehension.
Generating Synthetic Image Integrated With Real Images In Open Inventor
Authors: F. J. Perales
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

We describe a simple system for producing synthetic 3-D scenes integrated with real images captured with a camera, by using the graphic library Open Inventor. All the parts of the system are being described: real image capture, parameters measuring from the real scene, synthetic scene formation and coherent integration between the synthetic scene and the captured sequence. Finally we present some results of the proposed system.
Pivoted Document Length Normalization
Authors: Amit Singhal, Chris Buckley, Mandar Mitra, Gerard Salton
Venue:  (1995)

Document length normalization is an important aspect of term weight assignment in an automatic information retrieval system. In this study, we observe that a normalization scheme that retrieves documents of all lengths with similar chances as their likelihood of relevance will outperform another scheme which retrieves documents with chances very different from their likelihood of relevance. We show that the retrieval probabilities for a particular normalization method deviate systematically from the relevance probabilities across different collections. We present pivoted normalization a technique that can be used to reduce the gap between the relevance and the retrieval probabilities. Training pivoted normalization on one collection, we can successfully use it on other (new) text collections, yielding a robust, collection independent normalization technique. We use the idea of pivoting with the well known cosine normalization scheme. We point out some shortcomings of the cosine normalization function and present two new normalization functions --pivoted unique normalization and pivoted byte size normalization.
An Efficient Algorithm for Large-Scale Matrix Transposition
Authors: Jinwoo Suh, Viktor K. Prasanna
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

Efficient transposition of large-scale matrices has been widely studied. These efforts have focused on reducing the number of I/O operations. However, in the state-of-the-art architectures, data transfer time and index computation time are also significant components of the overall time. In this paper, we propose an algorithm that considers all these costs and reduces the over all execution time. The reduction of the overall execution time is achieved by using two techniques: (1) writing the data onto disk in predefined patterns and (2) balancing the numbers of disk read and write operations. Even though our approach may increase, the number of I/O operations for some cases it results in an overall reduction in the execution time. The index computation time, which is an expensive operation involving two divisions and a multiplication, is eliminated by partitioning the memory into two buffers. The expensive in-processor permutation is replaced by data collection operations. Our algorithm is analyzed using the well-known Linear Model and the Parallel Disk Model. The experimental results on a Sun Enterprise and a DEC Alpha show that our algorithm reduces the execution time by about 50%, compared with the best known algorithms in the literature.
A New Genetic Algorithm Using Large Mutation Rates and Population-Elitist Selection (GALME)
Authors: Hisashi Shimodaira
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

Genetic algorithms (GA' S) are one of promising means for function optimization. Methods for function optimization are required to perform local search as well as global search in a balanced way It is, however recognized that the traditional GA is not well suited to local search. I have tested algorithms combining various ideas to develop a new genetic algorithm to obtain the global optimum effectively As a result, it is turned out that the performance of a genetic algorithm using large mutation rates and population-enlist selection (GALME) is superior. This paper describes the GALME and its theoretical justification, and presents the results of experiments, compared to the traditional GA. With the range of the experiments, it is turned out that the performance of GALKE is remarkably superior to that of the traditional GA.
Towards a Computationally Intelligent Lesson Adaptation for a Distance Learning Course
Authors: G. D. Magoulas, K. A. Papanikolaou, M. Grigoriadou
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

In this paper a neuro-fuzzy approach is introduced to implement lesson adaptation in a Web-based course. Several key points that affect the effectiveness of an adaptive learning environment are investigated: the development of the educational material, the structure of the domain knowledge, the instructional design and the evaluation of the learner knowledge under uncertainty. The proposed approach allows generating the content of a hypermedia page from pieces of educational material based on a goal-oriented way of teaching and making use of the background knowledge of the learner.
Accelerating Evolution by Direct Manipulation for Interactive Fashion Design
Authors: Jong-Ha Lee, Hee-Su Kim, Sung-Bae Cho
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

In usual evolutionary computation (EC) is not effective for local search, but efficient forglobal search due to its probabilistic operators.This problem becomes worse in the interactiveEC (IEC) applications, which have the generation length limitation caused by user evaluation.To solve that, this paper proposes direct manipulation (DM) method, well known in HCI field,of evolution for IEC.It allows the user to manipulate individuals directly, instead of usingevolutionary operators as an interface to each individual.Through this approach, the DMovercomes the shortcoming of EC, letting alone the ability of global search to the originaloperators.We have applied the DM concept to the fashion design system based on IEC, and shown that the application is promising with two experiments.
PeerCQ: A Decentralized and Self-Configuring Peer-to-Peer Information Monitoring System
Authors: Bugra Gedik, Ling Liu
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

PeerCQ is a totally decentralize system that performs information monitoring tasks over a network ofpeers with heterogeneous capabilities. It uses ContinualQueries (CQs) as its primitives to express information-monitoring requests. A primary objective of the PeerCQsystem is to build a decentralize Internet scale distributedinformation-monitoring system, which is highly scalable,self-configurable and supports efficient and robust way ofprocessing CQs. This paper describes the basic architecture of the PeerCQ system and focuses on the mechanisms use for service partitioning at the P2P protocollayer. A set of initial experiments is reported, demonstrating the sensitiveness of the PeerCQ approach to largescale P2P information monitoring and the effectiveness ofthe PeerCQ service-partitioning algorithms with respect toload balancing and system utilization.
Reducing the virtual memory overhead of swizzling
Authors: V. Narasayya, T. S. E. Ng, D. McNamee, A. Tiwary, H. Levy
Venue: Proceedings of the 5th International Workshop on Object Orientation in Operating Systems (IWOOOS '96) (1996)

Swizzling is a mechanism used by OODBs and persistent object systems to convert pointers from their disk format to a more efficient in-memory format. Previous studies of swizzling have focused on analyzing the CPU overhead of pointer translation and studying trade-offs in different approaches to swizzling. In this paper we show that there is an additional indirect but important cost associated with swizzling: swizzling a read-only page causes it to be "dirty" with respect to the operating system. At the onset of paging, these read-only pages may be written to the swap file unnecessarily. We propose a simple modification to the operating system that reduces the impact of this overhead on application performance.
A Normed Space of Fuzzy Number Equivalence Classes
Authors: K. D Jamison
Venue:  (1997)

In our prior paper [2] we defined a fuzzy function and discussed the theory for optimizing unconstrained fuzzy functions. In that paper we described the need for a measure for comparing different possibility distributions in order to determine the decision makers preference for one distribution over another. In this paper we discuss one such measure on the space of fuzzy numbers and show that this measure defines a normed space of fuzzy numbers if we partition the space into appropriate equivalence classes. We also show that our space is complete if the supports of our fuzzy numbers are contained within a bounded subset of the real line.
The Representation of Noun Phrases In Logical Form
Authors: Mary P Harper
Venue:  (1989)

Several researchers in artificial intelligence have recognized the usefulness of a two-stage model of sentence comprehension for building a computer model of language. In the first stage, an intermediate level of representation called logical form is derived. During the second stage, logical form is updated with additional information (e.g., quantifier scoping). We introduce three constraints we consider necessary to make this model of language computationally feasible: \begin{enumerate} \item Logical form should compactly represent ambiguity. \item Logical form should be initially computable from syntax and local (sentence-level) semantics. In particular, logical form should not be dependent on pragmatics, which requires inference and hence internal representation. \item Further processing of logical form should only disambiguate or further specify logical form. Logical form has a meaning. Any further processing must respect that meaning. \end{enumerate} Within this framework, we have devised logical-form representations for pronouns, singular definite noun phrases, and singular indefinite noun phrases. For example, we represent a pronoun as a function of all of the variables corresponding to operators that can bind the pronoun. This representation allows us to indicate a meaning for the pronoun without deciding on the antecedent for the pronoun. Later, when we can determine the antecedent for the pronoun, we replace the pronoun function with the variable or function used to represent its antecedent. Like pronouns, definites are represented as functions. However, indefinites cannot initially be represented as a function in logical form. Initially, we represent an indefinite as an existentially quantified variable. Later, when more information is available about the meaning of a noun phrase, the initial representation is limited to indicate the intended meaning of that noun phrase. We demonstrate that these representations both model the appropriate linguistic behavior and satisfy our computational constraints. This work has been implemented and tested on a wide variety of examples.
Practical Algorithms for Polycyclic Matrix Groups
Authors: Gretchen Ostheimer
Venue:  (1997)

Many fundamental problems are undecidable for infinite matrix groups. Polycyclic matrix groups represent a large class of groups for which these same problems are known to be decidable. In this paper we describe a suite of new algorithms for studying polycyclic matrix groups --- algorithms for testing membership and for uncovering the polycyclic structure of the group. We also describe an algorithm for deciding whether or not a group is solvable, which, in the important context of subgroups of GL(n,Z), is equivalent to deciding whether or not a group is polycyclic. In contrast to previous algorithms, the algorithms in this paper are practical: experiments show that they are efficient enough to be useful in studying some reasonably complex examples using current technology.
Convergence Theorems for Least Change Secant Update Methods
Authors: John E. Dennis,  Jr., Homer F. Walker
Venue:  (1979)

The purpose of this paper is to present a convergence analysis of the least change secant methods in which part of the derivative matrix being approximated is computed by other means. The theorems and proofs given here can be viewed as generalizations of those given by Broyden-Dennis-More and by Dennis-More. The analysis is done in the orthogonal projection setting of Dennis-Schnabel and many readers might feel that it is easier to understand. The theorems here readily imply local and q-superlinear convergence of all the standard methods in addition to proving these results for the first time for the sparse symmetric method of Marwil and Toint and the nonlinear least squares method of Dennis-Gay-Welsch.
Multi-modal surface/outline projection and simulation of target/critical tissue movement
Authors: C. J. Moore, P. A. Graham, R. I. MacKay, P. J. Sharrock
Venue: Proceedings of the IEEE Conference on Information Visualisation (1997)

Conformal radiotherapy delivers high radiation doses to tumours whilst minimising damage to normal tissues. Therapy planning makes use of treatment simulation and computed tomographic images, which outline gross tumour volume and a dosimetric model. The larger planning target volume includes microscopic disease spread, target motion and set-up errors, effectively determining radiation beam collimation. High energy portal images are used to verify collimation and targeting. Software has been developed to integrate all the above features, allowing clinicians to interactively simulate motion effects and test the robustness of conformal planning. Multi-modality coregistration in 3D enables surface projection of modelled tumour/normal tissue volumes. Projection models are constructed from morphologically defined CT outline frames which are then B-Spline skinned. The biological effects of visualised motion can be explored at near real time rate.
Aesthetic selection of developmental art forms
Authors: Dale Thomas
Venue: Proceedings of the eighth international conference on Artificial life (2002)

Aesthetic selection has been employed in a system such that users can guide the evolution of art forms. The attributes of these forms are defined implicitly by an artificial genome, requiring a growth period to generate the final structure. During this growth phase, artificial chemicals react and diffuse across the surface of the developing structure, causing growth and other structural changes. The forms are part of a small evolving population in which fitness of each individual is entirely defined by the user. Throughout evolution user can design objects interactively or simply to explore the range of possible forms of the system.
Depth First Search and Location Based Localized Routing and QoS Routing in Wireless Networks
Authors: Ivan Stojmenovic, Mark Russell, Bosko Vukojevic
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

In a localized routing algorithm, node A currently holding the message forwards it based on the location of itself, its neighboring nodes and destination. We propose to use depth first search (DFS) method for routing decisions. Each node A, upon receiving the message for the first time, sorts all its neighbors according to a criteria, such as their distance to destination, and uses that order in DFS algorithm. It is the first localized algorithm that guarantees delivery for (connected) wireless networks modeled by arbitrary graphs, including inaccurate location information. We then propose the first localized QoS routing algorithm for wireless networks. It performs DFS routing algorithm after edges with insufficient bandwidth or insufficient connection time are deleted from the graph, and attempts to minimize hop count. This is also the first paper to apply GPS in QoS routing decisions, and to consider the connection time (estimated lifetime of a link) as a QoS criterion. The average length of measured QoS path in our experiments, obtained by DFS method, was between 1 and 1.34 times longer than the length of QoS path obtained by shortest path algorithm. Applying the concept of internal nodes considerably reduces the overhead.
Maximally Abstract Retrenchments
Authors: R. Banach
Venue: Proceedings of the 3rd IEEE International Conference on Formal Engineering Methods (2000)

The more obvious and well-known drawbacks of using refinement as the sole means of progressing from an abstract model to a concrete implementation are reviewed. Retrenchment is presented in a simple partial correctness framework as a more flexible development concept for formally capturing the early and otherwise pre-formal stages of development, and briefly justified. Given a retrenchment from an abstract to a concrete model, the problem of finding a model at the level of abstraction of the abstract model, but refinable to the concrete one, is examined. A construction is given that solves the problem in a universal manner, there being a canonical factorisation of the original retrenchment, into a retrenchment to the universal system followed by an I/O-filtered refinement. The universality amounts to the observation that the retrenchment component of any similar factorisation, factors uniquely through the universal model. The construction's claim to be at the right level of abstraction is supported by an idempotence property. The consequences of including termination criteria in the formal models are briefly explored.
Two Views on Security Software Liability: Let the Legal System Decide
Authors: Daniel J. Ryan
Venue: IEEE Security and Privacy (2003)

A point-counterpoint presentation on whether the legal system is the answer for security software liability issues.
The Four-Cubes Four-Color Problem or Instant Insanity
Authors: L. Axsom, Peter Wegner
Venue:  (1969)

NO SUPPLIED
On Dynamic Delay and Repeater Insertion in Distributed Capacitively Coupled Interconnects
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

Repeater insertion is a well established technique to minimise the propagation delay over long resistive interconnect. In deep sub-micron technologies, as the wires are spaced ever closer and signal rise and fall times go into the sub-nano second region, increased cross talk has implications on the data throughput and on signal integrity. Depending on the data correlation on the coupled lines, the delay can either decrease or increase. We show that in uniform coupled lines, the response for several important switching patterns has a dominant pole characteristic. The effect of repeater insertion including optimal repeater insertion for minimising delay with worst-case cross-talk, and area constrained optimisation is considered. All equations are checked against a dynamic circuit simulator (SPECTRE).