We conduct an asymptotic risk analysis of the nonlocal means image denoising algorithm for the Horizon class of images that are piecewise constant with a sharp edge discontinuity. We prove that the mean square risk of an optimally tuned nonlocal means algorithm decays according to n(-1) log (1/2+epsilon) n, for an n-pixel image with epsilon greater than 0. This decay rate is an improvement over some of the predecessors of this algorithm, including the linear convolution filter, median filter,...

Topics: DTIC Archive, RICE UNIV HOUSTON TX, *ALGORITHMS, ASYMPTOTIC SERIES, IMAGES, LINEAR FILTERING,...

A paper was published (Harsha and Subrahamanian Moosath, 2014) in which the authors claimed to have discovered an extension to Amari's alpha-geometry through a general monotone embedding function. It will be pointed out here that this so-called (F,G)-geometry (which includes F-geometry as a special case) is identical to Zhang's (2004) extension to the alpha-geometry, where the name of the pair of monotone embedding functions rho and tau were used instead of F and H used in Harsha and...

Topics: DTIC Archive, Zhang,Jun, MICHIGAN UNIV ANN ARBOR ANN ARBOR United States, logarithm functions,...

The languages accepted by UTCA's in log diameter time are the same as those accepted by UTCA's in which a cell's new state depends only on its sons' states and not on its own preceding state. This set of languages remains the same if we allow log diameter + constant time, but it increases if we allow 2 log diameter time. It is also shown that this set is the same as the set of languages generated by a special class of 'power of 2' OL-systems. (Author)

Topics: DTIC Archive, Klette,Reinhard, MARYLAND UNIV COLLEGE PARK COMPUTER VISION LAB, *PROGRAMMING...

The focus of this research was algebraic manipulation or symbolic computation as in MACSYMA. The dilogarithm function was studied to obtain methods for the integration of dilogs in closed form. The work points the way for a generalization of the concept of closed form solutions.

Topics: DTIC Archive, Moses, Joel, MASSACHUSETTS INST OF TECH CAMBRIDGE, *LOGARITHM FUNCTIONS,...

Internet protocols such as Secure Shell and Internet Protocol Security rely on the assumption that finding discrete logarithms is hard. The protocols specify fixed groups for Diffie-Hellman key exchange that must be supported. Although the protocols allow flexibility in the choice of group, it is highly likely that the specific groups required by the standards will be used in most cases. There are security implications to using a fixed group, because solving any discrete logarithm within a...

Topics: DTIC Archive, NAVAL POSTGRADUATE SCHOOL MONTEREY CA, *INTERNET, *LOGARITHM FUNCTIONS, *ALGORITHMS,...

Independent analyses using Fisher information, optimal filtering, and information theory show that matched filtering images with hypothetical patterns in the logarithmic domain provides an optimal method for pattern recognition in the presence of signal-dependent noise arising from complex Gaussian fluctuations in the received fields. This provides a mathematical justification for the use of logarithmic units (i.e., decibels) in a variety of engineering applications.

Topics: DTIC Archive, NAVAL RESEARCH LAB WASHINGTON DC, *LOGARITHM FUNCTIONS, *MATCHED FILTERS, *PATTERN...

This paper presents a procedure to measure the degree of imbalance of an unbalanced data set. The procedure is based on choosing an appropriate loglinear model for the subclass frequencies of the data. A measure of imbalance is then introduced as some function of the chi-squared statistic used in the goodness-of-fit test for the loglinear model. The proposed procedure can also be used to measure departures from certain types of balancce, such as proportionality of subclass frequencies, partial...

Topics: DTIC Archive, Khuri,Andre' I, FLORIDA UNIV GAINESVILLE DEPT OF STATISTICS, *CHI SQUARE TEST, LINEAR...

We question recent studies invoking the existence of a traditional logarithmic surface layer , or log layer, in the boundary layer of the rapidly-rotating core of a hurricane. One such study argues that boundary-layer parameterization schemes that do not include a log layer are badly flawed . Another study assumes the existence of a log-layer to infer drag coefficients at hurricane wind speeds. We provide theoretical reasoning supported by observational evidence as to why significant departures...

Topics: DTIC Archive, NAVAL POSTGRADUATE SCHOOL MONTEREY CA DEPT OF METEOROLOGY, *HURRICANES, BOUNDARY...

Let A be a bounded linear operator in a Hilbert space. If A is normal then log(absolute value of ((e to the At)u)) and log(absolute value of ((e to the A prime t)u)) are convex functions for all u not equal to 0. In this paper we prove that these properties characterize normal operators. (Author)

Topics: DTIC Archive, Friedland,Shmuel, WISCONSIN UNIV-MADISON MATHEMATICS RESEARCH CENTER,...

We consider the restless multi-armed bandit (RMAB) problem with unknown dynamics. In this problem, at each time, a player chooses K out of N (N K) arms to play. The state of each arm determines the reward when the arm is played and transits according to Markovian rules no matter the arm is engaged or passive. The Markovian dynamics of the arms are unknown to the player. The objective is to maximize the long-term reward by designing an optimal arm selection policy. The performance of a policy is...

Topics: DTIC Archive, CALIFORNIA UNIV DAVIS DEPT OF ELECTRICAL AND COMPUTER ENGINEERING, *MARKOV PROCESSES,...

Large-eddy simulation (LES) has been plagued by an inability to predict the law-of-the-wall (LOTW) in mean velocity in the surface layer at high Reynolds numbers. Brasseur & Wei developed a theory that explains the source of the difficulty and a framework within which LES can be designed to rectify the problem. The essential difficulty lies in nonphysical frictional content within the discretized dynamical system and the extent to which that frictional content interferes with the inertial...

Topics: DTIC Archive, PENNSYLVANIA STATE UNIV STATE COLLEGE, *EDDY CURRENTS, BOUNDARY LAYER, LOGARITHM...

The use of the exponential function in a finite field for cryptographic purposes is studied. The proposal is based on the conjecture that the inverse function, the logarithm, is not feasibly computable. A proof of this conjecture would have important consequences for theoretical computer science, even under the assumption that P does not equal NP.

Topics: DTIC Archive, Brassard,Gilles, CORNELL UNIV ITHACA N Y DEPT OF COMPUTER SCIENCE, *CRYPTOGRAPHY,...

The strain energy for a thin cylindrical shell was derived by integrating Flugge's expressions for the strains (W. Flugge, Statik und Dynamik der Schalen, Edwards Bros. Inc., Ann Arbor, 1943) and approximating logarithmic terms by expanding in series of ascending powers and neglecting terms above the cubic. The differences from previously obtained expressions in the cubic terms are pointed out. The fundamental disagreements in the previous expressions are discussed.

Topics: DTIC Archive, BLEICH, H. H., DIMAGGIO, F., COLUMBIA UNIV NEW YORK, *SHELLS(STRUCTURAL FORMS),...

H(x), the negative logarithm of the apriori probability M(x), i s Levin's variant of Kolmogorov's complexity of a natural number x. Let alpha(n) be the minimum complexity of a number larger than n, s(n) the logarithm of the apriori probability of obtaining a number larger than n. It was known that s(n) or = alpha(n) or = s(n) + H(s(n)). We show that the second estimate is in some sense sharp.

Topics: DTIC Archive, Gacs,Peter, STANFORD UNIV CALIF DEPT OF COMPUTER SCIENCE, *PROBABILITY, *RECURSIVE...

We give a new randomized parallel RAM algorithm for finding a spanning forest of an undirected graph in logarithmic time. These time bounds hold with arbitrary high probability for any input graph (i.e., we do not assume random input; these bounds hold for the worst case input graph). This result assumes a parallel RAM model which allows both concurrent writes and concurrent reads. Furthermore, we show that if the graph is not very sparse (i.e., if the number of edges is at least a logarithmic...

Topics: DTIC Archive, Reif,J H, HARVARD UNIV CAMBRIDGE MA AIKEN COMPUTATION LAB, *ALGORITHMS, *PARALLEL...

We are concerned with a class of problems described in a somewhat imprecise way as follows. Consider a linear operator of the form L + V(x), where L is the generator of a Markov process x sub t and the potential V(x) is some real-valued function on the state space sigma of x sub t. We are interested in probabilistic representations for solutions phi(s,x) to a certain backward equation with data phi(T,x) = phi(x) at a final time T.

Topics: DTIC Archive, Fleming, Wendell H, BROWN UNIV PROVIDENCE RI LEFSCHETZ CENTER FOR DYNAMICAL SYSTEMS,...

Several algorithms have been proposed for the computation of maximum likelihood estimates for contingency tables. Since multinomial logit response models can be treated as special versions of log-linear models, many of these techniques can be used for logit models as well. In this paper we compare, in a qualitative fashion, the relative merits of (1) two variants of Newton's method developed by Fienberg and Stewart; (2) GLIM, as developed by Nelder and Wedderburn; (3) the BMDP program for...

Topics: DTIC Archive, Fienberg,Stephen E, MINNESOTA UNIV ST PAUL DEPT OF APPLIED STATISTICS, *STATISTICAL...

We give a worst case analysis for two greedy heuristics for the integer programming problem minimize cx, Ax or = b, O or = x or = u, x integer, where the entries A, b, and c are all non-negative. The first heuristic is for the case where the entries in A and b are integral, the second only assumes the rows are scaled so that the smallest nonzero entry is at least 1. In both cases we compare the ratio of the value of the greedy solution to that of the integer optimal. The error bound grows...

Topics: DTIC Archive, Dobson,Greg, STANFORD UNIV CA SYSTEMS OPTIMIZATION LAB, *INTEGER PROGRAMMING, *ERROR...

In this paper we compare three different computational approaches for maximum likelihood estimation in logit situations: iterative proportional fitting, iteratively reweighted least squares as implemented in GLIM , a variant of Newton's method applied in a somewhat different form for loglinear and logit formulations.

Topics: DTIC Archive, Fienberg,Stephen E, MINNESOTA UNIV ST PAUL DEPT OF APPLIED STATISTICS, *STATISTICAL...

The problem of intersecting N half-spaces in K space is transformed to the problem of constructing the convex hull of N points in K space and a simple intersection problem.

Topics: DTIC Archive, Brown,Kevin Q, CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE, *COMPUTER...

Let F(t), 0 or = t or = 1, be a real function with two continuous derivatives such that F''=F=0 is empty. Then B yields meas. (s,t): F(s)-F(t) is a member of B is absolutely continuous; its density is continuous on IR/B sub 1, B sub i identical with y: Y=F(t sub 1)-F(t sub 2), F'(t sub 1) = F'(t sub 2) = 0, F''(t sub 1), F''(t sub 2) 0 , and has a logarithmic singularity at each B sub i. (Author)

Topics: DTIC Archive, Geman,Donald, NORTH CAROLINA UNIV AT CHAPEL HILL DEPT OF STATISTICS, *FUNCTIONAL...

A method for the calculation of abscissas and weight factors using Gaussian integration for integrands with a logarithmic singularity is presented. The method shows good convergent properties and allows for the accurate estimation of the error. A program is supplied for the generation of orthogonal polynomials with weight Log(x) to order n, and numerical tables for the Gaussian integration method are provided. Keywords: Abscissas, Gaussian integration, Orthogonal polynomials.

Topics: DTIC Archive, Wilkerson, Stephen A, NAVAL SURFACE WARFARE CENTER SILVER SPRING MD, *INTEGRATION,...

An algorithm is presented for computing 1n z with complex arithmetic, by extending to the complex plane Carlson's treatment of a classical iteration using arithmetic and geometric means. Although not competitive with current techniques which handle the real and imaginary parts separately, the algorithm may be useful in special purpose applications. A detailed analysis of convergence, scaling, and roundoff is given. Standard identities and some minor bookkeeping allow the evaluation of inverse...

Topics: DTIC Archive, Miel,George J, WISCONSIN UNIV-MADISON MATHEMATICS RESEARCH CENTER, *COMPLEX NUMBERS,...

The linear program min c sub t sub x subject to Ax=b, x or = 0, is solved by the projected Newton barrier method. The method consists of solving a sequence of subproblems of the form min c sub t sub x - micron sigma Ln x; subject to Ax=b. Extentions for upper bounds, free and fixed variables are given. A linear modification is made to the logarithmic barrier function, which results in the solution being bounded in all cases. It also facilitates the provision of a good starting point. The...

Topics: DTIC Archive, Marxen, Aeneas, STANFORD UNIV CA SYSTEMS OPTIMIZATION LAB, *LINEAR PROGRAMMING,...

We compared time profiles of changes of the unsigned photospheric magnetic flux in active regions with those of their associated soft X-ray (SXR) bursts for a sample of 75 M5 flares well-observed by GONG longitudinal magnetographs. Sixty-six of these events had stepwise changes in the spatially-integrated unsigned flux during the SXR flares. In superposed epoch plots for these 66 events, there is a sharp increase in the unsigned magnetic flux coincident with the onset of the flare impulsive...

Topics: DTIC Archive, AIR FORCE RESEARCH LAB KIRTLAND AFB NM SPACE VEHICLES DIRECTORATE, *MAGNETIC FIELDS,...

The authors discuss interior-point methods for linear programming derived by applying a logarithmic barrier transformation and performing projected Newton steps for a sequence of barrier parameters. Under certain conditions, one of these projected Newton barrier methods is shown to be equivalent to Karmarkar's (1984) projective method for linear programming. Details are given of a specific barrier algorithm and its practical implementation. Numerical results are given for several nontrivial...

Topics: DTIC Archive, Gill,P E, STANFORD UNIV CA SYSTEMS OPTIMIZATION LAB, *LINEAR PROGRAMMING, *LEAST...

This paper describes circuits for computation of a large class of algebraic functions on polynomials, power series, and integers, for which it has been a long standing open problem to compute in depth less than omega(log n) to the second power. Algebraic circuits assume unit cost for elemental addition and multiplication. This paper describes O(log n) depth algebraic circuits which given as input the coefficients of n degree polynomials (over an appropriate ring), compute the product of n sub...

Topics: DTIC Archive, Reif,J H, HARVARD UNIV CAMBRIDGE MA AIKEN COMPUTATION LAB, *CIRCUITS, *ALGEBRAIC...

We consider the neurologically-inspired hypothesis that higher level cognition is built on the same fundamental building blocks as low-level perception. That is, the same basic algorithm that is able to represent and perform inference on low-level sensor data can also be used to process relational structures. We present a system that represents relational structures as feature bags. Using this representation, our system leverages algorithms inspired by the sensory cortex to automatically create...

Topics: DTIC Archive, NAVAL RESEARCH LAB WASHINGTON DC, *COGNITION, *INFORMATION RETRIEVAL, *LEARNING,...

A commonly studied problem in the field of cryptography is the Discrete Logarithm Problem. This problem is also referred to as the "distance" problem. Basically, one would like to know where a particular binary n-tuple is in a list combining all of them, represented as powers of some primitive element, or equivalently what is the distance between a given pair of n-tuples in a similar representation. A de Bruijn sequence is a well-known periodic binary sequence in which every n-tuple...

Topics: DTIC Archive, Matty, Douglas M., NAVAL POSTGRADUATE SCHOOL MONTEREY CA, *CRYPTOGRAPHY,...

Properties of the difference of two sums containing products of binomial coefficients and their logarithms which arise in the application of Shannon's information theory to a certain class of covert channels are deduced. Some allied consequences of the latter are also recorded.

Topics: DTIC Archive, Miller, Allen R, NAVAL RESEARCH LAB WASHINGTON DC CENTER FOR HIGH ASSURANCE COMPUTING...

A non-trivial factor of a composite number n can be found by performing arithmetic steps in a number proportional to the number of bits in n, and thus there are extremely short straight-line factoring programs. However, this theoretical result does not imply that natural numbers can be factored in polynomial time in the Turing-Machine model of complexity, since the numbers operated on can be as big as 2 to the power c n-squared, thus requiring exponentially many bit operations.

Topics: DTIC Archive, Shamir,Adi, MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR COMPUTER SCIENCE,...

The identification of certain groups of variables in optimization problems is an important issue and can be used to computational advantage. In this paper new logarithmic indicators are introduced. It is demonstrated that the logarithmic Tapia indicators have superior ability for identifying several subgroups of variables in the context of primal-dual interior-point methods.

Topics: DTIC Archive, El-Bakry, A S, RICE UNIV HOUSTON TX DEPT OF COMPUTATIONAL AND APPLIED MATHEMATICS,...

This paper describes circuits for computation of various algebraic functions on polynomials, power series, integers, and reals. Let R(x) be the polynomials and power series over a commutative ring which supports a fast Fourier transform and let Zx be the polynomials and power series over the rationals Q. For polynomials of degree n-1, we give circuits of depth 0(log n) for computing - the m-th power of a polynomial and the product of m polynomials in R(x), where m=0(n) - the symmetric functions...

Topics: DTIC Archive, Reif,John, HARVARD UNIV CAMBRIDGE MA AIKEN COMPUTATION LAB, *COMPUTATIONS, *ALGEBRAIC...

Is it possible to play a fair game of 'Mental Poker'. We will give a complete (but paradoxical) answer to this question. We will first prove that the problem is intrinsically insoluble, and then describe a fair method of playing 'Mental Poker'. (Author)

Topics: DTIC Archive, Shamir,Adi, MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR COMPUTER SCIENCE,...

Recently, Saunders 1974 has generalized the so-called reciprocal property for normality. Distributions having this property are called xi-normal, and it is of interest to make statistical inferences about the relevant parameters when sampling from such a distribution. Previous work on such problems has been from the sampling viewpoint. This paper approaches the inference problem from the Bayesian point of view and investigate the posterior of the parameters involved when sampling is from the...

Topics: DTIC Archive, Draper,Norman R, WISCONSIN UNIV-MADISON MATHEMATICS RESEARCH CENTER, *STATISTICAL...

The uniform word problem for finite groups presented by their multiplication tables is considered. Upper bounds of 0(k-squared) for arbitrary group and 0(n log-squared n) for arbitrary semigroup and 0(n log n) for abelian groups are shown where n is the length of the presentation. (Author)

Topics: DTIC Archive, Lipton,Richard J, YALE UNIV NEW HAVEN CONN DEPT OF COMPUTER SCIENCE,...

The authors describe a primal-dual interior point algorithm for linear programming problems which requires a total of O cubed L arithmetic operations. Each iteration updates a penalty parameter and finds an approximate Newtons direction associated with the Kuhn-Tucker system of equations which characterizes a solution of the logarithm barrier function problem. This direction is then used to find the next iterate. The algorithm is based on the path following idea. The total number of iterations...

Topics: DTIC Archive, Monteiro,R C, CALIFORNIA UNIV BERKELEY OPERATIONS RESEARCH CENTER, *ALGORITHMS,...

The authors describe a primal-dual interior point algorithm for convex quadratic programming problems which requires a total of O(cu n L) arithmetic operations. Each iteration updates a penalty parameter and finds an approximate Newton's direction associated with the Kuhn-Tucker system of equations which characterizes a solution of the logarithm barrier function problem. This direction is then used to find the next iterate. The algorithm is based on the path following idea. The total number of...

Topics: DTIC Archive, Monteiro, R C, CALIFORNIA UNIV BERKELEY OPERATIONS RESEARCH CENTER, *ALGORITHMS,...

Interviews with experienced nap-of-the-earth (NOE) instructor pilots (IPs) indicate there are two major observable factors to consider in measuring the skill of an NOE navigator: navigational accuracy and speed. It was deemed desirable, therefore, to combined accuracy and speed into a single composite score so that NOE navigators can be compared even when they navigate with different styles (slow and accurate versus fast with course errors) over routes of different lengths. The score thus...

Topics: DTIC Archive, Holman, Garvin L, ARMY RESEARCH INST FOR THE BEHAVIORAL AND SOCIAL SCIENCES...

This report describes how the method of Matched Asymptotic Expansions (MAE) can be used safely and systematically (1) to indicate the appropriate from taken by the inner (near field) and outer (wave field) series and (2) to determine all unknown functions and constants appearing in both series by matching the series according to a clearcut rule. These points are illustrated by detailed study of several very simple problems in low-frequency acoustic scattering problems which serve to demonstrate...

Topics: DTIC Archive, Crighton,David G, CATHOLIC UNIV OF AMERICA WASHINGTON DC DEPT OF MECHANICAL...

A number of tests are compared for testing the hypothesis of a constant intensity against the alternative of an increasing intensity function in a nonhomogeneous Poison process (NHPP). The powers of the tests are determined by Monte Carlo simulation against alternatives which are increasing at an exponential rate, a power rate (Weibull intensity), and a logarithmic rate. A few exact powers are also obtained. The study includes the well known Laplace test statistic which is known to be...

Topics: DTIC Archive, Bain,Lee J, MISSOURI UNIV-ROLLA, *Statistical tests, *Poisson equation, *Monte Carlo...

This document considers the parallel time complexity of logic programs without function symbols, called logical query programs. The authors give a PRAM algorithm for computing the minimum model of a logical query program, and show that for programs with the polynomial fringe property this algorithm runs in logarithmic time. As a result, the linear and piecewise linear classes of logic programs are in NC. Then they examine several nonlinear cases in which the program has a single recursive rule...

Topics: DTIC Archive, Ullman, Jeffrey D, STANFORD UNIV CA DEPT OF COMPUTER SCIENCE, *LINEAR PROGRAMMING,...

Parameters of interest in statistics can often be expressed as functionals T(F) of the underlying population distribution function, in which case a natural sample analogue estimator is provided by the statistical function T(F sub n) based upon the sample distribution function F sub N. Several notions of differentiability of functionals T are formulated, including innovations designed to broaden the scope of statistical application. Methodology for finding the differential, and for utilizing it...

Topics: DTIC Archive, Boos,Dennis D, FLORIDA STATE UNIV TALLAHASSEE DEPT OF STATISTICS, *STATISTICAL...

We consider the standard single-server queue with unlimited waiting space and the first-out service discipline. We find conditions for the steady- state waiting-time distribution to have small-tail asymptotics of a certain form. We require only stationarity of the basic sequence of service times minus interarrival times and a Gartner-Ellis condition for the cumulant generating function of the associated partial sums.

Topics: DTIC Archive, Glynn, Peter W, STANFORD UNIV CA OPERATIONS RESEARCH HOUSE, *PROBABILITY, *QUEUEING...

If p(sub 1)..... , P(sub m)are n-variate polynomials with integral coefficients and no common zeros in C(exp n), Brownawell has shown in 1986 that there exist q(sub 1 )%...., q(sub m) polynomials with integral coefficients and nu is an element of Z(+) such that p(sub 1) q(sub 1) + ... + p(sub m) q(sub m) = nu, and max deg q(sub j) /= [max deg p(sub j) (exp n))]. On the other hand if h = logarithm of the largest coefficient of all the p(sub j), and h(sub 1) is the corresponding quantity for the...

Topics: DTIC Archive, Berenstein, Carlos A, MARYLAND UNIV COLLEGE PARK DEPT OF MATHEMATICS, *INTEGRALS,...

The present paper studies the properties of the distribution of sums of dependent log-normal random variables and methods to compute numerically their corresponding c.d.f.'s. The dependence between the log-normal variables is defined in terms of the correlation between the corresponding normal variables. Two methods for numerical computations of the exact cumulative distributions are developed first. One can be described as a numerical convolution and the other is a Gauss-Legendre quadrature....

Topics: DTIC Archive, Zacks,S, CASE WESTERN RESERVE UNIV CLEVELAND OHIO DEPT OF MATHEMATICS AND STATISTICS,...

The identification of the extreme points of a convex set is an important problem in mathematics. One reason for identifying the extreme points is that they are, in many instances, the basic building blocks for the convex set. For instance, when the convex set is a compact subset of a locally convex space it is the closed convex hull of its extreme points (Krein-Milman Theorem) and if in addition the set is metrizable, any point in it has an integral representation in terms of the extreme points...

Topics: DTIC Archive, Langberg ,Naftali A, FLORIDA STATE UNIV TALLAHASSEE DEPT OF STATISTICS, *CONVEX SETS,...

Several finite elastic strain measures are evaluated for use in constitutive models of crystalline elasticity and elastoplasticity. These include the Green material strain tensor, the Eulerian material strain tensor, and the logarithmic material strain tensor, all of which are referred to locally relaxed coordinates invariant under spatial rotations. Solutions to the planar shock problem from previous work are summarized, and new applications of logarithmic strain-based theory toward shock...

Topics: DTIC Archive, ARMY RESEARCH LAB ABERDEEN PROVING GROUND MD WEAPONS AND MATERIALS RESEARCH...

Magnetoresistance of the nanocomposite Fe(x)(SiO2)(1-x) (x = 0.6) at high enough magnetic field is logarithmic function of the magnetic field. Such a dependence does not fall into the known theory of giant magnetoresistance of ferromagnetic nanocomposites. This paper examines the giant magnetoresistance of such a system in terms of a simple model where the non-ordinary quasi-logarithmic magnetic field dependence of nanocomposite magnetoresistance is related to the non-spherical granules'...

Topics: DTIC Archive, Meilikhov, E., Raquet, B., RUSSIAN RESEARCH CENTER MOSCOW KURCHATOV INST, *LOGARITHM...

Given a planar straight line graph G with n vertices and a point PO, locating PO means to find the region of the planar subdivision induced by G which contains PO. Recently, Lipton and Tarjan presentd a brillian but extremely complex point location algorithm which runs in time 0(logn) on a data structure using 0(n) storage. This paper presents a practical algorithm which runs in less than 6 (log2n) comparisons on a data structure which uses 0(nlogn) storage, in the worst case. The method rests...

Topics: DTIC Archive, Preparata,Franco P, ILLINOIS UNIV AT URBANA-CHAMPAIGN APPLIED COMPUTATION THEORY...