Signature search time evaluation in flat file databases

For the first time, divisible load scheduling theory is used to solve for the expected time for searching for both single and multiple signatures in certain multiple processor database architectures. The target architectures examined for illustrative purposes are linear daisy chains and single level tree networks with single and multiple installment load distribution. The use of divisible load modeling and analysis yields elegant expressions for expected search time.     

Power Inversion Array in a Rotating Source Environment

The steady state performance of the Frost power inversion array is evaluated, assuming constant rotational velocity of the external noise environment in the sin ? domain. The weight vector is solved implicitly in terms of a linear matrix equation. Approximate criteria are derived for weight vector and output power deviation from optimal values, which are then applied to determine the maximum scan rate of a radar sidelobe canceler.     

Mineral and energy exploration in Yugoslavia: Activity of the IGCP project 143 working group

This report on the activity of the Yugoslav IGCP Project 143 (“Remote Sensing and Mineral Exploration”) Working Group consists actually of three parts. First part of it represents a summary of total Yugoslav Project 143 Group activities from year 1977–1982. Second part of the paper is dealing with a recent example of joint activity within the Project 143 Group, which resulted in a tectonical map of Mount ?ara area, based on the interpretation of LANDSAT images. The third part shows results of detection of submarine gas seepages by thermal IR survey in the offshore area of Northern Adriatic and the relevant tectonic interpretation of Istra peninsula area.     

Distributed computation with communication delay [distributedintelligent sensor networks]

A linear network of communicating processors is examined. The objective is to solve a computational problem in a minimal amount of time. The processors in the networks may be equipped either with or without front-end processors for communication off-loading. The cases of equal division of processing load and optimal division of processing load are discussed for both the network with front-end processors and the network without front end processors. An example of the inclusion of solution time, the time taken for processors to report the solution back to the problem originator, is also presented     

Simple Eigenvalue-Equalizing Preprocessor for Broadband Power Inversion Array

By expressing the input autocorrelation function in a power series of bandwidth, this paper derives a small bandwidth firstorder approximation for the covariance matrix of the broadband tapped delay line power inversion array. The structure of the associated eigenvalues is then deduced, giving (number of taps)/2 sets of eigenvalues, the eigenvalues in the ith set being proportional to (bandwidth)2(i-1). Thus a simple transformation preprocessor which depends only on the bandwidth, tap spacing, and number of taps is derived for eliminating the spread of eigenvalues due to the use of tapped delay line processing.