ppxscal/embedding_network huggingface dataset:
On the effectiveness of automatic patching
Authors: Milan VojnoviĆ, Ayalvadi Ganesh
Venue: Proceedings of the 2005 ACM workshop on Rapid malcode (2005)

We study the effectiveness of automatic patching and quantify the speed of patch dissemination required for worm containment. We focus on random scanning as this is representative of current generation worms, though smarter strategies exist. We find that even such "dumb'' worms require very fast patching. Our primary focus is on how delays due to worm detection and patch generation and dissemination affect worm spread. Motivated by scalability and trust issues, we consider a hierarchical system where network hosts are partitioned into subnets, each containing a patch server (termed superhost). Patches are disseminated to superhosts through an overlay connecting them and, after verification, to end hosts within subnets. When patch dissemination delay on the overlay is negligible, we find that the number of hosts infected is exponential in the ratio of worm infection rate to patch rate. This implies strong constraints on the time to disseminate, verify and install patches in order for it to be effective. We also provide bounds that account for alert or patch dissemination delay. Finally, we evaluate the use of filtering in combination with patching and show that it can substantially improve worm containment. The results accommodate a variety of overlays by a novel abstraction of minimum broadcast curve. They demonstrate that effective automatic patching is feasible if combined with mechanisms to bound worm scan rate and with careful engineering of the patch dissemination. The results are obtained analytically and verified by simulations.
Core Vector Regression for very large regression problems
Authors: Ivor W. Tsang, James T. Kwok, Kimo T. Lai
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

In this paper, we extend the recently proposed Core Vector Machine algorithm to the regression setting by generalizing the underlying minimum enclosing ball problem. The resultant Core Vector Regression (CVR) algorithm can be used with any linear/nonlinear kernels and can obtain provably approximately optimal solutions. Its asymptotic time complexity is linear in the number of training patterns m, while its space complexity is independent of m. Experiments show that CVR has comparable performance with SVR, but is much faster and produces much fewer support vectors on very large data sets. It is also successfully applied to large 3D point sets in computer graphics for the modeling of implicit surfaces.
A semantic approach to monitor business process
Authors: Manoj Thomas, Richard Redmond, Victoria Yoon, Rahul Singh
Venue: Communications of the ACM (2005)

Finding an effective method for managing and evaluating the performance of business processes is a key element for e-business success.
Characterisation of a new hump-free device structure for smart power and embedded memory technologies
Authors: Stefan Schwantes, Josef Fuerthaler, Thilo Stephan, Michael Graf, Volker Dudek, Tim Barry, Gayle Miller, James Shen
Venue: Microelectronic Engineering (2005)

A new device structure suitable for smart power and embedded memory technologies is presented that provides ideal hump-free subthreshold behaviour for shallow trench isolations by locally thickening the gate dielectric. This device structure is compared with an alternative approach to remove the hump effect, an improved process that reduces the oxide recess of the isolating trench. The new device offers a superior subthreshold slope. Emphasis has been placed not only on the hump effect but also on the reliability characterisation. The gate integrity of the new structure is comparable and only a minor degradation of the hot-carrier lifetime is observed. The new device structure provides an easy way to remove the hump without any change in the process and is applicable to every technology that offers more than one gate dielectric.
Efficient Numerical Continuation and Stability Analysis of Spatiotemporal Quadratic Optical Solitons
Authors: D. J. B. Lloyd, A. R. Champneys
Venue: SIAM Journal on Scientific Computing (2005)

A numerical method is set out which efficiently computes stationary (z-independent) two- and three-dimensional spatiotemporal solitons in second-harmonic-generating media. The method relies on a Chebyshev decomposition with an infinite mapping, bunching the collocation points near the soliton core. Known results for the type-I interaction are extended and a stability boundary is found by two-parameter continuation as defined by the Vakhitov--Kolokolov criteria. The validity of this criterion is demonstrated in (2+1) dimensions by simulation and direct calculation of the linear spectrum. The method has wider applicability for general soliton-bearing equations in (2+1) and (3+1) dimensions.
The Synthetic Character Ritchie: First Steps Towards a Virtual Companion for Mixed Reality
Authors: Klaus Dorfmuller-Ulhaas, Elisabeth Andre
Venue: Proceedings of the 4th IEEE/ACM International Symposium on Mixed and Augmented Reality (2005)

Unlike most existing work on traversable interfaces, we focus on the use of synthetic characters to accompany the user in Mixed Reality (MR) applications. We examine virtual companions as a promising means to design smooth transitions between different worlds and to avoid orientation problems. We propose a taxonomy to describe the spatial relationship between character and user which has an important impact on the style of interaction. To flexibly transfer user and character into different spaces, we have created a platform that supports the design of interfaces derived from the proposed taxonomy as well as transitions between them.
Adaptive query processing in mobile environment
Authors: Hocine Grine, Thierry Delot, Sylvain Lecomte
Venue: Proceedings of the 3rd international workshop on Middleware for pervasive and ad-hoc computing (2005)

These last years, the evolution of nomadic terminals and mobile networks has yield to the development of the ubiquitous computing. In this context, actual query evaluation and optimization techniques in distributed databases based on the use of a global schema and a cost model are no more relevant. Furthermore, a query processor deployed in this type of environment must face a significant heterogeneity, in particular mobile terminals, communication networks and different data sources. In order to cope with this heterogeneity, such service should have the capability to adapt itself dynamically. In this paper, we describe the problems related to query processing in mobile environment and the needs for adaptability.
Identifying Script onWord-Level with Informational Confidenc
Authors: Stefan Jaeger, Huanfeng Ma, David Doermann
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

In this paper, we present a multiple classifier system for script identification. Applying a Gabor filter analysis of textures on word-level, our system identifies Latin and non-Latin words in bilingual printed documents. The classifier system comprises four different architectures based on nearest neighbors, weighted Euclidean distances, Gaussian mixture models, and support vector machines.We report results for Arabic, Chinese, Hindi, and Korean script. Moreover, we show that combining informational confidence values using sum-rule can consistently outperform the best single recognition rate.
Applying SVD on Item-based Filtering
Authors: Manolis G. Vozalis, Konstantinos G. Margaritis
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

RAAWS: In this paper we will examine the use of a matrix factorization technique called Singular Value Decomposition (SVD) in Item-Based Collaborative Filtering. After a brief introduction to SVD and some of its previous applications in Recommender Systems, we will proceed with a full description of our algorithm, which uses SVD in order to reduce the dimension of the active item's neighborhood. The experimental part of this work will first locate the ideal parameter settings for the algorithm, and will conclude by contrasting it with plain Item-based Filtering which utilizes the original, high dimensional neighborhood. The results show that a reduction in the dimension of the item neighborhood is promising, since it does not only tackle some of the recorded problems of Recommender Systems, but also assists in increasing the accuracy of systems employing it.
Fast On-the-Fly Parametric Real-Time Model Checking
Authors: Dezhuang Zhang, Rance Cleaveland
Venue: Proceedings of the 26th IEEE International Real-Time Systems Symposium (2005)

This paper presents a local algorithm for solving the universal parametric real-time model-checking problem. The problem may be phrased as follows: given a real-time system and temporal formula, both of which may contain parameters, and a constraint over the parameters, does every allowed parameter assignment ensure that the real-time system satisfies the formula? Our approach relies on translating these model-checking problems into predicate equation systems, and then using an efficient proof-search algorithm to solve these systems. Experimental data shows that our method substantially outperforms existing approaches for systems that contain errors, while exhibiting comparable behavior for systems that are correct. This fast error-detection capability of our technique makes it especially interesting for design approaches in which model checkers are used "early and often" to detect design errors in an ongoing manner.
Motion picture inpainting on aged films
Authors: Timothy K. Shih, Rong-Chi Chang, Yu-Ping Chen
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

Video inpainting uses spatial-temporal information to repair defects such as spikes and lines on aged films. We propose a series of new algorithms based on adjustable thresholds to repair different varieties of aged films. The main contribution is an automatic spike and dirt detection mechanism. We prove that if appropriate threshold is once decided by the author, most damages in an aged video clip can be detected. In addition, the repairing procedure first estimates temporal information and obtain replacement blocks among several frames. Spatial information is then used to repair damages that can not be fixed by temporal information due to fast motion. The results are visually pleasant with most defects removed.
Post-bit: embodied video contents on tiny stickies
Authors: Takashi Matsumoto, Tony Dunnigan, Maribeth Back
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

Post-Bit is a small e-paper device modeled after paper Post-Its®1. We explored and designed interfaces to handle multi-media contents with paper-like manipulations using this e-paper device. The functions of each Post-Bit combined the affordance of physical tiny sticky memos and digital handling of information. At this stage of the design, we have prototyped two features of the interface: connecting computer-based workspaces and physical workspaces (using a function called Drop-Beyond-Drag), and tangible and tactile operation of multi-media contents. In this paper, we present the integrated design and functionality of the Post-Bit system's main components as shown in the video scenario.
The power of software
Authors: Alfonso Fuggetta
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

Software is the core constituent of many modern products and services. Many industrial sectors can be considered an "application" of computer science and software engineering, as they increasingly rely on software to provide their features and functionality. For instance, mobile phones have completed their transformation from specialized telecom devices to mobile computers: making phone calls (possibly using VoIP) is just one of the many (software) features offered to the customer. In general, many market sectors are dramatically changing their nature, structure, and operations as a result of their transformation into software-centered businesses.The main consequence of this dramatic change is that software has become a strategic asset for companies, institutions, individuals, and governments. Free software and software patents are perhaps the hottest topics that are being nowadays discussed by researchers and practitioners. In general, it is essential to understand how software impacts on business models, the management of Intellectual Property, industrial development, and the society in general (GNU.org claims that "free software is a matter of liberty"). As such, the subject is extremely complex as it has different dimensions and facets. It is not just a matter of technology: rather, it is a combination of technological, legal, social, economical, and even ethical and emotional issues. This means that it is difficult to identify a common ground of discussion and to properly assess claims and opinions.The talk will provide an overview of the trends in the software industry and in representative industrial sectors that are increasingly relying on software. It will then briefly discuss how software is affecting our society in general, and the role of software patents in innovation. This analysis will be instrumental to present some reflections and proposals to master the complexity of the problems we are challenged to face with.
Optimality Conditions for D.C. Vector Optimization Problems Under Reverse Convex Constraints
Authors: N. Gadhi, M. Laghdir, A. Metrane
Venue: Journal of Global Optimization (2005)

In this paper, we establish global necessary and sufficient optimality conditions for D.C. vector optimization problems under reverse convex constraints. An application to vector fractional mathematical programming is also given.
How to bridge the abstraction gap in system level modeling and design
Authors: A. Bernstein, M. Burton, F. Ghenassia
Venue: Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design (2004)

As more and more processors and subsystems are integrated in a single system, the verification bottleneck is driving designers away from RTL and RTL-like strategies for verification and design to higher abstraction levels. Increasing system complexity at the other hand requires much faster simulation and analysis tools. This is leading to new standards and tools around transaction level modeling. Languages such as SystemC and SystemVerilog are rich in behavioral and structural constructs which enable modeling designs at different levels of abstraction without imposing a top-down or bottom-up design flow. In fact, most design flows are iterative and modules at different levels of abstractions have to be considered. A more abstract model is very useful to increase simulation speed and to improve formal verification. SystemC and SystemVerilog stress the importance of verification support for complex SOCs including improvement for hardware verification as well as for the verification of hardware dependent software. In todays design flows the software development can often only start after the hardware is available. This causes unacceptable delays for the software development. The idea of transaction level modeling (TLM) is to provide in an early phase of the hardware development transaction level models of the hardware. Based on these TLMs a fast enough simulation environment is the basis for the development of hardware and hardware dependent software. The presumption is to run these transaction level models at several tens or some hundreds of thousand transactions per second which should be fast enough for system level modeling and verification.
Simulation of resource allocation alternatives for hospital facilities
Authors: G. Miles Johnson, James W. Kho
Venue: ACM SIGSIM Simulation Digest (1977)

Methodologies for developing a comprehensive hospital input/output model are summarized. Specifically covered are:&bull; The development of a hospital data base that allows simulation of various resource allocation configurations.&bull; The application of user-oriented modeling techniques for simulating hospital facilities.&bull; A case study of simulating patient flow through a radiology facility is presented in terms of model development and utilization of simulation output.
An A Priori Error Analysis of the hp-Version of the Continuous Galerkin FEM for Nonlinear Initial Value Problems
Authors: Thomas P. Wihler
Venue: Journal of Scientific Computing (2005)

A continuous Galerkin finite element time-stepping method for the approximation of nonlinear initial value problems is analyzed within an hp-context. We derive a priori error bounds in the L2- and H1-norm that are explicit with respect to the time steps and the approximation orders. In particular, it is shown that, for analytic solutions (with certain possible start-up singularities) exponential convergence rates can be achieved. Moreover, we prove that the scheme superconverges at the nodal points of the time partition. Numerical experiments illustrate the performance of the method.
Discovering unusual and non-trivial patterns in massive time series databases
Authors: Jessica Hung-Fan Lin
Venue:  (2005)

Time series is perhaps the most commonly encountered data type, touching almost every aspect of human life, including medicine (ECG, EEG data), finance (stock market data, credit card usage data), aerospace (launch telemetry, satellite sensor data), entertainment (music, movies), etc. Apart from the obvious problem of handling the typically massive size of time series databases (gigabytes, or even terabytes in size is not uncommon), most classic machine learning and data mining algorithms do not work well for time series due to their unique structure. In particular, the high dimensionality, very high feature correlation, and the (typically) large amount of noise that characterize time series data present a difficult challenge. The emphasis of this work is on the discovery of important patterns in time series data. The previous body of work in this area has been mostly concentrated on the identification of previously known patterns. The major distinction of this work is that it offers the ability to discover important, unknown patterns in an effective and automated manner. These significant patterns can manifest themselves as either frequently repeated patterns, which we formally define as &ldquo;time series motifs,&rdquo; or anomalous patterns. A novel symbolic representation for time series data is introduced, based on which promising solutions for motif discovery, anomaly detection, and visualization are proposed. Furthermore, the topic of time series clustering is also covered, which includes a discussion on the validity of subsequence clustering, and the introduction of an efficient multi-resolution anytime algorithm for whole clustering.
Supervised Peer-to-Peer Systems
Authors: Kishore Kothapalli, Christian Scheideler
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

In this paper we present a general methodology for designing supervised peer-to-peer systems. A supervised peerto- peer system is a system in which the overlay network is formed by a supervisor but in which all other activities can be performed on a peer-to-peer basis without involving the supervisor. It can therefore be seen as being between server-based systems and pure peer-to-peer systems. The supervisor only has to store a constant amount of information about the system at any time and only needs to send a small constant number of messages to integrate or remove a peer in a constant amount of time. Thus, with a minimum amount of involvement from the supervisor, peer-topeer systems can be maintained, for example, that can handle large distributed computing tasks as well as tasks such as file sharing and web crawling. Furthermore, our concept extends easily to multiple supervisors so that peers can join and leave the network massively in parallel. We also show how to extend the basic system to provide robustness guarantees under the presence of random faults and also adaptive adversarial join/leave attacks. Hence, with our approach, supervised peer-to-peer systems can share the benefits of server-based and pure peer-to-peer systems without inheriting their disadvantages.
Data Collection with Battery and Buffer Consideration in a Large Scale Sensor Network
Authors: Deji Chen, Aloysius K. Mok, Jianliang Yi, Mark Nixon, Tom Aneweer, Rusty Shepard
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

In a pure sensor network thousands of sensors are distributed over a large area. Sensor data is relayed from sensor node to node until it reaches the edge node, where it is then routed by wire to the host. In this paper we study the effect of data collection on the battery and buffer of a sensor node, and on the overall sensor network. We determine the relationship among battery life, sampling frequency, buffer size, etc. We claim that using identical sensors throughout a large scale sensor network may not achieve the best result. We suggest some guidelines for deploying a large scale sensor network. We then propose routing algorithms that are robust, truly distributed, and efficient in utilizing the sensor network.
A survey of interestingness measures for knowledge discovery
Authors: Ken McGarry
Venue: The Knowledge Engineering Review (2005)

It is a well-known fact that the data mining process can generate many hundreds and often thousands of patterns from data. The task for the data miner then becomes one of determining the most useful patterns from those that are trivial or are already well known to the organization. It is therefore necessary to filter out those patterns through the use of some measure of the patterns actual worth. This article presents a review of the available literature on the various measures devised for evaluating and ranking the discovered patterns produced by the data mining process. These so-called interestingness measures are generally divided into two categories: objective measures based on the statistical strengths or properties of the discovered patterns and subjective measures that are derived from the user's beliefs or expectations of their particular problem domain. We evaluate the strengths and weaknesses of the various interestingness measures with respect to the level of user integration within the discovery process.
Review of "A Guide to Models in Governmental Planning and Operations, by Saul I. Gass and Roger L. Sissons", Sauger Books
Venue: ACM SIGSIM Simulation Digest (1976)

This is the hard copy version of the report prepared for the Office of Research and Development of the Environmental Protection Agency. The volume contains 12 chapters in addition to any introductory preface. Each chapter is selfcontained and, on the whole, each is a very good presentation. 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
(CBR-4) Intelligent knowledge-based systems: intelligent systems
Authors: Cornelius T. Leondes
Venue:  (1995)

Intelligent Systems, discusses applications in such areas as mission-critical functions, business forecasting, medical patient care, and product design and development.