Air Pollution Emission Inventory Survey for Israel

High ozone levels are regularly measured during summer months over the inland and mountainous regions of Israel. Studies analyzing the back trajectories of air masses responsible for the high ozone levels showed that the precursors originated from the densely populated Israeli coastline. In order to better understand the contribution of those emission sources to ozone production, it is essential to have an accurate emission inventory that can be inputted into a photochemical model. The present paper describes the methods used in preparing an emission inventory for Israel based on information available and published until 1998. The source and accuracy of the data available are described. The calculations performed and the assumptions taken in order to obtain data not directly available are clarified. The sources reported in the inventory were the major polluters (power plants, oil refineries, and cement industries); industry; transportation; and biogenic sources. The pollutants studied were SO₂, NO_x, CO, saturated and unsaturated hydrocarbons, ethylene, isoprene, toluene, xylene, formaldehyde, and aldehydes. The inventory showed that transportation is responsible for almost the entire CO and 30% of the volatile organic compounds emitted, although transportation itself accounts for only a fifth of total fuel consumption. About 75% of the NO_x emitted can be attributed to industrial sources and the remaining 25% to transportation. Model simulations using the emission inventory were performed and compared to data available from a monitoring station situated 30 km east of Tel Aviv. The results showed good agreement, validating the accuracy of the emission inventory. The present emission inventory provides an important database as input to photochemical models used in forecasting ozone levels over Israel.     

Distance-Dependent Distributed Directories

Distributed systems often make use of directory servers enabling the storage and retrieval of global information in the network. In many practical situations, the data are directly related to particular sites of the network, and therefore the desired retrieval characteristics are dependent on the network topology; for example, priority is given to having high accessibility to data generated in nearby locations. This paper defines the concept of distance-dependent directories, and then proposes appropriate accessibility measures and presents strategies for constructing such directories. The construction methods are based on efficient solutions to a new type of graph-covering problem. As an application, it is shown how to use a distance-dependent directory to implement a name-server component for a routing scheme.     

Fuzzy and probability vectors as elements of a vector space

The problem of defining vector space operations on fuzzy and probability vectors is discussed. It is shown that such a definition is equivalent to choosing a 1-1 and onto mapping from the unit interval into the real axis. Although such a mapping cannot be continuous, it is suggested that under certain approximations a continuous mapping can be chosen. A characterization of some useful mappings with applications to image processing is also given.     

Digital Image Compression by Outer Product Expansion

We approximate a digital image as a sum of outer products dxy^Twheredis a real number but the vectorsxandyhave elements +1, -1, or 0 only. The expansion gives a least squares approximation. Work is proportional to the number of pixels; reconstruction involves only additions.     

A Mechanized Proof Environment for the Convenient Computations Proof Method

A mechanized verification environment made up of theories over the deductive mechanized theorem prover PVS is presented, which allows taking advantage of the convenient computations method. This method reduces the conceptual difficulty of proving a given property for all the possible computations of a system by separating two different concerns: (1) proving that special convenient computations satisfy the property, and (2) proving that every computation is related to a convenient one by a relation which preserves the property. The approach is especially appropriate for applications in which the first concern is trivial once the second has been shown, e.g., where the specification itself is that every computation reduces to a convenient one. Two examples are the serializability of transactions in distributed databases, and sequential consistency of distributed shared memories. To reduce the repetition of effort, a clear separation is made between infrastructural theories to be supplied as a proof environment PVS library to users, and the specification and proof of particular examples. The provided infrastructure formally defines the method in its most general way. It also defines a computation model and a reduction relation—the equivalence of computations that differ only in the order of finitely many independent operations. One way to prove that this relation holds between every computation and some convenient one involves the definition of a measure function from computations into a well-founded set. Two possible default measures, which can be applied in many cases, are also defined in the infrastructure, along with useful lemmas that assist in their usage. We show how the proof environment can be used, by a step-by-step explanation of an application example.     

Toward Automatic Concurrent Debugging Via Minimal Program Mutant Generation with AspectJ

Debugging is one of the most time-consuming activities in program design. Work on automatic debugging has received a great deal of attention and there are a number of symposiums dedicated to this field. Automatic debugging is usually invoked when a test fails in one situation, but succeeds in another. For example, a test fails in one version of the program (or scheduler), but succeeds in another. Automatic debugging searches for the smallest difference that causes the failure. This is very useful when working to identify and fix the root cause of the bug.A new testing method instruments concurrent programs with schedule-modifying instructions to reveal concurrent bugs. This method is designed to increase the probability of concurrent bugs (such as races, deadlocks) appearing. This paper discusses integrating this new testing technology with automatic debugging. Instead of just showing that a bug exists, we can pinpoint its location by finding the minimal set of instrumentations that reveal the bug.In addition to explaining a methodology for this integration, we show an AspectJ-based implementation. We discuss the implementation in detail as it both demonstrates the advantage of the adaptability of open source tools and how our specific change can be used for other testing tools.     

Scintillation Reduction by Use of Multiple Gaussian Laser Beams With Different Wavelengths

We study the scintillation index of N partially overlapping collimated lowest order Gaussian laser beams with different wavelengths in weak atmospheric turbulence. Using the Rytov approximation, we calculate the initial beam separation that minimizes the longitudinal scintillation. Further reduction of the longitudinal scintillation is obtained by optimizing with respect to both beam separation and spot size. The longitudinal scintillation of the optimal N-beam configurations is inversely proportional to N, resulting in a 92% reduction for a nine-beam system compared with the single beam value. The radial scintillation values for the optimal N-beam configurations are significantly smaller than the corresponding single beam values     

Weak Convex Decomposition by Lines‐of‐sight

We define the convexity rank of a set of points to be the portion of mutually visible pairs of points out of the total number of pairs. Based on this definition of weak convexity, we introduce a spectral method that decomposes a given shape into weakly convex regions. The decomposition is applied without explicitly measuring the convexity rank. The method merely amounts to a spectral clustering of a matrix representing the all‐pairs line of sight. Our method can be directly applied on an oriented point cloud and does not require any topological information, nor explicit concavity or convexity measures. We demonstrate the efficiency of our algorithm on a large number of examples and compare them qualitatively with competitive approaches.