ppxscal/embedding_network huggingface dataset:
To infinity and beyond: time-warped network emulation
Authors: Diwaker Gupta, Kenneth Yocum, Marvin McNett, Alex C. Snoeren, Amin Vahdat, Geoffrey M. Voelker
Venue: Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3 (2006)

The goal of this work is to subject unmodified applications running on commodity operating systems and stock hardware to network speeds orders of magnitude faster than available at any given point in time. This paper describes our approach to time dilation, a technique to uniformly and accurately slow the passage of time from the perspective of an operating system by a specified factor. As a side effect, physical devices--including the network--appear relatively faster to both applications and operating systems. Both qualitative and statistical evaluations indicate our prototype implementation is accurate across several orders of magnitude. We demonstrate time dilation's utility by conducting high-bandwidth head-to-head TCP stack comparisons and application evaluation.
Asymmetric Hermitian and skew-Hermitian splitting methods for positive definite linear systems
Authors: Liang Li, Ting-Zhu Huang, Xing-Ping Liu
Venue: Computers Mathematics with Applications (2007)

In this paper, efficient iterative methods for the large sparse non-Hermitian positive definite systems of linear equations, based on the Hermitian and skew-Hermitian splitting of the coefficient matrix, are studied. These methods include an asymmetric Hermitian/skew-Hermitian (AHSS) iteration and its inexact version, the inexact asymmetric Hermitian/skew-Hermitian (IAHSS) iteration, which employs some Krylov subspace methods as its inner process. We theoretically study the convergence properties of the AHSS method and the IAHSS method. Moreover, the contraction factor of the AHSS iteration is derived. Numerical examples illustrating the effectiveness of both AHSS and IAHSS iterations are presented.
Short memory principle and a predictor-corrector approach for fractional differential equations
Authors: Weihua Deng
Venue: Journal of Computational and Applied Mathematics (2007)

Fractional differential equations are increasingly used to model problems in acoustics and thermal systems, rheology and modelling of materials and mechanical systems, signal processing and systems identification, control and robotics, and other areas of application. This paper further analyses the underlying structure of fractional differential equations. From a new point of view, we apprehend the short memory principle of fractional calculus and farther apply a Adams-type predictor-corrector approach for the numerical solution of fractional differential equation. And the detailed error analysis is presented. Combining the short memory principle and the predictor-corrector approach, we gain a good numerical approximation of the true solution of fractional differential equation at reasonable computational cost. A numerical example is provided and compared with the exact analytical solution for illustrating the effectiveness of the short memory principle.
Diameter and Routing in Enhanced OTIS Cube
Authors: Rajib K. Das
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

Enhanced OTIS-cube (E-OTIS-Q_{n}), a variation of the OTIS-cube (OTIS-Q_{n}) was proposed in [1]. E-OTIS-Q_n is regular of degree n + 1 and is obtained from the normal OTIS-cube by adding some extra links. In [1], it was shown that the diameter of E-OTIS-Qn is less than or equal to \left\lfloor {\frac{{4n + 5}} {3}} \right\rfloorand a heuristic for point-to-point routing has been proposed. In this paper, an optimal algorithm for one-to-one routing in E-OTIS-Q_n has been developed. We have shown that the diameter of E-OTIS-Qn is equal to \left\lfloor {\frac{{4n + 4}} {3}} \right\rfloorwhich is almost two-third of the diameter of OTIS-Q_n.
Mixed signal design watermarking for IP protection
Authors: Rexford D. Newbould, David L. Irby, Jo Dale Carothers, Jeffrey J. Rodriguez, W. Timothy Holman
Venue: Integrated Computer-Aided Engineering (2003)

Watermarking is the embedding of data in a medium for ownership, verification, distribution tracking, authentication, copyright protection, and data hiding. It has been well studied for use in digital media such as in audio, digital images and video. In this work, watermarking is extended to the realm of computer-aided design (CAD) for physical design of integrated circuits (IC's) in order to protect and facilitate re-use of intellectual property (IP) blocks (circuitry). As designs become more complex and cycle times shorter, the re-use of IP blocks is becoming more and more important. However, in order to aid in this re-use, improved methods of securing and tracking ownership need to be in place. Watermarking these valuable design blocks, whether custom transistors or standard cells, is shown to be a practical method of securing ownership of the property, even after local perturbations in the design. A method of watermarking circuit elements in both fully-custom analog or digital macrocell designs as well as analog or digital standard cell based designs is presented. This protection scheme thus applies to analog, digital, and mixed signal designs, with the only exception being that of a gate array implemented circuits.
Hierarchical cache consistency in a WAN
Authors: Jian Yin, Lorenzo Alvisi, Mike Dahlin, Calvin Lin
Venue: Proceedings of the 2nd conference on USENIX Symposium on Internet Technologies and Systems - Volume 2 (1999)

This paper explores ways to provide improved consistency for Internet applications that scale to millions of clients. We make four contributions. First, we identify how workloads affect the scalability of cache consistency algorithms. Second, we define two primitive mechanisms, split and join, for growing and shrinking consistency hierarchies, and we present a simple mechanism for implementing them. Third, we describe and evaluate policies for using split and join to address the fault tolerance and performance challenges of consistency hierarchies. Fourth, using synthetic workload and trace-based simulation, we compare various algorithms for maintaining strong consistency in a range of hierarchy configurations. Our results indicate that a promising configuration for providing strong consistency in a WAN is a two-level consistency hierarchy where servers and proxies work to maintain consistency for data cached at clients. Specifically, by adapting to clients' access patterns, two-level hierarchies reduce the read latency for demanding workloads without introducing excessive overhead for nondemanding workloads. Also, they can improve scalability by orders of magnitude. Furthermore, this configuration is easy to deploy by augmenting proxies, and it allows invalidation messages to traverse firewalls.
A soft real-time scheduling server on the Windows NT
Authors: Chih-han Lin, Hao-hua Chu, Klara Nahrstedt
Venue: Proceedings of the 2nd conference on USENIX Windows NT Symposium - Volume 2 (1998)

We present the design and implementation of a soft real time CPU server for the time-sensitive multimedia applications in the Windows NT environment. The server is a user-level daemon process from which multimedia applications can request and acquire periodic processing time in the well-known form of (processing time per period). Our server is based on a careful manipulation of the real time(RT) priority class, and it does not require any modifications to the kernel. It provides (1) the rate monotonic scheduling algorithm, (2) support for multiple processors (SMP model), (3) limited overrun protection among real-time (RT) processes, (4) fair allocation between the RT and time sharing (TS) processes so that TS processes are not starved for processing time, (5) accessibility by a normal user privilege, and (6) an efficient implementation. We have implemented the CPU scheduling server on top of the Windows NT 4.0 operating system with dual Pentium processors, and we have shown through experiments that our CPU scheduling server provides good soft real time support for the multimedia applications.
Multiplicity theorems for scalar periodic problems at resonance with p-Laplacian-like operator
Authors: Leszek Gasiński
Venue: Journal of Global Optimization (2007)

In this paper, we study the existence of multiple solutions for nonlinear scalar periodic problems at resonance with p-Laplacian-like operator. Using the Ekeland variational principle a two-solution theorem is obtained and using also a local linking theorem a three-solution theorem is proved.
Computation of channel APP for magnetic recording channels with colored noise
Authors: N. Wei, M. Motani, H. K. Garg
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

The paper considers the issue of channel a posteriori probability (APP) computation for equalized Lorentzian magnetic recording channels with colored noise. Most work on the application of turbo codes to magnetic recording channels has focused on ideal partial response (PR) channels with additive white Gaussian noise (AWGN). Since the channel APP detector assumes uncorrelated Gaussian noise, the performance of turbo codes on the more realistic equalized Lorentzian channel with correlated noise is much worse than on an ideal PR channel. To deal with the colored noise, we consider modifications to the computation of the channel APP tuned to the colored noise statistics of the equalized channel. We first apply the soft-output detector (SOD) for Markov noise from Kavcic (1999) with some modification in the branch metric computation. We then propose a new forward extended detector (FED) for Gaussian colored noise. Simulations of a rate 8/9 turbo code on a PR4-equalized Lorentzian channel with colored noise for both detectors are conducted. With FED, we observe a gain of 1.1 dB at a bit error rate of 10/sup -5/ relative to the conventional APP channel detector for user density of 2.0 and a gain of 1.8 dB for user density of 2.5.
Learning parallel portfolios of algorithms
Authors: Marek Petrik, Shlomo Zilberstein
Venue: Annals of Mathematics and Artificial Intelligence (2006)

A wide range of combinatorial optimization algorithms have been developed for complex reasoning tasks. Frequently, no single algorithm outperforms all the others. This has raised interest in leveraging the performance of a collection of algorithms to improve performance. We show how to accomplish this using a Parallel Portfolio of Algorithms (PPA). A PPA is a collection of diverse algorithms for solving a single problem, all running concurrently on a single processor until a solution is produced. The performance of the portfolio may be controlled by assigning different shares of processor time to each algorithm. We present an effective method for finding a PPA in which the share of processor time allocated to each algorithm is fixed. Finding the optimal static schedule is shown to be an NP-complete problem for a general class of utility functions. We present bounds on the performance of the PPA over random instances and evaluate the performance empirically on a collection of 23 state-of-the-art SAT algorithms. The results show significant performance gains over the fastest individual algorithm in the collection.
Preliminary results of an NSF-sponsored software engineering pedagogical laboratory
Authors: S. H. Rubin
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 01 (1998)

Five experiments were proposed to the US National Science Foundation: functional decomposition; optimization random-basis testing; software retrieval for reuse; and expert language translation. The purpose of these experiments was to make the study of software engineering cohesive, interesting and, hopefully, fun for the students. They were to learn software engineering principles by doing rather than by memorizing definitions from a course text. Preliminary results evidence that while such learning constitutes effective job training and serves as a basis for further research, it needs to be carefully crafted with regard to student preparation.
Bayesian Networks for Knowledge-Based Authentication
Authors: Ye Chen, Divakaran Liginlal
Venue: IEEE Transactions on Knowledge and Data Engineering (2007)

Knowledge-based authentication (KBA) has gained prominence as a user authentication method for electronic transactions. This paper presents a Bayesian network model of KBA grounded in probabilistic reasoning and information theory. The probabilistic semantics of the model parameters naturally lead to the definitions of two key KBA metrics—guessability and memorability. The statistical modeling approach allows parameter estimation using methods such as the maximum likelihood estimator (MLE). The information-theoretic view helps to derive the closed-form solutions to estimating the guessability and guessing entropy metrics. The results related to KBA metrics and the models under different attacking strategies and factoid distributions are unified under a game-theoretic framework that yields lower and upper bounds of optimal guessability. The paper also proposes a methodology for implementing a Bayesian network-based KBA system. Further, an empirical evaluation of the relative merits of two Bayesian network structures for KBA, the Naive Bayes (NB) and the Tree Augmented Naive Bayes (TAN), confirms the hypothesis that the TAN structure is superior in terms of authentication accuracy and error rates. The results of the theoretical analysis and the empirical study provide insights into the KBA design problem and establish a foundation for future research in the KBA area.
Mandatory fields: a case study in the divergence between education and practice
Authors: Simon
Venue: Proceedings of the ninth Australasian conference on Computing education - Volume 66 (2007)

In an ideal world the practitioners, educators, and students in a given discipline would share much the same perspectives. In the real world these groups often display a marked divergence. We illustrate this divergence with a study of the usage of mandatory fields in databases, showing that practitioners often end up compromising data integrity by forcing the collection of data that is inaccurate and contrived. We follow the case study with an appeal to database educators to teach their students to give more serious consideration to the choice of mandatory fields.
Deformable Model Retrieval Based on Topological and Geometric Signatures
Authors: Gary K. L. Tam, Rynson W. H. Lau
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

With the increasing popularity of 3D applications such as computer games, a lot of 3D geometry models are being created. To encourage sharing and reuse, techniques that support matching and retrieval of these models are emerging. However, only a few of them can handle deformable models, that is, models of different poses, and these methods are generally very slow. In this paper, we present a novel method for efficient matching and retrieval of 3D deformable models. Our research idea stresses using both topological and geometric features at the same time. First, we propose Topological Point Ring (TPR) analysis to locate reliable topological points and rings. Second, we capture both local and global geometric information to characterize each of these topological features. To compare the similarity of two models, we adapt the Earth Mover Distance (EMD) as the distance function and construct an indexing tree to accelerate the retrieval process. We demonstrate the performance of the new method, both in terms of accuracy and speed, through a large number of experiments.
A Service-oriented Architecture for Business Intelligence
Authors: Liya Wu, Gilad Barash, Claudio Bartolini
Venue: Proceedings of the IEEE International Conference on Service-Oriented Computing and Applications (2007)

Business intelligence is a business management term used to describe applications and technologies which are used to gather, provide access to and analyze data and information about the organization, to help make better business decisions. In other words, the purpose of business intelligence is to provide actionable insight. Business intelligence technologies include traditional data warehousing technologies such as reporting, ad-hoc querying, online analytical processing (OLAP). More advanced business intelligence tools - such as HP Openview DecisionCenter - also include data-mining, predictive analysis using rule-based simulations, web services and advanced visualization capabilities. In this paper we describe a service-oriented architecture for business intelligence that makes possible a seamless integration of technologies into a coherent business intelligence environment, thus enabling simplified data delivery and low-latency analytics. We compare our service-oriented approach with traditional BI architectures, illustrate the advantages of the service oriented paradigm and share our experience and the lessons learned in architecting and implementing the framework.
Exchange rates forecasting using nonparametric methods
Authors: Marc Henry
Venue:  (2006)

The existence of non-linear deterministic structures in the dynamics of exchange rates has already been amply demonstrated in the literature. With my research, I try to explain if we can exploit these non-linear structures in order to improve our predictive ability and, secondly, if we can use these predictions to generate profitable strategies in the Foreign Exchange Market. To this purpose, I employ different nonparametric forecasting methods such as Nearest Neighbors, Genetic Programming, Artificial Neural Networks, Data-Fusion or an Evolutionary Neural Network. My analysis will be center on the specific case of the Yen/US$ and Pound Sterling/US$ exchange rates and it considers both point predictions and the anticipating of either depreciations or appreciations. My results reveal a slight forecasting ability for one-period-ahead which is lost when more periods ahead are considered, and my trading strategy obtains above-normal profits. However, when transaction costs are incorporated, the profits practically disappear or become negative.
Recognizing connected digits in a natural spoken dialog
Authors: M. Rahim
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

This paper addresses the general problem of connected digit recognition in the telecommunication environment. In particular, we focus on a task of recognizing digits when embedded in a natural spoken dialog. Two different design strategies are investigated: keyword detection of word spotting, and large-vocabulary continuous speech recognition. We characterize the potential benefits and describe the main components of each design method, including acoustic and language modeling, training and utterance verification. Experimental results on a subset of a database that includes customers responses to the open-ended prompt "How may I help you?" are presented. 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
Gate-Level Exception Handling Design for Noise Reduction in High-Speed VLSI Circuits
Authors: Sanghoan Chang, Gwan Choi
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

This paper presents a novel design approach for addressing the pressing problem of noise and signal integrity in highspeed circuits. The approach uses a combination of gatelevel redundancy in form of a shadow circuit, exception handling, and retry to tolerate random and delay faults that are of increasing concern in modern circuits. An empirical evidence of the delay/random fault problem is developed and a scheme to press clocking frequency beyond traditional limit is presented. The results show that approximately 10% improvement in clocking frequency can be achieved with almost negligible performance penalty and 5%-20% area overhead for the benchmark circuits studied.
Engineering cultures: addressing challenges of globalization to engineering education through human and cultural-centered problem solving
Authors: J. C. Lucena
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

Globalization challenges US engineering students to prepare for work in a culturally diverse environment where they will encounter non-US engineers defining and solving problems. The purpose of this course is to help students learn about engineering in different times and places so they can recognize, understand, respect, and possibly even value perspectives other than their own.
FOSLL* Method for the Eddy Current Problem with Three-Dimensional Edge Singularities
Authors: Eunjung Lee, Thomas A. Manteuffel
Venue: SIAM Journal on Numerical Analysis (2007)

In the case that the domain has reentrant edges, the standard finite element method loses its global accuracy because of singularities on the boundary. To overcome this difficulty, FOSLL&ast; is applied in this paper. FOSLL&ast; is a methodology for solving PDEs using the dual operator. Here, a modified FOSLL&ast; method is developed that employs a partially weighted functional and allows the use of a standard finite element scheme without losing global accuracy.
Using a sigmoid transformation for improved modeling of phoneme duration
Authors: K. E. A. Silverman
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

The "sums-of-products" approach has emerged as one of the most promising avenues to model contextual influences on phoneme duration. The associated regression is generally applied after log-transforming the durations. This paper presents empirical and theoretical evidence which suggests that this transformation is not optimal. A promising alternative solution is proposed, based on a sigmoid function. Preliminary experimental results obtained on over 50,000 phonemes in varied prosodic contexts show that this transformation reduces the unexplained deviations in the data by more than 30%. Alternatively, for a given level of performance, it halves the number of parameters required by the model.
On-line learning networks: Framework and scenarios
Authors: Rosa Maria Bottino
Venue: Education and Information Technologies (2007)

The idea of using the internet as a platform to mediate social interactions and learning at different levels has progressively affirming itself, and this has given rise to a huge number of spontaneous and planned collectives, which are often described as on-line learning networks. On-line learning networks create value through the combination of content and people's knowledge. They can vary widely in the strength and permanence of their connections and the resources necessary to maintain them. Aspects of both a pragmatic and social nature need to be carefully considered in the process of initiation of on-line learning communities. This paper considers learning networks from the perspective of the potential they offer to the strengthening of relationships among institutions, groups, and people sharing a common interest in computer-enhanced learning. Some case studies are analysed and an analytical framework is sketched out to guide observations and to provide a lens through which case studies can be interpreted. The final goal is to delineate a reference for identifying strong and weak elements in virtual networks and to examine under what conditions they are succeeding. In addition, some possible scenarios for on-line networks are delineated along two main lines: the organisation and structure of the network and its level of establishment.