ppxscal/embedding_network huggingface dataset:
Prediction of delay time for future LSI using on-chip transmission line interconnects
Authors: Takumi Uezono, Junpei Inoue, Takanori Kyogoku, Kenichi Okada, Kazuya Masu
Venue: Proceedings of the 2005 international workshop on System level interconnect prediction (2005)

An on-chip transmission-line interconnect has been proposed to reduce the delay time and power consumption. Transmission lines are used to replace long RC interconnects, and can greatly improve circuit performance. In this work, we estimate the performance of circuits using on-chip transmission line technologies, focusing on delay improvement. A derivation algorithm for the wire length of each path in a circuit is proposed. In simulated results, replacement with an on-chip transmission line can improve the critical-path delay by 10%.
Robust Instantaneous Rigid Motion Estimation
Authors: Karl Pauwels, Marc M. Van Hulle
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

A novel, nonlinear algorithm is introduced for the estimation of rigid camera motion from instantaneous velocity measurements in the calibrated case. It is shown that by minimizing an approximation to the image-reprojection error rather than the actual error, as done by the optimal algorithms, the proposed algorithm achieves largely increased robustness to local minima at the cost of a slightly decreased accuracy.
A logical approach to multilevel security of probabilistic systems
Authors: James W. Gray,  III, Paul F. Syverson
Venue: Distributed Computing (1998)

We set out a modal logic for reasoning about multilevel security of probabilistic systems. This logic contains expressions for time, probability, and knowledge. Making use of the Halpern-Tuttle framework for reasoning about knowledge and probability, we give a semantics for our logic and prove it is sound. We give two syntactic definitions of perfect multilevel security and show that their semantic interpretations are equivalent to earlier, independently motivated characterizations. We also discuss the relation between these characterizations of security and between their usefulness in security analysis.
Streaming flow analyses for prefetching in segment-based proxy caching to improve delivery quality
Authors: Songqing Chen, Bo Shen, Susie Wee, Xiaodong Zhang
Venue: Web content caching and distribution: proceedings of the 8th international workshop (2004)

Segment-based proxy caching schemes have been effectively used to deliver streaming media objects. However, this approach does not always guarantee continuous delivery because the to-be-viewed segments may not be cached in the proxy in time. The potential consequence is the playback jitter at the client side due to the proxy delay in fetching these uncached segments, thus we call the problem proxy jitter. Aiming at improving the media delivery quality for segment-based caching schemes, in this paper we propose two simple and effective prefetching methods, namely, look-ahead window based prefetching and active prefetching to address the problem of proxy jitter. We focus on presenting streaming flow analyses on proxy and network resource utilizations and consumptions, performance potentials and limits of the two prefetching methods for different segment-based schemes under different network bandwidth conditions. Our study also provides some new insights into relationships between proxy caching performance and the quality of streaming. For example, we show that the objective of improving the byte hit ratio in a conventional proxy and the unique objective of minimizing the proxy jitter to deliver streaming media objects can have conflicting interests. Trace-driven simulations show the effectiveness of our prefetching methods, and further confirm our analyses.
A Proposed Hybrid Recurrent Neural Control System for Two Co-operating Robots
Authors: "Ahin Yildirim
Venue: Journal of Intelligent and Robotic Systems (2005)

This paper discusses a model refernce adaptive (MRAC) position/force controller using proposed neural networks for two co-operating planar robots. The proposed neural network is a recurrent hybrid network. The recurrent networks have feedback connections and thus an inherent memory for dynamics, which makes them suitable for representing dynamic systems. A feature of the networks adopted is their hybrid hidden layer, which includes both linear and nonlinear neurons. On the other hand, the results of the case of a single robot under position control alone are presented for comparison. The results presented show the superior ability of the proposed neural network based model reference adaptive control scheme at adapting to changes in the dynamics parameters of robots.
Adaptive QoS Control Based on Benefit Optimization for Video Servers Providing Differentiated Services
Authors: Ing-Ray Chen, Sheng-Tun Li, I-Ling Yen
Venue: Multimedia Tools and Applications (2005)

We propose and analyze quality of service (QoS) control algorithms for video servers designed to provide differentiated video streaming services. The design concepts are based on resource reservation and benefit optimization so that resources are reserved dynamically and adaptively for different QoS levels in response to the changing workload of the system, with the objective of maximizing the benefit throughput obtainable by the system. We analyze the benefit throughput obtainable by the system for a baseline algorithm for which the QoS levels of admitted users are not changed during the service lifetime and a greedy algorithm that may raise QoS levels of admitted users due to resources being free from departure events. We validate the design of these two QoS control algorithms via a detailed simulation study.
Solving the block&ndash;Toeplitz least-squares problem in parallel: Research Articles
Authors: P. Alonso, J. M. Badía, A. M. Vidal
Venue: Concurrency and Computation: Practice Experience (2005)

In this paper we present two versions of a parallel algorithm to solve the block&ndash;Toeplitz least-squares problem on distributed-memory architectures. We derive a parallel algorithm based on the seminormal equations arising from the triangular decomposition of the product TTT. Our parallel algorithm exploits the displacement structure of the Toeplitz-like matrices using the Generalized Schur Algorithm to obtain the solution in O(mn) flops instead of O(mn2) flops of the algorithms for non-structured matrices. The strong regularity of the previous product of matrices and an appropriate computation of the hyperbolic rotations improve the stability of the algorithms. We have reduced the communication cost of previous versions, and have also reduced the memory access cost by appropriately arranging the elements of the matrices. Furthermore, the second version of the algorithm has a very low spatial cost, because it does not store the triangular factor of the decomposition. The experimental results show a good scalability of the parallel algorithm on two different clusters of personal computers. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Interactive paraphrasing based on linguistic annotation
Authors: Ryuichiro Higashinaka, Katashi Nagao
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 2 (2002)

We propose a method "Interactive Paraphrasing" which enables users to interactively paraphrase words in a document by their definitions, making use of syntactic annotation and word sense annotation. Syntactic annotation is used for managing smooth integration of word sense definitions into the original document, and word sense annotation for retrieving the correct word sense definition for a word in a document. In this way, documents can be paraphrased so that they fit into the original context, preserving the semantics and improving the readability at the same time. No extra layer (window) is necessary for showing the word sense definition as in conventional methods, and other natural language processing techniques such as summarization, translation, and voice synthesis can be easily applied to the results.
Semantics of RTL and Validation of Synthesized RTL Designs Using Formal Verification in Reconfigurable Computing Systems
Authors: Phan C. Vinh, Jonathan P. Bowen
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

The functional validation of a state-of-the-art reconfigurable computing system design is usually a laborious,ad-hoc and open-ended task. It can be accomplished through two basic approaches: simulation and formal verification. In validation using a formal verifcation approach, it attempts to establish that the Register Transfer Level (RTLJ design synthesized from the algorithmic behavioral specification is mathematically correct. Therefore, finding the verification methods to provide accurate andfast validation easily would be very useful. In this paper. we develop a semantics based on a Partial Order Based Model (POM) for RTL and. through this semantics, propose a formal verification method to prove the correctness of the RTLsynthesis result. This method can be used to achieve the following. On one hand, it can accurately verify en RTL description with respect to a behavioral specifcation of the system; on the other hand, it can decide whether twoprocesses, which are supposed to implement the samefunction, have the same interactive behaviors so that one can be replaced by the other.
Sharepoint User's Guide
Venue:  (2005)

This straightforward guide shows SharePoint users how to create and use web sites for sharing and collaboration. Learn to use the document and picture libraries for adding and editing content, add discussion boards and surveys, receive alerts when documents and information have been added or changed, and enhance security. Designed to help you find answers quickly, the book shows how to make the most of SharePoint for productivity and collaboration.
Fast Parallel Table Lookups to Accelerate Symmetric-Key Cryptography
Authors: A. Murat Fiskiran, Ruby B. Lee
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

Table lookups are one of the most frequently-used operations in symmetric-key ciphers. Particularly in the newer algorithms such as the Advanced Encryption Standard (AES), we frequently find that the greatest fraction of the execution time is spent during table lookups, varying between 34% and 72% for the five representative ciphers we consider: AES, Blowfish, Twofish, MARS, and RC4. In order to accelerate and parallelize these table lookups, we describe a new parallel table lookup (ptlu) instruction. Our synthesis results indicate that such an instruction can be added to a basic RISC processor with no cycle time impact. We compare the performance of the ptlu instruction with the speedups available through more conventional architectural techniques such as multiple-issue execution. We find that the performance benefits of using the ptlu instruction can be far higher than increasing the number of instructions executed per cycle in superscalar or VLIW processors.
How peer photos influence member participation in online communities
Authors: Nishikant Kapoor, Joseph A. Konstan, Loren G. Terveen
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Online communities (OLCs) are gatherings of like-minded people, brought together in cyberspace by shared interests. Creating such communities is not a big challenge; sustaining members' participation is. In this paper, we describe a technique for presenting members' photos and evaluate how it affects member participation in the community. We compare three different policies for presenting peer photos on the home page of the web site. Our results show that explicit requests in the form of simple and short messages on the home page of a community can induce participation. We show that we were able to motivate members to (a) log into the system to see photos of fellow members, and (b) upload their personal photos.
Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
Authors: Yu-Hong Dai, Roger Fletcher
Venue: Numerische Mathematik (2005)

This paper studies projected Barzilai-Borwein (PBB) methods for large-scale box-constrained quadratic programming. Recent work on this method has modified the PBB method by incorporating the Grippo-Lampariello-Lucidi (GLL) nonmonotone line search, so as to enable global convergence to be proved. We show by many numerical experiments that the performance of the PBB method deteriorates if the GLL line search is used. We have therefore considered the question of whether the unmodified method is globally convergent, which we show not to be the case, by exhibiting a counter example in which the method cycles. A new projected gradient method (PABB) is then considered that alternately uses the two Barzilai-Borwein steplengths. We also give an example in which this method may cycle, although its practical performance is seen to be superior to the PBB method. With the aim of both ensuring global convergence and preserving the good numerical performance of the unmodified methods, we examine other recent work on nonmonotone line searches, and propose a new adaptive variant with some attractive features. Further numerical experiments show that the PABB method with the adaptive line search is the best BB-like method in the positive definite case, and it compares reasonably well against the GPCG algorithm of Mor&#x00e9; and Toraldo. In the indefinite case, the PBB method with the adaptive line search is shown on some examples to find local minima with better solution values, and hence may be preferred for this reason.
The Envelope of Lines Meeting a Fixed Line and Tangent to Two Spheres
Authors: G&#x00e1;bor Megyesi, Frank Sottile
Venue: Discrete Computational Geometry (2005)

We study the set of lines that meet a fixed line and are tangent to two spheres and classify the configurations consisting of a single line and three spheres for which there are infinitely many lines tangent to the three spheres that also meet the given line. All such configurations are degenerate. The path to this result involves the interplay of some beautiful and intricate geometry of real surfaces in 3-space, complex projective algebraic geometry, explicit computation and graphics.
Probabilistic and average widths of multivariate Sobolev spaces with mixed derivative equipped with the Gaussian measure
Authors: Chen Guanggui, Fang Gensun
Venue: Journal of Complexity (2004)

We present sharp bounds on the Kolmogorov probabilistic (N, δ)-width and p average N- width of multivariate Sobolev space with mixed derivative MW2r(Td), r = (r1 ..., rd), 1/2 < r1 = ... = rv < rv + 1 ≤ ... ≤ rd equipped with a Gaussian measure µ in Lq (Td), that is dN, δ (MW2r(Td)), µ, Lq (Td)) = (N-1 lnv-1 N)r1 ċ (ρ - 1)/2 (ln(v-1)/2 N) √ 1 + (1/N)ln(1/δ), dN(a) (MW2r(Td), µ, Lq (Td))p = (N-1 lnv-1 N)r1 ċ (ρ - 1)/2 (ln(v-1)/2 N), where 1 < q < ∞, 0 < p < ∞, and ρ > 1 is depending only on the eigenvalues of the correlation operator of the measure µ (see (4)).
Workshop on advances in model-based software testing
Authors: Siddhartha Dalal, Ashish Jain, Jesse Poore
Venue: Proceedings of the 27th international conference on Software engineering (2005)

The paper summarizes the themes and goals of the Workshop on Advances in Model-Based Software Testing.
Exploiting Prediction to Reduce Power on Buses
Authors: Victor Wen, Mark Whitney, Yatish Patel, John D. Kubiatowicz
Venue: Proceedings of the 10th International Symposium on High Performance Computer Architecture (2004)

We investigate coding techniques to reduce the energy consumed by on-chip buses in a microprocessor. We explore several simple coding schemes and simulate them using a modified SimpleScalar simulator and SPEC benchmarks. We show an average of 35% savings in transitions on internal buses. To quantify actual power savings, we design a dictionary based encoder/decoder circuit in a 0.13µm process, extract it as a netlist, and simulate its behavior under SPICE. Utilizing a realistic wire model with repeaters, we show that we can break even at median wire length scales of less than 11.5mm at 0.13µ and project a break-even point of 2.7mm for a larger design at 0.07µ.
JSDESLib: A Library for the Development of Discrete-Event Simulation Tools of Parallel Systems
Authors: Luis F. W. Goes, Christiane V. Pousa, Milene B. Carvalho, Luiz E. S. Ramos, Carlos A. P. S. Martins
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 5 - Volume 06 (2005)

In this paper, we present, verify and analyze the performance of JSDESLib (Java Simple Discrete-Event Simulation Library). It is a simplified and easy-to-use Java-based library for the development of discrete-event simulation tools of parallel systems. Our main objectives are: to propose, develop and implement JSDESLib: as a parallel event-oriented simulation library that simplifies the development of simulation tools; with a next earliest event mechanism and communication management between entities. Other main objectives are: to verify and analyze the performance of JSDESLib. A secondary objective is to present some simulation tools that were developed with that library. The main contributions of this work are: the proposal, implementation and performance analysis of JSDESLib; simplicity and ease usage of a parallel-optimized implementation of that library.
Modeling and Learning Contact Dynamics in Human Motion
Authors: Alessandro Bissacco
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

We propose a simple model of human motion as a switching linear dynamical system where the switches correspond to contact forces with the ground. This significantly improves the modeling performance when compared to simpler linear systems, with only marginal increase in complexity. We introduce a novel closed-form (non-iterative) algorithm to estimate the switches and learn the model parameters in between switches. We validate our model qualitatively by running simulations, and quantitatively by computing prediction errors that show significant improvements over previous approaches using linear models.
Domain Specific Reconfigurable Processing Core Architecture for Digital Filtering Applications
Authors: Sangjin Hong, Shu-Shin Chin
Venue: Journal of VLSI Signal Processing Systems (2005)

This paper presents a reconfigurable processing core architecture targeted for digital filtering applications. The architecture can be configured to execute linear phase FIR filter, DLMS adaptive FIR filter, (I)FFT, and 2D-(I)DCT with high performance and low energy consumption by reducing heavy routing resources used extensively in other reconfigurable architectures. The pipeline depth of the multipliers in the processing core is locally controlled so that power consumption is reduced by minimizing unnecessary register switching is saved. We have shown that the proposed processing core consumes less energy and has better or comparable performance than that of the existing reconfigurable architectures proposed in academia and industry, that have been tailored for these applications. The circuit is designed in 0.35-¿m CMOS processing technology with 3.3 V supply voltage.
QoS modelling and analysis with UML-statecharts: the StoCharts approach
Authors: David N. Jansen, Holger Hermanns
Venue: ACM SIGMETRICS Performance Evaluation Review (2005)

The UML is an influential and widespread notation for high-level modelling of information processing systems. UML statechart diagrams are a graphical language to describe system behaviour. They consitute one of the most intensively-used formalisms comprised by the UML. However, statechart diagrams are lacking concepts for describing real-time, performance, dependability and quality of service (QoS) characteristics at a behavioural level.This note describes a QoS-oriented extension of UML statechart diagrams, called StoCharts. StoCharts enhance the basic statechart formalism with two distinguished features, both simple and easy to understand, yet powerful enough to model a sufficiently rich class of stochastic processes. This is illustrated by a selection of case studies performed using StoCharts. We review the main ingredients of StoCharts and survey tool support and case studies performed with the language, and place StoCharts in the context of other extensions of statechart diagrams.
Mining border descriptions of emerging patterns from dataset pairs
Authors: Guozhu Dong, Jinyan Li
Venue: Knowledge and Information Systems (2005)

The mining of changes or differences or other comparative patterns from a pair of datasets is an interesting problem. This paper is focused on the mining of one type of comparative pattern called emerging patterns. Emerging patterns are denoted by EPs and are defined as patterns for which support increases from one dataset to the other with a big ratio. The number of EPs is sometimes huge. To provide a good structure for and to reduce the size of mining results, we use borders to concisely describe large collections of EPs in a lossless way. Such a border consists of only the minimal (under set inclusion) and the maximal EPs in the collection. We also present an algorithm for efficiently computing the borders of some desired EPs by manipulating the input borders only. Our experience with many datasets in the UCI Repository and recent cancer diagnosis datasets demonstrated that: Both the EP pattern type and our algorithm are useful for building accurate classifiers and useful for mining multifactor interactions, for example, minimal gene groups potentially responsible for the development of cancer.
A Framework for Formal Specification of Embedded Systems
Authors: Frantisek Bures, Ondrej Rysavy, Frantisek Scuglik, Miroslav Sveda
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

This paper presents concepts of a specification-driven framework focusing on object-oriented design of embedded systems. It deals with tools and techniques aiming to prop formal specification and early design life cycle phases. Particularly, this contribution discusses logic calculus of objects, related class specification language, and techniques both for architecture specifications and for behavior specifications generated either from UML based semiformal behavioral diagrams or, as a reengineering tool, from source code.
Unstructured Point Cloud Matching within Graph-Theoretic and Thermodynamic Frameworks
Authors: A. Jagannathan, E. L. Miller
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

In the context of object recognition from point cloud data, we present a thermodynamically-inspired graph theoretic algorithm to address the problem of matching the scene and the model point clouds, when the cardinalities of the two sets are orders of magnitude different. Such an approach determines a subset of points from the model that is structurally and spatially as similar as possible to the set of points in the scene. A new formulation for graph enthalpy characterizes the structural differences between point sets, which together with the existing notions of graph entropy quantifies the Gibbsý Free Energy. A two-scale approach is proposed, wherein, at the coarse scale, a set of points that comprise the model neighborhood around the scene is identified by minimization of entropy. At the fine scale, the desired correspondence is achieved by a refinement process, aimed at maximizing the Gibbsý Free Energy. The results demonstrate the robustness and efficiency of the approach.