ppxscal/embedding_network huggingface dataset:
Autonomic Computing: A New Approach
Authors: Mohammad Reza Nami, Mohsen Sharifi
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

Today, IT organizations have encountered growing challenges in the management and maintenance of large scale heterogeneous distributed computing systems because these systems have to be active and available at all hours. Therefore, it is difficult for administrators to manage such systems and handle changes occured at all hours. Moreover, current programming languages, methods, and management tools are inadequate to handle complexity, heterogeneity, scale, dynamism, and uncertainty as the most important challenges in such systems. Therefore, researchers investigate new ideas to address the problems created by IT complexity. One such idea is Autonomic Computing (AC). Autonomic Computing Systems (ACSs) are systems that manage themselves. This paper provides a thorough survey of autonomic computing systems, presenting their definitions, their characteristics and effects on quality factors, their architecture, issues and challenges.
Variance Reduction for Supply Ramp Based Cheap RF Test Alternatives
Authors: Shaji Krishnan, Rene Jonker, Leon van de Logt
Venue: Proceedings of the 12th IEEE European Test Symposium (2007)

This paper describes a variance reduction technique for supply ramp test method. The technique makes use of multiple current measurements from a single device under similar test conditions to generate robust test limits with lower variance. The necessary conditions that guarantee variance reduction under these circumstances have also been described. We demonstrate that variance reduction has an additional benefit of 10% to the overall coverage of the test method.
Algorithms for separable nonlinear least squares with application to modelling time-resolved spectra
Authors: Katharine M. Mullen, Mikas Vengris, Ivo H. Stokkum
Venue: Journal of Global Optimization (2007)

The multiexponential analysis problem of fitting kinetic models to time-resolved spectra is often solved using gradient-based algorithms that treat the spectral parameters as conditionally linear. We make a comparison of the two most-applied such algorithms, alternating least squares and variable projection. A numerical study examines computational efficiency and linear approximation standard error estimates. A new derivation of the Fisher information matrix under the full Golub-Pereyra gradient allows a numerical comparison of parameter precision under variable projection variants. Under the criteria of efficiency, quality of standard error estimates and parameter precision, we conclude that the Kaufman variable projection technique performs well, while techniques based on alternating least squares have significant disadvantages for application in the problem domain.
Secure Dynamic MANET On-demand (SEDYMO) Routing Protocol
Authors: Helena Rifa-Pous, Jordi Herrera-Joancomarti
Venue: Proceedings of the Fifth Annual Conference on Communication Networks and Services Research (2007)

This paper describes the state of the art of secure ad hoc routing protocols and presents SEDYMO, a mechanism to secure a dynamic multihop ad hoc routing protocol. The proposed solution defeats internal and external attacks us- ing a trustworthiness model based on a distributed certi- fication authority. Digital signatures and hash chains are used to ensure the correctness of the protocol. The protocol is compared with other alternatives in terms of security strength, energy efficiency and time delay. Both computational and transmission costs are considered and it is shown that the secure protocol overhead is not a critical factor compared to the high network interface cost.
Data Management on Grid Filesystem for Data-Intensive Computing
Authors: Hitoshi Sato, Satoshi Matsuoka
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet Workshops (2007)

In parallel computing environments such as HPC clusters and the Grid, data-intensive applications involve large overhead costs due to a concentration of access to the files on common nodes. To avoid this problem in traditional distributed filesystems, users have to distribute the file access manually. However, such solution has some difficulties for users in the Grid environment. We propose a data management mechanism for data-intensive computing on Grid filesystem. Our technique improves the file access performance by automatically scheduling the file access and the data management on the filesystem. The filesystem is based on dynamically configured node groups corresponding to the network topology. Utilizing the configuration, it monitors file access to detect concentrated situations, creates the file replica, and schedules its placement and access. We applied the proposal technique to the Gfarm, a filesystem that scales to the Grid. We emulate real application workloads using a job scheduler and confirmed a speedup of factor 3.7 compared with a filesystem without automatic file access distribution techniques.
An inverse eigenvalue problem and an associated approximation problem for generalized K-centrohermitian matrices
Authors: Zhongyun Liu, Heike Faíbender
Venue: Journal of Computational and Applied Mathematics (2007)

A partially described inverse eigenvalue problem and an associated optimal approximation problem for generalized K-centrohermitian matrices are considered. It is shown under which conditions the inverse eigenproblem has a solution. An expression of its general solution is given. In case a solution of the inverse eigenproblem exists, the optimal approximation problem can be solved. The formula of its unique solution is given.
Rakhmanov's theorem for orthogonal matrix polynomials on the unit circle
Authors: Walter Van Assche
Venue: Journal of Approximation Theory (2007)

Rakhmanov's theorem for orthogonal polynomials on the unit circle gives a sufficient condition on the orthogonality measure for orthogonal polynomials on the unit circle, in order that the reflection coefficients (the recurrence coefficients in the Szego recurrence relation) converge to zero. In this paper we give the analog for orthogonal matrix polynomials on the unit circle.
Decision tree state tying based on penalized Bayesian information criterion
Authors: Wu Chou
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

In this paper, an approach of the penalized Bayesian information criterion (pBIC) for decision tree state tying is described. The pBIC is applied to two important applications. First, it is used as a decision tree growing criterion in place of the conventional approach of using a heuristic constant threshold. It is found that original BIC penalty is too low and will not lead to a compact decision tree state tying model. Based on Wolfe's modification to the asymptotic null distribution, it is derived that two times BIC penalty should be used for decision tree state tying based on pBIC. Secondly, pBIC is studied as a model compression criterion for decision tree state tying based acoustic modeling. Experimental results on a large vocabulary (Wall Street Journal) speech recognition task indicate that a compact decision tree could be achieved with almost no loss of the speech recognition performance.
Workshop co-chairs
Venue: Proceedings of the End-to-End Monitoring Techniques and Services on 2005. Workshop (2005)

The following topics were dealt with: Internet traffic monitoring; QoS monitoring; next generation services monitoring; bottlenecks monitoring; and packet dropping monitoring. 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 Programming Models for Service-Level High Availability
Authors: C. Engelmann, S. L. Scott, C. Leangsuksun, X. He
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

This paper provides an overview of existing programming models for service-level high availability and investigates their differences, similarities, advantages, and disadvantages. Its goal is to help to improve reuse of code and to allow adaptation to quality of service requirements by using a uniform programming model description. It further aims at encouraging a discussion about these programming models and their provided quality of service, such as availability, performance, serviceability, usability, and applicability. Within this context, the presented research focuses on providing high availability for services running on head and service nodes of high-performance computing systems.
ABASH: finding bugs in bash scripts
Authors: Karl Mazurak, Steve Zdancewic
Venue: Proceedings of the 2007 workshop on Programming languages and analysis for security (2007)

This paper describes the design and implementation of ABASH, a tool for statically analyzing programs written in the bash scripting language. Although it makes no formal guarantees against missed errors or spurious warnings (largely due to the highly dynamic nature of bash scripts), ABASHis useful for detecting certain common program errors that may lead to security vulnerabilities. In experiments with 49 bash scripts taken from popular Internet repositories, ABASH was able to identify 20 of them as containing bugs of varying severity while yielding only a reasonable number of spurious warnings on both these scripts and the generally bug-free initialization scripts of the Ubuntu Linux distribution. ABASH works by performing abstract interpretation of a bash script via an abstract semantics that accounts for shell variable expansion. The analysis is also parameterized by a collection of signatures that describe external program interfaces (for Unix commands, etc.), yielding an easily configurable and extensible framework for finding bugs in bash scripts
Comparative Study: Virtual Fixtures and Shared Control for Rehabilitation of Fine Motor Skills
Authors: Govindarajan Srimathveeravalli, Venkatraghavan Gourishankar, Thenkurussi Kesavadas
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

The work presented here discusses the experimental results from comparing Virtual Fixtures (VF) and Shared Control (SC) techniques for rehabilitation of fine motor skills. A prior concept called Haptic Attributes was used to design the Shared Control assistance algorithm. Eight trajectories were chosen from the VMI Test book and were used to train a candidate's non dominant hand using recorded samples from their dominant hands. The results were analyzed with respect to errors for time of completion, RMS position errors, magnitude of forces and shape of trajectory. Results indicate that VF and SC control sets perform similarly for simple trajectories with SC performing better for more complex trajectories.
Privacy Protection in Dynamic Systems Based on RFID Tags
Authors: Jacek Cichon, Marek Klonowski, Miroslaw Kutylowski
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops (2007)

We propose a solution for privacy problems regarding use of electronic identification tags such as RFID's. In our scheme the ID tag changes at random driven by its internal circuitry during each activation. The changes are small enough so that the legitimate system can recognize the tag and register the modified ID for the next activation. On the other hand, after a certain number of activations the new ID cannot be linked with the original one. We provide a rigid mathematical analysis of security of this unlinkability property.
Balanced Decision Making in Software Engineering - General Thoughts and a Concrete Example from Industry
Authors: Hannes Omasreiter
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

Software Engineering is often treated as a mere technical challenge. However, especially in industry projects we primarily have to ask what value a software engineering activity generates. To create as much value as possible during a software project, we have to be able to make economically balanced decisions. This paper presents some general thoughts about balanced decision making in software engineering and drafts a concrete example for a valueoriented, light-weight process improvement approach.
A new structure for adaptive IFIR filtering
Authors: L. S. Resende
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

A new structure for adaptive interpolated finite impulse response (AFIR) filtering is presented, in which the RLS algorithm can be directly applied for updating only the nonzero coefficients of the sparse filter. The approach is based on the linearly-constrained filter called the generalized sidelobe canceller. The performance of the RLS algorithm applied to the AIFIR filtering is illustrated by simulations and compared with that of the LMS algorithm.
An active database architecture for knowledge-based incremental abstraction of complex concepts from continuously arriving time-oriented raw data
Authors: Alex Spokoiny, Yuval Shahar
Venue: Journal of Intelligent Information Systems (2007)

An effective solution to the tasks of continuous monitoring and aggregation querying of complex domain-meaningful concepts and patterns in environments featuring large continuously changing data sets is very important for many domains. Typical domains include: making financial decisions, integrating intelligence information from multiple sources, evaluating the effects of traffic controllers' actions, detection of security threats in communication networks, planning and monitoring in robotics, and management of chronic patients in medical domains. In this paper, we present a general domain-independent method for an effective solution of these two tasks. Our method involves incremental creation of meaningful, interval-based abstractions, from raw, time-stamped data continuously arriving from multiple sources, which is supported by the accumulation and continuous validation of the created abstractions. We implemented our method in the Momentum system, which is an active knowledge-based time-oriented database--a temporal extension of the active-database concept that we propose for incremental application of knowledge to continuously arriving time-oriented data. We evaluated the Momentum system in a medical domain within a database of 1,000 patients monitored after bone-marrow transplantation, and a knowledge base of complex abstractions regarding more than 100 raw-data types and about 400 concept types derivable from them. Initial evaluations are highly encouraging with regards to the feasibility of the whole approach.
Constrained minimum-BER multiuser detection
Authors: X. F. Wang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

A new linear multiuser detector for binary signaling in code-division multiple-access communication systems is described. The new detector directly minimizes the bit-error rate (BER) subject to a set of reasonable constraints. It is shown that any local minimum of the constrained BER cost function is a global minimum; hence a robust constrained minimization algorithm always leads to a detector with good performance. Although the proposed detector cannot be shown to be optimal among linear multiuser detectors because of the constraints imposed, our analysis and simulations indicate that it always outperforms the decorrelating detector and is optimal for most realistic systems.
Individual communication complexity
Authors: Harry Buhrman, Hartmut Klauck, Nikolai Vereshchagin, Paul Vitányi
Venue: Journal of Computer and System Sciences (2007)

We initiate the theory of communication complexity of individual inputs held by the agents. This contrasts with the usual communication complexity model, where one counts the amount of communication for the worst-case or the average-case inputs. The individual communication complexity gives more information (the worst-case and the average-case can be derived from it but not vice versa) and may in some cases be of more interest. It is given in terms of the Kolmogorov complexities of the individual inputs. There are different measures of communication complexity depending on whether the protocol is guaranteed to be correct for all inputs or not, and whether there's one-way or two-way communication. Bounds are provided for the communication of specific functions and connections between the different communication measures are shown. Some counter-intuitive results: for deterministic protocols that need to communicate Bob's input to Alice they need to communicate all of Bob's input (rather than the information difference with Alice's input), and there are so-called ''non-communicable'' inputs.
Scalable solutions for secure group communications
Authors: Ritesh Mukherjee, J. William Atwood
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2007)

With the advent of digital technologies and widening Internet bandwidth in recent years there has been a marked rise in new multimedia services, including teleconferencing, pay-per-view TV, interactive simulations, software updates and real-time delivery of stock market information. Multicast data distribution has been used in controlled environments to deliver such services. However, the lack of secure, accountable multicast data distribution has prevented its use in general Internet environments. Proposals for multicast security solutions so far are complex and often require trust in intermediate components or are inefficient. A secure multicast protocol suite must provide data confidentiality and multicast packet source authentication. In this paper we present a robust, simple and efficient multicast key management protocol based on proxy encryption and a multicast data source authentication mechanism based on symmetric message authentication codes. The solutions are analyzed and compared to previously published schemes. The results show that the proposed schemes are efficient and scalable relative to existing schemes.
Large-Scale Service Deployment--Application to OSGi
Authors: Francoise Baude, Virginie Legrand Contes, Vincent Lestideau
Venue: Proceedings of the Third International Conference on Autonomic and Autonomous Systems (2007)

This paper introduces an architecture for deploying software (components, services, etc) on distributed, large-scale computing infrastructures, like e.g. computing grids. Deployment encompasses many actions like the discovery of resources and enquiry about their current state, selection among the different versions of the software according to these states, robust, scalable and rapid software provisioning, installation and start-up, and eventually software installation monitoring, updating and unprovisioning. Our solution addresses all those steps through an integrated and scalable approach implemented using the standard Java JMX and the ProActive Grid technologies, which we illustrate in the context of OSGi gateways.
A Unified Model for Concurrent Debugging
Authors: S. I. Hyder, J. F. Werth, J. C. Browne
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 02 (1993)

Events are occurence instance of actions. The thesis of this paper is that the use of "actions", instead of events, greatly simplifies the problem of concurrent debugging.
A Six Degree-of-Freedom God-Object Method for Haptic Display of Rigid Bodies with Surface Properties
Authors: Michael Ortega, Stephane Redon, Sabine Coquillart
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

This paper describes a generalization of the god-object method for haptic interaction between rigid bodies. Our approach separates the computation of the motion of the six degree-of-freedom god-object from the computation of the force applied to the user. The motion of the god-object is computed using continuous collision detection and constraint-based quasi-statics, which enables high-quality haptic interaction between contacting rigid bodies. The force applied to the user is computed using a novel constraint-based quasi-static approach, which allows us to suppress force artifacts typically found in previous methods. The constraint-based force applied to the user, which handles any number of simultaneous contact points, is computed within a few microseconds, while the update of the configuration of the rigid god-object is performed within a few milliseconds for rigid bodies containing up to tens of thousands of triangles. Our approach has been successfully tested on complex benchmarks. Our results show that the separation into asynchronous processes allows us to satisfy the different update rates required by the haptic and visual displays. Force shading and textures can be added and enlarge the range of haptic perception of a virtual environment. This paper is an extension of [1].
A detailed study of a CDMA based approach to enhance ad hoc network performance
Authors: Jarmo Prokkola, Timo Bräysy
Venue: Ad Hoc Networks (2007)

Random access schemes operate typically on a contention based common channel, which brings problems with increasing traffic load. These problems are emphasized in a multi-hop wireless ad hoc network environment. Efficient collision avoidance methods are needed, but they also tend to decrease the spatial capacity of the network. With CDMA (Code Division Multiple Access), it is possible to make multiple simultaneous co-located successful transmissions and thus increase network capacity within the limits of multiple access interference (MAI). Bi-code channel access (BCCA) is a method to apply CDMA in ad hoc networking, providing also a common access channel for network connectivity maintenance and self-configuration. With BCCA, collisions are rare, and thus, more straightforward medium access control (MAC) methods can be used. A MAC solution designed especially for BCCA (BC-MAC) and ad hoc networking increases the efficiency of the channel usage. As BCCA is based on receiver code CDMA, the spreading code of the next hop node is needed. A novel network layer spreading code distribution (NSCD) method is proposed for this purpose. The spreading codes are distributed within routing protocol control packets at the route establishment phase. A detailed study on the performance behavior of different methods is provided. Also, interesting aspects considering the ad hoc network operation are discussed. Instead of the widely used unrealistic cut propagation model, a propagation model with realistic MAI calculation is used in this study. It is shown that the use of NSCD increases the network control load only slightly, and that the performance is practically the same as it is with the assumption of known spreading codes. BCCA with its dedicated MAC and NSCD clearly outperforms commonly used methods (like IEEE 802.11) and yet is easy to implement, robust for design parameters under different conditions while maintaining the original idea of ad hoc networking.