We give a result that implies an improvement by a factor of log log n in the hypercube bounds for the geometric problems of batched planar point location, trapezoidal decomposition, and polygon triangulation. The improvements are achieved through a better solution to the multisearch problem on a hypercube, a parallel search problem where the elements in the data structure S to be searched are totally ordered, but where it is not possible to compare in constant time any two given queries q and q’. Whereas the previous best solution to this problem took O(log n(log log n)^3) time on an n-processor hypercube, the solution given here takes O(log n (log log n)^2) time on an n-processor hypercube. The hypercube model for which we claim our bounds is the standard one, SIMD, with O(1) memory registers per processor, and with one-port communication. Each registar can store O(log n) bits, so that a processor knows its ID.

We propose a non-transform image compression technique based on approximate pattern matching, that we name Pattern Matching Image Compression (PMIC). The main idea behind it is a lossy extension of the Lempel-Ziv data compression scheme in which one searches for the longest prefix of an uncompressed image that approximately (e.g., D of mismatches are allowed) occurs in the already processed image. This main algorithm is enhanced with several new features such as searching for reverse approximate matching, recognizing substrings in images that are additively shifted versions of each other, introducing a variable and adaptive maximum distortion level D, and so forth. These enhancements are crucial to the overall quality of our scheme. In this paper we present algorithmic as well as experimental results of the Pattern Matching Image Compression. Our scheme turns out to be competitive with JPEG and wavelet compression for graphical and photographical images. A unique feature of the purposed algorithm is that an asymptotic performance of the scheme can be theroretically established. More precisely, under stationary mixing probablilistic model of an image and fixed maximum distortion level D, the compression ratio is asymptotically equal to the so called generalized Renyientropy r0(D). This entropy is in general smaller than the optimal rate distortion function R(D), but there is numerical evidence that these two quantities do not differ too much for small values of D.

This paper compares the conventional stopping criterion of ad-hoc mutation score with the proposed Barnard’s score notation technique based on the Bayesian SPRT to test the software mutation test-case adequacy. A Monte Carlo simulation is used to mimic the mutation analysis as in a software laboratory on the well known Trityp test program for two calculated experimental designs. The results indicate that the Bayesian SPRT through Barnard’s score notation proves at least equally accurate and more cost effective for the goal of a given test-case adequacy.

Networked multimedia applications are a proliferating new feature of the emerging National Information Infrastructure (NII). Such applications employ a variety of information technologies and services to make motion and still pictures, richly formatted text and hypertext, sound and data available to information appliances over networks. The results are new, attractive communications capabilities which are valued by end-users. For maximum user acceptance, the capabilities of information appliances and the communications services that interconnect them must be well matched to specific applications for multimedia features to work well. The Cross-Industry Working Team (XIWT) member companies have delineated a set of core capabilites needed to support effective networked multimedia applications. Using these capabilities as a guide, five NII Class designations or profiles are proposed. The NII Class Profiles are intended to associate information appliance and communications services capabilities with applications requirements. These class designations can serve two purposes: 1) to establish a framework for common understanding and basis for cooperation among information industry stakeholders, and 2) as a guide to inform consumers about product capablilities to assist their purchasing choices. Proposed implementation is through a to-be-developed “Servicemark” program, e.g., NII Class “X” Capable, with an appropriate logo. Industry leadership will provide increased marketing opportunities for all NII stakeholders, and more satisfied consumers.

This paper explores the problem of protecting a site on the Internet against hostile external Java applets while allowing trusted internal applets to run. With careful implementation, a site can be made resistant to current Java sercurity weaknesses as well as those yet discovered. In addition, we describe a new attack on certain sophisticated firewalls that is most effectively realized as a Java applet.

Maynard Anderson, D. James Bidzos, National Computer Security Association, Mark Rasch, RSA Data Security, Inc., Dr. Eugene Spafford, and Dr. Ross Stapleton-Gray herby respectfully submit this Brief “Amici Curiae” in support of Appelle Daniel J. Bernstein. Pursuant to Federal Rule of Appellate Procedure 29, Appellants and Appellee have consented to the filing of this Brief “Amici Curiae”. The letters indicated this consent are being filed simultaneously with the Clerk of the Court.

Enterprises using IBM’s premier operating system for S/390 mainframes, z/OS, may have a false sense of confidence regarding the vulnerability of corporate assets. The protection offered by widely used security products can often be circumvented as a result of loopholes in other add-on software. Many such systems are frequently not nearly as resistant to security penetration as corporate management have been led to believe. New inspection, certification and verification techniques must be implemented before MVS-based systems can be employed as a safe haven for the conduct of electronic commerce and a secure repository for corporate and national assets.