ppxscal/embedding_network huggingface dataset:
Mastering Gimp
Authors: Michael J. Hammel
Venue: Proceedings of the 3rd annual conference on Atlanta Linux Showcase - Volume 3 (1999)

There is more to learning about the Gimp than just where the menus are and what the buttons do. To master the Gimp, you have to learn the technical reasons why things work as well as understand design project planning and work with an openness to experiment. This paper intends to show how all of these can be accomplished.
The age penalty and its effect on cache performance
Authors: Edith Cohen, Haim Kaplan
Venue: Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3 (2001)

Web content caching is recognized as an effective mechanism to decrease server load, network traffic, and user-perceived latency. An HTTP compliant cache associates with each cached object an expiration time calculated according to directives set by the object's origin server. The cache incurs a miss when it has no cached copy of a requested object or when the existing copy had expired (is not fresh). Upon a miss, the cache needs to fetch or validate a copy through exchanges with another cache with a fresh copy or the origin server. Thus, misses generate traffic and prolong service times. Caches are deployed as proxies, reverse proxies, and hierarchically and as a result, caches often serve other caches. As this happens, content age at higher-level caches, in addition to availability and freshness, emerges as a performance factor. The age of a cached copy of an object is the elapsed time since fetched from the respective origin. Fresh cached copies of the same object can have different ages and older copies typically expire sooner. Therefore, a proxy cache would suffer a higher miss rate if it receives older objects (e.g., from a reverse-proxy cache). Similarly, reverse-proxy caches that serve proxy-caches receive more requests than an origin server would have received. We refer to the increase in miss rate due to age as the age penalty. We use trace-based simulations to measure the extent of the age penalty for content served by content delivery networks and large caches. Even though the age penalty had not been considered previously, we demonstrate that it can be significant, and moreover, can highly vary under different practices.
Adaptive Deadlock-Free Routing in Multicomputers Using Only One Extra Virtual Channel
Authors: Chien-Chun Su, Kang G. Shin
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 01 (1993)

We present three protocols defin ing the relationship between messages and the chan nel resources requested: request-then-hold, requestthen wait, and request-then-relinquish. Based on the three protocols, we develop an adaptive deadlockfree routing algorithm called the SP routing. The SP routing uses shortest paths and is fully-adaptive, so messages can be routed via any of the shortest paths from the source to the destination. Since it is a minimal or shortest routing, the SP routing guar antees the freedom of livelocks. The SP routing is not limited to a specific network topology. The main requirement for an applicable network topology is that there exists a deterministic, minimal, deadlock-free routing algorithm. Most ex isting network topologies are equipped with such an algorithm. In this paper, we present an adaptive deadlock-free routing agorithm for n-dimensional meshes by using the SP routing. The hardware re quired by the SP routing uses only one extra virtual channel as compared to the deterministic routing.
Cross-layer verification of type flaw attacks on security protocols
Authors: Benjamin W. Long, Colin J. Fidge, David A. Carrington
Venue: Proceedings of the thirtieth Australasian conference on Computer science - Volume 62 (2007)

Security protocols are often specified at the application layer; however, application layer specifications give little detail regarding message data structures at the presentation layer upon which some implementation-dependent attacks rely. In this paper we present an approach to verifying security protocols in which both the application and presentation layers are modelled. Using the Group Domain of Interpretation protocol as an example, our application layer specification of the protocol is used as input to the AVISPA model checking tool for analysis. Two type flaw attacks are found via model checking which are then verified against the corresponding presentation layer specification, thus identifying the minimal requirements to prevent the attacks.
Evolutionary optimization by distribution estimation with mixtures of factor analyzers
Authors: Dong-Yeon Cho, Byoung-Tak Zhang
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

Evolutionary optimization algorithms based on the probability models have been studied to capture the relationship between variables in the given problems and finally to find the optimal solutions more efficiently. However, premature convergence to local optima still happens in these algorithms. Many researchers have used the multiple populations to prevent this ill behavior since the key point is to ensure the diversity of the population. In this paper, we propose a new estimation of distribution algorithm by using the mixture of factor analyzers (MFA) which can cluster similar individuals in a group and explain the high order interactions with the latent variables for each group concurrently. We also adopt a stochastic selection method based on the evolutionary Markov chain Monte Carlo (eMCMC). Our experimental results support that the presented estimation of distribution algorithms with MFA and eMCMC-like selection scheme can achieve better performance for continuous optimization problems.
Vector quantization techniques for output-based objective speech quality
Authors: Chiyi Jin, R. Kubichek
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

Output-based speech quality (OBQ) refers to objective speech quality assessment using only received speech without utilizing the input speech record. This paper proposes three new OBQ measures and evaluates their performance. Parameters derived from perceptual linear prediction (PLP) coefficients are used to provide speaker independence required by the objective measures. PLP, PLP cepstrum, and PLP delta-cepstrum parameters are computed for output speech records from an undistorted source speech database and vector quantized. The resulting codebook provides a reference for computing objective distance measures for distorted speech. The proposed objective measures are the transition probability distance, the median minimum distance, and the chi-squared distance. The OBQ parameters are tested on four different speech datasets, and correlation is computed between subjective scores and objective distances under a variety of conditions. The results indicate that the proposed algorithms are robust against speaker, text, and distortion variation.
Study of the protein-protein interaction networks via random graph approach
Authors: Po-Han Lee, Chien-Hung Huang, Jywe-Fei Fang
Venue: Proceedings of the Fourth IEEE International Conference on Cognitive Informatics (2005)

We employ the random graph theory approach to analyze the protein-protein interaction database DIP, for seven species. Several global topological parameters are used to characterize the protein-protein interaction networks (PINs) for each species. We find that the seven PINs are well approximated by the scale-free networks and the hierarchical models possibly except fruit fly. In particular, we determine that the E. coli and the yeast PINs are well represented by the stochastic and deterministic hierarchical network models respectively. These results suggesting that the hierarchical network model is a better description for certain species' PINs, and it may not be an universal feature across different species. Furthermore, we demonstrate that PINs are quite robust when subject to random perturbation where up to 50% of the nodes are rewired or removed or 50% of edges are removed. Average node degree correlation study supports the fact that nodes of low connectivity are correlated, whereas nodes of high connectivity are not directly linked.
Software applications for teaching systems concepts
Authors: D. Nardi
Venue: Proceedings of the Frontiers in Education Conference, 2001. 31st Annual - Volume 02 (2001)

Systems concepts like nonlinearity and feedback are relevant in many fields, but interactive software to demonstrate these concepts are uncommon. Three mini-applications are discussed. These applications are relatively simple in programming and design. The magic is in the assignments and how students go through a process and are able to play with and modify the virtual systems captured by the mathematics of the software. Concepts such as complexity, mutation rate, equilibrium point, leverage points and delayed-response come to life. These software mini-applications differ from commercial systems-modeling software in that they are simple free, easy to develop or alter, and can be used for specific assignments without themselves requiring a high learning curve. The research aspect involved has been in designing and refining the process students go through to maximize what they learn from working with the software, so they understand the concepts in class. 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
Distributed predictive and descriptive data mining
Authors: Sabine Mcconnell
Venue:  (2006)

Over the past decade, data mining has gained a strong foothold in a variety of application areas, including including science, engineering, and commerce. Centralized techniques, assuming all data to be contained at a single site, have been successfully applied to a large variety of application domains. However, we currently observe a trend toward a distributed extraction of knowledge from datasets. The motivation for this trend includes the distributed nature of the data itself, the distributed nature of computational resources, privacy concerns, and pragmatic issues arising from the increasing amount of available data. The development of distributed data-mining techniques is therefore necessary to extend the success of centralized data-mining techniques to the distributed domain. We present our research in the area of distributed data-mining. Specifically, we introduce a light-weight technique, in which predictive and descriptive models are built locally from subsets of attributes, and combined to produce global descriptive or predictive results. We modify our technique to facilitate data-mining in sensor networks for static and dynamic data. Our approach enables us to use distributed predictive and descriptive data-mining techniques to investigate datasets that are too large to be examined using centralized methods, are sensitive to privacy issues, and are under the constraint of real-time deadlines.
Method for Designing Frequency Filters Using BOTA
Authors: Norbert Herencsar, Kamil Vrba
Venue: Proceedings of the Second International Conference on Systems (2007)

In this paper the design of filters with a new active element BOTA is shown. A general feedback network was designed around the BOTA element. Step by step simpler autonomous circuits were picked out from this general arrangement, which serve as an initial circuit in designing different types of frequency filters. The selected circuit was subjected to an AC analysis, dynamic optimization, sensitivity analysis and measurement.
Recognising diverse learning styles in teaching and assessment of electronic engineering
Authors: M. Ayre
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

University of South Australia initiatives to make the electronic engineering curriculum more inclusive have been supported and informed by corporate policies. These policies require all curricula to be inclusive, and also to develop specified graduate attributes. After an overview of the literature about learning styles, this paper describes how the corporate advice is implemented in the electronic engineering curriculum. The authors have identified two different interpretations of the term 'learning styles'. The first interpretation sees personality and life experience as the key influences on learning styles, while the second defines learning styles as the practices students develop in response to the expectations of their teachers. The literature relating to each interpretation is considered, with particular reference to certain social and cultural groups which are under-represented in electronic engineering in the authors' university. Finally, the authors demonstrate the integration of these concepts and approaches into the learning and assessment strategies of an electronics course.
Improving sketch reconstruction accuracy using linear least squares method
Authors: Gene Moo Lee, Huiya Liu, Young Yoon, Yin Zhang
Venue: Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement (2005)

Sketch is a sublinear space data structure that allows one to approximately reconstruct the value associated with any given key in an input data stream. It is the basis for answering a number of fundamental queries on data streams, such as range queries, finding quantiles, frequent items, etc. In the networking context, sketch has been applied to identifying heavy hitters and changes, which is critical for traffic monitoring, accounting, and network anomaly detection. In this paper, we propose a novel approach called lsquare to significantly improve the reconstruction accuracy of the sketch data structure. Given a sketch and a set of keys, we estimate the values associated with these keys by constructing a linear system and finding the optimal solution for the system using linear least squares method. We use a large amount of real Internet traffic data to evaluate lsquare against countmin, the state-of-the-art sketch scheme. Our results suggest that given the same memory requirement, lsquare achieves much better reconstruction accuracy than countmin. Alternatively, given the same reconstruction accuracy, lsquare requires significantly less memory. This clearly demonstrates the effectiveness of our approach.
Research Issues in Multiple Policy Optimization Using Collaborative Reinforcement Learning
Authors: Ivana Dusparic, Vinny Cahill
Venue: Proceedings of the 2007 International Workshop on Software Engineering for Adaptive and Self-Managing Systems (2007)

Self-organizing techniques have successfully been used to optimize software systems, such as optimization of route stability in ad hoc network routing and optimization of the use of storage space or processing power using load balancing. Existing self-organizing techniques typically focus on a single, usually implicitly specijied, system goal and tune systems parameters towards optimally meeting that goal. In this papel; we consider optimization of large-scale multi-agent ubiquitous computing environments, such as urban trafJic control. Applications in this class are typically required to optimize towards multiple goals simultaneously. Additionally, these multiple goals can potentially be conjicting, change over time, and apply to various parts of the system such as a single agent, a group of agents, or the system as a whole. In contrast to existing self-organizing systems in which agents are homogeneous to the extent that they are working towards a common goal, agents in these systems are heterogeneous in that they may have di!ering goals. Thus, existing self-organizing optimization techniques must be extended to deal with multiple goal optimization and the resulting heterogeneity of agents. In this paper we present a research agenda for extending Collaborative Reinforcement Learning (CRL), an existing self-organizing optimization technique, to support multiple policy optimization.
An efficient sampling method for stochastic inverse problems
Authors: Pierre Ngnepieba, M. Y. Hussaini
Venue: Computational Optimization and Applications (2007)

A general framework is developed to treat inverse problems with parameters that are random fields. It involves a sampling method that exploits the sensitivity derivatives of the control variable with respect to the random parameters. As the sensitivity derivatives are computed only at the mean values of the relevant parameters, the related extra cost of the present method is a fraction of the total cost of the Monte Carlo method. The effectiveness of the method is demonstrated on an example problem governed by the Burgers equation with random viscosity. It is specifically shown that this method is two orders of magnitude more efficient compared to the conventional Monte Carlo method. In other words, for a given number of samples, the present method yields two orders of magnitude higher accuracy than its conventional counterpart.
Trading networks with price-setting agents
Authors: Larry Blume, David Easley, Jon Kleinberg, Eva Tardos
Venue: Proceedings of the 8th ACM conference on Electronic commerce (2007)

In a wide range of markets, individual buyers and sellers often trade through intermediaries, who determine prices via strategic considerations. Typically, not all buyers and seller shave access to the same intermediaries, and they trade at correspondingly different prices that reflect their relative amounts of power in the market. We model this phenomenon using a game in which buyers, sellers, and traders engage in trade on a graph that represents the access each buyer and seller has to the traders. In this model, traders set prices strategically, and then buyers and sellers react to the prices they are offered. We show that the resulting game always has a subgame perfect Nash equilibrium, and that all equilibria lead to an efficient (i.e. socially optimal) allocation of goods. We extend these results to a more general type of matching market, such as one finds in the matching ofjob applicants and employers. Finally, we consider how the profits obtained by the traders depend on the underlying graph -- roughly, a trader cancommand a positive profit if and only if it has an "essential" connection in the network structure, thus providing a graph-theoretic basis for quantifying the amount of competition among traders. Our work differs from recent studies of how price is affected by network structure through our modeling of price-setting as a strategic activity carried out by a subset of agents in the system, rather than studying prices set via competitive equilibrium or by a truthful mechanism.
DMC--Distributed and Mobile Collaboration Workshop Report
Authors: Manfred Hauswirth, Wolfgang Nejdl
Venue: Proceedings of the 15th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2006)

Private and business communication and collaboration is increasingly being freed from temporal and spatial constraints. Many traditional ways of interacting which required temporal or spatial coordination have given way to much more flexible and adaptive distributed and mobile interaction styles among businesses and people. The research questions arising from such environments were the subject of the Forth IEEE International Workshop on Distributed and Mobile Collaboration (DMC2006) at WETICE 2006, summarized in the following. The workshop featured 8 full papers (out of 15 submitted) on topics ranging from emergency system architectures to collaboration and coordination support to co-presence in social networks. The discussions at the workshop brought up important issues and interesting research questions in various research areas touched by distributed and mobile collaboration.
Protein Ontology Project in 2007: Looking Backward and Forward
Authors: Amandeep S. Sidhu, Tharam S. Dillon, Elizabeth Chang
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

Protein Ontology is designed to provide a structured protein data specification for Protein Data Representation. Protein Ontology is a standard for representing protein data in a way that helps in defining data integration and data mining models for Protein Structure and Function. In paper we summarize the development of PO that we discussed in previous chapters. A large number of diverse bioinformatics sources are available today. The future of biological sciences promises more data. No individual data source will provide us with answers to queries that we need to ask. Instead knowledge has to be composed from multiple data sources to answer the queries. Even though multiple databases may cover same data their focus might be different. Thus, Protein Ontology Project is an ongoing project with creation of every new protein data source. We also outline here in this paper the future work that we will be doing in Protein Ontology Project.
A fast two-channel projection algorithm for stereophonic acoustic echo cancellation
Authors: F. Amand
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

We propose a new fast projection algorithm for stereophonic acoustic echo cancellation. This algorithm can be viewed as a generalization of the extended two-channel LMS algorithm which takes into account the correlation between the input signals. Moreover, this algorithm fits naturally with the framework of affine projection techniques extended to the two-channel case. Its computational complexity is less than half the complexity of the fastest two-channel RLS versions. Simulation results show the obtained performance.
On the poor robustness of sound equalization in reverberant environments
Authors: B. D. Radlovic
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

This paper examines the sensitivity of sound equalization to source or microphone position changes in a reverberant room. It is demonstrated that even small displacements from the reference (equalization) point, of the order of a tenth of the acoustic wavelength, can cause large degradations in the equalized room response. The general theory developed in this paper, which implies that the sound equalization in practical environments may be an ill-posed problem, is verified by the simulation results averaged over different source and microphone positions.
Characterization of Stratospheric Clear Air Turbulence for Air Force Platforms
Authors: Alex Mahalov, Mohamed Moustaoui, Basil Nichols
Venue: Proceedings of the HPCMP Users Group Conference (2006)

Stratospheric mechanical turbulence (altitudes 12-25km) is characterized by patchy high frequency fluctuations in the stratospheric wind fields and long-lived energetic eddies with a few hundred meters scales in the vertical. The thin Clear Air Turbulence (CAT) layers negatively impact the effective control, stability and performance of the newest generation of Unmanned Air Vehicles (UAV) such as the Global Hawk. Flying through stratospheric CAT causes the autopilot to begin pitch oscillations that seriously degrade photographic and synthetic aperture radar performance as well as putting the platform itself at risk. While there is a need for a real-time forecast of these thin stratospheric CAT layers, these cannot be resolved by even the latest generation of Weather Research and Forecasting (WRF) mesoscale meteorological codes. Some of the objectives of this challenge project are to influence the development of the next generation mesoscale numerical weather prediction codes for the lower stratosphere, by improving subgrid-scale parametrization of nonhomogeneous, anisotropic, non-Kolmogorov, patchy shear stratified stratospheric turbulence; and to enable forecasting of nonlinear, non-monochromatic inertia-gravity waves with large horizontal wavelengths (few hundred kilometers) which generate thin (few hundred meters) CAT layers.