ppxscal/embedding_network huggingface dataset:
Chairs' welcome message
Authors: A. J. Hu, I. G. Harris
Venue: Proceedings of the High-Level Design Validation and Test Workshop, 2004. Ninth IEEE International (2004)

In this paper we present techniques for comparison between behavioral level and register transfer level (RTL) design descriptions by mapping the designs into virtual controllers and virtual datapaths. We also discuss about how the equivalence between behavioral level and RTL designs can be defined precisely using the proposed "attribute statements" in an interactive fashion. Implementation issues as well as considerations on real life industrial design examples are presented as well.
Linguistic Interpretations of Scuba Dive Computer Data
Authors: Somayajulu G. Sripada, Feng Gao
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

Exploratory visualizations of dive computer data are available to the scuba diving community to examine the safety of their recorded dives. In a study involving certified scuba divers on the usage of these visualizations we found that these are not used regularly which agrees well with the suspicions expressed by the medical staff who attend to patients with diving related illnesses. We built a prototype knowledge based system that interprets dive computer data to automatically generate their linguistic interpretations to supplement the existing visualizations. We hypothesized that linguistic interpretations by virtue of their structure communicate safety related messages directly to divers. Our evaluation showed that divers like the idea of integrating linguistic interpretations into existing visualizations. However, the study also showed that linguistic interpretations can be useful only if they are emotionally appropriate to individual divers.
Agent-environment interaction in a multi-agent system: a formal model
Authors: Gemma Bel-Enguix, M. Dolores Jimenez-Lopez
Venue: Proceedings of the 2007 GECCO conference companion on Genetic and evolutionary computation (2007)

In this paper, we introduce a formal-language model for explicitly formalizing agent-environment interaction in a multi-agent systems (MAS) framework: Conversational Grammar Systems(CGS). The main goal of the model is to provide a formal framework for defining how agents interact with environments in MAS. CGS offer a model with a high degree of flexibility, what means that they are able to accept new concepts and modify rules, protocols and settings during the computation. Evolution and action are involved in a consistent way in environment, while interaction of agents with the medium is constant. Based on a consolidated and active branch in the field of formal language theory, CGS are a highly formalized framework based in the postulates of artificial life that seems to be quite easy to implement, due to the simplicity of the formalism and the computational background of the theory they use.
Does teaching online take more time?
Authors: G. W. Hislop
Venue: Proceedings of the Frontiers in Education Conference, 2001. on 31st Annual - Volume 01 (2001)

Many instructors feel that teaching online takes more time, but there is relatively little data available on this issue. This paper discusses a study that involves detailed recording of instructor time in online and traditional course sections to support a comparison between the two modes of delivery. The presentation describes the study approach and problems encountered in trying to get an accurate picture of instructor time. The presentation also includes results of an analysis of instructor time for a series of course section pairs. Each section pair includes one online and one face-to-face section of the same course taught by the same faculty member. The data provides some general support for the notion that teaching online may take more time than teaching face-to-face. However, the amount of difference tends to be small, and there are some indications that this relationship between teaching mode and time is more complicated than generally assumed.
Being Sensitive to Uncertainty
Authors: Leon M. Arriola, James M. Hyman
Venue: Computing in Science and Engineering (2007)

Predictive modeling's effectiveness is hindered by inherent uncertainties in the input parameters. Sensitivity and uncertainty analysis quantify these uncertainties and identify the relationships between input and output variations, leading to the construction of a more accurate model. This survey introduces the application, implementation, and underlying principles of sensitivity and uncertainty quantification.
TVCAR models for forecasting
Authors: Federico Palacios-González
Venue: Neurocomputing (2007)

This paper predicts the 100 missing values in the CATS Benchmark using a Time-Varying Coefficient Autoregressive Model (TVCAR). The TVCAR model is an autoregressive model in which the coefficients vary smoothly with time. The model is fitted to the first differences of the data by minimising the residual sum of squared, subject to certain restrictions that enable the gaps left by the missing observations to be bridged. The path of each time-varying coefficient is initially described by a combination of cosine functions. Later, the method is improved replacing the cosine specifications by piecewise polynomials.
Isolating Mechanisms in COTS-based Systems
Authors: M. T. Gamble, R. F. Gamble
Venue: Proceedings of the Sixth International IEEE Conference on Commercial-off-the-Shelf (COTS)-Based Software Systems (2007)

Software composition relies on the interaction of software components, either new or sourced from COTS software vendors. Successful component interaction assumes interoperability, which requires the sharing of common characteristics. Shared characteristics make "like" components integrate more easily but also create isolating mechanisms that prevent or inhibit interaction with components that lack such characteristics. Designing systems from COTS components requires understanding their inherent isolating mechanisms. Most approaches only examine composed systems from the perspective of their integration properties. Ignoring or suppressing isolating mechanisms can lead to a partially composed system. Problems may surface anywhere in the system lifecycle including late binding situations at runtime. We examine how shared properties both facilitate membership in a population of like components; yet also serve to inhibit interaction with non-like components. Isolating mechanisms are shown to act across many system levels in the context of COTS based systems.
Context-aware Web Services for Distributed Retrieval of Points of Interest
Authors: Claudio Bettini, Daniele Riboni
Venue: Proceedings of the Second International Conference on Internet and Web Applications and Services (2007)

Due to the widespread availability of accurate localization technologies, navigation systems are more and more present on mobile devices. These applications usually provide facilities for managing and searching points of interest. However, currently available navigation software does not support sharing of points of interest, and the search facilities are quite primitive, being exclusively based on location and categories. In this paper we present novel algorithms for context-aware retrieval of distributed resources. These algorithms can be executed on any unstructured peer-to-peer network, and are based on the distributed evaluation of a scoring function that takes into account a wide set of context data. The algorithms preserve the correctness of the result set until a certain time-to-live, while reducing the exchange of data in the network. The proposed algorithms have been integrated into aWeb service-based, peer-to-peer system for management and sharing of an extended form of points of interest.
Attacks are Protocols Too
Authors: Anders Moen Hagalisletto
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

In this paper we show how to simulate attacks on authentication protocols in a realistic environment. The attack on the Needham-Schroeder public key protocol found by Gavin Lowe is run inside a malicious agent communicating with normal agents. The simulator is also able to detect flaws in attacks: a previously unreported error on an attack on the Shamir Rivest Adelman is detected by simulation.
The sonel mapping acoustical modeling method
Authors: Bill Kapralos
Venue:  (2006)

This work investigates the application of photon mapping to model environmental acoustics. The resulting acoustic sonel mapping technique is a Monte-Carlo based approach that can be used to model acoustic environments while accounting for diffuse and specular acoustic reflections as well as diffraction effects. This modeling is performed in an efficient manner in contrast to available deterministic techniques. The sonel mapping approach models many of the subtle interaction effects required for realistic acoustical modeling.
The Message Flow Model for Routing in Wormhole-Routed Networks
Authors: Xiaola Lin, Philip K. McKinley, Lionel M. Ni
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 01 (1993)

In this paper, we introduce a new approach to deadlock-free routing in wormhole-routed networks called the message flow model. We first establish the necessary and sufficient condition for deadlock-free routing based on the analysis of the message flow on each channel. We then show how to use the model to prove that a given adaptive routing algorithm is deadlock-free. Finally, we use the method to de¬ velop new, efficient adaptive routing algorithms for 2D meshes and hypercubes.
An agent-based distributed decision support system framework for mediated negotiation
Authors: Cliff T. Ragsdale
Venue:  (2004)

Implementing an e-market for limited supply perishable asset (LiSPA) products is a problem at the intersection of online purchasing and distributed decision support systems (DistDSS). In this dissertation, we introduce and define LiSPA products, provide real-world examples, develop a framework for a distributed system to implement an e-market for LiSPA products, and provide proof-of-concept for the two major components of the framework. The DistDSS framework requires customers to instantiate agents that learn their preferences and evaluate products on their behalf. Accurately eliciting and modeling customer preferences in a quick and easy manner is a major hurdle for implementing this agent-based system. A methodology is developed for this problem using conjoint analysis and neural networks. The framework also contains a model component that is addressed in this work. The model component is presented as a mediator of customer negotiation that uses the agent-based preference models mentioned above and employs a linear programming model to maximize overall satisfaction of the total market.
Factors affecting website reconstruction from the web infrastructure
Authors: Frank McCown, Norou Diawara, Michael L. Nelson
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

When a website is suddenly lost without a backup, it maybe reconstituted by probing web archives and search engine caches for missing content. In this paper we describe an experiment where we crawled and reconstructed 300 randomly selected websites on a weekly basis for 14 weeks. The reconstructions were performed using our web-repository crawler named Warrick which recovers missing resources from the Web Infrastructure (WI), the collective preservation effort of web archives and search engine caches. We examine several characteristics of the websites over time including birth rate, decay and age of resources. We evaluate the reconstructions when compared to the crawled sites and develop a statistical model for predicting reconstruction success from the WI. On average, we were able to recover 61% of each website's resources. We found that Google's PageRank, number of hops and resource age were the three most significant factors in determining if a resource would be recovered from the WI.
On communication diversity for blind identifiability and the uniqueness of low-rank decomposition of N-way arrays
Authors: N. D. Sidiropoulos
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

Blind separation of communication signals invariably relies on some form(s) of diversity to overdetermine the problem and thereby recover the signals of interest. More often than not, linear (e.g., spreading) diversity is employed, i.e., each diversity branch provides a linear combination of the unknown signals, albeit with possibly unknown weights. If multiple forms of linear diversity are simultaneously available, then the resulting data exhibit multilinear structure, and the blind recovery problem can be shown to be tantamount to low-rank decomposition of the multi-dimensional received data array. This paper generalizes Kruskal's fundamental result on the uniqueness of low-rank decomposition of 3-way arrays to the case of multilinear decomposition of 4- and higher-way arrays. The result characterizes diversity combining for blind identifiability when N forms of linear diversity are available; that is the balance between different forms of diversity that guarantees blind recovery of all signals involved.
Edgewrite: a versatile design for text entry and control
Authors: Brad A. Myers
Venue:  (2006)

This dissertation presents a versatile design for text entry and control called EdgeWrite. EdgeWrite was designed to provide accessible text entry on a variety of platforms to people with motor impairments and to able-bodied users of small devices. The EdgeWrite design includes a square input area, four corner sensors, corner-sequence recognition, physical edges, goal crossing, and unistroke segmentation. Advanced EdgeWrite features include continuous recognition feedback, non-recognition retry, slip detection, and word-level stroking---concepts not before realized in a text entry method. The EdgeWrite alphabet, which is the same for all EdgeWrite versions, was designed for maximum guessability and learnability through participatory design. A key result is that EdgeWrite is about as guessable as Palm OS Graffiti, a method lauded for its immediate usability. Multiple versions of EdgeWrite were built and user-tested, including Stylus EdgeWrite for the Palm OS, Joystick EdgeWrite for game controllers and power wheelchairs, Touchpad EdgeWrite, Trackball EdgeWrite, Isometric Joystick EdgeWrite for mobile phones, and EdgeWrite on four keys or sensors. For each version, empirical results from formal user studies were obtained. Of particular importance for users with motor impairments are the results for Stylus and Trackball EdgeWrite, which show marked improvements over existing techniques. In addition, five versions of EdgeWrite built by other researchers further highlight EdgeWrite's versatility. As part of EdgeWrite's ongoing evaluations, a new character-level error analysis for text entry input streams was developed. This error analysis and the algorithms that automate it constitute a methodological and theoretical contribution to the field of text entry evaluation and measurement. The thesis is: A versatile design for text entry and control called "Edge Write," which uses physical edges, goal crossing, and a minimized need for sensing, is effective on handhelds and desktops for people with motor and situational impairments.
Introducing probabilistic adaptive mapping developmental genetic programming with redundant mappings
Authors: Garnett Wilson, Malcolm Heywood
Venue: Genetic Programming and Evolvable Machines (2007)

Developmental Genetic Programming (DGP) algorithms have explicitly required the search space for a problem to be divided into genotypes and corresponding phenotypes. The two search spaces are often connected with a genotype-phenotype mapping (GPM) intended to model the biological genetic code, where current implementations of this concept involve evolution of the mappings along with evolution of the genotype solutions. This work presents the Probabilistic Adaptive Mapping DGP (PAM DGP), a new developmental implementation that involves research contributions in the areas of GPMs and coevolution. The algorithm component of PAM DGP is demonstrated to overcome coevolutionary performance problems that are identified and empirically benchmarked against the latest competing algorithm that adapts similar GPMs. An adaptive redundant mapping encoding is then incorporated into PAM DGP for further performance enhancement. PAM DGP with two mapping types are compared to the competing Adaptive Mapping algorithm and Traditional GP in two medical classification domains, where PAM DGP with redundant encodings is found to provide superior fitness performance over the other algorithms through it's ability to explicitly decrease the size of the function set during evolution.
Nonsingular mixed graphs with few eigenvalues greater than two
Authors: Yi-Zheng Fan, Shi-Cai Gong, Jun Zhou, Ying-Ying Tan, Yi Wang
Venue: European Journal of Combinatorics (2007)

Let G be a nonsingular connected mixed graph. We determine the mixed graphs G on at least seven vertices with exactly two Laplacian eigenvalues greater than 2. In addition, all mixed graphs G with exactly one Laplacian eigenvalue greater than 2 are also characterized.
Mandarin accent adaptation based on context-independent/context-dependent pronunciation modeling
Authors: Mingkuan Liu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

An accent adaptation approach using pronunciation variation modeling technology for the Mandarin accent was proposed in this paper. As the Chinese language is monosyllabic, the syllable pronunciation variation dictionary (SPVD) was built to depict the characteristics of accent. Firstly, the pronunciation modeling technology was utilized to get the context-independent and context-dependent accent-specific syllable confusion matrix according to the acoustic recognition results (pin-yin stream). Then the accent-specific Chinese SPVD was constructed from this confusion matrix. Finally, N-Best acoustic recognition candidates were re-scored with the help of SPVD. The proposed method was experimented on INTEL Shanghai-Accent Mandarin Corpus and the 863 standard Mandarin acoustic recognizer. The syllable recognition error rate was reduced 15% by context-independent SPVD, and 20% by context-dependent SPVD.
Towards realizing a formal RBAC model in real systems
Authors: Gail-Joon Ahn, Hongxin Hu
Venue: Proceedings of the 12th ACM symposium on Access control models and technologies (2007)

There still exists an open question on how formal models can be fully realized in the system development phase. The Model Driven Development (MDD) approach has been recently introduced to deal with such a critical issue for building high assurance software systems. There still exists an open question on how formal models can be fully realized in the system development phase. The Model Driven Development (MDD) approach has been recently introduced to deal with such a critical issue for building high assurance software systems. The MDD approach focuses on the transformation of high-level design models to system implementation modules. However, this emerging development approach lacks an adequate procedure to address security issues derived from formal security models. In this paper, we propose an empirical framework to integrate security model representation, security policy specification, and systematic validation of security model and policy, which would be eventually used for accommodating security concerns during the system development. We also describe how our framework can minimize the gap between security models and the development of secure systems. In addition, we overview a proof-of-concept prototype of our tool that facilitates existing software engineering mechanisms to achieve the above-mentioned features of our framework.
Low Power Embedded Deterministic Test
Authors: Dariusz Czysz, Grzegorz Mrugalski, Janusz Rajski, Jerzy Tyszer
Venue: Proceedings of the 25th IEEE VLSI Test Symmposium (2007)

This paper presents a novel low power test scheme integrated with the embedded deterministic test environment. It reduces switching rates in scan chains with no hardware modification. Experimental results obtained for industrial circuits indicate that switching activity can be reduced up to 23 times.
Blind image restoration via recursive filtering using deterministic constraints
Authors: D. Kundur
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

Classical linear image restoration techniques assume that the linear shift invariant blur, also known as the point-spread function (PSF), is known prior to restoration. In many practical situations, however, the PSF is unknown and the problem of image restoration involves the simultaneous identification of the true image and PSF from the degraded observation. Such a process is referred to as blind deconvolution. This paper presents a novel blind deconvolution method for image restoration. The method is flexible for incorporating different constraints on the true image. An example of the method is given for situations in which the imaged scene consists of a finite support object against a uniformly grey background. The only information required are the nonnegativity of the true image and the support size of the original object. For situations in which the exact object support is unknown, a novel support-finding algorithm is proposed.
Optimizing network virtualization in Xen
Authors: Aravind Menon, Alan L. Cox, Willy Zwaenepoel
Venue: Proceedings of the annual conference on USENIX '06 Annual Technical Conference (2006)

In this paper, we propose and evaluate three techniques for optimizing network performance in the Xen virtualized environment. Our techniques retain the basic Xen architecture of locating device drivers in a privileged 'driver' domain with access to I/O devices, and providing network access to unprivileged 'guest' domains through virtualized network interfaces. First, we redefine the virtual network interfaces of guest domains to incorporate high-level network offfload features available in most modern network cards. We demonstrate the performance benefits of high-level offload functionality in the virtual interface, even when such functionality is not supported in the underlying physical interface. Second, we optimize the implementation of the data transfer path between guest and driver domains. The optimization avoids expensive data remapping operations on the transmit path, and replaces page remapping by data copying on the receive path. Finally, we provide support for guest operating systems to effectively utilize advanced virtual memory features such as superpages and global page mappings. The overall impact of these optimizations is an improvement in transmit performance of guest domains by a factor of 4.4. The receive performance of the driver domain is improved by 35% and reaches within 7% of native Linux performance. The receive performance in guest domains improves by 18%, but still trails the native Linux performance by 61%. We analyse the performance improvements in detail, and quantify the contribution of each optimization to the overall performance.