Search

To sustain the current and increasing accessibility of space, a scalable communications infrastructure (i.e. the Solar System Internet, SSI) is necessary. The goal of this paper is to begin the discovery of the fundamental underlying mathematical structure of space networks to help the research community harness these structures for algorithm development and optimization. To ensure the applicability of the research, the approaches are considered through the lens of simulated scenarios inspired by the Artemis Back-to-the-Moon mission set for 2024. We note that any approach to an SSI must fit under the umbrella of Delay Tolerant Networking (DTN), due to celestial mobility, high link latencies, high variance in link latencies, disconnections, lack of end-to-end paths, and so on. These difficulties are exacerbated by the fact that the underlying structure of a space network is a time-evolving network and may experience multiple discontinuities in its topology. In this paper we propose several novel approaches to a mathematical foundation for Delay Tolerant Networking Theory that fall outside the traditional scope of temporal network theory. These techniques include methods from Topological Data Analysis, Dynamic Graph Analysis, Applied Algebraic Geometry, Probability Theory, and Game Theory. Some of these methods include tools adapted to the study of dynamic metric spaces, such as zigzag persistent homology and their higher parameter analogs. We find that several of these methods target desired engineering outcomes such as discovery and automatic sub-netting. While each approach is theoretical, they are also algorithmic in nature and offer immediate practical applications. The paper concludes with comparisons of the various methods along with suggestions for future work.

The NASA Orbital Debris Program Office (ODPO) has used various optical assets to acquire photometric data of Earth-orbiting objects to define the orbital debris environment. To better characterize and model optical data acquired from ground-based telescopes, the Optical Measurements Center (OMC) at NASA Johnson Space Center emulates illumination conditions seen in space by using equipment and techniques that parallel telescopic observations and source-target-sensor orientations. One of the OMC goals is to improve the size calculation used for optical data by developing an optical-based Size Estimation Model. The current size estimation requires applying a Lambertian phase function, a set albedo value, and range to the observed magnitude. The first step to improving the sampled brightness of laboratory targets is to remove aspect-angle dependencies. Then, the volume of possible object viewing angles is sampled at 21 combinations of azimuth and elevation angles for each solar phase angle. Finally, the acquired images are input into an image processing program that generates approximations for the object’s Bidirectional Reflectance Distribution Function (BRDF) and phase function. The BRDF is a radiometric concept that identifies an object’s material composition by matching a BRDF approximated with photometric data collected by ground-based telescopes with a BRDF generated experimentally from a known object in the laboratory. This paper presents the initial BRDF and phase function approximations for various fragments/targets acquired in the OMC and how the findings will be incorporated into ODPO models. A Lambertian sphere is used as a baseline for initial size estimation calculations and phase function comparisons. Spacecraft materials and fragments from hypervelocity laboratory impact tests are also presented to compare against the current assumed Lambertian phase function used for size estimates. This paper presents the preliminary phase function analysis and plan forward to utilize a laboratory-based phase function to improve the current optical size estimates using BRDF measurements for a large volume of targets composed of various shapes, sizes, and materials.

Advancing the Delay Tolerant Networking (DTN) effort has proven to be a unique and difficult challenge. In the journey to implementing space networking, NASA has considered several strategies. From direct translations of Internet Protocol (IP) to satellite networks to pre-planned routing structures in Contact Graph Routing (CGR), each potential solution for DTN has come with its fair share of setbacks and challenges. Frequently, these challenges can be traced back to specific assumptions made in the development of each protocol that do not carry over from ground networks to space networks. To address these fundamental assumptions, a more general and foundational networking theory is required. In this paper, we survey a novel mathematical foundation for networking using the theory of cellular sheaves. Sheaves form a mathematical tool for modeling local phenomenon that leads to global effects. Sheaves have been introduced a number of times, and our goal here is to summarize the applications and point towards important future work that must be done to build a stronger, cohesive theory for networking.

This paper revisits the Bode integral theorem, first described in 1945 for feedback amplifier design, in the context of modern satellite Attitude Control System (ACS) design tasks. Use of Bode's Integral clarifies in an elegant way the connection between open-loop stability margins and closed-loop bandwidth. More importantly it shows that there is a very strong tradeoff between disturbance rejection below the satellite controller design bandwidth, and disturbance amplification in the 'penalty region' just above the design bandwidth. This information has been successfully used to re-tune the control designs for several NASA science-mission satellites. The Appendix of this paper contains a complete summary of the relevant integral conservation theorems for stable, unstable, and non-minimum- phase plants.

This paper presents a new methodology for automatic knowledge driven image mining based on the theory of Mercer Kernels, which are highly nonlinear symmetric positive definite mappings from the original image space to a very high, possibly infinite dimensional feature space. In that high dimensional feature space, linear clustering, prediction, and classification algorithms can be applied and the results can be mapped back down to the original image space. Thus, highly nonlinear structure in the image can be recovered through the use of well-known linear mathematics in the feature space. This process has a number of advantages over traditional methods in that it allows for nonlinear interactions to be modelled with only a marginal increase in computational costs. In this paper we present the theory of Mercer Kernels; describe its use in image mining, discuss a new method to generate Mercer Kernels directly from data, and compare the results with existing algorithms on data from the MODIS (Moderate Resolution Spectral Radiometer) instrument taken over the Arctic region. We also discuss the potential application of these methods on the Intelligent Archive, a NASA initiative for developing a tagged image data warehouse for the Earth Sciences.

Previous papers have used two important functions for the solution of fractional order differential equations, the Mittag-Leffler functionE(sub q)[at(exp q)](1903a, 1903b, 1905), and the F-function F(sub q)[a,t] of Hartley & Lorenzo (1998). These functions provided direct solution and important understanding for the fundamental linear fractional order differential equation and for the related initial value problem (Hartley and Lorenzo, 1999). This paper examines related functions and their Laplace transforms. Presented for consideration are two generalized functions, the R-function and the G-function, useful in analysis and as a basis for computation in the fractional calculus. The R-function is unique in that it contains all of the derivatives and integrals of the F-function. The R-function also returns itself on qth order differ-integration. An example application of the R-function is provided. A further generalization of the R-function, called the G-function brings in the effects of repeated and partially repeated fractional poles.

This short paper is in response to one that appeared in this journal a few years ago [2]. The article was a comment on a previous paper [1], which presented the transformation equations between the standard two-port parameters. The equations were stated to be valid for complex terminations; which are useful when S-parameters are treated. The authors in [2] made some incorrect conclusions concerning the concept of "generalized scattering parameters", and this paper seeks to clarify the somewhat confusing area of generalized scattering parameters.

In this paper, we start with the definition of generalized functions as continuous linear functionals on the space of infinitely differentiable functions with compact support. The concept of generalization differentiation is introduced next. This is the most important concept in generalized function theory and the applications we present utilize mainly this concept. First, some of the results of classical analysis, such as Leibniz rule of differentiation under the integral sign and the divergence theorem, are derived using the generalized function theory. It is shown that the divergence theorem remains valid for discontinuous vector fields provided that the derivatives are all viewed as generalized derivatives. This implies that all conservation laws of fluid mechanics are valid as they stand for discontinuous fields with all derivatives treated as generalized deriatives. Once these derivatives are written as ordinary derivatives and jumps in the field parameters across discontinuities, the jump conditions can be easily found. For example, the unsteady shock jump conditions can be derived from mass and momentum conservation laws. By using a generalized function theory, this derivative becomes trivial. Other applications of the generalized function theory in aerodynamics discussed in this paper are derivation of general transport theorems for deriving governing equations of fluid mechanics, the interpretation of finite part of divergent integrals, derivation of Oswatiitsch integral equation of transonic flow, and analysis of velocity field discontinuities as sources of vorticity. Applications in aeroacoustics presented here include the derivation of the Kirchoff formula for moving surfaces,the noise from moving surfaces, and shock noise source strength based on the Ffowcs Williams-Hawkings equation.

During the last five years Fuzzy Logic has gained enormous popularity in the academic and industrial worlds. The success of this new methodology has led the microelectronics industry to create a new class of machines, called Fuzzy Machines, to overcome the limitations of traditional computing systems when utilized as Fuzzy Systems. This paper gives an overview of the methods by which Fuzzy Logic data structures are represented in the machines (each with its own advantages and inefficiencies). Next, the paper introduces WARP (Weight Associative Rule Processor) which is a dedicated VLSI megacell allowing the realization of a fuzzy controller suitable for a wide range of applications. WARP represents an innovative approach to VLSI Fuzzy controllers by utilizing different types of data structures for characterizing the membership functions during the various stages of the Fuzzy processing. WARP dedicated architecture has been designed in order to achieve high performance by exploiting the computational advantages offered by the different data representations.

This paper presents a study of fuzzy optimal variance control problem for dynamical systems subject to actuator amplitude and rate constraints. Using Takagi-Sugeno fuzzy modeling and dynamic Parallel Distributed Compensation technique, the stability and the constraints can be cast as a multi-objective optimization problem in the form of Linear Matrix Inequalities. By utilizing the formulations and solutions for the input and output variance constraint problems, we develop a fuzzy full-state feedback controller. The stability and performance of the proposed controller is demonstrated through its application to the airfoil flutter suppression.

Reachability manifold computation suffers from the curse of dimensionality and for large state spaces is computationally intractable. This paper examines the use of continuation methods to address this issue by formulating the reachability sub-space manifold calculation into a number of initial valued problems. As a result of computing the reachability manifold for a subspace of interest, an exponential improvement in computational cost occurs. This concept is applied to a position subspace reachability problem of a spacecraft in a Keplerian orbit under maximum thrust constraints. Future work includes a comparison of the proposed method with computing reachability manifolds using viscosity solutions of the Hamilton Jacobi Bellman partial differential equation.

Sturm's Theorem is a well-known result in real algebraic geometry that provides a function that computes the number of roots of a univariate polynomial in a semiopen interval. This paper presents a formalization of this theorem in the PVS theorem prover, as well as a decision procedure that checks whether a polynomial is always positive, nonnegative, nonzero, negative, or nonpositive on any input interval. The soundness and completeness of the decision procedure is proven in PVS. The procedure and its correctness properties enable the implementation of a PVS strategy for automatically proving existential and universal univariate polynomial inequalities. Since the decision procedure is formally verified in PVS, the soundness of the strategy depends solely on the internal logic of PVS rather than on an external oracle. The procedure itself uses a combination of Sturm's Theorem, an interval bisection procedure, and the fact that a polynomial with exactly one root in a bounded interval is always nonnegative on that interval if and only if it is nonnegative at both endpoints.

For the study of nonlinear dynamic systems, it is important to locate the equilibria and bifurcations occurring within a specified computational domain. This paper proposes a new approach for solving these problems and compares it to the numerical continuation method. The new approach is based upon branch and bound and utilizes rigorous enclosure techniques to yield outer bounding sets of both the equilibrium and local bifurcation manifolds. These sets, which comprise the union of hyper-rectangles, can be made to be as tight as desired. Sufficient conditions for the existence of equilibrium and bifurcation points taking the form of algebraic inequality constraints in the state-parameter space are used to calculate their enclosures directly. The enclosures for the bifurcation sets can be computed independently of the equilibrium manifold, and are guaranteed to contain all solutions within the computational domain. A further advantage of this method is the ability to compute a near-maximally sized hyper-rectangle of high dimension centered at a fixed parameter-state point whose elements are guaranteed to exclude all bifurcation points. This hyper-rectangle, which requires a global description of the bifurcation manifold within the computational domain, cannot be obtained otherwise. A test case, based on the dynamics of a UAV subject to uncertain center of gravity location, is used to illustrate the efficacy of the method by comparing it with numerical continuation and to evaluate its computational complexity.

This paper presents a fuzzy nonlinear controller to regulate the longitudinal dynamics of an aircraft and suppress the bending and torsional vibrations of its flexible wings. The fuzzy controller utilizes full-state feedback with input constraint. First, the Takagi-Sugeno fuzzy linear model is developed which approximates the coupled aeroelastic aircraft model. Then, based on the fuzzy linear model, a fuzzy controller is developed to utilize a full-state feedback and stabilize the system while it satisfies the control input constraint. Linear matrix inequality (LMI) techniques are employed to solve the fuzzy control problem. Finally, the performance of the proposed controller is demonstrated on the NASA Generic Transport Model (GTM).

As NASA moves toward expanded commercial spaceflight within its human exploration capability, there is increased emphasis on how to allocate responsibilities between government and commercial organizations to achieve coordinated program objectives. The practice of program-level functional analysis offers an opportunity for improved understanding of collaborative functions among heterogeneous partners. Functional analysis is contrasted with the physical analysis more commonly done at the program level, and is shown to provide theoretical performance, risk, and safety advantages beneficial to a government-commercial partnership. Performance advantages include faster convergence to acceptable system solutions; discovery of superior solutions with higher commonality, greater simplicity and greater parallelism by substituting functional for physical redundancy to achieve robustness and safety goals; and greater organizational cohesion around program objectives. Risk advantages include avoidance of rework by revelation of some kinds of architectural and contractual mismatches before systems are specified, designed, constructed, or integrated; avoidance of cost and schedule growth by more complete and precise specifications of cost and schedule estimates; and higher likelihood of successful integration on the first try. Safety advantages include effective delineation of must-work and must-not-work functions for integrated hazard analysis, the ability to formally demonstrate completeness of safety analyses, and provably correct logic for certification of flight readiness. The key mechanism for realizing these benefits is the development of an inter-functional architecture at the program level, which reveals relationships between top-level system requirements that would otherwise be invisible using only a physical architecture. This paper describes the advantages and pitfalls of functional analysis as a means of coordinating the actions of large heterogeneous organizations for space exploration programs.

The behavior of a general hybrid system in discrete time can be represented by a non-linear difference equation x(k+1) = Fk(x(k), theta(k)), where theta(k) is assumed to be a finite state Markov chain. An important step in the stability analysis of these systems is to establish the Markov property of (x(k), theta(k)). There are, however, no complete proofs of this property which are simple to understand. This paper aims to correct this problem by presenting a complete and explicit proof, which uses only basic measure-theoretical concepts.

Heat and mechanical work are coupled in the friction stir welding process. The process variables are RPM, translational weld speed, and downward plunge force. The strain-temperature history of a metal element at each point on the cross-section of the weld is determined by the process variables plus the individual flow path taken by the particular filament of metal flowing around the tool and ending on flat point. The strain-temperature history determines the properties of a metal element on the weld cross-section. The strain-temperature history is carefully controlled in metal processes where direct control is feasible. Indirect estimates of the flow paths and the strain-temperature histories of filaments comprising friction stir welds can be made from a model, if the model is good enough. This paper describes marker studies of flow path geometries for various process parameters. Observed geometries are compared with geometries estimated from models.

As more and more nonlinear estimation techniques become available, our interest is in finding out what performance improvement, if any, they can provide for practical nonlinear problems that have been traditionally solved using linear methods. In this paper we examine the problem of estimating spacecraft position using conical scan (conscan) for NASA's Deep Space Network antennas. We show that for additive disturbances on antenna power measurement, the problem can be transformed into a linear one, and we present a general solution to this problem, with the least square solution reported in literature as a special case. We also show that for additive disturbances on antenna position, the problem is a truly nonlinear one, and we present two approximate solutions based on linearization and Unscented Transformation respectively, and one 'exact' solution based on Markov Chain Monte Carlo (MCMC) method. Simulations show that, with the amount of data collected in practice, linear methods perform almost the same as MCMC methods. It is only when we artificially reduce the amount of collected data and increase the level of noise that nonlinear methods show significantly better accuracy than that achieved by linear methods, at the expense of more computation.

The PVS Theorem prover is a widely used formal verification tool used for the analysis of safety-critical systems. The PVS prover, though fully equipped to support deduction in a very general logic framework, namely higher-order logic, it must nevertheless, be augmented with the definitions and associated theorems for every branch of mathematics and Computer Science that is used in a verification. This is a formidable task, ultimately requiring the contributions of researchers and developers all over the world. This paper reports on the formalization of the integral calculus in the PVS theorem prover. All of the basic definitions and theorems covered in a first course on integral calculus have been completed.The theory and proofs were based on Rosenlicht's classic text on real analysis and follow the traditional epsilon-delta method. The goal of this work was to provide a practical set of PVS theories that could be used for verification of hybrid systems that arise in air traffic management systems and other aerospace applications. All of the basic linearity, integrability, boundedness, and continuity properties of the integral calculus were proved. The work culminated in the proof of the Fundamental Theorem Of Calculus. There is a brief discussion about why mechanically checked proofs are so much longer than standard mathematics textbook proofs.

The Hilbert-Huang Transform [HHT] is a novel empirical method for spectrum analysis of non-linear and non-stationary signals. The HHT is a recent development and much remains to be done to establish the theoretical foundation of the HHT algorithms. This paper develops the theoretical foundation for the convergence of the HHT sifting algorithm and it proves that the finest spectrum scale will always be the first generated by the HHT Empirical Mode Decomposition (EMD) algorithm. The theoretical foundation for cutting an extrema data points set into two parts is also developed. This then allows parallel signal processing for the HHT computationally complex sifting algorithm and its optimization in hardware.

Generative models of natural images have long been used in computer vision. However, since they only describe the of 2D scenes, they fail to capture all the properties of the underlying 3D world. Even though such models are sufficient for many vision tasks a 3D scene model is when it comes to inferring a 3D object or its characteristics. In this paper, we present such a generative model, incorporating both a multiscale surface prior model for surface geometry and reflectance, and an image formation process model based on realistic rendering, the computation of the posterior model parameter densities, and on the critical aspects of the rendering. We also how to efficiently invert the model within a Bayesian framework. We present a few potential applications, such as asteroid modeling and Planetary topography recovery, illustrated by promising results on real images.

The effect of Richard T. Cox's contribution to probability theory was to generalize Boolean implication among logical statements to degrees of implication, which are manipulated using rules derived from consistency with Boolean algebra. These rules are known as the sum rule, the product rule and Bayes Theorem, and the measure resulting from this generalization is probability. In this paper, I will describe how Cox s technique can be further generalized to include other algebras and hence other problems in science and mathematics. The result is a methodology that can be used to generalize an algebra to a calculus by relying on consistency with order theory to derive the laws of the calculus. My goals are to clear up the mysteries as to why the same basic structure found in probability theory appears in other contexts, to better understand the foundations of probability theory, and to extend these ideas to other areas by developing new mathematics and new physics. The relevance of this methodology will be demonstrated using examples from probability theory, number theory, geometry, information theory, and quantum mechanics.

It took much effort in the early days of non-Euclidean geometry to break away from the mindset that all spaces are flat and that two distinct parallel lines do not cross. Up to that point, all that was known was Euclidean geometry, and it was difficult to imagine anything else. We have suffered a similar handicap brought on by the enormous relevance of Boolean algebra to the problems of our age-logic and set theory. Previously, I demonstrated that the algebra of questions is not Boolean, but rather is described by the free distributive algebra. To get to this stage took much effort, as many obstacles-most self-placed-had to be overcome. As Boolean algebras were all I had ever known, it was almost impossible for me to imagine working with an algebra where elements do not have complements. With this realization, it became very clear that the sum and product rules of probability theory at the most basic level had absolutely nothing to do with the Boolean algebra of logical statements. Instead, a measure of degree of inclusion can be invented for many different partially ordered sets, and the sum and product rules fall out of the associativity and distributivity of the algebra. To reinforce this very important idea, this paper will go over how these constructions are made, while focusing on the underlying assumptions. I will derive the sum and product rules for a distributive lattice in general and demonstrate how this leads to probability theory on the Boolean lattice and is related to the calculus of quantum mechanical amplitudes on the partially ordered set of experimental setups. I will also discuss the rules that can be derived from modular lattices and their relevance to the cross-ratio of projective geometry.

The study of differential equations, or dynamical systems in general, has two fundamentally different approaches. We are most familiar with the construction of solutions to differential equations. Another approach is to study the statistical behavior of the solutions. Ergodic Theory is one of the most developed methods to study the statistical behavior of the solutions of differential equations. In the theory of satellite orbits, the statistical behavior of the orbits is used to produce 'Coverage Analysis' or how often a spacecraft is in view of a site on the ground. In this paper, we consider the use of Ergodic Theory for Coverage Analysis. This allows us to greatly simplify the computation of quantities such as the total time for which a ground station can see a satellite without ever integrating the trajectory, see Lo 1,2. More over, for any quantity which is an integrable function of the ground track, its average may be computed similarly without the integration of the trajectory. For example, the data rate for a simple telecom system is a function of the distance between the satellite and the ground station. We show that such a function may be averaged using the Ergodic Theorem.

Previously studied theoretical frameworks for dynamic constraint satisfaction problems (DCSPs) employ a small set of primitive operators to modify a problem instance. They do not address the desire to model problems using sophisticated global constraints, and do not address efficiency questions related to incremental constraint enforcement. In this paper, we extend a DCSP framework to incorporate global constraints with flexible scope. A simple approach to incremental propagation after scope modification can be inefficient under some circumstances. We characterize the cases when this inefficiency can occur, and discuss two ways to alleviate this problem: adding rejection variables to the scope of flexible constraints, and adding new features to constraints that permit increased control over incremental propagation.

Many physical processes appear to exhibit fractional order behavior that may vary with time or space. The continuum of order in the fractional calculus allows the order of the fractional operator to be considered as a variable. This paper develops the concept of variable and distributed order fractional operators. Definitions based on the Riemann-Liouville definitions are introduced and behavior of the operators is studied. Several time domain definitions that assign different arguments to the order q in the Riemann-Liouville definition are introduced. For each of these definitions various characteristics are determined. These include: time invariance of the operator, operator initialization, physical realization, linearity, operational transforms. and memory characteristics of the defining kernels. A measure (m2) for memory retentiveness of the order history is introduced. A generalized linear argument for the order q allows the concept of "tailored" variable order fractional operators whose a, memory may be chosen for a particular application. Memory retentiveness (m2) and order dynamic behavior are investigated and applications are shown. The concept of distributed order operators where the order of the time based operator depends on an additional independent (spatial) variable is also forwarded. Several definitions and their Laplace transforms are developed, analysis methods with these operators are demonstrated, and examples shown. Finally operators of multivariable and distributed order are defined in their various applications are outlined.

In this paper we derive fully-discrete Central WENO (CWENO) schemes for approximating solutions of one dimensional Hamilton-Jacobi (HJ) equations, which combine our previous works. We introduce third and fifth-order accurate schemes, which are the first central schemes for the HJ equations of order higher than two. The core ingredient is the derivation of our schemes is a high-order CWENO reconstructions in space.

The process of generating a block-structured mesh with the smoothness required for high-accuracy schemes is still a time-consuming process often measured in weeks or months. Unstructured grids about complex geometries are more easily generated, and for this reason, methods using unstructured grids have gained favor for aerodynamic analyses. The discontinuous Galerkin (DG) method is a compact finite-element projection method that provides a practical framework for the development of a high-order method using unstructured grids. Higher-order accuracy is obtained by representing the solution as a high-degree polynomial whose time evolution is governed by a local Galerkin projection. The traditional implementation of the discontinuous Galerkin uses quadrature for the evaluation of the integral projections and is prohibitively expensive. Atkins and Shu introduced the quadrature-free formulation in which the integrals are evaluated a-priori and exactly for a similarity element. The approach has been demonstrated to possess the accuracy required for acoustics even in cases where the grid is not smooth. Other issues such as boundary conditions and the treatment of non-linear fluxes have also been studied in earlier work This paper describes the application of the quadrature-free discontinuous Galerkin method to a two-dimensional shear layer problem. First, a brief description of the method is given. Next, the problem is described and the solution is presented. Finally, the resources required to perform the calculations are given.

This paper demonstrates the need for a nonconstant initialization for the fractional calculus and establishes a basic definition set for the initialized fractional differintegral. This definition set allows the formalization of an initialized fractional calculus. Two basis calculi are considered; the Riemann-Liouville and the Grunwald fractional calculi. Two forms of initialization, terminal and side are developed.

Recently, several linear scaling approaches have been introduced which replace the time dominating diagonalization step in semiempirical methods, enabling practical calculations to be performed, on very large molecules. This paper compares the accuracy and performance of pseudodiagonalization (PD), conjugate gradient density matrix search (CG-DMS), the Chebyshev polynomial expansion method (CEM), and purification of the density matrix (PDM) as linear scaling substitutions for diagonalization. The scaling, speed, and reliability of these methods are compared for AMI single point energy calculations on polyglycine chains (up to 20,000 atoms), water clusters (up to 12,300 atoms), and nucleic acids (up to 6300 atoms).

In this paper we are concerned with high-accuracy quadrature method solutions of nonlinear Fredholm integral equations of the form y(x) = r(x) + integral(0 to 1) g(x,t) F(t, y(t)) dt, 0 less than or equal to x less than or equal to 1, where the kernel function g(x,t) is continuous, but its partial derivatives have finite jump discontinuities across x = t. Such integrals equations arise, e.g., when one applies Green's function techniques to nonlinear two-point boundary value problems of the form U''(x) = f(x,y(x)), 0 less than or equal to x less than or equal to 1, with y(0) = y(sub 0) and g(l) = y(sub 1), or other linear boundary conditions. A quadrature method that is especially suitable and that has been employed for such equations is one based on the trapezoidal rule that has a low accuracy. By analyzing the corresponding Euler-Maclaurin expansion, we derive suitable correction terms that we add to the trapezoidal thus obtaining new numerical quadrature formulas of arbitrarily high accuracy that we also use in defining quadrature methods for the integral equations above. We prove an existence and uniqueness theorem for the quadrature method solutions, and show that their accuracy is the same as that of the underlying quadrature formula. The solution of the nonlinear systems resulting from the quadrature methods is achieved through successive approximations whose convergence is also proved. The results are demonstrated with numerical examples.

Based on purely abstract ecological theory, it has been argued that a system composed of two or more consumers competing for the same resource cannot persist. By analysis on a Monod format mathematical model, Hubble and others demonstrated that this assertion is true for all but very special cases of such competing organisms which are determined by an index formed by a grouping of. the parameters which characterize the biological processes of the competing organisms. In the laboratory, using a bioreactor, Hansen and Hubble obtained confirmatory results for several cases of two competing species, and they characterized it as "qualitative confirmation" of the assertion. This result is amazing, since the analysis required the exact equality of the hey index, and it seems certain that no pair of organism species could have exactly equal values. It is quite plausible, however, that pairs of organism species could have approximately equal indices, and the question of how different they could be and still have coexistence of the two (or more) presents itself. In this paper, the pursuit of this question and a compatible resolution is presented.

This paper presents a brief report on superstable semigroups - abstract theory and some applications thereof. The notion of super stability is a strengthening of exponential stability and occurs in Timoshenko models of structures with self-straining material using pure (idealized) rate feed- back. It is also relevant to the problem of Riesz bases of eigenfunctions of infinitesimal generators under perturbation.

This paper presents a generalized Bezout theorem which can be used to determine a tighter lower bound of the number of distinct points of intersection of two or more curves for a large class of plane curves. A new approach to determine a lower bound on the minimum distance (and also the generalized Hamming weights) for algebraic-geometric codes defined from a class of plane curves is introduced, based on the generalized Bezout theorem. Examples of more efficient linear codes are constructed using the generalized Bezout theorem and the new approach. For d = 4, the linear codes constructed by the new construction are better than or equal to the known linear codes. For d greater than 5, these new codes are better than the known codes. The Klein code over GF(2(sup 3)) is also constructed.

The generalized Hamming weights of linear codes were first introduced by Wei. These are fundamental parameters related to the minimal overlap structures of the subcodes and very useful in several fields. It was found that the chain condition of a linear code is convenient in studying the generalized Hamming weights of the product codes. In this paper we consider a class of codes defined over some varieties in projective spaces over finite fields, whose generalized Hamming weights can be determined by studying the orbits of subspaces of the projective spaces under the actions of classical groups over finite fields, i.e., the symplectic groups, the unitary groups and orthogonal groups. We give the weight hierarchies and generalized weight spectra of the codes from Hermitian varieties and prove that the codes satisfy the chain condition.

During geometry processing, tangent directions at the data points are frequently readily available from the computation process that generates the points. It is desirable to utilize this information to improve the accuracy of curve fitting and to improve data reduction. This paper presents a curve fitting method which utilizes both position and tangent direction data. This method produces G(exp 1) non-rational B-spline curves. From the examples, the method demonstrates very good data reduction rates while maintaining high accuracy in both position and tangent direction.

We present results showing an improvement of the accuracy of perturbation theory as applied to cosmological structure formation for a useful range of quasi-linear scales. The Lagrangian theory of gravitational instability of an Einstein-de Sitter dust cosmogony investigated and solved up to the third order is compared with numerical simulations. In this paper we study the dynamics of pancake models as a first step. In previous work the accuracy of several analytical approximations for the modeling of large-scale structure in the mildly non-linear regime was analyzed in the same way, allowing for direct comparison of the accuracy of various approximations. In particular, the Zel'dovich approximation (hereafter ZA) as a subclass of the first-order Lagrangian perturbation solutions was found to provide an excellent approximation to the density field in the mildly non-linear regime (i.e. up to a linear r.m.s. density contrast of sigma is approximately 2). The performance of ZA in hierarchical clustering models can be greatly improved by truncating the initial power spectrum (smoothing the initial data). We here explore whether this approximation can be further improved with higher-order corrections in the displacement mapping from homogeneity. We study a single pancake model (truncated power-spectrum with power-spectrum with power-index n = -1) using cross-correlation statistics employed in previous work. We found that for all statistical methods used the higher-order corrections improve the results obtained for the first-order solution up to the stage when sigma (linear theory) is approximately 1. While this improvement can be seen for all spatial scales, later stages retain this feature only above a certain scale which is increasing with time. However, third-order is not much improvement over second-order at any stage. The total breakdown of the perturbation approach is observed at the stage, where sigma (linear theory) is approximately 2, which corresponds to the onset of hierarchical clustering. This success is found at a considerable higher non-linearity than is usual for perturbation theory. Whether a truncation of the initial power-spectrum in hierarchical models retains this improvement will be analyzed in a forthcoming work.

The exact expressions for density matrix and Wigner functions of quantum systems are known only in special cases. Corresponding Hamiltonians are quadratic forms of Euclidean coordinates and momenta. In this paper we consider the problem of one-dimensional free particle movement in the bounded region 0 is less than x is less than a (including the case a = infinity).

This paper presents a new computational approach for performing fuzzy regression. In contrast to Bardossy's approach, the new approach, while dealing with fuzzy variables, closely follows the conventional regression technique. In this approach, treatment of fuzzy input is more 'computational' than 'symbolic.' The following sections first outline the formulation of the new approach, then deal with the implementation and computational scheme, and this is followed by examples to illustrate the new procedure.