46464172
Metrics Comparison for Java Programs Using a Software Tool
5325970
Nearly Dynamic Task Model Scheduling with Aperiodic Tasks
671835
Algorithm for Reducing the Complexity of Switching Time in Real-Time Multitask Environments
9316570
Understanding the behavior of compiler optimizations
Compiler writers usually follow some known rules of thumb on the effectiveness of optimizations when implementing compilers. While many of these rules may be correct, it is a far better methodology to base implementation decisions on a scientific evaluation of optimizations. To this end, we present an exploration of the costs and benefits of optimizations implemented in Jikes RVM, a research virtual machine that includes an aggressive optimizing compiler. We measure and report the performance impact due to optimizations, both when the optimizations are used by themselves and when they are used with other optimizations. To understand why optimizations do or do not improve performance, we wrote kernel programs to test and explore the behavior of each optimization. To increase the generality of our results, we report measurements on two architectures (IA32 and PowerPC). Based on our findings, we present a set of recommendations for compiler writers.
16122349
Feature-Based Image Watermarking Method Using Scale-Invariant Keypoints
This paper addresses feature-based image watermarking methods for digital contents. Most previous watermarking algorithms suffer from geometric distortion attacks that desynchronize the location of the inserted watermark. In order to synchronize the watermark location, watermark synchronization should be performed. One solution for watermark synchronization is to use image features. This paper describes a feature-based watermarking method based on scale-invariant keypoints. We extract feature points from the scale-invariant keypoint extractor and then decompose feature points into a set of disjoint triangles. These triangles are watermarked by an additive spread-spectrum method on the spatial domain. We perform an intensive simulation in comparison with other feature-based watermarking methods using 100 test images. Results show that the proposed method is considerably robust against both geometric distortion attacks and signal processing attacks listed in Stirmark 3.1.
5285655
BIT: A Tool for Instrumenting Java Bytecodes
BIT (Bytecode Instrumenting Tool) is a collection of Java classes that allow one to build customized tools to instrument Java Virtual Machine (JVM) bytecodes. Because understanding program behavior is an essential part of developing effective optimization algorithms, researchers and software developers have built numerous tools that carry out program analysis. Although there are existing tools that analyze and modify executables on a variety of operating systems and machine architectures, there currently is no framework for carrying out the same task for JVM bytecodes. In this paper, we describe BIT, which allows the user to insert calls to analysis methods anywhere in the bytecode, so that information can be extracted from the user program while it is being executed. In this paper, we describe several simple tools built using BIT and also report on BIT's performance. We found that the overhead for the execution speed and size were between 23% to 150%.
5620319
Extraction of digital elevation models from satellite stereo images through stereo matching based on epipolarity and scene geometry
This paper addresses the problem of generating digital elevation models from satellite images taken by linear pushbroom cameras. Since there exist unique geometric properties for linear pushbroom images, we argue that the conventional DEM generation schemes developed for perspective images are not suitable for satellite images. Using the geometric properties of linear pushbroom images, we design a new matching strategy optimized for linear pushbroom image in three aspects: conjugate search method, correlation patch design and match sequence determination. We will discuss in what aspect conventional approaches and our new approach differ and show how performance has improved by hiring proper techniques. A series of experiments using SPOT panchromatic stereo pairs showed that our approach outperformed conventional approaches in terms of accuracy and processing time. q 2003 Elsevier B.V. All rights reserved.
35319384
Gesture spotting from continuous hand motion
This paper proposes a new method of gesture spotting based on the Hidden Markov Model (HMM) that extracts meaningful gestures from continuous hand motion. To remove non-gesture patterns from input patterns, we introduce the threshold model that calculates the threshold likelihood of the input pattern and helps to qualify an input pattern as a gesture. The proposed method extracts gestures with 93.38% reliability.