ppxscal/embedding_network huggingface dataset:
Model checking electronic commerce protocols
Authors: Nevin Heintze, J. D. Tygar, Jeannette Wing, H. Chi Wong
Venue: Proceedings of the 2nd conference on Proceedings of the Second USENIX Workshop on Electronic Commerce - Volume 2 (1996)

The paper develops model checking techniques to examine NetBill and Digicash. We show how model checking can verify atomicity properties by analyzing simplified versions of these protocols that retain crucial security constraints. For our analysis we used the FDR model checker.
Sparse correlation kernel reconstruction
Authors: C. Papageorgiou
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

This paper presents a new paradigm for signal reconstruction and superresolution, correlation kernel analysis (CKA), that is based on the selection of a sparse set of bases from a large dictionary of class-specific basis functions. The basis functions that we use are the correlation functions of the class of signals we are analyzing. To choose the appropriate features from this large dictionary, we use support vector machine (SVM) regression and compare this to traditional principal component analysis (PCA) for the task of signal reconstruction. The testbed we use in this paper is a set of images of pedestrians. Based on the results presented here, we conclude that, when used with a sparse representation technique, the correlation function is an effective kernel for image reconstruction.
Beyond Performance Tools: Measuring and Modeling Productivity in HPC
Authors: Michael O. McCracken, Nicole Wolter, Allan Snavely
Venue: Proceedings of the 3rd International Workshop on Software Engineering for High Performance Computing Applications (2007)

Emerging challenges to productivity are not well covered by traditional methods for evaluating HPC programs, systems, and practices. The common measure of merit widely put forward in High-Performance Computing (HPC), high computational performance as measured in floating-point operations per second (FLOPs), does not account for many bottlenecks in real HPC workflow that increase time to solution which are unaffected by performance changes. In this paper we discuss these bottlenecks, show an approach to analyzing productivity based on measurement and modeling of HPC workflow, and present plans for measurement and experimentation tools to study and improve productivity in HPC projects with large computational and data requirements.
Admission control mechanism using measurement based dynamic provisioning in differentiated service networks
Authors: Woo-Seop Rhee, Jun-Hwa Lee, Mijung Yang, Jea-Hoon Yu, Sang-Ha Kim
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

The differentiated service architecture is based on a simple model by applying a per-class service in the core node of the network. However, due to the simplified network behaviour, the network structure and provisioning were more complicated. If a service provider wants the dynamic provisioning or better bandwidth guarantee, signaling protocol with QoS parameters or admission control method should be deployed in DiffServ network. However, these methods increase the complexity. Therefore, we propose new dynamic provisioning mechanism for admission control in the DiffServ network based on the centralized bandwidth broker and distributed measurement based admission control and movable boundary bandwidth management.
The Spectrum of the Corona of Two Graphs
Authors: S. Barik, S. Pati, B. K. Sarma
Venue: SIAM Journal on Discrete Mathematics (2007)

We consider only simple graphs. Given two graphs $G$ with vertices $1,\ldots,n$ and $H$, the corona $G\circ H$ is defined as the graph obtained by taking $n$ copies of $H$ and for each $i$ inserting edges between the $i$th vertex of $G$ and each vertex of the $i$th copy of $H$. For a connected graph $G$ and any $r$-regular graph $H$ we provide complete information about the spectrum of $G\circ H$ using the spectrum of $G$ and spectrum of $H$. Complete information about the Laplacian spectrum of $G\circ H$ is also provided even when $H$ is not regular. A graph $G$ is said to have the property (R) if $\frac{1}{\lambda}$ is an eigenvalue of $G$ whenever $\lambda$ is an eigenvalue of $G$. Further, if $\lambda$ and $\frac{1}{\lambda}$ have the same multiplicity, for each eigenvalue $\lambda$, then it is said to have the property (SR). We characterize all trees with property (SR) and show that such a tree is the corona product of some tree and an isolated vertex. We supply a family of bipartite graphs with property (R). As an application we construct infinitely many pairs of nonisomorphic graphs with the same spectrum and the same Laplacian spectrum. We prove some results about the eigenvector related to the second smallest eigenvalue of the Laplacian matrix of $G\circ H$ and give an application.
QUIP: a protocol for securing content in peer-to-peer publish/subscribe overlay networks
Authors: Amy Beth Corman, Peter Schachte, Vanessa Teague
Venue: Proceedings of the thirtieth Australasian conference on Computer science - Volume 62 (2007)

Publish/subscribe networks provide an interface for publishers to perform many-to-many communication to subscribers without the inefficiencies of broadcasting. Each subscriber submits a description of the sort of content they are interested in, then the publish/subscribe system delivers any appropriate messages as they are published. Although publish/subscribe networks offer advantages over traditional web-based content delivery, they also introduce security issues. The two security problems that we solve are: ensuring that subscribers can authenticate the messages they receive from publishers, and ensuring that publishers can control who receives their content. We propose QUIP, a protocol which adds efficient authentication and encryption mechanisms to existing publish/subscribe overlay networks. The idea is to combine an efficient traitor-tracing scheme (by Tzeng and Tzeng (2001)) with a secure key management protocol. This allows publishers to restrict their messages to authorised subscribers and to add and remove subscribers without affecting the keys held by the other subscribers.
Sustaining Incentive in Grid Resource Allocation: A Reinforcement Learning Approach
Authors: Li Lin, Yu Zhang, Jinpeng Huai
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

Encouraging resource sharing and cooperation among different parties is one of the central goals of grid computing. In real environments, however, selfish or malicious nodes can seriously degrade the sharing and cooperation performance of a grid. To solve this problem, we propose QIA, a novel Q-learning based resource Allocation mechanism that sustains Incentive for every participating node. Exploiting an economic model, QIA recognizes the importance of trust factor when allocating resources. Each provider considers a combined metric, which is composed of the bid price and the trust value, of a requester when allocating its resources. The incomplete information is a key issue for a provider in determining the relative weight of bid price and trust value. We propose a reinforcement Qlearning technique to resolve the issue, which is able to adapt the dynamics of grid environments. We implemented QIA in a real grid test-bed, CROWN grid. Comprehensive experiments have been conducted, which demonstrate the efficacy of QIA.
Scalability of the OLSR Protocol with the Fish Eye Extension
Authors: Dang Nguyen, Pascale Minet
Venue: Proceedings of the Sixth International Conference on Networking (2007)

Multi-hop wireless ad-hoc networks are drawing more and more attention from both academic and industrial research. The lack of infrastructure makes those networks easy to deploy, thus they can potentially include a large number of nodes. Consequently, the scalability issue of the routing protocol used should be addressed. The simulation of large and highly dense networks, with thousands of nodes, can take a long time to complete when using simulators like NS-2. In this paper, we propose a simple analytical model to study the scalability of the OLSR routing protocol. We focus on the protocol overhead and show that OLSR with the Fish-Eye extension can suppport large and dense networks. Our results show a good accuracy.
Efficient Task Migration for Message Driven Parallel Execution of Nonshared Memory Architectures
Authors: Nick Doulas, Balkrishna Ramkumar
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 02 (1994)

We discuss the design and implementation of task migration in the Charm parallel programming environment. Charm [7] is a language and run-time system for developing portable parallel applications for MIMD machines that supports a coarse-grained dataflow model of programming. We analyze the performance of migration in detail and demonstrate its efficiency on one nonshared memory machine: the nCUBE/2 hypercube.
Routing table minimization for irregular mesh NoCs
Authors: Evgeny Bolotin, Israel Cidon, Ran Ginosar, Avinoam Kolodny
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

The majority of current Network on Chip (NoC) architectures employ mesh topology and use simple static routing, to reduce power and area. However, regular mesh topology is unrealistic due to variations in module sizes and shapes, and is not suitable for application-specific NoCs. Consequently, simplistic routing techniques such as XY routing are inadequate, raising the need for low cost alternatives which can work in irregular mesh networks. In this paper we present a novel technique for reducing the total hardware cost of routing tables for both source and distributed routing approaches. The proposed technique is based on applying a fixed routing function combined with minimal deviation tables that are used only when the routing decisions for a given destination deviate from the predefined routing function. We apply this methodology to compare three hardware efficient routing methods for irregular mesh topology NoCs. For each method, we develop path selection algorithms that minimize the overall cost of routing tables. Finally, we demonstrate by simulations on random and specific real application network instances a significant cost saving compared to standard solutions, and examine the scaling of cost savings with growing NoC size.1
The Star Connected Cycles: A Fixed-Degree Network For Parallel Processing
Authors: Shahram Latifi, Marcelo Moraes de Azevedo, Nader Bagherzadeh
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 01 (1993)

This paper introduces a new interconnec tion network for massively parallel systems referred to as star connected cycles (SCC) graph. The SCC presents a fixed degree structure that results in several advantages over variable degree graphs like the star graph and the n-cube. The description of the SCC graph given in this paper in cludes issues such as labeling of nodes, degree, diameter, symmetry, fault tolerance and Cayley graph representation. The paper also presents an optimal routing algorithm for the SCC and a comparison with other interconnection net works. Our results indicate that for even n, an n-SCC and a CCC of similar sizes have about the same diameter.
A minimax optimization approach to sidelobe suppression filter design
Authors: S. C. Park
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

A sidelobe suppression filter is designed to operate simultaneously with a matched filter. For the purpose of the design, a filter is canonically decomposed into two orthogonal components. One is the conventional matched filter, the other is the sidelobe suppression filter. The minimax optimization technique is utilized to determine the optimal filter weights to minimize the peak sidelobe level of the combined filter output. The technique is also applied to design a close-in sidelobe-free filter. The sidelobe performance of the proposed filter is compared with those of the MMSE inverse filter and the matched filter. The loss in processing gain compared with a matched filter and the filtering complexity are also examined.
Event propagation for accurate circuit delay calculation using SAT
Authors: Suchismita Roy, P. P. Chakrabarti, Pallab Dasgupta
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (2007)

A SAT-based modeling for event propagation in gate-level digital circuits, which is used for accurate calculation of critical delay in combinational and sequential circuits, is presented in this article. The accuracy of the critical delay estimation process depends on the accuracy with which the circuit in operation is modeled. A high level of precision in the modeling of the internal events in a circuit for the sake of greater accuracy causes a combinatorial blowup in the size of the problem, resulting in a scalability bottleneck for which most existing techniques effect a trade-off by restricting themselves to less precise models. SAT based techniques have a good track record in efficiency and scalability when the problem sizes become too large for most other methods. This article proposes a SAT-based technique for symbolic event propagation within a circuit which facilitates the estimation of the critical delay of circuits with a greater degree of accuracy, while at the same time scaling efficiently to large circuits. We report very encouraging results on the ISCAS85 and ISCAS89 benchmark circuits using the proposed technique.
Code-Density Test of Analog-to-Digital Converters Using Single Low-Linearity Stimulus Signal
Authors: Le Jin, Degang Chen, Randall Geiger
Venue: Proceedings of the 25th IEEE VLSI Test Symmposium (2007)

High-precision ADC testing is a challenging problem because of its stringent requirement on test signal's linearity. This work introduces a method using a nonlinear stimulus signal for testing linearity of high-resolution cyclic and pipelined ADCs by exploiting their architecture information. Simulation and experiments show that 16-bit ADCs can be tested to 1- LSB accuracy by using a 7-bit linear signal. This approach provides a solution to both the production and on-chip testing problems of high-resolution ADCs.
Separation of a mixture of chaotic signals
Authors: T. Lo
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

A new technique is specifically devised to separate chaotic signals. In this approach, the authors reconstruct the trajectory of the mixture in an embedding space. The correlation characteristics of the trajectory in each dimension of the embedding space are then determined and used to reduce the separation problem into an eigen-problem that can be solved using linear algebra.
Power Electronics Laboratory at PUC Minas/Brazil: simulation and experiment's tools
Authors: L. de V.B. Machado Neto
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

The aim of the paper is to present the Power Electronics Laboratory, LABEP, which is part of the Polytechnic Institute of Pontificia Universidade Catolica de Minas Gerais (PUC Minas), Brazil. It focuses on electronics design automation, EDA tool use in the laboratory for development of practical courses and research projects. First, it presents the hardware and software infrastructure available. To exemplify the development of practical classes using the infrastructure, the article presents a step by step procedure for the study of the triphase thyristors inverter. The results of the procedure are presented and analyzed.
Minimum error-probability diversity detection over fading dispersive channels with non-Gaussian noise
Authors: S. Buzzi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

In this work we consider the problem of M-ary signal detection over a single-input-multiple-output channel affected by time- and/or frequency-dispersive Rayleigh-distributed fading and in the presence of non-Gaussian noise, modeled as a spherically invariant random process (SIRP). We derive the optimum (minimum error-probability) detector, and show that its structure is canonical, i.e. it is independent of the actual noise statistics. Finally, the performance analysis of the receiver highlights that the adoption of diversity represents a suitable means to restore performance also in the presence of dispersive fading and impulsive non-Gaussian noise.
An efficient kernel-based implementation of POSIX threads
Authors: Robert A. Alfieri
Venue: Proceedings of the USENIX Summer 1994 Technical Conference on USENIX Summer 1994 Technical Conference - Volume 1 (1994)

This paper describes the kernel-based implementation of POSIX Threads (Pthreads) in the DG/UXTM operating system. The implementation achieves time efficiency by using a general-purpose trap mechanism, known as a Kernel Function Call (KFC), that carries an order of magnitude less overhead than a traditional system call. On a 50 MHz Motorola MC88110, the implementation can create and exit a thread (with the associated context switch) in 8.1 microseconds and yield to another thread in 4.0 microseconds. The implementation also achieves space efficiency by paging and decoupling bulky data structures. The advantages of a kernel-based implementation include design simplicity, less code redundancy, optimization of global (interprocess) operations, avoidance of inopportune preemption, and global semantic flexibility. The disadvantage is a monolithic design that lacks user-level flexibility.
General purpose operating system support for multiple page sizes
Authors: Narayanan Ganapathy, Curt Schimmel
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1998)

Many commercial microprocessor architectures support translation lookaside buffer (TLB) entries with multiple page sizes. This support can be used to substantially reduce the overhead introduced by TLB misses incurred when the processor runs an application with a large working set. Applications are currently not able to take advantage of this hardware feature because most commercial operating systems support only one page size. In this paper we present a design that provides general purpose operating system support that allows applications to use multiple page sizes. The paper describes why providing this support is not as simple as it first seems. If not designed carefully, adding this support will require significant modifications and add a lot of overhead to the operating system. The paper shows how our approach simplifies the design without sacrificing functionality and performance. In addition, applications need not be modified to make use of this feature. The design has been implemented on IRIX 6.4 operating system running on the SGI Origin platform. We include some performance results at the end to show how our design allows applications to take advantage of large pages to gain performance improvements.
Architectural Knowledge Management Strategies: Approaches in Research and Industry
Authors: Muhammad Ali Babar, Remco C. de Boer, Torgeir Dingsoyr, Rik Farenhorst
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

The software architecture community has recently gained an increasing interest in managing architectural knowledge. However, up until now there have been no attempts to obtain an overview of the work in the field. In this paper we present a preliminary review on current approaches to architectural knowledge manage- ment. To this end, we compare approaches known from literature and encountered in industry with knowledge management theory. We found that in reports from research and practice there appears to be a preference to use the codification strategy. However, our obser- vations of the software architecture industry show that organizations in general tend to use a personalization strategy unintentionally. This paper serves as a call for awareness of this gap between intention and real- ity, and questions the biased focus on intentional cod- ification alone. We suggest to close this gap through focusing on hybrid approaches.
High-speed networking: a systematic approach to high-bandwidth low-latency communication
Authors: J. Sterbenz
Venue: Proceedings of the High Performance Interconnects, 2004. on Proceedings. 12th Annual IEEE Symposium (2004)

Summary form only given. The tutorial presents a comprehensive introduction to all aspects of high-speed networking, based on the book by J.P.G. Sterbenz and J.D. Touch ("High-Speed Networking: A Systematic Approach to High-Bandwidth Low-Latency Communication", John Wiley, 2001). The target audience includes computer scientists and engineers who may have expertise in a narrow aspect of high-speed networking, but want to gain a broader understanding of all aspects of high-speed networking and the impact that their designs have on overall network performance. The tutorial is not about any particular protocols and standards, but is rather a systemic and systematic approach to the principles that guide the research and design of high-speed networks, protocols, and applications. The tutorial presents a set of fundamental axioms, some major topics and a set of design principles that are defined and applied to each of the topics. A set of design techniques are introduced and applied as appropriate.
Facial Strain Pattern as a Soft Forensic Evidence
Authors: Vasant Manohar, Dmitry Goldgof, Sudeep Sarkar, Yong Zhang
Venue: Proceedings of the Eighth IEEE Workshop on Applications of Computer Vision (2007)

The success of forensic identification largely depends on the availability of strong evidence or traces that substantiate the prosecution hypothesis that a certain person is guilty of crime. In light of this, extracting subtle evidences which the criminals leave behind at the crime scene will be of valuable help to investigators. We propose a novel method of using strain pattern extracted from changing facial expressions in video as an auxiliary evidence for person identification. The strength of strain evidence is analyzed based on the increase in likelihood ratio it provides in a suspect population. Results show that strain pattern can be used as a supplementary biometric evidence in adverse operational conditions such as shadow lighting and face camouflage where pure intensity-based face recognition algorithms will fail.
Forecasting network traffic using FARIMA models with heavy tailed innovations
Authors: J. Ilow
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

This paper presents a data traffic model capable of describing the long-range as well as short-range dependence structure of packet data traffic. Specifically, we use the fractionally integrated autoregressive-moving average (FARIMA) process with non-Gaussian white driving sequence to describe packet arrival rate in a unit time. We introduce a procedure to estimate the fractional differencing parameter and ARMA coefficients: this procedure uses a cepstrum approach and does not require any prior knowledge about the driving noise distribution and the type of ARMA system. Since the main purpose of workload modeling is to aid in network performance evaluations, we are particularly interested in using the FARIMA model to predict bandwidth requirements for network traffic. We propose a dynamic bandwidth allocation strategy by employing linear predictors designed based on the estimated FARIMA parameters.