ppxscal/embedding_network huggingface dataset:
Predicting human interruptibility with sensors
Authors: James Fogarty, Scott E. Hudson, Christopher G. Atkeson, Daniel Avrahami, Jodi Forlizzi, Sara Kiesler, Johnny C. Lee, Jie Yang
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (2005)

A person seeking another person's attention is normally able to quickly assess how interruptible the other person currently is. Such assessments allow behavior that we consider natural, socially appropriate, or simply polite. This is in sharp contrast to current computer and communication systems, which are largely unaware of the social situations surrounding their usage and the impact that their actions have on these situations. If systems could model human interruptibility, they could use this information to negotiate interruptions at appropriate times, thus improving human computer interaction.This article presents a series of studies that quantitatively demonstrate that simple sensors can support the construction of models that estimate human interruptibility as well as people do. These models can be constructed without using complex sensors, such as vision-based techniques, and therefore their use in everyday office environments is both practical and affordable. Although currently based on a demographically limited sample, our results indicate a substantial opportunity for future research to validate these results over larger groups of office workers. Our results also motivate the development of systems that use these models to negotiate interruptions at socially appropriate times.
Provable bounds for portable and flexible privacy-preserving access
Authors: Marina Blanton, Mikhail J. Atallah
Venue: Proceedings of the tenth ACM symposium on Access control models and technologies (2005)

In this work we address the problem of portable and flexible privacy-preserving access rights for large online data repositories. Privacy-preserving access control means that the service provider can neither learn what access rights a customer has nor link a request to access an item to a particular customer, thus maintaining privacy of both customer activity and customer access rights. Flexible access rights allow any customer to choose any subset of items from the repository and correspondingly be charged only for the items selected. And portability of access rights means that the rights themselves can be stored on small devices of limited storage space and computational capabilities, and therefore the rights must be enforced using the limited resources available.Our main results are solutions to the problem that utilize minimal perfect hash functions and order-preserving minimal perfect hash functions. None of them use expensive cryptography, all require very little space, and they are therefore suitable for computationally weak and space-limited devices such as smartcards, sensors, etc. Performance of the schemes is measured as the probability of false positives (i.e., the probability that access to an unpurchased item will be permitted) for a given storage space bound. Using our techniques, for a data repository of size n and subscription order of m ll n items, we achieve a probability of false positives of m-c using only O(cm) bits of storage space, where c is an adjustable parameter (a constant or otherwise) that can be set to provide the desired performance. This is the first time that such provable bounds are established for this problem, and we believe the techniques we use are of more general interest through the unusual use we make of perfect hashing.
Fast Cycle-Accurate Simulation and Instruction Set Generation for Constraint-Based Descriptions of Programmable Architectures
Authors: Scott J. Weber, Matthew W. Moskewicz, Matthias Gries, Christian Sauer, Kurt Keutzer
Venue: Proceedings of the international conference on Hardware/Software Codesign and System Synthesis: 2004 (2004)

State-of-the-art architecture description languages have been successfully used to model application-specific programmable architectures limited to particular control schemes. In this paper, we introduce a language and methodology that provide a framework for constructing and simulating a wider range of architectures. The framework exploits the fact that designers are often only concerned with data paths, not the instruction set and control. In the framework, each processing element is described in a structural language that only requires the specification of the data path and constraints on how it can be used. From such a description, the supported operations of the processing element are automatically extracted and a controller is generated. Various architectures are then realized by composing the processing elements. Furthermore, hardware descriptions and bit-true cycle-accurate simulators are automatically generated. Results show that our simulators are up to an order of magnitude faster than other reported simulators of this type and two orders of magnitude faster than equivalent Verilog simulations.
GARCH, jumps and permanent and transitory components of volatility: the case of the Taiwan exchange rate
Authors: Shyh-Wei Chen, Chung-Hua Shen
Venue: Mathematics and Computers in Simulation (2004)

This paper investigates whether there are three distinctive features in financial asset prices, that is, time-varying conditional volatility, jumps and the component factors of volatility. It adopts a component-GARCH-Jump, which can efficiently capture the three features simultaneously. Our results demonstrate that the three features exist in the Taiwan exchange rate. Besides time-varying conditional volatility, our model identifies 172 jumps between 5 January 1988 and 21 March 2003. The empirical evidence shows that the permanent component of the conditional variance is a relatively smooth movement except for a fairly sharp shift which began in 1997. This means that the effect of the Asian crisis shock might very well have exerted not only a transitory jump effect, but also a permanent effect on Taiwan's exchange rate.
A novel adaptive control system for a custom-built tension-torsion machine
Authors: R. Padmanabhan, Nuri M. Zarroug, B. J. MacDonald, M. S. J. Hashmi
Venue: Advances in Engineering Software (2005)

Mathematical theories of elasticity-plasticity have received considerable development in recent years. However, the quantity of accurate experimental work, carried out to examine the validity of these theories appears to be limited. As the theories have increased in sophistication, the accuracy to which the experiments must be performed has also increased. In this paper the development and application of a novel adaptive control system for performing combined tension and torsion experiments on solid and tubular specimens is described. National Instruments LabVIEW (Laboratory Virtual Instrument Engineering Workbench) is used to control the axial and torsional loads on the specimen through data acquisition boards. LabVIEW software in conjunction with data acquisition board, servo-controllers and servomotors form the adaptive control system for the custom-built tension-torsion machine. Accurate control of the axial and torsional loads in the specimen is achieved with the application of the adaptive control system and a sample of the test results are presented in this paper.
Ad Hoc Key Management Infrastructure
Authors: B. Lehane, L. Dolye, D. O'Mahony
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

Key Management Infrastructure in an ad hoc network needs to be formed in an ad hoc manner. This paper introduces a novel multipurpose ad hoc Key Management Infrastructure (KMI) that can be used to provide Symmetric Key Infrastructure (SKI) or Public Key Infrastructure (PKI). A further application to group keying with distributed group membership management is also discussed.
mFAR: fixed-points-addition-based VLSI placement algorithm
Authors: Bo Hu, Yue Zeng, Malgorzata Marek-Sadowska
Venue: Proceedings of the 2005 international symposium on Physical design (2005)

A placement problem can be formulated as a quadratic program with non-linear constraints. Those constraints make the problem hard. Omitting the constraints and solving the unconstraint problem results in placement with substantial cell overlaps. To remove the overlaps, we introduce fixed points into the non-constrained quadratic-programming formulation. Acting as pseudo cells at fixed locations, they can be used to pull cells away from the dense regions to reduce overlapping. In this paper, we present a large-scale placement algorithm based on fixed-point addition.
Nanoelectronic single-electron transistor circuits and architectures: Research Articles
Authors: C. P. Gerousis, S. M. Goodnick, W. Porod
Venue: International Journal of Circuit Theory and Applications (2004)

Single-electron tunneling (SET) devices have been proposed as one promising candidate for future nanoelectronic integrated circuits. SETs have appealing properties for implementing ultra-dense and complex signal and image processing systems. The potential for very dense arrays of SET transistors makes them attractive for the realization of cellular non-linear network (CNN) circuits, where locally-connected cells may alleviate the interconnect problem facing conventional architectures as they scale.Herein, we investigate the use of nanoelectronic structures in CMOS-type digital circuits and in analog CNN architectures for potential application in future high-density and low-power CMOS-nanodevice hybrid circuits. We first present an overview of the operation of the SET transistor and simulation of SET circuits. We then discuss a programmable CMOS-type SET logic circuit based on a summing-node-inverter structure, followed by simple linear and 2-d SET-CNN architectures using the SET inverter topology as the basis for the non-linear transfer characteristics required of individual CNN elements. The simple SET-CNN cell acts as a summing node that is capacitively coupled to the inputs and outputs of nearest neighbour cells. Monte Carlo simulation results are then used to show CNN-like behaviour in attempting to realize different functionality such as shadowing, pattern forming, and horizontal-line detection. Within the context of these simple architectures, we discuss the speed and signal delay in SET non-linear circuits, and calculate the approximate power dissipation in a SET network. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Multiseed Lossless Filtration
Authors: Gregory Kucherov, Laurent Noe, Mikhail Roytberg
Venue: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) (2005)

We study a method of seed-based lossless filtration for approximate string matching and related bioinformatics applications. The method is based on a simultaneous use of several spaced seeds rather than a single seed as studied by Burkhardt and Kärkkäinen [1]. We present algorithms to compute several important parameters of seed families, study their combinatorial properties, and describe several techniques to construct efficient families. We also report a large-scale application of the proposed technique to the problem of oligonucleotide selection for an EST sequence database.
Data streaming algorithms for accurate and efficient measurement of traffic and flow matrices
Authors: Qi (George) Zhao, Abhishek Kumar, Jia Wang, Jun (Jim) Xu
Venue: ACM SIGMETRICS Performance Evaluation Review (2005)

The traffic volume between origin/destination (OD) pairs in a network, known as traffic matrix, is essential for efficient network provisioning and traffic engineering. Existing approaches of estimating the traffic matrix, based on statistical inference and/or packet sampling, usually cannot achieve very high estimation accuracy. In this work, we take a brand new approach in attacking this problem. We propose a novel data streaming algorithm that can process traffic stream at very high speed (e.g., 40 Gbps) and produce traffic digests that are orders of magnitude smaller than the traffic stream. By correlating the digests collected at any OD pair using Bayesian statistics, the volume of traffic flowing between the OD pair can be accurately determined. We also establish principles and techniques for optimally combining this streaming method with sampling, when sampling is necessary due to stringent resource constraints. In addition, we propose another data streaming algorithm that estimates flow matrix, a finer-grained characterization than traffic matrix. Flow matrix is concerned with not only the total traffic between an OD pair (traffic matrix), but also how it splits into flows of various sizes. Through rigorous theoretical analysis and extensive synthetic experiments on real Internet traffic, we demonstrate that these two algorithms can produce very accurate estimation of traffic matrix and flow matrix respectively.
A VLSI array processing oriented fast fourier transform algorithm and hardware implementation
Authors: Zhenyu Liu, Yang Song, Takeshi Ikenaga, Satoshi Goto
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

Many parallel Fast Fourier Transform (FFT) algorithms adopt multiple stages architecture to increase performance. However, data permutation between stages consumes volume memory and processing time. An FFT array processing mapping algorithm is proposed in this paper to overcome this demerit. In this algorithm, arbitrary 2k butterfly units (BUs) could be scheduled to work in parallel on n=22 data (k=0, 1,..., s-1). Because no inter stage data transfer is required, memory consumption is reduced to 1/3 of the original algorithm. Moreover, with the increasing of BUs, not only does throughput increase linearly, system latency also decreases linearly. This array processing orientated architecture provides flexible tradeoff between hardware cost and system performance. An 18-bit word-length 1024-point FFT architecture with 4 BUs is given to demonstrate this mapping algorithm. The design is implemented with TSMC 0.18μm CMOS technology. The core area is 2.99x1.12mm 2 and clock frequency is 326MHz in typical condition (1.8V, 25°C). This processor could complete 1024 FFT calculation in 7.839μs.
New Multi-baseline Stereo by Counting Interest Points
Authors: Tomokazu Sato, Naokazu Yokoya
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

This paper proposes a novel method for estimating depth from a long image sequence captured by a moving camera. Our idea for estimating a depth map is very simple; only counting interest points in images is integrated with the framework of multi-baseline stereo. Even by a simple algorithm, depth can be determined without computing similarity measures such as SSD and NCC that have been used for traditional stereo matching. Our method realizes robust depth estimation against image distortions and occlusions that are caused by camera motion. Note that, in this paper, intrinsic and extrinsic parameters of video camera are assumed to be calibrated in advance.
Dynamic Power-Aware Scheduling Algorithms for Real-Time Task Sets with Fault-Tolerance in Parallel and Distributed Computing Environment
Authors: Jian-Jun Han, Qing-Hua Li
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

At present, saving energy consumption of modern processors and fault tolerance become major concerns due to the fact that high power consumption increases heat dissipation, which leads to decreased reliability of systems. Similarly, the faults of running tasks also reduce the reliability of systems. The algorithms proposed in this paper are based on the policy of shortest-task-first and combined with other efficient techniques, such as shared slack reclamation and checkpoint. Consequently, not only real-time tasks can be completed before deadline, but also reduction of the global power consumption and fault-tolerance will be satisfied dynamically. In this paper, we present four algorithms to cope with scheduling independent task sets and task sets with precedence relationship in homogeneous and heterogeneous systems, respectively. Moreover, we present dynamic fault-tolerant algorithm. Compared to the efficient algorithms presented so far, our algorithms show lower communicational complexity and much better scheduling performance in terms of makespan and energy consumption.
Image Noise Analysis with a Fast Lifting Wavelet Algorithm for Objective Image Quality Evaluation
Authors: Gaoyong Luo
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

An essential determinant of the value of surrogate digital images is their quality. Over the past years, there have been many attempts to develop models or metrics for image quality that incorporate elements of human visual sensitivity. However, there is no current standard and objective definition of spectral image quality. This paper proposes a reliable automatic method for objective image quality measurement by noise analysis throughout the spatial frequency range with a fast lifting wavelet algorithm. The wavelet frequency deconstruction is actually to extract the feature of edges in sub-band images. The technique provides a means to relate the quality of an image to the interpretation and quantification throughout the frequency range, in which the noise level is estimated for quality evaluation. The experimental results of using this method for image quality measurement exhibit good correlation to subjective visual quality assessments.
Level Set Active Contours on Unstructured Point Cloud
Authors: Hon Pong Ho, Yunmei Chen, Huafeng Liu, Pengcheng Shi
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

We present a novel level set representation and front propagation scheme for active contours where theanalysis/evolution domain is sampled by unstructured point cloud. These sampling points are adaptively distributed according to both local data and level set geometry, hence allow extremely convenient enhancement/reduction of local front precision by simply putting more/fewer points on the computation domain without grid refinement (as the cases in finite difference schemes) or remeshing (typical in finite element methods). The front evolution process is then conducted on the point-sampled domain, without the use of computational grid or mesh, through the precise but relatively expensive moving least squares (MLS) approximation of the continuous domain, or the faster yet coarser generalized finite difference (GFD) representation and calculations. Because of the adaptive nature of the sampling point density, our strategy performs fast marching and level set local refinement concurrently. We have evaluated the performance of the method in image segmentation and shape recovery applications using real and synthetic data.
Implementing RADIUS and Diameter AAA Systems in IPv6-Based Scenarios
Authors: Rafael Marin Lopez, Gregorio Martinez Perez, Antonio F. Gomez Skarmeta
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

AAA (Authentication, Authorization and Acxcounting) Frameworks are defined as a set of models, infrastructures and protocols needed to interconnect AAA entities. They have been mainly deployed so far using the RADIUS protocol in IPv4 networks. However, when taking suchh AAA systems to IPv6 networks some interesting issues appear that need to be addressed. This is the main focus of this paper where both RADIUS and Diameter protocols are deployed in different IPv6-related scenarios.
New Complexity Results on Array Contraction and Related Problems
Authors: Alain Darte, Guillaume Huard
Venue: Journal of VLSI Signal Processing Systems (2005)

Array contraction is an optimization that transforms array variables into scalar variables within a loop. While the opposite transformation, scalar expansion, is used for enabling parallelism (with a penalty in memory size), array contraction is used to save memory by removing temporary arrays and to increase locality. Several heuristics have already been proposed to perform array contraction through loop fusion and/or loop shifting. But until now, the complexity of the problem was unknown, and no exact approach was available (and even more, only a sufficient condition for array contraction was used). In this paper, we focus on the theoretical aspects of the problem. We prove several NP-complete results that characterize precisely its complexity and we provide an integer linear programming formulation to solve the problem exactly. Our study also proves the NP-completeness of similar problems whose complexity was not established so far.
Dissemination of a TEL network: strategies of dissemination and implementation of the ProLearn research network
Authors: Barbara Kieslinger, Margit Hofer
Venue: Proceedings of the 4th international symposium on Information and communication technologies (2005)

ProLearn is a network of excellence in professional learning encompassing research groups across Europe and beyond. Its mission is to bring together the most important research groups in the area of professional learning and training, as well as other key organisations and industrial partners, thus bridging the currently existing gap between research and education at higher education institutions and professional training at the workplace. The dissemination and implementation strategy of ProLearn is based on several premises: the integration of target groups, the adaptation of user needs and preferences regarding the end product, the need for communication and the outlining of the benefits gained.ProLearn created two new instruments to support the implementation strategy concerning specific areas and target groups: The ProLearn Virtual Competence Centre is embedded in a market place for communicating demands of industry and solutions from research while the ProLearn Academy builds on disseminating and integrating the results of ProLearn in training seminars for students and young researchers. The paper will discuss some principle strategies for successful dissemination and implementation in technology enhanced learning and will showcase theses aspects on concrete examples of successful dissemination strategies from ProLearn practice.
Face Verification across Age Progression
Authors: Narayanan Ramanathan, Rama Chellappa
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

Human faces undergo considerable amount of variations with aging. While studies have revealed the extent to which factors such as illumination variations, pose variations, facial expression and occlusions affect face recognition, the role of natural factors such as aging effects in affecting the same are yet to be studied. How does age progression affect the similarity between two images of an individual? What is the confidence associated with establishing the identity between two age separated face images of an individual? On a database of pairs of passport images, we study similarity of faces as a function time. We propose a Bayesian age-difference classifier that is built on a probabilistic eigenspaces framework. Since age separated face images invariably differ in illumination and have facial variations due to aging, we propose a method to overcome non uniform illumination across face images. The problem discussed in this paper has direct applications in passport renewal and homeland security.