Search NASA⌕ Search

SEARCH · Search NASA

Results for “Filtering algorithms”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 901 records · Page 50

Charged particle tracking in real-time using a full-mesh data delivery architecture and associative memory techniques

We present a flexible and scalable approach to address the challenges of charged particle track reconstruction in real-time event filters (Level-1 triggers) in collider physics experiments. The method described here is based on a full-mesh architecture for data distribution and relies on the Associative Memory approach to implement a pattern recognition algorithm that quickly identifies and organizes hits associated to trajectories of particles originating from particle collisions. We describe a successful implementation of a demonstration system composed of several innovative hardware and algorithmic elements. The implementation of a full-size system relies on the assumption that an Associative Memory device with the sufficient pattern density becomes available in the future, either through a dedicated ASIC or a modern FPGA. We demonstrate excellent performance in terms of track reconstruction efficiency, purity, momentum resolution, and processing time measured with data from a simulated LHC-like tracking detector.

47 OTHER INSTRUMENTATION↗

A comparison of two position estimate algorithms that use ILS localizer and DME information. Simulation and flight test results

Simulation and flight tests were conducted to compare the accuracy of two algorithms designed to compute a position estimate with an airborne navigation computer. Both algorithms used ILS localizer and DME radio signals to compute a position difference vector to be used as an input to the navigation computer position estimate filter. The results of these tests show that the position estimate accuracy and response to artificially induced errors are improved when the position estimate is computed by an algorithm that geometrically combines DME and ILS localizer information to form a single component of error rather than by an algorithm that produces two independent components of error, one from a DMD input and the other from the ILS localizer input.

Knox, C. E.↗

Active Suppression of Instabilities in Engine Combustors

A method of feedback control has been proposed as a means of suppressing thermo-acoustic instabilities in a liquid- fueled combustor of a type used in an aircraft engine. The basic principle of the method is one of (1) sensing combustor pressure oscillations associated with instabilities and (2) modulating the rate of flow of fuel to the combustor with a control phase that is chosen adaptively so that the pressure oscillations caused by the modulation oppose the sensed pressure oscillations. The need for this method arises because of the planned introduction of advanced, lean-burning aircraft gas turbine engines, which promise to operate with higher efficiencies and to emit smaller quantities of nitrogen oxides, relative to those of present aircraft engines. Unfortunately, the advanced engines are more susceptible to thermoacoustic instabilities. These instabilities are hard to control because they include large dead-time phase shifts, wide-band noise characterized by amplitudes that are large relative to those of the instabilities, exponential growth of the instabilities, random net phase walks, and amplitude fluctuations. In this method (see figure), the output of a combustion-pressure sensor would be wide-band-pass filtered and then further processed to generate a control signal that would be applied to a fast-actuation valve to modulate the flow of fuel. Initially, the controller would rapidly take large phase steps in order to home in, within a fraction of a second, to a favorable phase region within which the instability would be reduced. Then the controller would restrict itself to operate within this phase region and would further restrict itself to operate within a region of stability, as long as the power in the instability signal was decreasing. In the phase-shifting scheme of this method, the phase of the control vector would be made to continuously bounce back and forth from one boundary of an effective stability region to the other. Computationally, this scheme would be implemented by the adaptive sliding phaser averaged control (ASPAC) algorithm, which requires very little detailed knowledge of the combustor dynamics. In the ASPAC algorithm, the power of the instability signal would be calculated from the wide-bandpass- filtered combustion-pressure signal and averaged over a period of time (typically of the order of a few hundredths of a second) corresponding to the controller updating cycle [not to be confused with the controller sampling cycle, which would be much shorter (typically of the order of 10(exp -4) second)].

Kopasakis, George↗

Proposed Analytical Methods for Determining Filter Media Properties

High Efficiency Particulate Air (HEPA) filters, commonly used in nuclear filtration applications, are an integral part of the waste management processes in nuclear plants. HEPA filters are 99.97% efficient filtration devices characterized by their high resistance to air flow, or pressure drop. From theoretical models, the initial pressure drop across a clean filter is proven to be a function of the filter media fiber diameters and porosity of the media. These filter properties are relatively difficult to obtain with traditional manual methods; therefore, there is a need to develop analytical methods to find the fiber diameter and porosity to determine the pressure drop. Typically, these values can be found by substituting a calculated representative value based upon measured values, such as equivalent fiber diameter based upon a clean pressure drop. However, these values may also be directly recorded and measured by incorporating Scanning Electron Microscope (SEM) image analysis and other measurement methods to analyze the filter media and determine its physical properties without the need for media testing. DiameterJ, an open source Java plug-in, used with ImageJ, can process images of filter media taken by an SEM to find statistical data such as mean fiber diameter and porosity. To produce the raw data, SEM images of two filter media type samples are taken and segmented in DiameterJ using the traditional and statistical region merging segmentation algorithms. Manual segmentation is necessary after the initial segmentation by the algorithms as the images tend to be too complex for the algorithms to output with the necessary accuracy. However, complications exist in the manual segmentation process as these methods can be time intensive and prone to the individual bias of the user. This in turn can skew the final mean fiber diameter result, and lead to either an over or under prediction of the pressure drop. It was also discovered that the porosity data produced by DiameterJ is inaccurate, as the SEM analyzes the three-dimensional filter media by projecting its geometry onto a plane and analyzing it as a two-dimensional binary image. Thus, the porosity is artificially inflated through the segmentation process, rendering this result incorrect. Alternatively, density determination, gravimetric analysis, and thickness testing of the filter media is collectively used to determine the filter fiber porosity. Together, the SEM image analysis and analytical lab methods produce results through direct measurements which allow for the prediction of the initial pressure drop from clean filter media without the need for prior media testing to collect pressure data. By improving upon this proposed analytical method in the future, there is potential to streamline the process of finding these filter properties into a more direct methodology for determining the pressure drop across HEPA filters.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Performance comparison of five frequency domain system identification techniques for helicopter higher harmonic control

This paper presents the results of a computer simulation comparing the performance of five system identification techniques currently proposed for use with helicopter, frequency domain, higher harmonic vibration control algorithms. The system identification techniques studied were: (1) the weighted least squares method in moving block format, (2) the classical Kalman filter, (3) a generalized Kalman filter, (4) the classical least mean square (LMS) filter, and (5) a generalized LMS filter. The generalized Kalman and LMS filters were derived by allowing for multistep operation, rather than the single-step update approach used by their classical versions. Both open-loop and closed-loop (vibration control mode) identification results are presented in the paper. The algorithms are evaluated in terms of their accuracy, stability, convergence properties, computation speeds, and the relative ease with which these techniques may be directly applied to the helicopter vibration control problem.

Jacklin, Stephen A.↗

A Fast Implementation of the ISOCLUS Algorithm

Unsupervised clustering is a fundamental building block in numerous image processing applications. One of the most popular and widely used clustering schemes for remote sensing applications is the ISOCLUS algorithm, which is based on the ISODATA method. The algorithm is given a set of n data points in d-dimensional space, an integer k indicating the initial number of clusters, and a number of additional parameters. The general goal is to compute the coordinates of a set of cluster centers in d-space, such that those centers minimize the mean squared distance from each data point to its nearest center. This clustering algorithm is similar to another well-known clustering method, called k-means. One significant feature of ISOCLUS over k-means is that the actual number of clusters reported might be fewer or more than the number supplied as part of the input. The algorithm uses different heuristics to determine whether to merge lor split clusters. As ISOCLUS can run very slowly, particularly on large data sets, there has been a growing .interest in the remote sensing community in computing it efficiently. We have developed a faster implementation of the ISOCLUS algorithm. Our improvement is based on a recent acceleration to the k-means algorithm of Kanungo, et al. They showed that, by using a kd-tree data structure for storing the data, it is possible to reduce the running time of k-means. We have adapted this method for the ISOCLUS algorithm, and we show that it is possible to achieve essentially the same results as ISOCLUS on large data sets, but with significantly lower running times. This adaptation involves computing a number of cluster statistics that are needed for ISOCLUS but not for k-means. Both the k-means and ISOCLUS algorithms are based on iterative schemes, in which nearest neighbors are calculated until some convergence criterion is satisfied. Each iteration requires that the nearest center for each data point be computed. Naively, this requires O(kn) time, where k denotes the current number of centers. Traditional techniques for accelerating nearest neighbor searching involve storing the k centers in a data structure. However, because of the iterative nature of the algorithm, this data structure would need to be rebuilt with each new iteration. Our approach is to store the data points in a kd-tree data structure. The assignment of points to nearest neighbors is carried out by a filtering process, which successively eliminates centers that can not possibly be the nearest neighbor for a given region of space. This algorithm is significantly faster, because large groups of data points can be assigned to their nearest center in a single operation. Preliminary results on a number of real Landsat datasets show that our revised ISOCLUS-like scheme runs about twice as fast.

Memarsadeghi, Nargess↗

A robust clustering algorithm for analysis of composition-dependent organic aerosol thermal desorption measurements

Abstract. One of the challenges of understanding atmospheric organic aerosol (OA) particles stems from its complex composition. Mass spectrometry is commonly used to characterize the compositional variability of OA. Clustering of a mass spectral dataset helps identify components that exhibit similar behavior or have similar properties, facilitating understanding of sources and processes that govern compositional variability. Here, we developed an algorithm for clustering mass spectra, the noise-sorted scanning clustering (NSSC), appropriate for application to thermal desorption measurements of collected OA particles from the Filter Inlet for Gases and AEROsols coupled to a chemical ionization mass spectrometer (FIGAERO-CIMS). NSSC, which extends the common density-based special clustering of applications with noise (DBSCAN) algorithm, provides a robust, reproducible analysis of the FIGAERO temperature-dependent mass spectral data. The NSSC allows for the determination of thermal profiles for compositionally distinct clusters of mass spectra, increasing the accessibility and enhancing the interpretation of FIGAERO data. Applications of NSSC to several laboratory biogenic secondary organic aerosol (BSOA) systems demonstrate the ability of NSSC to distinguish different types of thermal behaviors for the components comprising the particles along with the relative mass contributions and chemical properties (e.g., average molecular formula) of each mass spectral cluster. For each of the systems examined, more than 80 % of the total mass is clustered into 9–13 mass spectral clusters. Comparison of the average thermograms of the mass spectral clusters between systems indicates some commonality in terms of the thermal properties of different BSOA, although with some system-specific behavior. Application of NSSC to sets of experiments in which one experimental parameter, such as the concentration of NO, is varied demonstrates the potential for mass spectral clustering to elucidate the chemical factors that drive changes in the thermal properties of OA particles. Further quantitative interpretation of the thermograms of the mass spectral clusters will allow for a more comprehensive understanding of the thermochemical properties of OA particles.

54 ENVIRONMENTAL SCIENCES↗

Constructing an Efficient Self-Tuning Aircraft Engine Model for Control and Health Management Applications

Self-tuning aircraft engine models can be applied for control and health management applications. The self-tuning feature of these models minimizes the mismatch between any given engine and the underlying engineering model describing an engine family. This paper provides details of the construction of a self-tuning engine model centered on a piecewise linear Kalman filter design. Starting from a nonlinear transient aerothermal model, a piecewise linear representation is first extracted. The linearization procedure creates a database of trim vectors and state-space matrices that are subsequently scheduled for interpolation based on engine operating point. A series of steady-state Kalman gains can next be constructed from a reduced-order form of the piecewise linear model. Reduction of the piecewise linear model to an observable dimension with respect to available sensed engine measurements can be achieved using either a subset or an optimal linear combination of "health" parameters, which describe engine performance. The resulting piecewise linear Kalman filter is then implemented for faster-than-real-time processing of sensed engine measurements, generating outputs appropriate for trending engine performance, estimating both measured and unmeasured parameters for control purposes, and performing on-board gas-path fault diagnostics. Computational efficiency is achieved by designing multidimensional interpolation algorithms that exploit the shared scheduling of multiple trim vectors and system matrices. An example application illustrates the accuracy of a self-tuning piecewise linear Kalman filter model when applied to a nonlinear turbofan engine simulation. Additional discussions focus on the issue of transient response accuracy and the advantages of a piecewise linear Kalman filter in the context of validation and verification. The techniques described provide a framework for constructing efficient self-tuning aircraft engine models from complex nonlinear simulations.Self-tuning aircraft engine models can be applied for control and health management applications. The self-tuning feature of these models minimizes the mismatch between any given engine and the underlying engineering model describing an engine family. This paper provides details of the construction of a self-tuning engine model centered on a piecewise linear Kalman filter design. Starting from a nonlinear transient aerothermal model, a piecewise linear representation is first extracted. The linearization procedure creates a database of trim vectors and state-space matrices that are subsequently scheduled for interpolation based on engine operating point. A series of steady-state Kalman gains can next be constructed from a reduced-order form of the piecewise linear model. Reduction of the piecewise linear model to an observable dimension with respect to available sensed engine measurements can be achieved using either a subset or an optimal linear combination of "health" parameters, which describe engine performance. The resulting piecewise linear Kalman filter is then implemented for faster-than-real-time processing of sensed engine measurements, generating outputs appropriate for trending engine performance, estimating both measured and unmeasured parameters for control purposes, and performing on-board gas-path fault diagnostics. Computational efficiency is achieved by designing multidimensional interpolation algorithms that exploit the shared scheduling of multiple trim vectors and system matrices. An example application illustrates the accuracy of a self-tuning piecewise linear Kalman filter model when applied to a nonlinear turbofan engine simulation. Additional discussions focus on the issue of transient response accuracy and the advantages of a piecewise linear Kalman filter in the context of validation and verification. The techniques described provide a framework for constructing efficient self-tuning aircraft engine models from complex nonlinear simulatns.

Armstrong, Jeffrey B.↗

Advancements in the Aerosol Robotic Network (AERONET) Version 3 database – automated near-real-time quality control algorithm with improved cloud screening for Sun photometer aerosol optical depth (AOD) measurements

The Aerosol Robotic Network (AERONET) has provided highly accurate, ground-truth measurements of the aerosol optical depth (AOD) using Cimel Electronique Sun–sky radiometers for more than 25 years. In Version 2 (V2) of the AERONET database, the near-real-time AOD was semiautomatically quality controlled utilizing mainly cloud-screening methodology, while additional AOD data contaminated by clouds or affected by instrument anomalies were removed manually before attaining quality-assured status (Level 2.0). The large growth in the number of AERONET sites over the past 25 years resulted in significant burden to the manual quality control of millions of measurements in a consistent manner. The AERONET Version 3 (V3) algorithm provides fully automatic cloud screening and instrument anomaly quality controls. All of these new algorithm updates apply to near-real-time data as well as post-field-deployment processed data, and AERONET reprocessed the database in 2018. A full algorithm redevelopment provided the opportunity to improve data inputs and corrections such as unique filter-specific temperature characterizations for all visible and near-infrared wavelengths, updated gaseous and water vapor absorption coefficients, and ancillary data sets. The Level 2.0 AOD quality-assured data set is now available within a month after post-field calibration, reducing the lag time from up to several months. Near-real-time estimated uncertainty is determined using data qualified as V3 Level 2.0 AOD and considering the difference between the AOD computed with the pre-field calibration and AOD computed with pre-field and post-field calibration. This assessment provides a near-real-time uncertainty estimate for which average differences of AOD suggest a +0.02 bias and one sigma uncertainty of 0.02, spectrally, but the bias and uncertainty can be significantly larger for specific instrument deployments. Long-term monthly averages analyzed for the entire V3 and V2 databases produced average differences (V3–V2) of +0.002 with a ±0.02 SD (standard deviation), yet monthly averages calculated using time-matched observations in both databases were analyzed to compute an average difference of −0.002 with a ±0.004 SD. The high statistical agreement in multiyear monthly averaged AOD validates the advanced automatic data quality control algorithms and suggests that migrating research to the V3 database will corroborate most V2 research conclusions and likely lead to more accurate results in some cases.

David M. Giles↗

A FFT-based mesoscale continuum dislocation mechanics with defect energy: Applications to composites and polycrystals

A crystal plasticity elastoviscoplastic FFT (fast Fourier transform) formulation with a mesoscale continuum field dislocation mechanics model is presented, which incorporates a defect energy density that depends on GND densities and an associated material length scale. This allows to thermodynamically derive internal length scale dependent intra-crystalline backstress and Peach–Koehler force acting on GND densities. The model considers GND density evolution through a filtered numerical spectral approach, which is coupled with stress equilibrium through the elastoviscoplastic FFT algorithm. The discrete Fourier transform (DFT) method together with finite difference (FD) schemes is applied to solve both the backstress tensor and the Fourier–Green operator. Numerical results are first reported for two-phase laminate composites with plastic single crystal channels and elastic precipitates for shear loadings. Channel size effects are simulated and analyzed on the overall and local hardening behaviors during monotonous loadings. In addition, the evolutions of GND densities and the role of their associated backstress on size effects are examined during reversible shear loading. In a second part, the role of the defect energy internal length scale on polycrystal’s hardening during tension–compression is discussed. The results are compared to those obtained using FFT-based continuum field dislocation mechanics without defect energy.

36 MATERIALS SCIENCE↗

Z-Sequence: photometric redshift predictions for galaxy clusters with sequential random k-nearest neighbours

ABSTRACT We introduce Z-Sequence, a novel empirical model that utilizes photometric measurements of observed galaxies within a specified search radius to estimate the photometric redshift of galaxy clusters. Z-Sequence itself is composed of a machine learning ensemble based on the k-nearest neighbours algorithm. We implement an automated feature selection strategy that iteratively determines appropriate combinations of filters and colours to minimize photometric redshift prediction error. We intend for Z-Sequence to be a standalone technique but it can be combined with cluster finders that do not intrinsically predict redshift, such as our own DEEP-CEE. In this proof-of-concept study, we train, fine-tune, and test Z-Sequence on publicly available cluster catalogues derived from the Sloan Digital Sky Survey. We determine the photometric redshift prediction error of Z-Sequence via the median value of |Δ$z$|/(1 + $z$) (across a photometric redshift range of 0.05 ≤ $z$ ≤ 0.6) to be ∼0.01 when applying a small search radius. The photometric redshift prediction error for test samples increases by 30–50 per cent when the search radius is enlarged, likely due to line-of-sight interloping galaxies. Eventually, we aim to apply Z-Sequence to upcoming imaging surveys such as the Legacy Survey of Space and Time to provide photometric redshift estimates for large samples of as yet undiscovered and distant clusters.

Chan, Matthew C.↗

Analysis of estimation algorithms for autonomous navigation with TDRSS data

Estimation techniques for onboard orbit determination using Tracking and Data Relay Satellite System (TDRSS) data are investigated. The two user satellite orbits studied are similar to Landsat-D (near-circular, 700 kilometers altitude, near-polar inclination). The following estimation algorithms are identified as candidates for use in autonomous navigation: (1) the extended Kalman filter with process noise, (2) the EKF with consider parameters, (3) the sequential Kalman filter with consider parameters, and (4) the batch least-squares differential correction technique. The candidate estimators are evaluated with respect to their performance with both baseline and worst TDRSS measurement errors and tracking configurations.

Dunham, J.↗

Optimal Regulator Algorithms for the Control of Linear Systems

Control-theory design package, called Optimal Regulator Algorithms for Control of Linear Systems (ORACLS), aids in design of controllers and optimal filters for systems modeled by linear, time invariant differential and difference equations. ORACLS is particularly attractive rigorous tool for dealing with multi-input and multi-output dynamic systems in both continuous and discrete forms.

Armstrong, E. S.↗

Extensions to PIFCGT: Multirate output feedback and optimal disturbance suppression

New control synthesis procedures for digital flight control systems were developed. The theoretical developments are the solution to the problem of optimal disturbance suppression in the presence of windshear. Control synthesis is accomplished using a linear quadratic cost function, the command generator tracker for trajectory following and the proportional-integral-filter control structure for practical implementation. Extensions are made to the optimal output feedback algorithm for computing feedback gains so that the multirate and optimal disturbance control designs are computed and compared for the advanced transport operating system (ATOPS). The performance of the designs is demonstrated by closed-loop poles, frequency domain multiinput sigma and eigenvalue plots and detailed nonlinear 6-DOF aircraft simulations in the terminal area in the presence of windshear.

Broussard, J. R.↗

New approaches to some methodological problems of meteor science

Several low cost approaches to continuous radioscatter monitoring of the incoming meteor flux are described. Preliminary experiments were attempted using standard time frequency stations WWVH and CHU (on frequencies near 15 MHz) during nighttime hours. Around-the-clock monitoring using the international standard aeronautical beacon frequency of 75 MHz was also attempted. The techniques are simple and can be managed routinely by amateur astronomers with relatively little technical expertise. Time series analysis can now be performed using relatively inexpensive microcomputers. Several algorithmic approaches to the analysis of meteor rates are discussed. Methods of obtaining optimal filter predictions of future meteor flux are also discussed.

Meisel, David D.↗

Satellite image analysis using neural networks

The tremendous backlog of unanalyzed satellite data necessitates the development of improved methods for data cataloging and analysis. Ford Aerospace has developed an image analysis system, SIANN (Satellite Image Analysis using Neural Networks) that integrates the technologies necessary to satisfy NASA's science data analysis requirements for the next generation of satellites. SIANN will enable scientists to train a neural network to recognize image data containing scenes of interest and then rapidly search data archives for all such images. The approach combines conventional image processing technology with recent advances in neural networks to provide improved classification capabilities. SIANN allows users to proceed through a four step process of image classification: filtering and enhancement, creation of neural network training data via application of feature extraction algorithms, configuring and training a neural network model, and classification of images by application of the trained neural network. A prototype experimentation testbed was completed and applied to climatological data.

Sheldon, Roger A.↗

A new method for recognizing quadric surfaces from range data and its application to telerobotics and automation

The problem of recognizing and positioning of objects in three-dimensional space is important for robotics and navigation applications. In recent years, digital range data, also referred to as range images or depth maps, have been available for the analysis of three-dimensional objects owing to the development of several active range finding techniques. The distinct advantage of range images is the explicitness of the surface information available. Many industrial and navigational robotics tasks will be more easily accomplished if such explicit information can be efficiently interpreted. In this research, a new technique based on analytic geometry for the recognition and description of three-dimensional quadric surfaces from range images is presented. Beginning with the explicit representation of quadrics, a set of ten coefficients are determined for various three-dimensional surfaces. For each quadric surface, a unique set of two-dimensional curves which serve as a feature set is obtained from the various angles at which the object is intersected with a plane. Based on a discriminant method, each of the curves is classified as a parabola, circle, ellipse, hyperbola, or a line. Each quadric surface is shown to be uniquely characterized by a set of these two-dimensional curves, thus allowing discrimination from the others. Before the recognition process can be implemented, the range data have to undergo a set of pre-processing operations, thereby making it more presentable to classification algorithms. One such pre-processing step is to study the effect of median filtering on raw range images. Utilizing a variety of surface curvature techniques, reliable sets of image data that approximate the shape of a quadric surface are determined. Since the initial orientation of the surfaces is unknown, a new technique is developed wherein all the rotation parameters are determined and subsequently eliminated. This approach enables us to position the quadric surfaces in a desired coordinate system. Experiments were conducted on raw range images of spheres, cylinders, and cones. Experiments were also performed on simulated data for surfaces such as hyperboloids of one and two sheets, elliptical and hyperbolic paraboloids, elliptical and hyperbolic cylinders, ellipsoids and the quadric cones. Both the real and simulated data yielded excellent results. Our approach is found to be more accurate and computationally inexpensive as compared to traditional approaches, such as the three-dimensional discriminant approach which involves evaluation of the rank of a matrix. Finally, we have proposed one other new approach, which involves the formulation of a mapping between the explicit and implicit forms of representing quadric surfaces. This approach, when fully realized, will yield a three-dimensional discriminant, which will recognize quadric surfaces based upon their component surfaces patches. This approach is faster than prior approaches and at the same time is invariant to pose and orientation of the surfaces in three-dimensional space.

Alvertos, Nicolas↗

Truncated Gaussians as tolerance sets

This work focuses on the use of truncated Gaussian distributions as models for bounded data measurements that are constrained to appear between fixed limits. The authors prove that the truncated Gaussian can be viewed as a maximum entropy distribution for truncated bounded data, when mean and covariance are given. The characteristic function for the truncated Gaussian is presented; from this, algorithms are derived for calculation of mean, variance, summation, application of Bayes rule and filtering with truncated Gaussians. As an example of the power of their methods, a derivation of the disparity constraint (used in computer vision) from their models is described. The authors' approach complements results in Statistics, but their proposal is not only to use the truncated Gaussian as a model for selected data; they propose to model measurements as fundamentally in terms of truncated Gaussians.

Cozman, Fabio↗