Intraprocedural Analysis Based on Symbolic Execution for Bug Detection

Programming and Computer Software - In this paper, we overview the approaches and techniques employed by the Svace static analysis tool for intraprocedural analysis. This analysis implies the...     

Growing of Tubes with a Small Inner Diameter from the Melt by the Stepanov Method

A mathematical model is suggested for describing the growth of a crystal tube with a small inner diameter from the melt by the modified Stepanov method with the tube being affected by temperature pulses. The behavior of the inner and outer radii of the tube as a function of the amplitude and duration of temperature jumps is studied.     

Use of tension springs in the drive of the displacement system of a cryogenic cooler

Translated from Khimicheskoe i Neftyanoe Mashinostroenie, No. 5, p. 17, May, 1989.     

Inheritance of male hybrid sterility in the house musk shrew (Suncus murinus, Insectivora, Soricidae)

Two geographic races of the house musk shrew (Suncus murinus) were crossed and intercrossed in the laboratory. Many cases of male sterility were detected among the hybrids. Segregation analysis of the pedigree data showed that the inheritance of male sterility in interracial hybrids of S. murinus can be described within the framework of monogene polyallele model with sterility of a single allele combination. This model is similar if not identical to that proposed by Dobzhansky and Muller.     

On the power of randomization in on-line algorithms

Against in adaptive adversary, we show that the power of randomization in on-line algorithms is severely limited! We prove the existence of an efficient simulation of randomized on-line algorithms by deterministic ones, which is best possible in general. The proof of the upper bound is existential. We deal with the issue of computing the efficient deterministic algorithm, and show that this is possible in very general cases.A previous version of this paper appeared in the22nd ACM STOC Conference Proceedings. Part of this research was performed while A. Borodin and A. Wigderson were visitors at the International Computer Science Institute, and while G. Tardos was a visitor at the Hebrew University.     

Randomized priority algorithms

Borodin, Nielsen and Rackoff [13] introduced the class of priority algorithms as a framework for modeling deterministic greedy-like algorithms. In this paper we address the effect of randomization in greedy-like algorithms. More specifically, we consider approximation ratios within the context of randomized priority algorithms. As case studies, we prove inapproximation results for two well-studied optimization problems, namely facility location and makespan scheduling.     

On lower bounds for read-k-times branching programs

A syntactic read-k-times branching program has the restriction that no variable occurs more thank times on any path (whether or not consistent) of the branching program. We first extend the result in [31], to show that the “n/2 clique only function”, which is easily seen to be computable by deterministic polynomial size read-twice programs, cannot be computed by nondeterministic polynomial size read-once programs, although its complement can be so computed. We then exhibit an explicit Boolean functionf such that every nondeterministic syntactic read-k-times branching program for computingf has size exp $$\left( {\Omega \left( {\frac{n}{{4^k k^3 }}} \right)} \right).$$      

Video detection of problems in the melting of consumable electrodes in a vacuum arc furnace

Methods are proposed for the detection of problems in vacuum arc melting. Video cameras are mounted on the vacuum arc furnace in order to monitor the melting process. Usually, the automatic control system for the melting process only measures the quantities required for direct control. In some cases, those measurements do not permit the detection of specific nonstandard melting conditions. However, on the basis of the video images, the supervisor can identify and eliminate such problems. The video feed is divided into frames. Each frame is a matrix consisting of pixels. On the basis of the sum of pixels in the image, anomalous melting conditions may be determined. Algorithms are proposed for analysis of the video images so as to detect anomalous melting conditions.