ppxscal/embedding_network huggingface dataset:
Is maintenance ready for evolution?
Authors: S. Smith, K. Bennett, C. Boldyreff
Venue: Proceedings of the International Conference on Software Maintenance (1995)

Current solution strategies for coping with maintenance tend to be based around formalising and making explicit the interfaces between components. This can help to localise changes, and hence make a contribution to coping with the problem of altering systems in response to change. We investigate an alternative approach, using concepts from distributed artificial intelligence. We assume that software components do not have to have rigid interfaces; they can negotiate, make decisions, etc. The role of the maintainer is changed; we shift part of the responsibility for decision-making etc. onto the software itself using concepts from adaptive and self-modifying systems. Some of the work that would have been done during evolutionary development (i.e. maintenance) is now done during run-time. So, we have real evolution. New techniques are now required to deal with this new situation: the modelling of negotiation, feedback, system stability etc. is as important as the modelling of services and functions. Analytical techniques for understanding a system and its environment are central; analysis is carried out principally with regard for the goals that the system is expected to fulfil. The paper provides the outline of a new future strategy for software maintenance. These ideas result from some recent work carried out at the Centre for Software Maintenance at Durham.
Dynamic Hierarchy Specification and Visualization
Authors: Richard M. Wilson, R. Daniel Bergeron
Venue: Proceedings of the 1999 IEEE Symposium on Information Visualization (1999)

This paper describes concepts that underlie the design and implementation of an information exploration system that allows users to impose arbitrary hierarchical organizations on their data. Such hierarchies allow a user to embed important semantic information into the hierarchy definition. Our goal is to recognize the significance of this implicit information and to utilize it in the hierarchy visualization. The innovative features of our system include the dynamic modification of the hierarchy definitions and the definition and implementation of a set of layout algorithms that utilize semantic information implicit in the tree construction.
Lp-error estimates for "shifted" surface spline interpolation on Sobolev space
Authors: Jungho Yoon
Venue: Mathematics of Computation (2003)

The accuracy of interpolation by a radial basis function φ is usually very satisfactory provided that the approximant f is reasonably smooth. However, for functions which have smoothness below a certain order associated with the basis function φ, no approximation power has yet been established. Hence, the purpose of this study is to discuss the Lp-approximation order (1 ≤ p ≤ ∞) of interpolation to functions in the Sobolev space Wpk(Ω) with k > max(0,d/2 - d/p). We are particularly interested in using the "shifted" surface spline, which actually includes the cases of the multiquadric and the surface spline. Moreover, we show that the accuracy of the interpolation method can be at least doubled when additional smoothness requirements and boundary conditions are met.
Mechanisms for Specifying Scheduling Policies
Authors: Fred B. Schneider, A. J. Bernstein
Venue:  (1979)

Extensions to concurrent programming languages are presented which allow control of scheduling policies previously defined by the run-time support system. It is shown that the use of these mechanisms simplifies the solutions of concurrent programming problems. In addition, the proposed extensions allow easy identification of those aspects of a program concerned with performance, thereby making programs easier to read and understand. Keywords: concurrent pascal, monitors, communicating sequential processes, operating systems, scheduling algorithms.
An Analysis of the Core-ML Language: Expressive Power and Type Reconstruction
Authors: Paris C. Kanellakis, Gerd G. Hillebrand, Harry G. Mairson
Venue:  (1994)

Core-ML is a basic subset of most functional programming languages. It consists of the simply typed (or monomorphic) $\lambda$-calculus, simply typed equality over atomic constants, and {\tt let} as the only polymorphic construct. We present a synthesis of recent results which characterize this ``toy'''' language''s expressive power as well as its type reconstruction (or type inference) problem. More specifically: (1)~Core-ML can express exactly the ELEMENTARY queries, where a program input is a database encoded as a $\lambda$-term and a query program is a $\lambda$-term whose application to the input normalizes to the output database. In addition, it is possible to express all the PTIME queries so that this normalization process is polynomial in the input size. (2)~The polymorphism of {\tt let} can be explained using a simple algorithmic reduction to monomorphism, and provides flexibility, without affecting expressibility. Algorithms for type reconstruction offer the additional convenience of static typing without type declarations. Given polymorphism, the price of this convenience is an increase in complexity from linear-time in the size of the program typed (without {\tt let}) to completeness in exponential-time (with {\tt let}). (3)~Fragments of Core-ML, based on the order of functionalities used, can be fairly expressive. For example, order $\leq 5$ suffices for the PTIME queries, even without {\tt let} or equality. Also, for each fixed order, type reconstruction is polynomial in program size. Programming by using low order functionalities and type reconstruction is common in functional languages. Thus, our analysis partly explains the wide use and efficiency of such programming practices.
Measurement of Inherent Noise in EDA Tools
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

With advancing semiconductor technology and exponentially growing design complexities, predictability of design tools becomes an important part of a stable top-down design process. Prediction of individual tool solution quality enables designers to use tools to achieve best solutions within prescribed resources, thus reducing design cycle time. However, as EDA tools become more complex, they become less predictable. One factor in the loss of predictability is inherent noise in both algorithms and how the algorithms are invoked. In this work, we seek to identify sources of noise in EDA tools, and analyze the effects of these noise sources on design quality.Our specific contributions are: (i) we propose new behavior criteria for tools with respect to the existence and management of noise; (ii) we compile and categorize possible perturbations in the tool use model or tool architecture that can be sources of noise; and (iii) we assess the behavior of industry place and route tools with respect to these criteria and noise sources. While the behavior criteria give some guidelines for and characterize the stability of tools, we are not recommending that tools be immune from input perturbations. Rather, the categorization of noise allows us to better understand how tools will or should behave; this may eventually enable improved tool predictors that consider inherent tool noise.
The Index-Permutation Graph Model for Hierarchical Interconnection Networks
Authors: Chi-Hsiang Yeh, Behrooz Parhami
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

In this paper, we present the index-permutation (IP) graph model, and apply it to the systematic development of efficient hierarchical networks. We derive several classes of interconnection networks based on IP graphs to achieve desired properties; the results compare favorably with popular interconnection networks, as measured by topological (e.g., node degree and diameter) and algorithmic properties, and are particularly efficient in view of their sparse inter-module communication patterns. In particular, the diameters of suitably-constructed super-IP graphs, a subclass of IP graphs, are optimal within a factor of 1 +o(1), given their node degrees. The IP graph model can also be used as a common platform that unifies the architectures and algorithms for a vast variety of interconnection networks.
Separation of Toching and Overlapping Words in Adjacent Lines of Handwritten Text
Authors: Kalyan Takru, Graham Leedham
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

This paper reports on a novel technique for the separation of characters and words that are connected through touching or overlapping of characters between adjacent lines of text. The technique employs structural knowledge of handwriting styles where overlap is most frequentlyobserved. The method is shown to work well in the most usual cases and resolve many of the more difficult cases observed in very poor quality handwritten documents.
The Weakest Link Revisited
Authors: Iván Arce
Venue: IEEE Security and Privacy (2003)

The author looks at the "weakest links" in security through the decades and at what he believes is the current weakest link, the workstation.
Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Venue: International Conference on Autonomous Agents (2003)

The AAMAS conference series was initiated in 2002, with the goal of providing a single, high profile, internationally respected and recognised forum for research in the theory and practice of autonomous agents and multiagent systems. The first AAMAS conference (AAMAS-2002, Bologna, Italy) attracted a remarkable number of submissions and nearly 700 delegates, firmly establishing it as the major event in the academic history of agent systems to date. We expect that the 2003 conference, in the attractive and cosmopolitan setting of Melbourne, Australia, will build on the successes and strengths of the 2002 conference, and will confirm AAMAS as a key event on the international computing research calendar.AAMAS-03 received 466 submissions, from 30 countries across the globe. The 33 members of the senior program committee recruited 178 program committee members to handle the reviewing process. Each paper was reviewed by at least three program committee members, with some submissions selected for publication as full papers, and some selected for presentation as posters. The acceptance rate for full papers was 24.7%: low enough to ensure high quality, yet high enough to include a variety of topics and perspectives. The acceptance rate for full papers and posters together was 56.9%. Full papers were accepted from 19 countries, and posters from 21 countries. This proceedings volume includes full papers, and poster summaries. The AAMAS conference is a merger of three highly successful related events: The International Conference on Autonomous Agents (AGENTS); The International Conference on Multi-Agent Systems (ICMAS); and The International Workshop on Agent Theories, Architectures, and Languages (ATAL).We trust that these proceedings will do justice to the rich scientific and technological heritage of these three founding organisations, and we hope that you will enjoy reading the proceedings as much as we enjoyed preparing them.
Efficient Parallel Algorithms for Multi-Dimensional Matrix Operations'
Authors: Jen-Shiuh Liu, Jiun-Yuan Lin, Yeh-Ching Chung
Venue: Proceedings of the 2000 International Symposium on Parallel Architectures, Algorithms and Networks (2000)

Matrix operations are the core of many linear systems. Efficient matrix multiplication is critical to many numerical applications, such as climate modeling, molecular dynamics, computational fluid dynamics and etc. Much research work has been done to improve the performance of matrix operations. However, the majority of these works is focused on two-dimensional (20) matrix. Very little research work has been done on three or higher dimensional matrix. Recently, a new structure called Extended Karnaugh Map Representation (EKMR) for n-dimensional (nD) matrix representation has been proposed, which provides better matrix operations performance compared to the Traditional matrix representation (TMR). The main idea of EKMR is to represent any nD matrix by 2D matrices. Hence, efficient algorithms design for nD matrices becomes less complicated. Parallel matrix operation algorithms basedon EKMR and TMR are presented. Analysis and experiments are conducted to assess their performance. Both our analysis and experimental result show that parallel algorithms based on EKMR outperform those based on TMR.
From Monolithic to Modular Formal Specification
Authors: Gordon Rose
Venue: Proceedings of the Second IEEE International Conference on Formal Engineering Methods (1998)

Formal specification using mathematical text provides a sound basis for developing complex systems, especially safety-critical systems. The paper discusses three formal specification styles for state-based systems from monolithic, through Z, to modular, each illustrated by the same simple example. In each case, formal text which is left implicit in practice is identified and discussed.The paper includes a denotational semantics for operations within a modular system, including their conjunctive, parallel, choice and sequential composition. The importance of extending the semantics to unwritten formal text implicit in Z and modular style specifications is emphasised because misinterpretation of the implicit can have serious consequences.
An Analytical Modeling of Handoff for Integrated Voice/Data Wireless Networks with Priority Reservation and Preemptive Priority Procedures
Authors: Qing-An Zeng, Dharma P. Agrawal
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

In this paper, we propose an analytical modeling for integrated voice/data wireless networks with priority reservation and preemptive priority procedures. In our scheme, calls are separated into three different classes: originating calls (including originating voice and data calls), voice handoff and data handoff request calls. In the proposed scheme, there is a queue for data handoff request calls. Some number of channels in each cell are reserved exclusively for handoff request calls. Out of this number of channels, some are reserved exclusively for the voice handoff request calls. The remaining channels are shared by both the originating and handoff request calls. More priority is given to voice handoff request calls over the data handoff request calls. That is, the right to preempt the service of data is given to a voice handoff request call if on arrival it finds no free channels. The interrupted data call returns to the queue. A three-dimensional Markov chain models the system. A method of numerical analysis of the system performance is presented to estimate blocking probabilities of originating calls and forced termination probability of voice handoff requests calls. Forced termination probability of voice handoff request calls can be decreased by increasing the number of reserved channels. There is no transmission failure of data handoff request except for the negligibly small blocking probability because a data handoff request can be transferred from a queue of one base station to another. Average transmission delay and average queue length of data handoff requests calls are also evaluated.
Jython Essentials: Rapid Scripting in Java, 1 edition
Authors: Samuele Pedroni, Noel Rappin
Venue:  (2002)

:Jython is an implementation of the Python programming language written in 100% pure Java, so it runs under any compliant Java Virtual Machine. The secret to Jython's popularity lies in the combination of Java's libraries and tools, with Python's rapid development capabilities. With Jython, you can write Python programs that integrate seamlessly with any Java code. And like Python, Jython can be used interactively, so you can get immediate results as you are programming. Jython Essentials provides a solid introduction to the Python language, offering a brief but thorough tour of the Python concepts you'll need to understand to use Jython effectively. The book makes frequent comparisons between Python and Java, with special emphasis on the different object-oriented semantics of the two languages, so Java programmers can quickly get up to speed with Jython. Jython Essentials also covers the various ways in which Jython and Java can interact. For example, Jython code can create instances of preexisting Java classes and call methods in those instances. You can write Jython classes that are direct subclasses of existing Java classes and use introspection to discern the capabilities of JavaBeans components. This book provides examples of how to use Jython with existing Java libraries, including the Swing GUI toolkit, the JDBC database API, the Servlet API, and various XML tools. And finally, the book shows how Jython can be used as a scripting language within a Java program. With Jython Essentials, you have everything you need to start creating applications that mix the best of Python's interactivity and Java's robust libraries.
The Importance of Being Mobile: Some Social Consequences of Wearable Augmented Reality Systems
Authors: Steven K. Feiner
Venue: Proceedings of the 2nd IEEE and ACM International Workshop on Augmented Reality (1999)

What are the consequences of mobility for augmented reality? This brief paper explores some of the issues that I believe will be raised by the development and future commonplace adoption of mobile, wearable, augmented reality systems. These include: social influences on tracking accuracy, the importance of appearance and comfort, an increase in collaborative applications, integration with other devices, and implications for personal privacy.
Actions with Duration and Constraints: the Ramification Problem in Temporal Databases
Authors: Nikos Papadakis, Dimitris Plexousakis
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

The ramification problem is a hard and ever present problem in systems exhibiting a dynamic behavior. The area of temporal databases in particular is still lacking satisfactory solutions to the ramification problem. In this paper, we address the ramification problem based on causal relationships that take time into account. We study the problem for both instantaneous actions and actions with duration. The proposed solution advances previous work by consideringactions with effects occurring in any of the possible future situations resulting from an action's execution.
Waitfree distributed memory management by Create, and Read Until Deletion (CRUD)
Authors: Wim H. Hesselink, Jan F Groote
Venue:  (1998)

The acronym CRUD represents an interface specification and an algorithm for the management of memory shared by concurrent processes. The memory cells form a directed acyclic graph. This graph is only modified by adding a new node with a list of reachable children, and by removing unreachable nodes. If memory is not full, the algorithm ensures waitfree redistribution of free nodes. It uses atomic counters for reference counting and consensus variables to ensure exclusive access. Performance is enhanced by using nondeterminacy guided by insecure knowledge. Experiments indicate that the algorithm is very suitable for multiprocessing.
The influence of Hertzian spring stiffness on the dynamic response of a bridge model
Authors: M. Majka, M. Hartnett, D. O'Dwyer
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

The influence of Hertzian springs stiffness on the dynamic response of railway bridge in interactive train-track-bridge model is presented in this paper.A numerical bridge-train load response model has recently been developed by the authors. Numerical time-stepping is performed using the Runge-Kutta technique. Hertzian springs were used to simulate the contact phenomenon between rolling stock wheels and rails in order to calculate the interaction forces between these components.The stiffness of Hertzian springs has a significant impact on the size of time step used in the Runge-Kutta method. The influence of springs stiffness was investigated in order to improve the program efficiency, asses sensitivity of results to the spring stiffness and to make a solution less time consuming.The Boyne Viaduct, Drogheda, Ireland model was tested. Dimensionless parameters were used to demonstrate the effects of stiffness variations.
Technical Challenges of Protecting Digital Entertainment Content
Authors: C. Brendan S. Traw
Venue: Computer (2003)

The technology of a decade ago made digital copying and redistribution of entertainment content generally infeasible. Today, personal computers offer a platform that lets consumers easily alter a manufacturer's functionality defeating measures to protect content brought into the PC's open, reprogrammable environment.Thus, content-protection technology now plays an important role in creating an environment conducive to the long-term success of businesses based on digital information. While solutions based on a combination of technological and licensing mechanisms can effectively protect valuable entertainment assets from unauthorized copying and redistribution, they have limitations.
Bipartite Steinhaus Graphs
Authors: B. DasGupta, M. Furer
Venue:  (1995)

Steinhaus graphs are simple undirected graphs in which the first row of the adjacency matrix A=(a_{r,s}) (excluding the very first entry which is always 0) is an arbitrary sequence of zeros and ones and the remaining entries in the upper triangular part of A are defined by a_{r,s} = ((a_{r-1,s-1} + a_{r-1,s})) mod 2 (for 2 >= r > s >= n). Such graphs have already been studied for their various properties. In this paper we characterize bipartite Steinhaus graphs, and use this characterization to give an exact count as well as linear upper and lower bounds for the number of such graphs on n vertices. These results answer affirmatively some questions posed by W.M. Dymacek (Discrete Mathematics, 59 (1986) pp. 9-20).
KD Tree Simulator
Authors: Ed Grosz
Venue:  (1986)

This MFS formatted disk contains an animation program for illustrating KD-Trees (D-dimensional search trees) (actually, only 2 dimensions are shown). Both the runnable application and the Lisa Object Pascal/MacApp sources are included. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
How to Do Everything with PhotoShop 7, 1 edition
Authors: Laurie McCanna
Venue:  (2002)

:Harness the power of Photoshop to create beautiful looking images effortlessly. Tackle common problems and technical issues, edit and enhance existing artwork -- plus experiment with new ideas and methods to create entirely new visual scenes and schemas. Familiarize yourself with the Photoshop interface and tool palette, then follow along as author Laurie McCanna expertly guides you, in friendly, easy-to-understand language, through all the major functions of this amazing graphics application. Includes helpful advice on keyboard shortcuts, Photoshop Actions, and the history palette. How to Do Everything with Photoshop 7 will help you discover new worlds of artistic splendor and Web-ready visual wizardry. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player