ppxscal/embedding_network huggingface dataset:
Syntactic Approximation Using Iterative Lexical Analysis
Venue: Proceedings of the 11th IEEE International Workshop on Program Comprehension (2003)

Syntactic irregularities, which often occur in source-code undergoing maintenance, prevent the application of analysis and comprehension tools that employ traditional parsing technique. As an alternative to parsing, we have developed an iterative lexical technique that is based on the repetitive application of regular expresssions using a shortest-match strategy. The approach recognize syntactic element using iterative refinement, where unambiguous constructs are identified to provide contextual cues for the identification of more ambiguous constructs. The use of a shortest-match strategy support the bottomup construction of a syntax tree by identifying smaller subtrees first. To examine the technique's effectiveness, we present the results of an experiment comparing iterative lexical analysis against parsing. The measure of precision and recall are used to evaluate and compare the two approaches.
Boolean Query Formulation with Relevance Feedback
Authors: Gerard Salton, Edward A. Fox, Chris Buckley, Ellen M. Voorhees
Venue:  (1983)

The well-known relevance feedback process uses information extracted from previously retrieved relevant documents to generate improved search formulations for subsequent search iterations. Methods are outlined in this study for the automatic generation of Boolean search statements based on the natural language texts of initially available search requests and of previously retrieved document excerpts identified as relevant by the user population. The search requests are generated both in a conventional Boolean system and in an extended system in which the normal interpretation of the Boolean connectives is relaxed. Experimental output is included which shows that substantial improvements in retrieval effectiveness are obtainable using the automatic relevance feedback methods.
Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared Memory Machines
Authors: Gianfranco Bilardi, Alexandru Nicolau
Venue:  (1986)

We propose a parallel algorithm, called adaptive bitonic sorting, which runs on a PRAC, a shared-memory multiprocessor where fetch and store conflicts are disallowed. On a $P$ processors PRAC, our algorithm achieves optimal performance $TP = O(N \log N)$, for any computation time $T$ in the range $\Omega (\log^{2} N) \leq T \leq O(N \log N)$. Adaptive bitonic sorting has also a small constant factor, since it performs less than $2N \log N$ comparisons, and only a handful of operations per comparison.
Web Programming Made Simple: HTML, CSS, JavaScript, and DHTML
Venue:  (2003)

:WEB PROGRAMMING MADE SIMPLE is a practical tutorial to an assortment of essential Web programming tools. Systematic and clearly written, the book teaches readers how to code basic Web pages, manage them efficiently, and make them visually dynamic. The author begins with a specific task or end result, shows the code that produces that result, and then takes the code apart to explain its function. With an emphasis on demonstrating how these tools work instead of merely offering cut-and-paste solutions, this book shows even the absolute beginner how to be a good Web programmer. The book is supported online at HTML4ME.COM, where readers can download the code archive from the book. 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
An implementation of the revised internet stream protocol (ST-2)
Authors: Pink Stephen, Craig Partridge
Venue:  (2001)

ST-2 is a revision of an experimental protocol designed to support applications which require guaranteed network services. ST-2 provides mechanisms for creating streams, tree-shaped delivery paths with performance guarantees, for applications which require such guarantees. As part of the MultiG project, the authors implemented ST-2 in the BSD system. The twin goals of this implementation were to see how easily a novel protocol like ST-2 could be incorporated into the BSD networking model and, more importantly, to thoroughly evaluate the ST-2 protocol. Our conclusions are that the BSD model proved quite general, requiring only modest changes (changes which were largely invisible to the application), but that the ST-2 protocol itself needs some reworking.
Toward Compiler Optimization of Distributed Real-Time Processes
Authors: Mohamed F. Younis, Thomas J. Marlowe, Grace Tsai, Alexander D. Stoyenko
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

Compiler optimization techniques have been applied to facilitate development and performance tuning of non-real-time systems. Unfortunately, regular compiler optimization can complicate the analysis and destroy timing properties of real-time systems. This paper discusses the difficulties of performing compiler optimization in distributed real-time systems. An algorithm is presented to apply machine-independent compiler optimization safely to distributed real-time systems. The algorithm uses resources' busy-idle profiles to investigate effects of optimizing one process on other processes. A restricted form of resource contention is assumed to simplify the analysis.
Handwritten Text Recognition Through Writer Adaptation
Authors: Ali Nosary, Thierry Paquet, Laurent Heutte, Ameur Bensefia
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

Handwritten text recognition is a problem rarely studied out of specific applications for which lexical knowledge can constrain the vocabulary to a limited one. In the case of handwritten text recognition, additional information can be exploited to characterize the specificity of the writing. This knowledge can help the recognition system to find coherent solutions from boththe lexical and the morphological points of view. We present the principles of a handwritten text recognition system based on the on-line learning of the writer shapes. The proposed scheme is shown to improve the recognition rates on a sample of fifteen writings, unknown to the system.
Hybrid object-oriented real-time software development with VDM/sup ++/
Authors: J. Van Katwijk, E. Durr, S. Goldsack
Venue: Proceedings of the 1st International Conference on Formal Engineering Methods (1997)

VDM/sup ++/ is a formal object oriented specification language, which extends VDM by providing object-orientation as well as real-time and parallel features. The use of the language is supported by an extensive toolset and design guidelines. The former offers graphical representations, syntactic and semantic checking, pretty printing and code generation. The latter aim at presenting guidelines for modelling and subsequent development. We argue that, despite its formal character, VDM/sup ++/ is a practically applicable vehicle for software development for real-time control systems. An outline specification case study is included.
A Flexible Generator Architecture for Improving Software Dependability
Authors: Christof Fetzer, Zhen Xiao
Venue: Proceedings of the 13th International Symposium on Software Reliability Engineering (2002)

Improving the dependability of computer systems is increasinglyimportant as more and more of our lives dependon the availability of such systems. Wrapping dynamic linklibraries is an effective approach for improving the reliabilityand security of computer software without sourcecode access. In this paper we describe a flexible frameworkto generate a rich set of software wrappers for sharedlibraries. We describe the architecture of the wrapper generator,the problems of how to generate wrappers efficiently,and our solutions to these problems. Based on a set of propertiesdeclared for a function, the generator can create a varietyof wrappers to suit the diverse requirements of applicationprograms. Performance measurements indicate thatthe overhead of the generated wrappers is small. Keywords: wrappers, wrapper generator, software fault-tolerance,middleware, reliability, security.
Once-and-for all management protocol (OFMP)
Authors: S. S. Kulkarni, A. Arora
Venue: Proceedings of the 1997 International Conference on Network Protocols (ICNP '97) (1997)

OFMP is a hierarchical, network management protocol that enables group operations to be executed on the management information bases of all nodes in the group. As long as no faults occur, OFMP ensures that all nodes execute their local operation exactly once in each group operation. If "immediately-detectable" faults occur, it ensures masking fault-tolerance; i.e., all non-failed nodes execute their local operation exactly once in each group operation. And, if "eventually-detectable" faults occur, it ensures stabilizing fault-tolerance; i.e., it eventually converges to a state from where all non-failed nodes execute their local operation exactly once in each subsequent group operation. Of special note is the ability of OFMP to detect using only a bounded amount of memory whether nodes have executed in same group operation, in a manner that masks immediately-detectable faults and stabilizes from eventually-detectable faults.
Deciding Isomorphisms of Simple Types in Polynomial Time
Authors: Jeffrey Considine
Venue:  (2000)

Abstract The isomorphisms holding in all models of the simply typed lambda calculus with surjective and terminal objects are well studied - these models are exactly the Cartesian closed categories. Isomorphism of two simple types in such a model is decidable by reduction to a normal form and comparison under a finite number of permutations (Bruce, Di Cosmo, and Longo 1992). Unfortunately, these normal forms may be exponentially larger than the original types so this construction decides isomorphism in exponential time. We show how using space-sharing/hash-consing techniques and memoization can be used to decide isomorphism in practical polynomial time (low degree, small hidden constant). Other researchers have investigated simple type isomorphism in relation to, among other potential applications, type-based retrieval of software modules from libraries and automatic generation of bridge code for multi-language systems. Our result makes such potential applications practically feasible.
Practical explicit binding interface for supporting multiple transport protocols in a CORBA system
Authors: T. Nakajima
Venue: Proceedings of the 2000 International Conference on Network Protocols (2000)

This paper proposes an extension to the standard CORBA interfaces to support explicit binding. The extended interface enables a program to select a suitable transport protocol for each method invocation, and it provides a flexible and versatile framework to control various transport protocols. The interface is compatible with the object model of CORBA, and it is carefully designed to take into account the portability of an application to other CORBA implementations. The extended interface has implemented in omniORB2, which is a CORBA 2.0 compliant system that has been developing at AT&T; Laboratories, Cambridge.
A new scheduling strategy for NUMA multiprocessor systems
Authors: Guan-Joe Lai, Cheng Chen
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

This study examined the impact of multiprocessor scheduling strategies on the performances of non-uniform memory access (NUMA) shared-memory multiprocessor systems. A new scheduling algorithm named the Longest Extended Critical Path First (LECPF) algorithm is proposed here. The proposed algorithm schedules parallel tasks by considering complex communication options and the contentions of shared communication resources. It also ensures performance within a factor of two of the optimum for general directed acyclic task graphs (DATGs). Experimental results show the superiority of the LECPF algorithm over that of scheduling algorithms in the literature.
USING SOFTWARE DESIGN PATTERNS TO BUILD DISTRIBUTED ENVIRONMENTAL MONITORING APPLICATIONS
Authors: Dag Johansen, Werner Vogels
Venue:  (1997)

Tools developers face the challenge of exposing a development methodology to users while concealing details of the underlying system. If that system is complex and subject to evolution, this problem can be particularly difficult. Here, we discuss the use of software design patterns in conjunction with StormCast, a system of tools developed to support environmental and weather monitoring tasks in the Arctic. Now entering its 5th generation, each version of StormCast has expanded the capabilities of the underlying distributed data management tools and computational facilities. This paper reviews StormCast 5.0, presents the design patterns used by developers, and describes several applications in terms of the application of these patterns.
Analyzing the application ASP concept: technologies, economies, and strategies
Authors: Kenneth R. Walsh
Venue: Communications of the ACM (2003)

The application service provider model can realize economies of scale in managing hardware, software, and personnel resources, but this new concept also introduces uncertainty as it redistributes responsibilities among organizations.
Mobile extensions to RSVP
Authors: D. O. Awduche, E. Agu
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

RSVP (resource reservation protocol) is a receiver oriented resource reservation setup protocol targeted for integrated services packet networks (ISPNs). RSVP has a number of desirable attributes which make it a leading candidate for Internet standardization. These attributes include flexibility, robustness, and scalability. However, RSVP does not adequately address the issue of resource reservation for mobile hosts. This paper highlights the limitations of RSVP in mobile environments and proposes extensions to obviate these deficiencies. The basic characteristics of the proposed augmentations include: (1) quiescent resource reservations, (2) virtual receivers, (3) intelligent pre-allocation of resources based on analysis of user mobility patterns, and (4) predictive look-ahead dynamic dormant multicast trees.
Adaptive Methoden in computerbasierten Lehr/Lernsystemen LOCTITLE:: Adaptive Methoden in computerbasierten Lehr/Lernsystemen
Authors: Marcus EMAIL Specht
Venue:  (1998)

The ability of human teachers to adapt the teaching process to features of the individual learner is one of the key factors for effective teaching and learning. Individualized instruction utilizes adaptive methods for the optimization of the learning process and its outcome. Adaptive methods and their effective variation and integration in learning environments are the subject of this work. In the first part a schema for the classification of adaptive methods consisting of four dimensions is introduced: The means of adaptation (What is adapted?), the content of the adaptation (What is the criteria for adaptation?), the process of adaptation (How does the system adapt?), and the aim of the adaptation (Why does the system adapt? ). Based on this schema recent works from the fields of adaptive hypermedia, intelligent multimedia, adaptive user interfaces, and intelligent tutoring systems are analysed. In the second part empirical studies that evaluate several variations of adaptive methods are described. The results show the complex interaction of adaptive methods and learner features and give some starting points for effective integration of adaptive methods in learning environments. The systems and experiments from the empirical part can be found in the WWW (http://www.psycholog ie.uni-trier:8000/TLserv.html). LOCLANGUAGE:: German LOC :: Die Leistung menschlicher Lehrer, die ihre Lehrmethoden und -inhalte an den Wissensstand, die Interessen, die Mglichkeiten oder die Motivationslage usw. von Lernenden anpassen knnen, ist wohl als eine zentrale Komponente erfolgreichen Lehrens und Lernens anzusehen. Eine Berucksichtigung solch ?adaptiver MethodenO bei der Entwicklung von Lernsoftware knnte adaptive Lehr/Lernsoftware effizienter und effektiver machen. Die Dissertation setzt sich mit dem Konzept der Adaptivitat im Kontext des Lehrens und Lernens mit Computern auseinander. Sie klassifiziert bestehende Arbeiten zu adaptiven Lehr/Lernmethoden aufgrund von vier zentralen Dimensionen: Adaptionsmittel (Was wird angepa?t? ), Adaptionsinformation ( Woran wird angepa?t?), Adaptionsproze? (Wie wird angepa?t?), Adaptionsziel (Warum wird angepa?t?). Neuere Arbeiten zu adaptiven Systemen aus den Bereichen adaptiver Benutzerschnittstellen, adaptivem Hypermedia oder intelligentes Multimedia werden auf dieser Basis durchleuchtet und empirische Studien und Exprimente zum Einflu? adaptiver Methoden auf den Lernproze? vorgestellt. Die vorgestellten Studien basieren zum Teil auf zwei adaptiven Lehr/Lernsystemen, welche im WWW abrufbar (http://www.psychologie.uni-trier:8000/TLserv.html) sind und unterschiedliche adaptive Methoden in ein Curriculum zur Statistik und zu Narkotika integrieren. Die empirischen Untersuchungen weisen auf die komplexen Abhangigkeiten und Interaktionen der Dimensionen adaptiver Methoden hin und zeigen Wege zum er
Do artificial ants march in step? ordered asynchronous processes and modularity in biological systems
Authors: David Cornforth, David G. Green, David Newth, Michael Kirley
Venue: Proceedings of the eighth international conference on Artificial life (2002)

Processes that occur in many biological systems are not synchronous, but are governed by asynchronous updating. Although some previous models of multi agent systems have incorporated asynchronous updating in an informal or implicit way, the importance of asynchronous behaviour has been largely overlooked. However, the update scheme chosen is very important in determining the overall system behaviour. We illustrate this point using several updating schemes in simple models. The implication is that care should be given to selecting an update scheme that is appropriate for the modelling application. We also observe that certain ordered asynchronous processes play a role in emergent modularity: an important process in the evolution of complexity in living systems.
Numerical Methods for the Hydrodynamic Device Model: Subsonic Flow
Authors: L C Gardner, J D Rose, W J Jerome
Venue:  (1988)

An introduction to the hydrodynamic model for semiconductor devices is presented. Special attention is paid to classifying the hydrodynamic PDEs and analyzing their nonlinear wave structure. Numerical simulations of the ballistic diode using the hydrodynamic device model are presented, as an illustrative elliptic problem. The importance of nonlinear block iterative methods is emphasized. Arguments for existence of solutions and convergence of numerical methods are given for the case of subsonic electron flow.
Object Recognition from Local Scale-Invariant Features
Authors: David G. Lowe
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

An object recognition system has been developed that uses a new class of local image features. The features are invariant to image scaling, translation, and rotation, and partially invariant to illumination changes and affine or 3D projection.These features share similar properties with neurons in inferior temporal cortex that are used for object recognition in primate vision. Features are efficiently detected through a staged filtering approach that identifies stable points in scale space. Image keys are created that allow for local geometric deformations by representing blurred image gradients in multiple orientation planes and at multiple scales.The keys are used as input to a nearest-neighbor indexing method that identifies candidate object matches. Final verification of each match is achieved by finding a low-residual least-squares solution for the unknown model parameters. Experimental results show that robust object recognition can be achieved in cluttered partially-occluded images with a computation time of under 2 seconds.
Algorithms for matrix groups and the Tits alternative
Authors: Robert Beals
Venue:  (1995)

Tits has shown that a finitely generated linear group either contains a nonabelian free group or has a solvable subgroup of finite index. We give a polynomial time algorithm for deciding which of these two conditions holds for a given finitely generated matrix group over an algebraic number field. Noting that many computational problems are undecidable for groups with nonabelian free subgroups, we investigate the complexity of problems relating to linear groups with solvable subgroups of finite index. For such a group G, we are able in polynomial time to compute a homomorphism phi such that phi(G) is a finite matrix group and the kernel of phi is solvable. If in addition G has a nilpotent subgroup of finite index, we obtain much stronger results. These include an effective encoding of elements of G such that the encoding length of an element obtained as a product of length L over the generators is 0(log L) times a polynomial in the input length. This result is the best possible; it has been shown by Tits and Wolf that if a finitely generated matrix group does not have a nilpotent subgroup of finite index, then the number of group elements expressible as words of length L over the generators grows as c^L for some constant c<1 depending on G. For groups with abelian subgroups of finite index, we obtain a Las Vegas algorithm for several basic computational tasks including membership testing and computing a presentation. This generalizes recent work of Beals and Babai, who give a Las Vegas algorithm for the case of finite groups, as well as recent work of Babai, Beals, Cai, Ivanyos, and Luks, who give a deterministic algorithm for the case of abelian groups.
How to specify usability requirements?
Authors: Martin Maguire, Nigel Bevan
Venue: Proceedings of the 1st European UPA conference on European usability professionals association conference - Volume 3 (2002)

Reviews approaches to sepcifying usability requirements that are practical, testable and effective. Participants will be invited to offer their experiences and will work on case study examples of requirement specification in different contexts.
Python tutorial
Authors: Guido Rossum
Venue:  (1995)

Python is a simple, yet powerful programming language that bridges the gap between C and shell programming, and is thus ideally suited for ``throw-away programming'''' and rapid prototyping. Its syntax is put together from constructs borrowed from a variety of other languages; most prominent are influences from ABC, C, Modula-3 and Icon. The Python interpreter is easily extended with new functions and data types implemented in C. Python is also suitable as an extension language for highly customizable C applications such as editors or window managers. Python is available for various operating systems, amongst which several flavors of UNIX, Amoeba, the Apple Macintosh O.S., and MS-DOS. This tutorial introduces the reader informally to the basic concepts and features of the Python language and system. It helps to have a Python interpreter handy for hands-on experience, but as the examples are self-contained, the tutorial can be read off-line as well. For a description of standard objects and modules, see the Python Library Reference manual. The Python Reference Manual gives a more formal definition of the language.