ppxscal/embedding_network huggingface dataset:
Tracking and viewing changes on the web
Authors: Fred Douglis, Thomas Ball
Venue: Proceedings of the 1996 annual conference on USENIX Annual Technical Conference (1996)

We describe a set of tools that detect when World-Wide-Web pages have been modified and present the modifications visually to the user through marked-up HTML. The tools consist of three components: w3newer, which detects changes to pages; snapshot, which permits a user to store a copy of an arbitrary Web page and to compare any subsequent version of a page with the saved version; and HtmlDiff, which marks up HTML text to indicate how it has changed from a previous version. We refer to the tools collectively as the ATT Internet Difference Engine (AIDE). This paper discusses several aspects of AIDE, with an emphasis on systems issues such as scalability, security, and error conditions.
Source-Code-Correlated Cache Coherence Characterization of OpenMP Benchmarks
Authors: Jaydeep Marathe Frank Mueller
Venue: IEEE Transactions on Parallel and Distributed Systems (2007)

Cache coherence in shared-memory multiprocessor systems has been studied mostly from an architecture viewpoint, often by means of aggregating metrics. In many cases, aggregate events provide insufficient information for programmers to understand and optimize the coherence behavior of their applications. A better understanding would be given by source code correlations of not only aggregate events, but also finer granularity metrics directly linked to high-level source code constructs, such as source lines and data structures. In this paper, we explore a novel application-centric approach to studying coherence traffic. We develop a coherence analysis framework based on incremental coherence simulation of actual reference traces. We provide tool support to extract these reference traces and synchronization information from OpenMP threads at runtime using dynamic binary rewriting of the application executable. These traces are fed to ccSIM, our cache-coherence simulator. The novelty of ccSIM lies in its ability to relate low-level cache coherence metrics (such as coherence misses and their causative invalidations) to high-level source code constructs including source code locations and data structures. We explore the degree of freedom in interleaving data traces from different processors and assess simulation accuracy in comparison to metrics obtained from hardware performance counters. Our quantitative results show that: 1) Cache coherence traffic can be simulated with a considerable degree of accuracy for SPMD programs, as the invalidation traffic closely matches the corresponding hardware performance counters. 2) Detailed, high-level coherence statistics are very useful in detecting, isolating, and understanding coherence bottlenecks. We use ccSIM with several well-known benchmarks and find coherence optimization opportunities leading to significant reductions in coherence traffic and savings in wall-clock execution time.
Hierarchical enumerative coding of DCT coefficients
Authors: L. Oktem
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

We propose the employment of hierarchical enumerative coding, an entropy coding method, for the entropy coding of DCT coefficients in a DCT-based image compression scheme. The following configuration is used for the comparisons: the 8/spl times/8 DCT coefficients are first rearranged to obtain a wavelet-transform-like layout. Then, an improved version of the morphological representation of wavelet data (MRWD) algorithm is applied for scanning the coefficients and encoding the locations of nonzero coefficients. Within this configuration, two alternative entropy coding methods, context-based arithmetic coding and hierarchical enumerative coding, are compared. Experimental results show that the performance of hierarchical enumerative coding is as good as that of arithmetic coding. Considering the little computational complexity of hierarchical enumerative coding, the equal compression performance suggests that hierarchical enumerative coding is a feasible alternative for the entropy coding of DCT coefficients.
Wavelet based halftone segmentation and descreening filter design
Authors: Chunghui Kuo
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

The advent of electronic publication creates strong interest in converting existing printed documents into electronic formats. During this process, image reproduction problems can occur due to the formation of Moire patterns in the screened halftone areas. Therefore, the optimal quality of a scanned document is achieved if halftone regions are first identified and processed separately. We propose a complete algorithm to achieve this objective. A wavelet based halftone segmentation algorithm is first designed to locate possible halftone regions using a decision function. We then introduce a suboptimal FIR descreening filter to efficiently handle various screening frequencies and angles. Experimental results are offered to illustrate the performance of our algorithm.
Investigations of power analysis attacks on smartcards
Authors: Thomas S. Messerges, Ezzy A. Dabbish, Robert H. Sloan
Venue: Proceedings of the USENIX Workshop on Smartcard Technology on USENIX Workshop on Smartcard Technology (1999)

This paper presents actual results from monitoring smartcard power signals and introduces techniques that help maximize such side-channel information. Adversaries will obviously choose attacks that maximize side-channel information, so it is very important that the strongest attacks be considered when designing defensive strategies. In this paper, power analysis techniques used to attack DES are reviewed and analyzed. The noise characteristics of the power signals are examined and an approach to model the signal to noise ratio is proposed. Test results from monitoring power signals are provided. Next, approaches to maximize the information content of the power signals are developed and tested. These results provide guidance for designing smartcard solutions that are secure against power analysis attacks.
Development of distributed planner for decision support systems
Authors: A. Yu. Nedelina, A. P. Eremeev, W. Fengler
Venue: Proceedings of the 2nd International Conference on Dependability of Computer Systems (2007)

Based on a short outline of the state of the art in real time decision support systems (RTDSS) for planning and searching problems, the present paper introduces a planning approach for RTDSS and an architecture of a development planner (DIPLAN). DIPLAN utilizes a parallel version of the IDA* search algorithm based on heuristic methods of solution search. Finally, the obtained results are described.
A high speed and low complexity integrated framework for JPEG2000
Authors: Tsung-Han Tsai, Kuei-Lan Lin
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

This paper presents a high speed and low complexity integrated framework for JPEG2000. It addresses on the combined effects of the quantization and EBCOT modules. Since the EBCOT algorithm contains a high complexity computation and also becomes the bottleneck of JPEG2000, two speed-improved methods for EBCOT algorithm in JPEG2000 encoding system are proposed. These two methods can reduce the clock cycles to enhance the coding speed for pass checking efficiently and still preserve original functionality. In addition, a variable truncating quantization method has been applied to improve the speed for EBCOT. Finally, the computation complexity can be reduced by about 43% of the whole EBCOT.
Toward Scalable Management of Multiple Service Levels in IP Networks
Authors: Solange Rito Lima, Paulo Carvalho, Vasco Freitas
Venue: Proceedings of the Fourth European Conference on Universal Multiservice Networks (2007)

This paper analyzes and discusses the role of a distributed and simple admission control (AC) model in achieving scalable management of multiple network service levels. The model design, covering explicit and implicit AC, exhibits relevant properties which allow managing QoS and SLSs in multiservice IP networks in a flexible and scalable manner. These properties stem from the way service-dependent AC and on-line service performance monitoring are proposed and articulated in the model's architecture and operation. The scalability debate, carried out at these two levels, highlights key steps toward self-adaptive service-oriented AC and low overhead multiservice monitoring. The performance evaluation results, illustrating the role and relevance of the defined AC rules, show that QoS and SLSs requirements can be efficiently satisfied or bounded, proving that the simplicity, flexibility and self-adaptability of the model can be explored to manage multiple service guarantees successfully.
On the black art of designing computational workflows
Authors: Yolanda Gil, Pedro A. González-Calero, Ewa Deelman
Venue: Proceedings of the 2nd workshop on Workflows in support of large-scale science (2007)

Computational workflows have recently emerged as an effective paradigm to manage large-scale distributed scientific computations. Workflow systems can automate many execution-level details and provide assistance in composing and validating workflows. However, there is still a significant effort involved in creating these workflows since they often represent collaborative and exploratory science experiments. Therefore, current practice is effective in producing results but not cost-effective for widespread adoption. Drawing from our previous research in computational workflows across scientific disciplines, this paper analyzes the tasks and overall process for designing these workflows. We discuss software engineering methodologies and their relevance to creating workflows as a unique kind of software artifact. We also discuss our ongoing work to make workflow applications more cost effective and lower the barriers for widespread adoption of workflow technologies.
VSIPL: an object-based open standard API for vector, signal, and image processing
Authors: R. Janka
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

VSIPL, the Vector, Signal, and Image Processing Library, is an open standard application programmer's interface (API) for signal and image processing. Defined by a consortium of industry, government, and academic representatives, VSIPL is gaining widespread acceptance as a de facto standard in the embedded signal processing world. The primary goal of the API is to increase the portability of vector signal processing, matrix signal processing, and image processing applications. We present an overview of the design, features, and availability of the VSIPL API.
Value-Directed Human Behavior Analysis from Video Using Partially Observable Markov Decision Processes
Authors: Jesse Hoey James J. Little
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

This paper presents a method for learning decision theoretic models of human behaviors from video data. Our system learns relationships between the movements of a person, the context in which they are acting, and a utility function. This learning makes explicit that the meaning of a behavior to an observer is contained in its relationship to actions and outcomes. An agent wishing to capitalize on these relationships must learn to distinguish the behaviors according to how they help the agent to maximize utility. The model we use is a partially observable Markov decision process, or POMDP. The video observations are integrated into the POMDP using a dynamic Bayesian network that creates spatial and temporal abstractions amenable to decision making at the high level. The parameters of the model are learned from training data using an a posteriori constrained optimization technique based on the expectation-maximization algorithm. The system automatically discovers classes of behaviors and determines which are important for choosing actions that optimize over the utility of possible outcomes. This type of learning obviates the need for labeled data from expert knowledge about which behaviors are significant and removes bias about what behaviors may be useful to recognize in a particular situation. We show results in three interactions: a single player imitation game, a gestural robotic control problem, and a card game played by two people.
On the Advantages of an Alternative MPI Execution Model for Grids
Authors: A. C. Sena, A. P. Nascimento, J. A. Da Silva, D. Q. C. Vianna, C. Boeres, V. E. F. Rebello
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

The MPI message passing library is used extensively in the scientific community as a tool for parallel programming. Even though improvements have been made to existing implementations to support execution on computational grids, MPI was initially designed to deal with homogeneous, faultfree, static environments such as computing clusters. The typical programming approach is to execute a single MPI process on each resource. However, this may not be appropriate for heterogeneous, non-dedicated and dynamic environments such as grids. This paper aims to show that programmers can implement parallel MPI solutions to their problems in an architectural independent style and obtain good performance on a grid by transferring responsibility to an application management system (AMS). A comparison of program implementations under a traditional MPI execution model and a fine-grain model highlight the advantages of using the latter.
An Adaptive Data Broadcasting Model in Mobile Information Systems
Authors: John Tsiligaridis, Raj Acharya
Venue: Proceedings of the 6th International Conference on Computer Information Systems and Industrial Management Applications (2007)

The expanding wireless communication technology gives mobile users the capability of accessing data at any time and place. The server fetches the requests and broadcasts the data to the air. The broadcast problem including the plan design is considered. The uniform items are inserted and numbered in predefined order into customized size relations. Under some divisible conditions our approach can guarantee the creation of full Broadcast Plan (BP) with predefined number of items repetition. A set of algorithms discover the possibilities to get a full BP. Servers now may provide self-monitoring, self-organizing, etc abilities in automatic way. To increase the server broadcasting capabilities for the uniform data a new scheduling algorithm is introduced. The HOL waiting time group (HOLWTG) scheduler, working as Round Robin, along with the bandwidth adjustment, provides the service priority, diminishes the waste of bandwidth and minimizes the number of rounds. Simulation experiments are provided.
Should Normal Distribution be Normal? The Student's T Alternative
Authors: Anna Bartkowiak
Venue: Proceedings of the 6th International Conference on Computer Information Systems and Industrial Management Applications (2007)

In the paper we try to answer, whether the Gaussian distribution -- called widely the 'normal; distribution -- is really basic, natural and normal. In particular, we investigate how the above statement conforms with the distribution of real data, namely daily returns of some stock indexes. It was the authors former experience that, when looking at the distributions of real data, it was very difficult to find there a 'normal', i.e. Gaussian distribution. The data, by their nature, are heterogeneous. If so, then the data should be modelled taking into account their possible heterogeneity. This can be done using mixture models - with mixtures composed from finite or infinite number of components. Students' T (univariate or multivariate) is one prominent example of distributions which may be obtained as a mixture of infinitesimal number of Gaussian distributions. The considerations are illustrated by an example of application to financial time series, namely daily returns of the indexes WIG20 and S&P500. We show, why the normality (i.e. 'Gaussianity') should be rejected and why the 't' distribution is plausible.
Comparing the Cost-Effectiveness of Statically Analysing and Model Checking Concurrent Java Components for Deadlocks
Authors: John Ngui, Paul Strooper, Luke Wildman, Margaret Wojcicki
Venue: Proceedings of the 2007 Australian Software Engineering Conference (2007)

Verifying concurrent Java programs is difficult due to the many possible interleavings of threads and a number of specific concurrency defects such as interference and deadlock. To verify concurrent Java components, the TestCon method combines code inspection, static analysis and dynamic analysis. The deadlock detection steps of TestCon include static analysis (using Jlint) that may result in false positives or false negatives; therefore code inspection is combined with Jlint, but inspection can be time-consuming and depends on the inspector's skills. In this paper, we evaluate the cost-effectiveness of the Java PathFinder 2 (JPF 2) model checker for the detection of deadlocks in the context of the TestCon method. The results of the study show that using JPF 2 can improve TestCon's effectiveness but a trade-off has to be made in terms of cost in the development of the driver and analysis of its output. General conclusions cannot be drawn since the study was exploratory and small-scale; however the observations highlight some of the strengths and weaknesses of using JPF 2 compared to static analysis and code inspection.
Improved Delsarte bounds for spherical codes in small dimensions
Authors: Florian Pfender
Venue: Journal of Combinatorial Theory Series A (2007)

We present an extension of the Delsarte linear programming method for spherical codes. For several dimensions it yields improved upper bounds including some new bounds on kissing numbers. Musin's recent work on kissing numbers in dimensions three and four can be formulated in our framework.
Error Modeling in RF-based Location Detection (EMLD) for Pervasive Computing Environments
Authors: Niraj Swami, Sheikh I. Ahamed
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

In recent years, a plethora of signal-based (Radio Frequency based) location detection techniques have been proposed for pervasive computing due to the limited scope of GPS when considering indoor and highly urban environments. However, these techniques have a major drawback in the error they incorporate. This paper addresses the problem of erratic location detection of mobile devices when signal-based technologies (non-GPS based solutions) are used. It generates an error model, EMLD, the parameters of which may be modified and used based on the surroundings of the target location to generate accurate location coordinates. This paper also provides an implementation of EMLD that can be used in order to determine location coordinates. It is a highly generalized approach that becomes more specific based on clients' needs that result in the assumptions and setup criteria of the approach.
Chemical Oxygen-Iodine Laser Technology Development using 3-D Navier-Stokes Simulation
Authors: Timothy J. Madden
Venue: Proceedings of the HPCMP Users Group Conference (2006)

Chemical lasers are complex devices that couple twophase chemistry, fluid dynamics, and optics to generate coherent radiation capable of projecting high energy fluxes very large distances at the speed of light. Such a capability is an obvious candidate for precision engagement of targets in multiple theaters of operation, as evidenced by development programs that are intended to advance chemical lasers from the laboratory to the weapon platform. Given the complexity of the interactions between the various physical processes, simulation of chemical lasers presents an obvious opportunity for the application of high performance computing to facilitate the understanding and optimization of these devices. The work presented here illustrates how high performance computing is used to achieve an increased understanding of the physics underlying chemical oxygen iodine lasers (COILs) and improve their operation. Computational fluid dynamic (CFD) for the chemically reacting COIL flowfield coupled to radiation transport models for the optical field are executed concomitant with achieving these goals.
Comparing artificial neural net with multiple regression in a biodata criterion validation study
Authors: Antonio Santonastasi
Venue:  (2007)

This research compared Artificial Neural Nets (ANNs) to multiple regression in a Biodata criterion validation study. Using four constructs derived from 15 Biodata questions, shared variance associated with oral interview scores were measured. We proposed: Biodata preselection inventory will predict Food Server oral interview success (H1); Using sequential regression, two Education constructs will predict Food Server Oral Interview success (H2); and (step 2) two Experience constructs will account for substantial incremental variance beyond that accounted for by two education constructs (H3); ANN will account for more shared variance compared to multiple regression (H4). Findings supported H1, H2, H3, and H4. Additional analysis of ANN should be conducted to clearly validate this technique.
Computing k-Vertex Connectivity on an Interval Graph
Authors: Tzong-Wann Kao, Shi-Jinn Horng
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 03 (1994)

We show that determine the maximum number of vertex connectivity, test k-vertex connectivity and determine the maximum number of vertex disjoint I_s - l_t paths of interval graphs can be solved either in O(log n) time using O{n) processors for the Unsorted case or in O{logn) time using O{n/logn) processors for the sorted case, and find k-vertex disjoint I_s - I_t paths of interval graphs can be solved in O{k logn) time using O{n^{2}/logn) processors on the EREW PRAM model, respectively. All parallel algorithms are optimal with respect to the time-processor product except the last one.
Optimizing the FPGA Implementation of HRT Systems
Authors: Marco Di Natale, Enrico Bini
Venue: Proceedings of the 13th IEEE Real Time and Embedded Technology and Applications Symposium (2007)

The availability of programmable hardware devices with high density of logic elements and the possibility of implementing CPUs (called softcores) using a fraction of the FPGA area offers additional flexibility for the implementation of embedded applications with real-time constraints. When implementing functions on such devices, designers can choose between hardware and software. Also, the designer can select the number of CPUs that must be created to best support the execution of the real-time software. In this paper, we define a design optimization procedure for hard real-time systems, in which each functional block can be implemented in HW, using the logic elements available on the FPGA, or in SW, by means of a real-time task executed by a softcore. The optimizer allocates the functions and the softcores such that the HW implemented part is mapped within the area constraints and the software part is allocated so that schedulability can be guaranteed. When feasible solutions exist, the minimum utilization solution is computed.
Eye-balls: computer vision in the circus
Authors: Joe Marshall
Venue: Proceedings of the 6th ACM SIGCHI conference on Creativity cognition (2007)

This proposal is for a discussion of the HCI and artistic performance issues presented by the use of interactive systems in live performances, with reference to a novel system designed to track a juggling performer and create audio visual accompaniments based on their movements.
The Wave of the Future
Authors: David Alan Grier
Venue: Computer (2007)

Since technology tends to move in unexpected directions, visions of the future are often more about today than tomorrow.