ppxscal/embedding_network huggingface dataset:
SIFT: a tool for wide-area information dissemination
Authors: Tak W. Yan, Hector Garcia-Molina
Venue: Proceedings of the USENIX 1995 Technical Conference Proceedings on USENIX 1995 Technical Conference Proceedings (1995)

The dissemination model is becoming increasingly important in wide-area information system. In this model, the user subscribes to an information dissemination service by submitting profiles that describe his interests. He then passively receives new, filtered information. The Stanford Information Filtering Tool (SIFT) is a tool to help provide such service. It supports full-text filtering using well-known information retrieval models. The SIFT filtering engine implements novel indexing techniques, capable of processing large volumes of information against a large number of profiles. It runs on several major Unix platforms and is freely available to the public. In this paper we present SIFT's approach to user interest modeling and user-server communication. We demonstrate the processing capability of SIFT by describing a running server that disseminates USENET News. We present an empirical study of SIFT's performance, examining its main memory requirement and ability to scale with information volume and user population.
Electronics Design-for-Test: Past, Present and Future
Authors: Ben Bennetts
Venue: Proceedings of the 12th IEEE European Test Symposium (2007)

Do you know how many ENIAC vacuum tubes were replaced every day during its heyday? What did it teach us about Test, or Design-For-Test? Did Eldred really invent the stuck-at fault model in 1959? Is 99.999% fault cover all it's cracked up to be or are we fooling ourselves? Are we better off with 115% or even 80%? Where did Design-For-Test come from? Where is it now? Where's it heading? Is it true that boundary scan is the panacea of test? What are all these new Joint Test Action Groups -- Internal, System and compact? Are they boondoggles, or are they serious?
DICHOTOMY: A Resource Discovery and Scheduling Protocol for Multihop Ad hoc Mobile Grids
Authors: Antonio Tadeu A. Gomes, Artur Ziviani, Luciana S. Lima, Markus Endler
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

There has been a good amount of research over the past few years on the integration of mobile devices into compu- tational grids. Little of it, however, has addressed the more challenging issue of dynamically establishing spontaneous, multihop ad hoc mobile grids, and then only in preliminary form. In such grids, resource discovery and scheduling have been traditionally approached separately in the literature. In our view, this is an inappropriate dichotomy as regards multihop ad hoc mobile grids. In this paper, we propose a resource DIscovery and sCHeduling prOTOcol for Mobil- itY (DICHOTOMY), which allows resource provisioning to be scheduled among the most resourceful nodes in the mo- bile grid, while mitigating the overhead of discovery mes- sages exchanged among them. Our experimental results in a testbed and in a simulation platform show that the proto- col provides efficient load balancing between nodes under an increasing number of requests, and scales well with re- spect to an increasing number of nodes in comparison with traditional broadcast-based solutions for service discovery.
Security Requirements for a Semantic Service-oriented Architecture
Authors: Stefan Durbeck, Rolf Schillinger, Jan Kolter
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

Service-oriented architectures (SOAs) are a commonly used paradigm for IT infrastructures in various fields. Due to their flexibility and the easy accessibility of their underlying web services, SOAs are the architecture of choice for more and more service providers. Semantic SOAs (SSOAs) are going one step further and are enhancing the common SOA with semantic components. However, a major success criterion of any SOA is the existence of a reliant security infrastructure. Therefore, this paper identifies security requirements for an eGovernment SSOA focusing on communication security, trust, privacy and access control. Our work is based on the architecture designed within the scope of the European research project Access-eGov, which envisions the development of a SSOAbased eGovernment platform.
Linear programming in spectral estimation. Application to array processing
Authors: J.-J. Fuchs
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

We address the narrow-band source localization problem for arbitrary arrays with known geometry in the presence of arbitrary noise of unknown spatial spectral density. Very few methods are able to handle this problem. We present a very unsophisticated approach whose algorithmic part relies on a standard linear programming algorithm (such as the simplex algorithm available in any scientific program library). The computational complexity of the method is reasonable, the performance appear to be remarkable on simulations. The justification of the procedure and the asymptotic analysis is more complex and much work remains to be done.
Particle swarm optimisation with spatial particle extension
Authors: T. Krink, J. S. Vesterstrom, J. Riget
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

In this paper, we introduce spatial extension to particles in the PSO model in order to overcome premature convergence in iterative optimisation. The standard PSO and the new model (SEPSO) are compared w.r.t. performance on well-studied benchmark problems. We show that the SEPSO indeed managed to keep diversity in the search space and yielded superior results.
Redesign of classic information visualization techniques in an artistic computing perspective
Authors: Benoît Otjacques, Fernand Feltz
Venue: Proceedings of the 4th symposium on Applied perception in graphics and visualization (2007)

Combining information visualization and art is a rather new research domain. Redstr&ouml;m et al [2000] speak in terms of 'informative art' that they define as 'computer augmented, or amplified, works of art that are not only aesthetical objects but also information displays, in as much as they dynamically reflect information about their environment.' Holmquist and Skog [2003] restate it as follows: 'informative art is a type of computer applications which borrow their appearance from well-known artistic styles to visualize dynamically updated information'. Gr&oslash;nb&aelig;k et al. [2006] refers to 'making digital information displays aesthetic, calm, and pleasurable.' Beale [2007] explains that 'ambient art is the aesthetic presentation of information, using artistic techniques to achieve a pleasing image that also contains hidden depths, where exposure to it over time allows a viewer to understand something about the information sources that it represents'. Fishwick [2006] defines the 'aesthetic computing' concept as: 'the application of the theory and practice of art to the field of computing'. Fishwick then refines its proposal and distinguishes analysis and synthesis applications of aesthetic computing. The former aims to evaluate computing objects from an aesthetic perspective while the latter focuses on using aesthetics as a means of representation of the artefacts. We can also mention the Ambient Display concept defined by Wisneski et al. [1998] as a way to 'present information within a space through subtle changes in light, sound, and movement, which can be processed in the background of awareness'. Thinking on these definitions, we point out several interesting observations presented in the next section.
A fast topology inference: a building block for network-aware parallel processing
Authors: Tatsuya Shirai, Hideo Saito, Kenjiro Taura
Venue: Proceedings of the 16th international symposium on High performance distributed computing (2007)

Adapting to the network is the key to achieving high performance for communication-intensive applications, including scientific computing,data intensive computing, and multicast, especially in Grid environments. This paper investigates an approach of representing network as a tree of participating hosts and switches matching or approximating their physical topology, and describes a fast, non-intrusive, and portable algorithm for inferring such a topology. This representation and the proposed inference algorithm serves as a key to building network-aware applications in a portable manner. The algorithm is based solely on RTTs of small packets between end hosts; it does not rely on popular but not universally available protocols such as trace route and SNMP. Another benefit is that it can handle all layers of network uniformly without any a priori knowledge of cluster configurations. The required number of measurements is O(Nd) in certain idealizing assumptions made for the purpose of analysis, where N is the number of participating processes and d the diameter of the network, which is usually small in real networks. In our experimental environment, the inference algorithm built a topology of 64 hosts in a single cluster in 4 seconds and and that of 256 hosts across 4 clusters in 15 seconds. It is able to not only identify clusters within a Grid, but also to partially identify the Layer 2 topology within a cluster. This is important for optimizing bandwidth-limited operations such as broadcast. We built several network-aware applications upon the inference system, including efficient bandwidth measurements and long message broadcasts. The topology is used to schedule as many measurements as possible in parallel without competing on shared links. We were able to build a bandwidth map of 256 hosts across 4 clusters in 27 seconds.
Fully-automatic generation of user interfaces for multiple devices from a high-level model based on communicative acts
Authors: Jurgen Falb, Roman Popp, Thomas Rock, Helmut Jelinek, Edin Arnautovic, Hermann Kaindl
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The problems involved in the development of user interfaces become even more severe through the ubiquitous use of a variety of devices such as PCs, mobile phones and PDAs. Each of these devices has its own specifics that require a special user interface. Therefore, we developed and implemented an approach to generate user interfaces for multiple devices fully automatically from a high-level model. In contrast to previous approaches focusing on abstracting the user interface per se, we make use of speech act theory from the philosophy of language for the specification of desired intentions in interactions. Our new approach of using communicative acts in high-level models of user interfaces allows their creation with less technical knowledge, since such models are easier to provide than user-interface code in a usual programming language. From one such high-level model, multiple user interfaces for diverse devices are rendered fully automatically using a number of heuristics. A generated user interface for a PDA is already in real-world use and its usability was informally evaluated as good.
Authorisation and Conflict Resolution for Hierarchical Domains
Authors: Giovanni Russello, Changyu Dong, Naranker Dulay
Venue: Proceedings of the Eighth IEEE International Workshop on Policies for Distributed Systems and Networks (2007)

In this paper we generalise the authorisation policy model supported by the Ponder policy language for hierarchically organised domains of managed objects to support subject-based policies and return policies. We describe the authorisation conflicts that can occur and present a strategy to automatically resolve them. In our model each action has four endpoints: the subject call, the subject return, the target call and the target return. Each endpoint can have associated policies which are used to define constraints on which subjects are permitted to call which targets, and what is permitted to be transferred between subjects and targets. Subject-based policies aim to protect the subject from untrusted targets, while target-based policies aim to protect the target from unauthorised subjects. Subject-based policies are defined for and enforced by the subject's PEP, while target-based policies are defined for and enforced by the target's PEP. Although subject-based and target-based policies are separated, they are uniformly specified in our framework.
Conflict Resolution Model Based on Weight in Situation Aware Collaboration System
Authors: Heeseo Chae, TaeYon Kim, Dong-hyun Lee, Hoh Peter In
Venue: Proceedings of the 11th IEEE International Workshop on Future Trends of Distributed Computing Systems (2007)

In ubiquitous environments, situation-awareness is a desirable property to support adaptive and personalized services. To describe situation-awareness effectively, a situation-aware interface description language (SA-IDL) which can express a collaboration system with various contexts and actions is researched. However, conflicts can occur when services expressed in SA-IDL collaborate with each other, though each service does not make any errors. This is because each service is described with requirements for each one. So, in order to provide situation-aware services without inconsistency, conflicts among services should be identified and resolved. In this paper, we propose a mathematical modeling of SA-IDL to identify the conflicts among situation-aware services, and suggest conflict resolution graph model to identify the services which occur the conflicts. Also we proposed the resolution algorithm based on weight.
A Review of 3D Reconstruction Techniques from 2D Orthographic Line Drawings
Authors: Muhammad Abuzar Fahiem, Shaiq A. Haq, Farhat Saleemi
Venue: Proceedings of the Geometric Modelling and Imaging (2007)

3D reconstruction of objects form orthographic projections of engineering drawing has been very crucial research area since decades. In this paper, we have critically reviewed the latest approaches dealing with single view and multi view. Different approaches have been discussed with respect to bottom-up and topdown reconstruction. Many other parameters such as type of drawing, shape of object, x-sectional view, user interaction, dead end holes and hidden lines have also been compared amongst these approaches.
Near optimal geometric image scaling using oblique projection operators
Authors: Chulhee Lee
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

We propose to re-size images using an oblique projection operator instead of the orthogonal one in order to obtain faster, simpler, and more general algorithms. The main advantage is that it becomes perfectly feasible to use higher order models (e.g., splines of degree n/spl ges/3). We develop the theoretical background and present a simple and practical implementation procedure that uses B-splines. Experiments show that the proposed algorithm consistently outperforms the standard interpolation method and that it essentially provides the same performance as the optimal procedure (least squares solution) with considerably less computations.
Software prefetching and caching for translation lookaside buffers
Authors: Kavita Bala, M. Frans Kaashoek, William E. Weihl
Venue: Proceedings of the 1st USENIX conference on Operating Systems Design and Implementation (1994)

A number of interacting trends in operating system structure, processor architecture, and memory systems are increasing both the rate of translation lookaside buffer (TLB) misses and the cost of servicing amiss. This paper presents two novel software schemes, implemented under Mach 3.0, to decrease both the number and the cost of kernel TLB misses (i.e., misses on kernel data structures, including user page tables). The first scheme is a new use of prefetching for TLB entries on the IPC path, and the second scheme is a new use of software caching of TLB entries for hierarchical page table organizations. For a range of applications, prefetching decreases the number of kernel TLB misses by 40% to 50%, and caching decreases TLB penalties by providing a fast path for over 90% of the misses. Our caching scheme also decreases the number of nested TLB traps due to the page table hierarchy, reducing the number of kernel TLB miss traps for applications by 20% to 40%. Prefetching and caching, when used alone, each improve application performance by up to 3.5%; when used together, they improve application performance by up to 3%. On synthetic benchmarks that involve frequent communication among several different address spaces (and thus put more pressure on the TLB), prefetching improves overall performance by about 6%, caching improves overall performance by about 10%, and the two used together improve overall performance by about 12%. Our techniques are very effective in reducing kernel TLB penalties, which currently range from 1% to 5% of application runtime for the benchmarks studied. Since processor speeds continue to increase relative to memory speeds, our schemes should be even more effective in improving application performance in future architectures.
A multiple exchange algorithm for constrained design of FIR filters in the complex domain
Authors: M. C. Lang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

We present a fast multiple exchange algorithm that designs FIR filters with magnitude and phase specifications subject to constraints on the error function. We use a constrained least squares criterion which minimizes error energy and imposes bounds on the magnitude of the error. We can trade error energy versus peak error, and complex least squares and complex Chebyshev filters result as special cases. We provide a Matlab program implementing the proposed algorithm. This program has proved to be efficient and reliable.
Variance mismatch: identifying random-test resistance in DSP datapaths
Authors: L. Goodby
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

Pseudorandom built-in self-test (BIST) is an attractive means of testing DSP datapath structures as long as the delay and area overhead can be kept low. One obstacle to low-overhead BIST is random-pattern test-resistant datapath structures. We examine the causes of this resistance in some typical DSP datapaths, and introduce variance mismatch as an analytical tool for identifying these test problems. By understanding the mechanisms behind random-pattern test resistance, it is possible to make design decisions that are compatible with pseudorandom BIST, resulting in reduced test length and higher fault coverage. Variance matching theory is applied to the design of two large FIR filters, resulting in an 88% reduction in the number of missed faults for a fixed test length, and two orders-of-magnitude reduction in test length for a specific fault coverage target.
Leisure and CSCW: Introduction to Special Edition
Authors: Barry Brown, Louise Barkhuus
Venue: Computer Supported Cooperative Work (2007)

In this article we review the contribution to this special edition, and putting them into the context of research into leisure and technology. We discuss the challenges of studying leisure in a field where its very name seems to focus attention on the study of work.
A Lazy Scheduling Scheme for Improving Hypercube Performance
Authors: Prasant Mohapatra, Chansu Yu, Chita R. Das, Jong Kim
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 01 (1993)

Processor allocation and job scheduling are com plementary techniques to improve the performance of multiprocessors. It has been observed that all the hypercube allocation policies with the FCFS schedul ing show little performance difference. A greater im pact on the performance can be obtained by efficient job scheduling. This paper presents an effort in that direction by introducing a new scheduling algorithm called lazy scheduling for hypercubes. The motivation of this scheme is to eliminate the limitations of the FCFS scheduling. This is done by maintaining sep arate queues for different job sizes and delaying the allocation of a job if any other job(s) of the same di mension is(are) running in the system. Simulation studies show that the hypercube performance is dra matically enhanced by using the lazy scheme as com pared to the FCFS scheduling. Comparison with a re cently proposed scheme called scan indicates that the lazy scheme performs better than scan under a wide range of workloads.
Neural network for solving generalized eigenvalues of matrix pair
Authors: H. B. Yang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

Neural networks for solving a class of generalized eigenvalue problems of matrix pair are proposed, in which a universal function satisfying several conditions is introduced by replacing some ones. For its simplicity in structure and excellence in performance, it can be widely used in many areas including array signal processing, blind equalization and identification. Both the theoretical analysis and the experimental results show that the proposed network can gives the extreme eigenvalue and its corresponding eigenvector of the matrix pair (A, B) in real time.
Harmonic retrieval in colored non-Gaussian noise
Authors: Yan Zhang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

This paper addresses the harmonic retrieval problem in colored linear non-Gaussian noise of unknown covariance and unknown distribution. The assumptions made in the reported studies, that the non-Gaussian noise is asymmetrically distributed and no quadratic phase coupling occurs, are released. Using the elaborately defined fourth-order cumulants of the complex noisy observations which are obtained through the Hilbert transform, we can either estimate the noise correlation nonparametrically via cumulant projections or obtain the AR polynomial of the non-Gaussian noise parametrically through ARMA modeling, then it is shown that the prewhitening or prefiltering techniques can be employed to retrieve harmonics respectively. Simulation results are presented to demonstrate the performance of the proposed algorithms.
Markov modeling of transient scattering and its application in multi-aspect target classification
Authors: Y. Dong
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

Transient scattered fields from a general target are composed of wavefronts, resonances and time delays, with these constituents linked to the target geometry. A classifier applied to transient scattering data requires a statistical model for such fundamental constituents. A Markov model is employed to characterize the transient scattered fields-for a set of target-sensor orientation over which the transient scattering is stationary-utilizing a wavefront, resonance, time-delay "alphabet". The Markov model is utilized in a classifier developed for multi-aspect transient scattering data, with a hidden Markov model (HMM) employed to address the generally non-stationary nature of the multi-aspect waveforms. Each state of the HMM is characteristic of a set of target-sensor orientations for which the scattering statistics are stationary, the statistics of which are characterized via the Markov model. The wavefront, resonance and time-delay features are extracted via a modified matching-pursuits algorithm.