ppxscal/embedding_network huggingface dataset:
A Robust Digital Watermarking Based on a Statistic Approach
Authors: Pei-Min Chen
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

Digital watermarking is an emerging research area for copyright protection of electronic documents and media, which is one of the most important problems to be solved in the cyberspace society. A statistic approach for embedding and extracting a digital watermark on an image is proposed. This approach is based on the realization that a stego-image after watermark attacks should preserve the characteristics of the stego-image if the stego-image after attacks retains its commercial values. In other words, the appearance of the image after attacks is still clearly visible and similar to the original image. This kind of preservation can be reflected as the variances of color levels of pixels both in stego-without-attacks- and stego-with-attacks- images are most likely the same. The embedded digital watermark by this approach seems robust after several attacks are performed on the stego-image.
Distributed fault detection in communication protocols using extended finite state machines
Authors: K. Vijayananda
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

Run-time fault detection in communication protocols is essential because of faults that occur in the form of coding defects, memory problems, and external disturbances. Finite State Machine models have been used in the past to detect and diagnose protocol faults. However, the fault coverage of these models is limited to vocabulary faults and sequencing faults. We present an Extended Finite State Machine Model (EFSM) to augment the fault coverage of the FSM model. We extend the parallel decomposition method to EFSMs in order to reduce the size of the observer used to detect faults. The decomposition of the EFSM into several independent EFSMs results in multiple observers. The distributed fault detection mechanism increases the reliability of the fault detection and the EFSM model improves the fault coverage.
Ignore at your peril - towards a logic for ignorance
Authors: Wiebe van der Hoek, Alessio Lomuscio
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

A non-standard modal logic that we argue useful to represent formally the concept of ignorance in multi-agent systems is reported. We give syntax, and semantics and discuss issues relating to its axiomatisation.
New Interpolation Algorithms for Multiple-Valued Reed-Muller Forms
Authors: Zeljko Zilic, Zvonko G. Vranesic
Venue: Proceedings of the 26th International Symposium on Multiple-Valued Logic (1996)

This paper presents new algorithms for the sparse multivariate polynomial interpolation over finite fields, which can be used for optimizing Reed-Muller forms for MVL functions. Starting with a quadratic time interpolation algorithm for Boolean functions, we develop a method that decomposes the problem into several smaller problems for the MVL case. We then show how each of these problems can be solved by a practical probabilistic algorithm. The approach is extended to fixed polarity RM forms, in which the complexity of the resulting forms becomes simpler and also the running time of the algorithm is reduced.
Towards reengineering in reuse reengineering processes
Authors: G. Canfora, A. R. Fasolino, M. Tortorella
Venue: Proceedings of the International Conference on Software Maintenance (1995)

Reuse of existing software has been regarded in recent years as a feasible solution to software quality and productivity improvement problems. Various reference paradigms for setting up a reuse reengineering process have been proposed. With reference to the RE/sup 2/ (Reverse Engineering and Reuse Reengineering) paradigm, this paper addresses the problems of the election phase. In particular, by describing an approach to the reuse reengineering of COBOL programs, it tackles the transformation of a set of candidate components into a set of actually reusable modules. This involves the identification of a module template that allows the COBOL code components to be easily reused, and the definition of reverse engineering and reengineering techniques to package the components into the template.
Software Black Box: An Alternative Mechanism for Failure Analysis
Authors: Sebastian Elbaum, John C. Munson
Venue: Proceedings of the 11th International Symposium on Software Reliability Engineering (2000)

Learning from software failures is an essential step towards the development of more reliable software systems and processes. However, as more intricate software systems are developed, determining the nature and causes of a software failure becomes a great challenge. In addition, although many existing techniques can help to understand the nature of the failure, they are limited in some of the following aspects. First, they work only within controlled environments. Second, they have a major impact on the target system behavior. Third, they assume that a failure can be reproduced. Fourth, they lack enough support to carry out a structured failure analysis. In this paper, we present the Software Black Box (SBB) as an alternative mechanism for failure investigation. The SBB is different from its predecessors in that it was specifically designed to be embedded in a target system and assist in the investigation of failures by reconstructing the events that lead to the failure. The SBB architecture is discussed, and a set of failure scenarios that reveal the SBB potential in assisting failure investigation is presented.
Mars Polar Lander Fault Identification Using Model-based Testing
Authors: Mark Blackburn, Robert Busser, Aaron Nauman, Robert Knickerbocker, Richard Kasuda
Venue: Proceedings of the Eighth International Conference on Engineering of Complex Computer Systems (2002)

This paper describes the application of the TestAutomation Framework on the Mars Polar Lander (MPL)software. The premature shutdown of the descent engineon the MPL spacecraft is believed to be the most likelycause for the mission failure. It is believed that the engineshutdown occurred when the three landing legs wereextended into their deployed position. This event createdan unanticipated transient touchdown indication from thelegs, causing the software to inadvertently shutdown thedescent engines prior to reaching the surface of Mars.This spurious indication should have been ignored by theTouchdown Monitor (TDM) software, but due to a designflaw, was actually stored in program variable thuscausing the premature engine shutdown. The TAFapproach was used to model the TDM softwarerequirements. The associated TAF tools generated teststhat identified a TDM fault that is the most likely cause ofthe mission failure.
Complexity classes in three-dimensional gravitational agents
Authors: Jean-Claude Heudin
Venue: Proceedings of the eighth international conference on Artificial life (2002)

Three-dimensional Gravitational Agents are presented as discrete dynamical systems with simple construction but showing ordered, chaotic and complex behaviors. This paper explores these systems searching for complexity classes and emerging patterns. It shows the existence of a phase transition in the space of their transition functions and it argues that the most complex pattern dynamics is located in the vicinity of this phase transition.
Integral representations of affine transformations in phase space with an application to energy localization problems
Authors: H. G. Morsche, Patrick J. Oonincx
Venue:  (1999)

Applying the fractional Fourier transform and the Wigner distribution on a signal in a cascade fashion is equivalent with a rotation of the time and frequency parameters of the Wigner distribution. This report presents a formula for all unitary operators that are related to energy preserving transformations on the parameters of the Wigner distribution by means of such a cascade of operators. Furthermore, such operators are used to solve certain type of energy localization problems via the Weyl correspondence.
On Autonomous Agents
Authors: Radu Popescu-Zeletin
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

The last two years literature witnesses an explosion of contributions on agent systems and technologies. It seems that research and development in this field is hype, papers describe systems which are intelligent, mobile, autonomous and/or any other combination of these attributes. Research in this area is already rather old, but the effort in this field grew only in the last years, the years of INTERNET growth and of the telecommunication services.
Novells Guide to DirXML, 1 edition
Authors: Peter Kuo
Venue:  (2002)

:OFFERINGSThe definitive guide to setting up, managing, and troubleshooting a DirXML implementationTOOLSIn-depth coverage of components, commands, drivers, and how eDirectory fits into the DirXML solutionThe Most Comprehensive Guide to DirXML AvailableDirXML combines the power of Novell eDirectory with the flexibility of XML to enable data sharing and standardization throughout a network and beyond its barriers. In this definitive reference, expert Novell author Peter Kuo gives you in-depth background and step-by-step instructions for implementing DirXML within your enterprise's existing network infrastructure to enable instant updates and synchronization of all your data repositories. Time-saving tips for installing, configuring, and troubleshooting will help you get DirXML up and running fast.Inside, You'll Find Complete Coverage of DirXMLBecome fluent in the basic terms and concepts used in DirXMLFollow step-by-step instructions for creating, installing, and testing DirXML on various platformsGet up to speed on XML topics like DTD and XSLT as they relate to DirXML and eDirectoryFind out how to install and configure commonly used DirXML driversDiscover troubleshooting tips and workarounds for DirXML implementation and deployment issuesWrite your own custom DirXML driverMaster ongoing DirXML enterprise directory management
Local-spin Mutual Exclusion Using Fetch-and-\phi Primitives
Authors: James H. Anderson, Yong-Jik Kim
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

We present a generic fetch-and-\phi-based local-spin mutualexclusion algorithm with O(1) time complexity underthe RMR (remote-memory-reference) measure. This algorithmis "generic" in the sense that it can be implementedusing any fetch-and-\phi primitive of rank 2N, where N isthe number of processes. The rank of a fetch-and-\phi primitiveexpresses the extent to which processes may "orderthemselves" using that primitive. By using an arbitrationtree, a \Theta(logr N) algorithm can be constructed usingany primitive of rank r, where 2 \le r \
A framework for query optimization to support data mining
Authors: R. S Choenni, Arno P.J.M. Siebes
Venue:  (1996)

In order to extract knowledge from databases, data mining algorithms heavily query the databases. Inefficient processing of these queries will inevitably have its impact on the performance of these algorithms, making them less valuable. In this paper, we describe an optimization framework for an efficient processing of queries generated by different data mining algorithms. In this framework, we show how to take advantage of the physical organization of the database, the operators and the control structures used in an algorithm. Finally, we discuss how our framework fits into conventional query optimization frameworks.
Mining Fuzzy Quantitative Association Rules
Authors: Weining Zhang
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

Given a relational database and a set of fuzzy terms defined for some attributes, we consider the problem of mining fuzzy quantitative association rules that may contain crisp values, intervals, and fuzzy terms in both antecedent and consequent. We present an algorithm extended from the equi-depth partition (EDP) algorithm for solving this problem. Our approach combines interval partition with pre-defined fuzzy terms and is more general.
Analysis of 3gpp-MAC and two-key 3gpp-MAC
Authors: Lars R. Knudsen, Chris J. Mitchell
Venue: Discrete Applied Mathematics (2003)

Forgery and key-recovery attacks are described on the 3gpp-MAC scheme, proposed for inclusion in the 3gpp specification. Three main classes of attack are given, all of which operate whether or not truncation is applied to the MAC value. Attacks in the first class use a large number of 'chosen MACs', those in the second class use a large number of 'known MACs', and those in the third class require a large number of MAC verifications, but very few known MACs and no chosen MACs. The first class yields both forgery and key-recovery attacks, whereas the second and third classes are key-recovery attacks only. Both single-key and two-key variants of 3gpp-MAC are considered; the forgery attacks are relevant to both variants, whereas the key-recovery attacks are only relevant to the two-key variant.
A Wearable Context-Awareness Component
Authors: Albrecht Schmidt, Hans W. Gellersen, Michael Beigl
Venue: Proceedings of the 3rd IEEE International Symposium on Wearable Computers (1999)

We describe the design of a wearable context-awareness component that derives general context information from low-level sensors. Derived context information is application-independent and can be used by wearables or other personal technologies in a body network via a simple protocol. We built the context-awareness component into a tie, stressing its design as an accessory.
Desktop DVD Authoring
Authors: Douglas Dixon
Venue:  (2002)

:"With this book, you can easily create and share great-looking productions on DVD and even CD, with real, full-quality digital video and audio, complete with professional-style menus. Even better, the DVD discs that you burn at your desktop can be played almost anywhere - not only on computer DVD drives, but also on consumer set-top DVD players." This book will help you make sense of DVD - discs and formats, consumer and computer products, computer systems and peripherals, for playback and authoring, across both the Windows and Macintosh platforms. You'll see the range of possibilities for desktop DVD authoring, from transferring some videotapes to DVD as easily and simply as possible, to designing your own interactive presentations.
An Application of Word Sense Disambiguation to Information Retrieval
Authors: Jason M. Whaley
Venue:  (1999)

The problems of word sense disambiguation and document indexing for information retrieval have been extensively studied. It has been observed that indexing using disambiguated meanings, rather than word stems, should improve information retrieval results. We present a new corpus-based algorithm for performing word sense disambiguation. The algorithm does not need to train on many senses of each word; it uses instead the probability that certain concepts will occur together. That algorithm is then used to index several corpa of documents. Our indexing algorithm does not generally outperform the traditional stem-based tf.idf model.
Memory-based and disk-based algorithms for very high degree permutation groups
Authors: Gene Cooperman, Eric Robinson
Venue: Proceedings of the 2003 international symposium on Symbolic and algebraic computation (2003)

Group membership is a fundamental algorithm, upon which most other algorithms of computational group theory depend. Until now, group membership for permutation groups has been limited to ten million points or less. We extend the applicability of group membership algorithms to permutation groups acting on more than 100,000,000 points. As an example, we experimentally construct a group membership data structure for Thompson's group, acting on 143,127,000 points, in 36 minutes. More significantly, we require approximately 10 GB of RAM for the computation --- even though a single permutation of Thompson's group already requires half a gigabyte of storage.In addition, we propose a disk-based group membership algorithm with the promise of extending group membership to well over one billion (1,000,000,000) points. Such a disk-based algorithm has formerly been impossible, due in part to the lack of a practical disk-based algorithm for multiplying and taking inverses of such large permutations. Random access to disk is prohibitively expensive. We demonstrate the first practical disk-based implementation of the basic permutation operations. We also propose a disk-based architecture for group membership data structures.
A Collection of MDS Example Programs
Authors: Joe Bergin, Robert L. S Drysdale, Jerry Keough, Larry Gallagher, Vivian Sewelson, Mark Sherman
Venue:  (1986)

This MFS formatted disk contains a collection of example programs written for teaching machine architecture concepts using the Macintosh Development System. Sample programs illustrate how instructions can be treated as data, computer arithmetic, looping features, interrupt handling, coroutines, recursive subprograms and stack frames, traps and direct manipulation of the screen. In addition, a supervisor program is provided that implements basic, line-oriented input and output facilities for the 68000 assembly language programs on the Macintosh.
Completeness criteria in set-valued logic under compositions with union and intersection
Authors: A. Ngom, C. Reischer, D. A. Simovici, I. Stojmenovic
Venue: Proceedings of the 27th International Symposium on Multiple-Valued Logic (1997)

This paper discusses the Boolean completeness problems in r-valued set logic, which is the logic of functions mapping n-tuples of subsets into subsets over r values. Boolean functions are convenient choice as building blocks in the design of set logic circuits. Given a set S of Boolean functions, a set of functions F is S-complete if any set logic function can be composed from F once all Boolean functions from S are added to F. For the special case U=[/spl cup/, /spl cap/], we characterize all U-maximal sets in r-valued set logic. A set F is then U-complete if it is not a subset of any of these U-maximal sets, which is a completeness criterion in r-valued set logic under compositions with U functions.
Trajectory Guided Tracking and Recognition of Actions
Authors: Romer Rosales, Stan Sclaroff
Venue:  (1999)

Abstract A combined 2D, 3D approach is presented that allows for robust tracking of moving people and recognition of actions. It is assumed that the system observes multiple moving objects via a single, uncalibrated video camera. Low-level features are often insufficient for detection, segmentation, and tracking of non-rigid moving objects. Therefore, an improved mechanism is proposed that integrates low-level (image processing), mid-level (recursive 3D trajectory estimation), and high-level (action recognition) processes. A novel extended Kalman filter formulation is used in estimating the relative 3D motion trajectories up to a scale factor. The recursive estimation process provides a prediction and error measure that is exploited in higher-level stages of action recognition. Conversely, higher-level mechanisms provide feedback that allows the system to reliably segment and maintain the tracking of moving objects before, during, and after occlusion. The 3D trajectory, occlusion, and segmentation information are utilized in extracting stabilized views of the moving object that are then used as input to action recognition modules. Trajectory-guided recognition (TGR) is proposed as a new and efficient method for adaptive classification of action. The TGR approach is demonstrated using ``motion history images'''' that are then recognized via a mixture-of-Gaussians classifier. The system was tested in recognizing various dynamic human outdoor activities: running, walking, roller blading, and cycling. Experiments with real and synthetic data sets are used to evaluate stability of the trajectory estimator with respect to noise. (This technical report supercedes TR''s [98-020] and [98-007])
A multiprogramming system for process control
Authors: Sam Howry
Venue: ACM SIGOPS Operating Systems Review (1972)

This paper describes an operational small computer multiprogramming system developed for the control of the Stanford Two Mile Linear Accelerator (SLAC). The system has many features of larger systems such as dynamic memory allocation and interprocess control, but does not have to handle typical batch type jobs which need large arrays and many other system resources. This difference results in a drastic reduction in the complexity of both design and implementation. The accelerator control problem is discussed in terms of what requirements are imposed on the system by the environment. Then the basic subsystems are described with sufficient examples to show the reader other areas where such a system may be applicable.
Efficient Message Passing Interface (MPI) for Parallel Computing on Clusters of Workstations
Authors: Jehoshua Bruck, Danny Dolev, Ching Ho, Marcel Rosu, Ray Strong
Venue:  (1995)

Parallel computing on clusters of workstations and personal computers has very high potential, since it leverages existing hardware and software. Parallel programming environments offer the user a convenient way to express parallel computation and communication. In fact, recently, a Message Passing Interface (MPI) has been proposed as an industrial standard for writing "portable" message-passing parallel programs. The communication part of MPI consists of the usual point-to-point communication as well as collective communication. However, existing implementations of programming environments for clusters are built on top of a point-to-point communication layer (send and receive) over local area networks (LANs) and, as a result, suffer from poor performance in the collective communication part. In this paper, we present an efficient design and implementation of the collective communication part in MPI that is optimized for clusters of workstations. Our system consists of two main components: the MPI-CCL layer that includes the collective communication functionality of MPI and a User-level Reliable Transport Protocol (URTP) that interfaces with the LAN Data-link layer and leverages the fact that the LAN is a broadcast medium. Our system is integrated with the operating system via an efficient kernel extension mechanism that we developed. The kernel extension significantly improves the performance of our implementation as it can handle part of the communication overhead without involving user space. We have implemented our system on a collection of IBM RS/6000 workstations connected via a 10Mbit Ethernet LAN. Our performance measurements are taken from real scientific applications that run in a parallel mode by means of the MPI. The hypothesis behind our design is that system''s performance will be bounded by interactions between the kernel and user space rather than by the bandwidth delivered by the LAN Data-Link Layer. Our results indicate that the performance of our MPI Broadcast (on top of Ethernet) is about twice as fast as a recently published software implementation of broadcast on top of ATM.