ppxscal/embedding_network huggingface dataset:
Tcl/Tk: a strong basis for complex load testing systems
Authors: Ahmet Can Keskin, Till Immanuel Patzschke, Ernst von Voigt
Venue: Proceedings of the 7th conference on USENIX Tcl/Tk - Volume 7 (2000)

This paper describes a Tcl/Tk-based load testing environment which was developed for Deutsche Telekom, Europe's largest telco carrier and online service provider. Deutsche Telekom uses the system to ensure a high quality of service and availability. The paper explains the complex requirements of load testing and gives a detailed overview for the extensive use of Tcl/Tk within the system.
Caravela: A Novel Stream-Based Distributed Computing Environment
Authors: Shinichi Yamagiwa, Leonel Sousa
Venue: Computer (2007)

Distributed computing implies sharing computation, data, and network resources around the world. The Caravela environment applies a proposed flow model for stream computing on graphics processing units that encapsulates a program to be executed in local or remote computers and directly collects the data through the memory or the network.
Generating Fractal Tiles using Voronoi Diagrams
Authors: Tomasz Dobrowolski
Venue: Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering (2007)

This paper introduces a fractal partition class defined over a unit wrapped space. The cells of a fractal partition have self-similarity property and can be used as a set of tiles that can tile Rn space periodically or quasi-periodically with non-uniform tiling density. An algorithm for generating set of fractal cells using Voronoi diagram computation is proposed with several applications in computer graphics and computational chemistry.
Blind MIMO equalization and joint-diagonalization criteria
Authors: P. Comon
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

We consider the problem of convolutive blind signal separation through the optimization of contrast functions. We show that some links between contrasts and joint diagonalization criteria can be exhibited in the convolutive case. This allows us to devise a constructive algorithm performing MIMO blind equalization, with the help of a joint approximate diagonalization of a set of matrices built from the observations. This analytical algorithm can be run block-wise, which is appropriate in the context of short burst communications.
Cosine-modulated 2-dimensional perfect reconstruction FIR filter banks with linear phase
Authors: T. Nagai
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

In this paper, we propose a design method of cosine-modulated 2-dimensional (2-D) perfect reconstruction (PR) FIR filter banks, in which each analysis and synthesis filter has linear phase (LP). As in previous works, it is impossible to design the 2-D cosine modulated system which satisfies both the PR condition and LP property. However, in 2-D signal processing, it is very important for each filter to have the LP property. Our main goals are to show such a system can be realized by considering a new decomposition scheme and derive the conditions for PR and LP. A design example is included to show the effectiveness of this paper.
Generalized regression model for sequence matching and clustering
Authors: Hansheng Lei, Venu Govindaraju
Venue: Knowledge and Information Systems (2007)

Linear relation has been found to be valuable in rule discovery of stocks, such as if stock X goes up a, stock Y will go down b. The traditional linear regression models the linear relation of two sequences faithfully. However, if a user requires clustering of stocks into groups where sequences have high linearity or similarity with each other, it is prohibitively expensive to compare sequences one by one. In this paper, we present generalized regression model (GRM) to match the linearity of multiple sequences at a time. GRM also gives strong heuristic support for graceful and efficient clustering. The experiments on the stocks in the NASDAQ market mined interesting clusters of stock trends efficiently.
The average-shadowing property and topological ergodicity
Authors: Rongbao Gu
Venue: Journal of Computational and Applied Mathematics (2007)

In this note we prove that a Lyapunov stable map having the average-shadowing property from a compact metric space onto itself is topologically ergodic, but it is not topologically weakly mixing.
SASHA: toward a self-healing hybrid sensor network architecture
Authors: T. Bokareva, N. Bulusu, S. Jha
Venue: Proceedings of the 2nd IEEE workshop on Embedded Networked Sensors (2005)

For widespread adoption of sensor technology, robustness in the event of abnormal behavior, such as a network intrusion or failures of components or nodes, is critical. Current research on robust and resilient sensor networking is focused on specific tasks - secure broadcast, secure aggregation, secure localization or fault-tolerant feature extraction. While these primitives provide useful functionality, what has been lacking is a comprehensive, holistic approach to sensor network robustness across various failure modalities. We propose a self-healing hybrid sensor network architecture, called SASHA, that is inspired by and coopts several mechanisms used by the acquired natural immune system to attain its autonomy, robustness, diversity and adaptability to unknown pathogens, and compactness. SASHA encompasses automatic fault recognition and response over a wide range of possible faults. Moreover, it is an adaptive architecture that can learn and evolve its monitoring and inference capabilities over time to deal with unknown faults. We illustrate the workings of SASHA using the example of fault-tolerant sensor data collection and outline an agenda for future research.
DNS and BIND security issues
Authors: Paul Vixie
Venue: Proceedings of the 5th conference on USENIX UNIX Security Symposium - Volume 5 (1995)

Efforts are underway to add security to the DNS protocol. We have observed that if BIND would just do what the DNS specifications say it should do, stop crashing, and start checking its inputs, then most of the existing security holes in DNS as practiced would go away. To be sure, attackers would still have a pretty easy time co-opting DNS in their break-in attempts. Our aim has been to get BIND to the point where its only vulnerabilities are due to the DNS protocol, and not to the implementation. This paper describes our progress to date.
Metamodel-Based Inference of Inter-Model Correspondence
Authors: Petri Selonen, Markus Kettunen
Venue: Proceedings of the 11th European Conference on Software Maintenance and Reengineering (2007)

Many software engineering processes produce series of related models. They describe the designed system from different viewpoints, each emphasizing a particular concern. Models are produced by individual teams and sometimes third party developers, and sometimes they are synthesized using tools. It is unlikely that they are developed within a single modeling repository or share common repository identifiers. To reason about the models, a correspondence relationship needs to be established between model elements representing the same concepts. Current approaches for inferring correspondence use fixed semantics built into the algorithms and derived from small modeling language subsets. This paper presents a flexible approach for inferring correspondence. The rules are generated based on a Meta-Object Facility compliant metamodel specifying modeling language of the compared model instances. They can be refined with additional domain specific rules. The approach can be used as a basis for comparing, merging and reconciling models.
Ring Embedding in an Injured Hypercube
Authors: Yu-Chee Tseng, Ten-Hwang Lai
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 03 (1993)

We consider the problem of embedding a ring in a hypercube that contains possible faulty nodes. Existing algorithms allow the number of faulty nodes to be at most 2n-\Theta(\sqrt {nlogn}), where n is the dimension of the hypercube. We propose an embedding scheme that can tolerate up to \Theta(2^{n/2}) faulty nodes, largely increasing the number of tolerable faulty nodes in a ring embedding.
The IT sales cycle as a source of context in IS implementation theory
Authors: Michael Wybo
Venue: Information and Management (2007)

Theories of systems implementation identify contextual factors that influence both management action and implementation outcomes. Building on this, I showed using case studies, how the actions of participants in the IT sales cycle create the context within which implementation takes place. I argue that implementation begins much earlier than current theories have assumed and should be considered to consist of two distinct but related processes: the acquisition of IS and their deployment in the organization.
Convergence of the DLMS algorithm with decreasing step size
Authors: Sang-Sik Ahn
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

Convergence analyses for the least mean square algorithm with update delay (DLMS) exist, but most of them are based on the unrealistic independence assumption between successive input vectors. We consider the DLMS algorithm with decreasing step size /spl mu/(n)=a/n,a>0 and prove the almost-sure convergence of the algorithm under the mixing input, satisfying of the law of large numbers, and uniformly bounded input assumptions.
Design and implementation of metadata management system for WWW coursewares
Authors: W. Braga
Venue: Proceedings of the Frontiers in Education Conference, 2001. 31st Annual - Volume 02 (2001)

The number of coursewares available on the Internet has increased greatly. The amount of information we can obtain from the networked environment is enormous. However, the importance of getting right information draws much attention from researchers in the community. Currently, searching techniques are developed to help the learners as well as teachers find information in the World Wide Web. Nevertheless, the users can be confused with search results due to irrelevant information, misinformation, insufficient information, etc. Searching can be performed accurately and efficiently by utilizing metadata for the Web courseware. This paper proposes a metadata management system trying to help search appropriate coursewares and shows that utilizing metadata for a search can facilitate obtaining right information on the Web. Elements of the metadata are selected and their relationships are identified in order to organize them in a relational database. Procedures to obtain the metadata for Web courseware are designed and implemented in the Microsoft ASP (active server pages). Issues on managing the metadata are addressed and implemented in the system so that addition, deletion, and update operations can be done easily via the Web. The overall metadata management system provides user-friendly interfaces to give essential information on the courseware and to handle user enquiry correctly 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
Modeling Emergency Response Systems
Authors: Murray E. Jennex
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

This paper discusses a model for an emergency response system. The model is based on a review of the literature and the incorporation of lessons learned from Hurricane Katrina response. The paper takes a holistic view of a system in that an Emergency Response System is viewed as including emergency response members, procedures, and the organization as well as the ICT components of the system.
Optimal phase kernels for time-frequency analysis
Authors: L. FridtjofWisur-Olsen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

We consider the design of kernels for time-frequency distributions through the phase, rather than amplitude, response. While phase kernels do not attenuate troublesome cross-components, they can translate them in the time-frequency plane. In contrast to previous work on phase kernels that concentrated on placing the cross-components on top of the auto-components, we set up a "don't care" region and place the cross-components there. The close connections between optimal allpass kernels and optimal lowpass kernels provide valuable insight into signal-dependent time-frequency analysis.
A Fuzzy-based Call Admission Control System forWireless Cellular Networks
Authors: Leonard Barolli, Fatos Xhafa, Arjan Durresi, Akio Koyama
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

The mobile cellular systems are expected to support multiple services with guaranteed Quality of Service (QoS). However, the ability of wireless systems to accommodate expected growth of traffic load and broadband services is limited by available radio frequency spectrum. Call Admission Control (CAC) is one of the resource management functions, which regulates network access to ensure QoS provisioning. However, the decision for CAC is very challenging issue due to user mobility, limited radio spectrum, and multimedia traffic characteristics. To deal with these problems, in this paper, we propose a fuzzy CAC system. We compare the performance of the proposed system with Shadow Cluster Concept (SCC). We evaluate by simulation the performance of the proposed system. The proposed system has a good behavior on deciding the number of accepted connections while keeping the QoS for serving connections.
The Concept of a Personal Distributed Environment for Wireless Service Delivery
Authors: John Dunlop
Venue: Wireless Personal Communications: An International Journal (2007)

Traditionally wireless service delivery has been restricted in scope to voice and text messaging and has been targeted at a single user device. Increasing interest is now being shown in ubiquitous delivery of services, including many forms of information and entertainment services, over a variety of wireless delivery mechanisms and to a collection of devices controlled by an individual user. These devices may be both local and remote to the user but their combination, and the services provided, form the user's personal distributed environment (PDE). This paper reviews the concepts associated with a PDE and highlights some of the technical problems which require to be addressed in order to make such an environment a self-organising and attractive proposition from the user viewpoint. The paper defines the elements of a personal distributed environment and concentrates on the issues of personal access management and personal service management. It illustrates typical signalling exchanges required for the control of devices within the PDE and stresses the way in which the PDE may be attached to the core network. The paper will also illustrate a typical scenario in which a PDE might be deployed and will highlight the very important issues of security which must be incorporated in the overall PDE management.
Towards evolutionary optimisation for high resolution bathymetry from sidescan sonars
Authors: E. Avgerinos, A. M. S. Zalzala, G. Zografos
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

The main objective of this paper is to use genetic algorithms in order to improve the quality of the bathymetry derived from sidescan raw data. The optimisation sequence starts with inverse modelling of the phase data, which uniquely corresponds to the characteristics of the coupled system of the sidescan vehicle and the seafloor terrain. These phase data are then compared with phase data actually collected by the sonar, to produce a correlation coefficient as an objective function. Simulation results are reported for the algorithm showing robust convergence towards the optimum value of the objective function. The results indicate that this new approach can be used to avoid difficulties widely encountered during forward processing of phase data to derive bathymetry.
Low rate coding of the spectral envelope using channel gains
Authors: E. Singer
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

A dual rate embedded sinusoidal transform coder is described in which a core 14th order allpole coder operating at 2400 b/s is augmented with a set of channel gain residuals in order to operate at the higher 4800 b/s rate. The channel. Gains are a set of non-uniformly spaced samples of the spline envelope and constitute a lowpass estimate of the short-time vocal tract magnitude spectrum. The channel gain residuals represent the difference between the spline envelope and the quantized 14th order allpole spectrum at the channel gain frequencies. The channel gain residuals are coded using pitch dependent scalar quantization. Informal listening indicates that the quality of the embedded coder at 4800 b/s is comparable to that of an existing high quality 4800 b/s allpole coder.
Redundancy reduction in 3D facial motion capture data for animation
Authors: Daniela I. Wellein, Cristóbal Curio, Heinrich H. Bülthoff
Venue: Proceedings of the 4th symposium on Applied perception in graphics and visualization (2007)

Research on the perception of dynamic faces often requires real-time animations with low latency. With an adaptation of principal feature analysis [Cohen et al. 2002], we can reduce the number of facial motion capture markers by 50%, while retaining the overall animation quality.
Second International OTS-Based Development Methods Workshop
Authors: Don Firesmith
Venue: Proceedings of the Sixth International IEEE Conference on Commercial-off-the-Shelf (COTS)-Based Software Systems (2007)

As evidenced by the success of the ICCBSS Conferences, the OTS (off-the-shelf)-based development community is constantly growing. Unfortunately, different development projects and organizations have adopted different terminology and reference models for the OTS-based tasks to be performed, work products to be produced, and roles to be played. Due to the current lack of standardization, these unnecessary differences have produced a growing confusion that has limited effective communication and have slowed the improvement and spread of OTS-based development methods. We believe it is feasible and the time is ripe to start reaching a consensus on a single common framework of reusable OTS-related method components.
A Cell-Based Approach for Evolutionary Component Repositories for Intelligent Service Robots
Authors: Hyung-Min Koo, In-Young Ko
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 01 (2007)

Self-growing software is a software system that grows its functionalities and configurations by itself according to dynamically monitored situations. A component repository system is one of the essential parts of self-growing robot software, and the SemBots project at ICU is developing a cell-based distributed repository system that reconfigures its structure dynamically for reflecting accessibility evolutionarily. To accomplish evolutionary repositories, we invent the concept of a cell that is a logical grouping of distributed repositories based on an ontology hierarchy. In addition, it is also a unit for evolutionary reconfiguration of the repository structure. In this paper, we describe the requirements and architecture of the cell-based repository system for self-growing software. We also present a prototype implementation and experiment of the repository system. Through the cell-based repositories, we achieve improved performance of self-growing actions for robots and efficient management of components for developers.
Matching pursuit based decision-feedback equalizers
Authors: S. F. Cotter
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

In this paper, equalization of channels with large delay spread but with few nonzero taps, such as those encountered in HDTV, are considered. Exploiting the sparse nature of the channel impulse response, we propose a decision feedback equalizer (DFE) which is based on a channel estimate obtained via a matching pursuit (MP) algorithm rather than the standard least squares (LS) channel estimate. It is shown that equalizers so designed result in a large performance gain. It is also shown that while truncation of the LS channel estimate to give a sparse channel estimate leads to some performance improvement, it falls well short of the MP-based DFE. In addition, an adaptive scheme which is intermediate in complexity between the LMS and RLS is presented for updating the sparse channel estimate in a time-varying environment. This adaptive algorithm outperforms the LMS.
Visual Conversation Styles in Web Communities
Authors: David W. McDonald
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Imagery and picture sharing are an important and growing part of online communities. Many prior studies of online interaction and collaboration rely heavily on text. This study takes a different analytic approach by focusing instead on the images that individuals use to present themselves and to interact. Image data collected from several online communities is analyzed to characterize a range of visual conversational styles. Four specific styles of visual conversation are illustrated and explained; positional play, image quote, text-in-picture and animation. These visual conversation styles are contrasted with textual communication techniques that are commonly taken for granted. The discussion identifies several tradeoffs when designing communities to promote visual conversation.
Pattern Recognition Using Fractals
Authors: David W. N. Sharp, R. Lyndon While
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 03 (1993)

We present a novel algorithm for the automatic recognition and classification of fractally-encoded images. The algorithm can recognise images from a fractal transformation library in the presence of scaling, displacement and rotation and is robust in the presence of noise. The algorithm forms the basis for a more general recognition mechanism if non-fractal images are encoded as fractal pictures using Barnsley's Collage Theorem. The algorithm is a member of a recently-discovered novel class of "Communication-Intensive Massively-Parallel" (CIMP) algorithms that have already been used for sorting, tessellation of the plane and pitch-period detection, and which show great promise for use in other application areas.