ppxscal/embedding_network huggingface dataset:
Research at U. of Cambridge
Authors: K. Sparck Jones, B. K. Boguraev, J. I. Tait
Venue: Issue 79 (January 1982) (1982)

Research here is focussed on semantic aspects of language processing. Current projects are concerned with natural language access to databases. Their specific aim is question interpretation relying on the use of general semantics. This implies word and text characterisation by formulae and patterns involving general semantic category and relation primitives. This work follows earlier research on approaches to the determination, representation and exploitation of text meaning making use, in different ways, of semantic primitives and patterns, which were investigated in systems for sentence paraphrase, story understanding, and summary generation.
Storage-free terrain simulation
Authors: Maurice Danaher, Warren Creemers
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

This paper presents a method for simulating terrain by visualising landscape data in real-time. Current storage-based simulators are limited in the size and detail of the terrain that they can produce due to the storage of the terrain data on the hard disk. A method for terrain simulation is presented that is "storage-free". The method has been implemented in a simulator and the results produced are compared with two popular simulation programs. While the execution as expected is slower the map sizes produced are enormous in comparison to the others.
Applications of dynamic proxies in distributed environments
Authors: Youssef Hassoun, Roger Johnson, Steve Counsell
Venue: Software&mdash;Practice Experience (2005)

In object-oriented programming (OOP), proxies are entities that act as an intermediary between client objects and target objects. Dynamic proxies can be used to construct distributed systems that support the open implementation approach and promote code reuse. The OO paradigm supports code reuse through various ways including inheritance, polymorphism and aggregation. In this paper, we adopt a definition of software reuse restricted to reuse of code components and address the question of constructing distributed systems based on dynamic proxies. Different networking techniques and programming paradigms such as Java's Remote Method Invocation (RMI), the Common Object Request Broker Architecture (CORBA) and Java Servlets are used to implement the distributed client/server architecture.
A Finite Element Variational Multiscale Method for the Navier-Stokes Equations
Authors: Volker John, Songul Kaya
Venue: SIAM Journal on Scientific Computing (2005)

This paper presents a variational multiscale method (VMS) for the incompressible Navier--Stokes equations which is defined by a large scale space LH for the velocity deformation tensor and a turbulent viscosity $\nu_T$. The connection of this method to the standard formulation of a VMS is explained. The conditions on LH under which the VMS can be implemented easily and efficiently into an existing finite element code for solving the Navier--Stokes equations are studied. Numerical tests with the Smagorinsky large eddy simulation model for $\nu_T$ are presented.
Mastermind in SIGART
Authors: Roy Rada
Venue: Issue 89 (July 1984) (1984)

Three articles about Mastermind (MM) have appeared in the SIGART Newsletter in the past 2 years. Each paper presents a different strategy for MM but only one gives a non-anecdotal assessment of performance. None of the papers seriously address the issue of what would be an optimal strategy of MM.
A study of initialization in Linux and OpenBSD
Authors: Catherine Dodge, Cynthia Irvine, Thuy Nguyen
Venue: ACM SIGOPS Operating Systems Review (2005)

The code that initializes a system can be notoriously difficult to understand. In secure systems, initialization is critical for establishing a starting state that is secure. This paper explores two architectures used for bringing an operating system to its initial state, once the operating system gains control from the boot loader. Specifically, the ways in which the OpenBSD and Linux operating systems handle initialization are dissected.
New York University: description of the PROTEUS system as used for MUC-3
Authors: Ralph Grishman, John Sterling, Catherine Macleod
Venue: Proceedings of the 3rd conference on Message understanding (1991)

The PROTEUS system which we have used for MUC-3 has three main components: a syntactic analyzer, a semantic analyzer, and a template generator.
Comparing point clouds
Authors: Facundo Mémoli, Guillermo Sapiro
Venue: Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing (2004)

Point clouds are one of the most primitive and fundamental surface representations. A popular source of point clouds are three dimensional shape acquisition devices such as laser range scanners. Another important field where point clouds are found is in the representation of high-dimensional manifolds by samples. With the increasing popularity and very broad applications of this source of data, it is natural and important to work directly with this representation, without having to go to the intermediate and sometimes impossible and distorting steps of surface reconstruction. A geometric framework for comparing manifolds given by point clouds is presented in this paper. The underlying theory is based on Gromov-Hausdorff distances, leading to isometry invariant and completely geometric comparisons. This theory is embedded in a probabilistic setting as derived from random sampling of manifolds, and then combined with results on matrices of pairwise geodesic distances to lead to a computational implementation of the framework. The theoretical and computational results here presented are complemented with experiments for real three dimensional shapes.
Scalable consistency maintenance for edge query caches: exploiting templates in web applications
Authors: Khalil Amiri, Sara Sprenkle, Renu Tewari, Sriram Padmanabhan
Venue: Web content caching and distribution: proceedings of the 8th international workshop (2004)

Semantic database caching is a self-managing approach to dynamic materialization of "semantic" slices of back-end databases on servers at the edge of the network. It can be used to enhance the performance of distributed Web servers, information integration applications, and Web applications of oaded to edge servers. Such semantic caches often rely on update propagation protocols to maintain consistency with the back-end database system. However, the scalability of such update propagation protocols continues to be a major challenge. In this paper, we focus on the scalability of update propagation from back-end databases to the edge server caches. In particular, we propose a publish-subscribe like scheme for aggregating cache subscriptions at the back-end site to enhance the scalability of the ltering step required to route updates to the target caches. Our proposal exploits the template-rich nature of Web applications and promises signi cantly better scalability. In this paper, we describe our approach, discuss the tradeoffs that arise in its implementation, and estimate its scalability compared to naive update propagation schemes.
Characterization of a sequentially consistent memory and verification of a cache memory by abstraction
Authors: Susanne Graf
Venue: Distributed Computing (1999)

The contribution of the paper is two-fold. We give a set of properties expressible as temporal logic formulas such that any system satisfying them is a sequentially consistent memory, and which is sufficiently precise such that every reasonable concrete system that implements a sequentially consistent memory satisfies these properties.Then, we verify these properties on a distributed cache memory system by means of a verification method, based on the use of abstract interpretation which has been presented in previous papers and so far applied to finite state systems. The motivation for this paper was to show that it can also be successfully applied to systems with an infinite state space.This is a revised and extended version of [Gra94].
A test circuit for pin shorts generating oscillation in CMOS logic circuits
Authors: Masahiro Ichimiya, Masaki Hashizume, Hiroyuki Yotsuyanagi, Takeomi Tamesada
Venue: Systems and Computers in Japan (2004)

When a CMOS logic IC is soldered on a printed circuit board, a pin short may occur. When the fault is excited, logical oscillation may be generated at the location where the fault occurs. In this paper, the authors propose a test method based on supply current of a logic circuit and a test circuit to detect a fault in the logic circuit that generates logical oscillation. They show by some experiments that a fault that generates oscillation when the fault is excited will be detected with the test circuit. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(13): 10&ndash;20, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10604
Efficient Exploration of On-Chip Bus Architectures and Memory Allocation
Authors: Sungchan Kim, Chaeseok Im, Soonhoi Ha
Venue: Proceedings of the international conference on Hardware/Software Codesign and System Synthesis: 2004 (2004)

Separation between computation and communication in system design allows the system designer to explore the communication architecture independently of component selection and mapping. In this paper we present an iterative two-step exploration methodology for bus-based on-chip communication architecture and memory allocation, assuming that memory traces from the processing elements are given from the mapping stage. The proposed method uses a static performance estimation technique to reduce the large design space drastically and quickly, and applies a trace-driven simulation technique to the reduced set of design candidates for accurate performance estimation. Since local memory traffic as well as shared memory traffic are involved in bus contention, memory allocation is considered as an important axis of the design space in our technique. The viability and efficiency of the proposed methodology are validated by two real-life examples, 4-channel digital video recorder (DVR) and an equalizer for OFDM DVB-T receiver.
Dynamics of learning-induced cellular modifications in the cortex
Authors: Edi Barkai
Venue: Biological Cybernetics (2005)

This aim of this review is to describe the dynamics of learning-induced cellular modifications in the rat piriform (olfactory) cortex after olfactory discrimination learning and to describe their functional significance to long-term memory consolidation. The first change to occur is in the intrinsic properties of the neurons. One day after learning, pyramidal neurons show enhanced neuronal excitability. This enhancement results from reduction in calcium-dependent conductance that mediates the post burst after-hyperpolarization. Such enhanced excitability lasts for 3 days and is followed by a series of synaptic modifications. Several forms of long-term enhancement in synaptic connections between layer II pyramidal neurons in the piriform cortex accompany olfactory learning. Enhanced synaptic release is indicated by reduced paired-pulse facilitation. Post-synaptic enhancement of synaptic transmission is indicated by reduced rise time of post-synaptic potentials and formation of new synaptic connections is indicated by increased spine density along dendrites of these neurons. Such modifications last for up to 5 days. Thus, olfactory discrimination rule learning is accompanied by a series of cellular modifications which occur and then disappear at different times. These modifications overlap partially, allowing the maintenance of the cortical system in a &#x2018;learning mode&#x2019; in which memories for specific odors can be acquired rapidly and efficiently. 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
On the degree of convergence of lemniscates in finite connected domains
Authors: Zhu Laiyi
Venue: Journal of Approximation Theory (2004)

For an arbitrary bounded closed set E in the complex plane with complement Ω of finite connectivity, we study the degree of convergence of the lemniscates in Ω.
2D Statistical Models of Facial Expressions for Realistic 3D Avatar Animation
Authors: Lukasz Zalewski, Shaogang Gong
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

We address the issue of modelling facial expressions for realistic 3D avatar animation. We introduce a hierarchical decomposition of a human face into different components and model them according to their intrinsic functionalities. The parametrisation of the expressions is achieved in a two-level framework. First level accounts for the low level component facial actions and is represented by hierarchical latent variable models. The second level models the final expressions as a combinations of subcomponent information extracted from the lower level using combinatorial logic. Finally we produce continuous animation curves that are used to animate 3D avatar in a morph-based fashion. Our approach is entirely based on 2D information extracted from the input source.
Engineering Ultimate Self-Protection in Autonomic Agents for Space Exploration Missions
Authors: Roy Sterritt, Mike Hinchey
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

NASAýs Exploration Initiative (EI) will push space exploration missions to the limit. Future missions will be required to be self-managing as well as self-directed, in order to meet the challenges of human and robotic space exploration. We discuss security and self-protection in autonomic agent based-systems, and propose the ultimate self-protection mechanism for such systems ¿ self-destruction. Like other metaphors in Autonomic Computing, this is inspired by biological systems, and is the analog of biological apoptosis. Finally, we discuss the role it might play in future NASA space exploration missions.
Software visualization
Authors: Stephan Diehl
Venue: Proceedings of the 27th international conference on Software engineering (2005)

This half-day tutorial gives an overview of the current state-of-the-art in software visualization. Software visualization encompasses the development and evaluation of methods for graphically representing different aspects of software, including its structure, its execution, and its evolution. In contrast to visual programming and diagramming for software design, software visualization is not so much concerned with the construction, but with the analysis of programs and their development process. Software visualization combines techniques from areas like software engineering, programming languages, data mining, computer graphics, information visualization and human-computer interaction. Topics covered in this tutorial include static program visualization, algorithm animation, visual debugging, as well as the visualization of the evolution of software. In particular we identify common principles illustrated by many examples and give pointers to tools available today.
Generalizing Inverse Perspective
Authors: Mohamed Kotb, Steven Beauchemin
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

Inverse perspective mapping schemes have been presented in the past as frameworks in which autonomous navigation could be performed on flat surfaces, using optical flow as the main percept. We propose a generalization of these models for uneven terrains.Given an inclinometer indicating the direction of gravity and some simple odometry parameters, the visual and positional information are combined to reconstruct the 3d elevation map of navigational surfaces within the visual field. Camera transformations are applied directly on the image plane.We provide noise and sensitivity analysis using random, zero-mean Gaussian noise to determine the robustness of the proposed model.
TIPS for organizing a local ACM-SIGNUM group
Authors: Richard J. Hanson
Venue: ACM SIGNUM Newsletter (1977)

Have you ever wanted to regularly meet with people having interests in numerical analysis? Perhaps forming a local ACM-SIGNUM group is the answer. What needs to be done to start such a group? This question often stymies people and kills the whole idea. Some of the major points that must be considered are these.
On Method for Uncertain Multiple Attribute Decision Making Problems with Uncertain Multiplicative Preference Information on Alternatives
Authors: Zeshui Xu
Venue: Fuzzy Optimization and Decision Making (2005)

The uncertain multiple attribute decision making (UMADM) problems are investigated, in which the information about attribute weights is known partly and the attribute values take the form of interval numbers, and the decision maker (DM) has uncertain multiplicative preference information on alternatives. We make the decision information uniform by using a transformation formula, and then establish an objective-programming model. The attribute weights can be determined by solving the developed model. The concept of interval positive ideal point of alternatives (IPIPA) is introduced, and an approach based on IPIPA and projection to ranking alternatives is proposed. The method can avoid comparing and ranking interval numbers, and can reflect both the objective information and the DM's subjective preferences.
Ending Spam: Bayesian Content Filtering and the Art of Statistical Language Classification
Authors: Jonathan A. Zdziarski
Venue:  (2005)

Join author John Zdziarski for a look inside the brilliant minds that have conceived clever new ways to fight spam in all its nefarious forms. This landmark title describes, in-depth, how statistical filtering is being used by next-generation spam filters to identify and filter unwanted messages, how spam filtering works and how language classification and machine learning combine to produce remarkably accurate spam filters. After reading Ending Spam, you'll have a complete understanding of the mathematical approaches used by today's spam filters as well as decoding, tokenization, various algorithms (including Bayesian analysis and Markovian discrimination) and the benefits of using open-source solutions to end spam. Zdziarski interviewed creators of many of the best spam filters and has included their insights in this revealing examination of the anti-spam crusade. If you're a programmer designing a new spam filter, a network admin implementing a spam-filtering solution, or just someone who's curious about how spam filters work and the tactics spammers use to evade them, Ending Spam will serve as an informative analysis of the war against spammers. TOC Introduction PART I: An Introduction to Spam Filtering Chapter 1: The History of Spam Chapter 2: Historical Approaches to Fighting Spam Chapter 3: Language Classification Concepts Chapter 4: Statistical Filtering Fundamentals PART II: Fundamentals of Statistical Filtering Chapter 5: Decoding: Uncombobulating Messages Chapter 6: Tokenization: The Building Blocks of Spam Chapter 7: The Low-Down Dirty Tricks of Spammers Chapter 8: Data Storage for a Zillion Records Chapter 9: Scaling in Large Environments PART III: Advanced Concepts of Statistical Filtering Chapter 10: Testing Theory Chapter 11: Concept Identification: Advanced Tokenization Chapter 12: Fifth-Order Markovian Discrimination Chapter 13: Intelligent Feature Set Reduction Chapter 14: Collaborative Algorithms Appendix: Shining Examples of Filtering Index
Application of neural networks for software quality prediction using object-oriented metrics
Authors: Mie Mie Thet Thwin, Tong-Seng Quah
Venue: Journal of Systems and Software (2005)

This paper presents the application of neural networks in software quality estimation using object-oriented metrics. In this paper, two kinds of investigation are performed. The first on predicting the number of defects in a class and the second on predicting the number of lines changed per class. Two neural network models are used, they are Ward neural network and General Regression neural network (GRNN). Object-oriented design metrics concerning inheritance related measures, complexity measures, cohesion measures, coupling measures and memory allocation measures are used as the independent variables. GRNN network model is found to predict more accurately than Ward network model.
Digital rights management & protecting the digital media value chain
Authors: Marvin L. Smith
Venue: Proceedings of the 3rd international conference on Mobile and ubiquitous multimedia (2004)

Digital media that is readily & illegally distributed over the Internet and related digital networks has posed major problems for the members of the digital media value chain. Ubiquitous mobile communication devices such as media capable handsets and PDAs have made the problem even larger.Technical approaches to controlling illegal distribution--- commonly known as Digital Rights Management (DRM)---have been varied and inconsistent since the shift from analogue media to digital media; but in recent years, the Open Mobile Alliance (OMA) has made huge contributions to the efforts to standardize the DRM effort, especially as it pertains to the sharing of media using mobile devices. The OMA has released DRM Enabler Release 1.0 and 2.0 DRM 1.0 was a first attempt to apply control to digital media and DRM 2.0 is a more sophisticated continuation of 1.0, allowing the owners of digital assets to control their use while attempting to provide the end user with the perceived rights and privileges acquired over the evolution of digital media. While challenges lay ahead for the developers of DRM, OMA DRM is a move toward better standardized control of digital media.
Artful systems in the home
Authors: Alex S. Taylor, Laurel Swan
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

In this paper we introduce the idea of organizing systems. Through a number of examples from an ongoing ethnographic study of family life, we suggest that organizing systems come about through the artful design and use of informational artifacts in the home, such as calendars, paper notes, to-do lists, etc. These systems are not only seen to organize household routines and schedules, but also, crucially, to shape the social relations between family members. Drawing attention to the material properties of informational artifacts and how assemblies of these artifacts come to make up organizing systems, we discuss some general implications for designing information technology for the home. Most importantly, we suggest that technologies must be designed to accommodate the rich and diverse ways in which people organize their homes, providing them with the resources to artfully construct their own systems rather than enforcing ones that are removed from their own experiences.
Developing dynamic-reconfigurable communication protocol stacks using Java: Research Articles
Authors: Yueh-Feng Lee, Ruei-Chuan Chang
Venue: Software&mdash;Practice Experience (2005)

This paper proposes the development of a dynamic-reconfigurable protocol stack, which allows the programmer to create, to remove, and to replace protocol modules during their operation. Moreover, this protocol stack also aims to preserve the module state, such as the data structures that manage the existing connections. To achieve these goals, a Java-based component framework is developed so that the programmers are able to implement their components under the proposed framework. This framework can dynamically reconfigure the components at a safe period and can help the components transfer their states, and the dynamic reconfiguration is transparent to the user application running on top of the stack. To demonstrate the component framework, a TCP component is implemented. While maintaining active connections for the user application, the TCP component is able to be dynamically replaced by another version. Copyright &copy; 2005 John Wiley & Sons, Ltd.