ppxscal/embedding_network huggingface dataset:
Administration in a multiple policy/domain environment: the administration and melding of disparate policies
Authors: William R. Ford
Venue: Proceedings of the 1995 workshop on New security paradigms (1995)

New standards for trusted systems propose multiple security policies and multiple policy domains. My experience building a Mutipolicy Machine prototype illustrated that multiple policy domains and complex policies push current policy administration techniques, tools, and user interfaces beyond their limits. This paper proposes a holistic approach to policy administration consisting of human-intuitive user interfaces for defining policies, a PolicyBase (a term I am introducing to describe a KnowledgeBase focused on the rules and data required to describe the policies to be administered and acted on) for storing them, and intelligent tool programs that allow the administrator to anticipate the impact of policy changes and interactions.
USCSH: An Active Intelligent Assistance System
Authors: Manton Matthews, Walter Pharr, Gautam Biswas, Harish Neelakandan
Venue: Artificial Intelligence Review (2000)

This paper describes the knowledge sources and methods of knowledge acquisition for USCSH (University of South Carolina SHell). USCSH is an active intelligent assistance system for Unix. The system operates in two modes, the active mode and the intelligent mode. In the active mode USCSH monitors the user's interactions with the system, and at appropriate times makes suggestions on how the user may better utilize the system to perform tasks. In the intelligent mode the system accepts questions in natural language and responds to them, taking into consideration the ability of the user and the context of the question.
The organization of structured files
Authors: B. J. Dzubak, C. R. Warburton
Venue: Communications of the ACM (1965)

A data file is an integral part of a data processing system. In many systems, the selection of an organization for the data within the file can be critical to the system's operating efficiency. This paper provides the systems designer with an information source which describes ten techniques that may be employed for organizing structured data. The characteristics of the organizations described are application independent, thus providing the designer with a reference which allows him to limit the number of file organizations he must consider for his system.
Use of topological constraints in construction and processing of robust solid models
Authors: Masatake Higashi, Hisashi Nakano, Atsuhide Nakamura, Mamoru Hosaka
Venue: Proceedings of the sixth ACM symposium on Solid modeling and applications (2001)

This paper introduces topological constraints to robustly and comprehensively process interference calculation in solid modeling and feature modeling, and describes a method of symbolic notation of their expressions and algorithms to handle them. The interference calculation should be processed consistently against the contradictions in numerical values and should output the result model in the same form of representation as that in the input. To satisfy this, the topological constraints are relied on in the processing rather than numerical values, and represented symbolically and explicitly in the solid model, which is based on the Face-based representation using a table of sequences of face names around each face of the solid. The topological constraints represent degeneracy and connectedness among faces, edges and vertices, and are used against errors derived from the ambiguities caused in the numerical calculation as well as in the input data, while the errors are deliberately kept within a given tolerance. The constraints are also specified by a designer for representing his intention. When the intersection is regarded as degenerate at a point such as vertex-vertex coincidence, its topological constraint is represented by a cluster of multiple basic intersection points between edges and faces, and the name of the cluster is expressed with face names around the degenerate point. In the calculation for the set operation, the symbols of cluster names and non-cluster intersection points are used to make intersection line loops, to divide the faces of both solids along the intersection lines and to reconnect the divided ones to make the result solid. Examples are shown to demonstrate that the algorithms generate output solids even when they are subtly intersected.
On Evil Twin Networks and the Value of Limited Randomized Routing
Authors: Brian D. Alleyne, Isaac D. Scherson
Venue: IEEE Transactions on Parallel and Distributed Systems (2000)

A dynamic two-stage Delta network ($N$ inputs and outputs) is introduced and analyzed for permutation routing. The notion of evil twins is introduced and a deterministic procedure is given to route any permutation in no more than $2 \root 4 \of N$ network cycles. Two limited randomized routing schemes are then analyzed. The first called Single Randomization yields on average at most $N {\bar !}+1+{\frac{1}{N}}$ ($N {\bar !} =O({\frac{\log{N}}{\log\log{N}}})$1 and is the greatest integer such that $(N {\bar !} )! \leq N$) network cycles and the second called Multiple Randomization yields on average at most $\lfloor \log(\log{N}+1)\rfloor+2+{\frac{1}{N}}$ network cycles for any input permutation. The probability of any permutation requiring at least $c$ network cycles more than the above average bounds is then shown to be at most ${\frac{1}{(c+1)!}}$ for Single Randomization and ${\frac{1}{N^{2^{c}}}}$ for Multiple Randomization, respectively. It is then shown how the dynamic two-stage network can be physically realized as a three-stage network. Both the evil twin and Multiple Randomization algorithms have been integrated into an off-the-shelf ASIC from PMC-Sierra, Inc. (PM-73488) which has been designed as a building block for such a three-stage implementation. These routing schemes are also adapted to run on a recirculating network. Recirculation is used to effect a reshuffling of data as in the dynamic network, but with a considerable reduction in network cost.
Summer meeting produces results
Authors: George S. Carson
Venue: ACM SIGGRAPH Computer Graphics (1999)

This edition of the Standards Pipeline reports on the results of the JTC I/ SC 24 (Computer Graphics and Image Processing) standards committee meeting held this summer in Korea. This report is divided into several sections:1. SC 24 as a whole2. Synthetic Environments Study Group3. Archiving and Distribution Study Group4. Interaction Study Group5. Working Group 6 (Multimedia Presentation and Interchange)5.1 3D and the Web5.2 CGM and the Web5.3 Portable Network Graphics (PNG)6. Working Group 7 (Image Processing and Interchange)For more information about the work of SC 24 you can visit the committee's website at http://www.bsi.org.uk/sc24/.
An overview of the Georgia Tech Broadband Institute at the Georgia Institute of Technology, Atlanta, USA
Authors: Nikil Jayant, John Pippin
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2000)

The Georgia Tech Broadband Institute was created in 1999, as a combination of two evolving organizations --- the Broadband Telecommunications Center (created in 1995) and the Georgia Tech Wireless Institute (created in 1998). The consolidation of the centers was in reflection of the synergy that existed between the centers, and the overlap in terms of existing and potential Industry sponsorship. The 1999 merger recognized that the future of wireless included an overarching trend towards broadband capability, and that from the user or application viewpoint, seamless and broadband connectivity were more significant than the medium used for the connection. In the rest of this summary, we focus on the Wireless component of the Georgia Tech Broadband Institute, the Georgia Tech Wireless Institute for short.
MILAN: A Model Based Integrated Simulation Framework for Design of Embedded Systems
Authors: A. Bakshi, V. K. Prasanna, A. Ledeczi
Venue: Proceedings of the ACM SIGPLAN workshop on Languages, compilers and tools for embedded systems (2001)

We present MILAN, a model based extensible framework that facilitates rapid, multigranular performance evaluation of a large class of embedded systems, by seamlessly integrating different widely used simulators in to a unified environment. MILAN provides a formal paradigm for specification of structural and behavioral aspects of embedded systems, an integrated model-based approach, and a unified software environment for system design and simulation. This paper provides an overview of MILAN, discusses the Model Integrated Computing philosophy, and illustrates the high-level modeling concepts being developed in the MILAN project for embedded systems design and evaluation.
Hybrid sparse resultant matrices for bivariate systems
Authors: Carlos D'Andrea, Ioannis Z. Emiris
Venue: Proceedings of the 2001 international symposium on Symbolic and algebraic computation (2001)

Our main contribution is an explicit construction of square resultant matrices, which are submatrices of those introduced by Cattani, Dickenstein and Sturmfels [4]. The determinant is a nontrivial multiple of the sparse (or toric) resultant. The matrix is hybrid in that it contains a submatrix of Sylvester type and an additional row expressing the toric Jacobian. If we restrict attention to such matrices, the algorithm yields the smallest possible matrix in general. This is achieved by strongly exploiting the combinatorics of sparse elimination. The algorithm uses a new piecewise-linear lifting, defined for bivariate systems of 3 polynomials with Newton polygons being scaled copies of a single polygon. The major motivation comes from systems encountered in CAD. Our MAPLE implementation, applied to certain examples, illustrates our construction and compares with alternative matrices.
Dijkstra's algorithm on-line: an empirical case study from public railroad transport
Authors: Frank Schulz, Dorothea Wagner, Karsten Weihe
Venue: Journal of Experimental Algorithmics (JEA) (2000)

Traffic information systems are among the most prominent real-world applications of Dijkstra's algorithm for shortest paths. We consider the scenario of a central information server in the realm of public railroad transport on wide-area networks. Such a system has to process a large number of on-line queries for optimal travel connections in real time. In practice, this problem is usually solved by heuristic variations of Dijkstra's algorithm, which do not guarantee an optimal result. We report results from a pilot study, in which we focused on the travel time as the only optimization criterion. In this study, various speed-up techniques for Dijkstra's algorithm were analysed empirically. This analysis was based on the timetable data of all German trains and on a "snapshot" of half a million customer queries.
Lazy Learning of Bayesian Rules
Authors: Zijian Zheng, Geoffrey I. Webb
Venue: Machine Learning (2000)

The naive Bayesian classifier provides a simple and effective approach to classifier learning, but its attribute independence assumption is often violated in the real world. A number of approaches have sought to alleviate this problem. A Bayesian tree learning algorithm builds a decision tree, and generates a local naive Bayesian classifier at each leaf. The tests leading to a leaf can alleviate attribute inter-dependencies for the local naive Bayesian classifier. However, Bayesian tree learning still suffers from the small disjunct problem of tree learning. While inferred Bayesian trees demonstrate low average prediction error rates, there is reason to believe that error rates will be higher for those leaves with few training examples. This paper proposes the application of lazy learning techniques to Bayesian tree induction and presents the resulting lazy Bayesian rule learning algorithm, called LBR. This algorithm can be justified by a variant of Bayes theorem which supports a weaker conditional attribute independence assumption than is required by naive Bayes. For each test example, it builds a most appropriate rule with a local naive Bayesian classifier as its consequent. It is demonstrated that the computational requirements of LBR are reasonable in a wide cross-section of natural domains. Experiments with these domains show that, on average, this new algorithm obtains lower error rates significantly more often than the reverse in comparison to a naive Bayesian classifier, C4.5, a Bayesian tree learning algorithm, a constructive Bayesian classifier that eliminates attributes and constructs new attributes using Cartesian products of existing nominal attributes, and a lazy decision tree learning algorithm. It also outperforms, although the result is not statistically significant, a selective naive Bayesian classifier.
An Experimental Comparison of Three PCA Neural Networks
Authors: Simone Fiori
Venue: Neural Processing Letters (2000)

We present a numerical and structural comparison of three neural PCA techniques: The GHA by Sanger, the APEX by Kung and Diamantaras, and the &psi;&ndash;APEX first proposed by the present author. Through computer simulations we illustrate the performances of the algorithms in terms of convergence speed and minimal attainable error; then an evaluation of the computational efforts for the different algorithms is presented and discussed. A close examination of the obtained results shows that the members of the new class improve the numerical performances of the considered existing algorithms, and are also easier to implement.
Second language acquisition and CS1
Authors: Anne Gates Applin
Venue: ACM SIGCSE Bulletin (2001)

This paper presents an empirical study of the relative effectiveness of two teaching methods used in CS1 classrooms. While the teaching methods are nothing new, the results of the study are an important contribution to the body of computer science education literature. The research design should also be of interest in that it demonstrates how statistical significance can be achieved with a relatively small sample by using the naturally occurring groups that we have as course sections.The teaching methods studied here were having students write programming assignments from scratch versus having them add to or modify existing well-written, well-documented programs. The results are perhaps not surprising. After controlling for certain factors, the statistical analysis showed that students who added to program templates as programming assignments scored better on the comprehensive examination and had higher overall course averages than their counter parts who wrote programs from scratch. This idea is firmly based in cognitive psychology and teachers of language use a similar method extensively. Reading increases vocabulary, aids in concept retention, and improves writing skill.
Information processing by cells and biologists (abstract only)
Authors: Roger Brent
Venue: Proceedings of the fifth annual international conference on Computational biology (2001)

The core agenda of post-WWII molecular biology has been defined as the molecular understanding of how genetic information was transmitted and read out (see for example Stent 1968), and, by the 1950's, the analogy between the tape in a Turing machine and the linear sequence of nucleotides in DNA was apparent to both computer scientists and biologists. In the early 21st century, it may be that molecular biology can fruitfully return to these roots, by recasting part of its agenda in terms of the need to understand how biological information is processed. In a somewhat more modern formulation, cells can be though of as machines that process and make decisions on three kinds of information: 1) information stored in the genome 2) information about intracellular events (for example from heckpoint mechanisms) and 3) information external to the cell. In many cases the machinery that cells use to make decisions is reasonably well understood at a qualitative level. However, in no case do we possess a corresponding quantitative understanding, and, reflecting this, nor are we very capable of predicting the outcomes of perturbations to the genome, the internal workings of the cell, or its external environment. One path to understanding the behavior of these ensembles of components clearly lies in construction of mechanism-based quantitative models representing cellular processes. Building such models requires solution of numerous computational and experimental biological challenges. I will detail some of these. Another path may involve computation on the qualitative biological knowledge that now exists. Expert biologists reason on this qualitative information to make statements about the consequences of perturbations, but expert systems that do the same in the main do not exist. Here, although the need is clear, the relative opacity (to me) of much of the seemingly relevant computer science literature has made it more difficult to figure out first steps. Finally, note that information theory (Shannon 1948) has its roots in the 20th century need to understand transmission of electrical signals through channels. It is not immediately clear that the representations of biological processes used by biologists map well to concepts that come from this theory. To give only one example, one is hard pressed to define or find, inside a cell that is processing signals from the outside, either the signal or the &ldquo;bits&rdquo; (Tukey, 1946) that might make it up. There may be thus be an opportunity here for new theory to guide thinking and further experiment.
A parallel algorithm for polygon rasterization
Authors: Juan Pineda
Venue: ACM SIGGRAPH Computer Graphics (1988)

A parallel algorithm for the rasterization of polygons is presented that is particularly well suited for 3D Z-buffered graphics implementations. The algorithm represents each edge of a polygon by a linear edge function that has a value greater than zero on one side of the edge and less than zero on the opposite side. The value of the function can be interpolated with hardware similar to hardware required to interpolate color and Z pixel values. In addition, the edge function of adjacent pixels may be easily computed in parallel. The coefficients of the "Edge function" can be computed from floating point endpoints in such a way that sub-pixel precision of the endpoints can be retained in an elegant way.
Managing Reentrant Structures Using Reference Counts
Authors: Daniel G. Bobrow
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1980)

Automatic storage management requires that one identify storage unreachable by a user's program and return it to free status. One technique maintains a count of the references from user's programs to each cell, since a count of zero implies the storage is unreachable. Reentrant structures are self-referencing; hence no cell in them will have a count of zero, even though the entire structure is unreachable. A modification of standard reference counting can be used to manaage the deallocation of a large class of frequently used reentrant structures, including two-way and circularly linked lists. All the cells of a potentially reentrant structure are considered as part of a single group for deallocation purposes. Information associated with each cell specifies its group membership. Internal references (pointers from one cell of the group to another) are not reference counted. External references to any cell of this group are counted as references to the group as a whole. When the external reference count goes to zero, all the cells of the group can be deallocated. This paper describes several ways of specifying group membership, properties of each implementation, and properties of mutable and immutable group membership.
Rent's rule based switching requirements
Authors: André DeHon
Venue: Proceedings of the 2001 international workshop on System-level interconnect prediction (2001)

A Rent's Rule characterization of recursive bisection captures a measure of the locality in a netlist or graph. From this characterization, we know we can establish a lower bound on layout area implied by wiring. When applying this lower bound to the design of programmable or switched networks, we are ultimately concerned for both the switching requirements and the wiring requirements. Switch requirements are particularly important in conventional VLSI where (a) a switchpoint consumes considerably more area than a wire crossing and (b) switchpoints must reside on the active surface, whereas wiring may take place on any of several wire layers. The most straight-forward, limited-bisection switching networks have switching requirements which grow as $O(N^{2p})$, similar to wiring requirements. In practice, however, this leaves switching dominating wiring. We show that there are limited-bisection networks with $O(N)$ switching growth and highlight some of the tradeoffs between wire utilization and switching, routing complexity, routing guarantees, and switch latency within this design space.
Automata-Based Symbolic Scheduling for Looping DFGs
Authors: Steve Haynal, Forrest Brewer
Venue: IEEE Transactions on Computers (2001)

This paper presents an exact technique for scheduling looping data-flow graphs that implicitly supports functional pipelining and loop winding. Automata-based symbolic modeling provides efficient representation of all causal executions of a given behavioral description subject to finite state bounds. Since a complete set of scheduling solutions is found, further incremental refinements, such as sequential interface protocol constraints, can be easily accommodated. Efficiency in the implementation is maintained by careful formulation of the automata and by judicious exploration techniques. Results are presented for traditionally referenced benchmarks, several large synthetic benchmarks, and a practical industrial example.
Profiling a parallel language based on fine-grained communication
Authors: Bjoern Haake, Klaus E. Schauser, Chris Scheiman
Venue: Proceedings of the 1996 ACM/IEEE conference on Supercomputing (CDROM) (1996)

Fine tuning the performance of large parallel programs is a very difficult task. A profiling tool can provide detailed insight into the utilization and communication of the different processors, which helps identify performance bottlenecks. In this paper we present a profiler for the fine-grained parallel programming language Split-C, which provides a simple global address space memory model. As our experience shows, it is much more challenging to profile programs that make use of efficient, low-overhead communication. We incorporated techniques which minimize profiling effects on the running program. We quantify the profiling overhead and present several Split-C applications which show that the profiler is useful in determining performance bottlenecks.
On the implementation of AMBIT, a language for symbol manipulation
Authors: Carlos Christensen
Venue: Communications of the ACM (1966)

A brief description is given of the implementation technique for the replacement rule of the AMBIT programming language. The algorithm for the &ldquo;AMBIT scan&rdquo; and an example of its application are given. The algorithm is applicable to other members of the family of string transformation languages of which AMBIT is a member, and it provides a rationale for the design of the AMBIT language.
System performance evaluation: survey and appraisal
Authors: Peter Calingaert
Venue: Communications of the ACM (1967)

The state of the art of system performance evaluation is reviewed and evaluation goals and problems are examined. Throughput, turnaround, and availability are defined as fundamental measures of performance; overhead and CPU speed are placed in perspective. The appropriateness of instruction mixes, kernels, simulators, and other tools is discussed, as well as pitfalls which may be encountered when using them. Analysis, simulation, and synthesis are presented as three levels of approach to evaluation, requiring successively greater amounts of information. The central role of measurement in performance evaluation and in the development of evaluation methods is explored.