ppxscal/embedding_network huggingface dataset:
Remarks on the equivalence problem for PL-sets
Authors: Bhaskar DasGupta
Venue:  (1997)

The following problem arises in connection with checking the equivalence piecewise-linear (PL) sets. Consider two-variable polynomials with non-negative integer coefficients, and given two such polynomials, decide if they are equivalent to each other modulo the following equalities $x=2x+1$, $y^2=2y^2+y$ and $y=x+y+1$. In this paper, we show that this problem can be solved in polynomials time in both the unit-cost and the logarithmic-cost model.
Technical Note: Visually Encoding Program Test Information to Find Faults in Software
Authors: James Eagan, Mary Jean Harrold, James A. Jones, John Stasko
Venue: Proceedings of the IEEE Symposium on Information Visualization 2001 (INFOVIS'01) (2001)

Large test suites are frequently used to evaluate software systems and to locate errors. Unfortunately, this process can generate a huge amount of data that is difficult to interpret manually. We have created a system, Tarantula, that visually encodes test data to help find program errors. The system uses a principled color mapping to represent source lines in passed and failed tests. It also provides a flexible user interface for examining different perspectives that show the behavior of the source code on test sets, ranging from individual tests, to important subsets such as the set of failed tests, to the entire test suite.
A Metric Towards Efficient Exhaustive Test Pattern Generation
Authors: Dimitrios Kagaris, Fillia Makedon
Venue:  (1991)

A viable technique [7] in built-in self-test (BIST)[2] is to generate test patterns pseudo-exhaustively by using linear feedback shift registers (LFSR''s). The goal is to find an appropriate primitive polynomial of degree d that will generat 2d test patterns in order to exercise all circuit outputs simultaneously. In an attempt to reduce the degree d of the polynomial the following strategy was proposed in [6,5]. In the first phase, partition the circuit into segments by inserting a small number of register cells, so that the input dependency of any circuit element in the segments is no more than d. Then, obain an appropriate primitive polynomial of degree d by inserting additional register cells. In [12] we have proposed a heuristic for phase one that does not necessarily partition the circuit. Extensive experimentation has shown that this results in a considerably smaller cell overhead. In this paper we extend our heuristic in [12], so that the minimization of the number of register cells is done in conjunction with a quantity that naturally reflects the difficulty of deriving an appropriate primitive polynomial of degree d. Experimentation shows that the proposed heuristic results again in an overall smaller number of register cells than a partition based approach and in an efficient framework for test pattern generation.
Hardware detection of undefined references
Authors: G. W. Gerrity
Venue: ACM SIGARCH Computer Architecture News (1980)

The construction of reliable programs could benefit substantially from improved hardware support. The automatic detection of one particularly common programming error, namely, the failure to define the value of a data element before referencing it, is quite simple and can be implemented in most microprogrammed machines. A method of introducing machine-detectable null elements for this purpose is described. This leads naturally to a re-appraisal of the basic operations CLEAR and ASSIGN.
Layered earth inversion visual toolkit: a scientific visualisation case study
Authors: Andrew Donohoo, Debbie Richards
Venue: Proceedings of the Pan-Sydney area workshop on Visual information processing - Volume 11 (2001)

Visualisation Systems are in general designed to maximise the cognitive ability of system users particularly when exposed to large sets of otherwise difficult to comprehend data, by appealing to various strengths of the human perceptual system in processing visual information. Scientific Visualisation in particular aims to present physical data in ways that facilitate the discovery and/or understanding of deterministic mechanisms or underlying cause and effect of the physical system described by the data.This report examines the development of a Scientific Visualisation tool, which has been developed for use in conjunction with existing specialist numerical modelling software. The modelling software is typically used in an iterative fashion, with successive user specified inputs dependent on analysis of prior output. The newly developed visual tool, developed for use with Windows operating system using Borland Delphi and an object- oriented paradigm, overcomes the lack of input/output visualisation capability of the modelling software. By using the visual tool, input states can be controlled quickly and interactively through direct graphical means. The program runs the model software as a separate background process, and automatically displays model output in an interactive display. Model output consists of many thousands of data values that can be viewed simultaneously by the visual tool as a two-dimensional coloured contour. The system has been specifically designed to handle layered earth inversion data but interactive visualisation would be beneficial to other scientific applications.
Coalgebras and modal logic for parameterised endofunctors
Authors: A. Kurz, D. Pattinson
Venue:  (2000)

We study categories of coalgebras for endofunctors, which additionally depend on a parameter category. The corresponding category of coalgebras then naturally appears as cofibred over the parameters. We give examples of constructions in the cofibred framework and study the overall structure of such cofibrations. Moreover, the dependency of (modal) logics for coalgebras on a parameter category is investigated and shown to give rise to the dual of an institution.
Development of ANN-based preliminary structural design systems for cable-stayed bridges
Authors: Namhee Kim Hong, Sung-Pil Chang, Seung-Chul Lee
Venue: Advances in Engineering Software (2002)

The development of computer-supporting systems in early design stage has been suffering from the difficulty in computerizing the information and knowledge because it lacks formality of representation of designers' experience and intuition. To overcome this problem, the concept of artificial neural network (ANN) was adopted to develop preliminary design system for cable-stayed bridges in this paper. Considering that relatively little is known in early design stages and design information evolves as design proceeds, multi-level networks for progressive structural design are proposed. This approach has been proved to have the ability of learning design experience and providing practical design alternatives. The prototype of preliminary structural design system has been implemented as a part of integrated design system to show the process of the ANN-based preliminary structural design proposed in this paper. The proposed methodology is hoped to help facilitate more effective preliminary design toward an integrated computer-supporting design system.
Using web helper agent profiles in query generation
Authors: Gabriel L. Somlo, Adele E. Howe
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Personalized information agents can help overcome some of the limitations of communal Web information sources such as portals and search engines. Two important components of these agents are: user profiles and information filtering or gathering services. Ideally, these components can be separated so that a single user profile can be leveraged for a variety of information services. Toward that end, we are building an information agent called SurfAgent; in previous studies, we have developed and tested methods for automatically learning a user profile [20]. In this paper, we evaluate alternative methods for recommending new documents to a user by generating queries from the user profile and submitting them to a popular search engine. Our study focuses on three questions: How do different algorithms for query generation perform relative to each other? Is positive relevance feedback adequate to support the task? Can a user profile be learned independent of the service? We found that three algorithms appear to excel and that using only positive feedback does degrade the results somewhat. We conclude with the results of a pilot user study for assessing interaction of the profile and the query generation mechanisms.
Fault Tolerant Distributed Information Systems
Authors: John C. Knight, Matthew C. Elder
Venue: Proceedings of the 12th International Symposium on Software Reliability Engineering (2001)

Critical infrastructures provide services upon which society depends heavily; these applications are themselves dependent on distributed information systems for allaspects of their operation and so survivability of the information systems is an important issue.Fault tolerance is a mechanism by which survivability can be achieved in theseinformation systems.We outline a specification-based approach to fault tolerance, called RAPTOR, that enables structuring of fault-tolerance specifications and an implementation partially synthesized from the formal specification.The RAPTOR approach uses threespecifications describing the fault-tolerant system, the errors to be detected, and the actions to take to recover from those errors.System specification utilizes an object-orienteddatabase to store the descriptions associated with these large, complex systems. The error detection and recovery specifications are defined using the formal specification notation Z. We also describe an implementation architecture and explore our solution with a case study.
Trends in Preserving and Enhancing the Value of Software
Authors: Ned Chapin
Venue: Proceedings of the International Conference on Software Maintenance (ICSM'00) (2000)

This position paper on the ICSM 2000 conference theme reviews five key questions about determining software value. Afterward it groups some major trend issues relevant to software value into four clusters. Then drawing upon existing practices, it notes trends in seven value-preserving and enhancing groups of processes. In conclusion, it points to the critical role of management in preserving and enhancing the value of software.
INEXACT REFLECTIVE NEWTON METHODS FOR LARGE-SCALE OPTIMIZATION SUBJECT TO BOUND CONSTRAINTS
Authors: Mary A Branch
Venue:  (1995)

This thesis addresses the problem of minimizing a large-scale nonlinear function subject to simple bound constraints. The most popular methods to handle bound constrained problems, active-set methods, introduce a combinatorial aspect to the problem. For these methods, the number of steps to converge may be related to the number of constraints. For large problems, this behavior is particularly detrimental. Reflective Newton methods avoid this problem by staying strictly within the constrained region. As a result, these methods have strong theoretical properties. Moreover, they behave experimentally like an unconstrained method: the number of steps to a solution is not strongly correlated with problem size. In this thesis, we discuss the reflective Newton approach and how it can be combined with inexact Newton techniques, within a subspace trust-region method, to efficiently solve large problems. Two algorithms are presented. The first uses a line search as its globalizing strategy. The second uses a strictly trust-region approach to globally converge to a local minimizer. Global convergence and rate of convergence results are established for both methods. We present computational evidence that using inexact Newton steps preserves the properties of the reflective Newton methods: the iteration counts are as low as when ``exact'''' Newton steps are used. Also, both the inexact and exact methods are robust when the starting point is varied. Furthermore, the inexact reflective Newton methods have fast convergence when negative curvature is encountered, a trait not always shared by similar active-set type methods. The role of negative curvature is further explored by comparing the subspace trust-region approach to other common approximations to the full-space trust-region problem. On problems where only positive curvature is found, these trust-region methods differ little in the number of iterations to converge. However, for problems with negative curvature, the subspace method is more effective in capturing the negative curvature information, resulting in faster convergence. Finally a parallel implementation on the IBM SP2 is described and evaluated; the scalability and efficiency of this implementation are shown to be as good as the matrix-vector multiply routine it depends on.
Troubleshooting Microsoft Technologies: Windows Server 2003, Windows XP and Microsoft Office
Authors: Chris Wolf
Venue:  (2003)

From the Book:Many have long considered the act of troubleshooting to be more art than science. However, with the right methodology, one can systematically analyze and repair problems affecting an individual computer or an entire network. Whether you are an end user looking to exert a new level of problem solving independence, or are an experienced help desk analyst or systems administrator, this book has something for you. The book not only provides answers to some of the most puzzling Microsoft computer problems, but also presents the answers in the context of the troubleshooting methodology most highly regarded in the computer industry, allowing you to learn and apply a proven troubleshooting technique to any computer problem.This book begins by presenting the most common approaches for diagnosing and resolving problems, and then moves to documenting all of the Microsoft troubleshooting tools at your disposal. With a troubleshooting foundation securely in place, the book then focuses exclusively on individual problem sets, including:Common Windows Server 2003 and Windows XP problemsMicrosoft OfficeHard disk errorsDNS and WINSDHCPRouting and network servicesActive DirectoryWith chapters organized and dedicated to specific problems, you will find this book an invaluable tool for repairing software glitches on all of the computers you manage. Since no problem can be solved without understanding the underlying fundamentals of the technology involved, you will appreciate the concise technical introductions at the beginning of each chapter. So if called on to resolve a DNS problem in which you have little experience, using this reference will allow you to quickly get up to speed with DNS concepts and in turn solve the error.While one can attempt to solve problems with just the available tools that come with the operating system, troubleshooting is much easier with the help of several tools provided by third party vendors. When troubleshooting problems such as those that involve network name resolution or group policy objects in the Active Directory, you will be able to find the problem faster with one of the fifteen third party tools that are included with this book's companion CD.Repairing computer problems requires the right approach, an understanding of the technologies involved, knowledge of the available troubleshooting tools, and insight into the most common operating system and application problem areas. Microsoft networks comprise of a vast array of technologies, each of which are covered by their own technical reference. If you need to troubleshoot many of these technologies, you could carry twenty books around with you, which may provide some troubleshooting information on each technology, or you can carry this single reference, which details troubleshooting for nearly all of the software dilemmas you are likely to encounter.
Programming students NEED instant feedback!
Authors: Anne Venables, Liz Haywood
Venue: Proceedings of the fifth Australasian conference on Computing education - Volume 20 (2003)

This paper describes the work that has been undertaken to improve the quantity and quality of feedback given to students studying introductory Java programming. An on-line submission program (submit) was developed that specifically addresses the needs of beginning programming students by providing automatic and instant feedback to a student's programming efforts. Traditionally, this feedback was provided by staff in scheduled laboratory sessions, yet the amount of individual attention a particular student received was haphazard. In addition, the introduction of the submit program has reduced the marking and administrative load associated with providing timely feedback to students for participating staff.submit is more than just an on-line letter box for students to post their programs. submit also provides instant feedback which encourages students to improve their programs to meet all given requirements as well as to improve programming style.In order to assess the effectiveness of the submit program over four trials, student responses to questionnaires were collated and support some tentative conclusions as to the effectiveness of submit as a learning aid to students. Staff opinion from those involved in the day-to-day teaching of Java programming was also solicited. These responses have been very positive, especially from the staff that supervise laboratory work.
Scheduling in a Ring with Unit Capacity Links
Authors: Perry Fizzano, Clifford Stein
Venue:  (1994)

We consider the problem of scheduling unit-sized jobs on a ring of processors with the objective of minimizing the completion time of the last job. Unlike much previous work we place restrictions on the capacity of the network links connecting processors. We give a polynomial time centralized algorithm that produces optimal length schedules. We also give a simple distributed 2-approximation algorithm.
Simple driving techniques
Authors: Mads Rosendahl
Venue: The essence of computation: complexity, analysis, transformation (2002)

Driving was introduced as a program transformation technique by Valentin Turchin in some papers around 1980. It was intended for the programming language REFAL and used in metasystem transitions based on super compilation. In this paper we present one version of driving for a more conventional lisp-like language. Our aim is to extract a simple notion of driving and show that even in this tamed form it has much of the power of more general notions of driving. Our driving technique may be used to simplify functional programs which use function composition and will often be able to remove intermediate data structures used in computations.
Tight bounds for synchronous communication of information using bits and silence
Authors: Una-May O'Reilly, Nicola Santoro
Venue: Discrete Applied Mathematics (2003)

We establish worst-case and average-case lower bounds on the trade-off between the time and bit complexity for two-party communication in synchronous networks. We prove that the bounds are tight by presenting protocols whose bit-time complexity match the ones expressed by the lower bounds. We actually show that the algorithms are everywhere optimal: at any point of the trade-off and for any universe of data to be communicated, no other solution has better complexity to communicate any element of that universe (within a fixed relabeling). Similar results are derived when transmissions are subject to corruptions.In these results, the number of bits is a priori agreed upon. We also derive lower bounds on the worst case complexity of two-party communication when the number of bits is variable; the bounds prove that any improvement would be by an additive constant (even in presence of an oracle).
Context Awareness by Analyzing Accelerometer Data
Authors: Cliff Randell, Henk Muller
Venue: Proceedings of the 4th IEEE International Symposium on Wearable Computers (2000)

In this paper, we describe continuing work being carried out as part of the Bristol Wearable Computing Initiative. We are researching processing techniques for data from accelerometers, which enable the wearable computer to determine the user's activity. Techniques already employed by others have been explored and we propose new methods for analyzing the data delivered by these devices. We try to minimize the number of devices needed by using a single X-Y accelerometer device. Using our techniques we have adapted our GPS based Tourist Guide application to vary it's multimedia presentation according to the user's activity as well as location.
On Searching with Semialgebraic Sets
Authors: K P Agarwal, Jiri Matousek
Venue:  (1992)

Let $P$ be a set of $n$ points in ${\Bbb R}^d$ (where $d$ is a small fixed positive integer), and let $\Gamma$ be a collection of subsets of ${\Bbb R}^d$, each of which is defined by a constant number of bounded degree polynomials. We consider the following $\Gamma$-{\em range searching} problem: Given {\em P}, build a data structure for efficient answering of queries of the form `Given a $\gamma \in \Gamma$, count (or report) the points of {\em P} lying in $\gamma$''. Generalizing the simplex range searching techniques, we give a solution with nearly linear space and preprocessing time and with $O(n^{1-1/b+ \delta})$ query time, where $d \leq b \leq 2d-3$ and $\delta < 0$ is an arbitrarily small constant. The actual value of $b$ is related to the problem of partitioning arrangements of algebraic surfaces into constant-complexity cells. We present some of the applications of $\Gamma$-range searching problem, including improved ray shooting among triangles in ${\Bbb R}^3$.
Optical local area networks (LANs) using wavelength selective couplers
Authors: T. D. Todd, A. M. Grah, O. Barkovic
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

In wavelength-division-multiplexed ring and bus networks, stations normally connect to the fiber using fused biconical taper (FBT) attachments. In this paper, we investigate protocols for multichannel photonic bus/ring LANs which use active wavelength-selective taps rather than passive ones. Since stations actively tap the channel that they are accessing, synchronization and other functions are identical to existing single-channel LANs. However, in order to avoid "re-tuning collisions", the media access protocols in these designs must ensure that stations do not re-tune their couplers at inappropriate times. This constraint places restrictions on the physical parameters over which system performance is efficient. In particular, we find that these designs may be efficient in the local area but lack the scalability required for metropolitan coverage. In this paper, capacity and delay models are also derived, and comparisons are made with conventional passive networks.
A Practical Student Model in an Intelligent Tutoring System
Authors: Yujian Zhou, Martha W. Evens
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

In this paper we consider two questions related to student modeling in an intelligent tutoring system: 1) What kind of student model should we build when we design a new system; 2) Should we divide the student model into different components depending on the information involved. We consider these two questions in the context of a conversational intelligent tutoring system, CIRCSIM-Tutor. We first analyze the range of decisions that the system needs to make and define the information needed to support these decisions. We then describe four distinct models that provide different aspects of this information, taking into consideration the nature of the domain and the constraints provided by the tutoring system. At the end of the paper we briefly discuss our experiments with enhancing the student model in CIRCSIM-Tutor and some general problems regarding building and evaluating different student models.