Modeling Personalized Email Prioritization: Classification-based and Regression-based Approaches

DOE Office of Scientific and Technical Information (OSTI.GOV)

Yoo S.; Yang, Y.; Carbonell, J.

2011-10-24

Email overload, even after spam filtering, presents a serious productivity challenge for busy professionals and executives. One solution is automated prioritization of incoming emails to ensure the most important are read and processed quickly, while others are processed later as/if time permits in declining priority levels. This paper presents a study of machine learning approaches to email prioritization into discrete levels, comparing ordinal regression versus classier cascades. Given the ordinal nature of discrete email priority levels, SVM ordinal regression would be expected to perform well, but surprisingly a cascade of SVM classifiers significantly outperforms ordinal regression for email prioritization. Inmore » contrast, SVM regression performs well -- better than classifiers -- on selected UCI data sets. This unexpected performance inversion is analyzed and results are presented, providing core functionality for email prioritization systems.« less

MCNP (Monte Carlo Neutron Photon) capabilities for nuclear well logging calculations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Forster, R.A.; Little, R.C.; Briesmeister, J.F.

The Los Alamos Radiation Transport Code System (LARTCS) consists of state-of-the-art Monte Carlo and discrete ordinates transport codes and data libraries. The general-purpose continuous-energy Monte Carlo code MCNP (Monte Carlo Neutron Photon), part of the LARTCS, provides a computational predictive capability for many applications of interest to the nuclear well logging community. The generalized three-dimensional geometry of MCNP is well suited for borehole-tool models. SABRINA, another component of the LARTCS, is a graphics code that can be used to interactively create a complex MCNP geometry. Users can define many source and tally characteristics with standard MCNP features. The time-dependent capabilitymore » of the code is essential when modeling pulsed sources. Problems with neutrons, photons, and electrons as either single particle or coupled particles can be calculated with MCNP. The physics of neutron and photon transport and interactions is modeled in detail using the latest available cross-section data. A rich collections of variance reduction features can greatly increase the efficiency of a calculation. MCNP is written in FORTRAN 77 and has been run on variety of computer systems from scientific workstations to supercomputers. The next production version of MCNP will include features such as continuous-energy electron transport and a multitasking option. Areas of ongoing research of interest to the well logging community include angle biasing, adaptive Monte Carlo, improved discrete ordinates capabilities, and discrete ordinates/Monte Carlo hybrid development. Los Alamos has requested approval by the Department of Energy to create a Radiation Transport Computational Facility under their User Facility Program to increase external interactions with industry, universities, and other government organizations. 21 refs.« less

Deterministic absorbed dose estimation in computed tomography using a discrete ordinates method

DOE Office of Scientific and Technical Information (OSTI.GOV)

Norris, Edward T.; Liu, Xin, E-mail: xinliu@mst.edu; Hsieh, Jiang

Purpose: Organ dose estimation for a patient undergoing computed tomography (CT) scanning is very important. Although Monte Carlo methods are considered gold-standard in patient dose estimation, the computation time required is formidable for routine clinical calculations. Here, the authors instigate a deterministic method for estimating an absorbed dose more efficiently. Methods: Compared with current Monte Carlo methods, a more efficient approach to estimating the absorbed dose is to solve the linear Boltzmann equation numerically. In this study, an axial CT scan was modeled with a software package, Denovo, which solved the linear Boltzmann equation using the discrete ordinates method. Themore » CT scanning configuration included 16 x-ray source positions, beam collimators, flat filters, and bowtie filters. The phantom was the standard 32 cm CT dose index (CTDI) phantom. Four different Denovo simulations were performed with different simulation parameters, including the number of quadrature sets and the order of Legendre polynomial expansions. A Monte Carlo simulation was also performed for benchmarking the Denovo simulations. A quantitative comparison was made of the simulation results obtained by the Denovo and the Monte Carlo methods. Results: The difference in the simulation results of the discrete ordinates method and those of the Monte Carlo methods was found to be small, with a root-mean-square difference of around 2.4%. It was found that the discrete ordinates method, with a higher order of Legendre polynomial expansions, underestimated the absorbed dose near the center of the phantom (i.e., low dose region). Simulations of the quadrature set 8 and the first order of the Legendre polynomial expansions proved to be the most efficient computation method in the authors’ study. The single-thread computation time of the deterministic simulation of the quadrature set 8 and the first order of the Legendre polynomial expansions was 21 min on a personal computer. Conclusions: The simulation results showed that the deterministic method can be effectively used to estimate the absorbed dose in a CTDI phantom. The accuracy of the discrete ordinates method was close to that of a Monte Carlo simulation, and the primary benefit of the discrete ordinates method lies in its rapid computation speed. It is expected that further optimization of this method in routine clinical CT dose estimation will improve its accuracy and speed.« less

Spectral collocation method with a flexible angular discretization scheme for radiative transfer in multi-layer graded index medium

NASA Astrophysics Data System (ADS)

Wei, Linyang; Qi, Hong; Sun, Jianping; Ren, Yatao; Ruan, Liming

2017-05-01

The spectral collocation method (SCM) is employed to solve the radiative transfer in multi-layer semitransparent medium with graded index. A new flexible angular discretization scheme is employed to discretize the solid angle domain freely to overcome the limit of the number of discrete radiative direction when adopting traditional SN discrete ordinate scheme. Three radial basis function interpolation approaches, named as multi-quadric (MQ), inverse multi-quadric (IMQ) and inverse quadratic (IQ) interpolation, are employed to couple the radiative intensity at the interface between two adjacent layers and numerical experiments show that MQ interpolation has the highest accuracy and best stability. Variable radiative transfer problems in double-layer semitransparent media with different thermophysical properties are investigated and the influence of these thermophysical properties on the radiative transfer procedure in double-layer semitransparent media is also analyzed. All the simulated results show that the present SCM with the new angular discretization scheme can predict the radiative transfer in multi-layer semitransparent medium with graded index efficiently and accurately.

Gamma-Weighted Discrete Ordinate Two-Stream Approximation for Computation of Domain Averaged Solar Irradiance

NASA Technical Reports Server (NTRS)

Kato, S.; Smith, G. L.; Barker, H. W.

2001-01-01

An algorithm is developed for the gamma-weighted discrete ordinate two-stream approximation that computes profiles of domain-averaged shortwave irradiances for horizontally inhomogeneous cloudy atmospheres. The algorithm assumes that frequency distributions of cloud optical depth at unresolved scales can be represented by a gamma distribution though it neglects net horizontal transport of radiation. This algorithm is an alternative to the one used in earlier studies that adopted the adding method. At present, only overcast cloudy layers are permitted.

Rarefied gas flow simulations using high-order gas-kinetic unified algorithms for Boltzmann model equations

NASA Astrophysics Data System (ADS)

Li, Zhi-Hui; Peng, Ao-Ping; Zhang, Han-Xin; Yang, Jaw-Yen

2015-04-01

This article reviews rarefied gas flow computations based on nonlinear model Boltzmann equations using deterministic high-order gas-kinetic unified algorithms (GKUA) in phase space. The nonlinear Boltzmann model equations considered include the BGK model, the Shakhov model, the Ellipsoidal Statistical model and the Morse model. Several high-order gas-kinetic unified algorithms, which combine the discrete velocity ordinate method in velocity space and the compact high-order finite-difference schemes in physical space, are developed. The parallel strategies implemented with the accompanying algorithms are of equal importance. Accurate computations of rarefied gas flow problems using various kinetic models over wide ranges of Mach numbers 1.2-20 and Knudsen numbers 0.0001-5 are reported. The effects of different high resolution schemes on the flow resolution under the same discrete velocity ordinate method are studied. A conservative discrete velocity ordinate method to ensure the kinetic compatibility condition is also implemented. The present algorithms are tested for the one-dimensional unsteady shock-tube problems with various Knudsen numbers, the steady normal shock wave structures for different Mach numbers, the two-dimensional flows past a circular cylinder and a NACA 0012 airfoil to verify the present methodology and to simulate gas transport phenomena covering various flow regimes. Illustrations of large scale parallel computations of three-dimensional hypersonic rarefied flows over the reusable sphere-cone satellite and the re-entry spacecraft using almost the largest computer systems available in China are also reported. The present computed results are compared with the theoretical prediction from gas dynamics, related DSMC results, slip N-S solutions and experimental data, and good agreement can be found. The numerical experience indicates that although the direct model Boltzmann equation solver in phase space can be computationally expensive, nevertheless, the present GKUAs for kinetic model Boltzmann equations in conjunction with current available high-performance parallel computer power can provide a vital engineering tool for analyzing rarefied gas flows covering the whole range of flow regimes in aerospace engineering applications.

High-order solution methods for grey discrete ordinates thermal radiative transfer

DOE Office of Scientific and Technical Information (OSTI.GOV)

Maginot, Peter G., E-mail: maginot1@llnl.gov; Ragusa, Jean C., E-mail: jean.ragusa@tamu.edu; Morel, Jim E., E-mail: morel@tamu.edu

This work presents a solution methodology for solving the grey radiative transfer equations that is both spatially and temporally more accurate than the canonical radiative transfer solution technique of linear discontinuous finite element discretization in space with implicit Euler integration in time. We solve the grey radiative transfer equations by fully converging the nonlinear temperature dependence of the material specific heat, material opacities, and Planck function. The grey radiative transfer equations are discretized in space using arbitrary-order self-lumping discontinuous finite elements and integrated in time with arbitrary-order diagonally implicit Runge–Kutta time integration techniques. Iterative convergence of the radiation equation ismore » accelerated using a modified interior penalty diffusion operator to precondition the full discrete ordinates transport operator.« less

High-order solution methods for grey discrete ordinates thermal radiative transfer

DOE Office of Scientific and Technical Information (OSTI.GOV)

Maginot, Peter G.; Ragusa, Jean C.; Morel, Jim E.

This paper presents a solution methodology for solving the grey radiative transfer equations that is both spatially and temporally more accurate than the canonical radiative transfer solution technique of linear discontinuous finite element discretization in space with implicit Euler integration in time. We solve the grey radiative transfer equations by fully converging the nonlinear temperature dependence of the material specific heat, material opacities, and Planck function. The grey radiative transfer equations are discretized in space using arbitrary-order self-lumping discontinuous finite elements and integrated in time with arbitrary-order diagonally implicit Runge–Kutta time integration techniques. Iterative convergence of the radiation equation ismore » accelerated using a modified interior penalty diffusion operator to precondition the full discrete ordinates transport operator.« less

High-order solution methods for grey discrete ordinates thermal radiative transfer

DOE PAGES

Maginot, Peter G.; Ragusa, Jean C.; Morel, Jim E.

2016-09-29

This paper presents a solution methodology for solving the grey radiative transfer equations that is both spatially and temporally more accurate than the canonical radiative transfer solution technique of linear discontinuous finite element discretization in space with implicit Euler integration in time. We solve the grey radiative transfer equations by fully converging the nonlinear temperature dependence of the material specific heat, material opacities, and Planck function. The grey radiative transfer equations are discretized in space using arbitrary-order self-lumping discontinuous finite elements and integrated in time with arbitrary-order diagonally implicit Runge–Kutta time integration techniques. Iterative convergence of the radiation equation ismore » accelerated using a modified interior penalty diffusion operator to precondition the full discrete ordinates transport operator.« less

Multitasking TORT under UNICOS: Parallel performance models and measurements

DOE Office of Scientific and Technical Information (OSTI.GOV)

Barnett, A.; Azmy, Y.Y.

1999-09-27

The existing parallel algorithms in the TORT discrete ordinates code were updated to function in a UNICOS environment. A performance model for the parallel overhead was derived for the existing algorithms. The largest contributors to the parallel overhead were identified and a new algorithm was developed. A parallel overhead model was also derived for the new algorithm. The results of the comparison of parallel performance models were compared to applications of the code to two TORT standard test problems and a large production problem. The parallel performance models agree well with the measured parallel overhead.

Multitasking TORT Under UNICOS: Parallel Performance Models and Measurements

DOE Office of Scientific and Technical Information (OSTI.GOV)

Azmy, Y.Y.; Barnett, D.A.

1999-09-27

The existing parallel algorithms in the TORT discrete ordinates were updated to function in a UNI-COS environment. A performance model for the parallel overhead was derived for the existing algorithms. The largest contributors to the parallel overhead were identified and a new algorithm was developed. A parallel overhead model was also derived for the new algorithm. The results of the comparison of parallel performance models were compared to applications of the code to two TORT standard test problems and a large production problem. The parallel performance models agree well with the measured parallel overhead.

A multi-layer discrete-ordinate method for vector radiative transfer in a vertically-inhomogeneous, emitting and scattering atmosphere. I - Theory. II - Application

NASA Technical Reports Server (NTRS)

Weng, Fuzhong

1992-01-01

A theory is developed for discretizing the vector integro-differential radiative transfer equation including both solar and thermal radiation. A complete solution and boundary equations are obtained using the discrete-ordinate method. An efficient numerical procedure is presented for calculating the phase matrix and achieving computational stability. With natural light used as a beam source, the Stokes parameters from the model proposed here are compared with the analytical solutions of Chandrasekhar (1960) for a Rayleigh scattering atmosphere. The model is then applied to microwave frequencies with a thermal source, and the brightness temperatures are compared with those from Stamnes'(1988) radiative transfer model.

Discrete Ordinate Quadrature Selection for Reactor-based Eigenvalue Problems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Jarrell, Joshua J; Evans, Thomas M; Davidson, Gregory G

2013-01-01

In this paper we analyze the effect of various quadrature sets on the eigenvalues of several reactor-based problems, including a two-dimensional (2D) fuel pin, a 2D lattice of fuel pins, and a three-dimensional (3D) reactor core problem. While many quadrature sets have been applied to neutral particle discrete ordinate transport calculations, the Level Symmetric (LS) and the Gauss-Chebyshev product (GC) sets are the most widely used in production-level reactor simulations. Other quadrature sets, such as Quadruple Range (QR) sets, have been shown to be more accurate in shielding applications. In this paper, we compare the LS, GC, QR, and themore » recently developed linear-discontinuous finite element (LDFE) sets, as well as give a brief overview of other proposed quadrature sets. We show that, for a given number of angles, the QR sets are more accurate than the LS and GC in all types of reactor problems analyzed (2D and 3D). We also show that the LDFE sets are more accurate than the LS and GC sets for these problems. We conclude that, for problems where tens to hundreds of quadrature points (directions) per octant are appropriate, QR sets should regularly be used because they have similar integration properties as the LS and GC sets, have no noticeable impact on the speed of convergence of the solution when compared with other quadrature sets, and yield more accurate results. We note that, for very high-order scattering problems, the QR sets exactly integrate fewer angular flux moments over the unit sphere than the GC sets. The effects of those inexact integrations have yet to be analyzed. We also note that the LDFE sets only exactly integrate the zeroth and first angular flux moments. Pin power comparisons and analyses are not included in this paper and are left for future work.« less

Discrete ordinate quadrature selection for reactor-based Eigenvalue problems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Jarrell, J. J.; Evans, T. M.; Davidson, G. G.

2013-07-01

In this paper we analyze the effect of various quadrature sets on the eigenvalues of several reactor-based problems, including a two-dimensional (2D) fuel pin, a 2D lattice of fuel pins, and a three-dimensional (3D) reactor core problem. While many quadrature sets have been applied to neutral particle discrete ordinate transport calculations, the Level Symmetric (LS) and the Gauss-Chebyshev product (GC) sets are the most widely used in production-level reactor simulations. Other quadrature sets, such as Quadruple Range (QR) sets, have been shown to be more accurate in shielding applications. In this paper, we compare the LS, GC, QR, and themore » recently developed linear-discontinuous finite element (LDFE) sets, as well as give a brief overview of other proposed quadrature sets. We show that, for a given number of angles, the QR sets are more accurate than the LS and GC in all types of reactor problems analyzed (2D and 3D). We also show that the LDFE sets are more accurate than the LS and GC sets for these problems. We conclude that, for problems where tens to hundreds of quadrature points (directions) per octant are appropriate, QR sets should regularly be used because they have similar integration properties as the LS and GC sets, have no noticeable impact on the speed of convergence of the solution when compared with other quadrature sets, and yield more accurate results. We note that, for very high-order scattering problems, the QR sets exactly integrate fewer angular flux moments over the unit sphere than the GC sets. The effects of those inexact integrations have yet to be analyzed. We also note that the LDFE sets only exactly integrate the zeroth and first angular flux moments. Pin power comparisons and analyses are not included in this paper and are left for future work. (authors)« less

Ordinal preference elicitation methods in health economics and health services research: using discrete choice experiments and ranking methods.

PubMed

Ali, Shehzad; Ronaldson, Sarah

2012-09-01

The predominant method of economic evaluation is cost-utility analysis, which uses cardinal preference elicitation methods, including the standard gamble and time trade-off. However, such approach is not suitable for understanding trade-offs between process attributes, non-health outcomes and health outcomes to evaluate current practices, develop new programmes and predict demand for services and products. Ordinal preference elicitation methods including discrete choice experiments and ranking methods are therefore commonly used in health economics and health service research. Cardinal methods have been criticized on the grounds of cognitive complexity, difficulty of administration, contamination by risk and preference attitudes, and potential violation of underlying assumptions. Ordinal methods have gained popularity because of reduced cognitive burden, lower degree of abstract reasoning, reduced measurement error, ease of administration and ability to use both health and non-health outcomes. The underlying assumptions of ordinal methods may be violated when respondents use cognitive shortcuts, or cannot comprehend the ordinal task or interpret attributes and levels, or use 'irrational' choice behaviour or refuse to trade-off certain attributes. CURRENT USE AND GROWING AREAS: Ordinal methods are commonly used to evaluate preference for attributes of health services, products, practices, interventions, policies and, more recently, to estimate utility weights. AREAS FOR ON-GOING RESEARCH: There is growing research on developing optimal designs, evaluating the rationalization process, using qualitative tools for developing ordinal methods, evaluating consistency with utility theory, appropriate statistical methods for analysis, generalizability of results and comparing ordinal methods against each other and with cardinal measures.

Radiative heat transfer in strongly forward scattering media using the discrete ordinates method

NASA Astrophysics Data System (ADS)

Granate, Pedro; Coelho, Pedro J.; Roger, Maxime

2016-03-01

The discrete ordinates method (DOM) is widely used to solve the radiative transfer equation, often yielding satisfactory results. However, in the presence of strongly forward scattering media, this method does not generally conserve the scattering energy and the phase function asymmetry factor. Because of this, the normalization of the phase function has been proposed to guarantee that the scattering energy and the asymmetry factor are conserved. Various authors have used different normalization techniques. Three of these are compared in the present work, along with two other methods, one based on the finite volume method (FVM) and another one based on the spherical harmonics discrete ordinates method (SHDOM). In addition, the approximation of the Henyey-Greenstein phase function by a different one is investigated as an alternative to the phase function normalization. The approximate phase function is given by the sum of a Dirac delta function, which accounts for the forward scattering peak, and a smoother scaled phase function. In this study, these techniques are applied to three scalar radiative transfer test cases, namely a three-dimensional cubic domain with a purely scattering medium, an axisymmetric cylindrical enclosure containing an emitting-absorbing-scattering medium, and a three-dimensional transient problem with collimated irradiation. The present results show that accurate predictions are achieved for strongly forward scattering media when the phase function is normalized in such a way that both the scattered energy and the phase function asymmetry factor are conserved. The normalization of the phase function may be avoided using the FVM or the SHDOM to evaluate the in-scattering term of the radiative transfer equation. Both methods yield results whose accuracy is similar to that obtained using the DOM along with normalization of the phase function. Very satisfactory predictions were also achieved using the delta-M phase function, while the delta-Eddington phase function and the transport approximation may perform poorly.

Hybrid discrete ordinates and characteristics method for solving the linear Boltzmann equation

NASA Astrophysics Data System (ADS)

Yi, Ce

With the ability of computer hardware and software increasing rapidly, deterministic methods to solve the linear Boltzmann equation (LBE) have attracted some attention for computational applications in both the nuclear engineering and medical physics fields. Among various deterministic methods, the discrete ordinates method (SN) and the method of characteristics (MOC) are two of the most widely used methods. The SN method is the traditional approach to solve the LBE for its stability and efficiency. While the MOC has some advantages in treating complicated geometries. However, in 3-D problems requiring a dense discretization grid in phase space (i.e., a large number of spatial meshes, directions, or energy groups), both methods could suffer from the need for large amounts of memory and computation time. In our study, we developed a new hybrid algorithm by combing the two methods into one code, TITAN. The hybrid approach is specifically designed for application to problems containing low scattering regions. A new serial 3-D time-independent transport code has been developed. Under the hybrid approach, the preferred method can be applied in different regions (blocks) within the same problem model. Since the characteristics method is numerically more efficient in low scattering media, the hybrid approach uses a block-oriented characteristics solver in low scattering regions, and a block-oriented SN solver in the remainder of the physical model. In the TITAN code, a physical problem model is divided into a number of coarse meshes (blocks) in Cartesian geometry. Either the characteristics solver or the SN solver can be chosen to solve the LBE within a coarse mesh. A coarse mesh can be filled with fine meshes or characteristic rays depending on the solver assigned to the coarse mesh. Furthermore, with its object-oriented programming paradigm and layered code structure, TITAN allows different individual spatial meshing schemes and angular quadrature sets for each coarse mesh. Two quadrature types (level-symmetric and Legendre-Chebyshev quadrature) along with the ordinate splitting techniques (rectangular splitting and PN-TN splitting) are implemented. In the S N solver, we apply a memory-efficient 'front-line' style paradigm to handle the fine mesh interface fluxes. In the characteristics solver, we have developed a novel 'backward' ray-tracing approach, in which a bi-linear interpolation procedure is used on the incoming boundaries of a coarse mesh. A CPU-efficient scattering kernel is shared in both solvers within the source iteration scheme. Angular and spatial projection techniques are developed to transfer the angular fluxes on the interfaces of coarse meshes with different discretization grids. The performance of the hybrid algorithm is tested in a number of benchmark problems in both nuclear engineering and medical physics fields. Among them are the Kobayashi benchmark problems and a computational tomography (CT) device model. We also developed an extra sweep procedure with the fictitious quadrature technique to calculate angular fluxes along directions of interest. The technique is applied in a single photon emission computed tomography (SPECT) phantom model to simulate the SPECT projection images. The accuracy and efficiency of the TITAN code are demonstrated in these benchmarks along with its scalability. A modified version of the characteristics solver is integrated in the PENTRAN code and tested within the parallel engine of PENTRAN. The limitations on the hybrid algorithm are also studied.

Modifications Of Discrete Ordinate Method For Computations With High Scattering Anisotropy: Comparative Analysis

NASA Technical Reports Server (NTRS)

Korkin, Sergey V.; Lyapustin, Alexei I.; Rozanov, Vladimir V.

2012-01-01

A numerical accuracy analysis of the radiative transfer equation (RTE) solution based on separation of the diffuse light field into anisotropic and smooth parts is presented. The analysis uses three different algorithms based on the discrete ordinate method (DOM). Two methods, DOMAS and DOM2+, that do not use the truncation of the phase function, are compared against the TMS-method. DOMAS and DOM2+ use the Small-Angle Modification of RTE and the single scattering term, respectively, as an anisotropic part. The TMS method uses Delta-M method for truncation of the phase function along with the single scattering correction. For reference, a standard discrete ordinate method, DOM, is also included in analysis. The obtained results for cases with high scattering anisotropy show that at low number of streams (16, 32) only DOMAS provides an accurate solution in the aureole area. Outside of the aureole, the convergence and accuracy of DOMAS, and TMS is found to be approximately similar: DOMAS was found more accurate in cases with coarse aerosol and liquid water cloud models, except low optical depth, while the TMS showed better results in case of ice cloud.

Fast and Accurate Hybrid Stream PCRTMSOLAR Radiative Transfer Model for Reflected Solar Spectrum Simulation in the Cloudy Atmosphere

NASA Technical Reports Server (NTRS)

Yang, Qiguang; Liu, Xu; Wu, Wan; Kizer, Susan; Baize, Rosemary R.

2016-01-01

A hybrid stream PCRTM-SOLAR model has been proposed for fast and accurate radiative transfer simulation. It calculates the reflected solar (RS) radiances with a fast coarse way and then, with the help of a pre-saved matrix, transforms the results to obtain the desired high accurate RS spectrum. The methodology has been demonstrated with the hybrid stream discrete ordinate (HSDO) radiative transfer (RT) model. The HSDO method calculates the monochromatic radiances using a 4-stream discrete ordinate method, where only a small number of monochromatic radiances are simulated with both 4-stream and a larger N-stream (N = 16) discrete ordinate RT algorithm. The accuracy of the obtained channel radiance is comparable to the result from N-stream moderate resolution atmospheric transmission version 5 (MODTRAN5). The root-mean-square errors are usually less than 5x10(exp -4) mW/sq cm/sr/cm. The computational speed is three to four-orders of magnitude faster than the medium speed correlated-k option MODTRAN5. This method is very efficient to simulate thousands of RS spectra under multi-layer clouds/aerosols and solar radiation conditions for climate change study and numerical weather prediction applications.

GPU accelerated simulations of 3D deterministic particle transport using discrete ordinates method

NASA Astrophysics Data System (ADS)

Gong, Chunye; Liu, Jie; Chi, Lihua; Huang, Haowei; Fang, Jingyue; Gong, Zhenghu

2011-07-01

Graphics Processing Unit (GPU), originally developed for real-time, high-definition 3D graphics in computer games, now provides great faculty in solving scientific applications. The basis of particle transport simulation is the time-dependent, multi-group, inhomogeneous Boltzmann transport equation. The numerical solution to the Boltzmann equation involves the discrete ordinates ( Sn) method and the procedure of source iteration. In this paper, we present a GPU accelerated simulation of one energy group time-independent deterministic discrete ordinates particle transport in 3D Cartesian geometry (Sweep3D). The performance of the GPU simulations are reported with the simulations of vacuum boundary condition. The discussion of the relative advantages and disadvantages of the GPU implementation, the simulation on multi GPUs, the programming effort and code portability are also reported. The results show that the overall performance speedup of one NVIDIA Tesla M2050 GPU ranges from 2.56 compared with one Intel Xeon X5670 chip to 8.14 compared with one Intel Core Q6600 chip for no flux fixup. The simulation with flux fixup on one M2050 is 1.23 times faster than on one X5670.

Functional data analysis: An approach for environmental ordination and matching discrete with continuous observations

EPA Science Inventory

Investigators are frequently confronted with data sets that include both discrete observations and extended time series of environmental data that had been collected by autonomous recorders. Evaluating the relationships between these two kinds of data is challenging. A common a...

Verification of Three Dimensional Triangular Prismatic Discrete Ordinates Transport Code ENSEMBLE-TRIZ by Comparison with Monte Carlo Code GMVP

NASA Astrophysics Data System (ADS)

Homma, Yuto; Moriwaki, Hiroyuki; Ohki, Shigeo; Ikeda, Kazumi

2014-06-01

This paper deals with verification of three dimensional triangular prismatic discrete ordinates transport calculation code ENSEMBLE-TRIZ by comparison with multi-group Monte Carlo calculation code GMVP in a large fast breeder reactor. The reactor is a 750 MWe electric power sodium cooled reactor. Nuclear characteristics are calculated at beginning of cycle of an initial core and at beginning and end of cycle of equilibrium core. According to the calculations, the differences between the two methodologies are smaller than 0.0002 Δk in the multi-plication factor, relatively about 1% in the control rod reactivity, and 1% in the sodium void reactivity.

PRIM versus CART in subgroup discovery: when patience is harmful.

PubMed

Abu-Hanna, Ameen; Nannings, Barry; Dongelmans, Dave; Hasman, Arie

2010-10-01

We systematically compare the established algorithms CART (Classification and Regression Trees) and PRIM (Patient Rule Induction Method) in a subgroup discovery task on a large real-world high-dimensional clinical database. Contrary to current conjectures, PRIM's performance was generally inferior to CART's. PRIM often considered "peeling of" a large chunk of data at a value of a relevant discrete ordinal variable unattractive, ultimately missing an important subgroup. This finding has considerable significance in clinical medicine where ordinal scores are ubiquitous. PRIM's utility in clinical databases would increase when global information about (ordinal) variables is better put to use and when the search algorithm keeps track of alternative solutions.

Graphical Models for Ordinal Data

PubMed Central

Guo, Jian; Levina, Elizaveta; Michailidis, George; Zhu, Ji

2014-01-01

A graphical model for ordinal variables is considered, where it is assumed that the data are generated by discretizing the marginal distributions of a latent multivariate Gaussian distribution. The relationships between these ordinal variables are then described by the underlying Gaussian graphical model and can be inferred by estimating the corresponding concentration matrix. Direct estimation of the model is computationally expensive, but an approximate EM-like algorithm is developed to provide an accurate estimate of the parameters at a fraction of the computational cost. Numerical evidence based on simulation studies shows the strong performance of the algorithm, which is also illustrated on data sets on movie ratings and an educational survey. PMID:26120267

A review of the matrix-exponential formalism in radiative transfer

NASA Astrophysics Data System (ADS)

Efremenko, Dmitry S.; Molina García, Víctor; Gimeno García, Sebastián; Doicu, Adrian

2017-07-01

This paper outlines the matrix exponential description of radiative transfer. The eigendecomposition method which serves as a basis for computing the matrix exponential and for representing the solution in a discrete ordinate setting is considered. The mathematical equivalence of the discrete ordinate method, the matrix operator method, and the matrix Riccati equations method is proved rigorously by means of the matrix exponential formalism. For optically thin layers, approximate solution methods relying on the Padé and Taylor series approximations to the matrix exponential, as well as on the matrix Riccati equations, are presented. For optically thick layers, the asymptotic theory with higher-order corrections is derived, and parameterizations of the asymptotic functions and constants for a water-cloud model with a Gamma size distribution are obtained.

Unified implicit kinetic scheme for steady multiscale heat transfer based on the phonon Boltzmann transport equation

NASA Astrophysics Data System (ADS)

Zhang, Chuang; Guo, Zhaoli; Chen, Songze

2017-12-01

An implicit kinetic scheme is proposed to solve the stationary phonon Boltzmann transport equation (BTE) for multiscale heat transfer problem. Compared to the conventional discrete ordinate method, the present method employs a macroscopic equation to accelerate the convergence in the diffusive regime. The macroscopic equation can be taken as a moment equation for phonon BTE. The heat flux in the macroscopic equation is evaluated from the nonequilibrium distribution function in the BTE, while the equilibrium state in BTE is determined by the macroscopic equation. These two processes exchange information from different scales, such that the method is applicable to the problems with a wide range of Knudsen numbers. Implicit discretization is implemented to solve both the macroscopic equation and the BTE. In addition, a memory reduction technique, which is originally developed for the stationary kinetic equation, is also extended to phonon BTE. Numerical comparisons show that the present scheme can predict reasonable results both in ballistic and diffusive regimes with high efficiency, while the memory requirement is on the same order as solving the Fourier law of heat conduction. The excellent agreement with benchmark and the rapid converging history prove that the proposed macro-micro coupling is a feasible solution to multiscale heat transfer problems.

Population Fisher information matrix and optimal design of discrete data responses in population pharmacodynamic experiments.

PubMed

Ogungbenro, Kayode; Aarons, Leon

2011-08-01

In the recent years, interest in the application of experimental design theory to population pharmacokinetic (PK) and pharmacodynamic (PD) experiments has increased. The aim is to improve the efficiency and the precision with which parameters are estimated during data analysis and sometimes to increase the power and reduce the sample size required for hypothesis testing. The population Fisher information matrix (PFIM) has been described for uniresponse and multiresponse population PK experiments for design evaluation and optimisation. Despite these developments and availability of tools for optimal design of population PK and PD experiments much of the effort has been focused on repeated continuous variable measurements with less work being done on repeated discrete type measurements. Discrete data arise mainly in PDs e.g. ordinal, nominal, dichotomous or count measurements. This paper implements expressions for the PFIM for repeated ordinal, dichotomous and count measurements based on analysis by a mixed-effects modelling technique. Three simulation studies were used to investigate the performance of the expressions. Example 1 is based on repeated dichotomous measurements, Example 2 is based on repeated count measurements and Example 3 is based on repeated ordinal measurements. Data simulated in MATLAB were analysed using NONMEM (Laplace method) and the glmmML package in R (Laplace and adaptive Gauss-Hermite quadrature methods). The results obtained for Examples 1 and 2 showed good agreement between the relative standard errors obtained using the PFIM and simulations. The results obtained for Example 3 showed the importance of sampling at the most informative time points. Implementation of these expressions will provide the opportunity for efficient design of population PD experiments that involve discrete type data through design evaluation and optimisation.

Parallel deterministic transport sweeps of structured and unstructured meshes with overloaded mesh decompositions

DOE Office of Scientific and Technical Information (OSTI.GOV)

Pautz, Shawn D.; Bailey, Teresa S.

Here, the efficiency of discrete ordinates transport sweeps depends on the scheduling algorithm, the domain decomposition, the problem to be solved, and the computational platform. Sweep scheduling algorithms may be categorized by their approach to several issues. In this paper we examine the strategy of domain overloading for mesh partitioning as one of the components of such algorithms. In particular, we extend the domain overloading strategy, previously defined and analyzed for structured meshes, to the general case of unstructured meshes. We also present computational results for both the structured and unstructured domain overloading cases. We find that an appropriate amountmore » of domain overloading can greatly improve the efficiency of parallel sweeps for both structured and unstructured partitionings of the test problems examined on up to 10 5 processor cores.« less

Parallel deterministic transport sweeps of structured and unstructured meshes with overloaded mesh decompositions

DOE PAGES

Pautz, Shawn D.; Bailey, Teresa S.

2016-11-29

Here, the efficiency of discrete ordinates transport sweeps depends on the scheduling algorithm, the domain decomposition, the problem to be solved, and the computational platform. Sweep scheduling algorithms may be categorized by their approach to several issues. In this paper we examine the strategy of domain overloading for mesh partitioning as one of the components of such algorithms. In particular, we extend the domain overloading strategy, previously defined and analyzed for structured meshes, to the general case of unstructured meshes. We also present computational results for both the structured and unstructured domain overloading cases. We find that an appropriate amountmore » of domain overloading can greatly improve the efficiency of parallel sweeps for both structured and unstructured partitionings of the test problems examined on up to 10 5 processor cores.« less

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zardecki, A.

The effect of multiple scattering on the validity of the Beer-Lambert law is discussed for a wide range of particle-size parameters and optical depths. To predict the amount of received radiant power, appropriate correction terms are introduced. For particles larger than or comparable to the wavelength of radiation, the small-angle approximation is adequate; whereas for small densely packed particles, the diffusion theory is advantageously employed. These two approaches are used in the context of the problem of laser-beam propagation in a dense aerosol medium. In addition, preliminary results obtained by using a two-dimensional finite-element discrete-ordinates transport code are described. Multiple-scatteringmore » effects for laser propagation in fog, cloud, rain, and aerosol cloud are modeled.« less

Quadratic Finite Element Method for 1D Deterministic Transport

DOE Office of Scientific and Technical Information (OSTI.GOV)

Tolar, Jr., D R; Ferguson, J M

2004-01-06

In the discrete ordinates, or SN, numerical solution of the transport equation, both the spatial ({und r}) and angular ({und {Omega}}) dependences on the angular flux {psi}{und r},{und {Omega}}are modeled discretely. While significant effort has been devoted toward improving the spatial discretization of the angular flux, we focus on improving the angular discretization of {psi}{und r},{und {Omega}}. Specifically, we employ a Petrov-Galerkin quadratic finite element approximation for the differencing of the angular variable ({mu}) in developing the one-dimensional (1D) spherical geometry S{sub N} equations. We develop an algorithm that shows faster convergence with angular resolution than conventional S{sub N} algorithms.

Regenerating time series from ordinal networks.

PubMed

McCullough, Michael; Sakellariou, Konstantinos; Stemler, Thomas; Small, Michael

2017-03-01

Recently proposed ordinal networks not only afford novel methods of nonlinear time series analysis but also constitute stochastic approximations of the deterministic flow time series from which the network models are constructed. In this paper, we construct ordinal networks from discrete sampled continuous chaotic time series and then regenerate new time series by taking random walks on the ordinal network. We then investigate the extent to which the dynamics of the original time series are encoded in the ordinal networks and retained through the process of regenerating new time series by using several distinct quantitative approaches. First, we use recurrence quantification analysis on traditional recurrence plots and order recurrence plots to compare the temporal structure of the original time series with random walk surrogate time series. Second, we estimate the largest Lyapunov exponent from the original time series and investigate the extent to which this invariant measure can be estimated from the surrogate time series. Finally, estimates of correlation dimension are computed to compare the topological properties of the original and surrogate time series dynamics. Our findings show that ordinal networks constructed from univariate time series data constitute stochastic models which approximate important dynamical properties of the original systems.

Regenerating time series from ordinal networks

NASA Astrophysics Data System (ADS)

McCullough, Michael; Sakellariou, Konstantinos; Stemler, Thomas; Small, Michael

2017-03-01

Recently proposed ordinal networks not only afford novel methods of nonlinear time series analysis but also constitute stochastic approximations of the deterministic flow time series from which the network models are constructed. In this paper, we construct ordinal networks from discrete sampled continuous chaotic time series and then regenerate new time series by taking random walks on the ordinal network. We then investigate the extent to which the dynamics of the original time series are encoded in the ordinal networks and retained through the process of regenerating new time series by using several distinct quantitative approaches. First, we use recurrence quantification analysis on traditional recurrence plots and order recurrence plots to compare the temporal structure of the original time series with random walk surrogate time series. Second, we estimate the largest Lyapunov exponent from the original time series and investigate the extent to which this invariant measure can be estimated from the surrogate time series. Finally, estimates of correlation dimension are computed to compare the topological properties of the original and surrogate time series dynamics. Our findings show that ordinal networks constructed from univariate time series data constitute stochastic models which approximate important dynamical properties of the original systems.

Radiative transfer equation accounting for rotational Raman scattering and its solution by the discrete-ordinates method

NASA Astrophysics Data System (ADS)

Rozanov, Vladimir V.; Vountas, Marco

2014-01-01

Rotational Raman scattering of solar light in Earth's atmosphere leads to the filling-in of Fraunhofer and telluric lines observed in the reflected spectrum. The phenomenological derivation of the inelastic radiative transfer equation including rotational Raman scattering is presented. The different forms of the approximate radiative transfer equation with first-order rotational Raman scattering terms are obtained employing the Cabannes, Rayleigh, and Cabannes-Rayleigh scattering models. The solution of these equations is considered in the framework of the discrete-ordinates method using rigorous and approximate approaches to derive particular integrals. An alternative forward-adjoint technique is suggested as well. A detailed description of the model including the exact spectral matching and a binning scheme that significantly speeds up the calculations is given. The considered solution techniques are implemented in the radiative transfer software package SCIATRAN and a specified benchmark setup is presented to enable readers to compare with own results transparently.

Radiative transfer models for retrieval of cloud parameters from EPIC/DSCOVR measurements

NASA Astrophysics Data System (ADS)

Molina García, Víctor; Sasi, Sruthy; Efremenko, Dmitry S.; Doicu, Adrian; Loyola, Diego

2018-07-01

In this paper we analyze the accuracy and efficiency of several radiative transfer models for inferring cloud parameters from radiances measured by the Earth Polychromatic Imaging Camera (EPIC) on board the Deep Space Climate Observatory (DSCOVR). The radiative transfer models are the exact discrete ordinate and matrix operator methods with matrix exponential, and the approximate asymptotic and equivalent Lambertian cloud models. To deal with the computationally expensive radiative transfer calculations, several acceleration techniques such as, for example, the telescoping technique, the method of false discrete ordinate, the correlated k-distribution method and the principal component analysis (PCA) are used. We found that, for the EPIC oxygen A-band absorption channel at 764 nm, the exact models using the correlated k-distribution in conjunction with PCA yield an accuracy better than 1.5% and a computation time of 18 s for radiance calculations at 5 viewing zenith angles.

Some Remarks on GMRES for Transport Theory

NASA Technical Reports Server (NTRS)

Patton, Bruce W.; Holloway, James Paul

2003-01-01

We review some work on the application of GMRES to the solution of the discrete ordinates transport equation in one-dimension. We note that GMRES can be applied directly to the angular flux vector, or it can be applied to only a vector of flux moments as needed to compute the scattering operator of the transport equation. In the former case we illustrate both the delights and defects of ILU right-preconditioners for problems with anisotropic scatter and for problems with upscatter. When working with flux moments we note that GMRES can be used as an accelerator for any existing transport code whose solver is based on a stationary fixed-point iteration, including transport sweeps and DSA transport sweeps. We also provide some numerical illustrations of this idea. We finally show how space can be traded for speed by taking multiple transport sweeps per GMRES iteration. Key Words: transport equation, GMRES, Krylov subspace

An approach to solve group-decision-making problems with ordinal interval numbers.

PubMed

Fan, Zhi-Ping; Liu, Yang

2010-10-01

The ordinal interval number is a form of uncertain preference information in group decision making (GDM), while it is seldom discussed in the existing research. This paper investigates how the ranking order of alternatives is determined based on preference information of ordinal interval numbers in GDM problems. When ranking a large quantity of ordinal interval numbers, the efficiency and accuracy of the ranking process are critical. A new approach is proposed to rank alternatives using ordinal interval numbers when every ranking ordinal in an ordinal interval number is thought to be uniformly and independently distributed in its interval. First, we give the definition of possibility degree on comparing two ordinal interval numbers and the related theory analysis. Then, to rank alternatives, by comparing multiple ordinal interval numbers, a collective expectation possibility degree matrix on pairwise comparisons of alternatives is built, and an optimization model based on this matrix is constructed. Furthermore, an algorithm is also presented to rank alternatives by solving the model. Finally, two examples are used to illustrate the use of the proposed approach.

Graphical aids for visualizing and interpreting patterns in departures from agreement in ordinal categorical observer agreement data.

PubMed

Bangdiwala, Shrikant I

2017-01-01

When studying the agreement between two observers rating the same n units into the same k discrete ordinal categories, Bangdiwala (1985) proposed using the "agreement chart" to visually assess agreement. This article proposes that often it is more interesting to focus on the patterns of disagreement and visually understanding the departures from perfect agreement. The article reviews the use of graphical techniques for descriptively assessing agreement and disagreements, and also reviews some of the available summary statistics that quantify such relationships.

Multilevel acceleration of scattering-source iterations with application to electron transport

DOE PAGES

Drumm, Clif; Fan, Wesley

2017-08-18

Acceleration/preconditioning strategies available in the SCEPTRE radiation transport code are described. A flexible transport synthetic acceleration (TSA) algorithm that uses a low-order discrete-ordinates (S N) or spherical-harmonics (P N) solve to accelerate convergence of a high-order S N source-iteration (SI) solve is described. Convergence of the low-order solves can be further accelerated by applying off-the-shelf incomplete-factorization or algebraic-multigrid methods. Also available is an algorithm that uses a generalized minimum residual (GMRES) iterative method rather than SI for convergence, using a parallel sweep-based solver to build up a Krylov subspace. TSA has been applied as a preconditioner to accelerate the convergencemore » of the GMRES iterations. The methods are applied to several problems involving electron transport and problems with artificial cross sections with large scattering ratios. These methods were compared and evaluated by considering material discontinuities and scattering anisotropy. Observed accelerations obtained are highly problem dependent, but speedup factors around 10 have been observed in typical applications.« less

Newsracks and the First Amendment.

ERIC Educational Resources Information Center

Stevens, George E.

1989-01-01

Discusses court cases dealing with whether a community may ban newsracks, how much discretion city officials may exercise in regulating vending machines, and what limitations in display and placement are reasonable. Finds that acceptable city ordinances are narrow and content neutral. (RS)

Numerical Model of Multiple Scattering and Emission from Layering Snowpack for Microwave Remote Sensing

NASA Astrophysics Data System (ADS)

Jin, Y.; Liang, Z.

2002-12-01

The vector radiative transfer (VRT) equation is an integral-deferential equation to describe multiple scattering, absorption and transmission of four Stokes parameters in random scatter media. From the integral formal solution of VRT equation, the lower order solutions, such as the first-order scattering for a layer medium or the second order scattering for a half space, can be obtained. The lower order solutions are usually good at low frequency when high-order scattering is negligible. It won't be feasible to continue iteration for obtaining high order scattering solution because too many folds integration would be involved. In the space-borne microwave remote sensing, for example, the DMSP (Defense Meterological Satellite Program) SSM/I (Special Sensor Microwave/Imager) employed seven channels of 19, 22, 37 and 85GHz. Multiple scattering from the terrain surfaces such as snowpack cannot be neglected at these channels. The discrete ordinate and eigen-analysis method has been studied to take into account for multiple scattering and applied to remote sensing of atmospheric precipitation, snowpack etc. Snowpack was modeled as a layer of dense spherical particles, and the VRT for a layer of uniformly dense spherical particles has been numerically studied by the discrete ordinate method. However, due to surface melting and refrozen crusts, the snowpack undergoes stratifying to form inhomegeneous profiles of the ice grain size, fractional volume and physical temperature etc. It becomes necessary to study multiple scattering and emission from stratified snowpack of dense ice grains. But, the discrete ordinate and eigen-analysis method cannot be simply applied to multi-layers model, because numerically solving a set of multi-equations of VRT is difficult. Stratifying the inhomogeneous media into multi-slabs and employing the first order Mueller matrix of each thin slab, this paper developed an iterative method to derive high orders scattering solutions of whole scatter media. High order scattering and emission from inhomogeneous stratifying media of dense spherical particles are numerically obtained. The brightness temperature at low frequency such as 5.3 GHz without high order scattering and at SSM/I channels with high order scattering are obtained. This approach is also compared with the conventional discrete ordinate method for an uniform layer model. Numerical simulation for inhomogeneous snowpack is also compared with the measurements of microwave remote sensing.

TH-AB-BRA-09: Stability Analysis of a Novel Dose Calculation Algorithm for MRI Guided Radiotherapy

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zelyak, O; Fallone, B; Cross Cancer Institute, Edmonton, AB

2016-06-15

Purpose: To determine the iterative deterministic solution stability of the Linear Boltzmann Transport Equation (LBTE) in the presence of magnetic fields. Methods: The LBTE with magnetic fields under investigation is derived using a discrete ordinates approach. The stability analysis is performed using analytical and numerical methods. Analytically, the spectral Fourier analysis is used to obtain the convergence rate of the source iteration procedures based on finding the largest eigenvalue of the iterative operator. This eigenvalue is a function of relevant physical parameters, such as magnetic field strength and material properties, and provides essential information about the domain of applicability requiredmore » for clinically optimal parameter selection and maximum speed of convergence. The analytical results are reinforced by numerical simulations performed using the same discrete ordinates method in angle, and a discontinuous finite element spatial approach. Results: The spectral radius for the source iteration technique of the time independent transport equation with isotropic and anisotropic scattering centers inside infinite 3D medium is equal to the ratio of differential and total cross sections. The result is confirmed numerically by solving LBTE and is in full agreement with previously published results. The addition of magnetic field reveals that the convergence becomes dependent on the strength of magnetic field, the energy group discretization, and the order of anisotropic expansion. Conclusion: The source iteration technique for solving the LBTE with magnetic fields with the discrete ordinates method leads to divergent solutions in the limiting cases of small energy discretizations and high magnetic field strengths. Future investigations into non-stationary Krylov subspace techniques as an iterative solver will be performed as this has been shown to produce greater stability than source iteration. Furthermore, a stability analysis of a discontinuous finite element space-angle approach (which has been shown to provide the greatest stability) will also be investigated. Dr. B Gino Fallone is a co-founder and CEO of MagnetTx Oncology Solutions (under discussions to license Alberta bi-planar linac MR for commercialization)« less

Applying Multivariate Discrete Distributions to Genetically Informative Count Data.

PubMed

Kirkpatrick, Robert M; Neale, Michael C

2016-03-01

We present a novel method of conducting biometric analysis of twin data when the phenotypes are integer-valued counts, which often show an L-shaped distribution. Monte Carlo simulation is used to compare five likelihood-based approaches to modeling: our multivariate discrete method, when its distributional assumptions are correct, when they are incorrect, and three other methods in common use. With data simulated from a skewed discrete distribution, recovery of twin correlations and proportions of additive genetic and common environment variance was generally poor for the Normal, Lognormal and Ordinal models, but good for the two discrete models. Sex-separate applications to substance-use data from twins in the Minnesota Twin Family Study showed superior performance of two discrete models. The new methods are implemented using R and OpenMx and are freely available.

On the use of flux limiters in the discrete ordinates method for 3D radiation calculations in absorbing and scattering media

NASA Astrophysics Data System (ADS)

Godoy, William F.; DesJardin, Paul E.

2010-05-01

The application of flux limiters to the discrete ordinates method (DOM), SN, for radiative transfer calculations is discussed and analyzed for 3D enclosures for cases in which the intensities are strongly coupled to each other such as: radiative equilibrium and scattering media. A Newton-Krylov iterative method (GMRES) solves the final systems of linear equations along with a domain decomposition strategy for parallel computation using message passing libraries in a distributed memory system. Ray effects due to angular discretization and errors due to domain decomposition are minimized until small variations are introduced by these effects in order to focus on the influence of flux limiters on errors due to spatial discretization, known as numerical diffusion, smearing or false scattering. Results are presented for the DOM-integrated quantities such as heat flux, irradiation and emission. A variety of flux limiters are compared to "exact" solutions available in the literature, such as the integral solution of the RTE for pure absorbing-emitting media and isotropic scattering cases and a Monte Carlo solution for a forward scattering case. Additionally, a non-homogeneous 3D enclosure is included to extend the use of flux limiters to more practical cases. The overall balance of convergence, accuracy, speed and stability using flux limiters is shown to be superior compared to step schemes for any test case.

An efficient direct solver for rarefied gas flows with arbitrary statistics

DOE Office of Scientific and Technical Information (OSTI.GOV)

Diaz, Manuel A., E-mail: f99543083@ntu.edu.tw; Yang, Jaw-Yen, E-mail: yangjy@iam.ntu.edu.tw; Center of Advanced Study in Theoretical Science, National Taiwan University, Taipei 10167, Taiwan

2016-01-15

A new numerical methodology associated with a unified treatment is presented to solve the Boltzmann–BGK equation of gas dynamics for the classical and quantum gases described by the Bose–Einstein and Fermi–Dirac statistics. Utilizing a class of globally-stiffly-accurate implicit–explicit Runge–Kutta scheme for the temporal evolution, associated with the discrete ordinate method for the quadratures in the momentum space and the weighted essentially non-oscillatory method for the spatial discretization, the proposed scheme is asymptotic-preserving and imposes no non-linear solver or requires the knowledge of fugacity and temperature to capture the flow structures in the hydrodynamic (Euler) limit. The proposed treatment overcomes themore » limitations found in the work by Yang and Muljadi (2011) [33] due to the non-linear nature of quantum relations, and can be applied in studying the dynamics of a gas with internal degrees of freedom with correct values of the ratio of specific heat for the flow regimes for all Knudsen numbers and energy wave lengths. The present methodology is numerically validated with the unified treatment by the one-dimensional shock tube problem and the two-dimensional Riemann problems for gases of arbitrary statistics. Descriptions of ideal quantum gases including rotational degrees of freedom have been successfully achieved under the proposed methodology.« less

3D unstructured-mesh radiation transport codes

DOE Office of Scientific and Technical Information (OSTI.GOV)

Morel, J.

1997-12-31

Three unstructured-mesh radiation transport codes are currently being developed at Los Alamos National Laboratory. The first code is ATTILA, which uses an unstructured tetrahedral mesh in conjunction with standard Sn (discrete-ordinates) angular discretization, standard multigroup energy discretization, and linear-discontinuous spatial differencing. ATTILA solves the standard first-order form of the transport equation using source iteration in conjunction with diffusion-synthetic acceleration of the within-group source iterations. DANTE is designed to run primarily on workstations. The second code is DANTE, which uses a hybrid finite-element mesh consisting of arbitrary combinations of hexahedra, wedges, pyramids, and tetrahedra. DANTE solves several second-order self-adjoint forms of the transport equation including the even-parity equation, the odd-parity equation, and a new equation called the self-adjoint angular flux equation. DANTE also offers three angular discretization options:more » $$S{_}n$$ (discrete-ordinates), $$P{_}n$$ (spherical harmonics), and $$SP{_}n$$ (simplified spherical harmonics). DANTE is designed to run primarily on massively parallel message-passing machines, such as the ASCI-Blue machines at LANL and LLNL. The third code is PERICLES, which uses the same hybrid finite-element mesh as DANTE, but solves the standard first-order form of the transport equation rather than a second-order self-adjoint form. DANTE uses a standard $$S{_}n$$ discretization in angle in conjunction with trilinear-discontinuous spatial differencing, and diffusion-synthetic acceleration of the within-group source iterations. PERICLES was initially designed to run on workstations, but a version for massively parallel message-passing machines will be built. The three codes will be described in detail and computational results will be presented.« less

Power and sample size evaluation for the Cochran-Mantel-Haenszel mean score (Wilcoxon rank sum) test and the Cochran-Armitage test for trend.

PubMed

Lachin, John M

2011-11-10

The power of a chi-square test, and thus the required sample size, are a function of the noncentrality parameter that can be obtained as the limiting expectation of the test statistic under an alternative hypothesis specification. Herein, we apply this principle to derive simple expressions for two tests that are commonly applied to discrete ordinal data. The Wilcoxon rank sum test for the equality of distributions in two groups is algebraically equivalent to the Mann-Whitney test. The Kruskal-Wallis test applies to multiple groups. These tests are equivalent to a Cochran-Mantel-Haenszel mean score test using rank scores for a set of C-discrete categories. Although various authors have assessed the power function of the Wilcoxon and Mann-Whitney tests, herein it is shown that the power of these tests with discrete observations, that is, with tied ranks, is readily provided by the power function of the corresponding Cochran-Mantel-Haenszel mean scores test for two and R > 2 groups. These expressions yield results virtually identical to those derived previously for rank scores and also apply to other score functions. The Cochran-Armitage test for trend assesses whether there is an monotonically increasing or decreasing trend in the proportions with a positive outcome or response over the C-ordered categories of an ordinal independent variable, for example, dose. Herein, it is shown that the power of the test is a function of the slope of the response probabilities over the ordinal scores assigned to the groups that yields simple expressions for the power of the test. Copyright © 2011 John Wiley & Sons, Ltd.

Implicitly causality enforced solution of multidimensional transient photon transport equation.

PubMed

Handapangoda, Chintha C; Premaratne, Malin

2009-12-21

A novel method for solving the multidimensional transient photon transport equation for laser pulse propagation in biological tissue is presented. A Laguerre expansion is used to represent the time dependency of the incident short pulse. Owing to the intrinsic causal nature of Laguerre functions, our technique automatically always preserve the causality constrains of the transient signal. This expansion of the radiance using a Laguerre basis transforms the transient photon transport equation to the steady state version. The resulting equations are solved using the discrete ordinates method, using a finite volume approach. Therefore, our method enables one to handle general anisotropic, inhomogeneous media using a single formulation but with an added degree of flexibility owing to the ability to invoke higher-order approximations of discrete ordinate quadrature sets. Therefore, compared with existing strategies, this method offers the advantage of representing the intensity with a high accuracy thus minimizing numerical dispersion and false propagation errors. The application of the method to one, two and three dimensional geometries is provided.

Linearized radiative transfer models for retrieval of cloud parameters from EPIC/DSCOVR measurements

NASA Astrophysics Data System (ADS)

Molina García, Víctor; Sasi, Sruthy; Efremenko, Dmitry S.; Doicu, Adrian; Loyola, Diego

2018-07-01

In this paper, we describe several linearized radiative transfer models which can be used for the retrieval of cloud parameters from EPIC (Earth Polychromatic Imaging Camera) measurements. The approaches under examination are (1) the linearized forward approach, represented in this paper by the linearized discrete ordinate and matrix operator methods with matrix exponential, and (2) the forward-adjoint approach based on the discrete ordinate method with matrix exponential. To enhance the performance of the radiative transfer computations, the correlated k-distribution method and the Principal Component Analysis (PCA) technique are used. We provide a compact description of the proposed methods, as well as a numerical analysis of their accuracy and efficiency when simulating EPIC measurements in the oxygen A-band channel at 764 nm. We found that the computation time of the forward-adjoint approach using the correlated k-distribution method in conjunction with PCA is approximately 13 s for simultaneously computing the derivatives with respect to cloud optical thickness and cloud top height.

Numerical simulation of rarefied gas flow through a slit

NASA Technical Reports Server (NTRS)

Keith, Theo G., Jr.; Jeng, Duen-Ren; De Witt, Kenneth J.; Chung, Chan-Hong

1990-01-01

Two different approaches, the finite-difference method coupled with the discrete-ordinate method (FDDO), and the direct-simulation Monte Carlo (DSMC) method, are used in the analysis of the flow of a rarefied gas from one reservoir to another through a two-dimensional slit. The cases considered are for hard vacuum downstream pressure, finite pressure ratios, and isobaric pressure with thermal diffusion, which are not well established in spite of the simplicity of the flow field. In the FDDO analysis, by employing the discrete-ordinate method, the Boltzmann equation simplified by a model collision integral is transformed to a set of partial differential equations which are continuous in physical space but are point functions in molecular velocity space. The set of partial differential equations are solved by means of a finite-difference approximation. In the DSMC analysis, three kinds of collision sampling techniques, the time counter (TC) method, the null collision (NC) method, and the no time counter (NTC) method, are used.

FDDO and DSMC analyses of rarefied gas flow through 2D nozzles

NASA Technical Reports Server (NTRS)

Chung, Chan-Hong; De Witt, Kenneth J.; Jeng, Duen-Ren; Penko, Paul F.

1992-01-01

Two different approaches, the finite-difference method coupled with the discrete-ordinate method (FDDO), and the direct-simulation Monte Carlo (DSMC) method, are used in the analysis of the flow of a rarefied gas expanding through a two-dimensional nozzle and into a surrounding low-density environment. In the FDDO analysis, by employing the discrete-ordinate method, the Boltzmann equation simplified by a model collision integral is transformed to a set of partial differential equations which are continuous in physical space but are point functions in molecular velocity space. The set of partial differential equations are solved by means of a finite-difference approximation. In the DSMC analysis, the variable hard sphere model is used as a molecular model and the no time counter method is employed as a collision sampling technique. The results of both the FDDO and the DSMC methods show good agreement. The FDDO method requires less computational effort than the DSMC method by factors of 10 to 40 in CPU time, depending on the degree of rarefaction.

Coordinate control of initiative mating device for autonomous underwater vehicle based on TDES

NASA Astrophysics Data System (ADS)

Yan, Zhe-Ping; Hou, Shu-Ping

2005-06-01

A novel initiative mating device, which has four 2-degree manipulators around the mating skirt, is proposed to mate between a skirt of AUV (autonomons underwater vehicle) and a disabled submarine. The primary function of the device is to keep exact mating between skirt and disabled submarine in a badly sub sea environment. According to the characteristic of rescue, an automaton model is brought foward to describe the mating proceed between AUV and manipulators. The coordinated control is implemented by the TDES (time discrete event system). After taking into account the time problem, it is a useful method to control mating by simulation testing. The result shows that it reduces about 70 seconds after using intelligent co-ordinate control based on TDES through the whole mating procedure.

The finite element model for the propagation of light in scattering media: a direct method for domains with nonscattering regions.

PubMed

Arridge, S R; Dehghani, H; Schweiger, M; Okada, E

2000-01-01

We present a method for handling nonscattering regions within diffusing domains. The method develops from an iterative radiosity-diffusion approach using Green's functions that was computationally slow. Here we present an improved implementation using a finite element method (FEM) that is direct. The fundamental idea is to introduce extra equations into the standard diffusion FEM to represent nondiffusive light propagation across a nonscattering region. By appropriate mesh node ordering the computational time is not much greater than for diffusion alone. We compare results from this method with those from a discrete ordinate transport code, and with Monte Carlo calculations. The agreement is very good, and, in addition, our scheme allows us to easily model time-dependent and frequency domain problems.

Implementation of radiation shielding calculation methods. Volume 2: Seminar/Workshop notes

NASA Technical Reports Server (NTRS)

Capo, M. A.; Disney, R. K.

1971-01-01

Detailed descriptions are presented of the input data for each of the MSFC computer codes applied to the analysis of a realistic nuclear propelled vehicle. The analytical techniques employed include cross section data, preparation, one and two dimensional discrete ordinates transport, point kernel, and single scatter methods.

Least-squares collocation meshless approach for radiative heat transfer in absorbing and scattering media

NASA Astrophysics Data System (ADS)

Liu, L. H.; Tan, J. Y.

2007-02-01

A least-squares collocation meshless method is employed for solving the radiative heat transfer in absorbing, emitting and scattering media. The least-squares collocation meshless method for radiative transfer is based on the discrete ordinates equation. A moving least-squares approximation is applied to construct the trial functions. Except for the collocation points which are used to construct the trial functions, a number of auxiliary points are also adopted to form the total residuals of the problem. The least-squares technique is used to obtain the solution of the problem by minimizing the summation of residuals of all collocation and auxiliary points. Three numerical examples are studied to illustrate the performance of this new solution method. The numerical results are compared with the other benchmark approximate solutions. By comparison, the results show that the least-squares collocation meshless method is efficient, accurate and stable, and can be used for solving the radiative heat transfer in absorbing, emitting and scattering media.

Semi-supervised learning for ordinal Kernel Discriminant Analysis.

PubMed

Pérez-Ortiz, M; Gutiérrez, P A; Carbonero-Ruz, M; Hervás-Martínez, C

2016-12-01

Ordinal classification considers those classification problems where the labels of the variable to predict follow a given order. Naturally, labelled data is scarce or difficult to obtain in this type of problems because, in many cases, ordinal labels are given by a user or expert (e.g. in recommendation systems). Firstly, this paper develops a new strategy for ordinal classification where both labelled and unlabelled data are used in the model construction step (a scheme which is referred to as semi-supervised learning). More specifically, the ordinal version of kernel discriminant learning is extended for this setting considering the neighbourhood information of unlabelled data, which is proposed to be computed in the feature space induced by the kernel function. Secondly, a new method for semi-supervised kernel learning is devised in the context of ordinal classification, which is combined with our developed classification strategy to optimise the kernel parameters. The experiments conducted compare 6 different approaches for semi-supervised learning in the context of ordinal classification in a battery of 30 datasets, showing (1) the good synergy of the ordinal version of discriminant analysis and the use of unlabelled data and (2) the advantage of computing distances in the feature space induced by the kernel function. Copyright © 2016 Elsevier Ltd. All rights reserved.

Efficient and Accurate Computation of Non-Negative Anisotropic Group Scattering Cross Sections for Discrete Ordinates and Monte Carlo Radiation Transport

DTIC Science & Technology

2002-07-01

Date Kirk A. Mathews (Advisor) James T. Moore (Dean’s Representative) Charles J. Bridgman (Member...Adler-Adler, and Kalbach -Mann representations of the scatter cross sections that are used for some isotopes in ENDF/B-VI are not included. They are not

Monte Carlo and discrete-ordinate simulations of spectral radiances in a coupled air-tissue system.

PubMed

Hestenes, Kjersti; Nielsen, Kristian P; Zhao, Lu; Stamnes, Jakob J; Stamnes, Knut

2007-04-20

We perform a detailed comparison study of Monte Carlo (MC) simulations and discrete-ordinate radiative-transfer (DISORT) calculations of spectral radiances in a 1D coupled air-tissue (CAT) system consisting of horizontal plane-parallel layers. The MC and DISORT models have the same physical basis, including coupling between the air and the tissue, and we use the same air and tissue input parameters for both codes. We find excellent agreement between radiances obtained with the two codes, both above and in the tissue. Our tests cover typical optical properties of skin tissue at the 280, 540, and 650 nm wavelengths. The normalized volume scattering function for internal structures in the skin is represented by the one-parameter Henyey-Greenstein function for large particles and the Rayleigh scattering function for small particles. The CAT-DISORT code is found to be approximately 1000 times faster than the CAT-MC code. We also show that the spectral radiance field is strongly dependent on the inherent optical properties of the skin tissue.

Comparison of discrete ordinate and Monte Carlo simulations of polarized radiative transfer in two coupled slabs with different refractive indices.

PubMed

Cohen, D; Stamnes, S; Tanikawa, T; Sommersten, E R; Stamnes, J J; Lotsberg, J K; Stamnes, K

2013-04-22

A comparison is presented of two different methods for polarized radiative transfer in coupled media consisting of two adjacent slabs with different refractive indices, each slab being a stratified medium with no change in optical properties except in the direction of stratification. One of the methods is based on solving the integro-differential radiative transfer equation for the two coupled slabs using the discrete ordinate approximation. The other method is based on probabilistic and statistical concepts and simulates the propagation of polarized light using the Monte Carlo approach. The emphasis is on non-Rayleigh scattering for particles in the Mie regime. Comparisons with benchmark results available for a slab with constant refractive index show that both methods reproduce these benchmark results when the refractive index is set to be the same in the two slabs. Computed results for test cases with coupling (different refractive indices in the two slabs) show that the two methods produce essentially identical results for identical input in terms of absorption and scattering coefficients and scattering phase matrices.

Fast radiative transfer models for retrieval of cloud properties in the back-scattering region: application to DSCOVR-EPIC sensor

NASA Astrophysics Data System (ADS)

Molina Garcia, Victor; Sasi, Sruthy; Efremenko, Dmitry; Doicu, Adrian; Loyola, Diego

2017-04-01

In this work, the requirements for the retrieval of cloud properties in the back-scattering region are described, and their application to the measurements taken by the Earth Polychromatic Imaging Camera (EPIC) on board the Deep Space Climate Observatory (DSCOVR) is shown. Various radiative transfer models and their linearizations are implemented, and their advantages and issues are analyzed. As radiative transfer calculations in the back-scattering region are computationally time-consuming, several acceleration techniques are also studied. The radiative transfer models analyzed include the exact Discrete Ordinate method with Matrix Exponential (DOME), the Matrix Operator method with Matrix Exponential (MOME), and the approximate asymptotic and equivalent Lambertian cloud models. To reduce the computational cost of the line-by-line (LBL) calculations, the k-distribution method, the Principal Component Analysis (PCA) and a combination of the k-distribution method plus PCA are used. The linearized radiative transfer models for retrieval of cloud properties include the Linearized Discrete Ordinate method with Matrix Exponential (LDOME), the Linearized Matrix Operator method with Matrix Exponential (LMOME) and the Forward-Adjoint Discrete Ordinate method with Matrix Exponential (FADOME). These models were applied to the EPIC oxygen-A band absorption channel at 764 nm. It is shown that the approximate asymptotic and equivalent Lambertian cloud models give inaccurate results, so an offline processor for the retrieval of cloud properties in the back-scattering region requires the use of exact models such as DOME and MOME, which behave similarly. The combination of the k-distribution method plus PCA presents similar accuracy to the LBL calculations, but it is up to 360 times faster, and the relative errors for the computed radiances are less than 1.5% compared to the results when the exact phase function is used. Finally, the linearized models studied show similar behavior, with relative errors less than 1% for the radiance derivatives, but FADOME is 2 times faster than LDOME and 2.5 times faster than LMOME.

Iterative discrete ordinates solution of the equation for surface-reflected radiance

NASA Astrophysics Data System (ADS)

Radkevich, Alexander

2017-11-01

This paper presents a new method of numerical solution of the integral equation for the radiance reflected from an anisotropic surface. The equation relates the radiance at the surface level with BRDF and solutions of the standard radiative transfer problems for a slab with no reflection on its surfaces. It is also shown that the kernel of the equation satisfies the condition of the existence of a unique solution and the convergence of the successive approximations to that solution. The developed method features two basic steps: discretization on a 2D quadrature, and solving the resulting system of algebraic equations with successive over-relaxation method based on the Gauss-Seidel iterative process. Presented numerical examples show good coincidence between the surface-reflected radiance obtained with DISORT and the proposed method. Analysis of contributions of the direct and diffuse (but not yet reflected) parts of the downward radiance to the total solution is performed. Together, they represent a very good initial guess for the iterative process. This fact ensures fast convergence. The numerical evidence is given that the fastest convergence occurs with the relaxation parameter of 1 (no relaxation). An integral equation for BRDF is derived as inversion of the original equation. The potential of this new equation for BRDF retrievals is analyzed. The approach is found not viable as the BRDF equation appears to be an ill-posed problem, and it requires knowledge the surface-reflected radiance on the entire domain of both Sun and viewing zenith angles.

A Bayesian hierarchical model for discrete choice data in health care.

PubMed

Antonio, Anna Liza M; Weiss, Robert E; Saigal, Christopher S; Dahan, Ely; Crespi, Catherine M

2017-01-01

In discrete choice experiments, patients are presented with sets of health states described by various attributes and asked to make choices from among them. Discrete choice experiments allow health care researchers to study the preferences of individual patients by eliciting trade-offs between different aspects of health-related quality of life. However, many discrete choice experiments yield data with incomplete ranking information and sparsity due to the limited number of choice sets presented to each patient, making it challenging to estimate patient preferences. Moreover, methods to identify outliers in discrete choice data are lacking. We develop a Bayesian hierarchical random effects rank-ordered multinomial logit model for discrete choice data. Missing ranks are accounted for by marginalizing over all possible permutations of unranked alternatives to estimate individual patient preferences, which are modeled as a function of patient covariates. We provide a Bayesian version of relative attribute importance, and adapt the use of the conditional predictive ordinate to identify outlying choice sets and outlying individuals with unusual preferences compared to the population. The model is applied to data from a study using a discrete choice experiment to estimate individual patient preferences for health states related to prostate cancer treatment.

The DANTE Boltzmann transport solver: An unstructured mesh, 3-D, spherical harmonics algorithm compatible with parallel computer architectures

DOE Office of Scientific and Technical Information (OSTI.GOV)

McGhee, J.M.; Roberts, R.M.; Morel, J.E.

1997-06-01

A spherical harmonics research code (DANTE) has been developed which is compatible with parallel computer architectures. DANTE provides 3-D, multi-material, deterministic, transport capabilities using an arbitrary finite element mesh. The linearized Boltzmann transport equation is solved in a second order self-adjoint form utilizing a Galerkin finite element spatial differencing scheme. The core solver utilizes a preconditioned conjugate gradient algorithm. Other distinguishing features of the code include options for discrete-ordinates and simplified spherical harmonics angular differencing, an exact Marshak boundary treatment for arbitrarily oriented boundary faces, in-line matrix construction techniques to minimize memory consumption, and an effective diffusion based preconditioner formore » scattering dominated problems. Algorithm efficiency is demonstrated for a massively parallel SIMD architecture (CM-5), and compatibility with MPP multiprocessor platforms or workstation clusters is anticipated.« less

Automated variance reduction for MCNP using deterministic methods.

PubMed

Sweezy, J; Brown, F; Booth, T; Chiaramonte, J; Preeg, B

2005-01-01

In order to reduce the user's time and the computer time needed to solve deep penetration problems, an automated variance reduction capability has been developed for the MCNP Monte Carlo transport code. This new variance reduction capability developed for MCNP5 employs the PARTISN multigroup discrete ordinates code to generate mesh-based weight windows. The technique of using deterministic methods to generate importance maps has been widely used to increase the efficiency of deep penetration Monte Carlo calculations. The application of this method in MCNP uses the existing mesh-based weight window feature to translate the MCNP geometry into geometry suitable for PARTISN. The adjoint flux, which is calculated with PARTISN, is used to generate mesh-based weight windows for MCNP. Additionally, the MCNP source energy spectrum can be biased based on the adjoint energy spectrum at the source location. This method can also use angle-dependent weight windows.

Vectorization of transport and diffusion computations on the CDC Cyber 205

DOE Office of Scientific and Technical Information (OSTI.GOV)

Abu-Shumays, I.K.

1986-01-01

The development and testing of alternative numerical methods and computational algorithms specifically designed for the vectorization of transport and diffusion computations on a Control Data Corporation (CDC) Cyber 205 vector computer are described. Two solution methods for the discrete ordinates approximation to the transport equation are summarized and compared. Factors of 4 to 7 reduction in run times for certain large transport problems were achieved on a Cyber 205 as compared with run times on a CDC-7600. The solution of tridiagonal systems of linear equations, central to several efficient numerical methods for multidimensional diffusion computations and essential for fluid flowmore » and other physics and engineering problems, is also dealt with. Among the methods tested, a combined odd-even cyclic reduction and modified Cholesky factorization algorithm for solving linear symmetric positive definite tridiagonal systems is found to be the most effective for these systems on a Cyber 205. For large tridiagonal systems, computation with this algorithm is an order of magnitude faster on a Cyber 205 than computation with the best algorithm for tridiagonal systems on a CDC-7600.« less

Radiative Transfer Model for Operational Retrieval of Cloud Parameters from DSCOVR-EPIC Measurements

NASA Astrophysics Data System (ADS)

Yang, Y.; Molina Garcia, V.; Doicu, A.; Loyola, D. G.

2016-12-01

The Earth Polychromatic Imaging Camera (EPIC) onboard the Deep Space Climate Observatory (DSCOVR) measures the radiance in the backscattering region. To make sure that all details in the backward glory are covered, a large number of streams is required by a standard radiative transfer model based on the discrete ordinates method. Even the use of the delta-M scaling and the TMS correction do not substantially reduce the number of streams. The aim of this work is to analyze the capability of a fast radiative transfer model to retrieve operationally cloud parameters from EPIC measurements. The radiative transfer model combines the discrete ordinates method with matrix exponential for the computation of radiances and the matrix operator method for the calculation of the reflection and transmission matrices. Standard acceleration techniques as, for instance, the use of the normalized right and left eigenvectors, telescoping technique, Pade approximation and successive-order-of-scattering approximation are implemented. In addition, the model may compute the reflection matrix of the cloud by means of the asymptotic theory, and may use the equivalent Lambertian cloud model. The various approximations are analyzed from the point of view of efficiency and accuracy.

Computing Radiative Transfer in a 3D Medium

NASA Technical Reports Server (NTRS)

Von Allmen, Paul; Lee, Seungwon

2012-01-01

A package of software computes the time-dependent propagation of a narrow laser beam in an arbitrary three- dimensional (3D) medium with absorption and scattering, using the transient-discrete-ordinates method and a direct integration method. Unlike prior software that utilizes a Monte Carlo method, this software enables simulation at very small signal-to-noise ratios. The ability to simulate propagation of a narrow laser beam in a 3D medium is an improvement over other discrete-ordinate software. Unlike other direct-integration software, this software is not limited to simulation of propagation of thermal radiation with broad angular spread in three dimensions or of a laser pulse with narrow angular spread in two dimensions. Uses for this software include (1) computing scattering of a pulsed laser beam on a material having given elastic scattering and absorption profiles, and (2) evaluating concepts for laser-based instruments for sensing oceanic turbulence and related measurements of oceanic mixed-layer depths. With suitable augmentation, this software could be used to compute radiative transfer in ultrasound imaging in biological tissues, radiative transfer in the upper Earth crust for oil exploration, and propagation of laser pulses in telecommunication applications.

Radiant heat exchange calculations in radiantly heated and cooled enclosures

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chapman, K.S.; Zhang, P.

1995-08-01

This paper presents the development of a three-dimensional mathematical model to compute the radiant heat exchange between surfaces separated by a transparent and/or opaque medium. The model formulation accommodates arbitrary arrangements of the interior surfaces, as well as arbitrary placement of obstacles within the enclosure. The discrete ordinates radiation model is applied and has the capability to analyze the effect of irregular geometries and diverse surface temperatures and radiative properties. The model is verified by comparing calculated heat transfer rates to heat transfer rates determined from the exact radiosity method for four different enclosures. The four enclosures were selected tomore » provide a wide range of verification. This three-dimensional model based on the discrete ordinates method can be applied to a building to assist the design engineer in sizing a radiant heating system. By coupling this model with a convective and conductive heat transfer model and a thermal comfort model, the comfort levels throughout the room can be easily and efficiently mapped for a given radiant heater location. In addition, objects such as airplanes, trucks, furniture, and partitions can be easily incorporated to determine their effect on the performance of the radiant heating system.« less

Ex-vessel neutron dosimetry analysis for westinghouse 4-loop XL pressurized water reactor plant using the RadTrack{sup TM} Code System with the 3D parallel discrete ordinates code RAPTOR-M3G

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chen, J.; Alpan, F. A.; Fischer, G.A.

2011-07-01

Traditional two-dimensional (2D)/one-dimensional (1D) SYNTHESIS methodology has been widely used to calculate fast neutron (>1.0 MeV) fluence exposure to reactor pressure vessel in the belt-line region. However, it is expected that this methodology cannot provide accurate fast neutron fluence calculation at elevations far above or below the active core region. A three-dimensional (3D) parallel discrete ordinates calculation for ex-vessel neutron dosimetry on a Westinghouse 4-Loop XL Pressurized Water Reactor has been done. It shows good agreement between the calculated results and measured results. Furthermore, the results show very different fast neutron flux values at some of the former plate locationsmore » and elevations above and below an active core than those calculated by a 2D/1D SYNTHESIS method. This indicates that for certain irregular reactor internal structures, where the fast neutron flux has a very strong local effect, it is required to use a 3D transport method to calculate accurate fast neutron exposure. (authors)« less

Three-Dimensional Orthogonal Co-ordinates

ERIC Educational Resources Information Center

Astin, J.

1974-01-01

A systematic approach to general orthogonal co-ordinates, suitable for use near the end of a beginning vector analysis course, is presented. It introduces students to tensor quantities and shows how equations and quantities needed in classical problems can be determined. (Author/LS)

Reactor Dosimetry Applications Using RAPTOR-M3G:. a New Parallel 3-D Radiation Transport Code

NASA Astrophysics Data System (ADS)

Longoni, Gianluca; Anderson, Stanwood L.

2009-08-01

The numerical solution of the Linearized Boltzmann Equation (LBE) via the Discrete Ordinates method (SN) requires extensive computational resources for large 3-D neutron and gamma transport applications due to the concurrent discretization of the angular, spatial, and energy domains. This paper will discuss the development RAPTOR-M3G (RApid Parallel Transport Of Radiation - Multiple 3D Geometries), a new 3-D parallel radiation transport code, and its application to the calculation of ex-vessel neutron dosimetry responses in the cavity of a commercial 2-loop Pressurized Water Reactor (PWR). RAPTOR-M3G is based domain decomposition algorithms, where the spatial and angular domains are allocated and processed on multi-processor computer architectures. As compared to traditional single-processor applications, this approach reduces the computational load as well as the memory requirement per processor, yielding an efficient solution methodology for large 3-D problems. Measured neutron dosimetry responses in the reactor cavity air gap will be compared to the RAPTOR-M3G predictions. This paper is organized as follows: Section 1 discusses the RAPTOR-M3G methodology; Section 2 describes the 2-loop PWR model and the numerical results obtained. Section 3 addresses the parallel performance of the code, and Section 4 concludes this paper with final remarks and future work.

Sub-Scale Analysis of New Large Aircraft Pool Fire-Suppression

DTIC Science & Technology

2016-01-01

discrete ordinates radiation and single step Khan and Greeves soot model provided radiation and soot interaction. Agent spray dynamics were...Notable differences observed showed a modeled increase in the mockup surface heat-up rate as well as a modeled decreased rate of soot production...488 K SUPPRESSION STARTED  Large deviation between sensors due to sensor alignment challenges and asymmetric fuel surface ignition  Unremarkable

Clouds in the atmospheres of extrasolar planets. IV. On the scattering greenhouse effect of CO2 ice particles: Numerical radiative transfer studies

NASA Astrophysics Data System (ADS)

Kitzmann, D.; Patzer, A. B. C.; Rauer, H.

2013-09-01

Context. Owing to their wavelength-dependent absorption and scattering properties, clouds have a strong impact on the climate of planetary atmospheres. The potential greenhouse effect of CO2 ice clouds in the atmospheres of terrestrial extrasolar planets is of particular interest because it might influence the position and thus the extension of the outer boundary of the classic habitable zone around main sequence stars. Such a greenhouse effect, however, is a complicated function of the CO2 ice particles' optical properties. Aims: We study the radiative effects of CO2 ice particles obtained by different numerical treatments to solve the radiative transfer equation. To determine the effectiveness of the scattering greenhouse effect caused by CO2 ice clouds, the radiative transfer calculations are performed over the relevant wide range of particle sizes and optical depths, employing different numerical methods. Methods: We used Mie theory to calculate the optical properties of particle polydispersion. The radiative transfer calculations were done with a high-order discrete ordinate method (DISORT). Two-stream radiative transfer methods were used for comparison with previous studies. Results: The comparison between the results of a high-order discrete ordinate method and simpler two-stream approaches reveals large deviations in terms of a potential scattering efficiency of the greenhouse effect. The two-stream methods overestimate the transmitted and reflected radiation, thereby yielding a higher scattering greenhouse effect. For the particular case of a cool M-type dwarf, the CO2 ice particles show no strong effective scattering greenhouse effect by using the high-order discrete ordinate method, whereas a positive net greenhouse effect was found for the two-stream radiative transfer schemes. As a result, previous studies of the effects of CO2 ice clouds using two-stream approximations overrated the atmospheric warming caused by the scattering greenhouse effect. Consequently, the scattering greenhouse effect of CO2 ice particles seems to be less effective than previously estimated. In general, higher order radiative transfer methods are needed to describe the effects of CO2 ice clouds accurately as indicated by our numerical radiative transfer studies.

The Duluth Clean Indoor Air Ordinance: Problems and Success in Fighting the Tobacco Industry at the Local Level in the 21st Century

PubMed Central

Tsoukalas, Theodore; Glantz, Stanton A.

2003-01-01

Case study methodology was used to investigate the tobacco industry’s strategies to fight local tobacco control efforts in Duluth, Minn. The industry opposed the clean indoor air ordinance indirectly through allies and front groups and directly in a referendum. Health groups failed to win a strong ordinance because they framed it as a youth issue rather than a workplace issue and failed to engage the industry’s economic claims. Opponents’ overexploitation of weaknesses in the ordinance allowed health advocates to construct a stronger version. Health advocates should assume that the tobacco industry will oppose all local tobacco control measures indirectly, directly, or both. Clean indoor air ordinances should be framed as workplace safety issues. PMID:12893598

Hybrid parallel code acceleration methods in full-core reactor physics calculations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Courau, T.; Plagne, L.; Ponicot, A.

2012-07-01

When dealing with nuclear reactor calculation schemes, the need for three dimensional (3D) transport-based reference solutions is essential for both validation and optimization purposes. Considering a benchmark problem, this work investigates the potential of discrete ordinates (Sn) transport methods applied to 3D pressurized water reactor (PWR) full-core calculations. First, the benchmark problem is described. It involves a pin-by-pin description of a 3D PWR first core, and uses a 8-group cross-section library prepared with the DRAGON cell code. Then, a convergence analysis is performed using the PENTRAN parallel Sn Cartesian code. It discusses the spatial refinement and the associated angular quadraturemore » required to properly describe the problem physics. It also shows that initializing the Sn solution with the EDF SPN solver COCAGNE reduces the number of iterations required to converge by nearly a factor of 6. Using a best estimate model, PENTRAN results are then compared to multigroup Monte Carlo results obtained with the MCNP5 code. Good consistency is observed between the two methods (Sn and Monte Carlo), with discrepancies that are less than 25 pcm for the k{sub eff}, and less than 2.1% and 1.6% for the flux at the pin-cell level and for the pin-power distribution, respectively. (authors)« less

Introduction to the Theory of Atmospheric Radiative Transfer

NASA Technical Reports Server (NTRS)

Buglia, J. J.

1986-01-01

The fundamental physical and mathematical principles governing the transmission of radiation through the atmosphere are presented, with emphasis on the scattering of visible and near-IR radiation. The classical two-stream, thin-atmosphere, and Eddington approximations, along with some of their offspring, are developed in detail, along with the discrete ordinates method of Chandrasekhar. The adding and doubling methods are discussed from basic principles, and references for further reading are suggested.

ANOVA with Rasch Measures.

ERIC Educational Resources Information Center

Linacre, John Michael

Various methods of estimating main effects from ordinal data are presented and contrasted. Problems discussed include: (1) at what level to accumulate ordinal data into linear measures; (2) how to maintain scaling across analyses; and (3) the inevitable confounding of within cell variance with measurement error. An example shows three methods of…

Multiple Ordinal Regression by Maximizing the Sum of Margins

PubMed Central

Hamsici, Onur C.; Martinez, Aleix M.

2016-01-01

Human preferences are usually measured using ordinal variables. A system whose goal is to estimate the preferences of humans and their underlying decision mechanisms requires to learn the ordering of any given sample set. We consider the solution of this ordinal regression problem using a Support Vector Machine algorithm. Specifically, the goal is to learn a set of classifiers with common direction vectors and different biases correctly separating the ordered classes. Current algorithms are either required to solve a quadratic optimization problem, which is computationally expensive, or are based on maximizing the minimum margin (i.e., a fixed margin strategy) between a set of hyperplanes, which biases the solution to the closest margin. Another drawback of these strategies is that they are limited to order the classes using a single ranking variable (e.g., perceived length). In this paper, we define a multiple ordinal regression algorithm based on maximizing the sum of the margins between every consecutive class with respect to one or more rankings (e.g., perceived length and weight). We provide derivations of an efficient, easy-to-implement iterative solution using a Sequential Minimal Optimization procedure. We demonstrate the accuracy of our solutions in several datasets. In addition, we provide a key application of our algorithms in estimating human subjects’ ordinal classification of attribute associations to object categories. We show that these ordinal associations perform better than the binary one typically employed in the literature. PMID:26529784

Ordinal optimization and its application to complex deterministic problems

NASA Astrophysics Data System (ADS)

Yang, Mike Shang-Yu

1998-10-01

We present in this thesis a new perspective to approach a general class of optimization problems characterized by large deterministic complexities. Many problems of real-world concerns today lack analyzable structures and almost always involve high level of difficulties and complexities in the evaluation process. Advances in computer technology allow us to build computer models to simulate the evaluation process through numerical means, but the burden of high complexities remains to tax the simulation with an exorbitant computing cost for each evaluation. Such a resource requirement makes local fine-tuning of a known design difficult under most circumstances, let alone global optimization. Kolmogorov equivalence of complexity and randomness in computation theory is introduced to resolve this difficulty by converting the complex deterministic model to a stochastic pseudo-model composed of a simple deterministic component and a white-noise like stochastic term. The resulting randomness is then dealt with by a noise-robust approach called Ordinal Optimization. Ordinal Optimization utilizes Goal Softening and Ordinal Comparison to achieve an efficient and quantifiable selection of designs in the initial search process. The approach is substantiated by a case study in the turbine blade manufacturing process. The problem involves the optimization of the manufacturing process of the integrally bladed rotor in the turbine engines of U.S. Air Force fighter jets. The intertwining interactions among the material, thermomechanical, and geometrical changes makes the current FEM approach prohibitively uneconomical in the optimization process. The generalized OO approach to complex deterministic problems is applied here with great success. Empirical results indicate a saving of nearly 95% in the computing cost.

Coupled atmosphere/canopy model for remote sensing of plant reflectance features

NASA Technical Reports Server (NTRS)

Gerstl, S. A.; Zardecki, A.

1985-01-01

Solar radiative transfer through a coupled system of atmosphere and plant canopy is modeled as a multiple-scattering problem through a layered medium of random scatterers. The radiative transfer equation is solved by the discrete-ordinates finite-element method. Analytic expressions are derived that allow the calculation of scattering and absorption cross sections for any plant canopy layer form measurable biophysical parameters such as the leaf area index, leaf angle distribution, and individual leaf reflectance and transmittance data. An expression for a canopy scattering phase function is also given. Computational results are in good agreement with spectral reflectance measurements directly above a soybean canopy, and the concept of greenness- and brightness-transforms of Landsat MSS data is reconfirmed with the computed results. A sensitivity analysis with the coupled atmosphere/canopy model quantifies how satellite-sensed spectral radiances are affected by increased atmospheric aerosols, by varying leaf area index, by anisotropic leaf scattering, and by non-Lambertian soil boundary conditions. Possible extensions to a 2-D model are also discussed.

Multidimensional Modeling of Atmospheric Effects and Surface Heterogeneities on Remote Sensing

NASA Technical Reports Server (NTRS)

Gerstl, S. A. W.; Simmer, C.; Zardecki, A. (Principal Investigator)

1985-01-01

The overall goal of this project is to establish a modeling capability that allows a quantitative determination of atmospheric effects on remote sensing including the effects of surface heterogeneities. This includes an improved understanding of aerosol and haze effects in connection with structural, angular, and spatial surface heterogeneities. One important objective of the research is the possible identification of intrinsic surface or canopy characteristics that might be invariant to atmospheric perturbations so that they could be used for scene identification. Conversely, an equally important objective is to find a correction algorithm for atmospheric effects in satellite-sensed surface reflectances. The technical approach is centered around a systematic model and code development effort based on existing, highly advanced computer codes that were originally developed for nuclear radiation shielding applications. Computational techniques for the numerical solution of the radiative transfer equation are adapted on the basis of the discrete-ordinates finite-element method which proved highly successful for one and two-dimensional radiative transfer problems with fully resolved angular representation of the radiation field.

MCNP capabilities for nuclear well logging calculations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Forster, R.A.; Little, R.C.; Briesmeister, J.F.

The Los Alamos Radiation Transport Code System (LARTCS) consists of state-of-the-art Monte Carlo and discrete ordinates transport codes and data libraries. This paper discusses how the general-purpose continuous-energy Monte Carlo code MCNP ({und M}onte {und C}arlo {und n}eutron {und p}hoton), part of the LARTCS, provides a computational predictive capability for many applications of interest to the nuclear well logging community. The generalized three-dimensional geometry of MCNP is well suited for borehole-tool models. SABRINA, another component of the LARTCS, is a graphics code that can be used to interactively create a complex MCNP geometry. Users can define many source and tallymore » characteristics with standard MCNP features. The time-dependent capability of the code is essential when modeling pulsed sources. Problems with neutrons, photons, and electrons as either single particle or coupled particles can be calculated with MCNP. The physics of neutron and photon transport and interactions is modeled in detail using the latest available cross-section data.« less

Numerical solutions of ideal quantum gas dynamical flows governed by semiclassical ellipsoidal-statistical distribution.

PubMed

Yang, Jaw-Yen; Yan, Chih-Yuan; Diaz, Manuel; Huang, Juan-Chen; Li, Zhihui; Zhang, Hanxin

2014-01-08

The ideal quantum gas dynamics as manifested by the semiclassical ellipsoidal-statistical (ES) equilibrium distribution derived in Wu et al. (Wu et al . 2012 Proc. R. Soc. A 468 , 1799-1823 (doi:10.1098/rspa.2011.0673)) is numerically studied for particles of three statistics. This anisotropic ES equilibrium distribution was derived using the maximum entropy principle and conserves the mass, momentum and energy, but differs from the standard Fermi-Dirac or Bose-Einstein distribution. The present numerical method combines the discrete velocity (or momentum) ordinate method in momentum space and the high-resolution shock-capturing method in physical space. A decoding procedure to obtain the necessary parameters for determining the ES distribution is also devised. Computations of two-dimensional Riemann problems are presented, and various contours of the quantities unique to this ES model are illustrated. The main flow features, such as shock waves, expansion waves and slip lines and their complex nonlinear interactions, are depicted and found to be consistent with existing calculations for a classical gas.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Feder, Russell; Youssef, Mahamoud; Klabacha, Jonathan

USITER is one of seven partner domestic agencies (DA) contributing components to the ITER project. Four diagnostic port plug packages (two equatorial ports and two upper ports) will be engineered and fabricated by Princeton Plasma Physics Lab (PPPL). Diagnostic port plugs as illustrated in Fig. 1 are large primarily stainless steel structures that serve several roles on ITER. The port plugs are the primary vacuum seal and tritium confinement barriers for the vessel. The port plugs also house several plasma diagnostic systems and other machine service equipment. Finally, each port plug must shield high energy neutrons and gamma photons frommore » escaping and creating radiological problems in maintenance areas behind the port plugs. The optimization of the balance between adequate shielding and the need for high performance, high throughput diagnostics systems is the focus of this paper. Neutronics calculations are also needed for assessing nuclear heating and nuclear damage in the port plug and diagnostic components. Attila, the commercially available discrete-ordinates software package, is used for all diagnostic port plug neutronics analysis studies at PPPL.« less

Heat transfer analysis of a lab scale solar receiver using the discrete ordinates model

NASA Astrophysics Data System (ADS)

Dordevich, Milorad C. W.

This thesis documents the development, implementation and simulation outcomes of the Discrete Ordinates Radiation Model in ANSYS FLUENT simulating the radiative heat transfer occurring in the San Diego State University lab-scale Small Particle Heat Exchange Receiver. In tandem, it also serves to document how well the Discrete Ordinates Radiation Model results compared with those from the in-house developed Monte Carlo Ray Trace Method in a number of simplified geometries. The secondary goal of this study was the inclusion of new physics, specifically buoyancy. Implementation of an additional Monte Carlo Ray Trace Method software package known as VEGAS, which was specifically developed to model lab scale solar simulators and provide directional, flux and beam spread information for the aperture boundary condition, was also a goal of this study. Upon establishment of the model, test cases were run to understand the predictive capabilities of the model. It was shown that agreement within 15% was obtained against laboratory measurements made in the San Diego State University Combustion and Solar Energy Laboratory with the metrics of comparison being the thermal efficiency and outlet, wall and aperture quartz temperatures. Parametric testing additionally showed that the thermal efficiency of the system was very dependent on the mass flow rate and particle loading. It was also shown that the orientation of the small particle heat exchange receiver was important in attaining optimal efficiency due to the fact that buoyancy induced effects could not be neglected. The analyses presented in this work were all performed on the lab-scale small particle heat exchange receiver. The lab-scale small particle heat exchange receiver is 0.38 m in diameter by 0.51 m tall and operated with an input irradiation flux of 3 kWth and a nominal mass flow rate of 2 g/s with a suspended particle mass loading of 2 g/m3. Finally, based on acumen gained during the implementation and development of the model, a new and improved design was simulated to predict how the efficiency within the small particle heat exchange receiver could be improved through a few simple internal geometry design modifications. It was shown that the theoretical calculated efficiency of the small particle heat exchange receiver could be improved from 64% to 87% with adjustments to the internal geometry, mass flow rate, and mass loading.

Minimization of annotation work: diagnosis of mammographic masses via active learning

NASA Astrophysics Data System (ADS)

Zhao, Yu; Zhang, Jingyang; Xie, Hongzhi; Zhang, Shuyang; Gu, Lixu

2018-06-01

The prerequisite for establishing an effective prediction system for mammographic diagnosis is the annotation of each mammographic image. The manual annotation work is time-consuming and laborious, which becomes a great hindrance for researchers. In this article, we propose a novel active learning algorithm that can adequately address this problem, leading to the minimization of the labeling costs on the premise of guaranteed performance. Our proposed method is different from the existing active learning methods designed for the general problem as it is specifically designed for mammographic images. Through its modified discriminant functions and improved sample query criteria, the proposed method can fully utilize the pairing of mammographic images and select the most valuable images from both the mediolateral and craniocaudal views. Moreover, in order to extend active learning to the ordinal regression problem, which has no precedent in existing studies, but is essential for mammographic diagnosis (mammographic diagnosis is not only a classification task, but also an ordinal regression task for predicting an ordinal variable, viz. the malignancy risk of lesions), multiple sample query criteria need to be taken into consideration simultaneously. We formulate it as a criteria integration problem and further present an algorithm based on self-adaptive weighted rank aggregation to achieve a good solution. The efficacy of the proposed method was demonstrated on thousands of mammographic images from the digital database for screening mammography. The labeling costs of obtaining optimal performance in the classification and ordinal regression task respectively fell to 33.8 and 19.8 percent of their original costs. The proposed method also generated 1228 wins, 369 ties and 47 losses for the classification task, and 1933 wins, 258 ties and 185 losses for the ordinal regression task compared to the other state-of-the-art active learning algorithms. By taking the particularities of mammographic images, the proposed AL method can indeed reduce the manual annotation work to a great extent without sacrificing the performance of the prediction system for mammographic diagnosis.

Minimization of annotation work: diagnosis of mammographic masses via active learning.

PubMed

Zhao, Yu; Zhang, Jingyang; Xie, Hongzhi; Zhang, Shuyang; Gu, Lixu

2018-05-22

The prerequisite for establishing an effective prediction system for mammographic diagnosis is the annotation of each mammographic image. The manual annotation work is time-consuming and laborious, which becomes a great hindrance for researchers. In this article, we propose a novel active learning algorithm that can adequately address this problem, leading to the minimization of the labeling costs on the premise of guaranteed performance. Our proposed method is different from the existing active learning methods designed for the general problem as it is specifically designed for mammographic images. Through its modified discriminant functions and improved sample query criteria, the proposed method can fully utilize the pairing of mammographic images and select the most valuable images from both the mediolateral and craniocaudal views. Moreover, in order to extend active learning to the ordinal regression problem, which has no precedent in existing studies, but is essential for mammographic diagnosis (mammographic diagnosis is not only a classification task, but also an ordinal regression task for predicting an ordinal variable, viz. the malignancy risk of lesions), multiple sample query criteria need to be taken into consideration simultaneously. We formulate it as a criteria integration problem and further present an algorithm based on self-adaptive weighted rank aggregation to achieve a good solution. The efficacy of the proposed method was demonstrated on thousands of mammographic images from the digital database for screening mammography. The labeling costs of obtaining optimal performance in the classification and ordinal regression task respectively fell to 33.8 and 19.8 percent of their original costs. The proposed method also generated 1228 wins, 369 ties and 47 losses for the classification task, and 1933 wins, 258 ties and 185 losses for the ordinal regression task compared to the other state-of-the-art active learning algorithms. By taking the particularities of mammographic images, the proposed AL method can indeed reduce the manual annotation work to a great extent without sacrificing the performance of the prediction system for mammographic diagnosis.

Ridit Analysis for Cooper-Harper and Other Ordinal Ratings for Sparse Data - A Distance-based Approach

DTIC Science & Technology

2016-09-01

is to fit empirical Beta distributions to observed data, and then to use a randomization approach to make inferences on the difference between...a Ridit analysis on the often sparse data sets in many Flying Qualities applicationsi. The method of this paper is to fit empirical Beta ...One such measure is the discrete- probability-distribution version of the (squared) ‘Hellinger Distance’ (Yang & Le Cam , 2000) 2(, ) = 1

Analytic approach to photoelectron transport.

NASA Technical Reports Server (NTRS)

Stolarski, R. S.

1972-01-01

The equation governing the transport of photoelectrons in the ionosphere is shown to be equivalent to the equation of radiative transfer. In the single-energy approximation this equation is solved in closed form by the method of discrete ordinates for isotropic scattering and for a single-constituent atmosphere. The results include prediction of the angular distribution of photoelectrons at all altitudes and, in particular, the angular distribution of the escape flux. The implications of these solutions in real atmosphere calculations are discussed.

A Modified Penalty Parameter Approach for Optimal Estimation of UH with Simultaneous Estimation of Infiltration Parameters

NASA Astrophysics Data System (ADS)

Bhattacharjya, Rajib Kumar

2018-05-01

The unit hydrograph and the infiltration parameters of a watershed can be obtained from observed rainfall-runoff data by using inverse optimization technique. This is a two-stage optimization problem. In the first stage, the infiltration parameters are obtained and the unit hydrograph ordinates are estimated in the second stage. In order to combine this two-stage method into a single stage one, a modified penalty parameter approach is proposed for converting the constrained optimization problem to an unconstrained one. The proposed approach is designed in such a way that the model initially obtains the infiltration parameters and then searches the optimal unit hydrograph ordinates. The optimization model is solved using Genetic Algorithms. A reduction factor is used in the penalty parameter approach so that the obtained optimal infiltration parameters are not destroyed during subsequent generation of genetic algorithms, required for searching optimal unit hydrograph ordinates. The performance of the proposed methodology is evaluated by using two example problems. The evaluation shows that the model is superior, simple in concept and also has the potential for field application.

Rescaling quality of life values from discrete choice experiments for use as QALYs: a cautionary tale

PubMed Central

Flynn, Terry N; Louviere, Jordan J; Marley, Anthony AJ; Coast, Joanna; Peters, Tim J

2008-01-01

Background Researchers are increasingly investigating the potential for ordinal tasks such as ranking and discrete choice experiments to estimate QALY health state values. However, the assumptions of random utility theory, which underpin the statistical models used to provide these estimates, have received insufficient attention. In particular, the assumptions made about the decisions between living states and the death state are not satisfied, at least for some people. Estimated values are likely to be incorrectly anchored with respect to death (zero) in such circumstances. Methods Data from the Investigating Choice Experiments for the preferences of older people CAPability instrument (ICECAP) valuation exercise were analysed. The values (previously anchored to the worst possible state) were rescaled using an ordinal model proposed previously to estimate QALY-like values. Bootstrapping was conducted to vary artificially the proportion of people who conformed to the conventional random utility model underpinning the analyses. Results Only 26% of respondents conformed unequivocally to the assumptions of conventional random utility theory. At least 14% of respondents unequivocally violated the assumptions. Varying the relative proportions of conforming respondents in sensitivity analyses led to large changes in the estimated QALY values, particularly for lower-valued states. As a result these values could be either positive (considered to be better than death) or negative (considered to be worse than death). Conclusion Use of a statistical model such as conditional (multinomial) regression to anchor quality of life values from ordinal data to death is inappropriate in the presence of respondents who do not conform to the assumptions of conventional random utility theory. This is clearest when estimating values for that group of respondents observed in valuation samples who refuse to consider any living state to be worse than death: in such circumstances the model cannot be estimated. Only a valuation task requiring respondents to make choices in which both length and quality of life vary can produce estimates that properly reflect the preferences of all respondents. PMID:18945358

Discrete Bat Algorithm for Optimal Problem of Permutation Flow Shop Scheduling

PubMed Central

Luo, Qifang; Zhou, Yongquan; Xie, Jian; Ma, Mingzhi; Li, Liangliang

2014-01-01

A discrete bat algorithm (DBA) is proposed for optimal permutation flow shop scheduling problem (PFSP). Firstly, the discrete bat algorithm is constructed based on the idea of basic bat algorithm, which divide whole scheduling problem into many subscheduling problems and then NEH heuristic be introduced to solve subscheduling problem. Secondly, some subsequences are operated with certain probability in the pulse emission and loudness phases. An intensive virtual population neighborhood search is integrated into the discrete bat algorithm to further improve the performance. Finally, the experimental results show the suitability and efficiency of the present discrete bat algorithm for optimal permutation flow shop scheduling problem. PMID:25243220

Discrete bat algorithm for optimal problem of permutation flow shop scheduling.

PubMed

Luo, Qifang; Zhou, Yongquan; Xie, Jian; Ma, Mingzhi; Li, Liangliang

2014-01-01

A discrete bat algorithm (DBA) is proposed for optimal permutation flow shop scheduling problem (PFSP). Firstly, the discrete bat algorithm is constructed based on the idea of basic bat algorithm, which divide whole scheduling problem into many subscheduling problems and then NEH heuristic be introduced to solve subscheduling problem. Secondly, some subsequences are operated with certain probability in the pulse emission and loudness phases. An intensive virtual population neighborhood search is integrated into the discrete bat algorithm to further improve the performance. Finally, the experimental results show the suitability and efficiency of the present discrete bat algorithm for optimal permutation flow shop scheduling problem.

Scalar discrete nonlinear multipoint boundary value problems

NASA Astrophysics Data System (ADS)

Rodriguez, Jesus; Taylor, Padraic

2007-06-01

In this paper we provide sufficient conditions for the existence of solutions to scalar discrete nonlinear multipoint boundary value problems. By allowing more general boundary conditions and by imposing less restrictions on the nonlinearities, we obtain results that extend previous work in the area of discrete boundary value problems [Debra L. Etheridge, Jesus Rodriguez, Periodic solutions of nonlinear discrete-time systems, Appl. Anal. 62 (1996) 119-137; Debra L. Etheridge, Jesus Rodriguez, Scalar discrete nonlinear two-point boundary value problems, J. Difference Equ. Appl. 4 (1998) 127-144].

Ordinal feature selection for iris and palmprint recognition.

PubMed

Sun, Zhenan; Wang, Libin; Tan, Tieniu

2014-09-01

Ordinal measures have been demonstrated as an effective feature representation model for iris and palmprint recognition. However, ordinal measures are a general concept of image analysis and numerous variants with different parameter settings, such as location, scale, orientation, and so on, can be derived to construct a huge feature space. This paper proposes a novel optimization formulation for ordinal feature selection with successful applications to both iris and palmprint recognition. The objective function of the proposed feature selection method has two parts, i.e., misclassification error of intra and interclass matching samples and weighted sparsity of ordinal feature descriptors. Therefore, the feature selection aims to achieve an accurate and sparse representation of ordinal measures. And, the optimization subjects to a number of linear inequality constraints, which require that all intra and interclass matching pairs are well separated with a large margin. Ordinal feature selection is formulated as a linear programming (LP) problem so that a solution can be efficiently obtained even on a large-scale feature pool and training database. Extensive experimental results demonstrate that the proposed LP formulation is advantageous over existing feature selection methods, such as mRMR, ReliefF, Boosting, and Lasso for biometric recognition, reporting state-of-the-art accuracy on CASIA and PolyU databases.

Ordinal convolutional neural networks for predicting RDoC positive valence psychiatric symptom severity scores.

PubMed

Rios, Anthony; Kavuluru, Ramakanth

2017-11-01

The CEGS N-GRID 2016 Shared Task in Clinical Natural Language Processing (NLP) provided a set of 1000 neuropsychiatric notes to participants as part of a competition to predict psychiatric symptom severity scores. This paper summarizes our methods, results, and experiences based on our participation in the second track of the shared task. Classical methods of text classification usually fall into one of three problem types: binary, multi-class, and multi-label classification. In this effort, we study ordinal regression problems with text data where misclassifications are penalized differently based on how far apart the ground truth and model predictions are on the ordinal scale. Specifically, we present our entries (methods and results) in the N-GRID shared task in predicting research domain criteria (RDoC) positive valence ordinal symptom severity scores (absent, mild, moderate, and severe) from psychiatric notes. We propose a novel convolutional neural network (CNN) model designed to handle ordinal regression tasks on psychiatric notes. Broadly speaking, our model combines an ordinal loss function, a CNN, and conventional feature engineering (wide features) into a single model which is learned end-to-end. Given interpretability is an important concern with nonlinear models, we apply a recent approach called locally interpretable model-agnostic explanation (LIME) to identify important words that lead to instance specific predictions. Our best model entered into the shared task placed third among 24 teams and scored a macro mean absolute error (MMAE) based normalized score (100·(1-MMAE)) of 83.86. Since the competition, we improved our score (using basic ensembling) to 85.55, comparable with the winning shared task entry. Applying LIME to model predictions, we demonstrate the feasibility of instance specific prediction interpretation by identifying words that led to a particular decision. In this paper, we present a method that successfully uses wide features and an ordinal loss function applied to convolutional neural networks for ordinal text classification specifically in predicting psychiatric symptom severity scores. Our approach leads to excellent performance on the N-GRID shared task and is also amenable to interpretability using existing model-agnostic approaches. Copyright © 2017 Elsevier Inc. All rights reserved.

Benchmark gamma-ray skyshine experiment

DOE Office of Scientific and Technical Information (OSTI.GOV)

Nason, R.R.; Shultis, J.K.; Faw, R.E.

1982-01-01

A benchmark gamma-ray skyshine experiment is descibed in which /sup 60/Co sources were either collimated into an upward 150-deg conical beam or shielded vertically by two different thicknesses of concrete. A NaI(Tl) spectrometer and a high pressure ion chamber were used to measure, respectively, the energy spectrum and the 4..pi..-exposure rate of the air-reflected gamma photons up to 700 m from the source. Analyses of the data and comparison to DOT discrete ordinates calculations are presented.

S4 solution of the transport equation for eigenvalues using Legendre polynomials

NASA Astrophysics Data System (ADS)

Öztürk, Hakan; Bülbül, Ahmet

2017-09-01

Numerical solution of the transport equation for monoenergetic neutrons scattered isotropically through the medium of a finite homogeneous slab is studied for the determination of the eigenvalues. After obtaining the discrete ordinates form of the transport equation, separated homogeneous and particular solutions are formed and then the eigenvalues are calculated using the Gauss-Legendre quadrature set. Then, the calculated eigenvalues for various values of the c0, the mean number of secondary neutrons per collision, are given in the tables.

APC: A New Code for Atmospheric Polarization Computations

NASA Technical Reports Server (NTRS)

Korkin, Sergey V.; Lyapustin, Alexei I.; Rozanov, Vladimir V.

2014-01-01

A new polarized radiative transfer code Atmospheric Polarization Computations (APC) is described. The code is based on separation of the diffuse light field into anisotropic and smooth (regular) parts. The anisotropic part is computed analytically. The smooth regular part is computed numerically using the discrete ordinates method. Vertical stratification of the atmosphere, common types of bidirectional surface reflection and scattering by spherical particles or spheroids are included. A particular consideration is given to computation of the bidirectional polarization distribution function (BPDF) of the waved ocean surface.

Automated Weight-Window Generation for Threat Detection Applications Using ADVANTG

DOE Office of Scientific and Technical Information (OSTI.GOV)

Mosher, Scott W; Miller, Thomas Martin; Evans, Thomas M

2009-01-01

Deterministic transport codes have been used for some time to generate weight-window parameters that can improve the efficiency of Monte Carlo simulations. As the use of this hybrid computational technique is becoming more widespread, the scope of applications in which it is being applied is expanding. An active source of new applications is the field of homeland security--particularly the detection of nuclear material threats. For these problems, automated hybrid methods offer an efficient alternative to trial-and-error variance reduction techniques (e.g., geometry splitting or the stochastic weight window generator). The ADVANTG code has been developed to automate the generation of weight-windowmore » parameters for MCNP using the Consistent Adjoint Driven Importance Sampling method and employs the TORT or Denovo 3-D discrete ordinates codes to generate importance maps. In this paper, we describe the application of ADVANTG to a set of threat-detection simulations. We present numerical results for an 'active-interrogation' problem in which a standard cargo container is irradiated by a deuterium-tritium fusion neutron generator. We also present results for two passive detection problems in which a cargo container holding a shielded neutron or gamma source is placed near a portal monitor. For the passive detection problems, ADVANTG obtains an O(10{sup 4}) speedup and, for a detailed gamma spectrum tally, an average O(10{sup 2}) speedup relative to implicit-capture-only simulations, including the deterministic calculation time. For the active-interrogation problem, an O(10{sup 4}) speedup is obtained when compared to a simulation with angular source biasing and crude geometry splitting.« less

Cost-sensitive AdaBoost algorithm for ordinal regression based on extreme learning machine.

PubMed

Riccardi, Annalisa; Fernández-Navarro, Francisco; Carloni, Sante

2014-10-01

In this paper, the well known stagewise additive modeling using a multiclass exponential (SAMME) boosting algorithm is extended to address problems where there exists a natural order in the targets using a cost-sensitive approach. The proposed ensemble model uses an extreme learning machine (ELM) model as a base classifier (with the Gaussian kernel and the additional regularization parameter). The closed form of the derived weighted least squares problem is provided, and it is employed to estimate analytically the parameters connecting the hidden layer to the output layer at each iteration of the boosting algorithm. Compared to the state-of-the-art boosting algorithms, in particular those using ELM as base classifier, the suggested technique does not require the generation of a new training dataset at each iteration. The adoption of the weighted least squares formulation of the problem has been presented as an unbiased and alternative approach to the already existing ELM boosting techniques. Moreover, the addition of a cost model for weighting the patterns, according to the order of the targets, enables the classifier to tackle ordinal regression problems further. The proposed method has been validated by an experimental study by comparing it with already existing ensemble methods and ELM techniques for ordinal regression, showing competitive results.

Radiative albedo from a linearly fibered half-space

NASA Astrophysics Data System (ADS)

Grzesik, J. A.

2018-05-01

A growing acceptance of fiber-reinforced composite materials imparts some relevance to exploring the effects which a predominantly linear scattering lattice may have upon interior radiative transport. Indeed, a central feature of electromagnetic wave propagation within such a lattice, if sufficiently dilute, is ray confinement to cones whose half-angles are set by that between lattice and the incident ray. When such propagation is subordinated to a viewpoint of an unpolarized intensity transport, one arrives at a somewhat simplified variant of the Boltzmann equation with spherical scattering demoted to its cylindrical counterpart. With a view to initiating a hopefully wider discussion of such phenomena, we follow through in detail the half-space albedo problem. This is done first along canonical lines that harness the Wiener-Hopf technique, and then once more in a discrete ordinates setting via flux decomposition along the eigenbasis of the underlying attenuation/scattering matrix. Good agreement is seen to prevail. We further suggest that the Case singular eigenfunction apparatus could likewise be evolved here in close analogy to its original, spherical scattering model. A cursory contact with related problems in the astrophysical literature suggests, in addition, that the basic physical fidelity of our scalar radiative transfer equation (RTE) remains open to improvement by passage to a (4×1) Stokes vector, (4×4) matricial setting.

Extension of the Bgl Broad Group Cross Section Library

NASA Astrophysics Data System (ADS)

Kirilova, Desislava; Belousov, Sergey; Ilieva, Krassimira

2009-08-01

The broad group cross-section libraries BUGLE and BGL are applied for reactor shielding calculation using the DOORS package based on discrete ordinates method and multigroup approximation of the neutron cross-sections. BUGLE and BGL libraries are problem oriented for PWR or VVER type of reactors respectively. They had been generated by collapsing the problem independent fine group library VITAMIN-B6 applying PWR and VVER one-dimensional radial model of the reactor middle plane using the SCALE software package. The surveillance assemblies (SA) of VVER-1000/320 are located on the baffle above the reactor core upper edge in a region where geometry and materials differ from those of the middle plane and the neutron field gradient is very high which would result in a different neutron spectrum. That is why the application of the fore-mentioned libraries for the neutron fluence calculation in the region of SA could lead to an additional inaccuracy. This was the main reason to study the necessity for an extension of the BGL library with cross-sections appropriate for the SA region. Comparative analysis of the neutron spectra of the SA region calculated by the VITAMIN-B6 and BGL libraries using the two-dimensional code DORT have been done with purpose to evaluate the BGL applicability for SA calculation.

Internet-Based Recording Service Solves Maintenance Reporting Problems.

ERIC Educational Resources Information Center

Noah, Marilyn

2001-01-01

Details the response to a health threat caused by illegal wastewater disposal in Wisconsin. Traces the identification of the problem, ordinances and policies adopted to guide the remedy, and subsequent monitoring of environmental quality. (DDR)

High performance computation of radiative transfer equation using the finite element method

NASA Astrophysics Data System (ADS)

Badri, M. A.; Jolivet, P.; Rousseau, B.; Favennec, Y.

2018-05-01

This article deals with an efficient strategy for numerically simulating radiative transfer phenomena using distributed computing. The finite element method alongside the discrete ordinate method is used for spatio-angular discretization of the monochromatic steady-state radiative transfer equation in an anisotropically scattering media. Two very different methods of parallelization, angular and spatial decomposition methods, are presented. To do so, the finite element method is used in a vectorial way. A detailed comparison of scalability, performance, and efficiency on thousands of processors is established for two- and three-dimensional heterogeneous test cases. Timings show that both algorithms scale well when using proper preconditioners. It is also observed that our angular decomposition scheme outperforms our domain decomposition method. Overall, we perform numerical simulations at scales that were previously unattainable by standard radiative transfer equation solvers.

3D numerical modelling of the propagation of radiative intensity through a X-ray tomographied ligament

NASA Astrophysics Data System (ADS)

Le Hardy, David; Badri, Mohd Afeef; Rousseau, Benoit; Chupin, Sylvain; Rochais, Denis; Favennec, Yann

2017-06-01

In order to explain the macroscopic radiative behaviour of an open-cell ceramic foam, knowledge of its solid phase distribution in space and the radiative contributions by this solid phase is required. The solid phase in an open-cell ceramic foam is arranged as a porous skeleton, which is itself composed of an interconnected network of ligament. Typically, ligaments being based on the assembly of grains more or less compacted, exhibit an anisotropic geometry with a concave cross section having a lateral size of one hundred microns. Therefore, ligaments are likely to emit, absorb and scatter thermal radiation. This framework explains why experimental investigations at this scale must be developed to extract accurate homogenized radiative properties regardless the shape and size of ligaments. To support this development, a 3D numerical investigation of the radiative intensity propagation through a real world ligament, beforehand scanned by X-Ray micro-tomography, is presented in this paper. The Radiative Transfer Equation (RTE), applied to the resulting meshed volume, is solved by combining Discrete Ordinate Method (DOM) and Streamline upwind Petrov-Garlekin (SUPG) numerical scheme. A particular attention is paid to propose an improved discretization procedure (spatial and angular) based on ordinate parallelization with the aim to reach fast convergence. Towards the end of this article, we present the effects played by the local radiative properties of three ceramic materials (silicon carbide, alumina and zirconia), which are often used for designing open-cell refractory ceramic foams.

A New Analysis of the Spectra Obtained by the Venera Missions in the Venusian Atmosphere. I. The Analysis of the Data Received from the Venera-11 Probe at Altitudes Below 37 km in the 0.44 0.66 µm Wavelength Range

NASA Astrophysics Data System (ADS)

Maiorov, B. S.; Ignat'ev, N. I.; Moroz, V. I.; Zasova, L. V.; Moshkin, B. E.; Khatuntsev, I. V.; Ekonomov, A. P.

2005-07-01

The processes of the solar radiation extinction in deep layers of the Venus atmosphere in a wavelength range from 0.44 to 0.66 µm have been considered. The spectra of the solar radiation scattered in the atmosphere of Venus at various altitudes above the planetary surface measured by the Venera-11 entry probe in December 1978 are used as observational data. The problem of the data analysis is solved by selecting an atmospheric model; the discrete-ordinate method is applied in calculations. For the altitude interval from 2 10 km to 36 km, the altitude and spectral dependencies of the volume coefficient of true absorption have been obtained. At altitudes of 3 19 km, the spectral dependence is close to the wavelength dependence of the absorption cross section of S3 molecules, whence it follows that the mixing ratio of this sulfur allotrope increases with altitude from 0.03 to 0.1 ppbv.

Numerical solutions of the semiclassical Boltzmann ellipsoidal-statistical kinetic model equation

PubMed Central

Yang, Jaw-Yen; Yan, Chin-Yuan; Huang, Juan-Chen; Li, Zhihui

2014-01-01

Computations of rarefied gas dynamical flows governed by the semiclassical Boltzmann ellipsoidal-statistical (ES) kinetic model equation using an accurate numerical method are presented. The semiclassical ES model was derived through the maximum entropy principle and conserves not only the mass, momentum and energy, but also contains additional higher order moments that differ from the standard quantum distributions. A different decoding procedure to obtain the necessary parameters for determining the ES distribution is also devised. The numerical method in phase space combines the discrete-ordinate method in momentum space and the high-resolution shock capturing method in physical space. Numerical solutions of two-dimensional Riemann problems for two configurations covering various degrees of rarefaction are presented and various contours of the quantities unique to this new model are illustrated. When the relaxation time becomes very small, the main flow features a display similar to that of ideal quantum gas dynamics, and the present solutions are found to be consistent with existing calculations for classical gas. The effect of a parameter that permits an adjustable Prandtl number in the flow is also studied. PMID:25104904

Numerical solutions of ideal quantum gas dynamical flows governed by semiclassical ellipsoidal-statistical distribution

PubMed Central

Yang, Jaw-Yen; Yan, Chih-Yuan; Diaz, Manuel; Huang, Juan-Chen; Li, Zhihui; Zhang, Hanxin

2014-01-01

The ideal quantum gas dynamics as manifested by the semiclassical ellipsoidal-statistical (ES) equilibrium distribution derived in Wu et al. (Wu et al. 2012 Proc. R. Soc. A 468, 1799–1823 (doi:10.1098/rspa.2011.0673)) is numerically studied for particles of three statistics. This anisotropic ES equilibrium distribution was derived using the maximum entropy principle and conserves the mass, momentum and energy, but differs from the standard Fermi–Dirac or Bose–Einstein distribution. The present numerical method combines the discrete velocity (or momentum) ordinate method in momentum space and the high-resolution shock-capturing method in physical space. A decoding procedure to obtain the necessary parameters for determining the ES distribution is also devised. Computations of two-dimensional Riemann problems are presented, and various contours of the quantities unique to this ES model are illustrated. The main flow features, such as shock waves, expansion waves and slip lines and their complex nonlinear interactions, are depicted and found to be consistent with existing calculations for a classical gas. PMID:24399919

An interactive approach based on a discrete differential evolution algorithm for a class of integer bilevel programming problems

NASA Astrophysics Data System (ADS)

Li, Hong; Zhang, Li; Jiao, Yong-Chang

2016-07-01

This paper presents an interactive approach based on a discrete differential evolution algorithm to solve a class of integer bilevel programming problems, in which integer decision variables are controlled by an upper-level decision maker and real-value or continuous decision variables are controlled by a lower-level decision maker. Using the Karush--Kuhn-Tucker optimality conditions in the lower-level programming, the original discrete bilevel formulation can be converted into a discrete single-level nonlinear programming problem with the complementarity constraints, and then the smoothing technique is applied to deal with the complementarity constraints. Finally, a discrete single-level nonlinear programming problem is obtained, and solved by an interactive approach. In each iteration, for each given upper-level discrete variable, a system of nonlinear equations including the lower-level variables and Lagrange multipliers is solved first, and then a discrete nonlinear programming problem only with inequality constraints is handled by using a discrete differential evolution algorithm. Simulation results show the effectiveness of the proposed approach.

Inferring network structure in non-normal and mixed discrete-continuous genomic data.

PubMed

Bhadra, Anindya; Rao, Arvind; Baladandayuthapani, Veerabhadran

2018-03-01

Inferring dependence structure through undirected graphs is crucial for uncovering the major modes of multivariate interaction among high-dimensional genomic markers that are potentially associated with cancer. Traditionally, conditional independence has been studied using sparse Gaussian graphical models for continuous data and sparse Ising models for discrete data. However, there are two clear situations when these approaches are inadequate. The first occurs when the data are continuous but display non-normal marginal behavior such as heavy tails or skewness, rendering an assumption of normality inappropriate. The second occurs when a part of the data is ordinal or discrete (e.g., presence or absence of a mutation) and the other part is continuous (e.g., expression levels of genes or proteins). In this case, the existing Bayesian approaches typically employ a latent variable framework for the discrete part that precludes inferring conditional independence among the data that are actually observed. The current article overcomes these two challenges in a unified framework using Gaussian scale mixtures. Our framework is able to handle continuous data that are not normal and data that are of mixed continuous and discrete nature, while still being able to infer a sparse conditional sign independence structure among the observed data. Extensive performance comparison in simulations with alternative techniques and an analysis of a real cancer genomics data set demonstrate the effectiveness of the proposed approach. © 2017, The International Biometric Society.

Inferring network structure in non-normal and mixed discrete-continuous genomic data

PubMed Central

Bhadra, Anindya; Rao, Arvind; Baladandayuthapani, Veerabhadran

2017-01-01

Inferring dependence structure through undirected graphs is crucial for uncovering the major modes of multivariate interaction among high-dimensional genomic markers that are potentially associated with cancer. Traditionally, conditional independence has been studied using sparse Gaussian graphical models for continuous data and sparse Ising models for discrete data. However, there are two clear situations when these approaches are inadequate. The first occurs when the data are continuous but display non-normal marginal behavior such as heavy tails or skewness, rendering an assumption of normality inappropriate. The second occurs when a part of the data is ordinal or discrete (e.g., presence or absence of a mutation) and the other part is continuous (e.g., expression levels of genes or proteins). In this case, the existing Bayesian approaches typically employ a latent variable framework for the discrete part that precludes inferring conditional independence among the data that are actually observed. The current article overcomes these two challenges in a unified framework using Gaussian scale mixtures. Our framework is able to handle continuous data that are not normal and data that are of mixed continuous and discrete nature, while still being able to infer a sparse conditional sign independence structure among the observed data. Extensive performance comparison in simulations with alternative techniques and an analysis of a real cancer genomics data set demonstrate the effectiveness of the proposed approach. PMID:28437848

Municipalities' Priority Problems and Prospect of Establishing Ordinance to Measures for Marginal Hamlets

NASA Astrophysics Data System (ADS)

Nakanishi, Mayumi; Hoshino, Satoshi; Hashimoto, Shizuka; Kuki, Yasuaki

The problems of Marginal Hamlets are getting worse, in which more than half of the population is over 65 and community-based life is difficult. To contribute to effective policy making, we conducted a questionnaire survey to members of the National Liaison Council of ‘Suigen no Sato’ constituted to share information about problems and effective counter measures for marginal hamlets. Our study clarified that first, most of respondents had common problems such as lack of job-opportunities and animal damage on farm, and second, though most of respondents recognized the effectiveness of selecting target communities in policy implementations, it is difficult for municipal governments to establish such ordinance provided that councilors and those who were not living in areas of policy target wouldn't agree with it. Finally, we pointed out the roles of national and prefectural governments to help municipal governments effectively cope with such entangled situations.

Legislations combating counterfeit drugs in Hong Kong.

PubMed

Lai, C W; Chan, W K

2013-08-01

To understand legislation combating counterfeit drugs in Hong Kong. This study consisted of two parts. In part I, counterfeit drugs–related ordinances and court cases were reviewed. In part II, indepth interviews of the stakeholders were described. Hong Kong. All Hong Kong ordinances were screened manually to identify those combating counterfeit drugs. Court cases were searched for each of the identified cases. Then, the relevant judgement justifications were analysed to identify sentencing issues. Indepth interviews with the stakeholders were conducted to understand their perceptions about such legislation. Trade Marks Ordinance, Patents Ordinance, Trade Descriptions Ordinance, and Pharmacy and Poisons Ordinance were current legislative items combating counterfeit drugs. Sentencing criteria depended on: intention to deceive, quantity of seized drugs, presence of expected therapeutic effect or toxic ingredients, previous criminal records, cooperativeness with Customs officers, honest confessions, pleas of guilty, types of drugs, and precautionary measures to prevent sale of counterfeit drugs. Stakeholders’ perceptions were explored with respect to legislation regarding the scale and significance of the counterfeit drug problem, penalties and deterrents, drug-specific legislation and authority, and inspections and enforcement. To plug the loopholes, a specific law with heavy penalties should be adopted. This could be supplemented by non-legal measures like education of judges, lawyers, and the public; publishing the names of offending pharmacies; and emphasising the role of pharmacists to the public.

Discrete-continuous variable structural synthesis using dual methods

NASA Technical Reports Server (NTRS)

Schmit, L. A.; Fleury, C.

1980-01-01

Approximation concepts and dual methods are extended to solve structural synthesis problems involving a mix of discrete and continuous sizing type of design variables. Pure discrete and pure continuous variable problems can be handled as special cases. The basic mathematical programming statement of the structural synthesis problem is converted into a sequence of explicit approximate primal problems of separable form. These problems are solved by constructing continuous explicit dual functions, which are maximized subject to simple nonnegativity constraints on the dual variables. A newly devised gradient projection type of algorithm called DUAL 1, which includes special features for handling dual function gradient discontinuities that arise from the discrete primal variables, is used to find the solution of each dual problem. Computational implementation is accomplished by incorporating the DUAL 1 algorithm into the ACCESS 3 program as a new optimizer option. The power of the method set forth is demonstrated by presenting numerical results for several example problems, including a pure discrete variable treatment of a metallic swept wing and a mixed discrete-continuous variable solution for a thin delta wing with fiber composite skins.

Tycho 2: A Proxy Application for Kinetic Transport Sweeps

DOE Office of Scientific and Technical Information (OSTI.GOV)

Garrett, Charles Kristopher; Warsa, James S.

2016-09-14

Tycho 2 is a proxy application that implements discrete ordinates (SN) kinetic transport sweeps on unstructured, 3D, tetrahedral meshes. It has been designed to be small and require minimal dependencies to make collaboration and experimentation as easy as possible. Tycho 2 has been released as open source software. The software is currently in a beta release with plans for a stable release (version 1.0) before the end of the year. The code is parallelized via MPI across spatial cells and OpenMP across angles. Currently, several parallelization algorithms are implemented.

Ray Effect Mitigation Through Reference Frame Rotation

DOE PAGES

Tencer, John

2016-05-01

The discrete ordinates method is a popular and versatile technique for solving the radiative transport equation, a major drawback of which is the presence of ray effects. Mitigation of ray effects can yield significantly more accurate results and enhanced numerical stability for combined mode codes. Moreover, when ray effects are present, the solution is seen to be highly dependent upon the relative orientation of the geometry and the global reference frame. It is an undesirable property. A novel ray effect mitigation technique of averaging the computed solution for various reference frame orientations is proposed.

An S N Algorithm for Modern Architectures

DOE Office of Scientific and Technical Information (OSTI.GOV)

Baker, Randal Scott

2016-08-29

LANL discrete ordinates transport packages are required to perform large, computationally intensive time-dependent calculations on massively parallel architectures, where even a single such calculation may need many months to complete. While KBA methods scale out well to very large numbers of compute nodes, we are limited by practical constraints on the number of such nodes we can actually apply to any given calculation. Instead, we describe a modified KBA algorithm that allows realization of the reductions in solution time offered by both the current, and future, architectural changes within a compute node.

Shielding Analyses for VISION Beam Line at SNS

DOE Office of Scientific and Technical Information (OSTI.GOV)

Popova, Irina; Gallmeier, Franz X

2014-01-01

Full-scale neutron and gamma transport analyses were performed to design shielding around the VISION beam line, instrument shielding enclosure, beam stop, secondary shutter including a temporary beam stop for the still closed neighboring beam line to meet requirement is to achieve dose rates below 0.25 mrem/h at 30 cm from the shielding surface. The beam stop and the temporary beam stop analyses were performed with the discrete ordinate code DORT additionally to Monte Carlo analyses with the MCNPX code. Comparison of the results is presented.

Flow of rarefied gases over two-dimensional bodies

NASA Technical Reports Server (NTRS)

Jeng, Duen-Ren; De Witt, Kenneth J.; Keith, Theo G., Jr.; Chung, Chan-Hong

1989-01-01

A kinetic-theory analysis is made of the flow of rarefied gases over two-dimensional bodies of arbitrary curvature. The Boltzmann equation simplified by a model collision integral is written in an arbitrary orthogonal curvilinear coordinate system, and solved by means of finite-difference approximation with the discrete ordinate method. A numerical code is developed which can be applied to any two-dimensional submerged body of arbitrary curvature for the flow regimes from free-molecular to slip at transonic Mach numbers. Predictions are made for the case of a right circular cylinder.

Skyshine radiation from a pressurized water reactor containment dome

DOE Office of Scientific and Technical Information (OSTI.GOV)

Peng, W.H.

1986-06-01

The radiation dose rates resulting from airborne activities inside a postaccident pressurized water reactor containment are calculated by a discrete ordinates/Monte Carlo combined method. The calculated total dose rates and the skyshine component are presented as a function of distance from the containment at three different elevations for various gamma-ray source energies. The one-dimensional (ANISN code) is used to approximate the skyshine dose rates from the hemisphere dome, and the results are compared favorably to more rigorous results calculated by a three-dimensional Monte Carlo code.

Prompting children to reason proportionally: Processing discrete units as continuous amounts.

PubMed

Boyer, Ty W; Levine, Susan C

2015-05-01

Recent studies reveal that children can solve proportional reasoning problems presented with continuous amounts that enable intuitive strategies by around 6 years of age but have difficulties with problems presented with discrete units that tend to elicit explicit count-and-match strategies until at least 10 years of age. The current study tests whether performance on discrete unit problems might be improved by prompting intuitive reasoning with continuous-format problems. Participants were kindergarten, second-grade, and fourth-grade students (N = 194) assigned to either an experimental condition, where they were given continuous amount proportion problems before discrete unit proportion problems, or a control condition, where they were given all discrete unit problems. Results of a three-way mixed-model analysis of variance examining school grade, experimental condition, and block of trials indicated that fourth-grade students in the experimental condition outperformed those in the control condition on discrete unit problems in the second half of the experiment, but kindergarten and second-grade students did not differ by condition. This suggests that older children can be prompted to use intuitive strategies to reason proportionally. (c) 2015 APA, all rights reserved).

Properties of wavelet discretization of Black-Scholes equation

NASA Astrophysics Data System (ADS)

Finěk, Václav

2017-07-01

Using wavelet methods, the continuous problem is transformed into a well-conditioned discrete problem. And once a non-symmetric problem is given, squaring yields a symmetric positive definite formulation. However squaring usually makes the condition number of discrete problems substantially worse. This note is concerned with a wavelet based numerical solution of the Black-Scholes equation for pricing European options. We show here that in wavelet coordinates a symmetric part of the discretized equation dominates over an unsymmetric part in the standard economic environment with low interest rates. It provides some justification for using a fractional step method with implicit treatment of the symmetric part of the weak form of the Black-Scholes operator and with explicit treatment of its unsymmetric part. Then a well-conditioned discrete problem is obtained.

Utilization of the Discrete Differential Evolution for Optimization in Multidimensional Point Clouds.

PubMed

Uher, Vojtěch; Gajdoš, Petr; Radecký, Michal; Snášel, Václav

2016-01-01

The Differential Evolution (DE) is a widely used bioinspired optimization algorithm developed by Storn and Price. It is popular for its simplicity and robustness. This algorithm was primarily designed for real-valued problems and continuous functions, but several modified versions optimizing both integer and discrete-valued problems have been developed. The discrete-coded DE has been mostly used for combinatorial problems in a set of enumerative variants. However, the DE has a great potential in the spatial data analysis and pattern recognition. This paper formulates the problem as a search of a combination of distinct vertices which meet the specified conditions. It proposes a novel approach called the Multidimensional Discrete Differential Evolution (MDDE) applying the principle of the discrete-coded DE in discrete point clouds (PCs). The paper examines the local searching abilities of the MDDE and its convergence to the global optimum in the PCs. The multidimensional discrete vertices cannot be simply ordered to get a convenient course of the discrete data, which is crucial for good convergence of a population. A novel mutation operator utilizing linear ordering of spatial data based on the space filling curves is introduced. The algorithm is tested on several spatial datasets and optimization problems. The experiments show that the MDDE is an efficient and fast method for discrete optimizations in the multidimensional point clouds.

Utilization of the Discrete Differential Evolution for Optimization in Multidimensional Point Clouds

PubMed Central

Radecký, Michal; Snášel, Václav

2016-01-01

The Differential Evolution (DE) is a widely used bioinspired optimization algorithm developed by Storn and Price. It is popular for its simplicity and robustness. This algorithm was primarily designed for real-valued problems and continuous functions, but several modified versions optimizing both integer and discrete-valued problems have been developed. The discrete-coded DE has been mostly used for combinatorial problems in a set of enumerative variants. However, the DE has a great potential in the spatial data analysis and pattern recognition. This paper formulates the problem as a search of a combination of distinct vertices which meet the specified conditions. It proposes a novel approach called the Multidimensional Discrete Differential Evolution (MDDE) applying the principle of the discrete-coded DE in discrete point clouds (PCs). The paper examines the local searching abilities of the MDDE and its convergence to the global optimum in the PCs. The multidimensional discrete vertices cannot be simply ordered to get a convenient course of the discrete data, which is crucial for good convergence of a population. A novel mutation operator utilizing linear ordering of spatial data based on the space filling curves is introduced. The algorithm is tested on several spatial datasets and optimization problems. The experiments show that the MDDE is an efficient and fast method for discrete optimizations in the multidimensional point clouds. PMID:27974884

Discrete bacteria foraging optimization algorithm for graph based problems - a transition from continuous to discrete

NASA Astrophysics Data System (ADS)

Sur, Chiranjib; Shukla, Anupam

2018-03-01

Bacteria Foraging Optimisation Algorithm is a collective behaviour-based meta-heuristics searching depending on the social influence of the bacteria co-agents in the search space of the problem. The algorithm faces tremendous hindrance in terms of its application for discrete problems and graph-based problems due to biased mathematical modelling and dynamic structure of the algorithm. This had been the key factor to revive and introduce the discrete form called Discrete Bacteria Foraging Optimisation (DBFO) Algorithm for discrete problems which exceeds the number of continuous domain problems represented by mathematical and numerical equations in real life. In this work, we have mainly simulated a graph-based road multi-objective optimisation problem and have discussed the prospect of its utilisation in other similar optimisation problems and graph-based problems. The various solution representations that can be handled by this DBFO has also been discussed. The implications and dynamics of the various parameters used in the DBFO are illustrated from the point view of the problems and has been a combination of both exploration and exploitation. The result of DBFO has been compared with Ant Colony Optimisation and Intelligent Water Drops Algorithms. Important features of DBFO are that the bacteria agents do not depend on the local heuristic information but estimates new exploration schemes depending upon the previous experience and covered path analysis. This makes the algorithm better in combination generation for graph-based problems and combination generation for NP hard problems.

Evaluation of the CPU time for solving the radiative transfer equation with high-order resolution schemes applying the normalized weighting-factor method

NASA Astrophysics Data System (ADS)

Xamán, J.; Zavala-Guillén, I.; Hernández-López, I.; Uriarte-Flores, J.; Hernández-Pérez, I.; Macías-Melo, E. V.; Aguilar-Castro, K. M.

2018-03-01

In this paper, we evaluated the convergence rate (CPU time) of a new mathematical formulation for the numerical solution of the radiative transfer equation (RTE) with several High-Order (HO) and High-Resolution (HR) schemes. In computational fluid dynamics, this procedure is known as the Normalized Weighting-Factor (NWF) method and it is adopted here. The NWF method is used to incorporate the high-order resolution schemes in the discretized RTE. The NWF method is compared, in terms of computer time needed to obtain a converged solution, with the widely used deferred-correction (DC) technique for the calculations of a two-dimensional cavity with emitting-absorbing-scattering gray media using the discrete ordinates method. Six parameters, viz. the grid size, the order of quadrature, the absorption coefficient, the emissivity of the boundary surface, the under-relaxation factor, and the scattering albedo are considered to evaluate ten schemes. The results showed that using the DC method, in general, the scheme that had the lowest CPU time is the SOU. In contrast, with the results of theDC procedure the CPU time for DIAMOND and QUICK schemes using the NWF method is shown to be, between the 3.8 and 23.1% faster and 12.6 and 56.1% faster, respectively. However, the other schemes are more time consuming when theNWFis used instead of the DC method. Additionally, a second test case was presented and the results showed that depending on the problem under consideration, the NWF procedure may be computationally faster or slower that the DC method. As an example, the CPU time for QUICK and SMART schemes are 61.8 and 203.7%, respectively, slower when the NWF formulation is used for the second test case. Finally, future researches to explore the computational cost of the NWF method in more complex problems are required.

General Purpose Fortran Program for Discrete-Ordinate-Method Radiative Transfer in Scattering and Emitting Layered Media: An Update of DISORT

NASA Technical Reports Server (NTRS)

Tsay, Si-Chee; Stamnes, Knut; Wiscombe, Warren; Laszlo, Istvan; Einaudi, Franco (Technical Monitor)

2000-01-01

This update reports a state-of-the-art discrete ordinate algorithm for monochromatic unpolarized radiative transfer in non-isothermal, vertically inhomogeneous, but horizontally homogeneous media. The physical processes included are Planckian thermal emission, scattering with arbitrary phase function, absorption, and surface bidirectional reflection. The system may be driven by parallel or isotropic diffuse radiation incident at the top boundary, as well as by internal thermal sources and thermal emission from the boundaries. Radiances, fluxes, and mean intensities are returned at user-specified angles and levels. DISORT has enjoyed considerable popularity in the atmospheric science and other communities since its introduction in 1988. Several new DISORT features are described in this update: intensity correction algorithms designed to compensate for the 8-M forward-peak scaling and obtain accurate intensities even in low orders of approximation; a more general surface bidirectional reflection option; and an exponential-linear approximation of the Planck function allowing more accurate solutions in the presence of large temperature gradients. DISORT has been designed to be an exemplar of good scientific software as well as a program of intrinsic utility. An extraordinary effort has been made to make it numerically well-conditioned, error-resistant, and user-friendly, and to take advantage of robust existing software tools. A thorough test suite is provided to verify the program both against published results, and for consistency where there are no published results. This careful attention to software design has been just as important in DISORT's popularity as its powerful algorithmic content.

Bell-Curve Genetic Algorithm for Mixed Continuous and Discrete Optimization Problems

NASA Technical Reports Server (NTRS)

Kincaid, Rex K.; Griffith, Michelle; Sykes, Ruth; Sobieszczanski-Sobieski, Jaroslaw

2002-01-01

In this manuscript we have examined an extension of BCB that encompasses a mix of continuous and quasi-discrete, as well as truly-discrete applications. FVe began by testing two refinements to the discrete version of BCB. The testing of midpoint versus fitness (Tables 1 and 2) proved inconclusive. The testing of discrete normal tails versus standard mutation showed was conclusive and demonstrated that the discrete normal tails are better. Next, we implemented these refinements in a combined continuous and discrete BCB and compared the performance of two discrete distance on the hub problem. Here we found when "order does matter" it pays to take it into account.

Discrete-Trial Functional Analysis and Functional Communication Training with Three Adults with Intellectual Disabilities and Problem Behavior

ERIC Educational Resources Information Center

Chezan, Laura C.; Drasgow, Erik; Martin, Christian A.

2014-01-01

We conducted a sequence of two studies on the use of discrete-trial functional analysis and functional communication training. First, we used discrete-trial functional analysis (DTFA) to identify the function of problem behavior in three adults with intellectual disabilities and problem behavior. Results indicated clear patterns of problem…

Phase-space finite elements in a least-squares solution of the transport equation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Drumm, C.; Fan, W.; Pautz, S.

2013-07-01

The linear Boltzmann transport equation is solved using a least-squares finite element approximation in the space, angular and energy phase-space variables. The method is applied to both neutral particle transport and also to charged particle transport in the presence of an electric field, where the angular and energy derivative terms are handled with the energy/angular finite elements approximation, in a manner analogous to the way the spatial streaming term is handled. For multi-dimensional problems, a novel approach is used for the angular finite elements: mapping the surface of a unit sphere to a two-dimensional planar region and using a meshingmore » tool to generate a mesh. In this manner, much of the spatial finite-elements machinery can be easily adapted to handle the angular variable. The energy variable and the angular variable for one-dimensional problems make use of edge/beam elements, also building upon the spatial finite elements capabilities. The methods described here can make use of either continuous or discontinuous finite elements in space, angle and/or energy, with the use of continuous finite elements resulting in a smaller problem size and the use of discontinuous finite elements resulting in more accurate solutions for certain types of problems. The work described in this paper makes use of continuous finite elements, so that the resulting linear system is symmetric positive definite and can be solved with a highly efficient parallel preconditioned conjugate gradients algorithm. The phase-space finite elements capability has been built into the Sceptre code and applied to several test problems, including a simple one-dimensional problem with an analytic solution available, a two-dimensional problem with an isolated source term, showing how the method essentially eliminates ray effects encountered with discrete ordinates, and a simple one-dimensional charged-particle transport problem in the presence of an electric field. (authors)« less

Higher modes of the Orr-Sommerfeld problem for boundary layer flows

NASA Technical Reports Server (NTRS)

Lakin, W. D.; Grosch, C. E.

1983-01-01

The discrete spectrum of the Orr-Sommerfeld problem of hydrodynamic stability for boundary layer flows in semi-infinite regions is examined. Related questions concerning the continuous spectrum are also addressed. Emphasis is placed on the stability problem for the Blasius boundary layer profile. A general theoretical result is given which proves that the discrete spectrum of the Orr-Sommerfeld problem for boundary layer profiles (U(y), 0,0) has only a finite number of discrete modes when U(y) has derivatives of all orders. Details are given of a highly accurate numerical technique based on collocation with splines for the calculation of stability characteristics. The technique includes replacement of 'outer' boundary conditions by asymptotic forms based on the proper large parameter in the stability problem. Implementation of the asymptotic boundary conditions is such that there is no need to make apriori distinctions between subcases of the discrete spectrum or between the discrete and continuous spectrums. Typical calculations for the usual Blasius problem are presented.

Graph-cut based discrete-valued image reconstruction.

PubMed

Tuysuzoglu, Ahmet; Karl, W Clem; Stojanovic, Ivana; Castañòn, David; Ünlü, M Selim

2015-05-01

Efficient graph-cut methods have been used with great success for labeling and denoising problems occurring in computer vision. Unfortunately, the presence of linear image mappings has prevented the use of these techniques in most discrete-amplitude image reconstruction problems. In this paper, we develop a graph-cut based framework for the direct solution of discrete amplitude linear image reconstruction problems cast as regularized energy function minimizations. We first analyze the structure of discrete linear inverse problem cost functions to show that the obstacle to the application of graph-cut methods to their solution is the variable mixing caused by the presence of the linear sensing operator. We then propose to use a surrogate energy functional that overcomes the challenges imposed by the sensing operator yet can be utilized efficiently in existing graph-cut frameworks. We use this surrogate energy functional to devise a monotonic iterative algorithm for the solution of discrete valued inverse problems. We first provide experiments using local convolutional operators and show the robustness of the proposed technique to noise and stability to changes in regularization parameter. Then we focus on nonlocal, tomographic examples where we consider limited-angle data problems. We compare our technique with state-of-the-art discrete and continuous image reconstruction techniques. Experiments show that the proposed method outperforms state-of-the-art techniques in challenging scenarios involving discrete valued unknowns.

Fire Suppression M and S Validation (Status and Challenges), Systems Fire Protection Information Exchange

DTIC Science & Technology

2015-10-14

rate Kinetics •14 Species & 12 reactionsCombustion Model •Participating Media Discrete Ordinate Method •WSG model for CO2, H2O and SootRadiation Model...Inhibition of JP-8 Combustion Physical Acting Agents • Dilute heat • Dilute reactants Ex: water, nitrogen Chemical Acting Agents • Reduce flame...Release; distribution is unlimited 5 Overview of Reduced Kinetics Scheme for FM200 • R1: JP-8 + O2 => CO + CO2 + H2O • R2: CO + O2 <=> CO2 • R3: HFP + JP-8

Implementation of radiation shielding calculation methods. Volume 1: Synopsis of methods and summary of results

NASA Technical Reports Server (NTRS)

Capo, M. A.; Disney, R. K.

1971-01-01

The work performed in the following areas is summarized: (1) Analysis of Realistic nuclear-propelled vehicle was analyzed using the Marshall Space Flight Center computer code package. This code package includes one and two dimensional discrete ordinate transport, point kernel, and single scatter techniques, as well as cross section preparation and data processing codes, (2) Techniques were developed to improve the automated data transfer in the coupled computation method of the computer code package and improve the utilization of this code package on the Univac-1108 computer system. (3) The MSFC master data libraries were updated.

The LBM program at the EPFL/LOTUS Facility

DOE Office of Scientific and Technical Information (OSTI.GOV)

File, J.; Jassby, D.L.; Tsang, F.Y.

1986-11-01

An experimental program of neutron transport studies of the Lithium Blanket Module (LBM) is being carried out with the LOTUS point-neutron source facility at Ecole Polytechnique Federale de Lausanne (EPFL), Switzerland. Preliminary experiments use passive neutron dosimetry within the fuel rods in the LBM central zone, as well as, both thermal extraction and dissolution methods to assay tritium bred in Li/sub 2/O diagnostic wafers and LBM pellets. These measurements are being compared and reconciled with each other and with the predictions of two-dimensional discrete-ordinates and continuous-energy Monte-Carlo analyses of the Lotus/LBM system.

Physiotherapy treatment of the diabetic shoulder: a longitudinal study following patients with diabetes and shoulder pain using a pre-post treatment design.

PubMed

Kyhlbäck, Maria; Schröder Winter, Helena; Thierfelder, Tomas; Söderlund, Anne

2014-01-01

The aim of this study was to describe and evaluate a physiotherapy program targeted to reduce pain intensity and improve the daily functioning of diabetics with shoulder problems. It was hypothesized that patients receiving specific physiotherapy treatment improved more frequently and rapidly than diabetic patients followed up without specific physiotherapeutic intervention. A pre-post treatment design was completed for a group of 10 subjects. The treatment protocol, also applied during the daily activities of the subjects, was aiming at reducing pain intensity and shoulder stiffness and improving impaired functioning in daily activities by muscle relaxation, light-load exercise and enhancing proper shoulder co-ordination. The group analysis showed significant decrease of pain intensity level as well as improved shoulder functioning and sustained level of subject self-efficacy beliefs throughout the study period. The results suggest that it is possible to relieve shoulder pain intensity and improve daily activities of patients with diabetes-related shoulder problems by employing a physiotherapy program focusing on muscle relaxation, light-load exercise and on the enhancement of proper shoulder co-ordination in daily activities. A physiotherapy program can be effective in reducing pain and improving shoulder function in diabetics with shoulder problems. The treatment should focus on muscle relaxation, light-load exercise and on the enhancement of proper shoulder co-ordination in daily activities.

Parental Perceptions and Child Emotional and Behavioral Problems in Autism

ERIC Educational Resources Information Center

Haney, Jolynn L.; Houser, Linda; Cullen, Jennifer A.

2018-01-01

Emotional and behavioral difficulties in children with autism often present problems for families seeking appropriate treatment interventions. Using data from the 2011 Survey of Pathways to Diagnosis and Services, ordinal logistic regression models were used to examine the association between parental perceptions about autism and their reports of…

Shared Memory Parallelism for 3D Cartesian Discrete Ordinates Solver

NASA Astrophysics Data System (ADS)

Moustafa, Salli; Dutka-Malen, Ivan; Plagne, Laurent; Ponçot, Angélique; Ramet, Pierre

2014-06-01

This paper describes the design and the performance of DOMINO, a 3D Cartesian SN solver that implements two nested levels of parallelism (multicore+SIMD) on shared memory computation nodes. DOMINO is written in C++, a multi-paradigm programming language that enables the use of powerful and generic parallel programming tools such as Intel TBB and Eigen. These two libraries allow us to combine multi-thread parallelism with vector operations in an efficient and yet portable way. As a result, DOMINO can exploit the full power of modern multi-core processors and is able to tackle very large simulations, that usually require large HPC clusters, using a single computing node. For example, DOMINO solves a 3D full core PWR eigenvalue problem involving 26 energy groups, 288 angular directions (S16), 46 × 106 spatial cells and 1 × 1012 DoFs within 11 hours on a single 32-core SMP node. This represents a sustained performance of 235 GFlops and 40:74% of the SMP node peak performance for the DOMINO sweep implementation. The very high Flops/Watt ratio of DOMINO makes it a very interesting building block for a future many-nodes nuclear simulation tool.

Design Analysis of SNS Target StationBiological Shielding Monoligh with Proton Power Uprate

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bekar, Kursat B.; Ibrahim, Ahmad M.

2017-05-01

This report documents the analysis of the dose rate in the experiment area outside the Spallation Neutron Source (SNS) target station shielding monolith with proton beam energy of 1.3 GeV. The analysis implemented a coupled three dimensional (3D)/two dimensional (2D) approach that used both the Monte Carlo N-Particle Extended (MCNPX) 3D Monte Carlo code and the Discrete Ordinates Transport (DORT) two dimensional deterministic code. The analysis with proton beam energy of 1.3 GeV showed that the dose rate in continuously occupied areas on the lateral surface outside the SNS target station shielding monolith is less than 0.25 mrem/h, which compliesmore » with the SNS facility design objective. However, the methods and codes used in this analysis are out of date and unsupported, and the 2D approximation of the target shielding monolith does not accurately represent the geometry. We recommend that this analysis is updated with modern codes and libraries such as ADVANTG or SHIFT. These codes have demonstrated very high efficiency in performing full 3D radiation shielding analyses of similar and even more difficult problems.« less

Discretization vs. Rounding Error in Euler's Method

ERIC Educational Resources Information Center

Borges, Carlos F.

2011-01-01

Euler's method for solving initial value problems is an excellent vehicle for observing the relationship between discretization error and rounding error in numerical computation. Reductions in stepsize, in order to decrease discretization error, necessarily increase the number of steps and so introduce additional rounding error. The problem is…

A Bell-Curved Based Algorithm for Mixed Continuous and Discrete Structural Optimization

NASA Technical Reports Server (NTRS)

Kincaid, Rex K.; Weber, Michael; Sobieszczanski-Sobieski, Jaroslaw

2001-01-01

An evolutionary based strategy utilizing two normal distributions to generate children is developed to solve mixed integer nonlinear programming problems. This Bell-Curve Based (BCB) evolutionary algorithm is similar in spirit to (mu + mu) evolutionary strategies and evolutionary programs but with fewer parameters to adjust and no mechanism for self adaptation. First, a new version of BCB to solve purely discrete optimization problems is described and its performance tested against a tabu search code for an actuator placement problem. Next, the performance of a combined version of discrete and continuous BCB is tested on 2-dimensional shape problems and on a minimum weight hub design problem. In the latter case the discrete portion is the choice of the underlying beam shape (I, triangular, circular, rectangular, or U).

Quantum algorithm for solving some discrete mathematical problems by probing their energy spectra

NASA Astrophysics Data System (ADS)

Wang, Hefeng; Fan, Heng; Li, Fuli

2014-01-01

When a probe qubit is coupled to a quantum register that represents a physical system, the probe qubit will exhibit a dynamical response only when it is resonant with a transition in the system. Using this principle, we propose a quantum algorithm for solving discrete mathematical problems based on the circuit model. Our algorithm has favorable scaling properties in solving some discrete mathematical problems.

Fractional Programming for Communication Systems—Part II: Uplink Scheduling via Matching

NASA Astrophysics Data System (ADS)

Shen, Kaiming; Yu, Wei

2018-05-01

This two-part paper develops novel methodologies for using fractional programming (FP) techniques to design and optimize communication systems. Part I of this paper proposes a new quadratic transform for FP and treats its application for continuous optimization problems. In this Part II of the paper, we study discrete problems, such as those involving user scheduling, which are considerably more difficult to solve. Unlike the continuous problems, discrete or mixed discrete-continuous problems normally cannot be recast as convex problems. In contrast to the common heuristic of relaxing the discrete variables, this work reformulates the original problem in an FP form amenable to distributed combinatorial optimization. The paper illustrates this methodology by tackling the important and challenging problem of uplink coordinated multi-cell user scheduling in wireless cellular systems. Uplink scheduling is more challenging than downlink scheduling, because uplink user scheduling decisions significantly affect the interference pattern in nearby cells. Further, the discrete scheduling variable needs to be optimized jointly with continuous variables such as transmit power levels and beamformers. The main idea of the proposed FP approach is to decouple the interaction among the interfering links, thereby permitting a distributed and joint optimization of the discrete and continuous variables with provable convergence. The paper shows that the well-known weighted minimum mean-square-error (WMMSE) algorithm can also be derived from a particular use of FP; but our proposed FP-based method significantly outperforms WMMSE when discrete user scheduling variables are involved, both in term of run-time efficiency and optimizing results.

PWR Facility Dose Modeling Using MCNP5 and the CADIS/ADVANTG Variance-Reduction Methodology

DOE Office of Scientific and Technical Information (OSTI.GOV)

Blakeman, Edward D; Peplow, Douglas E.; Wagner, John C

2007-09-01

The feasibility of modeling a pressurized-water-reactor (PWR) facility and calculating dose rates at all locations within the containment and adjoining structures using MCNP5 with mesh tallies is presented. Calculations of dose rates resulting from neutron and photon sources from the reactor (operating and shut down for various periods) and the spent fuel pool, as well as for the photon source from the primary coolant loop, were all of interest. Identification of the PWR facility, development of the MCNP-based model and automation of the run process, calculation of the various sources, and development of methods for visually examining mesh tally filesmore » and extracting dose rates were all a significant part of the project. Advanced variance reduction, which was required because of the size of the model and the large amount of shielding, was performed via the CADIS/ADVANTG approach. This methodology uses an automatically generated three-dimensional discrete ordinates model to calculate adjoint fluxes from which MCNP weight windows and source bias parameters are generated. Investigative calculations were performed using a simple block model and a simplified full-scale model of the PWR containment, in which the adjoint source was placed in various regions. In general, it was shown that placement of the adjoint source on the periphery of the model provided adequate results for regions reasonably close to the source (e.g., within the containment structure for the reactor source). A modification to the CADIS/ADVANTG methodology was also studied in which a global adjoint source is weighted by the reciprocal of the dose response calculated by an earlier forward discrete ordinates calculation. This method showed improved results over those using the standard CADIS/ADVANTG approach, and its further investigation is recommended for future efforts.« less

Solution of the within-group multidimensional discrete ordinates transport equations on massively parallel architectures

NASA Astrophysics Data System (ADS)

Zerr, Robert Joseph

2011-12-01

The integral transport matrix method (ITMM) has been used as the kernel of new parallel solution methods for the discrete ordinates approximation of the within-group neutron transport equation. The ITMM abandons the repetitive mesh sweeps of the traditional source iterations (SI) scheme in favor of constructing stored operators that account for the direct coupling factors among all the cells and between the cells and boundary surfaces. The main goals of this work were to develop the algorithms that construct these operators and employ them in the solution process, determine the most suitable way to parallelize the entire procedure, and evaluate the behavior and performance of the developed methods for increasing number of processes. This project compares the effectiveness of the ITMM with the SI scheme parallelized with the Koch-Baker-Alcouffe (KBA) method. The primary parallel solution method involves a decomposition of the domain into smaller spatial sub-domains, each with their own transport matrices, and coupled together via interface boundary angular fluxes. Each sub-domain has its own set of ITMM operators and represents an independent transport problem. Multiple iterative parallel solution methods have investigated, including parallel block Jacobi (PBJ), parallel red/black Gauss-Seidel (PGS), and parallel GMRES (PGMRES). The fastest observed parallel solution method, PGS, was used in a weak scaling comparison with the PARTISN code. Compared to the state-of-the-art SI-KBA with diffusion synthetic acceleration (DSA), this new method without acceleration/preconditioning is not competitive for any problem parameters considered. The best comparisons occur for problems that are difficult for SI DSA, namely highly scattering and optically thick. SI DSA execution time curves are generally steeper than the PGS ones. However, until further testing is performed it cannot be concluded that SI DSA does not outperform the ITMM with PGS even on several thousand or tens of thousands of processors. The PGS method does outperform SI DSA for the periodic heterogeneous layers (PHL) configuration problems. Although this demonstrates a relative strength/weakness between the two methods, the practicality of these problems is much less, further limiting instances where it would be beneficial to select ITMM over SI DSA. The results strongly indicate a need for a robust, stable, and efficient acceleration method (or preconditioner for PGMRES). The spatial multigrid (SMG) method is currently incomplete in that it does not work for all cases considered and does not effectively improve the convergence rate for all values of scattering ratio c or cell dimension h. Nevertheless, it does display the desired trend for highly scattering, optically thin problems. That is, it tends to lower the rate of growth of number of iterations with increasing number of processes, P, while not increasing the number of additional operations per iteration to the extent that the total execution time of the rapidly converging accelerated iterations exceeds that of the slower unaccelerated iterations. A predictive parallel performance model has been developed for the PBJ method. Timing tests were performed such that trend lines could be fitted to the data for the different components and used to estimate the execution times. Applied to the weak scaling results, the model notably underestimates construction time, but combined with a slight overestimation in iterative solution time, the model predicts total execution time very well for large P. It also does a decent job with the strong scaling results, closely predicting the construction time and time per iteration, especially as P increases. Although not shown to be competitive up to 1,024 processing elements with the current state of the art, the parallelized ITMM exhibits promising scaling trends. Ultimately, compared to the KBA method, the parallelized ITMM may be found to be a very attractive option for transport calculations spatially decomposed over several tens of thousands of processes. Acceleration/preconditioning of the parallelized ITMM once developed will improve the convergence rate and improve its competitiveness. (Abstract shortened by UMI.)

Algorithms for Maneuvering Spacecraft Around Small Bodies

NASA Technical Reports Server (NTRS)

Acikmese, A. Bechet; Bayard, David

2006-01-01

A document describes mathematical derivations and applications of autonomous guidance algorithms for maneuvering spacecraft in the vicinities of small astronomical bodies like comets or asteroids. These algorithms compute fuel- or energy-optimal trajectories for typical maneuvers by solving the associated optimal-control problems with relevant control and state constraints. In the derivations, these problems are converted from their original continuous (infinite-dimensional) forms to finite-dimensional forms through (1) discretization of the time axis and (2) spectral discretization of control inputs via a finite number of Chebyshev basis functions. In these doubly discretized problems, the Chebyshev coefficients are the variables. These problems are, variously, either convex programming problems or programming problems that can be convexified. The resulting discrete problems are convex parameter-optimization problems; this is desirable because one can take advantage of very efficient and robust algorithms that have been developed previously and are well established for solving such problems. These algorithms are fast, do not require initial guesses, and always converge to global optima. Following the derivations, the algorithms are demonstrated by applying them to numerical examples of flyby, descent-to-hover, and ascent-from-hover maneuvers.

Some unsolved problems in discrete mathematics and mathematical cybernetics

NASA Astrophysics Data System (ADS)

Korshunov, Aleksei D.

2009-10-01

There are many unsolved problems in discrete mathematics and mathematical cybernetics. Writing a comprehensive survey of such problems involves great difficulties. First, such problems are rather numerous and varied. Second, they greatly differ from each other in degree of completeness of their solution. Therefore, even a comprehensive survey should not attempt to cover the whole variety of such problems; only the most important and significant problems should be reviewed. An impersonal choice of problems to include is quite hard. This paper includes 13 unsolved problems related to combinatorial mathematics and computational complexity theory. The problems selected give an indication of the author's studies for 50 years; for this reason, the choice of the problems reviewed here is, to some extent, subjective. At the same time, these problems are very difficult and quite important for discrete mathematics and mathematical cybernetics. Bibliography: 74 items.

DSSPcont: continuous secondary structure assignments for proteins

PubMed Central

Carter, Phil; Andersen, Claus A. F.; Rost, Burkhard

2003-01-01

The DSSP program automatically assigns the secondary structure for each residue from the three-dimensional co-ordinates of a protein structure to one of eight states. However, discrete assignments are incomplete in that they cannot capture the continuum of thermal fluctuations. Therefore, DSSPcont (http://cubic.bioc.columbia.edu/services/DSSPcont) introduces a continuous assignment of secondary structure that replaces ‘static’ by ‘dynamic’ states. Technically, the continuum results from calculating weighted averages over 10 discrete DSSP assignments with different hydrogen bond thresholds. A DSSPcont assignment for a particular residue is a percentage likelihood of eight secondary structure states, derived from a weighted average of the ten DSSP assignments. The continuous assignments have two important features: (i) they reflect the structural variations due to thermal fluctuations as detected by NMR spectroscopy; and (ii) they reproduce the structural variation between many NMR models from one single model. Therefore, functionally important variation can be extracted from a single X-ray structure using the continuous assignment procedure. PMID:12824310

Numerical treatment of a geometrically nonlinear planar Cosserat shell model

NASA Astrophysics Data System (ADS)

Sander, Oliver; Neff, Patrizio; Bîrsan, Mircea

2016-05-01

We present a new way to discretize a geometrically nonlinear elastic planar Cosserat shell. The kinematical model is similar to the general six-parameter resultant shell model with drilling rotations. The discretization uses geodesic finite elements (GFEs), which leads to an objective discrete model which naturally allows arbitrarily large rotations. GFEs of any approximation order can be constructed. The resulting algebraic problem is a minimization problem posed on a nonlinear finite-dimensional Riemannian manifold. We solve this problem using a Riemannian trust-region method, which is a generalization of Newton's method that converges globally without intermediate loading steps. We present the continuous model and the discretization, discuss the properties of the discrete model, and show several numerical examples, including wrinkling of thin elastic sheets in shear.

The inverse problem of the calculus of variations for discrete systems

NASA Astrophysics Data System (ADS)

Barbero-Liñán, María; Farré Puiggalí, Marta; Ferraro, Sebastián; Martín de Diego, David

2018-05-01

We develop a geometric version of the inverse problem of the calculus of variations for discrete mechanics and constrained discrete mechanics. The geometric approach consists of using suitable Lagrangian and isotropic submanifolds. We also provide a transition between the discrete and the continuous problems and propose variationality as an interesting geometric property to take into account in the design and computer simulation of numerical integrators for constrained systems. For instance, nonholonomic mechanics is generally non variational but some special cases admit an alternative variational description. We apply some standard nonholonomic integrators to such an example to study which ones conserve this property.

Sibling Ordinal Position and Family Education.

ERIC Educational Resources Information Center

McDonough, James J., Jr.

1978-01-01

Results for the 30 families as seen as "teaching-demonstration" families suggest that Adler's contention that more "first and youngest" children reveal problems and concerns (as defined by their parents) is correct. (Author)

A Summary of Some Discrete-Event System Control Problems

NASA Astrophysics Data System (ADS)

Rudie, Karen

A summary of the area of control of discrete-event systems is given. In this research area, automata and formal language theory is used as a tool to model physical problems that arise in technological and industrial systems. The key ingredients to discrete-event control problems are a process that can be modeled by an automaton, events in that process that cannot be disabled or prevented from occurring, and a controlling agent that manipulates the events that can be disabled to guarantee that the process under control either generates all the strings in some prescribed language or as many strings as possible in some prescribed language. When multiple controlling agents act on a process, decentralized control problems arise. In decentralized discrete-event systems, it is presumed that the agents effecting control cannot each see all event occurrences. Partial observation leads to some problems that cannot be solved in polynomial time and some others that are not even decidable.

Exact Analytical Solutions for Elastodynamic Impact

DTIC Science & Technology

2015-11-30

corroborated by derivation of exact discrete solutions from recursive equations for the impact problems. 15. SUBJECT TERMS One-dimensional impact; Elastic...wave propagation; Laplace transform; Floor function; Discrete solutions 16. SECURITY CLASSIFICATION OF: 17. LIMITATION OF ABSTRACT UU 18...impact Elastic wave propagation Laplace transform Floor function Discrete solutionsWe consider the one-dimensional impact problem in which a semi

A comparison of the scaling properties of the English, Spanish, French, and Chinese EQ-5D descriptive systems.

PubMed

Luo, Nan; Li, Minghui; Chevalier, Julie; Lloyd, Andrew; Herdman, Michael

2013-10-01

To compare the scaling properties of the English, Spanish, French, and Chinese versions of the EQ-5D-3L and EQ-5D-5L descriptive systems. Members of the general populations in the UK, Spain, France, and China were interviewed to measure the severity of health problems represented by the response labels used in the EQ-5D descriptive systems using a visual analog scale. Multiple linear regression models were used to compare the perceived label severity across the four language groups. Severity scores for labels from each EQ-5D-5L dimension scale were compared with each other to assess ordinality. EQ-5D-5L and EQ-5D-3L labels used for describing different levels of health problems were rated differently, while those describing the same level of health problems were rated similarly. For example, the deviation of any group mean from the grand severity mean score for the label 'slight(ly)' was no larger than 5 points on a 0-100 scale for all five EQ-5D dimensions (p > 0.05 for all, t tests). Label ratings violating hypothesized ordinality of the EQ-5D-5L scales were observed in only a small proportion of respondents. Our study provided some preliminary evidence supporting the ordinality and equivalence of the EQ-5D-5L and EQ-5D-3L descriptive systems across four major languages.

Problems encountered with the use of simulation in an attempt to enhance interpretation of a secondary data source in epidemiologic mental health research

PubMed Central

2010-01-01

Background The longitudinal epidemiology of major depressive episodes (MDE) is poorly characterized in most countries. Some potentially relevant data sources may be underutilized because they are not conducive to estimating the most salient epidemiologic parameters. An available data source in Canada provides estimates that are potentially valuable, but that are difficult to apply in clinical or public health practice. For example, weeks depressed in the past year is assessed in this data source whereas episode duration would be of more interest. The goal of this project was to derive, using simulation, more readily interpretable parameter values from the available data. Findings The data source was a Canadian longitudinal study called the National Population Health Survey (NPHS). A simulation model representing the course of depressive episodes was used to reshape estimates deriving from binary and ordinal logistic models (fit to the NPHS data) into equations more capable of informing clinical and public health decisions. Discrete event simulation was used for this purpose. Whereas the intention was to clarify a complex epidemiology, the models themselves needed to become excessively complex in order to provide an accurate description of the data. Conclusions Simulation methods are useful in circumstances where a representation of a real-world system has practical value. In this particular scenario, the usefulness of simulation was limited both by problems with the data source and by inherent complexity of the underlying epidemiology. PMID:20796271

Numerical Computation of Flame Spread over a Thin Solid in Forced Concurrent Flow with Gas-phase Radiation

NASA Technical Reports Server (NTRS)

Jiang, Ching-Biau; T'ien, James S.

1994-01-01

Excerpts from a paper describing the numerical examination of concurrent-flow flame spread over a thin solid in purely forced flow with gas-phase radiation are presented. The computational model solves the two-dimensional, elliptic, steady, and laminar conservation equations for mass, momentum, energy, and chemical species. Gas-phase combustion is modeled via a one-step, second order finite rate Arrhenius reaction. Gas-phase radiation considering gray non-scattering medium is solved by a S-N discrete ordinates method. A simplified solid phase treatment assumes a zeroth order pyrolysis relation and includes radiative interaction between the surface and the gas phase.

Linear Characteristic Spatial Quadrature for Discrete Ordinates Neutral Particle Transport on Arbitrary Triangles

DTIC Science & Technology

1993-06-01

1•) + ) •,(v)(•,L) = ()(Q)+ sEXT (F). (4) The scalar flux, 0, is related to the angular flux, W, by (F)= f (dQ Vh) (5) and the particle current, J...J," v,p’) u +at(U, v) w(u, U, p’)= as(u, v) O(u, v) + SEXT (uv)] (92) 0 Ul,(V) I Assuming the area of the triangle is sufficiently small that cross...M + SEXT () (98) Wvn and WoUT are angular flux averages along the input and output edges, respectively, and are defined by WD Iv = f- ds. V(s.v) (99

Heat Transfer Modelling of Glass Media within TPV Systems

NASA Astrophysics Data System (ADS)

Bauer, Thomas; Forbes, Ian; Penlington, Roger; Pearsall, Nicola

2004-11-01

Understanding and optimisation of heat transfer, and in particular radiative heat transfer in terms of spectral, angular and spatial radiation distributions is important to achieve high system efficiencies and high electrical power densities for thermophtovoltaics (TPV). This work reviews heat transfer models and uses the Discrete Ordinates method. Firstly one-dimensional heat transfer in fused silica (quartz glass) shields was examined for the common arrangement, radiator-air-glass-air-PV cell. It has been concluded that an alternative arrangement radiator-glass-air-PV cell with increased thickness of fused silica should have advantages in terms of improved transmission of convertible radiation and enhanced suppression of non-convertible radiation.

Measurement and modeling of advanced coal conversion processes, Volume II

DOE Office of Scientific and Technical Information (OSTI.GOV)

Solomon, P.R.; Serio, M.A.; Hamblen, D.G.

1993-06-01

A two dimensional, steady-state model for describing a variety of reactive and nonreactive flows, including pulverized coal combustion and gasification, is presented. The model, referred to as 93-PCGC-2 is applicable to cylindrical, axi-symmetric systems. Turbulence is accounted for in both the fluid mechanics equations and the combustion scheme. Radiation from gases, walls, and particles is taken into account using a discrete ordinates method. The particle phase is modeled in a lagrangian framework, such that mean paths of particle groups are followed. A new coal-general devolatilization submodel (FG-DVC) with coal swelling and char reactivity submodels has been added.

Finite element, modal co-ordinate analysis of structures subjected to moving loads

NASA Astrophysics Data System (ADS)

Olsson, M.

1985-03-01

Some of the possibilities of the finite element method in the moving load problem are demonstrated. The bridge-vehicle interaction phenomenon is considered by deriving a general bridge-vehicle element which is believed to be novel. This element may be regarded as a finite element with time-dependent and unsymmetric element matrices. The bridge response is formulated in modal co-ordinates thereby reducing the number of equations to be solved within each time step. Illustrative examples are shown for the special case of a beam bridge model and a one-axle vehicle model.

A Scenario-Based Parametric Analysis of Stable Marriage Approaches to the Army Officer Assignment Problem

DTIC Science & Technology

2017-03-23

solutions obtained through their proposed method to comparative instances of a generalized assignment problem with either ordinal cost components or... method flag: Designates the method by which the changed/ new assignment problem instance is solved. methodFlag = 0:SMAWarmstart Returns a matching...of randomized perturbations. We examine the contrasts between these methods in the context of assigning Army Officers among a set of identified

Development of Proportional Reasoning: Where Young Children Go Wrong

PubMed Central

Boyer, Ty W.; Levine, Susan C.; Huttenlocher, Janellen

2008-01-01

Previous studies have found that children have difficulty solving proportional reasoning problems involving discrete units until 10- to 12-years of age, but can solve parallel problems involving continuous quantities by 6-years of age. The present studies examine where children go wrong in processing proportions that involve discrete quantities. A computerized proportional equivalence choice task was administered to kindergartners through fourth-graders in Study 1, and to first- and third-graders in Study 2. Both studies involved four between-subjects conditions that were formed by pairing continuous and discrete target proportions with continuous and discrete choice alternatives. In Study 1, target and choice alternatives were presented simultaneously and in Study 2 target and choice alternatives were presented sequentially. In both studies, children performed significantly worse when both the target and choice alternatives were represented with discrete quantities than when either or both of the proportions involved continuous quantities. Taken together, these findings indicate that children go astray on proportional reasoning problems involving discrete units only when a numerical match is possible, suggesting that their difficulty is due to an overextension of numerical equivalence concepts to proportional equivalence problems. PMID:18793078

Discrete Time McKean–Vlasov Control Problem: A Dynamic Programming Approach

DOE Office of Scientific and Technical Information (OSTI.GOV)

Pham, Huyên, E-mail: pham@math.univ-paris-diderot.fr; Wei, Xiaoli, E-mail: tyswxl@gmail.com

We consider the stochastic optimal control problem of nonlinear mean-field systems in discrete time. We reformulate the problem into a deterministic control problem with marginal distribution as controlled state variable, and prove that dynamic programming principle holds in its general form. We apply our method for solving explicitly the mean-variance portfolio selection and the multivariate linear-quadratic McKean–Vlasov control problem.

3D-radiative transfer in terrestrial atmosphere: An efficient parallel numerical procedure

NASA Astrophysics Data System (ADS)

Bass, L. P.; Germogenova, T. A.; Nikolaeva, O. V.; Kokhanovsky, A. A.; Kuznetsov, V. S.

2003-04-01

Light propagation and scattering in terrestrial atmosphere is usually studied in the framework of the 1D radiative transfer theory [1]. However, in reality particles (e.g., ice crystals, solid and liquid aerosols, cloud droplets) are randomly distributed in 3D space. In particular, their concentrations vary both in vertical and horizontal directions. Therefore, 3D effects influence modern cloud and aerosol retrieval procedures, which are currently based on the 1D radiative transfer theory. It should be pointed out that the standard radiative transfer equation allows to study these more complex situations as well [2]. In recent year the parallel version of the 2D and 3D RADUGA code has been developed. This version is successfully used in gammas and neutrons transport problems [3]. Applications of this code to radiative transfer in atmosphere problems are contained in [4]. Possibilities of code RADUGA are presented in [5]. The RADUGA code system is an universal solver of radiative transfer problems for complicated models, including 2D and 3D aerosol and cloud fields with arbitrary scattering anisotropy, light absorption, inhomogeneous underlying surface and topography. Both delta type and distributed light sources can be accounted for in the framework of the algorithm developed. The accurate numerical procedure is based on the new discrete ordinate SWDD scheme [6]. The algorithm is specifically designed for parallel supercomputers. The version RADUGA 5.1(P) can run on MBC1000M [7] (768 processors with 10 Gb of hard disc memory for each processor). The peak productivity is equal 1 Tfl. Corresponding scalar version RADUGA 5.1 is working on PC. As a first example of application of the algorithm developed, we have studied the shadowing effects of clouds on neighboring cloudless atmosphere, depending on the cloud optical thickness, surface albedo, and illumination conditions. This is of importance for modern satellite aerosol retrieval algorithms development. [1] Sobolev, V. V., 1972: Light scattering in planetary atmosphere, M.:Nauka. [2] Evans, K. F., 1998: The spherical harmonic discrete ordinate method for three dimensional atmospheric radiative transfer, J. Atmos. Sci., 55, 429 446. [3] L.P. Bass, T.A. Germogenova, V.S. Kuznetsov, O.V. Nikolaeva. RADUGA 5.1 and RADUGA 5.1(P) codes for stationary transport equation solution in 2D and 3D geometries on one and multiprocessors computers. Report on seminar “Algorithms and Codes for neutron physical of nuclear reactor calculations” (Neutronica 2001), Obninsk, Russia, 30 October 2 November 2001. [4] T.A. Germogenova, L.P. Bass, V.S. Kuznetsov, O.V. Nikolaeva. Mathematical modeling on parallel computers solar and laser radiation transport in 3D atmosphere. Report on International Symposium CIS countries “Atmosphere radiation”, 18 21 June 2002, St. Peterburg, Russia, p. 15 16. [5] L.P. Bass, T.A. Germogenova, O.V. Nikolaeva, V.S. Kuznetsov. Radiative Transfer Universal 2D 3D Code RADUGA 5.1(P) for Multiprocessor Computer. Abstract. Poster report on this Meeting. [6] L.P. Bass, O.V. Nikolaeva. Correct calculation of Angular Flux Distribution in Strongly Heterogeneous Media and Voids. Proc. of Joint International Conference on Mathematical Methods and Supercomputing for Nuclear Applications, Saratoga Springs, New York, October 5 9, 1997, p. 995 1004. [7] http://www/jscc.ru

Quadratic constrained mixed discrete optimization with an adiabatic quantum optimizer

NASA Astrophysics Data System (ADS)

Chandra, Rishabh; Jacobson, N. Tobias; Moussa, Jonathan E.; Frankel, Steven H.; Kais, Sabre

2014-07-01

We extend the family of problems that may be implemented on an adiabatic quantum optimizer (AQO). When a quadratic optimization problem has at least one set of discrete controls and the constraints are linear, we call this a quadratic constrained mixed discrete optimization (QCMDO) problem. QCMDO problems are NP-hard, and no efficient classical algorithm for their solution is known. Included in the class of QCMDO problems are combinatorial optimization problems constrained by a linear partial differential equation (PDE) or system of linear PDEs. An essential complication commonly encountered in solving this type of problem is that the linear constraint may introduce many intermediate continuous variables into the optimization while the computational cost grows exponentially with problem size. We resolve this difficulty by developing a constructive mapping from QCMDO to quadratic unconstrained binary optimization (QUBO) such that the size of the QUBO problem depends only on the number of discrete control variables. With a suitable embedding, taking into account the physical constraints of the realizable coupling graph, the resulting QUBO problem can be implemented on an existing AQO. The mapping itself is efficient, scaling cubically with the number of continuous variables in the general case and linearly in the PDE case if an efficient preconditioner is available.

Initial-boundary value problems associated with the Ablowitz-Ladik system

NASA Astrophysics Data System (ADS)

Xia, Baoqiang; Fokas, A. S.

2018-02-01

We employ the Ablowitz-Ladik system as an illustrative example in order to demonstrate how to analyze initial-boundary value problems for integrable nonlinear differential-difference equations via the unified transform (Fokas method). In particular, we express the solutions of the integrable discrete nonlinear Schrödinger and integrable discrete modified Korteweg-de Vries equations in terms of the solutions of appropriate matrix Riemann-Hilbert problems. We also discuss in detail, for both the above discrete integrable equations, the associated global relations and the process of eliminating of the unknown boundary values.

Minimizing the Total Service Time of Discrete Dynamic Berth Allocation Problem by an Iterated Greedy Heuristic

PubMed Central

2014-01-01

Berth allocation is the forefront operation performed when ships arrive at a port and is a critical task in container port optimization. Minimizing the time ships spend at berths constitutes an important objective of berth allocation problems. This study focuses on the discrete dynamic berth allocation problem (discrete DBAP), which aims to minimize total service time, and proposes an iterated greedy (IG) algorithm to solve it. The proposed IG algorithm is tested on three benchmark problem sets. Experimental results show that the proposed IG algorithm can obtain optimal solutions for all test instances of the first and second problem sets and outperforms the best-known solutions for 35 out of 90 test instances of the third problem set. PMID:25295295

Method of grid generation

DOEpatents

Barnette, Daniel W.

2002-01-01

The present invention provides a method of grid generation that uses the geometry of the problem space and the governing relations to generate a grid. The method can generate a grid with minimized discretization errors, and with minimal user interaction. The method of the present invention comprises assigning grid cell locations so that, when the governing relations are discretized using the grid, at least some of the discretization errors are substantially zero. Conventional grid generation is driven by the problem space geometry; grid generation according to the present invention is driven by problem space geometry and by governing relations. The present invention accordingly can provide two significant benefits: more efficient and accurate modeling since discretization errors are minimized, and reduced cost grid generation since less human interaction is required.

Discrete Dynamical Systems Meet the Classic Monkey-and-the-Bananas Problem.

ERIC Educational Resources Information Center

Gannon, Gerald E.; Martelli, Mario U.

2001-01-01

Presents a solution of the three-sailors-and-the-bananas problem and attempts a generalization. Introduces an interesting way of looking at the mathematics with an idea drawn from discrete dynamical systems. (KHR)

Computing the Feasible Spaces of Optimal Power Flow Problems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Molzahn, Daniel K.

The solution to an optimal power flow (OPF) problem provides a minimum cost operating point for an electric power system. The performance of OPF solution techniques strongly depends on the problem’s feasible space. This paper presents an algorithm that is guaranteed to compute the entire feasible spaces of small OPF problems to within a specified discretization tolerance. Specifically, the feasible space is computed by discretizing certain of the OPF problem’s inequality constraints to obtain a set of power flow equations. All solutions to the power flow equations at each discretization point are obtained using the Numerical Polynomial Homotopy Continuation (NPHC)more » algorithm. To improve computational tractability, “bound tightening” and “grid pruning” algorithms use convex relaxations to preclude consideration of many discretization points that are infeasible for the OPF problem. Here, the proposed algorithm is used to generate the feasible spaces of two small test cases.« less

Computing the Feasible Spaces of Optimal Power Flow Problems

DOE PAGES

Molzahn, Daniel K.

2017-03-15

The solution to an optimal power flow (OPF) problem provides a minimum cost operating point for an electric power system. The performance of OPF solution techniques strongly depends on the problem’s feasible space. This paper presents an algorithm that is guaranteed to compute the entire feasible spaces of small OPF problems to within a specified discretization tolerance. Specifically, the feasible space is computed by discretizing certain of the OPF problem’s inequality constraints to obtain a set of power flow equations. All solutions to the power flow equations at each discretization point are obtained using the Numerical Polynomial Homotopy Continuation (NPHC)more » algorithm. To improve computational tractability, “bound tightening” and “grid pruning” algorithms use convex relaxations to preclude consideration of many discretization points that are infeasible for the OPF problem. Here, the proposed algorithm is used to generate the feasible spaces of two small test cases.« less

Discrete-Trial Functional Analysis and Functional Communication Training with Three Individuals with Autism and Severe Problem Behavior

ERIC Educational Resources Information Center

Schmidt, Jonathan D.; Drasgow, Erik; Halle, James W.; Martin, Christian A.; Bliss, Sacha A.

2014-01-01

Discrete-trial functional analysis (DTFA) is an experimental method for determining the variables maintaining problem behavior in the context of natural routines. Functional communication training (FCT) is an effective method for replacing problem behavior, once identified, with a functionally equivalent response. We implemented these procedures…

DOE Office of Scientific and Technical Information (OSTI.GOV)

Favorite, Jeffrey A.

SENSMG is a tool for computing first-order sensitivities of neutron reaction rates, reaction-rate ratios, leakage, k eff, and α using the PARTISN multigroup discrete-ordinates code. SENSMG computes sensitivities to all of the transport cross sections and data (total, fission, nu, chi, and all scattering moments), two edit cross sections (absorption and capture), and the density for every isotope and energy group. It also computes sensitivities to the mass density for every material and derivatives with respect to all interface locations. The tool can be used for one-dimensional spherical (r) and two-dimensional cylindrical (r-z) geometries. The tool can be used formore » fixed-source and eigenvalue problems. The tool implements Generalized Perturbation Theory (GPT) as discussed by Williams and Stacey. Section II of this report describes the theory behind adjoint-based sensitivities, gives the equations that SENSMG solves, and defines the sensitivities that are output. Section III describes the user interface, including the input file and command line options. Section IV describes the output. Section V gives some notes about the coding that may be of interest. Section VI discusses verification, which is ongoing. Section VII lists needs and ideas for future work. Appendix A lists all of the input files whose results are presented in Sec. VI.« less

A new vector radiative transfer model as a part of SCIATRAN 3.0 software package.

NASA Astrophysics Data System (ADS)

Rozanov, Alexei; Rozanov, Vladimir; Burrows, John P.

The SCIATRAN 3.0 package is a result of further development of the SCIATRAN 2.x software family which, similar to previous versions, comprises a radiative transfer model and a retrieval block. A major improvement was achieved in comparison to previous software versions by adding the vector mode to the radiative transfer model. Thus, the well-established Discrete Ordinate solver can now be run in the vector mode to calculate the scattered solar radiation including polarization, i.e., to simulate all four components of the Stockes vector. Similar to the scalar version, the simulations can be performed for any viewing geometry typical for atmospheric observations in the UV-Vis-NIR spectral range (nadir, limb, off-axis, etc.) as well as for any observer position within or outside the Earth's atmosphere. Similar to the precursor version, the new model is freely available for non-commercial use via the web page of the University of Bremen. In this presentation a short description of the software package, especially of the new vector radiative transfer model will be given, including remarks on the availability for the scientific community. Furthermore, comparisons to other vector models will be shown and some example problems will be considered where the polarization of the observed radiation must be accounted for to obtain high quality results.

Discrete Inverse and State Estimation Problems

NASA Astrophysics Data System (ADS)

Wunsch, Carl

2006-06-01

The problems of making inferences about the natural world from noisy observations and imperfect theories occur in almost all scientific disciplines. This book addresses these problems using examples taken from geophysical fluid dynamics. It focuses on discrete formulations, both static and time-varying, known variously as inverse, state estimation or data assimilation problems. Starting with fundamental algebraic and statistical ideas, the book guides the reader through a range of inference tools including the singular value decomposition, Gauss-Markov and minimum variance estimates, Kalman filters and related smoothers, and adjoint (Lagrange multiplier) methods. The final chapters discuss a variety of practical applications to geophysical flow problems. Discrete Inverse and State Estimation Problems is an ideal introduction to the topic for graduate students and researchers in oceanography, meteorology, climate dynamics, and geophysical fluid dynamics. It is also accessible to a wider scientific audience; the only prerequisite is an understanding of linear algebra. Provides a comprehensive introduction to discrete methods of inference from incomplete information Based upon 25 years of practical experience using real data and models Develops sequential and whole-domain analysis methods from simple least-squares Contains many examples and problems, and web-based support through MIT opencourseware

Solving ill-posed control problems by stabilized finite element methods: an alternative to Tikhonov regularization

NASA Astrophysics Data System (ADS)

Burman, Erik; Hansbo, Peter; Larson, Mats G.

2018-03-01

Tikhonov regularization is one of the most commonly used methods for the regularization of ill-posed problems. In the setting of finite element solutions of elliptic partial differential control problems, Tikhonov regularization amounts to adding suitably weighted least squares terms of the control variable, or derivatives thereof, to the Lagrangian determining the optimality system. In this note we show that the stabilization methods for discretely ill-posed problems developed in the setting of convection-dominated convection-diffusion problems, can be highly suitable for stabilizing optimal control problems, and that Tikhonov regularization will lead to less accurate discrete solutions. We consider some inverse problems for Poisson’s equation as an illustration and derive new error estimates both for the reconstruction of the solution from the measured data and reconstruction of the source term from the measured data. These estimates include both the effect of the discretization error and error in the measurements.

Transport synthetic acceleration for long-characteristics assembly-level transport problems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zika, M.R.; Adams, M.L.

2000-02-01

The authors apply the transport synthetic acceleration (TSA) scheme to the long-characteristics spatial discretization for the two-dimensional assembly-level transport problem. This synthetic method employs a simplified transport operator as its low-order approximation. Thus, in the acceleration step, the authors take advantage of features of the long-characteristics discretization that make it particularly well suited to assembly-level transport problems. The main contribution is to address difficulties unique to the long-characteristics discretization and produce a computationally efficient acceleration scheme. The combination of the long-characteristics discretization, opposing reflecting boundary conditions (which are present in assembly-level transport problems), and TSA presents several challenges. The authorsmore » devise methods for overcoming each of them in a computationally efficient way. Since the boundary angular data exist on different grids in the high- and low-order problems, they define restriction and prolongation operations specific to the method of long characteristics to map between the two grids. They implement the conjugate gradient (CG) method in the presence of opposing reflection boundary conditions to solve the TSA low-order equations. The CG iteration may be applied only to symmetric positive definite (SPD) matrices; they prove that the long-characteristics discretization yields an SPD matrix. They present results of the acceleration scheme on a simple test problem, a typical pressurized water reactor assembly, and a typical boiling water reactor assembly.« less

Numerical solution of the time fractional reaction-diffusion equation with a moving boundary

NASA Astrophysics Data System (ADS)

Zheng, Minling; Liu, Fawang; Liu, Qingxia; Burrage, Kevin; Simpson, Matthew J.

2017-06-01

A fractional reaction-diffusion model with a moving boundary is presented in this paper. An efficient numerical method is constructed to solve this moving boundary problem. Our method makes use of a finite difference approximation for the temporal discretization, and spectral approximation for the spatial discretization. The stability and convergence of the method is studied, and the errors of both the semi-discrete and fully-discrete schemes are derived. Numerical examples, motivated by problems from developmental biology, show a good agreement with the theoretical analysis and illustrate the efficiency of our method.

Simultaneous optical flow and source estimation: Space–time discretization and preconditioning

PubMed Central

Andreev, R.; Scherzer, O.; Zulehner, W.

2015-01-01

We consider the simultaneous estimation of an optical flow field and an illumination source term in a movie sequence. The particular optical flow equation is obtained by assuming that the image intensity is a conserved quantity up to possible sources and sinks which represent varying illumination. We formulate this problem as an energy minimization problem and propose a space–time simultaneous discretization for the optimality system in saddle-point form. We investigate a preconditioning strategy that renders the discrete system well-conditioned uniformly in the discretization resolution. Numerical experiments complement the theory. PMID:26435561

Exponential Characteristic Spatial Quadrature for Discrete Ordinates Neutral Particle Transport in Slab Geometry

DTIC Science & Technology

1992-03-01

left bdy = 0 vacuum current incident at left boundary = I type of current incident at left bdy = 0 isotropic surface Src region# cR SigmaR SourceR nc...0 type of current incident at left bdy = 0 isotropic surface Src region# cR SigmaR SourceR nc Right Bdy 1 0.5000 .3OD+00 0.0000D+00 256. 16.0000 2... SigmaR SourceR nc Right Bdy 1 0.1000 1.0000D+00 0.0000D+00 256. 16.0000 2 0.9500 1.0(OOD+00 1.0000D+00 256. 32.0000 type of right bdy = 0 vacuum current

Domain decomposition for a mixed finite element method in three dimensions

USGS Publications Warehouse

Cai, Z.; Parashkevov, R.R.; Russell, T.F.; Wilson, J.D.; Ye, X.

2003-01-01

We consider the solution of the discrete linear system resulting from a mixed finite element discretization applied to a second-order elliptic boundary value problem in three dimensions. Based on a decomposition of the velocity space, these equations can be reduced to a discrete elliptic problem by eliminating the pressure through the use of substructures of the domain. The practicality of the reduction relies on a local basis, presented here, for the divergence-free subspace of the velocity space. We consider additive and multiplicative domain decomposition methods for solving the reduced elliptic problem, and their uniform convergence is established.

Approximation-Based Discrete-Time Adaptive Position Tracking Control for Interior Permanent Magnet Synchronous Motors.

PubMed

Yu, Jinpeng; Shi, Peng; Yu, Haisheng; Chen, Bing; Lin, Chong

2015-07-01

This paper considers the problem of discrete-time adaptive position tracking control for a interior permanent magnet synchronous motor (IPMSM) based on fuzzy-approximation. Fuzzy logic systems are used to approximate the nonlinearities of the discrete-time IPMSM drive system which is derived by direct discretization using Euler method, and a discrete-time fuzzy position tracking controller is designed via backstepping approach. In contrast to existing results, the advantage of the scheme is that the number of the adjustable parameters is reduced to two only and the problem of coupling nonlinearity can be overcome. It is shown that the proposed discrete-time fuzzy controller can guarantee the tracking error converges to a small neighborhood of the origin and all the signals are bounded. Simulation results illustrate the effectiveness and the potentials of the theoretic results obtained.

Multi-level adaptive finite element methods. 1: Variation problems

NASA Technical Reports Server (NTRS)

Brandt, A.

1979-01-01

A general numerical strategy for solving partial differential equations and other functional problems by cycling between coarser and finer levels of discretization is described. Optimal discretization schemes are provided together with very fast general solvers. It is described in terms of finite element discretizations of general nonlinear minimization problems. The basic processes (relaxation sweeps, fine-grid-to-coarse-grid transfers of residuals, coarse-to-fine interpolations of corrections) are directly and naturally determined by the objective functional and the sequence of approximation spaces. The natural processes, however, are not always optimal. Concrete examples are given and some new techniques are reviewed. Including the local truncation extrapolation and a multilevel procedure for inexpensively solving chains of many boundary value problems, such as those arising in the solution of time-dependent problems.

A fast direct solver for boundary value problems on locally perturbed geometries

NASA Astrophysics Data System (ADS)

Zhang, Yabin; Gillman, Adrianna

2018-03-01

Many applications including optimal design and adaptive discretization techniques involve solving several boundary value problems on geometries that are local perturbations of an original geometry. This manuscript presents a fast direct solver for boundary value problems that are recast as boundary integral equations. The idea is to write the discretized boundary integral equation on a new geometry as a low rank update to the discretized problem on the original geometry. Using the Sherman-Morrison formula, the inverse can be expressed in terms of the inverse of the original system applied to the low rank factors and the right hand side. Numerical results illustrate for problems where perturbation is localized the fast direct solver is three times faster than building a new solver from scratch.

Characteristic correlation study of UV disinfection performance for ballast water treatment

NASA Astrophysics Data System (ADS)

Ba, Te; Li, Hongying; Osman, Hafiiz; Kang, Chang-Wei

2016-11-01

Characteristic correlation between ultraviolet disinfection performance and operating parameters, including ultraviolet transmittance (UVT), lamp power and water flow rate, was studied by numerical and experimental methods. A three-stage model was developed to simulate the fluid flow, UV radiation and the trajectories of microorganisms. Navier-Stokes equation with k-epsilon turbulence was solved to model the fluid flow, while discrete ordinates (DO) radiation model and discrete phase model (DPM) were used to introduce UV radiation and microorganisms trajectories into the model, respectively. The UV dose statistical distribution for the microorganisms was found to move to higher value with the increase of UVT and lamp power, but moves to lower value when the water flow rate increases. Further investigation shows that the fluence rate increases exponentially with UVT but linearly with the lamp power. The average and minimum resident time decreases linearly with the water flow rate while the maximum resident time decrease rapidly in a certain range. The current study can be used as a digital design and performance evaluation tool of the UV reactor for ballast water treatment.

The compulsory psychiatric regime in Hong Kong: Constitutional and ethical perspectives.

PubMed

Cheung, Daisy

This article examines the compulsory psychiatric regime in Hong Kong. Under section 36 of the Mental Health Ordinance, which authorises long-term detention of psychiatric patients, a District Judge is required to countersign the form filled out by the registered medical practitioners in order for the detention to be valid. Case law, however, has shown that the role of the District Judge is merely administrative. This article suggests that, as it currently stands, the compulsory psychiatric regime in Hong Kong is unconstitutional because it fails the proportionality test. In light of this conclusion, the author proposes two solutions to deal with the issue, by common law or by legislative reform. The former would see an exercise of discretion by the courts read into section 36, while the latter would involve piecemeal reform of the relevant provisions to give the courts an explicit discretion to consider substantive issues when reviewing compulsory detention applications. The author argues that these solutions would introduce effective judicial supervision into the compulsory psychiatric regime and safeguard against abuse of process. Copyright © 2016 Elsevier Ltd. All rights reserved.

Technical Note: The Initial Stages of Statistical Data Analysis

PubMed Central

Tandy, Richard D.

1998-01-01

Objective: To provide an overview of several important data-related considerations in the design stage of a research project and to review the levels of measurement and their relationship to the statistical technique chosen for the data analysis. Background: When planning a study, the researcher must clearly define the research problem and narrow it down to specific, testable questions. The next steps are to identify the variables in the study, decide how to group and treat subjects, and determine how to measure, and the underlying level of measurement of, the dependent variables. Then the appropriate statistical technique can be selected for data analysis. Description: The four levels of measurement in increasing complexity are nominal, ordinal, interval, and ratio. Nominal data are categorical or “count” data, and the numbers are treated as labels. Ordinal data can be ranked in a meaningful order by magnitude. Interval data possess the characteristics of ordinal data and also have equal distances between levels. Ratio data have a natural zero point. Nominal and ordinal data are analyzed with nonparametric statistical techniques and interval and ratio data with parametric statistical techniques. Advantages: Understanding the four levels of measurement and when it is appropriate to use each is important in determining which statistical technique to use when analyzing data. PMID:16558489

Higher-order adaptive finite-element methods for Kohn–Sham density functional theory

DOE Office of Scientific and Technical Information (OSTI.GOV)

Motamarri, P.; Nowak, M.R.; Leiter, K.

2013-11-15

We present an efficient computational approach to perform real-space electronic structure calculations using an adaptive higher-order finite-element discretization of Kohn–Sham density-functional theory (DFT). To this end, we develop an a priori mesh-adaption technique to construct a close to optimal finite-element discretization of the problem. We further propose an efficient solution strategy for solving the discrete eigenvalue problem by using spectral finite-elements in conjunction with Gauss–Lobatto quadrature, and a Chebyshev acceleration technique for computing the occupied eigenspace. The proposed approach has been observed to provide a staggering 100–200-fold computational advantage over the solution of a generalized eigenvalue problem. Using the proposedmore » solution procedure, we investigate the computational efficiency afforded by higher-order finite-element discretizations of the Kohn–Sham DFT problem. Our studies suggest that staggering computational savings—of the order of 1000-fold—relative to linear finite-elements can be realized, for both all-electron and local pseudopotential calculations, by using higher-order finite-element discretizations. On all the benchmark systems studied, we observe diminishing returns in computational savings beyond the sixth-order for accuracies commensurate with chemical accuracy, suggesting that the hexic spectral-element may be an optimal choice for the finite-element discretization of the Kohn–Sham DFT problem. A comparative study of the computational efficiency of the proposed higher-order finite-element discretizations suggests that the performance of finite-element basis is competing with the plane-wave discretization for non-periodic local pseudopotential calculations, and compares to the Gaussian basis for all-electron calculations to within an order of magnitude. Further, we demonstrate the capability of the proposed approach to compute the electronic structure of a metallic system containing 1688 atoms using modest computational resources, and good scalability of the present implementation up to 192 processors.« less

A prefiltering version of the Kalman filter with new numerical integration formulas for Riccati equations

NASA Technical Reports Server (NTRS)

Womble, M. E.; Potter, J. E.

1975-01-01

A prefiltering version of the Kalman filter is derived for both discrete and continuous measurements. The derivation consists of determining a single discrete measurement that is equivalent to either a time segment of continuous measurements or a set of discrete measurements. This prefiltering version of the Kalman filter easily handles numerical problems associated with rapid transients and ill-conditioned Riccati matrices. Therefore, the derived technique for extrapolating the Riccati matrix from one time to the next constitutes a new set of integration formulas which alleviate ill-conditioning problems associated with continuous Riccati equations. Furthermore, since a time segment of continuous measurements is converted into a single discrete measurement, Potter's square root formulas can be used to update the state estimate and its error covariance matrix. Therefore, if having the state estimate and its error covariance matrix at discrete times is acceptable, the prefilter extends square root filtering with all its advantages, to continuous measurement problems.

Stochastic Dual Algorithm for Voltage Regulation in Distribution Networks with Discrete Loads: Preprint

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dall-Anese, Emiliano; Zhou, Xinyang; Liu, Zhiyuan

This paper considers distribution networks with distributed energy resources and discrete-rate loads, and designs an incentive-based algorithm that allows the network operator and the customers to pursue given operational and economic objectives, while concurrently ensuring that voltages are within prescribed limits. Four major challenges include: (1) the non-convexity from discrete decision variables, (2) the non-convexity due to a Stackelberg game structure, (3) unavailable private information from customers, and (4) different update frequency from two types of devices. In this paper, we first make convex relaxation for discrete variables, then reformulate the non-convex structure into a convex optimization problem together withmore » pricing/reward signal design, and propose a distributed stochastic dual algorithm for solving the reformulated problem while restoring feasible power rates for discrete devices. By doing so, we are able to statistically achieve the solution of the reformulated problem without exposure of any private information from customers. Stability of the proposed schemes is analytically established and numerically corroborated.« less

Reduction of the discretization stencil of direct forcing immersed boundary methods on rectangular cells: The ghost node shifting method

NASA Astrophysics Data System (ADS)

Picot, Joris; Glockner, Stéphane

2018-07-01

We present an analytical study of discretization stencils for the Poisson problem and the incompressible Navier-Stokes problem when used with some direct forcing immersed boundary methods. This study uses, but is not limited to, second-order discretization and Ghost-Cell Finite-Difference methods. We show that the stencil size increases with the aspect ratio of rectangular cells, which is undesirable as it breaks assumptions of some linear system solvers. To circumvent this drawback, a modification of the Ghost-Cell Finite-Difference methods is proposed to reduce the size of the discretization stencil to the one observed for square cells, i.e. with an aspect ratio equal to one. Numerical results validate this proposed method in terms of accuracy and convergence, for the Poisson problem and both Dirichlet and Neumann boundary conditions. An improvement on error levels is also observed. In addition, we show that the application of the chosen Ghost-Cell Finite-Difference methods to the Navier-Stokes problem, discretized by a pressure-correction method, requires an additional interpolation step. This extra step is implemented and validated through well known test cases of the Navier-Stokes equations.

An adaptive simplex cut-cell method for high-order discontinuous Galerkin discretizations of elliptic interface problems and conjugate heat transfer problems

NASA Astrophysics Data System (ADS)

Sun, Huafei; Darmofal, David L.

2014-12-01

In this paper we propose a new high-order solution framework for interface problems on non-interface-conforming meshes. The framework consists of a discontinuous Galerkin (DG) discretization, a simplex cut-cell technique, and an output-based adaptive scheme. We first present a DG discretization with a dual-consistent output evaluation for elliptic interface problems on interface-conforming meshes, and then extend the method to handle multi-physics interface problems, in particular conjugate heat transfer (CHT) problems. The method is then applied to non-interface-conforming meshes using a cut-cell technique, where the interface definition is completely separate from the mesh generation process. No assumption is made on the interface shape (other than Lipschitz continuity). We then equip our strategy with an output-based adaptive scheme for an accurate output prediction. Through numerical examples, we demonstrate high-order convergence for elliptic interface problems and CHT problems with both smooth and non-smooth interface shapes.

A design study for the addition of higher order parametric discrete elements to NASTRAN

NASA Technical Reports Server (NTRS)

Stanton, E. L.

1972-01-01

The addition of discrete elements to NASTRAN poses significant interface problems with the level 15.1 assembly modules and geometry modules. Potential problems in designing new modules for higher-order parametric discrete elements are reviewed in both areas. An assembly procedure is suggested that separates grid point degrees of freedom on the basis of admissibility. New geometric input data are described that facilitate the definition of surfaces in parametric space.

Discrete optimal control approach to a four-dimensional guidance problem near terminal areas

NASA Technical Reports Server (NTRS)

Nagarajan, N.

1974-01-01

Description of a computer-oriented technique to generate the necessary control inputs to guide an aircraft in a given time from a given initial state to a prescribed final state subject to the constraints on airspeed, acceleration, and pitch and bank angles of the aircraft. A discrete-time mathematical model requiring five state variables and three control variables is obtained, assuming steady wind and zero sideslip. The guidance problem is posed as a discrete nonlinear optimal control problem with a cost functional of Bolza form. A solution technique for the control problem is investigated, and numerical examples are presented. It is believed that this approach should prove to be useful in automated air traffic control schemes near large terminal areas.

Discretizing singular point sources in hyperbolic wave propagation problems

DOE PAGES

Petersson, N. Anders; O'Reilly, Ossian; Sjogreen, Bjorn; ...

2016-06-01

Here, we develop high order accurate source discretizations for hyperbolic wave propagation problems in first order formulation that are discretized by finite difference schemes. By studying the Fourier series expansions of the source discretization and the finite difference operator, we derive sufficient conditions for achieving design accuracy in the numerical solution. Only half of the conditions in Fourier space can be satisfied through moment conditions on the source discretization, and we develop smoothness conditions for satisfying the remaining accuracy conditions. The resulting source discretization has compact support in physical space, and is spread over as many grid points as themore » number of moment and smoothness conditions. In numerical experiments we demonstrate high order of accuracy in the numerical solution of the 1-D advection equation (both in the interior and near a boundary), the 3-D elastic wave equation, and the 3-D linearized Euler equations.« less

On pseudo-spectral time discretizations in summation-by-parts form

NASA Astrophysics Data System (ADS)

Ruggiu, Andrea A.; Nordström, Jan

2018-05-01

Fully-implicit discrete formulations in summation-by-parts form for initial-boundary value problems must be invertible in order to provide well functioning procedures. We prove that, under mild assumptions, pseudo-spectral collocation methods for the time derivative lead to invertible discrete systems when energy-stable spatial discretizations are used.

A novel discrete PSO algorithm for solving job shop scheduling problem to minimize makespan

NASA Astrophysics Data System (ADS)

Rameshkumar, K.; Rajendran, C.

2018-02-01

In this work, a discrete version of PSO algorithm is proposed to minimize the makespan of a job-shop. A novel schedule builder has been utilized to generate active schedules. The discrete PSO is tested using well known benchmark problems available in the literature. The solution produced by the proposed algorithms is compared with best known solution published in the literature and also compared with hybrid particle swarm algorithm and variable neighborhood search PSO algorithm. The solution construction methodology adopted in this study is found to be effective in producing good quality solutions for the various benchmark job-shop scheduling problems.

Dynamic programming and graph algorithms in computer vision.

PubMed

Felzenszwalb, Pedro F; Zabih, Ramin

2011-04-01

Optimization is a powerful paradigm for expressing and solving problems in a wide range of areas, and has been successfully applied to many vision problems. Discrete optimization techniques are especially interesting since, by carefully exploiting problem structure, they often provide nontrivial guarantees concerning solution quality. In this paper, we review dynamic programming and graph algorithms, and discuss representative examples of how these discrete optimization techniques have been applied to some classical vision problems. We focus on the low-level vision problem of stereo, the mid-level problem of interactive object segmentation, and the high-level problem of model-based recognition.

Generalised Assignment Matrix Methodology in Linear Programming

ERIC Educational Resources Information Center

Jerome, Lawrence

2012-01-01

Discrete Mathematics instructors and students have long been struggling with various labelling and scanning algorithms for solving many important problems. This paper shows how to solve a wide variety of Discrete Mathematics and OR problems using assignment matrices and linear programming, specifically using Excel Solvers although the same…

How Is Health Related to Literacy, Numeracy, and Technological Problem-Solving Skills among U.S. Adults? Evidence from the Program for the International Assessment of Adult Competencies (PIAAC)

ERIC Educational Resources Information Center

Prins, Esther; Monnat, Shannon; Clymer, Carol; Toso, Blaire Wilson

2015-01-01

This paper uses data from the Program for the International Assessment of Adult Competencies (PIAAC) to analyze the relationship between U.S. adults' self-reported health and proficiencies in literacy, numeracy, and technological problem solving. Ordinal logistic regression analyses showed that scores on all three scales were positively and…

Technical support for creating an artificial intelligence system for feature extraction and experimental design

NASA Technical Reports Server (NTRS)

Glick, B. J.

1985-01-01

Techniques for classifying objects into groups or clases go under many different names including, most commonly, cluster analysis. Mathematically, the general problem is to find a best mapping of objects into an index set consisting of class identifiers. When an a priori grouping of objects exists, the process of deriving the classification rules from samples of classified objects is known as discrimination. When such rules are applied to objects of unknown class, the process is denoted classification. The specific problem addressed involves the group classification of a set of objects that are each associated with a series of measurements (ratio, interval, ordinal, or nominal levels of measurement). Each measurement produces one variable in a multidimensional variable space. Cluster analysis techniques are reviewed and methods for incuding geographic location, distance measures, and spatial pattern (distribution) as parameters in clustering are examined. For the case of patterning, measures of spatial autocorrelation are discussed in terms of the kind of data (nominal, ordinal, or interval scaled) to which they may be applied.

Optimization of Operations Resources via Discrete Event Simulation Modeling

NASA Technical Reports Server (NTRS)

Joshi, B.; Morris, D.; White, N.; Unal, R.

1996-01-01

The resource levels required for operation and support of reusable launch vehicles are typically defined through discrete event simulation modeling. Minimizing these resources constitutes an optimization problem involving discrete variables and simulation. Conventional approaches to solve such optimization problems involving integer valued decision variables are the pattern search and statistical methods. However, in a simulation environment that is characterized by search spaces of unknown topology and stochastic measures, these optimization approaches often prove inadequate. In this paper, we have explored the applicability of genetic algorithms to the simulation domain. Genetic algorithms provide a robust search strategy that does not require continuity and differentiability of the problem domain. The genetic algorithm successfully minimized the operation and support activities for a space vehicle, through a discrete event simulation model. The practical issues associated with simulation optimization, such as stochastic variables and constraints, were also taken into consideration.

A fast numerical method for the valuation of American lookback put options

NASA Astrophysics Data System (ADS)

Song, Haiming; Zhang, Qi; Zhang, Ran

2015-10-01

A fast and efficient numerical method is proposed and analyzed for the valuation of American lookback options. American lookback option pricing problem is essentially a two-dimensional unbounded nonlinear parabolic problem. We reformulate it into a two-dimensional parabolic linear complementary problem (LCP) on an unbounded domain. The numeraire transformation and domain truncation technique are employed to convert the two-dimensional unbounded LCP into a one-dimensional bounded one. Furthermore, the variational inequality (VI) form corresponding to the one-dimensional bounded LCP is obtained skillfully by some discussions. The resulting bounded VI is discretized by a finite element method. Meanwhile, the stability of the semi-discrete solution and the symmetric positive definiteness of the full-discrete matrix are established for the bounded VI. The discretized VI related to options is solved by a projection and contraction method. Numerical experiments are conducted to test the performance of the proposed method.

Space-time adaptive solution of inverse problems with the discrete adjoint method

NASA Astrophysics Data System (ADS)

Alexe, Mihai; Sandu, Adrian

2014-08-01

This paper develops a framework for the construction and analysis of discrete adjoint sensitivities in the context of time dependent, adaptive grid, adaptive step models. Discrete adjoints are attractive in practice since they can be generated with low effort using automatic differentiation. However, this approach brings several important challenges. The space-time adjoint of the forward numerical scheme may be inconsistent with the continuous adjoint equations. A reduction in accuracy of the discrete adjoint sensitivities may appear due to the inter-grid transfer operators. Moreover, the optimization algorithm may need to accommodate state and gradient vectors whose dimensions change between iterations. This work shows that several of these potential issues can be avoided through a multi-level optimization strategy using discontinuous Galerkin (DG) hp-adaptive discretizations paired with Runge-Kutta (RK) time integration. We extend the concept of dual (adjoint) consistency to space-time RK-DG discretizations, which are then shown to be well suited for the adaptive solution of time-dependent inverse problems. Furthermore, we prove that DG mesh transfer operators on general meshes are also dual consistent. This allows the simultaneous derivation of the discrete adjoint for both the numerical solver and the mesh transfer logic with an automatic code generation mechanism such as algorithmic differentiation (AD), potentially speeding up development of large-scale simulation codes. The theoretical analysis is supported by numerical results reported for a two-dimensional non-stationary inverse problem.

A scalable block-preconditioning strategy for divergence-conforming B-spline discretizations of the Stokes problem

DOE Office of Scientific and Technical Information (OSTI.GOV)

Cortes, Adriano M.; Dalcin, Lisandro; Sarmiento, Adel F.

The recently introduced divergence-conforming B-spline discretizations allow the construction of smooth discrete velocity–pressure pairs for viscous incompressible flows that are at the same time inf–sup stable and pointwise divergence-free. When applied to the discretized Stokes problem, these spaces generate a symmetric and indefinite saddle-point linear system. The iterative method of choice to solve such system is the Generalized Minimum Residual Method. This method lacks robustness, and one remedy is to use preconditioners. For linear systems of saddle-point type, a large family of preconditioners can be obtained by using a block factorization of the system. In this paper, we show howmore » the nesting of “black-box” solvers and preconditioners can be put together in a block triangular strategy to build a scalable block preconditioner for the Stokes system discretized by divergence-conforming B-splines. Lastly, besides the known cavity flow problem, we used for benchmark flows defined on complex geometries: an eccentric annulus and hollow torus of an eccentric annular cross-section.« less

A scalable block-preconditioning strategy for divergence-conforming B-spline discretizations of the Stokes problem

DOE PAGES

Cortes, Adriano M.; Dalcin, Lisandro; Sarmiento, Adel F.; ...

2016-10-19

The recently introduced divergence-conforming B-spline discretizations allow the construction of smooth discrete velocity–pressure pairs for viscous incompressible flows that are at the same time inf–sup stable and pointwise divergence-free. When applied to the discretized Stokes problem, these spaces generate a symmetric and indefinite saddle-point linear system. The iterative method of choice to solve such system is the Generalized Minimum Residual Method. This method lacks robustness, and one remedy is to use preconditioners. For linear systems of saddle-point type, a large family of preconditioners can be obtained by using a block factorization of the system. In this paper, we show howmore » the nesting of “black-box” solvers and preconditioners can be put together in a block triangular strategy to build a scalable block preconditioner for the Stokes system discretized by divergence-conforming B-splines. Lastly, besides the known cavity flow problem, we used for benchmark flows defined on complex geometries: an eccentric annulus and hollow torus of an eccentric annular cross-section.« less

Energy-modeled flight in a wind field

DOE Office of Scientific and Technical Information (OSTI.GOV)

Feldman, M.A.; Cliff, E.M.

Optimal shaping of aerospace trajectories has provided the motivation for much modern study of optimization theory and algorithms. Current industrial practice favors approaches where the continuous-time optimal control problem is transcribed to a finite-dimensional nonlinear programming problem (NLP) by a discretization process. Two such formulations are implemented in the POST and the OTIS codes. In the present paper we use a discretization that is specially adapted to the flight problem of interest. Among the unique aspects of the present discretization are: a least-squares formulation for certain kinematic constraints; the use of an energy ideas to enforce Newton`s Laws; and, themore » inclusion of large magnitude horizontal winds. In the next section we shall provide a description of the flight problem and its NLP representation. Following this we provide some details of the constraint formulation. Finally, we present an overview of the NLP problem.« less

Discrete Mathematics Re "Tooled."

ERIC Educational Resources Information Center

Grassl, Richard M.; Mingus, Tabitha T. Y.

1999-01-01

Indicates the importance of teaching discrete mathematics. Describes how the use of technology can enhance the teaching and learning of discrete mathematics. Explorations using Excel, Derive, and the TI-92 proved how preservice and inservice teachers experienced a new dimension in problem solving and discovery. (ASK)

Adaptive Discrete Hypergraph Matching.

PubMed

Yan, Junchi; Li, Changsheng; Li, Yin; Cao, Guitao

2018-02-01

This paper addresses the problem of hypergraph matching using higher-order affinity information. We propose a solver that iteratively updates the solution in the discrete domain by linear assignment approximation. The proposed method is guaranteed to converge to a stationary discrete solution and avoids the annealing procedure and ad-hoc post binarization step that are required in several previous methods. Specifically, we start with a simple iterative discrete gradient assignment solver. This solver can be trapped in an -circle sequence under moderate conditions, where is the order of the graph matching problem. We then devise an adaptive relaxation mechanism to jump out this degenerating case and show that the resulting new path will converge to a fixed solution in the discrete domain. The proposed method is tested on both synthetic and real-world benchmarks. The experimental results corroborate the efficacy of our method.

Introduction of Parallel GPGPU Acceleration Algorithms for the Solution of Radiative Transfer

NASA Technical Reports Server (NTRS)

Godoy, William F.; Liu, Xu

2011-01-01

General-purpose computing on graphics processing units (GPGPU) is a recent technique that allows the parallel graphics processing unit (GPU) to accelerate calculations performed sequentially by the central processing unit (CPU). To introduce GPGPU to radiative transfer, the Gauss-Seidel solution of the well-known expressions for 1-D and 3-D homogeneous, isotropic media is selected as a test case. Different algorithms are introduced to balance memory and GPU-CPU communication, critical aspects of GPGPU. Results show that speed-ups of one to two orders of magnitude are obtained when compared to sequential solutions. The underlying value of GPGPU is its potential extension in radiative solvers (e.g., Monte Carlo, discrete ordinates) at a minimal learning curve.

Development and validation of P-MODTRAN7 and P-MCScene, 1D and 3D polarimetric radiative transfer models

NASA Astrophysics Data System (ADS)

Hawes, Frederick T.; Berk, Alexander; Richtsmeier, Steven C.

2016-05-01

A validated, polarimetric 3-dimensional simulation capability, P-MCScene, is being developed by generalizing Spectral Sciences' Monte Carlo-based synthetic scene simulation model, MCScene, to include calculation of all 4 Stokes components. P-MCScene polarimetric optical databases will be generated by a new version (MODTRAN7) of the government-standard MODTRAN radiative transfer algorithm. The conversion of MODTRAN6 to a polarimetric model is being accomplished by (1) introducing polarimetric data, by (2) vectorizing the MODTRAN radiation calculations and by (3) integrating the newly revised and validated vector discrete ordinate model VDISORT3. Early results, presented here, demonstrate a clear pathway to the long-term goal of fully validated polarimetric models.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kitzmann, D., E-mail: daniel.kitzmann@csh.unibe.ch

Carbon dioxide ice clouds are thought to play an important role for cold terrestrial planets with thick CO{sub 2} dominated atmospheres. Various previous studies showed that a scattering greenhouse effect by carbon dioxide ice clouds could result in a massive warming of the planetary surface. However, all of these studies only employed simplified two-stream radiative transfer schemes to describe the anisotropic scattering. Using accurate radiative transfer models with a general discrete ordinate method, this study revisits this important effect and shows that the positive climatic impact of carbon dioxide clouds was strongly overestimated in the past. The revised scattering greenhousemore » effect can have important implications for the early Mars, but also for planets like the early Earth or the position of the outer boundary of the habitable zone.« less

A new indicator for the measurement of change with ordinal scores.

PubMed

Ferreira, Mario Luiz Pinto; Almeida, Renan Moritz V R; Luiz, Ronir Raggio

2013-10-01

Studies on how to better measure change have been published at least since the third decade of the last century, but no general indicator or strategy of measurement is currently agreed upon. The aim of this study is to propose a new indicator, the indicator of positive change, as an option for the assessment of change when ordinal scores are used in pretest and posttest designs. The basic idea is to measure the proportion of possible (positive) change inside a group that can be attributed to an intervention. The approach is based on the joint distribution of the before and after scores (differences), represented by the cells (i, j) of a contingency table m × m (m is the number of classes of the ordinal measurement scale; i and j are the lines and columns of the table, respectively). By convention, higher classes are the most unfavorable on the scale such that subjects that improve "migrate" from the higher to the lower classes as a result of an intervention and vice versa. The introduced indicator offers a new strategy for the analysis of change when dealing with repeated measurements of the same subject, assuming that the measured variable is ordinal (e.g., clinician-rating scales). The presented approach is easily interpretable and avoids the problems that arise, for instance, in those cases where a large concentration of high/low scores is present at the baseline.

Minding the gap: Children's difficulty conceptualizing spatial intervals as linear measurement units.

PubMed

Solomon, Tracy L; Vasilyeva, Marina; Huttenlocher, Janellen; Levine, Susan C

2015-11-01

Understanding measurement units is critical to mathematics and science learning, but it is a topic that American students find difficult. In 3 studies, we investigated the challenges underlying this difficulty in kindergarten and second grade by comparing performance on different versions of a linear measurement task. Children measured crayons that were either aligned or shifted relative to the left edge of either a continuous ruler or a row of discrete units. The alignment (aligned, shifted) and the measuring tool (ruler, discrete units) were crossed to form 4 types of problems. Study 1 showed good performance in both grades on both types of aligned problems as well as on the shifted problems with discrete units. In contrast, performance was at chance on the shifted ruler problems. Study 2 showed that performance on shifted discrete unit problems declined when numbers were placed on the units, particularly for kindergarteners, suggesting that on the shifted ruler problems, the presence of numbers may have contributed to children's difficulty. However, Study 3 showed that the difficulty on the shifted ruler problems persisted even when the numbers were removed from the ruler. Taken together, these findings suggest that there are multiple challenges to understanding measurement, but that a key challenge is conceptualizing the ruler as a set of countable spatial interval units. (c) 2015 APA, all rights reserved).

Dynamic Programming and Graph Algorithms in Computer Vision*

PubMed Central

Felzenszwalb, Pedro F.; Zabih, Ramin

2013-01-01

Optimization is a powerful paradigm for expressing and solving problems in a wide range of areas, and has been successfully applied to many vision problems. Discrete optimization techniques are especially interesting, since by carefully exploiting problem structure they often provide non-trivial guarantees concerning solution quality. In this paper we briefly review dynamic programming and graph algorithms, and discuss representative examples of how these discrete optimization techniques have been applied to some classical vision problems. We focus on the low-level vision problem of stereo; the mid-level problem of interactive object segmentation; and the high-level problem of model-based recognition. PMID:20660950

Reducing single-use plastic shopping bags in the USA.

PubMed

Wagner, Travis P

2017-12-01

In the USA, local governments have the primary responsibility to manage MSW. However, local governments lack the authority to explicitly shift costs or responsibility back onto the producer for specific problem wastes. A particularly problematic waste for local governments is the single-use plastic bag. In 2014, in the USA, 103.465 billion single-use plastic shopping bags were consumed. Because of their extremely low recyclability rate, plastic bags remain a significant source of land-based litter and marine debris and impair stormwater management systems. They also reduce the effectiveness of automated recycling systems. In response, local governments increasingly have adopted a variety of measures specifically intended to reduce the store-level consumption of single-use shopping bags in 5 major categories: bans, imposition of fees and taxes, establishing minimum product design of bags, requiring consumer education, and mandating retailer take-back programs. As of September 2017, there were 271 local governments in the USA with plastic bag ordinances covering 9.7% of the nation's population. The majority (95%) of the ordinances is a ban on single-use plastic bags; 56.9% of these bans also include a mandatory fee on paper and/or reusable bags. For the fee-based ordinances, the mode is $0.10 per bag; every tax/fee ordinance allows retailers to retain some or all the collected fee. As local governments continue to increase their actions on plastic bags, 11 states have enacted laws to prohibit local governments from regulating single-use plastic bags. Because of the success with single-use bags, local governments are also enacting similar ordinances on single-use expanded polystyrene consumer products and other single-use plastic products. Copyright © 2017 Elsevier Ltd. All rights reserved.

Stability of semidiscrete approximations for hyperbolic initial-boundary-value problems: Stationary modes

NASA Technical Reports Server (NTRS)

Warming, Robert F.; Beam, Richard M.

1988-01-01

Spatially discrete difference approximations for hyperbolic initial-boundary-value problems (IBVPs) require numerical boundary conditions in addition to the analytical boundary conditions specified for the differential equations. Improper treatment of a numerical boundary condition can cause instability of the discrete IBVP even though the approximation is stable for the pure initial-value or Cauchy problem. In the discrete IBVP stability literature there exists a small class of discrete approximations called borderline cases. For nondissipative approximations, borderline cases are unstable according to the theory of the Gustafsson, Kreiss, and Sundstrom (GKS) but they may be Lax-Richtmyer stable or unstable in the L sub 2 norm on a finite domain. It is shown that borderline approximation can be characterized by the presence of a stationary mode for the finite-domain problem. A stationary mode has the property that it does not decay with time and a nontrivial stationary mode leads to algebraic growth of the solution norm with mesh refinement. An analytical condition is given which makes it easy to detect a stationary mode; several examples of numerical boundary conditions are investigated corresponding to borderline cases.

Discrete restricted four-body problem: Existence of proof of equilibria and reproducibility of periodic orbits

DOE Office of Scientific and Technical Information (OSTI.GOV)

Minesaki, Yukitaka

2015-01-01

We propose the discrete-time restricted four-body problem (d-R4BP), which approximates the orbits of the restricted four-body problem (R4BP). The d-R4BP is given as a special case of the discrete-time chain regularization of the general N-body problem published in Minesaki. Moreover, we analytically prove that the d-R4BP yields the correct orbits corresponding to the elliptic relative equilibrium solutions of the R4BP when the three primaries form an equilateral triangle at any time. Such orbits include the orbit of a relative equilibrium solution already discovered by Baltagiannis and Papadakis. Until the proof in this work, there has been no discrete analog thatmore » preserves the orbits of elliptic relative equilibrium solutions in the R4BP. For a long time interval, the d-R4BP can precisely compute some stable periodic orbits in the Sun–Jupiter–Trojan asteroid–spacecraft system that cannot necessarily be reproduced by other generic integrators.« less

Multi-Interval Discretization of Continuous-Valued Attributes for Classification Learning

NASA Technical Reports Server (NTRS)

Fayyad, U.; Irani, K.

1993-01-01

Since most real-world applications of classification learning involve continuous-valued attributes, properly addressing the discretization process is an important problem. This paper addresses the use of the entropy minimization heuristic for discretizing the range of a continuous-valued attribute into multiple intervals.

The Spectrum of Mathematical Models.

ERIC Educational Resources Information Center

Karplus, Walter J.

1983-01-01

Mathematical modeling problems encountered in many disciplines are discussed in terms of the modeling process and applications of models. The models are classified according to three types of abstraction: continuous-space-continuous-time, discrete-space-continuous-time, and discrete-space-discrete-time. Limitations in different kinds of modeling…

Estimating the proportion of true null hypotheses when the statistics are discrete.

PubMed

Dialsingh, Isaac; Austin, Stefanie R; Altman, Naomi S

2015-07-15

In high-dimensional testing problems π0, the proportion of null hypotheses that are true is an important parameter. For discrete test statistics, the P values come from a discrete distribution with finite support and the null distribution may depend on an ancillary statistic such as a table margin that varies among the test statistics. Methods for estimating π0 developed for continuous test statistics, which depend on a uniform or identical null distribution of P values, may not perform well when applied to discrete testing problems. This article introduces a number of π0 estimators, the regression and 'T' methods that perform well with discrete test statistics and also assesses how well methods developed for or adapted from continuous tests perform with discrete tests. We demonstrate the usefulness of these estimators in the analysis of high-throughput biological RNA-seq and single-nucleotide polymorphism data. implemented in R. © The Author 2015. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

Periodic measure for the stochastic equation of the barotropic viscous gas in a discretized one-dimensional domain

DOE Office of Scientific and Technical Information (OSTI.GOV)

Benseghir, Rym, E-mail: benseghirrym@ymail.com, E-mail: benseghirrym@ymail.com; Benchettah, Azzedine, E-mail: abenchettah@hotmail.com; Raynaud de Fitte, Paul, E-mail: prf@univ-rouen.fr

2015-11-30

A stochastic equation system corresponding to the description of the motion of a barotropic viscous gas in a discretized one-dimensional domain with a weight regularizing the density is considered. In [2], the existence of an invariant measure was established for this discretized problem in the stationary case. In this paper, applying a slightly modified version of Khas’minskii’s theorem [5], we generalize this result in the periodic case by proving the existence of a periodic measure for this problem.

New discretization and solution techniques for incompressible viscous flow problems

NASA Technical Reports Server (NTRS)

Gunzburger, M. D.; Nicolaides, R. A.; Liu, C. H.

1983-01-01

Several topics arising in the finite element solution of the incompressible Navier-Stokes equations are considered. Specifically, the question of choosing finite element velocity/pressure spaces is addressed, particularly from the viewpoint of achieving stable discretizations leading to convergent pressure approximations. The role of artificial viscosity in viscous flow calculations is studied, emphasizing work by several researchers for the anisotropic case. The last section treats the problem of solving the nonlinear systems of equations which arise from the discretization. Time marching methods and classical iterative techniques, as well as some modifications are mentioned.

Solving phase appearance/disappearance two-phase flow problems with high resolution staggered grid and fully implicit schemes by the Jacobian-free Newton–Krylov Method

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zou, Ling; Zhao, Haihua; Zhang, Hongbin

2016-04-01

The phase appearance/disappearance issue presents serious numerical challenges in two-phase flow simulations. Many existing reactor safety analysis codes use different kinds of treatments for the phase appearance/disappearance problem. However, to our best knowledge, there are no fully satisfactory solutions. Additionally, the majority of the existing reactor system analysis codes were developed using low-order numerical schemes in both space and time. In many situations, it is desirable to use high-resolution spatial discretization and fully implicit time integration schemes to reduce numerical errors. In this work, we adapted a high-resolution spatial discretization scheme on staggered grid mesh and fully implicit time integrationmore » methods (such as BDF1 and BDF2) to solve the two-phase flow problems. The discretized nonlinear system was solved by the Jacobian-free Newton Krylov (JFNK) method, which does not require the derivation and implementation of analytical Jacobian matrix. These methods were tested with a few two-phase flow problems with phase appearance/disappearance phenomena considered, such as a linear advection problem, an oscillating manometer problem, and a sedimentation problem. The JFNK method demonstrated extremely robust and stable behaviors in solving the two-phase flow problems with phase appearance/disappearance. No special treatments such as water level tracking or void fraction limiting were used. High-resolution spatial discretization and second- order fully implicit method also demonstrated their capabilities in significantly reducing numerical errors.« less

Sensorimotor Analysis of Early Onset Childhood Psychosis.

ERIC Educational Resources Information Center

Ertel, David; Voyat, Gilbert

1982-01-01

Jean Piaget's theories about children's cognitive development are applied to the evaluation of childhood psychosis. Problems with the testing of such children are described, and results of a research project that used the Piaget-inspired Uzgiris and Hunt Ordinal Scales of Psychological Development to assess autistic children's cognitive processes…

Discrete-to-continuous transition in quantum phase estimation

NASA Astrophysics Data System (ADS)

Rządkowski, Wojciech; Demkowicz-Dobrzański, Rafał

2017-09-01

We analyze the problem of quantum phase estimation in which the set of allowed phases forms a discrete N -element subset of the whole [0 ,2 π ] interval, φn=2 π n /N , n =0 ,⋯,N -1 , and study the discrete-to-continuous transition N →∞ for various cost functions as well as the mutual information. We also analyze the relation between the problems of phase discrimination and estimation by considering a step cost function of a given width σ around the true estimated value. We show that in general a direct application of the theory of covariant measurements for a discrete subgroup of the U(1 ) group leads to suboptimal strategies due to an implicit requirement of estimating only the phases that appear in the prior distribution. We develop the theory of subcovariant measurements to remedy this situation and demonstrate truly optimal estimation strategies when performing a transition from discrete to continuous phase estimation.

Radiation Source Mapping with Bayesian Inverse Methods

DOE PAGES

Hykes, Joshua M.; Azmy, Yousry Y.

2017-03-22

In this work, we present a method to map the spectral and spatial distributions of radioactive sources using a limited number of detectors. Locating and identifying radioactive materials is important for border monitoring, in accounting for special nuclear material in processing facilities, and in cleanup operations following a radioactive material spill. Most methods to analyze these types of problems make restrictive assumptions about the distribution of the source. In contrast, the source mapping method presented here allows an arbitrary three-dimensional distribution in space and a gamma peak distribution in energy. To apply the method, the problem is cast as anmore » inverse problem where the system’s geometry and material composition are known and fixed, while the radiation source distribution is sought. A probabilistic Bayesian approach is used to solve the resulting inverse problem since the system of equations is ill-posed. The posterior is maximized with a Newton optimization method. The probabilistic approach also provides estimates of the confidence in the final source map prediction. A set of adjoint, discrete ordinates flux solutions, obtained in this work by the Denovo code, is required to efficiently compute detector responses from a candidate source distribution. These adjoint fluxes form the linear mapping from the state space to the response space. The test of the method’s success is simultaneously locating a set of 137Cs and 60Co gamma sources in a room. This test problem is solved using experimental measurements that we collected for this purpose. Because of the weak sources available for use in the experiment, some of the expected photopeaks were not distinguishable from the Compton continuum. However, by supplanting 14 flawed measurements (out of a total of 69) with synthetic responses computed by MCNP, the proof-of-principle source mapping was successful. The locations of the sources were predicted within 25 cm for two of the sources and 90 cm for the third, in a room with an ~4-x 4-m floor plan. Finally, the predicted source intensities were within a factor of ten of their true value.« less

PROTEUS-SN User Manual

DOE Office of Scientific and Technical Information (OSTI.GOV)

Shemon, Emily R.; Smith, Micheal A.; Lee, Changho

2016-02-16

PROTEUS-SN is a three-dimensional, highly scalable, high-fidelity neutron transport code developed at Argonne National Laboratory. The code is applicable to all spectrum reactor transport calculations, particularly those in which a high degree of fidelity is needed either to represent spatial detail or to resolve solution gradients. PROTEUS-SN solves the second order formulation of the transport equation using the continuous Galerkin finite element method in space, the discrete ordinates approximation in angle, and the multigroup approximation in energy. PROTEUS-SN’s parallel methodology permits the efficient decomposition of the problem by both space and angle, permitting large problems to run efficiently on hundredsmore » of thousands of cores. PROTEUS-SN can also be used in serial or on smaller compute clusters (10’s to 100’s of cores) for smaller homogenized problems, although it is generally more computationally expensive than traditional homogenized methodology codes. PROTEUS-SN has been used to model partially homogenized systems, where regions of interest are represented explicitly and other regions are homogenized to reduce the problem size and required computational resources. PROTEUS-SN solves forward and adjoint eigenvalue problems and permits both neutron upscattering and downscattering. An adiabatic kinetics option has recently been included for performing simple time-dependent calculations in addition to standard steady state calculations. PROTEUS-SN handles void and reflective boundary conditions. Multigroup cross sections can be generated externally using the MC2-3 fast reactor multigroup cross section generation code or internally using the cross section application programming interface (API) which can treat the subgroup or resonance table libraries. PROTEUS-SN is written in Fortran 90 and also includes C preprocessor definitions. The code links against the PETSc, METIS, HDF5, and MPICH libraries. It optionally links against the MOAB library and is a part of the SHARP multi-physics suite for coupled multi-physics analysis of nuclear reactors. This user manual describes how to set up a neutron transport simulation with the PROTEUS-SN code. A companion methodology manual describes the theory and algorithms within PROTEUS-SN.« less

On the Computational Complexity of Stochastic Scheduling Problems,

DTIC Science & Technology

1981-09-01

Survey": 1979, Ann. Discrete Math . 5, pp. 287-326. i I (.4) Karp, R.M., "Reducibility Among Combinatorial Problems": 1972, R.E. Miller and J.W...Weighted Completion Time Subject to Precedence Constraints": 1978, Ann. Discrete Math . 2, pp. 75-90. (8) Lawler, E.L. and J.W. Moore, "A Functional

Prompting Children to Reason Proportionally: Processing Discrete Units as Continuous Amounts

ERIC Educational Resources Information Center

Boyer, Ty W.; Levine, Susan C.

2015-01-01

Recent studies reveal that children can solve proportional reasoning problems presented with continuous amounts that enable intuitive strategies by around 6 years of age but have difficulties with problems presented with discrete units that tend to elicit explicit count-and-match strategies until at least 10 years of age. The current study tests…

Potential effects of the introduction of the discrete address beacon system data link on air/ground information transfer problems

NASA Technical Reports Server (NTRS)

Grayson, R. L.

1981-01-01

This study of Aviation Safety Reporting System reports suggests that benefits should accure from implementation of discrete address beacon system data link. The phase enhanced terminal information system service is expected to provide better terminal information than present systems by improving currency and accuracy. In the exchange of air traffic control messages, discrete address insures that only the intended recipient receives and acts on a specific message. Visual displays and printer copy of messages should mitigate many of the reported problems associated with voice communications. The problems that remain unaffected include error in addressing the intended recipient and messages whose content is wrong but are otherwise correct as to format and reasonableness.

Recursive multibody dynamics and discrete-time optimal control

NASA Technical Reports Server (NTRS)

Deleuterio, G. M. T.; Damaren, C. J.

1989-01-01

A recursive algorithm is developed for the solution of the simulation dynamics problem for a chain of rigid bodies. Arbitrary joint constraints are permitted, that is, joints may allow translational and/or rotational degrees of freedom. The recursive procedure is shown to be identical to that encountered in a discrete-time optimal control problem. For each relevant quantity in the multibody dynamics problem, there exists an analog in the context of optimal control. The performance index that is minimized in the control problem is identified as Gibbs' function for the chain of bodies.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Khrennikov, Andrei; Volovich, Yaroslav

We analyze dynamical consequences of a conjecture that there exists a fundamental (indivisible) quant of time. In particular we study the problem of discrete energy levels of hydrogen atom. We are able to reconstruct potential which in discrete time formalism leads to energy levels of unperturbed hydrogen atom. We also consider linear energy levels of quantum harmonic oscillator and show how they are produced in the discrete time formalism. More generally, we show that in discrete time formalism finite motion in central potential leads to discrete energy spectrum, the property which is common for quantum mechanical theory. Thus deterministic (butmore » discrete time{exclamation_point}) dynamics is compatible with discrete energy levels.« less

Is Best-Worst Scaling Suitable for Health State Valuation? A Comparison with Discrete Choice Experiments.

PubMed

Krucien, Nicolas; Watson, Verity; Ryan, Mandy

2017-12-01

Health utility indices (HUIs) are widely used in economic evaluation. The best-worst scaling (BWS) method is being used to value dimensions of HUIs. However, little is known about the properties of this method. This paper investigates the validity of the BWS method to develop HUI, comparing it to another ordinal valuation method, the discrete choice experiment (DCE). Using a parametric approach, we find a low level of concordance between the two methods, with evidence of preference reversals. BWS responses are subject to decision biases, with significant effects on individuals' preferences. Non parametric tests indicate that BWS data has lower stability, monotonicity and continuity compared to DCE data, suggesting that the BWS provides lower quality data. As a consequence, for both theoretical and technical reasons, practitioners should be cautious both about using the BWS method to measure health-related preferences, and using HUI based on BWS data. Given existing evidence, it seems that the DCE method is a better method, at least because its limitations (and measurement properties) have been extensively researched. Copyright © 2016 John Wiley & Sons, Ltd. Copyright © 2016 John Wiley & Sons, Ltd.

Numerical investigations of low-density nozzle flow by solving the Boltzmann equation

NASA Technical Reports Server (NTRS)

Deng, Zheng-Tao; Liaw, Goang-Shin; Chou, Lynn Chen

1995-01-01

A two-dimensional finite-difference code to solve the BGK-Boltzmann equation has been developed. The solution procedure consists of three steps: (1) transforming the BGK-Boltzmann equation into two simultaneous partial differential equations by taking moments of the distribution function with respect to the molecular velocity u(sub z), with weighting factors 1 and u(sub z)(sup 2); (2) solving the transformed equations in the physical space based on the time-marching technique and the four-stage Runge-Kutta time integration, for a given discrete-ordinate. The Roe's second-order upwind difference scheme is used to discretize the convective terms and the collision terms are treated as source terms; and (3) using the newly calculated distribution functions at each point in the physical space to calculate the macroscopic flow parameters by the modified Gaussian quadrature formula. Repeating steps 2 and 3, the time-marching procedure stops when the convergent criteria is reached. A low-density nozzle flow field has been calculated by this newly developed code. The BGK Boltzmann solution and experimental data show excellent agreement. It demonstrated that numerical solutions of the BGK-Boltzmann equation are ready to be experimentally validated.

Upscaling of Mixed Finite Element Discretization Problems by the Spectral AMGe Method

DOE PAGES

Kalchev, Delyan Z.; Lee, C. S.; Villa, U.; ...

2016-09-22

Here, we propose two multilevel spectral techniques for constructing coarse discretization spaces for saddle-point problems corresponding to PDEs involving a divergence constraint, with a focus on mixed finite element discretizations of scalar self-adjoint second order elliptic equations on general unstructured grids. We use element agglomeration algebraic multigrid (AMGe), which employs coarse elements that can have nonstandard shape since they are agglomerates of fine-grid elements. The coarse basis associated with each agglomerated coarse element is constructed by solving local eigenvalue problems and local mixed finite element problems. This construction leads to stable upscaled coarse spaces and guarantees the inf-sup compatibility ofmore » the upscaled discretization. Also, the approximation properties of these upscaled spaces improve by adding more local eigenfunctions to the coarse spaces. The higher accuracy comes at the cost of additional computational effort, as the sparsity of the resulting upscaled coarse discretization (referred to as operator complexity) deteriorates when we introduce additional functions in the coarse space. We also provide an efficient solver for the coarse (upscaled) saddle-point system by employing hybridization, which leads to a symmetric positive definite (s.p.d.) reduced system for the Lagrange multipliers, and to solve the latter s.p.d. system, we use our previously developed spectral AMGe solver. Numerical experiments, in both two and three dimensions, are provided to illustrate the efficiency of the proposed upscaling technique.« less

Upscaling of Mixed Finite Element Discretization Problems by the Spectral AMGe Method

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kalchev, Delyan Z.; Lee, C. S.; Villa, U.

Here, we propose two multilevel spectral techniques for constructing coarse discretization spaces for saddle-point problems corresponding to PDEs involving a divergence constraint, with a focus on mixed finite element discretizations of scalar self-adjoint second order elliptic equations on general unstructured grids. We use element agglomeration algebraic multigrid (AMGe), which employs coarse elements that can have nonstandard shape since they are agglomerates of fine-grid elements. The coarse basis associated with each agglomerated coarse element is constructed by solving local eigenvalue problems and local mixed finite element problems. This construction leads to stable upscaled coarse spaces and guarantees the inf-sup compatibility ofmore » the upscaled discretization. Also, the approximation properties of these upscaled spaces improve by adding more local eigenfunctions to the coarse spaces. The higher accuracy comes at the cost of additional computational effort, as the sparsity of the resulting upscaled coarse discretization (referred to as operator complexity) deteriorates when we introduce additional functions in the coarse space. We also provide an efficient solver for the coarse (upscaled) saddle-point system by employing hybridization, which leads to a symmetric positive definite (s.p.d.) reduced system for the Lagrange multipliers, and to solve the latter s.p.d. system, we use our previously developed spectral AMGe solver. Numerical experiments, in both two and three dimensions, are provided to illustrate the efficiency of the proposed upscaling technique.« less

Solution of elastic-plastic stress analysis problems by the p-version of the finite element method

NASA Technical Reports Server (NTRS)

Szabo, Barna A.; Actis, Ricardo L.; Holzer, Stefan M.

1993-01-01

The solution of small strain elastic-plastic stress analysis problems by the p-version of the finite element method is discussed. The formulation is based on the deformation theory of plasticity and the displacement method. Practical realization of controlling discretization errors for elastic-plastic problems is the main focus. Numerical examples which include comparisons between the deformation and incremental theories of plasticity under tight control of discretization errors are presented.

Protein local structure alignment under the discrete Fréchet distance.

PubMed

Zhu, Binhai

2007-12-01

Protein structure alignment is a fundamental problem in computational and structural biology. While there has been lots of experimental/heuristic methods and empirical results, very few results are known regarding the algorithmic/complexity aspects of the problem, especially on protein local structure alignment. A well-known measure to characterize the similarity of two polygonal chains is the famous Fréchet distance, and with the application of protein-related research, a related discrete Fréchet distance has been used recently. In this paper, following the recent work of Jiang et al. we investigate the protein local structural alignment problem using bounded discrete Fréchet distance. Given m proteins (or protein backbones, which are 3D polygonal chains), each of length O(n), our main results are summarized as follows: * If the number of proteins, m, is not part of the input, then the problem is NP-complete; moreover, under bounded discrete Fréchet distance it is NP-hard to approximate the maximum size common local structure within a factor of n(1-epsilon). These results hold both when all the proteins are static and when translation/rotation are allowed. * If the number of proteins, m, is a constant, then there is a polynomial time solution for the problem.

Fourth-order convergence of a compact scheme for the one-dimensional biharmonic equation

NASA Astrophysics Data System (ADS)

Fishelov, D.; Ben-Artzi, M.; Croisille, J.-P.

2012-09-01

The convergence of a fourth-order compact scheme to the one-dimensional biharmonic problem is established in the case of general Dirichlet boundary conditions. The compact scheme invokes value of the unknown function as well as Pade approximations of its first-order derivative. Using the Pade approximation allows us to approximate the first-order derivative within fourth-order accuracy. However, although the truncation error of the discrete biharmonic scheme is of fourth-order at interior point, the truncation error drops to first-order at near-boundary points. Nonetheless, we prove that the scheme retains its fourth-order (optimal) accuracy. This is done by a careful inspection of the matrix elements of the discrete biharmonic operator. A number of numerical examples corroborate this effect. We also present a study of the eigenvalue problem uxxxx = νu. We compute and display the eigenvalues and the eigenfunctions related to the continuous and the discrete problems. By the positivity of the eigenvalues, one can deduce the stability of of the related time-dependent problem ut = -uxxxx. In addition, we study the eigenvalue problem uxxxx = νuxx. This is related to the stability of the linear time-dependent equation uxxt = νuxxxx. Its continuous and discrete eigenvalues and eigenfunction (or eigenvectors) are computed and displayed graphically.

Review of Hybrid (Deterministic/Monte Carlo) Radiation Transport Methods, Codes, and Applications at Oak Ridge National Laboratory

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wagner, John C; Peplow, Douglas E.; Mosher, Scott W

2011-01-01

This paper provides a review of the hybrid (Monte Carlo/deterministic) radiation transport methods and codes used at the Oak Ridge National Laboratory and examples of their application for increasing the efficiency of real-world, fixed-source Monte Carlo analyses. The two principal hybrid methods are (1) Consistent Adjoint Driven Importance Sampling (CADIS) for optimization of a localized detector (tally) region (e.g., flux, dose, or reaction rate at a particular location) and (2) Forward Weighted CADIS (FW-CADIS) for optimizing distributions (e.g., mesh tallies over all or part of the problem space) or multiple localized detector regions (e.g., simultaneous optimization of two or moremore » localized tally regions). The two methods have been implemented and automated in both the MAVRIC sequence of SCALE 6 and ADVANTG, a code that works with the MCNP code. As implemented, the methods utilize the results of approximate, fast-running 3-D discrete ordinates transport calculations (with the Denovo code) to generate consistent space- and energy-dependent source and transport (weight windows) biasing parameters. These methods and codes have been applied to many relevant and challenging problems, including calculations of PWR ex-core thermal detector response, dose rates throughout an entire PWR facility, site boundary dose from arrays of commercial spent fuel storage casks, radiation fields for criticality accident alarm system placement, and detector response for special nuclear material detection scenarios and nuclear well-logging tools. Substantial computational speed-ups, generally O(102-4), have been realized for all applications to date. This paper provides a brief review of the methods, their implementation, results of their application, and current development activities, as well as a considerable list of references for readers seeking more information about the methods and/or their applications.« less

A POSTERIORI ERROR ANALYSIS OF TWO STAGE COMPUTATION METHODS WITH APPLICATION TO EFFICIENT DISCRETIZATION AND THE PARAREAL ALGORITHM.

PubMed

Chaudhry, Jehanzeb Hameed; Estep, Don; Tavener, Simon; Carey, Varis; Sandelin, Jeff

2016-01-01

We consider numerical methods for initial value problems that employ a two stage approach consisting of solution on a relatively coarse discretization followed by solution on a relatively fine discretization. Examples include adaptive error control, parallel-in-time solution schemes, and efficient solution of adjoint problems for computing a posteriori error estimates. We describe a general formulation of two stage computations then perform a general a posteriori error analysis based on computable residuals and solution of an adjoint problem. The analysis accommodates various variations in the two stage computation and in formulation of the adjoint problems. We apply the analysis to compute "dual-weighted" a posteriori error estimates, to develop novel algorithms for efficient solution that take into account cancellation of error, and to the Parareal Algorithm. We test the various results using several numerical examples.

Discretization and Numerical Solution of a Plane Problem in the Mechanics of Interfacial Cracks

NASA Astrophysics Data System (ADS)

Khoroshun, L. P.

2017-01-01

The Fourier transform is used to reduce the linear plane problem of the tension of a body with an interfacial crack to a system of dual equations for the transformed stresses and, then, to a system of integro-differential equations for the difference of displacements of the crack faces. After discretization, this latter system transforms into a system of algebraic equations for displacements of the crack faces. The effect of the bielastic constant and the number of discretization points on the half-length of the crack faces and the distribution of stresses at the interface is studied

New discretization and solution techniques for incompressible viscous flow problems

NASA Technical Reports Server (NTRS)

Gunzburger, M. D.; Nicolaides, R. A.; Liu, C. H.

1983-01-01

This paper considers several topics arising in the finite element solution of the incompressible Navier-Stokes equations. Specifically, the question of choosing finite element velocity/pressure spaces is addressed, particularly from the viewpoint of achieving stable discretizations leading to convergent pressure approximations. Following this, the role of artificial viscosity in viscous flow calculations is studied, emphasizing recent work by several researchers for the anisotropic case. The last section treats the problem of solving the nonlinear systems of equations which arise from the discretization. Time marching methods and classical iterative techniques, as well as some recent modifications are mentioned.

The Information Content of Discrete Functions and Their Application in Genetic Data Analysis.

PubMed

Sakhanenko, Nikita A; Kunert-Graf, James; Galas, David J

2017-12-01

The complex of central problems in data analysis consists of three components: (1) detecting the dependence of variables using quantitative measures, (2) defining the significance of these dependence measures, and (3) inferring the functional relationships among dependent variables. We have argued previously that an information theory approach allows separation of the detection problem from the inference of functional form problem. We approach here the third component of inferring functional forms based on information encoded in the functions. We present here a direct method for classifying the functional forms of discrete functions of three variables represented in data sets. Discrete variables are frequently encountered in data analysis, both as the result of inherently categorical variables and from the binning of continuous numerical variables into discrete alphabets of values. The fundamental question of how much information is contained in a given function is answered for these discrete functions, and their surprisingly complex relationships are illustrated. The all-important effect of noise on the inference of function classes is found to be highly heterogeneous and reveals some unexpected patterns. We apply this classification approach to an important area of biological data analysis-that of inference of genetic interactions. Genetic analysis provides a rich source of real and complex biological data analysis problems, and our general methods provide an analytical basis and tools for characterizing genetic problems and for analyzing genetic data. We illustrate the functional description and the classes of a number of common genetic interaction modes and also show how different modes vary widely in their sensitivity to noise.

Discrete-time infinity control problem with measurement feedback

NASA Technical Reports Server (NTRS)

Stoorvogel, A. A.; Saberi, A.; Chen, B. M.

1992-01-01

The paper is concerned with the discrete-time H(sub infinity) control problem with measurement feedback. The authors extend previous results by having weaker assumptions on the system parameters. The authors also show explicitly the structure of H(sub infinity) controllers. Finally, they show that it is in certain cases possible, without loss of performance, to reduce the dynamical order of the controllers.

Modifications of Geometric Truncation of the Scattering Phase Function

NASA Astrophysics Data System (ADS)

Radkevich, A.

2017-12-01

Phase function (PF) of light scattering on large atmospheric particles has very strong peak in forward direction constituting a challenge for accurate numerical calculations of radiance. Such accurate (and fast) evaluations are important in the problems of remote sensing of the atmosphere. Scaling transformation replaces original PF with a sum of the delta function and a new regular smooth PF. A number of methods to construct such a PF were suggested. Delta-M and delta-fit methods require evaluation of the PF moments which imposes a numerical problem if strongly anisotropic PF is given as a function of angle. Geometric truncation keeps the original PF unchanged outside the forward peak cone replacing it with a constant within the cone. This approach is designed to preserve the asymmetry parameter. It has two disadvantages: 1) PF has discontinuity at the cone; 2) the choice of the cone is subjective, no recommendations were provided on the choice of the truncation angle. This choice affects both truncation fraction and the value of the phase function within the forward cone. Both issues are addressed in this study. A simple functional form of the replacement PF is suggested. This functional form allows for a number of modifications. This study consider 3 versions providing continuous PF. The considered modifications also bear either of three properties: preserve asymmetry parameter, provide continuity of the 1st derivative of the PF, and preserve mean scattering angle. The second problem mentioned above is addressed with a heuristic approach providing unambiguous criterion of selection of the truncation angle. The approach showed good performance on liquid water and ice clouds with different particle size distributions. Suggested modifications were tested on different cloud PFs using both discrete ordinates and Monte Carlo methods. It was showed that the modifications provide better accuracy of the radiance computation compare to the original geometric truncation.

A Neural Dynamic Model Generates Descriptions of Object-Oriented Actions.

PubMed

Richter, Mathis; Lins, Jonas; Schöner, Gregor

2017-01-01

Describing actions entails that relations between objects are discovered. A pervasively neural account of this process requires that fundamental problems are solved: the neural pointer problem, the binding problem, and the problem of generating discrete processing steps from time-continuous neural processes. We present a prototypical solution to these problems in a neural dynamic model that comprises dynamic neural fields holding representations close to sensorimotor surfaces as well as dynamic neural nodes holding discrete, language-like representations. Making the connection between these two types of representations enables the model to describe actions as well as to perceptually ground movement phrases-all based on real visual input. We demonstrate how the dynamic neural processes autonomously generate the processing steps required to describe or ground object-oriented actions. By solving the fundamental problems of neural pointing, binding, and emergent discrete processing, the model may be a first but critical step toward a systematic neural processing account of higher cognition. Copyright © 2017 The Authors. Topics in Cognitive Science published by Wiley Periodicals, Inc. on behalf of Cognitive Science Society.

Iterative spectral methods and spectral solutions to compressible flows

NASA Technical Reports Server (NTRS)

Hussaini, M. Y.; Zang, T. A.

1982-01-01

A spectral multigrid scheme is described which can solve pseudospectral discretizations of self-adjoint elliptic problems in O(N log N) operations. An iterative technique for efficiently implementing semi-implicit time-stepping for pseudospectral discretizations of Navier-Stokes equations is discussed. This approach can handle variable coefficient terms in an effective manner. Pseudospectral solutions of compressible flow problems are presented. These include one dimensional problems and two dimensional Euler solutions. Results are given both for shock-capturing approaches and for shock-fitting ones.

Direct Discrete Method for Neutronic Calculations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Vosoughi, Naser; Akbar Salehi, Ali; Shahriari, Majid

The objective of this paper is to introduce a new direct method for neutronic calculations. This method which is named Direct Discrete Method, is simpler than the neutron Transport equation and also more compatible with physical meaning of problems. This method is based on physic of problem and with meshing of the desired geometry, writing the balance equation for each mesh intervals and with notice to the conjunction between these mesh intervals, produce the final discrete equations series without production of neutron transport differential equation and mandatory passing from differential equation bridge. We have produced neutron discrete equations for amore » cylindrical shape with two boundary conditions in one group energy. The correction of the results from this method are tested with MCNP-4B code execution. (authors)« less

Stabilisation of discrete-time polynomial fuzzy systems via a polynomial lyapunov approach

NASA Astrophysics Data System (ADS)

Nasiri, Alireza; Nguang, Sing Kiong; Swain, Akshya; Almakhles, Dhafer

2018-02-01

This paper deals with the problem of designing a controller for a class of discrete-time nonlinear systems which is represented by discrete-time polynomial fuzzy model. Most of the existing control design methods for discrete-time fuzzy polynomial systems cannot guarantee their Lyapunov function to be a radially unbounded polynomial function, hence the global stability cannot be assured. The proposed control design in this paper guarantees a radially unbounded polynomial Lyapunov functions which ensures global stability. In the proposed design, state feedback structure is considered and non-convexity problem is solved by incorporating an integrator into the controller. Sufficient conditions of stability are derived in terms of polynomial matrix inequalities which are solved via SOSTOOLS in MATLAB. A numerical example is presented to illustrate the effectiveness of the proposed controller.

The Integration of Continuous and Discrete Latent Variable Models: Potential Problems and Promising Opportunities

ERIC Educational Resources Information Center

Bauer, Daniel J.; Curran, Patrick J.

2004-01-01

Structural equation mixture modeling (SEMM) integrates continuous and discrete latent variable models. Drawing on prior research on the relationships between continuous and discrete latent variable models, the authors identify 3 conditions that may lead to the estimation of spurious latent classes in SEMM: misspecification of the structural model,…

Finite Mathematics and Discrete Mathematics: Is There a Difference?

ERIC Educational Resources Information Center

Johnson, Marvin L.

Discrete mathematics and finite mathematics differ in a number of ways. First, finite mathematics has a longer history and is therefore more stable in terms of course content. Finite mathematics courses emphasize certain particular mathematical tools which are useful in solving the problems of business and the social sciences. Discrete mathematics…

Discontinuous Finite Element Quasidiffusion Methods

DOE PAGES

Anistratov, Dmitriy Yurievich; Warsa, James S.

2018-05-21

Here in this paper, two-level methods for solving transport problems in one-dimensional slab geometry based on the quasi-diffusion (QD) method are developed. A linear discontinuous finite element method (LDFEM) is derived for the spatial discretization of the low-order QD (LOQD) equations. It involves special interface conditions at the cell edges based on the idea of QD boundary conditions (BCs). We consider different kinds of QD BCs to formulate the necessary cell-interface conditions. We develop two-level methods with independent discretization of the high-order transport equation and LOQD equations, where the transport equation is discretized using the method of characteristics and themore » LDFEM is applied to the LOQD equations. We also formulate closures that lead to the discretization consistent with a LDFEM discretization of the transport equation. The proposed methods are studied by means of test problems formulated with the method of manufactured solutions. Numerical experiments are presented demonstrating the performance of the proposed methods. Lastly, we also show that the method with independent discretization has the asymptotic diffusion limit.« less

Discontinuous Finite Element Quasidiffusion Methods

DOE Office of Scientific and Technical Information (OSTI.GOV)

Anistratov, Dmitriy Yurievich; Warsa, James S.

Here in this paper, two-level methods for solving transport problems in one-dimensional slab geometry based on the quasi-diffusion (QD) method are developed. A linear discontinuous finite element method (LDFEM) is derived for the spatial discretization of the low-order QD (LOQD) equations. It involves special interface conditions at the cell edges based on the idea of QD boundary conditions (BCs). We consider different kinds of QD BCs to formulate the necessary cell-interface conditions. We develop two-level methods with independent discretization of the high-order transport equation and LOQD equations, where the transport equation is discretized using the method of characteristics and themore » LDFEM is applied to the LOQD equations. We also formulate closures that lead to the discretization consistent with a LDFEM discretization of the transport equation. The proposed methods are studied by means of test problems formulated with the method of manufactured solutions. Numerical experiments are presented demonstrating the performance of the proposed methods. Lastly, we also show that the method with independent discretization has the asymptotic diffusion limit.« less

Unstructured Adaptive Meshes: Bad for Your Memory?

NASA Technical Reports Server (NTRS)

Biswas, Rupak; Feng, Hui-Yu; VanderWijngaart, Rob

2003-01-01

This viewgraph presentation explores the need for a NASA Advanced Supercomputing (NAS) parallel benchmark for problems with irregular dynamical memory access. This benchmark is important and necessary because: 1) Problems with localized error source benefit from adaptive nonuniform meshes; 2) Certain machines perform poorly on such problems; 3) Parallel implementation may provide further performance improvement but is difficult. Some examples of problems which use irregular dynamical memory access include: 1) Heat transfer problem; 2) Heat source term; 3) Spectral element method; 4) Base functions; 5) Elemental discrete equations; 6) Global discrete equations. Nonconforming Mesh and Mortar Element Method are covered in greater detail in this presentation.

Solutions of large-scale electromagnetics problems involving dielectric objects with the parallel multilevel fast multipole algorithm.

PubMed

Ergül, Özgür

2011-11-01

Fast and accurate solutions of large-scale electromagnetics problems involving homogeneous dielectric objects are considered. Problems are formulated with the electric and magnetic current combined-field integral equation and discretized with the Rao-Wilton-Glisson functions. Solutions are performed iteratively by using the multilevel fast multipole algorithm (MLFMA). For the solution of large-scale problems discretized with millions of unknowns, MLFMA is parallelized on distributed-memory architectures using a rigorous technique, namely, the hierarchical partitioning strategy. Efficiency and accuracy of the developed implementation are demonstrated on very large problems involving as many as 100 million unknowns.

Dynamic discrete tomography

NASA Astrophysics Data System (ADS)

Alpers, Andreas; Gritzmann, Peter

2018-03-01

We consider the problem of reconstructing the paths of a set of points over time, where, at each of a finite set of moments in time the current positions of points in space are only accessible through some small number of their x-rays. This particular particle tracking problem, with applications, e.g. in plasma physics, is the basic problem in dynamic discrete tomography. We introduce and analyze various different algorithmic models. In particular, we determine the computational complexity of the problem (and various of its relatives) and derive algorithms that can be used in practice. As a byproduct we provide new results on constrained variants of min-cost flow and matching problems.

Optimal control of LQR for discrete time-varying systems with input delays

NASA Astrophysics Data System (ADS)

Yin, Yue-Zhu; Yang, Zhong-Lian; Yin, Zhi-Xiang; Xu, Feng

2018-04-01

In this work, we consider the optimal control problem of linear quadratic regulation for discrete time-variant systems with single input and multiple input delays. An innovative and simple method to derive the optimal controller is given. The studied problem is first equivalently converted into a problem subject to a constraint condition. Last, with the established duality, the problem is transformed into a static mathematical optimisation problem without input delays. The optimal control input solution to minimise performance index function is derived by solving this optimisation problem with two methods. A numerical simulation example is carried out and its results show that our two approaches are both feasible and very effective.

Difference equation state approximations for nonlinear hereditary control problems

NASA Technical Reports Server (NTRS)

Rosen, I. G.

1982-01-01

Discrete approximation schemes for the solution of nonlinear hereditary control problems are constructed. The methods involve approximation by a sequence of optimal control problems in which the original infinite dimensional state equation has been approximated by a finite dimensional discrete difference equation. Convergence of the state approximations is argued using linear semigroup theory and is then used to demonstrate that solutions to the approximating optimal control problems in some sense approximate solutions to the original control problem. Two schemes, one based upon piecewise constant approximation, and the other involving spline functions are discussed. Numerical results are presented, analyzed and used to compare the schemes to other available approximation methods for the solution of hereditary control problems.

The emergence of temporal language in Nicaraguan Sign Language

PubMed Central

Kocab, Annemarie; Senghas, Ann; Snedeker, Jesse

2016-01-01

Understanding what uniquely human properties account for the creation and transmission of language has been a central goal of cognitive science. Recently, the study of emerging sign languages, such as Nicaraguan Sign Language (NSL), has offered the opportunity to better understand how languages are created and the roles of the individual learner and the community of users. Here, we examined the emergence of two types of temporal language in NSL, comparing the linguistic devices for conveying temporal information among three sequential age cohorts of signers. Experiment 1 showed that while all three cohorts of signers could communicate about linearly ordered discrete events, only the second and third generations of signers successfully communicated information about events with more complex temporal structure. Experiment 2 showed that signers could discriminate between the types of temporal events in a nonverbal task. Finally, Experiment 3 investigated the ordinal use of numbers (e.g., first, second) in NSL signers, indicating that one strategy younger signers might have for accurately describing events in time might be to use ordinal numbers to mark each event. While the capacity for representing temporal concepts appears to be present in the human mind from the onset of language creation, the linguistic devices to convey temporality do not appear immediately. Evidently, temporal language emerges over generations of language transmission, as a product of individual minds interacting within a community of users. PMID:27591549

The emergence of temporal language in Nicaraguan Sign Language.

PubMed

Kocab, Annemarie; Senghas, Ann; Snedeker, Jesse

2016-11-01

Understanding what uniquely human properties account for the creation and transmission of language has been a central goal of cognitive science. Recently, the study of emerging sign languages, such as Nicaraguan Sign Language (NSL), has offered the opportunity to better understand how languages are created and the roles of the individual learner and the community of users. Here, we examined the emergence of two types of temporal language in NSL, comparing the linguistic devices for conveying temporal information among three sequential age cohorts of signers. Experiment 1 showed that while all three cohorts of signers could communicate about linearly ordered discrete events, only the second and third generations of signers successfully communicated information about events with more complex temporal structure. Experiment 2 showed that signers could discriminate between the types of temporal events in a nonverbal task. Finally, Experiment 3 investigated the ordinal use of numbers (e.g., first, second) in NSL signers, indicating that one strategy younger signers might have for accurately describing events in time might be to use ordinal numbers to mark each event. While the capacity for representing temporal concepts appears to be present in the human mind from the onset of language creation, the linguistic devices to convey temporality do not appear immediately. Evidently, temporal language emerges over generations of language transmission, as a product of individual minds interacting within a community of users. Copyright © 2016 Elsevier B.V. All rights reserved.

Generating Multivariate Ordinal Data via Entropy Principles.

PubMed

Lee, Yen; Kaplan, David

2018-03-01

When conducting robustness research where the focus of attention is on the impact of non-normality, the marginal skewness and kurtosis are often used to set the degree of non-normality. Monte Carlo methods are commonly applied to conduct this type of research by simulating data from distributions with skewness and kurtosis constrained to pre-specified values. Although several procedures have been proposed to simulate data from distributions with these constraints, no corresponding procedures have been applied for discrete distributions. In this paper, we present two procedures based on the principles of maximum entropy and minimum cross-entropy to estimate the multivariate observed ordinal distributions with constraints on skewness and kurtosis. For these procedures, the correlation matrix of the observed variables is not specified but depends on the relationships between the latent response variables. With the estimated distributions, researchers can study robustness not only focusing on the levels of non-normality but also on the variations in the distribution shapes. A simulation study demonstrates that these procedures yield excellent agreement between specified parameters and those of estimated distributions. A robustness study concerning the effect of distribution shape in the context of confirmatory factor analysis shows that shape can affect the robust [Formula: see text] and robust fit indices, especially when the sample size is small, the data are severely non-normal, and the fitted model is complex.

Finite elements of nonlinear continua.

NASA Technical Reports Server (NTRS)

Oden, J. T.

1972-01-01

The finite element method is extended to a broad class of practical nonlinear problems, treating both theory and applications from a general and unifying point of view. The thermomechanical principles of continuous media and the properties of the finite element method are outlined, and are brought together to produce discrete physical models of nonlinear continua. The mathematical properties of the models are analyzed, and the numerical solution of the equations governing the discrete models is examined. The application of the models to nonlinear problems in finite elasticity, viscoelasticity, heat conduction, and thermoviscoelasticity is discussed. Other specific topics include the topological properties of finite element models, applications to linear and nonlinear boundary value problems, convergence, continuum thermodynamics, finite elasticity, solutions to nonlinear partial differential equations, and discrete models of the nonlinear thermomechanical behavior of dissipative media.

Revisiting the Scattering Greenhouse Effect of CO2 Ice Clouds

NASA Astrophysics Data System (ADS)

Kitzmann, D.

2016-02-01

Carbon dioxide ice clouds are thought to play an important role for cold terrestrial planets with thick CO2 dominated atmospheres. Various previous studies showed that a scattering greenhouse effect by carbon dioxide ice clouds could result in a massive warming of the planetary surface. However, all of these studies only employed simplified two-stream radiative transfer schemes to describe the anisotropic scattering. Using accurate radiative transfer models with a general discrete ordinate method, this study revisits this important effect and shows that the positive climatic impact of carbon dioxide clouds was strongly overestimated in the past. The revised scattering greenhouse effect can have important implications for the early Mars, but also for planets like the early Earth or the position of the outer boundary of the habitable zone.

Processing Ordinality and Quantity: The Case of Developmental Dyscalculia

PubMed Central

Rubinsten, Orly; Sury, Dana

2011-01-01

In contrast to quantity processing, up to date, the nature of ordinality has received little attention from researchers despite the fact that both quantity and ordinality are embodied in numerical information. Here we ask if there are two separate core systems that lie at the foundations of numerical cognition: (1) the traditionally and well accepted numerical magnitude system but also (2) core system for representing ordinal information. We report two novel experiments of ordinal processing that explored the relation between ordinal and numerical information processing in typically developing adults and adults with developmental dyscalculia (DD). Participants made “ordered” or “non-ordered” judgments about 3 groups of dots (non-symbolic numerical stimuli; in Experiment 1) and 3 numbers (symbolic task: Experiment 2). In contrast to previous findings and arguments about quantity deficit in DD participants, when quantity and ordinality are dissociated (as in the current tasks), DD participants exhibited a normal ratio effect in the non-symbolic ordinal task. They did not show, however, the ordinality effect. Ordinality effect in DD appeared only when area and density were randomized, but only in the descending direction. In the symbolic task, the ordinality effect was modulated by ratio and direction in both groups. These findings suggest that there might be two separate cognitive representations of ordinal and quantity information and that linguistic knowledge may facilitate estimation of ordinal information. PMID:21935374

Processing ordinality and quantity: the case of developmental dyscalculia.

PubMed

Rubinsten, Orly; Sury, Dana

2011-01-01

In contrast to quantity processing, up to date, the nature of ordinality has received little attention from researchers despite the fact that both quantity and ordinality are embodied in numerical information. Here we ask if there are two separate core systems that lie at the foundations of numerical cognition: (1) the traditionally and well accepted numerical magnitude system but also (2) core system for representing ordinal information. We report two novel experiments of ordinal processing that explored the relation between ordinal and numerical information processing in typically developing adults and adults with developmental dyscalculia (DD). Participants made "ordered" or "non-ordered" judgments about 3 groups of dots (non-symbolic numerical stimuli; in Experiment 1) and 3 numbers (symbolic task: Experiment 2). In contrast to previous findings and arguments about quantity deficit in DD participants, when quantity and ordinality are dissociated (as in the current tasks), DD participants exhibited a normal ratio effect in the non-symbolic ordinal task. They did not show, however, the ordinality effect. Ordinality effect in DD appeared only when area and density were randomized, but only in the descending direction. In the symbolic task, the ordinality effect was modulated by ratio and direction in both groups. These findings suggest that there might be two separate cognitive representations of ordinal and quantity information and that linguistic knowledge may facilitate estimation of ordinal information.

Discrete particle swarm optimization to solve multi-objective limited-wait hybrid flow shop scheduling problem

NASA Astrophysics Data System (ADS)

Santosa, B.; Siswanto, N.; Fiqihesa

2018-04-01

This paper proposes a discrete Particle Swam Optimization (PSO) to solve limited-wait hybrid flowshop scheduing problem with multi objectives. Flow shop schedulimg represents the condition when several machines are arranged in series and each job must be processed at each machine with same sequence. The objective functions are minimizing completion time (makespan), total tardiness time, and total machine idle time. Flow shop scheduling model always grows to cope with the real production system accurately. Since flow shop scheduling is a NP-Hard problem then the most suitable method to solve is metaheuristics. One of metaheuristics algorithm is Particle Swarm Optimization (PSO), an algorithm which is based on the behavior of a swarm. Originally, PSO was intended to solve continuous optimization problems. Since flow shop scheduling is a discrete optimization problem, then, we need to modify PSO to fit the problem. The modification is done by using probability transition matrix mechanism. While to handle multi objectives problem, we use Pareto Optimal (MPSO). The results of MPSO is better than the PSO because the MPSO solution set produced higher probability to find the optimal solution. Besides the MPSO solution set is closer to the optimal solution

Important features of home-based support services for older Australians and their informal carers.

PubMed

McCaffrey, Nikki; Gill, Liz; Kaambwa, Billingsley; Cameron, Ian D; Patterson, Jan; Crotty, Maria; Ratcliffe, Julie

2015-11-01

In Australia, newly initiated, publicly subsidised 'Home-Care Packages' designed to assist older people (≥ 65 years of age) living in their own home must now be offered on a 'consumer-directed care' (CDC) basis by service providers. However, CDC models have largely developed in the absence of evidence on users' views and preferences. The aim of this study was to determine what features (attributes) of consumer-directed, home-based support services are important to older people and their informal carers to inform the design of a discrete choice experiment (DCE). Semi-structured, face-to-face interviews were conducted in December 2012-November 2013 with 17 older people receiving home-based support services and 10 informal carers from 5 providers located in South Australia and New South Wales. Salient service characteristics important to participants were determined using thematic and constant comparative analysis and formulated into attributes and attribute levels for presentation within a DCE. Initially, eight broad themes were identified: information and knowledge, choice and control, self-managed continuum, effective co-ordination, effective communication, responsiveness and flexibility, continuity and planning. Attributes were formulated for the DCE by combining overlapping themes such as effective communication and co-ordination, and the self-managed continuum and planning into single attributes. Six salient service features that characterise consumer preferences for the provision of home-based support service models were identified: choice of provider, choice of support worker, flexibility in care activities provided, contact with the service co-ordinator, managing the budget and saving unspent funds. Best practice indicates that qualitative research with individuals who represent the population of interest should guide attribute selection for a DCE and this is the first study to employ such methods in aged care service provision. Further development of services could incorporate methods of consumer engagement such as DCEs which facilitate the identification and quantification of users' views and preferences on alternative models of delivery. © 2015 John Wiley & Sons Ltd.

[Development of New Mathematical Methodology in Air Traffic Control for the Analysis of Hybrid Systems

NASA Technical Reports Server (NTRS)

Hermann, Robert

1997-01-01

The aim of this research is to develop new mathematical methodology for the analysis of hybrid systems of the type involved in Air Traffic Control (ATC) problems. Two directions of investigation were initiated. The first used the methodology of nonlinear generalized functions, whose mathematical foundations were initiated by Colombeau and developed further by Oberguggenberger; it has been extended to apply to ordinary differential. Systems of the type encountered in control in joint work with the PI and M. Oberguggenberger. This involved a 'mixture' of 'continuous' and 'discrete' methodology. ATC clearly involves mixtures of two sorts of mathematical problems: (1) The 'continuous' dynamics of a standard control type described by ordinary differential equations (ODE) of the form: {dx/dt = f(x, u)} and (2) the discrete lattice dynamics involved of cellular automata. Most of the CA literature involves a discretization of a partial differential equation system of the type encountered in physics problems (e.g. fluid and gas problems). Both of these directions requires much thinking and new development of mathematical fundamentals before they may be utilized in the ATC work. Rather than consider CA as 'discretization' of PDE systems, I believe that the ATC applications will require a completely different and new mathematical methodology, a sort of discrete analogue of jet bundles and/or the sheaf-theoretic techniques to topologists. Here too, I have begun work on virtually 'virgin' mathematical ground (at least from an 'applied' point of view) which will require considerable preliminary work.

Problems with heterogeneous and non-isotropic media or distorted grids

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hyman, J.; Shashkov, M.; Steinberg, S.

1996-08-01

This paper defines discretizations of the divergence and flux operators that produce symmetric, positive-definite, and accurate approximations to steady-state diffusion problems. Because discontinuous material properties and highly distorted grids are allowed, the flux operator, rather than the gradient, is used as a fundamental operator to be discretized. Resulting finite-difference scheme is similar to those obtained from the mixed finite-element method.

Stochastic Adaptive Estimation and Control.

DTIC Science & Technology

1994-10-26

Marcus, "Language Stability and Stabilizability of Discrete Event Dynamical Systems ," SIAM Journal on Control and Optimization, 31, September 1993...in the hierarchical control of flexible manufacturing systems ; in this problem, the model involves a hybrid process in continuous time whose state is...of the average cost control problem for discrete- time Markov processes. Our exposition covers from finite to Borel state and action spaces and

Adjoint-Based Methodology for Time-Dependent Optimization

NASA Technical Reports Server (NTRS)

Yamaleev, N. K.; Diskin, B.; Nielsen, E. J.

2008-01-01

This paper presents a discrete adjoint method for a broad class of time-dependent optimization problems. The time-dependent adjoint equations are derived in terms of the discrete residual of an arbitrary finite volume scheme which approximates unsteady conservation law equations. Although only the 2-D unsteady Euler equations are considered in the present analysis, this time-dependent adjoint method is applicable to the 3-D unsteady Reynolds-averaged Navier-Stokes equations with minor modifications. The discrete adjoint operators involving the derivatives of the discrete residual and the cost functional with respect to the flow variables are computed using a complex-variable approach, which provides discrete consistency and drastically reduces the implementation and debugging cycle. The implementation of the time-dependent adjoint method is validated by comparing the sensitivity derivative with that obtained by forward mode differentiation. Our numerical results show that O(10) optimization iterations of the steepest descent method are needed to reduce the objective functional by 3-6 orders of magnitude for test problems considered.

Discrete Structure-Point Testing: Problems and Alternatives. TESL Reporter, Vol. 9, No. 4.

ERIC Educational Resources Information Center

Aitken, Kenneth G.

This paper presents some reasons for reconsidering the use of discrete structure-point tests of language proficiency, and suggests an alternative basis for designing proficiency tests. Discrete point tests are one of the primary tools of the audio-lingual method of teaching a foreign language and are based on certain assumptions, including the…

Conservative discretization of the Landau collision integral

DOE PAGES

Hirvijoki, E.; Adams, M. F.

2017-03-28

Here we describe a density, momentum-, and energy-conserving discretization of the nonlinear Landau collision integral. The method is suitable for both the finite-element and discontinuous Galerkin methods and does not require structured meshes. The conservation laws for the discretization are proven algebraically and demonstrated numerically for an axially symmetric nonlinear relaxation problem using a finite-element implementation.

A homogenization-based quasi-discrete method for the fracture of heterogeneous materials

NASA Astrophysics Data System (ADS)

Berke, P. Z.; Peerlings, R. H. J.; Massart, T. J.; Geers, M. G. D.

2014-05-01

The understanding and the prediction of the failure behaviour of materials with pronounced microstructural effects is of crucial importance. This paper presents a novel computational methodology for the handling of fracture on the basis of the microscale behaviour. The basic principles presented here allow the incorporation of an adaptive discretization scheme of the structure as a function of the evolution of strain localization in the underlying microstructure. The proposed quasi-discrete methodology bridges two scales: the scale of the material microstructure, modelled with a continuum type description; and the structural scale, where a discrete description of the material is adopted. The damaging material at the structural scale is divided into unit volumes, called cells, which are represented as a discrete network of points. The scale transition is inspired by computational homogenization techniques; however it does not rely on classical averaging theorems. The structural discrete equilibrium problem is formulated in terms of the underlying fine scale computations. Particular boundary conditions are developed on the scale of the material microstructure to address damage localization problems. The performance of this quasi-discrete method with the enhanced boundary conditions is assessed using different computational test cases. The predictions of the quasi-discrete scheme agree well with reference solutions obtained through direct numerical simulations, both in terms of crack patterns and load versus displacement responses.

Galerkin v. discrete-optimal projection in nonlinear model reduction

DOE Office of Scientific and Technical Information (OSTI.GOV)

Carlberg, Kevin Thomas; Barone, Matthew Franklin; Antil, Harbir

Discrete-optimal model-reduction techniques such as the Gauss{Newton with Approximated Tensors (GNAT) method have shown promise, as they have generated stable, accurate solutions for large-scale turbulent, compressible ow problems where standard Galerkin techniques have failed. However, there has been limited comparative analysis of the two approaches. This is due in part to difficulties arising from the fact that Galerkin techniques perform projection at the time-continuous level, while discrete-optimal techniques do so at the time-discrete level. This work provides a detailed theoretical and experimental comparison of the two techniques for two common classes of time integrators: linear multistep schemes and Runge{Kutta schemes.more » We present a number of new ndings, including conditions under which the discrete-optimal ROM has a time-continuous representation, conditions under which the two techniques are equivalent, and time-discrete error bounds for the two approaches. Perhaps most surprisingly, we demonstrate both theoretically and experimentally that decreasing the time step does not necessarily decrease the error for the discrete-optimal ROM; instead, the time step should be `matched' to the spectral content of the reduced basis. In numerical experiments carried out on a turbulent compressible- ow problem with over one million unknowns, we show that increasing the time step to an intermediate value decreases both the error and the simulation time of the discrete-optimal reduced-order model by an order of magnitude.« less

Directive sources in acoustic discrete-time domain simulations based on directivity diagrams.

PubMed

Escolano, José; López, José J; Pueo, Basilio

2007-06-01

Discrete-time domain methods provide a simple and flexible way to solve initial boundary value problems. With regard to the sources in such methods, only monopoles or dipoles can be considered. However, in many problems such as room acoustics, the radiation of realistic sources is directional-dependent and their directivity patterns have a clear influence on the total sound field. In this letter, a method to synthesize the directivity of sources is proposed, especially in cases where the knowledge is only based on discrete values of the directivity diagram. Some examples have been carried out in order to show the behavior and accuracy of the proposed method.

Control of discrete time systems based on recurrent Super-Twisting-like algorithm.

PubMed

Salgado, I; Kamal, S; Bandyopadhyay, B; Chairez, I; Fridman, L

2016-09-01

Most of the research in sliding mode theory has been carried out to in continuous time to solve the estimation and control problems. However, in discrete time, the results in high order sliding modes have been less developed. In this paper, a discrete time super-twisting-like algorithm (DSTA) was proposed to solve the problems of control and state estimation. The stability proof was developed in terms of the discrete time Lyapunov approach and the linear matrix inequalities theory. The system trajectories were ultimately bounded inside a small region dependent on the sampling period. Simulation results tested the DSTA. The DSTA was applied as a controller for a Furuta pendulum and for a DC motor supplied by a DSTA signal differentiator. Copyright © 2016 ISA. Published by Elsevier Ltd. All rights reserved.

Enabling the extended compact genetic algorithm for real-parameter optimization by using adaptive discretization.

PubMed

Chen, Ying-ping; Chen, Chao-Hong

2010-01-01

An adaptive discretization method, called split-on-demand (SoD), enables estimation of distribution algorithms (EDAs) for discrete variables to solve continuous optimization problems. SoD randomly splits a continuous interval if the number of search points within the interval exceeds a threshold, which is decreased at every iteration. After the split operation, the nonempty intervals are assigned integer codes, and the search points are discretized accordingly. As an example of using SoD with EDAs, the integration of SoD and the extended compact genetic algorithm (ECGA) is presented and numerically examined. In this integration, we adopt a local search mechanism as an optional component of our back end optimization engine. As a result, the proposed framework can be considered as a memetic algorithm, and SoD can potentially be applied to other memetic algorithms. The numerical experiments consist of two parts: (1) a set of benchmark functions on which ECGA with SoD and ECGA with two well-known discretization methods: the fixed-height histogram (FHH) and the fixed-width histogram (FWH) are compared; (2) a real-world application, the economic dispatch problem, on which ECGA with SoD is compared to other methods. The experimental results indicate that SoD is a better discretization method to work with ECGA. Moreover, ECGA with SoD works quite well on the economic dispatch problem and delivers solutions better than the best known results obtained by other methods in existence.

The effect of ordinances requiring smoke-free restaurants and bars on revenues: a follow-up.

PubMed Central

Glantz, S A; Smith, L R

1997-01-01

OBJECTIVES: The purpose of this study was to extend an earlier evaluation of the economic effects of ordinances requiring smoke-free restaurants and bars. METHODS: Sales tax data for 15 cities with smoke-free restaurant ordinances, 5 cities and 2 counties with smoke-free bar ordinances, and matched comparison locations were analyzed by multiple regression, including time and a dummy variable for the ordinance. RESULTS: Ordinances had no significant effect on the fraction of total retail sales that went to eating and drinking places or on the ratio between sales in communities with ordinances and sales in comparison communities. Ordinances requiring smoke-free bars had no significant effect on the fraction of revenues going to eating and drinking places that serve all types of liquor. CONCLUSIONS: Smoke-free ordinances do not adversely affect either restaurant or bar sales. PMID:9357356

Partial differential equations constrained combinatorial optimization on an adiabatic quantum computer

NASA Astrophysics Data System (ADS)

Chandra, Rishabh

Partial differential equation-constrained combinatorial optimization (PDECCO) problems are a mixture of continuous and discrete optimization problems. PDECCO problems have discrete controls, but since the partial differential equations (PDE) are continuous, the optimization space is continuous as well. Such problems have several applications, such as gas/water network optimization, traffic optimization, micro-chip cooling optimization, etc. Currently, no efficient classical algorithm which guarantees a global minimum for PDECCO problems exists. A new mapping has been developed that transforms PDECCO problem, which only have linear PDEs as constraints, into quadratic unconstrained binary optimization (QUBO) problems that can be solved using an adiabatic quantum optimizer (AQO). The mapping is efficient, it scales polynomially with the size of the PDECCO problem, requires only one PDE solve to form the QUBO problem, and if the QUBO problem is solved correctly and efficiently on an AQO, guarantees a global optimal solution for the original PDECCO problem.

Difference equation state approximations for nonlinear hereditary control problems

NASA Technical Reports Server (NTRS)

Rosen, I. G.

1984-01-01

Discrete approximation schemes for the solution of nonlinear hereditary control problems are constructed. The methods involve approximation by a sequence of optimal control problems in which the original infinite dimensional state equation has been approximated by a finite dimensional discrete difference equation. Convergence of the state approximations is argued using linear semigroup theory and is then used to demonstrate that solutions to the approximating optimal control problems in some sense approximate solutions to the original control problem. Two schemes, one based upon piecewise constant approximation, and the other involving spline functions are discussed. Numerical results are presented, analyzed and used to compare the schemes to other available approximation methods for the solution of hereditary control problems. Previously announced in STAR as N83-33589

Element Verification and Comparison in Sierra/Solid Mechanics Problems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ohashi, Yuki; Roth, William

2016-05-01

The goal of this project was to study the effects of element selection on the Sierra/SM solutions to five common solid mechanics problems. A total of nine element formulations were used for each problem. The models were run multiple times with varying spatial and temporal discretization in order to ensure convergence. The first four problems have been compared to analytical solutions, and all numerical results were found to be sufficiently accurate. The penetration problem was found to have a high mesh dependence in terms of element type, mesh discretization, and meshing scheme. Also, the time to solution is shown formore » each problem in order to facilitate element selection when computer resources are limited.« less

First-Order Hyperbolic System Method for Time-Dependent Advection-Diffusion Problems

NASA Technical Reports Server (NTRS)

Mazaheri, Alireza; Nishikawa, Hiroaki

2014-01-01

A time-dependent extension of the first-order hyperbolic system method for advection-diffusion problems is introduced. Diffusive/viscous terms are written and discretized as a hyperbolic system, which recovers the original equation in the steady state. The resulting scheme offers advantages over traditional schemes: a dramatic simplification in the discretization, high-order accuracy in the solution gradients, and orders-of-magnitude convergence acceleration. The hyperbolic advection-diffusion system is discretized by the second-order upwind residual-distribution scheme in a unified manner, and the system of implicit-residual-equations is solved by Newton's method over every physical time step. The numerical results are presented for linear and nonlinear advection-diffusion problems, demonstrating solutions and gradients produced to the same order of accuracy, with rapid convergence over each physical time step, typically less than five Newton iterations.

On the computational aspects of comminution in discrete element method

NASA Astrophysics Data System (ADS)

Chaudry, Mohsin Ali; Wriggers, Peter

2018-04-01

In this paper, computational aspects of crushing/comminution of granular materials are addressed. For crushing, maximum tensile stress-based criterion is used. Crushing model in discrete element method (DEM) is prone to problems of mass conservation and reduction in critical time step. The first problem is addressed by using an iterative scheme which, depending on geometric voids, recovers mass of a particle. In addition, a global-local framework for DEM problem is proposed which tends to alleviate the local unstable motion of particles and increases the computational efficiency.

Distributed consensus for discrete-time heterogeneous multi-agent systems

NASA Astrophysics Data System (ADS)

Zhao, Huanyu; Fei, Shumin

2018-06-01

This paper studies the consensus problem for a class of discrete-time heterogeneous multi-agent systems. Two kinds of consensus algorithms will be considered. The heterogeneous multi-agent systems considered are converted into equivalent error systems by a model transformation. Then we analyse the consensus problem of the original systems by analysing the stability problem of the error systems. Some sufficient conditions for consensus of heterogeneous multi-agent systems are obtained by applying algebraic graph theory and matrix theory. Simulation examples are presented to show the usefulness of the results.

Sensitivity of Fit Indices to Fake Perturbation of Ordinal Data: A Sample by Replacement Approach

ERIC Educational Resources Information Center

Lombardi, Luigi; Pastore, Massimiliano

2012-01-01

In many psychological questionnaires the need to analyze empirical data raises the fundamental problem of possible fake or fraudulent observations in the data. This aspect is particularly relevant for researchers working on sensitive topics such as, for example, risky sexual behaviors and drug addictions. Our contribution presents a new…

The Problem of Catholic School Teachers Deferring to the Home on Controversial Religious Issues

ERIC Educational Resources Information Center

McDonough, Graham P.

2010-01-01

This paper observes that an ironic tension occurs in the discussion of controversial issues in some Catholic schools. One technique that teachers use in response to student disagreement with the official Church view on a controversial issue like contraception, homosexuality, or female ordination is to present Church teaching but then suggest that…

Improving Your Exploratory Factor Analysis for Ordinal Data: A Demonstration Using FACTOR

ERIC Educational Resources Information Center

Baglin, James

2014-01-01

Exploratory factor analysis (EFA) methods are used extensively in the field of assessment and evaluation. Due to EFA's widespread use, common methods and practices have come under close scrutiny. A substantial body of literature has been compiled highlighting problems with many of the methods and practices used in EFA, and, in response, many…

A Fuzzy Group Decision Making Model for Ordinal Peer Assessment

ERIC Educational Resources Information Center

Capuano, Nicola; Loia, Vincenzo; Orciuoli, Francesco

2017-01-01

Massive Open Online Courses (MOOCs) are becoming an increasingly popular choice for education but, to reach their full extent, they require the resolution of new issues like assessing students at scale. A feasible approach to tackle this problem is peer assessment, in which students also play the role of assessor for assignments submitted by…

Mapping of uncertainty relations between continuous and discrete time

NASA Astrophysics Data System (ADS)

Chiuchiú, Davide; Pigolotti, Simone

2018-03-01

Lower bounds on fluctuations of thermodynamic currents depend on the nature of time, discrete or continuous. To understand the physical reason, we compare current fluctuations in discrete-time Markov chains and continuous-time master equations. We prove that current fluctuations in the master equations are always more likely, due to random timings of transitions. This comparison leads to a mapping of the moments of a current between discrete and continuous time. We exploit this mapping to obtain uncertainty bounds. Our results reduce the quests for uncertainty bounds in discrete and continuous time to a single problem.

Mapping of uncertainty relations between continuous and discrete time.

PubMed

Chiuchiù, Davide; Pigolotti, Simone

2018-03-01

Lower bounds on fluctuations of thermodynamic currents depend on the nature of time, discrete or continuous. To understand the physical reason, we compare current fluctuations in discrete-time Markov chains and continuous-time master equations. We prove that current fluctuations in the master equations are always more likely, due to random timings of transitions. This comparison leads to a mapping of the moments of a current between discrete and continuous time. We exploit this mapping to obtain uncertainty bounds. Our results reduce the quests for uncertainty bounds in discrete and continuous time to a single problem.

Optimal resolution in maximum entropy image reconstruction from projections with multigrid acceleration

NASA Technical Reports Server (NTRS)

Limber, Mark A.; Manteuffel, Thomas A.; Mccormick, Stephen F.; Sholl, David S.

1993-01-01

We consider the problem of image reconstruction from a finite number of projections over the space L(sup 1)(Omega), where Omega is a compact subset of the set of Real numbers (exp 2). We prove that, given a discretization of the projection space, the function that generates the correct projection data and maximizes the Boltzmann-Shannon entropy is piecewise constant on a certain discretization of Omega, which we call the 'optimal grid'. It is on this grid that one obtains the maximum resolution given the problem setup. The size of this grid grows very quickly as the number of projections and number of cells per projection grow, indicating fast computational methods are essential to make its use feasible. We use a Fenchel duality formulation of the problem to keep the number of variables small while still using the optimal discretization, and propose a multilevel scheme to improve convergence of a simple cyclic maximization scheme applied to the dual problem.

An efficient numerical method for the solution of the problem of elasticity for 3D-homogeneous elastic medium with cracks and inclusions

NASA Astrophysics Data System (ADS)

Kanaun, S.; Markov, A.

2017-06-01

An efficient numerical method for solution of static problems of elasticity for an infinite homogeneous medium containing inhomogeneities (cracks and inclusions) is developed. Finite number of heterogeneous inclusions and planar parallel cracks of arbitrary shapes is considered. The problem is reduced to a system of surface integral equations for crack opening vectors and volume integral equations for stress tensors inside the inclusions. For the numerical solution of these equations, a class of Gaussian approximating functions is used. The method based on these functions is mesh free. For such functions, the elements of the matrix of the discretized system are combinations of explicit analytical functions and five standard 1D-integrals that can be tabulated. Thus, the numerical integration is excluded from the construction of the matrix of the discretized problem. For regular node grids, the matrix of the discretized system has Toeplitz's properties, and Fast Fourier Transform technique can be used for calculation matrix-vector products of such matrices.

A discontinuous Galerkin method for nonlinear parabolic equations and gradient flow problems with interaction potentials

NASA Astrophysics Data System (ADS)

Sun, Zheng; Carrillo, José A.; Shu, Chi-Wang

2018-01-01

We consider a class of time-dependent second order partial differential equations governed by a decaying entropy. The solution usually corresponds to a density distribution, hence positivity (non-negativity) is expected. This class of problems covers important cases such as Fokker-Planck type equations and aggregation models, which have been studied intensively in the past decades. In this paper, we design a high order discontinuous Galerkin method for such problems. If the interaction potential is not involved, or the interaction is defined by a smooth kernel, our semi-discrete scheme admits an entropy inequality on the discrete level. Furthermore, by applying the positivity-preserving limiter, our fully discretized scheme produces non-negative solutions for all cases under a time step constraint. Our method also applies to two dimensional problems on Cartesian meshes. Numerical examples are given to confirm the high order accuracy for smooth test cases and to demonstrate the effectiveness for preserving long time asymptotics.

On Efficient Deployment of Wireless Sensors for Coverage and Connectivity in Constrained 3D Space.

PubMed

Wu, Chase Q; Wang, Li

2017-10-10

Sensor networks have been used in a rapidly increasing number of applications in many fields. This work generalizes a sensor deployment problem to place a minimum set of wireless sensors at candidate locations in constrained 3D space to k -cover a given set of target objects. By exhausting the combinations of discreteness/continuousness constraints on either sensor locations or target objects, we formulate four classes of sensor deployment problems in 3D space: deploy sensors at Discrete/Continuous Locations (D/CL) to cover Discrete/Continuous Targets (D/CT). We begin with the design of an approximate algorithm for DLDT and then reduce DLCT, CLDT, and CLCT to DLDT by discretizing continuous sensor locations or target objects into a set of divisions without sacrificing sensing precision. Furthermore, we consider a connected version of each problem where the deployed sensors must form a connected network, and design an approximation algorithm to minimize the number of deployed sensors with connectivity guarantee. For performance comparison, we design and implement an optimal solution and a genetic algorithm (GA)-based approach. Extensive simulation results show that the proposed deployment algorithms consistently outperform the GA-based heuristic and achieve a close-to-optimal performance in small-scale problem instances and a significantly superior overall performance than the theoretical upper bound.

Discretization chaos - Feedback control and transition to chaos

NASA Technical Reports Server (NTRS)

Grantham, Walter J.; Athalye, Amit M.

1990-01-01

Problems in the design of feedback controllers for chaotic dynamical systems are considered theoretically, focusing on two cases where chaos arises only when a nonchaotic continuous-time system is discretized into a simpler discrete-time systems (exponential discretization and pseudo-Euler integration applied to Lotka-Volterra competition and prey-predator systems). Numerical simulation results are presented in extensive graphs and discussed in detail. It is concluded that care must be taken in applying standard dynamical-systems methods to control systems that may be discontinuous or nondifferentiable.

Variable Weight Fractional Collisions for Multiple Species Mixtures

DTIC Science & Technology

2017-08-28

DISTRIBUTION A: APPROVED FOR PUBLIC RELEASE; DISTRIBUTION UNLIMITED; PA #17517 6 / 21 VARIABLE WEIGHTS FOR DYNAMIC RANGE Continuum to Discrete ...Representation: Many Particles →̃ Continuous Distribution Discretized VDF Yields Vlasov But Collision Integral Still a Problem Particle Methods VDF to Delta...Function Set Collisions between Discrete Velocities But Poorly Resolved Tail (Tail Critical to Inelastic Collisions) Variable Weights Permit Extra DOF in

High mobility of large mass movements: a study by means of FEM/DEM simulations

NASA Astrophysics Data System (ADS)

Manzella, I.; Lisjak, A.; Grasselli, G.

2013-12-01

Large mass movements, such as rock avalanches and large volcanic debris avalanches are characterized by extremely long propagation, which cannot be modelled using normal sliding friction law. For this reason several studies and theories derived from field observation, physical theories and laboratory experiments, exist to try to explain their high mobility. In order to investigate more into deep some of the processes recalled by these theories, simulations have been run with a new numerical tool called Y-GUI based on the Finite Element-Discrete Element Method FEM/DEM. The FEM/DEM method is a numerical technique developed by Munjiza et al. (1995) where Discrete Element Method (DEM) algorithms are used to model the interaction between different solids, while Finite Element Method (FEM) principles are used to analyze their deformability being also able to explicitly simulate material sudden loss of cohesion (i.e. brittle failure). In particular numerical tests have been run, inspired by the small-scale experiments done by Manzella and Labiouse (2013). They consist of rectangular blocks released on a slope; each block is a rectangular discrete element made of a mesh of finite elements enabled to fragment. These simulations have highlighted the influence on the propagation of block packing, i.e. whether the elements are piled into geometrical ordinate structure before failure or they are chaotically disposed as a loose material, and of the topography, i.e. whether the slope break is smooth and regular or not. In addition the effect of fracturing, i.e. fragmentation, on the total runout have been studied and highlighted.

Squeezing Interval Change From Ordinal Panel Data: Latent Growth Curves With Ordinal Outcomes

ERIC Educational Resources Information Center

Mehta, Paras D.; Neale, Michael C.; Flay, Brian R.

2004-01-01

A didactic on latent growth curve modeling for ordinal outcomes is presented. The conceptual aspects of modeling growth with ordinal variables and the notion of threshold invariance are illustrated graphically using a hypothetical example. The ordinal growth model is described in terms of 3 nested models: (a) multivariate normality of the…

Building code compliance and enforcement: The experience of San Francisco's residential energy conservation ordinance and California's building standards for new construction

DOE Office of Scientific and Technical Information (OSTI.GOV)

Vine, E.

1990-11-01

As part of Lawrence Berkeley Laboratory's (LBL) technical assistance to the Sustainable City Project, compliance and enforcement activities related to local and state building codes for existing and new construction were evaluated in two case studies. The analysis of the City of San Francisco's Residential Energy Conservation Ordinance (RECO) showed that a limited, prescriptive energy conservation ordinance for existing residential construction can be enforced relatively easily with little administrative costs, and that compliance with such ordinances can be quite high. Compliance with the code was facilitated by extensive publicity, an informed public concerned with the cost of energy and knowledgeablemore » about energy efficiency, the threat of punishment (Order of Abatement), the use of private inspectors, and training workshops for City and private inspectors. The analysis of California's Title 24 Standards for new residential and commercial construction showed that enforcement of this type of code for many climate zones is more complex and requires extensive administrative support for education and training of inspectors, architects, engineers, and builders. Under this code, prescriptive and performance approaches for compliance are permitted, resulting in the demand for alternative methods of enforcement: technical assistance, plan review, field inspection, and computer analysis. In contrast to existing to construction, building design and new materials and construction practices are of critical importance in new construction, creating a need for extensive technical assistance and extensive interaction between enforcement personnel and the building community. Compliance problems associated with building design and installation did occur in both residential and nonresidential buildings. 12 refs., 5 tabs.« less

R programming for parameters estimation of geographically weighted ordinal logistic regression (GWOLR) model based on Newton Raphson

NASA Astrophysics Data System (ADS)

Zuhdi, Shaifudin; Saputro, Dewi Retno Sari

2017-03-01

GWOLR model used for represent relationship between dependent variable has categories and scale of category is ordinal with independent variable influenced the geographical location of the observation site. Parameters estimation of GWOLR model use maximum likelihood provide system of nonlinear equations and hard to be found the result in analytic resolution. By finishing it, it means determine the maximum completion, this thing associated with optimizing problem. The completion nonlinear system of equations optimize use numerical approximation, which one is Newton Raphson method. The purpose of this research is to make iteration algorithm Newton Raphson and program using R software to estimate GWOLR model. Based on the research obtained that program in R can be used to estimate the parameters of GWOLR model by forming a syntax program with command "while".

Test Statistics and Confidence Intervals to Establish Noninferiority between Treatments with Ordinal Categorical Data.

PubMed

Zhang, Fanghong; Miyaoka, Etsuo; Huang, Fuping; Tanaka, Yutaka

2015-01-01

The problem for establishing noninferiority is discussed between a new treatment and a standard (control) treatment with ordinal categorical data. A measure of treatment effect is used and a method of specifying noninferiority margin for the measure is provided. Two Z-type test statistics are proposed where the estimation of variance is constructed under the shifted null hypothesis using U-statistics. Furthermore, the confidence interval and the sample size formula are given based on the proposed test statistics. The proposed procedure is applied to a dataset from a clinical trial. A simulation study is conducted to compare the performance of the proposed test statistics with that of the existing ones, and the results show that the proposed test statistics are better in terms of the deviation from nominal level and the power.

Gaussian quadrature and lattice discretization of the Fermi-Dirac distribution for graphene.

PubMed

Oettinger, D; Mendoza, M; Herrmann, H J

2013-07-01

We construct a lattice kinetic scheme to study electronic flow in graphene. For this purpose, we first derive a basis of orthogonal polynomials, using as the weight function the ultrarelativistic Fermi-Dirac distribution at rest. Later, we use these polynomials to expand the respective distribution in a moving frame, for both cases, undoped and doped graphene. In order to discretize the Boltzmann equation and make feasible the numerical implementation, we reduce the number of discrete points in momentum space to 18 by applying a Gaussian quadrature, finding that the family of representative wave (2+1)-vectors, which satisfies the quadrature, reconstructs a honeycomb lattice. The procedure and discrete model are validated by solving the Riemann problem, finding excellent agreement with other numerical models. In addition, we have extended the Riemann problem to the case of different dopings, finding that by increasing the chemical potential the electronic fluid behaves as if it increases its effective viscosity.

Diversion of mentally disordered people from the criminal justice system in England and Wales: An overview.

PubMed

James, David V

2010-01-01

The form that diversion mechanisms take in a given jurisdiction will be influenced both by mental health law and sentencing policies, and by the structure of criminal justice and health care systems. In England and Wales, treatment in hospital in lieu of any other sentence is available as a disposal option following a finding of guilt. In addition, there is a National Health Service, free at the point of delivery, the existence of which creates the potential for a co-ordinated nationwide response to mental disorder within the criminal justice system. In recent years, the National Health Service has taken over the delivery of health care in prisons, including psychiatric services, with the principle being one of equivalence between the quality of health provision provided in the community and that provided in prisons. However, problems within the system dictate that an important place remains for add-on diversion initiatives at courts and police stations, which aim to circumvent some of the delays in dealing with mentally disordered people or to prevent them entering the criminal justice system in the first place. It has been demonstrated that such mechanisms can be highly effective, and a government-sponsored review in 1992 recommended their general adoption. A lack of central co-ordination determined that progress was very slow. A new government-commissioned report in 2009 set out detailed recommendations for reform throughout the system. It laid emphasis on a co-ordinated response at all levels and between all agencies, and placed importance on linking initiatives with community services and with preventative measures, including attention to the effects of social exclusion. Some grounds for optimism exist, although there are particular problems in implementing change at a time of financial austerity. Copyright 2010 Elsevier Ltd. All rights reserved.

Computing approximate solutions of the protein structure determination problem using global constraints on discrete crystal lattices.

PubMed

Dal Palù, Alessandro; Dovier, Agostino; Pontelli, Enrico

2010-01-01

Crystal lattices are discrete models of the three-dimensional space that have been effectively employed to facilitate the task of determining proteins' natural conformation. This paper investigates alternative global constraints that can be introduced in a constraint solver over discrete crystal lattices. The objective is to enhance the efficiency of lattice solvers in dealing with the construction of approximate solutions of the protein structure determination problem. Some of them (e.g., self-avoiding-walk) have been explicitly or implicitly already used in previous approaches, while others (e.g., the density constraint) are new. The intrinsic complexities of all of them are studied and preliminary experimental results are discussed.

3D Discrete element approach to the problem on abutment pressure in a gently dipping coal seam

NASA Astrophysics Data System (ADS)

Klishin, S. V.; Revuzhenko, A. F.

2017-09-01

Using the discrete element method, the authors have carried out 3D implementation of the problem on strength loss in surrounding rock mass in the vicinity of a production heading and on abutment pressure in a gently dripping coal seam. The calculation of forces at the contacts between particles accounts for friction, rolling resistance and viscosity. Between discrete particles modeling coal seam, surrounding rock mass and broken rocks, an elastic connecting element is introduced to allow simulating coherent materials. The paper presents the kinematic patterns of rock mass deformation, stresses in particles and the graph of the abutment pressure behavior in the coal seam.

Continuous Measurements and Quantitative Constraints: Challenge Problems for Discrete Modeling Techniques

NASA Technical Reports Server (NTRS)

Goodrich, Charles H.; Kurien, James; Clancy, Daniel (Technical Monitor)

2001-01-01

We present some diagnosis and control problems that are difficult to solve with discrete or purely qualitative techniques. We analyze the nature of the problems, classify them and explain why they are frequently encountered in systems with closed loop control. This paper illustrates the problem with several examples drawn from industrial and aerospace applications and presents detailed information on one important application: In-Situ Resource Utilization (ISRU) on Mars. The model for an ISRU plant is analyzed showing where qualitative techniques are inadequate to identify certain failure modes and to maintain control of the system in degraded environments. We show why the solution to the problem will result in significantly more robust and reliable control systems. Finally, we illustrate requirements for a solution to the problem by means of examples.

Discrete-time neural network for fast solving large linear L1 estimation problems and its application to image restoration.

PubMed

Xia, Youshen; Sun, Changyin; Zheng, Wei Xing

2012-05-01

There is growing interest in solving linear L1 estimation problems for sparsity of the solution and robustness against non-Gaussian noise. This paper proposes a discrete-time neural network which can calculate large linear L1 estimation problems fast. The proposed neural network has a fixed computational step length and is proved to be globally convergent to an optimal solution. Then, the proposed neural network is efficiently applied to image restoration. Numerical results show that the proposed neural network is not only efficient in solving degenerate problems resulting from the nonunique solutions of the linear L1 estimation problems but also needs much less computational time than the related algorithms in solving both linear L1 estimation and image restoration problems.

Vectorization and parallelization of the finite strip method for dynamic Mindlin plate problems

NASA Technical Reports Server (NTRS)

Chen, Hsin-Chu; He, Ai-Fang

1993-01-01

The finite strip method is a semi-analytical finite element process which allows for a discrete analysis of certain types of physical problems by discretizing the domain of the problem into finite strips. This method decomposes a single large problem into m smaller independent subproblems when m harmonic functions are employed, thus yielding natural parallelism at a very high level. In this paper we address vectorization and parallelization strategies for the dynamic analysis of simply-supported Mindlin plate bending problems and show how to prevent potential conflicts in memory access during the assemblage process. The vector and parallel implementations of this method and the performance results of a test problem under scalar, vector, and vector-concurrent execution modes on the Alliant FX/80 are also presented.

Calculations of the skyshine gamma-ray dose rates from independent spent fuel storage installations (ISFSI) under worst case accident conditions

DOE Office of Scientific and Technical Information (OSTI.GOV)

Pace, J.V. III; Cramer, S.N.; Knight, J.R.

1980-09-01

Calculations of the skyshine gamma-ray dose rates from three spent fuel storage pools under worst case accident conditions have been made using the discrete ordinates code DOT-IV and the Monte Carlo code MORSE and have been compared to those of two previous methods. The DNA 37N-21G group cross-section library was utilized in the calculations, together with the Claiborne-Trubey gamma-ray dose factors taken from the same library. Plots of all results are presented. It was found that the dose was a strong function of the iron thickness over the fuel assemblies, the initial angular distribution of the emitted radiation, and themore » photon source near the top of the assemblies. 16 refs., 11 figs., 7 tabs.« less

Shock-wave structure in a partially ionized gas

NASA Technical Reports Server (NTRS)

Lu, C. S.; Huang, A. B.

1974-01-01

The structure of a steady plane shock in a partially ionized gas has been investigated using the Boltzmann equation with a kinetic model as the governing equation and the discrete ordinate method as a tool. The effects of the electric field induced by the charge separation on the shock structure have also been studied. Although the three species of an ionized gas travel with approximately the same macroscopic velocity, the individual distribution functions are found to be very different. In a strong shock the atom distribution function may have double peaks, while the ion distribution function has only one peak. Electrons are heated up much earlier than ions and atoms in a partially ionized gas. Because the interactions of electrons with atoms and with ions are different, the ion temperature can be different from the atom temperature.

Coexistence of cyclic (CH3OH)2(H2O)8 heterodecamer and acyclic water trimer in the channels of silver-azelate framework

NASA Astrophysics Data System (ADS)

Luo, Geng-Geng; Zhu, Rui-Min; He, Wei-Jun; Li, Ming-Zhi; Zhao, Qing-Hua; Li, Dong-Xu; Dai, Jing-Cao

2012-08-01

Flexible azelaic acid (H2aze) and 1,3-bis(4-pyridyl)propane) (bpp) react ultrasonically with silver(I) oxide, generating a new metal-organic framework [Ag2(bpp)2(aze)·7H2O·CH3OH]n (1) that forms a 3D supramolecular structure through H-bonding interactions between solvent molecules and carboxylate O atoms with void spaces. Two kinds of solvent clusters, discrete cyclic (CH3OH)2(H2O)8 heterodecameric and acyclic water trimeric clusters occupy the channels in the structure. Furthermore, 1 exhibits strong photoluminescence maximized at 500 nm upon 350 nm excitation at room temperature, of which CIE chromaticity ordinate (x = 0.28, y = 0.44) is close to that of edge of green component.

Combustion chamber analysis code

NASA Technical Reports Server (NTRS)

Przekwas, A. J.; Lai, Y. G.; Krishnan, A.; Avva, R. K.; Giridharan, M. G.

1993-01-01

A three-dimensional, time dependent, Favre averaged, finite volume Navier-Stokes code has been developed to model compressible and incompressible flows (with and without chemical reactions) in liquid rocket engines. The code has a non-staggered formulation with generalized body-fitted-coordinates (BFC) capability. Higher order differencing methodologies such as MUSCL and Osher-Chakravarthy schemes are available. Turbulent flows can be modeled using any of the five turbulent models present in the code. A two-phase, two-liquid, Lagrangian spray model has been incorporated into the code. Chemical equilibrium and finite rate reaction models are available to model chemically reacting flows. The discrete ordinate method is used to model effects of thermal radiation. The code has been validated extensively against benchmark experimental data and has been applied to model flows in several propulsion system components of the SSME and the STME.

Measured and calculated fast neutron spectra in a depleted uranium and lithium hydride shielded reactor

NASA Technical Reports Server (NTRS)

Lahti, G. P.; Mueller, R. A.

1973-01-01

Measurements of MeV neutron were made at the surface of a lithium hydride and depleted uranium shielded reactor. Four shield configurations were considered: these were assembled progressively with cylindrical shells of 5-centimeter-thick depleted uranium, 13-centimeter-thick lithium hydride, 5-centimeter-thick depleted uranium, 13-centimeter-thick lithium hydride, 5-centimeter-thick depleted uranium, and 3-centimeter-thick depleted uranium. Measurements were made with a NE-218 scintillation spectrometer; proton pulse height distributions were differentiated to obtain neutron spectra. Calculations were made using the two-dimensional discrete ordinates code DOT and ENDF/B (version 3) cross sections. Good agreement between measured and calculated spectral shape was observed. Absolute measured and calculated fluxes were within 50 percent of one another; observed discrepancies in absolute flux may be due to cross section errors.

Calculation and experimental validation of spectral properties of microsize grains surrounded by nanoparticles.

PubMed

Yu, Haitong; Liu, Dong; Duan, Yuanyuan; Wang, Xiaodong

2014-04-07

Opacified aerogels are particulate thermal insulating materials in which micrometric opacifier mineral grains are surrounded by silica aerogel nanoparticles. A geometric model was developed to characterize the spectral properties of such microsize grains surrounded by much smaller particles. The model represents the material's microstructure with the spherical opacifier's spectral properties calculated using the multi-sphere T-matrix (MSTM) algorithm. The results are validated by comparing the measured reflectance of an opacified aerogel slab against the value predicted using the discrete ordinate method (DOM) based on calculated optical properties. The results suggest that the large particles embedded in the nanoparticle matrices show different scattering and absorption properties from the single scattering condition and that the MSTM and DOM algorithms are both useful for calculating the spectral and radiative properties of this particulate system.

Topology and layout optimization of discrete and continuum structures

NASA Technical Reports Server (NTRS)

Bendsoe, Martin P.; Kikuchi, Noboru

1993-01-01

The basic features of the ground structure method for truss structure an continuum problems are described. Problems with a large number of potential structural elements are considered using the compliance of the structure as the objective function. The design problem is the minimization of compliance for a given structural weight, and the design variables for truss problems are the cross-sectional areas of the individual truss members, while for continuum problems they are the variable densities of material in each of the elements of the FEM discretization. It is shown how homogenization theory can be applied to provide a relation between material density and the effective material properties of a periodic medium with a known microstructure of material and voids.

High-performance parallel analysis of coupled problems for aircraft propulsion

NASA Technical Reports Server (NTRS)

Felippa, C. A.; Farhat, C.; Lanteri, S.; Gumaste, U.; Ronaghi, M.

1994-01-01

Applications are described of high-performance parallel, computation for the analysis of complete jet engines, considering its multi-discipline coupled problem. The coupled problem involves interaction of structures with gas dynamics, heat conduction and heat transfer in aircraft engines. The methodology issues addressed include: consistent discrete formulation of coupled problems with emphasis on coupling phenomena; effect of partitioning strategies, augmentation and temporal solution procedures; sensitivity of response to problem parameters; and methods for interfacing multiscale discretizations in different single fields. The computer implementation issues addressed include: parallel treatment of coupled systems; domain decomposition and mesh partitioning strategies; data representation in object-oriented form and mapping to hardware driven representation, and tradeoff studies between partitioning schemes and fully coupled treatment.

Three-dimensional aspects of radiative transfer in remote sensing of precipitation: Application to the 1986 COHMEX storm

NASA Technical Reports Server (NTRS)

Haferman, J. L.; Krajewski, W. F.; Smith, T. F.

1994-01-01

Several multifrequency techniques for passive microwave estimation of precipitation based on the absorption and scattering properties of hydrometers have been proposed in the literature. In the present study, plane-parallel limitations are overcome by using a model based on the discrete-ordinates method to solve the radiative transfer equation in three-dimensional rectangular domains. This effectively accounts for the complexity and variety of radiation problems encountered in the atmosphere. This investigation presents result for plane-parallel and three-dimensional radiative transfer for a precipitating system, discusses differences between these results, and suggests possible explanations for these differences. Microphysical properties were obtained from the Colorado State University Regional Atmospehric Modeling System and represent a hailstorm observed during the 1986 Cooperative Huntsville Meteorological Experiment. These properties are used as input to a three-dimensional radiative transfer model in order to simulate satellite observation of the storm. The model output consists of upwelling brightness temperatures at several of the frequencies on the Special Sensor Microwave/Imager. The radiative transfer model accounts for scattering and emission of atmospheric gases and hydrometers in liquid and ice phases. Brightness temperatures obtained from the three-dimensional model of this investigation indicate that horizontal inhomogeneities give rise to brightness temperature fields that can be quite different from fields obtained using plane-parallel radiative transfer theory. These differences are examined for various resolutions of the satellite sensor field of view. In adddition, the issue of boundary conditions for three-dimensional atmospheric radiative transfer is addressed.

Deregulation, Distrust, and Democracy: State and Local Action to Ensure Equitable Access to Healthy, Sustainably Produced Food.

PubMed

Wiley, Lindsay F

2015-01-01

Environmental, public health, alternative food, and food justice advocates are working together to achieve incremental agricultural subsidy and nutrition assistance reforms that increase access to fresh fruits and vegetables. When it comes to targeting food and beverage products for increased regulation and decreased consumption, however, the priorities of various food reform movements diverge. This article argues that foundational legal issues, including preemption of state and local authority to protect the public's health and welfare, increasing First Amendment protection for commercial speech, and eroding judicial deference to legislative policy judgments, present a more promising avenue for collaboration across movements than discrete food reform priorities around issues like sugary drinks, genetic modification, or organics. Using the Vermont Genetically Modified Organism (GMO) Labeling Act litigation, the Kauai GMO Cultivation Ordinance litigation, the New York City Sugary Drinks Portion Rule litigation, and the Cleveland Trans Fat Ban litigation as case studies, I discuss the foundational legal challenges faced by diverse food reformers, even when their discrete reform priorities diverge. I also 'explore the broader implications of cooperation among groups that respond differently to the "irrationalities" (from the public health perspective) or "values" (from the environmental and alternative food perspective) that permeate public risk perception for democratic governance in the face of scientific uncertainty.

Discrete Regularization for Calibration of Geologic Facies Against Dynamic Flow Data

NASA Astrophysics Data System (ADS)

Khaninezhad, Mohammad-Reza; Golmohammadi, Azarang; Jafarpour, Behnam

2018-04-01

Subsurface flow model calibration involves many more unknowns than measurements, leading to ill-posed problems with nonunique solutions. To alleviate nonuniqueness, the problem is regularized by constraining the solution space using prior knowledge. In certain sedimentary environments, such as fluvial systems, the contrast in hydraulic properties of different facies types tends to dominate the flow and transport behavior, making the effect of within facies heterogeneity less significant. Hence, flow model calibration in those formations reduces to delineating the spatial structure and connectivity of different lithofacies types and their boundaries. A major difficulty in calibrating such models is honoring the discrete, or piecewise constant, nature of facies distribution. The problem becomes more challenging when complex spatial connectivity patterns with higher-order statistics are involved. This paper introduces a novel formulation for calibration of complex geologic facies by imposing appropriate constraints to recover plausible solutions that honor the spatial connectivity and discreteness of facies models. To incorporate prior connectivity patterns, plausible geologic features are learned from available training models. This is achieved by learning spatial patterns from training data, e.g., k-SVD sparse learning or the traditional Principal Component Analysis. Discrete regularization is introduced as a penalty functions to impose solution discreteness while minimizing the mismatch between observed and predicted data. An efficient gradient-based alternating directions algorithm is combined with variable splitting to minimize the resulting regularized nonlinear least squares objective function. Numerical results show that imposing learned facies connectivity and discreteness as regularization functions leads to geologically consistent solutions that improve facies calibration quality.

On the Problem of Filtration to an Imperfect Gallery in a Pressureless Bed

NASA Astrophysics Data System (ADS)

Bereslavskii, É. N.; Dudina, L. M.

2018-01-01

The problem of plane steady-state filtration in a pressureless bed to an imperfect gallery in the presence of evaporation from the flow free surface is considered. To study such type of flow, a mixed boundary-value problem of the theory of analytical functions is formulated and solved with application of the Polubarinova-Kochina method. Based on the model suggested, an algorithm for computing the discharge of the gallery and the ordinate of free surface emergence to the impermeable screen is developed. A detailed hydrodynamic analysis of the influence of all physical parameters of the model on the desired filtration characteristics is given.

An Algorithm for the Mixed Transportation Network Design Problem

PubMed Central

Liu, Xinyu; Chen, Qun

2016-01-01

This paper proposes an optimization algorithm, the dimension-down iterative algorithm (DDIA), for solving a mixed transportation network design problem (MNDP), which is generally expressed as a mathematical programming with equilibrium constraint (MPEC). The upper level of the MNDP aims to optimize the network performance via both the expansion of the existing links and the addition of new candidate links, whereas the lower level is a traditional Wardrop user equilibrium (UE) problem. The idea of the proposed solution algorithm (DDIA) is to reduce the dimensions of the problem. A group of variables (discrete/continuous) is fixed to optimize another group of variables (continuous/discrete) alternately; then, the problem is transformed into solving a series of CNDPs (continuous network design problems) and DNDPs (discrete network design problems) repeatedly until the problem converges to the optimal solution. The advantage of the proposed algorithm is that its solution process is very simple and easy to apply. Numerical examples show that for the MNDP without budget constraint, the optimal solution can be found within a few iterations with DDIA. For the MNDP with budget constraint, however, the result depends on the selection of initial values, which leads to different optimal solutions (i.e., different local optimal solutions). Some thoughts are given on how to derive meaningful initial values, such as by considering the budgets of new and reconstruction projects separately. PMID:27626803

Clean Indoor Air Ordinance Coverage in the Appalachian Region of the United States

PubMed Central

Liber, Alex; Pennell, Michael; Nealy, Darren; Hammer, Jana; Berman, Micah

2010-01-01

Objectives. We sought to quantitatively examine the pattern of, and socioeconomic factors associated with, adoption of clean indoor air ordinances in Appalachia. Methods. We collected and reviewed clean indoor air ordinances in Appalachian communities in 6 states and rated the ordinances for completeness of coverage in workplaces, restaurants, and bars. Additionally, we computed a strength score to measure coverage in 7 locations. We fit mixed-effects models to determine whether the presence of a comprehensive ordinance and the ordinance strength were related to community socioeconomic disadvantage. Results. Of the 332 communities included in the analysis, fewer than 20% had adopted a comprehensive workplace, restaurant, or bar ordinance. Most ordinances were weak, achieving on average only 43% of the total possible points. Communities with a higher unemployment rate were less likely and those with a higher education level were more likely to have a strong ordinance. Conclusions. The majority of residents in these communities are not protected from secondhand smoke. Efforts to pass strong statewide clean indoor air laws should take priority over local initiatives in these states. PMID:20466957

Numerical approximation for the infinite-dimensional discrete-time optimal linear-quadratic regulator problem

NASA Technical Reports Server (NTRS)

Gibson, J. S.; Rosen, I. G.

1986-01-01

An abstract approximation framework is developed for the finite and infinite time horizon discrete-time linear-quadratic regulator problem for systems whose state dynamics are described by a linear semigroup of operators on an infinite dimensional Hilbert space. The schemes included the framework yield finite dimensional approximations to the linear state feedback gains which determine the optimal control law. Convergence arguments are given. Examples involving hereditary and parabolic systems and the vibration of a flexible beam are considered. Spline-based finite element schemes for these classes of problems, together with numerical results, are presented and discussed.

Discrete is it enough? The revival of Piola-Hencky keynotes to analyze three-dimensional Elastica

NASA Astrophysics Data System (ADS)

Turco, Emilio

2018-04-01

Complex problems such as those concerning the mechanics of materials can be confronted only by considering numerical simulations. Analytical methods are useful to build guidelines or reference solutions but, for general cases of technical interest, they have to be solved numerically, especially in the case of large displacements and deformations. Probably continuous models arose for producing inspiring examples and stemmed from homogenization techniques. These techniques allowed for the solution of some paradigmatic examples but, in general, always require a discretization method for solving problems dictated by the applications. Therefore, and also by taking into account that computing powers are nowadays more largely available and cheap, the question arises: why not using directly a discrete model for 3D beams? In other words, it could be interesting to formulate a discrete model without using an intermediate continuum one, as this last, at the end, has to be discretized in any case. These simple considerations immediately evoke some very basic models developed many years ago when the computing powers were practically inexistent but the problem of finding simple solutions to beam deformation problem was already an emerging one. Actually, in recent years, the keynotes of Hencky and Piola attracted a renewed attention [see, one for all, the work (Turco et al. in Zeitschrift für Angewandte Mathematik und Physik 67(4):1-28, 2016)]: generalizing their results, in the present paper, a novel directly discrete three-dimensional beam model is presented and discussed, in the framework of geometrically nonlinear analysis. Using a stepwise algorithm based essentially on Newton's method to compute the extrapolations and on the Riks' arc-length method to perform the corrections, we could obtain some numerical simulations showing the computational effectiveness of presented model: Indeed, it presents a convenient balance between accuracy and computational cost.

Simulation Model for Scenario Optimization of the Ready-Mix Concrete Delivery Problem

NASA Astrophysics Data System (ADS)

Galić, Mario; Kraus, Ivan

2016-12-01

This paper introduces a discrete simulation model for solving routing and network material flow problems in construction projects. Before the description of the model a detailed literature review is provided. The model is verified using a case study of solving the ready-mix concrete network flow and routing problem in metropolitan area in Croatia. Within this study real-time input parameters were taken into account. Simulation model is structured in Enterprise Dynamics simulation software and Microsoft Excel linked with Google Maps. The model is dynamic, easily managed and adjustable, but also provides good estimation for minimization of costs and realization time in solving discrete routing and material network flow problems.

Discrete-time entropy formulation of optimal and adaptive control problems

NASA Technical Reports Server (NTRS)

Tsai, Yweting A.; Casiello, Francisco A.; Loparo, Kenneth A.

1992-01-01

The discrete-time version of the entropy formulation of optimal control of problems developed by G. N. Saridis (1988) is discussed. Given a dynamical system, the uncertainty in the selection of the control is characterized by the probability distribution (density) function which maximizes the total entropy. The equivalence between the optimal control problem and the optimal entropy problem is established, and the total entropy is decomposed into a term associated with the certainty equivalent control law, the entropy of estimation, and the so-called equivocation of the active transmission of information from the controller to the estimator. This provides a useful framework for studying the certainty equivalent and adaptive control laws.

Fast genomic predictions via Bayesian G-BLUP and multilocus models of threshold traits including censored Gaussian data.

PubMed

Kärkkäinen, Hanni P; Sillanpää, Mikko J

2013-09-04

Because of the increased availability of genome-wide sets of molecular markers along with reduced cost of genotyping large samples of individuals, genomic estimated breeding values have become an essential resource in plant and animal breeding. Bayesian methods for breeding value estimation have proven to be accurate and efficient; however, the ever-increasing data sets are placing heavy demands on the parameter estimation algorithms. Although a commendable number of fast estimation algorithms are available for Bayesian models of continuous Gaussian traits, there is a shortage for corresponding models of discrete or censored phenotypes. In this work, we consider a threshold approach of binary, ordinal, and censored Gaussian observations for Bayesian multilocus association models and Bayesian genomic best linear unbiased prediction and present a high-speed generalized expectation maximization algorithm for parameter estimation under these models. We demonstrate our method with simulated and real data. Our example analyses suggest that the use of the extra information present in an ordered categorical or censored Gaussian data set, instead of dichotomizing the data into case-control observations, increases the accuracy of genomic breeding values predicted by Bayesian multilocus association models or by Bayesian genomic best linear unbiased prediction. Furthermore, the example analyses indicate that the correct threshold model is more accurate than the directly used Gaussian model with a censored Gaussian data, while with a binary or an ordinal data the superiority of the threshold model could not be confirmed.

Fast Genomic Predictions via Bayesian G-BLUP and Multilocus Models of Threshold Traits Including Censored Gaussian Data

PubMed Central

Kärkkäinen, Hanni P.; Sillanpää, Mikko J.

2013-01-01

Because of the increased availability of genome-wide sets of molecular markers along with reduced cost of genotyping large samples of individuals, genomic estimated breeding values have become an essential resource in plant and animal breeding. Bayesian methods for breeding value estimation have proven to be accurate and efficient; however, the ever-increasing data sets are placing heavy demands on the parameter estimation algorithms. Although a commendable number of fast estimation algorithms are available for Bayesian models of continuous Gaussian traits, there is a shortage for corresponding models of discrete or censored phenotypes. In this work, we consider a threshold approach of binary, ordinal, and censored Gaussian observations for Bayesian multilocus association models and Bayesian genomic best linear unbiased prediction and present a high-speed generalized expectation maximization algorithm for parameter estimation under these models. We demonstrate our method with simulated and real data. Our example analyses suggest that the use of the extra information present in an ordered categorical or censored Gaussian data set, instead of dichotomizing the data into case-control observations, increases the accuracy of genomic breeding values predicted by Bayesian multilocus association models or by Bayesian genomic best linear unbiased prediction. Furthermore, the example analyses indicate that the correct threshold model is more accurate than the directly used Gaussian model with a censored Gaussian data, while with a binary or an ordinal data the superiority of the threshold model could not be confirmed. PMID:23821618

Discrete Particle Swarm Optimization Routing Protocol for Wireless Sensor Networks with Multiple Mobile Sinks.

PubMed

Yang, Jin; Liu, Fagui; Cao, Jianneng; Wang, Liangming

2016-07-14

Mobile sinks can achieve load-balancing and energy-consumption balancing across the wireless sensor networks (WSNs). However, the frequent change of the paths between source nodes and the sinks caused by sink mobility introduces significant overhead in terms of energy and packet delays. To enhance network performance of WSNs with mobile sinks (MWSNs), we present an efficient routing strategy, which is formulated as an optimization problem and employs the particle swarm optimization algorithm (PSO) to build the optimal routing paths. However, the conventional PSO is insufficient to solve discrete routing optimization problems. Therefore, a novel greedy discrete particle swarm optimization with memory (GMDPSO) is put forward to address this problem. In the GMDPSO, particle's position and velocity of traditional PSO are redefined under discrete MWSNs scenario. Particle updating rule is also reconsidered based on the subnetwork topology of MWSNs. Besides, by improving the greedy forwarding routing, a greedy search strategy is designed to drive particles to find a better position quickly. Furthermore, searching history is memorized to accelerate convergence. Simulation results demonstrate that our new protocol significantly improves the robustness and adapts to rapid topological changes with multiple mobile sinks, while efficiently reducing the communication overhead and the energy consumption.

City curfew ordinances and teenage motor vehicle injury.

PubMed

Preusser, D F; Williams, A F; Lund, A K; Zador, P L

1990-08-01

Several U.S. cities have curfew ordinances that limit the late night activities of minor teenagers in public places including highways. Detroit, Cleveland, and Columbus, which have curfew ordinances, were compared to Cincinnati, which does not have such an ordinance. The curfew ordinances were associated with a 23% reduction in motor vehicle related injury for 13- to 17-year-olds as passengers, drivers, pedestrians, or bicyclists during the curfew hours. It was concluded that city curfew ordinances, like the statewide driving curfews studied in other states, can reduce motor vehicle injury to teenagers during the particularly hazardous late night hours.

An adjoint view on flux consistency and strong wall boundary conditions to the Navier–Stokes equations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Stück, Arthur, E-mail: arthur.stueck@dlr.de

2015-11-15

Inconsistent discrete expressions in the boundary treatment of Navier–Stokes solvers and in the definition of force objective functionals can lead to discrete-adjoint boundary treatments that are not a valid representation of the boundary conditions to the corresponding adjoint partial differential equations. The underlying problem is studied for an elementary 1D advection–diffusion problem first using a node-centred finite-volume discretisation. The defect of the boundary operators in the inconsistently defined discrete-adjoint problem leads to oscillations and becomes evident with the additional insight of the continuous-adjoint approach. A homogenisation of the discretisations for the primal boundary treatment and the force objective functional yieldsmore » second-order functional accuracy and eliminates the defect in the discrete-adjoint boundary treatment. Subsequently, the issue is studied for aerodynamic Reynolds-averaged Navier–Stokes problems in conjunction with a standard finite-volume discretisation on median-dual grids and a strong implementation of noslip walls, found in many unstructured general-purpose flow solvers. Going out from a base-line discretisation of force objective functionals which is independent of the boundary treatment in the flow solver, two improved flux-consistent schemes are presented; based on either body wall-defined or farfield-defined control-volumes they resolve the dual inconsistency. The behaviour of the schemes is investigated on a sequence of grids in 2D and 3D.« less

Comprehensive Benchmark Suite for Simulation of Particle Laden Flows Using the Discrete Element Method with Performance Profiles from the Multiphase Flow with Interface eXchanges (MFiX) Code

DOE Office of Scientific and Technical Information (OSTI.GOV)

Liu, Peiyuan; Brown, Timothy; Fullmer, William D.

Five benchmark problems are developed and simulated with the computational fluid dynamics and discrete element model code MFiX. The benchmark problems span dilute and dense regimes, consider statistically homogeneous and inhomogeneous (both clusters and bubbles) particle concentrations and a range of particle and fluid dynamic computational loads. Several variations of the benchmark problems are also discussed to extend the computational phase space to cover granular (particles only), bidisperse and heat transfer cases. A weak scaling analysis is performed for each benchmark problem and, in most cases, the scalability of the code appears reasonable up to approx. 103 cores. Profiling ofmore » the benchmark problems indicate that the most substantial computational time is being spent on particle-particle force calculations, drag force calculations and interpolating between discrete particle and continuum fields. Hardware performance analysis was also carried out showing significant Level 2 cache miss ratios and a rather low degree of vectorization. These results are intended to serve as a baseline for future developments to the code as well as a preliminary indicator of where to best focus performance optimizations.« less

Denoising embolic Doppler ultrasound signals using Dual Tree Complex Discrete Wavelet Transform.

PubMed

Serbes, Gorkem; Aydin, Nizamettin

2010-01-01

Early and accurate detection of asymptomatic emboli is important for monitoring of preventive therapy in stroke-prone patients. One of the problems in detection of emboli is the identification of an embolic signal caused by very small emboli. The amplitude of the embolic signal may be so small that advanced processing methods are required to distinguish these signals from Doppler signals arising from red blood cells. In this study instead of conventional discrete wavelet transform, the Dual Tree Complex Discrete Wavelet Transform was used for denoising embolic signals. Performances of both approaches were compared. Unlike the conventional discrete wavelet transform discrete complex wavelet transform is a shift invariant transform with limited redundancy. Results demonstrate that the Dual Tree Complex Discrete Wavelet Transform based denoising outperforms conventional discrete wavelet denoising. Approximately 8 dB improvement is obtained by using the Dual Tree Complex Discrete Wavelet Transform compared to the improvement provided by the conventional Discrete Wavelet Transform (less than 5 dB).

Peridynamics with LAMMPS : a user guide.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lehoucq, Richard B.; Silling, Stewart Andrew; Plimpton, Steven James

2008-01-01

Peridynamics is a nonlocal formulation of continuum mechanics. The discrete peridynamic model has the same computational structure as a molecular dynamic model. This document details the implementation of a discrete peridynamic model within the LAMMPS molecular dynamic code. This document provides a brief overview of the peridynamic model of a continuum, then discusses how the peridynamic model is discretized, and overviews the LAMMPS implementation. A nontrivial example problem is also included.

Numerical integration techniques for curved-element discretizations of molecule-solvent interfaces.

PubMed

Bardhan, Jaydeep P; Altman, Michael D; Willis, David J; Lippow, Shaun M; Tidor, Bruce; White, Jacob K

2007-07-07

Surface formulations of biophysical modeling problems offer attractive theoretical and computational properties. Numerical simulations based on these formulations usually begin with discretization of the surface under consideration; often, the surface is curved, possessing complicated structure and possibly singularities. Numerical simulations commonly are based on approximate, rather than exact, discretizations of these surfaces. To assess the strength of the dependence of simulation accuracy on the fidelity of surface representation, here methods were developed to model several important surface formulations using exact surface discretizations. Following and refining Zauhar's work [J. Comput.-Aided Mol. Des. 9, 149 (1995)], two classes of curved elements were defined that can exactly discretize the van der Waals, solvent-accessible, and solvent-excluded (molecular) surfaces. Numerical integration techniques are presented that can accurately evaluate nonsingular and singular integrals over these curved surfaces. After validating the exactness of the surface discretizations and demonstrating the correctness of the presented integration methods, a set of calculations are presented that compare the accuracy of approximate, planar-triangle-based discretizations and exact, curved-element-based simulations of surface-generalized-Born (sGB), surface-continuum van der Waals (scvdW), and boundary-element method (BEM) electrostatics problems. Results demonstrate that continuum electrostatic calculations with BEM using curved elements, piecewise-constant basis functions, and centroid collocation are nearly ten times more accurate than planar-triangle BEM for basis sets of comparable size. The sGB and scvdW calculations give exceptional accuracy even for the coarsest obtainable discretized surfaces. The extra accuracy is attributed to the exact representation of the solute-solvent interface; in contrast, commonly used planar-triangle discretizations can only offer improved approximations with increasing discretization and associated increases in computational resources. The results clearly demonstrate that the methods for approximate integration on an exact geometry are far more accurate than exact integration on an approximate geometry. A MATLAB implementation of the presented integration methods and sample data files containing curved-element discretizations of several small molecules are available online as supplemental material.

Gap-minimal systems of notations and the constructible hierarchy

NASA Technical Reports Server (NTRS)

Lucian, M. L.

1972-01-01

If a constructibly countable ordinal alpha is a gap ordinal, then the order type of the set of index ordinals smaller than alpha is exactly alpha. The gap ordinals are the only points of discontinuity of a certain ordinal-valued function. The notion of gap minimality for well ordered systems of notations is defined, and the existence of gap-minimal systems of notations of arbitrarily large constructibly countable length is established.

A discrete artificial bee colony algorithm incorporating differential evolution for the flow-shop scheduling problem with blocking

NASA Astrophysics Data System (ADS)

Han, Yu-Yan; Gong, Dunwei; Sun, Xiaoyan

2015-07-01

A flow-shop scheduling problem with blocking has important applications in a variety of industrial systems but is underrepresented in the research literature. In this study, a novel discrete artificial bee colony (ABC) algorithm is presented to solve the above scheduling problem with a makespan criterion by incorporating the ABC with differential evolution (DE). The proposed algorithm (DE-ABC) contains three key operators. One is related to the employed bee operator (i.e. adopting mutation and crossover operators of discrete DE to generate solutions with good quality); the second is concerned with the onlooker bee operator, which modifies the selected solutions using insert or swap operators based on the self-adaptive strategy; and the last is for the local search, that is, the insert-neighbourhood-based local search with a small probability is adopted to improve the algorithm's capability in exploitation. The performance of the proposed DE-ABC algorithm is empirically evaluated by applying it to well-known benchmark problems. The experimental results show that the proposed algorithm is superior to the compared algorithms in minimizing the makespan criterion.

78 FR 54670 - Miami Tribe of Oklahoma-Liquor Control Ordinance

Federal Register 2010, 2011, 2012, 2013, 2014

2013-09-05

... Tribe of Oklahoma--Liquor Control Ordinance AGENCY: Bureau of Indian Affairs, Interior. ACTION: Notice. SUMMARY: This notice publishes the Miami Tribe of Oklahoma--Liquor Control Ordinance. This Ordinance... Oklahoma, increases the ability of the tribal government to control the distribution and possession of...

Tax revenue in Mississippi communities following implementation of smoke-free ordinances: an examination of tourism and economic development tax revenues.

PubMed

McMillen, Robert; Shackelford, Signe

2012-10-01

There is no safe level of exposure to tobacco smoke. More than 60 Mississippi communities have passed smoke-free ordinances in the past six years. Opponents claim that these ordinances harm local businesses. Mississippi law allows municipalities to place a tourism and economic development (TED) tax on local restaurants and hotels/motels. The objective of this study is to examine the impact of these ordinances on TED tax revenues. This study applies a pre/post quasi-experimental design to compare TED tax revenue before and after implementing ordinances. Descriptive analyses indicated that inflation-adjusted tax revenues increased during the 12 months following implementation of smoke-free ordinances while there was no change in aggregated control communities. Multivariate fixed-effects analyses found no statistically significant effect of smoke-free ordinances on hospitality tax revenue. No evidence was found that smoke-free ordinances have an adverse effect on the local hospitality industry.

An Interactive Tool for Discrete Phase Analysis in Two-Phase Flows

NASA Technical Reports Server (NTRS)

Dejong, Frederik J.; Thoren, Stephen J.

1993-01-01

Under a NASA MSFC SBIR Phase 1 effort an interactive software package has been developed for the analysis of discrete (particulate) phase dynamics in two-phase flows in which the discrete phase does not significantly affect the continuous phase. This package contains a Graphical User Interface (based on the X Window system and the Motif tool kit) coupled to a particle tracing program, which allows the user to interactively set up and run a case for which a continuous phase grid and flow field are available. The software has been applied to a solid rocket motor problem, to demonstrate its ease of use and its suitability for problems of engineering interest, and has been delivered to NASA Marshall Space Flight Center.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Haghighat, A.; Sjoden, G.E.; Wagner, J.C.

In the past 10 yr, the Penn State Transport Theory Group (PSTTG) has concentrated its efforts on developing accurate and efficient particle transport codes to address increasing needs for efficient and accurate simulation of nuclear systems. The PSTTG's efforts have primarily focused on shielding applications that are generally treated using multigroup, multidimensional, discrete ordinates (S{sub n}) deterministic and/or statistical Monte Carlo methods. The difficulty with the existing public codes is that they require significant (impractical) computation time for simulation of complex three-dimensional (3-D) problems. For the S{sub n} codes, the large memory requirements are handled through the use of scratchmore » files (i.e., read-from and write-to-disk) that significantly increases the necessary execution time. Further, the lack of flexible features and/or utilities for preparing input and processing output makes these codes difficult to use. The Monte Carlo method becomes impractical because variance reduction (VR) methods have to be used, and normally determination of the necessary parameters for the VR methods is very difficult and time consuming for a complex 3-D problem. For the deterministic method, the authors have developed the 3-D parallel PENTRAN (Parallel Environment Neutral-particle TRANsport) code system that, in addition to a parallel 3-D S{sub n} solver, includes pre- and postprocessing utilities. PENTRAN provides for full phase-space decomposition, memory partitioning, and parallel input/output to provide the capability of solving large problems in a relatively short time. Besides having a modular parallel structure, PENTRAN has several unique new formulations and features that are necessary for achieving high parallel performance. For the Monte Carlo method, the major difficulty currently facing most users is the selection of an effective VR method and its associated parameters. For complex problems, generally, this process is very time consuming and may be complicated due to the possibility of biasing the results. In an attempt to eliminate this problem, the authors have developed the A{sup 3}MCNP (automated adjoint accelerated MCNP) code that automatically prepares parameters for source and transport biasing within a weight-window VR approach based on the S{sub n} adjoint function. A{sup 3}MCNP prepares the necessary input files for performing multigroup, 3-D adjoint S{sub n} calculations using TORT.« less

Dual methods and approximation concepts in structural synthesis

NASA Technical Reports Server (NTRS)

Fleury, C.; Schmit, L. A., Jr.

1980-01-01

Approximation concepts and dual method algorithms are combined to create a method for minimum weight design of structural systems. Approximation concepts convert the basic mathematical programming statement of the structural synthesis problem into a sequence of explicit primal problems of separable form. These problems are solved by constructing explicit dual functions, which are maximized subject to nonnegativity constraints on the dual variables. It is shown that the joining together of approximation concepts and dual methods can be viewed as a generalized optimality criteria approach. The dual method is successfully extended to deal with pure discrete and mixed continuous-discrete design variable problems. The power of the method presented is illustrated with numerical results for example problems, including a metallic swept wing and a thin delta wing with fiber composite skins.

A fully Sinc-Galerkin method for Euler-Bernoulli beam models

NASA Technical Reports Server (NTRS)

Smith, R. C.; Bowers, K. L.; Lund, J.

1990-01-01

A fully Sinc-Galerkin method in both space and time is presented for fourth-order time-dependent partial differential equations with fixed and cantilever boundary conditions. The Sinc discretizations for the second-order temporal problem and the fourth-order spatial problems are presented. Alternate formulations for variable parameter fourth-order problems are given which prove to be especially useful when applying the forward techniques to parameter recovery problems. The discrete system which corresponds to the time-dependent partial differential equations of interest are then formulated. Computational issues are discussed and a robust and efficient algorithm for solving the resulting matrix system is outlined. Numerical results which highlight the method are given for problems with both analytic and singular solutions as well as fixed and cantilever boundary conditions.

Variationally consistent discretization schemes and numerical algorithms for contact problems

NASA Astrophysics Data System (ADS)

Wohlmuth, Barbara

We consider variationally consistent discretization schemes for mechanical contact problems. Most of the results can also be applied to other variational inequalities, such as those for phase transition problems in porous media, for plasticity or for option pricing applications from finance. The starting point is to weakly incorporate the constraint into the setting and to reformulate the inequality in the displacement in terms of a saddle-point problem. Here, the Lagrange multiplier represents the surface forces, and the constraints are restricted to the boundary of the simulation domain. Having a uniform inf-sup bound, one can then establish optimal low-order a priori convergence rates for the discretization error in the primal and dual variables. In addition to the abstract framework of linear saddle-point theory, complementarity terms have to be taken into account. The resulting inequality system is solved by rewriting it equivalently by means of the non-linear complementarity function as a system of equations. Although it is not differentiable in the classical sense, semi-smooth Newton methods, yielding super-linear convergence rates, can be applied and easily implemented in terms of a primal-dual active set strategy. Quite often the solution of contact problems has a low regularity, and the efficiency of the approach can be improved by using adaptive refinement techniques. Different standard types, such as residual- and equilibrated-based a posteriori error estimators, can be designed based on the interpretation of the dual variable as Neumann boundary condition. For the fully dynamic setting it is of interest to apply energy-preserving time-integration schemes. However, the differential algebraic character of the system can result in high oscillations if standard methods are applied. A possible remedy is to modify the fully discretized system by a local redistribution of the mass. Numerical results in two and three dimensions illustrate the wide range of possible applications and show the performance of the space discretization scheme, non-linear solver, adaptive refinement process and time integration.

Particular Solutions in Four body problem with solar wind drag

NASA Astrophysics Data System (ADS)

Kumari, Reena; Singh Kushvah, Badam

2012-07-01

To study the motion of a group of celestial objects/bodies interacting with each other under gravitational attraction. We formulated a four body problem with solar wind drag of one radiating body, rotating about their common center of mass with central configuration. We suppose that the governing forces of the motion of four body problems are mutual gravitational attractions of bodies and drag force of radiating body. Firstly, we derive the equations of motion using new co-ordinates for the four body problem. Again, we find the integrals of motions under different cases regarding to the mass of the bodies. Then we find the zero velocity surfaces and particular solutions. Finally, we examined the effect of solar wind drag on the motion of the four body problem. Keywords: Four Body Problem; Particular Solutions; Radiation Force; Zero Velocity Surfaces.

75 FR 65373 - Klamath Tribes Liquor Control Ordinance

Federal Register 2010, 2011, 2012, 2013, 2014

2010-10-22

... DEPARTMENT OF THE INTERIOR Bureau of Indian Affairs Klamath Tribes Liquor Control Ordinance AGENCY... certification of the amendment to the Klamath Tribes Liquor Control Ordinance. The first Ordinance was published... and controls the sale, possession and distribution of liquor within the tribal lands. The tribal lands...

Ordinal probability effect measures for group comparisons in multinomial cumulative link models.

PubMed

Agresti, Alan; Kateri, Maria

2017-03-01

We consider simple ordinal model-based probability effect measures for comparing distributions of two groups, adjusted for explanatory variables. An "ordinal superiority" measure summarizes the probability that an observation from one distribution falls above an independent observation from the other distribution, adjusted for explanatory variables in a model. The measure applies directly to normal linear models and to a normal latent variable model for ordinal response variables. It equals Φ(β/2) for the corresponding ordinal model that applies a probit link function to cumulative multinomial probabilities, for standard normal cdf Φ and effect β that is the coefficient of the group indicator variable. For the more general latent variable model for ordinal responses that corresponds to a linear model with other possible error distributions and corresponding link functions for cumulative multinomial probabilities, the ordinal superiority measure equals exp(β)/[1+exp(β)] with the log-log link and equals approximately exp(β/2)/[1+exp(β/2)] with the logit link, where β is the group effect. Another ordinal superiority measure generalizes the difference of proportions from binary to ordinal responses. We also present related measures directly for ordinal models for the observed response that need not assume corresponding latent response models. We present confidence intervals for the measures and illustrate with an example. © 2016, The International Biometric Society.

Filtering of Discrete-Time Switched Neural Networks Ensuring Exponential Dissipative and $l_{2}$ - $l_{\\infty }$ Performances.

PubMed

Choi, Hyun Duck; Ahn, Choon Ki; Karimi, Hamid Reza; Lim, Myo Taeg

2017-10-01

This paper studies delay-dependent exponential dissipative and l 2 - l ∞ filtering problems for discrete-time switched neural networks (DSNNs) including time-delayed states. By introducing a novel discrete-time inequality, which is a discrete-time version of the continuous-time Wirtinger-type inequality, we establish new sets of linear matrix inequality (LMI) criteria such that discrete-time filtering error systems are exponentially stable with guaranteed performances in the exponential dissipative and l 2 - l ∞ senses. The design of the desired exponential dissipative and l 2 - l ∞ filters for DSNNs can be achieved by solving the proposed sets of LMI conditions. Via numerical simulation results, we show the validity of the desired discrete-time filter design approach.

A Two-Timescale Discretization Scheme for Collocation

NASA Technical Reports Server (NTRS)

Desai, Prasun; Conway, Bruce A.

2004-01-01

The development of a two-timescale discretization scheme for collocation is presented. This scheme allows a larger discretization to be utilized for smoothly varying state variables and a second finer discretization to be utilized for state variables having higher frequency dynamics. As such. the discretization scheme can be tailored to the dynamics of the particular state variables. In so doing. the size of the overall Nonlinear Programming (NLP) problem can be reduced significantly. Two two-timescale discretization architecture schemes are described. Comparison of results between the two-timescale method and conventional collocation show very good agreement. Differences of less than 0.5 percent are observed. Consequently. a significant reduction (by two-thirds) in the number of NLP parameters and iterations required for convergence can be achieved without sacrificing solution accuracy.

From Discrete Space-Time to Minkowski Space: Basic Mechanisms, Methods and Perspectives

NASA Astrophysics Data System (ADS)

Finster, Felix

This survey article reviews recent results on fermion systems in discrete space-time and corresponding systems in Minkowski space. After a basic introduction to the discrete setting, we explain a mechanism of spontaneous symmetry breaking which leads to the emergence of a discrete causal structure. As methods to study the transition between discrete space-time and Minkowski space, we describe a lattice model for a static and isotropic space-time, outline the analysis of regularization tails of vacuum Dirac sea configurations, and introduce a Lorentz invariant action for the masses of the Dirac seas. We mention the method of the continuum limit, which allows to analyze interacting systems. Open problems are discussed.

The Information Content of Discrete Functions and Their Application in Genetic Data Analysis

DOE PAGES

Sakhanenko, Nikita A.; Kunert-Graf, James; Galas, David J.

2017-10-13

The complex of central problems in data analysis consists of three components: (1) detecting the dependence of variables using quantitative measures, (2) defining the significance of these dependence measures, and (3) inferring the functional relationships among dependent variables. We have argued previously that an information theory approach allows separation of the detection problem from the inference of functional form problem. We approach here the third component of inferring functional forms based on information encoded in the functions. Here, we present here a direct method for classifying the functional forms of discrete functions of three variables represented in data sets. Discretemore » variables are frequently encountered in data analysis, both as the result of inherently categorical variables and from the binning of continuous numerical variables into discrete alphabets of values. The fundamental question of how much information is contained in a given function is answered for these discrete functions, and their surprisingly complex relationships are illustrated. The all-important effect of noise on the inference of function classes is found to be highly heterogeneous and reveals some unexpected patterns. We apply this classification approach to an important area of biological data analysis—that of inference of genetic interactions. Genetic analysis provides a rich source of real and complex biological data analysis problems, and our general methods provide an analytical basis and tools for characterizing genetic problems and for analyzing genetic data. Finally, we illustrate the functional description and the classes of a number of common genetic interaction modes and also show how different modes vary widely in their sensitivity to noise.« less

The Information Content of Discrete Functions and Their Application in Genetic Data Analysis

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sakhanenko, Nikita A.; Kunert-Graf, James; Galas, David J.

The complex of central problems in data analysis consists of three components: (1) detecting the dependence of variables using quantitative measures, (2) defining the significance of these dependence measures, and (3) inferring the functional relationships among dependent variables. We have argued previously that an information theory approach allows separation of the detection problem from the inference of functional form problem. We approach here the third component of inferring functional forms based on information encoded in the functions. Here, we present here a direct method for classifying the functional forms of discrete functions of three variables represented in data sets. Discretemore » variables are frequently encountered in data analysis, both as the result of inherently categorical variables and from the binning of continuous numerical variables into discrete alphabets of values. The fundamental question of how much information is contained in a given function is answered for these discrete functions, and their surprisingly complex relationships are illustrated. The all-important effect of noise on the inference of function classes is found to be highly heterogeneous and reveals some unexpected patterns. We apply this classification approach to an important area of biological data analysis—that of inference of genetic interactions. Genetic analysis provides a rich source of real and complex biological data analysis problems, and our general methods provide an analytical basis and tools for characterizing genetic problems and for analyzing genetic data. Finally, we illustrate the functional description and the classes of a number of common genetic interaction modes and also show how different modes vary widely in their sensitivity to noise.« less

Ordinality and the nature of symbolic numbers.

PubMed

Lyons, Ian M; Beilock, Sian L

2013-10-23

The view that representations of symbolic and nonsymbolic numbers are closely tied to one another is widespread. However, the link between symbolic and nonsymbolic numbers is almost always inferred from cardinal processing tasks. In the current work, we show that considering ordinality instead points to striking differences between symbolic and nonsymbolic numbers. Human behavioral and neural data show that ordinal processing of symbolic numbers (Are three Indo-Arabic numerals in numerical order?) is distinct from symbolic cardinal processing (Which of two numerals represents the greater quantity?) and nonsymbolic number processing (ordinal and cardinal judgments of dot-arrays). Behaviorally, distance-effects were reversed when assessing ordinality in symbolic numbers, but canonical distance-effects were observed for cardinal judgments of symbolic numbers and all nonsymbolic judgments. At the neural level, symbolic number-ordering was the only numerical task that did not show number-specific activity (greater than control) in the intraparietal sulcus. Only activity in left premotor cortex was specifically associated with symbolic number-ordering. For nonsymbolic numbers, activation in cognitive-control areas during ordinal processing and a high degree of overlap between ordinal and cardinal processing networks indicate that nonsymbolic ordinality is assessed via iterative cardinality judgments. This contrasts with a striking lack of neural overlap between ordinal and cardinal judgments anywhere in the brain for symbolic numbers, suggesting that symbolic number processing varies substantially with computational context. Ordinal processing sheds light on key differences between symbolic and nonsymbolic number processing both behaviorally and in the brain. Ordinality may prove important for understanding the power of representing numbers symbolically.

Genetic-evolution-based optimization methods for engineering design

NASA Technical Reports Server (NTRS)

Rao, S. S.; Pan, T. S.; Dhingra, A. K.; Venkayya, V. B.; Kumar, V.

1990-01-01

This paper presents the applicability of a biological model, based on genetic evolution, for engineering design optimization. Algorithms embodying the ideas of reproduction, crossover, and mutation are developed and applied to solve different types of structural optimization problems. Both continuous and discrete variable optimization problems are solved. A two-bay truss for maximum fundamental frequency is considered to demonstrate the continuous variable case. The selection of locations of actuators in an actively controlled structure, for minimum energy dissipation, is considered to illustrate the discrete variable case.

Parameter estimation problems for distributed systems using a multigrid method

NASA Technical Reports Server (NTRS)

Ta'asan, Shlomo; Dutt, Pravir

1990-01-01

The problem of estimating spatially varying coefficients of partial differential equations is considered from observation of the solution and of the right hand side of the equation. It is assumed that the observations are distributed in the domain and that enough observations are given. A method of discretization and an efficient multigrid method for solving the resulting discrete systems are described. Numerical results are presented for estimation of coefficients in an elliptic and a parabolic partial differential equation.

On multigrid solution of the implicit equations of hydrodynamics. Experiments for the compressible Euler equations in general coordinates

NASA Astrophysics Data System (ADS)

Kifonidis, K.; Müller, E.

2012-08-01

Aims: We describe and study a family of new multigrid iterative solvers for the multidimensional, implicitly discretized equations of hydrodynamics. Schemes of this class are free of the Courant-Friedrichs-Lewy condition. They are intended for simulations in which widely differing wave propagation timescales are present. A preferred solver in this class is identified. Applications to some simple stiff test problems that are governed by the compressible Euler equations, are presented to evaluate the convergence behavior, and the stability properties of this solver. Algorithmic areas are determined where further work is required to make the method sufficiently efficient and robust for future application to difficult astrophysical flow problems. Methods: The basic equations are formulated and discretized on non-orthogonal, structured curvilinear meshes. Roe's approximate Riemann solver and a second-order accurate reconstruction scheme are used for spatial discretization. Implicit Runge-Kutta (ESDIRK) schemes are employed for temporal discretization. The resulting discrete equations are solved with a full-coarsening, non-linear multigrid method. Smoothing is performed with multistage-implicit smoothers. These are applied here to the time-dependent equations by means of dual time stepping. Results: For steady-state problems, our results show that the efficiency of the present approach is comparable to the best implicit solvers for conservative discretizations of the compressible Euler equations that can be found in the literature. The use of red-black as opposed to symmetric Gauss-Seidel iteration in the multistage-smoother is found to have only a minor impact on multigrid convergence. This should enable scalable parallelization without having to seriously compromise the method's algorithmic efficiency. For time-dependent test problems, our results reveal that the multigrid convergence rate degrades with increasing Courant numbers (i.e. time step sizes). Beyond a Courant number of nine thousand, even complete multigrid breakdown is observed. Local Fourier analysis indicates that the degradation of the convergence rate is associated with the coarse-grid correction algorithm. An implicit scheme for the Euler equations that makes use of the present method was, nevertheless, able to outperform a standard explicit scheme on a time-dependent problem with a Courant number of order 1000. Conclusions: For steady-state problems, the described approach enables the construction of parallelizable, efficient, and robust implicit hydrodynamics solvers. The applicability of the method to time-dependent problems is presently restricted to cases with moderately high Courant numbers. This is due to an insufficient coarse-grid correction of the employed multigrid algorithm for large time steps. Further research will be required to help us to understand and overcome the observed multigrid convergence difficulties for time-dependent problems.

Social Host Ordinances and Policies. Prevention Update

ERIC Educational Resources Information Center

Higher Education Center for Alcohol, Drug Abuse, and Violence Prevention, 2011

2011-01-01

Social host liability laws (also known as teen party ordinances, loud or unruly gathering ordinances, or response costs ordinances) target the location in which underage drinking takes place. Social host liability laws hold noncommercial individuals responsible for underage drinking events on property they own, lease, or otherwise control. They…

25 CFR 522.8 - Publication of class III ordinance and approval.

Code of Federal Regulations, 2010 CFR

2010-04-01

... Section 522.8 Indians NATIONAL INDIAN GAMING COMMISSION, DEPARTMENT OF THE INTERIOR APPROVAL OF CLASS II AND CLASS III ORDINANCES AND RESOLUTIONS SUBMISSION OF GAMING ORDINANCE OR RESOLUTION § 522.8 Publication of class III ordinance and approval. The Chairman shall publish a class III tribal gaming...

27 CFR 478.24 - Compilation of State laws and published ordinances.

Code of Federal Regulations, 2010 CFR

2010-04-01

... and published ordinances. 478.24 Section 478.24 Alcohol, Tobacco Products, and Firearms BUREAU OF... published ordinances. (a) The Director shall annually revise and furnish Federal firearms licensees with a compilation of State laws and published ordinances which are relevant to the enforcement of this part. The...

On the Maximum-Weight Clique Problem.

DTIC Science & Technology

1985-06-01

hypergeometric distribution", Discrete Math . 25, 285-287 .* CHVATAL, V. (1983), Linear Programming, W.H. Freeman, New York/San Francisco. COOK, S.A. (1971...Annals Discrete Math . 21, 325-356 GROTSCHEL, M., L. LOVASZ, and A. SCHRIJVER ((1984b), "Relaxations of Vertex Packing", Preprint No. 35...de Grenoble. See also N. Sbihi, "Algorithme de recherche d’un stable de cardinalite maximum dans un graphe sans etoile", Discrete Math . 19 (1980), 53

Discrete mathematical model of wave diffraction on pre-fractal impedance strips. TM mode case

NASA Astrophysics Data System (ADS)

Nesvit, K. V.

2013-10-01

In this paper a transverse magnetic (TM) wave diffraction problem on pre-fractal impedance strips is considered. The overall aim of this work is to develop a discrete mathematical model of the boundary integral equations (IEs) with the help of special quadrature formulas with the nodes in the zeros of Chebyshev polynomials and to perform a numerical experiments with the help of an efficient discrete singularities method (DSM).

Optimal generalized multistep integration formulae for real-time digital simulation

NASA Technical Reports Server (NTRS)

Moerder, D. D.; Halyo, N.

1985-01-01

The problem of discretizing a dynamical system for real-time digital simulation is considered. Treating the system and its simulation as stochastic processes leads to a statistical characterization of simulator fidelity. A plant discretization procedure based on an efficient matrix generalization of explicit linear multistep discrete integration formulae is introduced, which minimizes a weighted sum of the mean squared steady-state and transient error between the system and simulator outputs.

Design of a blade stiffened composite panel by a genetic algorithm

NASA Technical Reports Server (NTRS)

Nagendra, S.; Haftka, R. T.; Gurdal, Z.

1993-01-01

Genetic algorithms (GAs) readily handle discrete problems, and can be made to generate many optima, as is presently illustrated for the case of design for minimum-weight stiffened panels with buckling constraints. The GA discrete design procedure proved superior to extant alternatives for both stiffened panels with cutouts and without cutouts. High computational costs are, however, associated with this discrete design approach at the current level of its development.

The nonconforming virtual element method for eigenvalue problems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Gardini, Francesca; Manzini, Gianmarco; Vacca, Giuseppe

We analyse the nonconforming Virtual Element Method (VEM) for the approximation of elliptic eigenvalue problems. The nonconforming VEM allow to treat in the same formulation the two- and three-dimensional case.We present two possible formulations of the discrete problem, derived respectively by the nonstabilized and stabilized approximation of the L 2-inner product, and we study the convergence properties of the corresponding discrete eigenvalue problems. The proposed schemes provide a correct approximation of the spectrum and we prove optimal-order error estimates for the eigenfunctions and the usual double order of convergence of the eigenvalues. Finally we show a large set of numericalmore » tests supporting the theoretical results, including a comparison with the conforming Virtual Element choice.« less

A computational study of the discretization error in the solution of the Spencer-Lewis equation by doubling applied to the upwind finite-difference approximation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Nelson, P.; Seth, D.L.; Ray, A.K.

A detailed and systematic study of the nature of the discretization error associated with the upwind finite-difference method is presented. A basic model problem has been identified and based upon the results for this problem, a basic hypothesis regarding the accuracy of the computational solution of the Spencer-Lewis equation is formulated. The basic hypothesis is then tested under various systematic single complexifications of the basic model problem. The results of these tests provide the framework of the refined hypothesis presented in the concluding comments. 27 refs., 3 figs., 14 tabs.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Jones, J E; Vassilevski, P S; Woodward, C S

This paper provides extensions of an element agglomeration AMG method to nonlinear elliptic problems discretized by the finite element method on general unstructured meshes. The method constructs coarse discretization spaces and corresponding coarse nonlinear operators as well as their Jacobians. We introduce both standard (fairly quasi-uniformly coarsened) and non-standard (coarsened away) coarse meshes and respective finite element spaces. We use both kind of spaces in FAS type coarse subspace correction (or Schwarz) algorithms. Their performance is illustrated on a number of model problems. The coarsened away spaces seem to perform better than the standard spaces for problems with nonlinearities inmore » the principal part of the elliptic operator.« less

In Praise of Numerical Computation

NASA Astrophysics Data System (ADS)

Yap, Chee K.

Theoretical Computer Science has developed an almost exclusively discrete/algebraic persona. We have effectively shut ourselves off from half of the world of computing: a host of problems in Computational Science & Engineering (CS&E) are defined on the continuum, and, for them, the discrete viewpoint is inadequate. The computational techniques in such problems are well-known to numerical analysis and applied mathematics, but are rarely discussed in theoretical algorithms: iteration, subdivision and approximation. By various case studies, I will indicate how our discrete/algebraic view of computing has many shortcomings in CS&E. We want embrace the continuous/analytic view, but in a new synthesis with the discrete/algebraic view. I will suggest a pathway, by way of an exact numerical model of computation, that allows us to incorporate iteration and approximation into our algorithms’ design. Some recent results give a peek into how this view of algorithmic development might look like, and its distinctive form suggests the name “numerical computational geometry” for such activities.

A mimetic finite difference method for the Stokes problem with elected edge bubbles

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lipnikov, K; Berirao, L

2009-01-01

A new mimetic finite difference method for the Stokes problem is proposed and analyzed. The unstable P{sub 1}-P{sub 0} discretization is stabilized by adding a small number of bubble functions to selected mesh edges. A simple strategy for selecting such edges is proposed and verified with numerical experiments. The discretizations schemes for Stokes and Navier-Stokes equations must satisfy the celebrated inf-sup (or the LBB) stability condition. The stability condition implies a balance between discrete spaces for velocity and pressure. In finite elements, this balance is frequently achieved by adding bubble functions to the velocity space. The goal of this articlemore » is to show that the stabilizing edge bubble functions can be added only to a small set of mesh edges. This results in a smaller algebraic system and potentially in a faster calculations. We employ the mimetic finite difference (MFD) discretization technique that works for general polyhedral meshes and can accomodate non-uniform distribution of stabilizing bubbles.« less

Weighted interior penalty discretization of fully nonlinear and weakly dispersive free surface shallow water flows

NASA Astrophysics Data System (ADS)

Di Pietro, Daniele A.; Marche, Fabien

2018-02-01

In this paper, we further investigate the use of a fully discontinuous Finite Element discrete formulation for the study of shallow water free surface flows in the fully nonlinear and weakly dispersive flow regime. We consider a decoupling strategy in which we approximate the solutions of the classical shallow water equations supplemented with a source term globally accounting for the non-hydrostatic effects. This source term can be computed through the resolution of elliptic second-order linear sub-problems, which only involve second order partial derivatives in space. We then introduce an associated Symmetric Weighted Internal Penalty discrete bilinear form, allowing to deal with the discontinuous nature of the elliptic problem's coefficients in a stable and consistent way. Similar discrete formulations are also introduced for several recent optimized fully nonlinear and weakly dispersive models. These formulations are validated again several benchmarks involving h-convergence, p-convergence and comparisons with experimental data, showing optimal convergence properties.

Building Code Compliance and Enforcement: The Experience of SanFrancisco's Residential Energy Conservation Ordinanace and California'sBuildign Standards for New Construction

DOE Office of Scientific and Technical Information (OSTI.GOV)

Vine, E.

1990-11-01

As part of Lawrence Berkeley Laboratory's (LBL) technical assistance to the Sustainable City Project, compliance and enforcement activities related to local and state building codes for existing and new construction were evaluated in two case studies. The analysis of the City of San Francisco's Residential Energy Conservation Ordinance (RECO) showed that a limited, prescriptive energy conservation ordinance for existing residential construction can be enforced relatively easily with little administrative costs, and that compliance with such ordinances can be quite high. Compliance with the code was facilitated by extensive publicity, an informed public concerned with the cost of energy and knowledgeablemore » about energy efficiency, the threat of punishment (Order of Abatement), the use of private inspectors, and training workshops for City and private inspectors. The analysis of California's Title 24 Standards for new residential and commercial construction showed that enforcement of this type of code for many climate zones is more complex and requires extensive administrative support for education and training of inspectors, architects, engineers, and builders. Under this code, prescriptive and performance approaches for compliance are permitted, resulting in the demand for alternative methods of enforcement: technical assistance, plan review, field inspection, and computer analysis. In contrast to existing construction, building design and new materials and construction practices are of critical importance in new construction, creating a need for extensive technical assistance and extensive interaction between enforcement personnel and the building community. Compliance problems associated with building design and installation did occur in both residential and nonresidential buildings. Because statewide codes are enforced by local officials, these problems may increase over time as energy standards change and become more complex and as other standards (eg, health and safety codes) remain a higher priority. The California Energy Commission realizes that code enforcement by itself is insufficient and expects that additional educational and technical assistance efforts (eg, manuals, training programs, and toll-free telephone lines) will ameliorate these problems.« less

Wavelet transforms with discrete-time continuous-dilation wavelets

NASA Astrophysics Data System (ADS)

Zhao, Wei; Rao, Raghuveer M.

1999-03-01

Wavelet constructions and transforms have been confined principally to the continuous-time domain. Even the discrete wavelet transform implemented through multirate filter banks is based on continuous-time wavelet functions that provide orthogonal or biorthogonal decompositions. This paper provides a novel wavelet transform construction based on the definition of discrete-time wavelets that can undergo continuous parameter dilations. The result is a transformation that has the advantage of discrete-time or digital implementation while circumventing the problem of inadequate scaling resolution seen with conventional dyadic or M-channel constructions. Examples of constructing such wavelets are presented.

Using ordinal partition transition networks to analyze ECG data

NASA Astrophysics Data System (ADS)

Kulp, Christopher W.; Chobot, Jeremy M.; Freitas, Helena R.; Sprechini, Gene D.

2016-07-01

Electrocardiogram (ECG) data from patients with a variety of heart conditions are studied using ordinal pattern partition networks. The ordinal pattern partition networks are formed from the ECG time series by symbolizing the data into ordinal patterns. The ordinal patterns form the nodes of the network and edges are defined through the time ordering of the ordinal patterns in the symbolized time series. A network measure, called the mean degree, is computed from each time series-generated network. In addition, the entropy and number of non-occurring ordinal patterns (NFP) is computed for each series. The distribution of mean degrees, entropies, and NFPs for each heart condition studied is compared. A statistically significant difference between healthy patients and several groups of unhealthy patients with varying heart conditions is found for the distributions of the mean degrees, unlike for any of the distributions of the entropies or NFPs.

The Physical Mechanism for Retinal Discrete Dark Noise: Thermal Activation or Cellular Ultraweak Photon Emission?

PubMed

Salari, Vahid; Scholkmann, Felix; Bokkon, Istvan; Shahbazi, Farhad; Tuszynski, Jack

2016-01-01

For several decades the physical mechanism underlying discrete dark noise of photoreceptors in the eye has remained highly controversial and poorly understood. It is known that the Arrhenius equation, which is based on the Boltzmann distribution for thermal activation, can model only a part (e.g. half of the activation energy) of the retinal dark noise experimentally observed for vertebrate rod and cone pigments. Using the Hinshelwood distribution instead of the Boltzmann distribution in the Arrhenius equation has been proposed as a solution to the problem. Here, we show that the using the Hinshelwood distribution does not solve the problem completely. As the discrete components of noise are indistinguishable in shape and duration from those produced by real photon induced photo-isomerization, the retinal discrete dark noise is most likely due to 'internal photons' inside cells and not due to thermal activation of visual pigments. Indeed, all living cells exhibit spontaneous ultraweak photon emission (UPE), mainly in the optical wavelength range, i.e., 350-700 nm. We show here that the retinal discrete dark noise has a similar rate as UPE and therefore dark noise is most likely due to spontaneous cellular UPE and not due to thermal activation.

Adaptive NN controller design for a class of nonlinear MIMO discrete-time systems.

PubMed

Liu, Yan-Jun; Tang, Li; Tong, Shaocheng; Chen, C L Philip

2015-05-01

An adaptive neural network tracking control is studied for a class of multiple-input multiple-output (MIMO) nonlinear systems. The studied systems are in discrete-time form and the discretized dead-zone inputs are considered. In addition, the studied MIMO systems are composed of N subsystems, and each subsystem contains unknown functions and external disturbance. Due to the complicated framework of the discrete-time systems, the existence of the dead zone and the noncausal problem in discrete-time, it brings about difficulties for controlling such a class of systems. To overcome the noncausal problem, by defining the coordinate transformations, the studied systems are transformed into a special form, which is suitable for the backstepping design. The radial basis functions NNs are utilized to approximate the unknown functions of the systems. The adaptation laws and the controllers are designed based on the transformed systems. By using the Lyapunov method, it is proved that the closed-loop system is stable in the sense that the semiglobally uniformly ultimately bounded of all the signals and the tracking errors converge to a bounded compact set. The simulation examples and the comparisons with previous approaches are provided to illustrate the effectiveness of the proposed control algorithm.

Confirmatory Factor Analysis of Ordinal Variables with Misspecified Models

ERIC Educational Resources Information Center

Yang-Wallentin, Fan; Joreskog, Karl G.; Luo, Hao

2010-01-01

Ordinal variables are common in many empirical investigations in the social and behavioral sciences. Researchers often apply the maximum likelihood method to fit structural equation models to ordinal data. This assumes that the observed measures have normal distributions, which is not the case when the variables are ordinal. A better approach is…

75 FR 51102 - Liquor Ordinance of the Wichita and Affiliated Tribes; Correction

Federal Register 2010, 2011, 2012, 2013, 2014

2010-08-18

... Tribes; Correction AGENCY: Bureau of Indian Affairs, Interior ACTION: Notice; correction SUMMARY: The... Liquor Ordinance of the Wichita and Affiliated Tribes. The notice refers to an amended ordinance of the Wichita and Affiliated Tribes when in fact the Liquor Ordinance adopted by Resolution No. WT-10-31 on May...

Estimating Ordinal Reliability for Likert-Type and Ordinal Item Response Data: A Conceptual, Empirical, and Practical Guide

ERIC Educational Resources Information Center

Gadermann, Anne M.; Guhn, Martin; Zumbo, Bruno D.

2012-01-01

This paper provides a conceptual, empirical, and practical guide for estimating ordinal reliability coefficients for ordinal item response data (also referred to as Likert, Likert-type, ordered categorical, or rating scale item responses). Conventionally, reliability coefficients, such as Cronbach's alpha, are calculated using a Pearson…

The effect of ordinances requiring smoke-free restaurants on restaurant sales.

PubMed Central

Glantz, S A; Smith, L R

1994-01-01

OBJECTIVES: The effect on restaurant revenues of local ordinances requiring smoke-free restaurants is an important consideration for restauranteurs themselves and the cities that depend on sales tax revenues to provide services. METHODS: Data were obtained from the California State Board of Equalization and Colorado State Department of Revenue on taxable restaurant sales from 1986 (1982 for Aspen) through 1993 for all 15 cities where ordinances were in force, as well as for 15 similar control communities without smoke-free ordinances during this period. These data were analyzed using multiple regression, including time and a dummy variable for whether an ordinance was in force. Total restaurant sales were analyzed as a fraction of total retail sales and restaurant sales in smoke-free cities vs the comparison cities similar in population, median income, and other factors. RESULTS. Ordinances had no significant effect on the fraction of total retail sales that went to restaurants or on the ratio of restaurant sales in communities with ordinances compared with those in the matched control communities. CONCLUSIONS. Smoke-free restaurant ordinances do not adversely affect restaurant sales. PMID:8017529

Ordinal measures for iris recognition.

PubMed

Sun, Zhenan; Tan, Tieniu

2009-12-01

Images of a human iris contain rich texture information useful for identity authentication. A key and still open issue in iris recognition is how best to represent such textural information using a compact set of features (iris features). In this paper, we propose using ordinal measures for iris feature representation with the objective of characterizing qualitative relationships between iris regions rather than precise measurements of iris image structures. Such a representation may lose some image-specific information, but it achieves a good trade-off between distinctiveness and robustness. We show that ordinal measures are intrinsic features of iris patterns and largely invariant to illumination changes. Moreover, compactness and low computational complexity of ordinal measures enable highly efficient iris recognition. Ordinal measures are a general concept useful for image analysis and many variants can be derived for ordinal feature extraction. In this paper, we develop multilobe differential filters to compute ordinal measures with flexible intralobe and interlobe parameters such as location, scale, orientation, and distance. Experimental results on three public iris image databases demonstrate the effectiveness of the proposed ordinal feature models.

Perfect discretization of reparametrization invariant path integrals

NASA Astrophysics Data System (ADS)

Bahr, Benjamin; Dittrich, Bianca; Steinhaus, Sebastian

2011-05-01

To obtain a well-defined path integral one often employs discretizations. In the case of gravity and reparametrization-invariant systems, the latter of which we consider here as a toy example, discretizations generically break diffeomorphism and reparametrization symmetry, respectively. This has severe implications, as these symmetries determine the dynamics of the corresponding system. Indeed we will show that a discretized path integral with reparametrization-invariance is necessarily also discretization independent and therefore uniquely determined by the corresponding continuum quantum mechanical propagator. We use this insight to develop an iterative method for constructing such a discretized path integral, akin to a Wilsonian RG flow. This allows us to address the problem of discretization ambiguities and of an anomaly-free path integral measure for such systems. The latter is needed to obtain a path integral, that can act as a projector onto the physical states, satisfying the quantum constraints. We will comment on implications for discrete quantum gravity models, such as spin foams.

Robust preview control for a class of uncertain discrete-time systems with time-varying delay.

PubMed

Li, Li; Liao, Fucheng

2018-02-01

This paper proposes a concept of robust preview tracking control for uncertain discrete-time systems with time-varying delay. Firstly, a model transformation is employed for an uncertain discrete system with time-varying delay. Then, the auxiliary variables related to the system state and input are introduced to derive an augmented error system that includes future information on the reference signal. This leads to the tracking problem being transformed into a regulator problem. Finally, for the augmented error system, a sufficient condition of asymptotic stability is derived and the preview controller design method is proposed based on the scaled small gain theorem and linear matrix inequality (LMI) technique. The method proposed in this paper not only solves the difficulty problem of applying the difference operator to the time-varying matrices but also simplifies the structure of the augmented error system. The numerical simulation example also illustrates the effectiveness of the results presented in the paper. Copyright © 2018 ISA. Published by Elsevier Ltd. All rights reserved.

An automatic multigrid method for the solution of sparse linear systems

NASA Technical Reports Server (NTRS)

Shapira, Yair; Israeli, Moshe; Sidi, Avram

1993-01-01

An automatic version of the multigrid method for the solution of linear systems arising from the discretization of elliptic PDE's is presented. This version is based on the structure of the algebraic system solely, and does not use the original partial differential operator. Numerical experiments show that for the Poisson equation the rate of convergence of our method is equal to that of classical multigrid methods. Moreover, the method is robust in the sense that its high rate of convergence is conserved for other classes of problems: non-symmetric, hyperbolic (even with closed characteristics) and problems on non-uniform grids. No double discretization or special treatment of sub-domains (e.g. boundaries) is needed. When supplemented with a vector extrapolation method, high rates of convergence are achieved also for anisotropic and discontinuous problems and also for indefinite Helmholtz equations. A new double discretization strategy is proposed for finite and spectral element schemes and is found better than known strategies.

Preconditioned Mixed Spectral Element Methods for Elasticity and Stokes Problems

NASA Technical Reports Server (NTRS)

Pavarino, Luca F.

1996-01-01

Preconditioned iterative methods for the indefinite systems obtained by discretizing the linear elasticity and Stokes problems with mixed spectral elements in three dimensions are introduced and analyzed. The resulting stiffness matrices have the structure of saddle point problems with a penalty term, which is associated with the Poisson ratio for elasticity problems or with stabilization techniques for Stokes problems. The main results of this paper show that the convergence rate of the resulting algorithms is independent of the penalty parameter, the number of spectral elements Nu and mildly dependent on the spectral degree eta via the inf-sup constant. The preconditioners proposed for the whole indefinite system are block-diagonal and block-triangular. Numerical experiments presented in the final section show that these algorithms are a practical and efficient strategy for the iterative solution of the indefinite problems arising from mixed spectral element discretizations of elliptic systems.

The solution of non-linear hyperbolic equation systems by the finite element method

NASA Technical Reports Server (NTRS)

Loehner, R.; Morgan, K.; Zienkiewicz, O. C.

1984-01-01

A finite-element method for the solution of nonlinear hyperbolic systems of equations, such as those encountered in non-self-adjoint problems of transient phenomena in convection-diffusion or in the mixed representation of wave problems, is developed and demonstrated. The problem is rewritten in moving coordinates and reinterpolated to the original mesh by a Taylor expansion prior to a standard Galerkin spatial discretization, and it is shown that this procedure is equivalent to the time-discretization approach of Donea (1984). Numerical results for sample problems are presented graphically, including such shallow-water problems as the breaking of a dam, the shoaling of a wave, and the outflow of a river; compressible flows such as the isothermal flow in a nozzle and the Riemann shock-tube problem; and the two-dimensional scalar-advection, nonlinear-shallow-water, and Euler equations.

Food marketing to children through toys: response of restaurants to the first U.S. toy ordinance.

PubMed

Otten, Jennifer J; Hekler, Eric B; Krukowski, Rebecca A; Buman, Matthew P; Saelens, Brian E; Gardner, Christopher D; King, Abby C

2012-01-01

On August 9, 2010, Santa Clara County CA became the first U.S. jurisdiction to implement an ordinance that prohibits the distribution of toys and other incentives to children in conjunction with meals, foods, or beverages that do not meet minimal nutritional criteria. Restaurants had many different options for complying with this ordinance, such as introducing more healthful menu options, reformulating current menu items, or changing marketing or toy distribution practices. To assess how ordinance-affected restaurants changed their child menus, marketing, and toy distribution practices relative to non-affected restaurants. Children's menu items and child-directed marketing and toy distribution practices were examined before and at two time points after ordinance implementation (from July through November 2010) at ordinance-affected fast-food restaurants compared with demographically matched unaffected same-chain restaurants using the Children's Menu Assessment tool. Affected restaurants showed a 2.8- to 3.4-fold improvement in Children's Menu Assessment scores from pre- to post-ordinance with minimal changes at unaffected restaurants. Response to the ordinance varied by restaurant. Improvements were seen in on-site nutritional guidance; promotion of healthy meals, beverages, and side items; and toy marketing and distribution activities. The ordinance appears to have positively influenced marketing of healthful menu items and toys as well as toy distribution practices at ordinance-affected restaurants, but did not affect the number of healthful food items offered. Copyright © 2012 American Journal of Preventive Medicine. Published by Elsevier Inc. All rights reserved.

WWER-1000 core and reflector parameters investigation in the LR-0 reactor

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zaritsky, S. M.; Alekseev, N. I.; Bolshagin, S. N.

2006-07-01

Measurements and calculations carried out in the core and reflector of WWER-1000 mock-up are discussed: - the determination of the pin-to-pin power distribution in the core by means of gamma-scanning of fuel pins and pin-to-pin calculations with Monte Carlo code MCU-REA and diffusion codes MOBY-DICK (with WIMS-D4 cell constants preparation) and RADAR - the fast neutron spectra measurements by proton recoil method inside the experimental channel in the core and inside the channel in the baffle, and corresponding calculations in P{sub 3}S{sub 8} approximation of discrete ordinates method with code DORT and BUGLE-96 library - the neutron spectra evaluations (adjustment)more » in the same channels in energy region 0.5 eV-18 MeV based on the activation and solid state track detectors measurements. (authors)« less

Computational analysis of Variable Thrust Engine (VTE) performance

NASA Technical Reports Server (NTRS)

Giridharan, M. G.; Krishnan, A.; Przekwas, A. J.

1993-01-01

The Variable Thrust Engine (VTE) of the Orbital Maneuvering Vehicle (OMV) uses a hypergolic propellant combination of Monomethyl Hydrazine (MMH) and Nitrogen Tetroxide (NTO) as fuel and oxidizer, respectively. The performance of the VTE depends on a number of complex interacting phenomena such as atomization, spray dynamics, vaporization, turbulent mixing, convective/radiative heat transfer, and hypergolic combustion. This study involved the development of a comprehensive numerical methodology to facilitate detailed analysis of the VTE. An existing Computational Fluid Dynamics (CFD) code was extensively modified to include the following models: a two-liquid, two-phase Eulerian-Lagrangian spray model; a chemical equilibrium model; and a discrete ordinate radiation heat transfer model. The modified code was used to conduct a series of simulations to assess the effects of various physical phenomena and boundary conditions on the VTE performance. The details of the models and the results of the simulations are presented.

Radiative transfer simulations of the two-dimensional ocean glint reflectance and determination of the sea surface roughness.

PubMed

Lin, Zhenyi; Li, Wei; Gatebe, Charles; Poudyal, Rajesh; Stamnes, Knut

2016-02-20

An optimized discrete-ordinate radiative transfer model (DISORT3) with a pseudo-two-dimensional bidirectional reflectance distribution function (BRDF) is used to simulate and validate ocean glint reflectances at an infrared wavelength (1036 nm) by matching model results with a complete set of BRDF measurements obtained from the NASA cloud absorption radiometer (CAR) deployed on an aircraft. The surface roughness is then obtained through a retrieval algorithm and is used to extend the simulation into the visible spectral range where diffuse reflectance becomes important. In general, the simulated reflectances and surface roughness information are in good agreement with the measurements, and the diffuse reflectance in the visible, ignored in current glint algorithms, is shown to be important. The successful implementation of this new treatment of ocean glint reflectance and surface roughness in DISORT3 will help improve glint correction algorithms in current and future ocean color remote sensing applications.

A rapid radiative transfer model for reflection of solar radiation

NASA Technical Reports Server (NTRS)

Xiang, X.; Smith, E. A.; Justus, C. G.

1994-01-01

A rapid analytical radiative transfer model for reflection of solar radiation in plane-parallel atmospheres is developed based on the Sobolev approach and the delta function transformation technique. A distinct advantage of this model over alternative two-stream solutions is that in addition to yielding the irradiance components, which turn out to be mathematically equivalent to the delta-Eddington approximation, the radiance field can also be expanded in a mathematically consistent fashion. Tests with the model against a more precise multistream discrete ordinate model over a wide range of input parameters demonstrate that the new approximate method typically produces average radiance differences of less than 5%, with worst average differences of approximately 10%-15%. By the same token, the computational speed of the new model is some tens to thousands times faster than that of the more precise model when its stream resolution is set to generate precise calculations.

Radiative Transfer Simulations of the Two-Dimensional Ocean Glint Reflectance and Determination of the Sea Surface Roughness

NASA Technical Reports Server (NTRS)

Lin, Zhenyi; Li, Wei; Gatebe, Charles; Poudyal, Rajesh; Stamnes, Knut

2016-01-01

An optimized discrete-ordinate radiative transfer model (DISORT3) with a pseudo-two-dimensional bidirectional reflectance distribution function (BRDF) is used to simulate and validate ocean glint reflectances at an infrared wavelength (1036 nm) by matching model results with a complete set of BRDF measurements obtained from the NASA cloud absorption radiometer (CAR) deployed on an aircraft. The surface roughness is then obtained through a retrieval algorithm and is used to extend the simulation into the visible spectral range where diffuse reflectance becomes important. In general, the simulated reflectances and surface roughness information are in good agreement with the measurements, and the diffuse reflectance in the visible, ignored in current glint algorithms, is shown to be important. The successful implementation of this new treatment of ocean glint reflectance and surface roughness in DISORT3 will help improve glint correction algorithms in current and future ocean color remote sensing applications.

Non-destructive testing of ceramic materials using mid-infrared ultrashort-pulse laser

NASA Astrophysics Data System (ADS)

Sun, S. C.; Qi, Hong; An, X. Y.; Ren, Y. T.; Qiao, Y. B.; Ruan, Liming M.

2018-04-01

The non-destructive testing (NDT) of ceramic materials using mid-infrared ultrashort-pulse laser is investigated in this study. The discrete ordinate method is applied to solve the transient radiative transfer equation in 2D semitransparent medium and the emerging radiative intensity on boundary serves as input for the inverse analysis. The sequential quadratic programming algorithm is employed as the inverse technique to optimize objective function, in which the gradient of objective function with respect to reconstruction parameters is calculated using the adjoint model. Two reticulated porous ceramics including partially stabilized zirconia and oxide-bonded silicon carbide are tested. The retrieval results show that the main characteristics of defects such as optical properties, geometric shapes and positions can be accurately reconstructed by the present model. The proposed technique is effective and robust in NDT of ceramics even with measurement errors.

Generalized Fokker-Planck theory for electron and photon transport in biological tissues: application to radiotherapy.

PubMed

Olbrant, Edgar; Frank, Martin

2010-12-01

In this paper, we study a deterministic method for particle transport in biological tissues. The method is specifically developed for dose calculations in cancer therapy and for radiological imaging. Generalized Fokker-Planck (GFP) theory [Leakeas and Larsen, Nucl. Sci. Eng. 137 (2001), pp. 236-250] has been developed to improve the Fokker-Planck (FP) equation in cases where scattering is forward-peaked and where there is a sufficient amount of large-angle scattering. We compare grid-based numerical solutions to FP and GFP in realistic medical applications. First, electron dose calculations in heterogeneous parts of the human body are performed. Therefore, accurate electron scattering cross sections are included and their incorporation into our model is extensively described. Second, we solve GFP approximations of the radiative transport equation to investigate reflectance and transmittance of light in biological tissues. All results are compared with either Monte Carlo or discrete-ordinates transport solutions.

Rarefied gas flow through two-dimensional nozzles

NASA Technical Reports Server (NTRS)

De Witt, Kenneth J.; Jeng, Duen-Ren; Keith, Theo G., Jr.; Chung, Chan-Hong

1989-01-01

A kinetic theory analysis is made of the flow of a rarefied gas from one reservoir to another through two-dimensional nozzles with arbitrary curvature. The Boltzmann equation simplified by a model collision integral is solved by means of finite-difference approximations with the discrete ordinate method. The physical space is transformed by a general grid generation technique and the velocity space is transformed to a polar coordinate system. A numerical code is developed which can be applied to any two-dimensional passage of complicated geometry for the flow regimes from free-molecular to slip. Numerical values of flow quantities can be calculated for the entire physical space including both inside the nozzle and in the outside plume. Predictions are made for the case of parallel slots and compared with existing literature data. Also, results for the cases of convergent or divergent slots and two-dimensional nozzles with arbitrary curvature at arbitrary knudsen number are presented.

Los Alamos radiation transport code system on desktop computing platforms

DOE Office of Scientific and Technical Information (OSTI.GOV)

Briesmeister, J.F.; Brinkley, F.W.; Clark, B.A.

The Los Alamos Radiation Transport Code System (LARTCS) consists of state-of-the-art Monte Carlo and discrete ordinates transport codes and data libraries. These codes were originally developed many years ago and have undergone continual improvement. With a large initial effort and continued vigilance, the codes are easily portable from one type of hardware to another. The performance of scientific work-stations (SWS) has evolved to the point that such platforms can be used routinely to perform sophisticated radiation transport calculations. As the personal computer (PC) performance approaches that of the SWS, the hardware options for desk-top radiation transport calculations expands considerably. Themore » current status of the radiation transport codes within the LARTCS is described: MCNP, SABRINA, LAHET, ONEDANT, TWODANT, TWOHEX, and ONELD. Specifically, the authors discuss hardware systems on which the codes run and present code performance comparisons for various machines.« less

Delta Clipper-Experimental In-Ground Effect on Base-Heating Environment

NASA Technical Reports Server (NTRS)

Wang, Ten-See

1998-01-01

A quasitransient in-ground effect method is developed to study the effect of vertical landing on a launch vehicle base-heating environment. This computational methodology is based on a three-dimensional, pressure-based, viscous flow, chemically reacting, computational fluid dynamics formulation. Important in-ground base-flow physics such as the fountain-jet formation, plume growth, air entrainment, and plume afterburning are captured with the present methodology. Convective and radiative base-heat fluxes are computed for comparison with those of a flight test. The influence of the laminar Prandtl number on the convective heat flux is included in this study. A radiative direction-dependency test is conducted using both the discrete ordinate and finite volume methods. Treatment of the plume afterburning is found to be very important for accurate prediction of the base-heat fluxes. Convective and radiative base-heat fluxes predicted by the model using a finite rate chemistry option compared reasonably well with flight-test data.

Assessment and validation of the community radiative transfer model for ice cloud conditions

NASA Astrophysics Data System (ADS)

Yi, Bingqi; Yang, Ping; Weng, Fuzhong; Liu, Quanhua

2014-11-01

The performance of the Community Radiative Transfer Model (CRTM) under ice cloud conditions is evaluated and improved with the implementation of MODIS collection 6 ice cloud optical property model based on the use of severely roughened solid column aggregates and a modified Gamma particle size distribution. New ice cloud bulk scattering properties (namely, the extinction efficiency, single-scattering albedo, asymmetry factor, and scattering phase function) suitable for application to the CRTM are calculated by using the most up-to-date ice particle optical property library. CRTM-based simulations illustrate reasonable accuracy in comparison with the counterparts derived from a combination of the Discrete Ordinate Radiative Transfer (DISORT) model and the Line-by-line Radiative Transfer Model (LBLRTM). Furthermore, simulations of the top of the atmosphere brightness temperature with CRTM for the Crosstrack Infrared Sounder (CrIS) are carried out to further evaluate the updated CRTM ice cloud optical property look-up table.

Neutron skyshine from intense 14-MeV neutron source facility

DOE Office of Scientific and Technical Information (OSTI.GOV)

Nakamura, T.; Hayashi, K.; Takahashi, A.

1985-07-01

The dose distribution and the spectrum variation of neutrons due to the skyshine effect have been measured with the high-efficiency rem counter, the multisphere spectrometer, and the NE-213 scintillator in the environment surrounding an intense 14-MeV neutron source facility. The dose distribution and the energy spectra of neutrons around the facility used as a skyshine source have also been measured to enable the absolute evaluation of the skyshine effect. The skyshine effect was analyzed by two multigroup Monte Carlo codes, NIMSAC and MMCR-2, by two discrete ordinates S /sub n/ codes, ANISN and DOT3.5, and by the shield structure designmore » code for skyshine, SKYSHINE-II. The calculated results show good agreement with the measured results in absolute values. These experimental results should be useful as benchmark data for shyshine analysis and for shielding design of fusion facilities.« less

It's Deja Vu All over Again: Using Multiple-Spell Discrete-Time Survival Analysis.

ERIC Educational Resources Information Center

Willett, John B.; Singer, Judith D.

1995-01-01

The multiple-spell discrete-time survival analysis method is introduced and illustrated using longitudinal data on exit from and reentry into the teaching profession. The method is applicable to many educational problems involving the sequential occurrence of disparate events or episodes. (SLD)

Pricing European option with transaction costs under the fractional long memory stochastic volatility model

NASA Astrophysics Data System (ADS)

Wang, Xiao-Tian; Wu, Min; Zhou, Ze-Min; Jing, Wei-Shu

2012-02-01

This paper deals with the problem of discrete time option pricing using the fractional long memory stochastic volatility model with transaction costs. Through the 'anchoring and adjustment' argument in a discrete time setting, a European call option pricing formula is obtained.

Clairvoyant fusion: a new methodology for designing robust detection algorithms

NASA Astrophysics Data System (ADS)

Schaum, Alan

2016-10-01

Many realistic detection problems cannot be solved with simple statistical tests for known alternative probability models. Uncontrollable environmental conditions, imperfect sensors, and other uncertainties transform simple detection problems with likelihood ratio solutions into composite hypothesis (CH) testing problems. Recently many multi- and hyperspectral sensing CH problems have been addressed with a new approach. Clairvoyant fusion (CF) integrates the optimal detectors ("clairvoyants") associated with every unspecified value of the parameters appearing in a detection model. For problems with discrete parameter values, logical rules emerge for combining the decisions of the associated clairvoyants. For many problems with continuous parameters, analytic methods of CF have been found that produce closed-form solutions-or approximations for intractable problems. Here the principals of CF are reviewed and mathematical insights are described that have proven useful in the derivation of solutions. It is also shown how a second-stage fusion procedure can be used to create theoretically superior detection algorithms for ALL discrete parameter problems.

High-Order Methods for Incompressible Fluid Flow

NASA Astrophysics Data System (ADS)

Deville, M. O.; Fischer, P. F.; Mund, E. H.

2002-08-01

High-order numerical methods provide an efficient approach to simulating many physical problems. This book considers the range of mathematical, engineering, and computer science topics that form the foundation of high-order numerical methods for the simulation of incompressible fluid flows in complex domains. Introductory chapters present high-order spatial and temporal discretizations for one-dimensional problems. These are extended to multiple space dimensions with a detailed discussion of tensor-product forms, multi-domain methods, and preconditioners for iterative solution techniques. Numerous discretizations of the steady and unsteady Stokes and Navier-Stokes equations are presented, with particular sttention given to enforcement of imcompressibility. Advanced discretizations. implementation issues, and parallel and vector performance are considered in the closing sections. Numerous examples are provided throughout to illustrate the capabilities of high-order methods in actual applications.

Higher-Order Compact Schemes for Numerical Simulation of Incompressible Flows

NASA Technical Reports Server (NTRS)

Wilson, Robert V.; Demuren, Ayodeji O.; Carpenter, Mark

1998-01-01

A higher order accurate numerical procedure has been developed for solving incompressible Navier-Stokes equations for 2D or 3D fluid flow problems. It is based on low-storage Runge-Kutta schemes for temporal discretization and fourth and sixth order compact finite-difference schemes for spatial discretization. The particular difficulty of satisfying the divergence-free velocity field required in incompressible fluid flow is resolved by solving a Poisson equation for pressure. It is demonstrated that for consistent global accuracy, it is necessary to employ the same order of accuracy in the discretization of the Poisson equation. Special care is also required to achieve the formal temporal accuracy of the Runge-Kutta schemes. The accuracy of the present procedure is demonstrated by application to several pertinent benchmark problems.

Nonlinear Control and Discrete Event Systems

NASA Technical Reports Server (NTRS)

Meyer, George; Null, Cynthia H. (Technical Monitor)

1995-01-01

As the operation of large systems becomes ever more dependent on extensive automation, the need for an effective solution to the problem of design and validation of the underlying software becomes more critical. Large systems possesses much detailed structure, typically hierarchical, and they are hybrid. Information processing at the top of the hierarchy is by means of formal logic and sentences; on the bottom it is by means of simple scalar differential equations and functions of time; and in the middle it is by an interacting mix of nonlinear multi-axis differential equations and automata, and functions of time and discrete events. The lecture will address the overall problem as it relates to flight vehicle management, describe the middle level, and offer a design approach that is based on Differential Geometry and Discrete Event Dynamic Systems Theory.

Weak Galerkin finite element methods for Darcy flow: Anisotropy and heterogeneity

NASA Astrophysics Data System (ADS)

Lin, Guang; Liu, Jiangguo; Mu, Lin; Ye, Xiu

2014-11-01

This paper presents a family of weak Galerkin finite element methods (WGFEMs) for Darcy flow computation. The WGFEMs are new numerical methods that rely on the novel concept of discrete weak gradients. The WGFEMs solve for pressure unknowns both in element interiors and on the mesh skeleton. The numerical velocity is then obtained from the discrete weak gradient of the numerical pressure. The new methods are quite different than many existing numerical methods in that they are locally conservative by design, the resulting discrete linear systems are symmetric and positive-definite, and there is no need for tuning problem-dependent penalty factors. We test the WGFEMs on benchmark problems to demonstrate the strong potential of these new methods in handling strong anisotropy and heterogeneity in Darcy flow.

Numerical simulation of electrophoresis separation processes

NASA Technical Reports Server (NTRS)

Ganjoo, D. K.; Tezduyar, T. E.

1986-01-01

A new Petrov-Galerkin finite element formulation has been proposed for transient convection-diffusion problems. Most Petrov-Galerkin formulations take into account the spatial discretization, and the weighting functions so developed give satisfactory solutions for steady state problems. Though these schemes can be used for transient problems, there is scope for improvement. The schemes proposed here, which consider temporal as well as spatial discretization, provide improved solutions. Electrophoresis, which involves the motion of charged entities under the influence of an applied electric field, is governed by equations similiar to those encountered in fluid flow problems, i.e., transient convection-diffusion equations. Test problems are solved in electrophoresis and fluid flow. The results obtained are satisfactory. It is also expected that these schemes, suitably adapted, will improve the numerical solutions of the compressible Euler and the Navier-Stokes equations.

Discrete Particle Swarm Optimization Routing Protocol for Wireless Sensor Networks with Multiple Mobile Sinks

PubMed Central

Yang, Jin; Liu, Fagui; Cao, Jianneng; Wang, Liangming

2016-01-01

Mobile sinks can achieve load-balancing and energy-consumption balancing across the wireless sensor networks (WSNs). However, the frequent change of the paths between source nodes and the sinks caused by sink mobility introduces significant overhead in terms of energy and packet delays. To enhance network performance of WSNs with mobile sinks (MWSNs), we present an efficient routing strategy, which is formulated as an optimization problem and employs the particle swarm optimization algorithm (PSO) to build the optimal routing paths. However, the conventional PSO is insufficient to solve discrete routing optimization problems. Therefore, a novel greedy discrete particle swarm optimization with memory (GMDPSO) is put forward to address this problem. In the GMDPSO, particle’s position and velocity of traditional PSO are redefined under discrete MWSNs scenario. Particle updating rule is also reconsidered based on the subnetwork topology of MWSNs. Besides, by improving the greedy forwarding routing, a greedy search strategy is designed to drive particles to find a better position quickly. Furthermore, searching history is memorized to accelerate convergence. Simulation results demonstrate that our new protocol significantly improves the robustness and adapts to rapid topological changes with multiple mobile sinks, while efficiently reducing the communication overhead and the energy consumption. PMID:27428971

A Discretization Algorithm for Meteorological Data and its Parallelization Based on Hadoop

NASA Astrophysics Data System (ADS)

Liu, Chao; Jin, Wen; Yu, Yuting; Qiu, Taorong; Bai, Xiaoming; Zou, Shuilong

2017-10-01

In view of the large amount of meteorological observation data, the property is more and the attribute values are continuous values, the correlation between the elements is the need for the application of meteorological data, this paper is devoted to solving the problem of how to better discretize large meteorological data to more effectively dig out the hidden knowledge in meteorological data and research on the improvement of discretization algorithm for large scale data, in order to achieve data in the large meteorological data discretization for the follow-up to better provide knowledge to provide protection, a discretization algorithm based on information entropy and inconsistency of meteorological attributes is proposed and the algorithm is parallelized under Hadoop platform. Finally, the comparison test validates the effectiveness of the proposed algorithm for discretization in the area of meteorological large data.

25 CFR 522.7 - Disapproval of a class III ordinance.

Code of Federal Regulations, 2010 CFR

2010-04-01

... 25 Indians 2 2010-04-01 2010-04-01 false Disapproval of a class III ordinance. 522.7 Section 522.7 Indians NATIONAL INDIAN GAMING COMMISSION, DEPARTMENT OF THE INTERIOR APPROVAL OF CLASS II AND CLASS III ORDINANCES AND RESOLUTIONS SUBMISSION OF GAMING ORDINANCE OR RESOLUTION § 522.7 Disapproval of a class III...

25 CFR 522.5 - Disapproval of a class II ordinance.

Code of Federal Regulations, 2010 CFR

2010-04-01

... 25 Indians 2 2010-04-01 2010-04-01 false Disapproval of a class II ordinance. 522.5 Section 522.5 Indians NATIONAL INDIAN GAMING COMMISSION, DEPARTMENT OF THE INTERIOR APPROVAL OF CLASS II AND CLASS III ORDINANCES AND RESOLUTIONS SUBMISSION OF GAMING ORDINANCE OR RESOLUTION § 522.5 Disapproval of a class II...

Ordinary Least Squares Estimation of Parameters in Exploratory Factor Analysis with Ordinal Data

ERIC Educational Resources Information Center

Lee, Chun-Ting; Zhang, Guangjian; Edwards, Michael C.

2012-01-01

Exploratory factor analysis (EFA) is often conducted with ordinal data (e.g., items with 5-point responses) in the social and behavioral sciences. These ordinal variables are often treated as if they were continuous in practice. An alternative strategy is to assume that a normally distributed continuous variable underlies each ordinal variable.…

Local Area Co-Ordination: Strengthening Support for People with Learning Disabilities in Scotland

ERIC Educational Resources Information Center

Stalker, Kirsten Ogilvie; Malloch, Margaret; Barry, Monica Anne; Watson, June Ann

2008-01-01

This paper reports the findings of a study commissioned by the Scottish Executive which examined the introduction and implementation of local area co-ordination (LAC) in Scotland. A questionnaire about their posts was completed by 44 local area co-ordinators, interviews were conducted with 35 local area co-ordinators and 14 managers and case…

Peridynamics with LAMMPS : a user guide.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lehoucq, Richard B.; Silling, Stewart Andrew; Seleson, Pablo

Peridynamics is a nonlocal extension of classical continuum mechanics. The discrete peridynamic model has the same computational structure as a molecular dynamics model. This document provides a brief overview of the peridynamic model of a continuum, then discusses how the peridynamic model is discretized within LAMMPS. An example problem is also included.

Univariate and Bivariate Loglinear Models for Discrete Test Score Distributions.

ERIC Educational Resources Information Center

Holland, Paul W.; Thayer, Dorothy T.

2000-01-01

Applied the theory of exponential families of distributions to the problem of fitting the univariate histograms and discrete bivariate frequency distributions that often arise in the analysis of test scores. Considers efficient computation of the maximum likelihood estimates of the parameters using Newton's Method and computationally efficient…

An Application of Discrete Mathematics to Coding Theory.

ERIC Educational Resources Information Center

Donohoe, L. Joyce

1992-01-01

Presents a public-key cryptosystem application to introduce students to several topics in discrete mathematics. A computer algorithms using recursive methods is presented to solve a problem in which one person wants to send a coded message to a second person while keeping the message secret from a third person. (MDH)

How Mathematics Propels the Development of Physical Knowledge

ERIC Educational Resources Information Center

Schwartz, Daniel L.; Martin, Taylor; Pfaffman, Jay

2005-01-01

Three studies examined whether mathematics can propel the development of physical understanding. In Experiment 1, 10-year-olds solved balance scale problems that used easy-to-count discrete quantities or hard-to-count continuous quantities. Discrete quantities led to age typical performances. Continuous quantities caused performances like those of…

Discrete Mathematics Course Supported by CAS MATHEMATICA

ERIC Educational Resources Information Center

Ivanov, O. A.; Ivanova, V. V.; Saltan, A. A.

2017-01-01

In this paper, we discuss examples of assignments for a course in discrete mathematics for undergraduate students majoring in business informatics. We consider several problems with computer-based solutions and discuss general strategies for using computers in teaching mathematics and its applications. In order to evaluate the effectiveness of our…

Tourism and hotel revenues before and after passage of smoke-free restaurant ordinances.

PubMed

Glantz, S A; Charlesworth, A

1999-05-26

Claims that ordinances requiring smoke-free restaurants will adversely affect tourism have been used to argue against passing such ordinances. Data exist regarding the validity of these claims. To determine the changes in hotel revenues and international tourism after passage of smoke-free restaurant ordinances in locales where the effect has been debated. Comparison of hotel revenues and tourism rates before and after passage of 100% smoke-free restaurant ordinances and comparison with US hotel revenue overall. Three states (California, Utah, and Vermont) and 6 cities (Boulder, Colo; Flagstaff, Ariz; Los Angeles, Calif; Mesa, Ariz; New York, NY; and San Francisco, Calif) in which the effect on tourism of smoke-free restaurant ordinances had been debated. Hotel room revenues and hotel revenues as a fraction of total retail sales compared with preordinance revenues and overall US revenues. In constant 1997 dollars, passage of the smoke-free restaurant ordinance was associated with a statistically significant increase in the rate of change of hotel revenues in 4 localities, no significant change in 4 localities, and a significant slowing in the rate of increase (but not a decrease) in 1 locality. There was no significant change in the rate of change of hotel revenues as a fraction of total retail sales (P=.16) or total US hotel revenues associated with the ordinances when pooled across all localities (P = .93). International tourism was either unaffected or increased following implementation of the smoke-free ordinances. Smoke-free ordinances do not appear to adversely affect, and may increase, tourist business.

Co-ordinated action between youth-care and sports: facilitators and barriers.

PubMed

Hermens, Niels; de Langen, Lisanne; Verkooijen, Kirsten T; Koelen, Maria A

2017-07-01

In the Netherlands, youth-care organisations and community sports clubs are collaborating to increase socially vulnerable youths' participation in sport. This is rooted in the idea that sports clubs are settings for youth development. As not much is known about co-ordinated action involving professional care organisations and community sports clubs, this study aims to generate insight into facilitators of and barriers to successful co-ordinated action between these two organisations. A cross-sectional study was conducted using in-depth semi-structured qualitative interview data. In total, 23 interviews were held at five locations where co-ordinated action between youth-care and sports takes place. Interviewees were youth-care workers, representatives from community sports clubs, and Care Sport Connectors who were assigned to encourage and manage the co-ordinated action. Using inductive coding procedures, this study shows that existing and good relationships, a boundary spanner, care workers' attitudes, knowledge and competences of the participants, organisational policies and ambitions, and some elements external to the co-ordinated action were reported to be facilitators or barriers. In addition, the participants reported that the different facilitators and barriers influenced the success of the co-ordinated action at different stages of the co-ordinated action. Future research is recommended to further explore the role of boundary spanners in co-ordinated action involving social care organisations and community sports clubs, and to identify what external elements (e.g. events, processes, national policies) are turning points in the formation, implementation and continuation of such co-ordinated action. © 2017 John Wiley & Sons Ltd.

Pattern matching through Chaos Game Representation: bridging numerical and discrete data structures for biological sequence analysis

PubMed Central

2012-01-01

Background Chaos Game Representation (CGR) is an iterated function that bijectively maps discrete sequences into a continuous domain. As a result, discrete sequences can be object of statistical and topological analyses otherwise reserved to numerical systems. Characteristically, CGR coordinates of substrings sharing an L-long suffix will be located within 2-L distance of each other. In the two decades since its original proposal, CGR has been generalized beyond its original focus on genomic sequences and has been successfully applied to a wide range of problems in bioinformatics. This report explores the possibility that it can be further extended to approach algorithms that rely on discrete, graph-based representations. Results The exploratory analysis described here consisted of selecting foundational string problems and refactoring them using CGR-based algorithms. We found that CGR can take the role of suffix trees and emulate sophisticated string algorithms, efficiently solving exact and approximate string matching problems such as finding all palindromes and tandem repeats, and matching with mismatches. The common feature of these problems is that they use longest common extension (LCE) queries as subtasks of their procedures, which we show to have a constant time solution with CGR. Additionally, we show that CGR can be used as a rolling hash function within the Rabin-Karp algorithm. Conclusions The analysis of biological sequences relies on algorithmic foundations facing mounting challenges, both logistic (performance) and analytical (lack of unifying mathematical framework). CGR is found to provide the latter and to promise the former: graph-based data structures for sequence analysis operations are entailed by numerical-based data structures produced by CGR maps, providing a unifying analytical framework for a diversity of pattern matching problems. PMID:22551152

Research of generalized wavelet transformations of Haar correctness in remote sensing of the Earth

NASA Astrophysics Data System (ADS)

Kazaryan, Maretta; Shakhramanyan, Mihail; Nedkov, Roumen; Richter, Andrey; Borisova, Denitsa; Stankova, Nataliya; Ivanova, Iva; Zaharinova, Mariana

2017-10-01

In this paper, Haar's generalized wavelet functions are applied to the problem of ecological monitoring by the method of remote sensing of the Earth. We study generalized Haar wavelet series and suggest the use of Tikhonov's regularization method for investigating them for correctness. In the solution of this problem, an important role is played by classes of functions that were introduced and described in detail by I.M. Sobol for studying multidimensional quadrature formulas and it contains functions with rapidly convergent series of wavelet Haar. A theorem on the stability and uniform convergence of the regularized summation function of the generalized wavelet-Haar series of a function from this class with approximate coefficients is proved. The article also examines the problem of using orthogonal transformations in Earth remote sensing technologies for environmental monitoring. Remote sensing of the Earth allows to receive from spacecrafts information of medium, high spatial resolution and to conduct hyperspectral measurements. Spacecrafts have tens or hundreds of spectral channels. To process the images, the device of discrete orthogonal transforms, and namely, wavelet transforms, was used. The aim of the work is to apply the regularization method in one of the problems associated with remote sensing of the Earth and subsequently to process the satellite images through discrete orthogonal transformations, in particular, generalized Haar wavelet transforms. General methods of research. In this paper, Tikhonov's regularization method, the elements of mathematical analysis, the theory of discrete orthogonal transformations, and methods for decoding of satellite images are used. Scientific novelty. The task of processing of archival satellite snapshots (images), in particular, signal filtering, was investigated from the point of view of an incorrectly posed problem. The regularization parameters for discrete orthogonal transformations were determined.

Effect of Family Structure and Behavioral and Eyesight Problems on Caries Severity in Pupils by Using an Ordinal Logistic Model

PubMed Central

JAHANI, Yunes; ESHRAGHIAN, Mohammad Reza; Rahimi FOROUSHANI, Abbas; NOURIJELYANI, Keramat; MOHAMMAD, Kazem; SHAHRAVAN, Arash; ALAM, Mahin

2013-01-01

Background: Dental caries is one of the most preventable yet prevalent chronic diseases worldwide. Our objective was to evaluate the effect of family structure and behavioral and eyesight problems as they relate to caries severity in schoolchildren. Methods: This research was carried out on 845 primary schoolchildren aged 9 yr in Kerman, Iran, in 2012. Ten variables, including health records, family structure information and a dmft/DMFT index, were collected. Children were categorized into three groups based on the WHO caries severity classification. Low caries level was defined as dmft/DMFT<2.6, moderate as dmft/DMFT of 2.7–4.4 and high as dmft/DMFT>4.4. The Cochran–Armitage test and ordinal logistic regression were employed for data analysis. Results: Almost half of pupils had moderate or high caries severity. The odds of being in a higher caries severity category in pupils with behavioral problems (OR=2.37, 95% CI: 1.29–4.38) and girls (OR=1.6, 95% CI: 1.22–2.06) were higher than in other categories. In addition, pupils with eyesight problems (OR=0.58, 95% CI: 0.37–0.90) and overweight pupils (OR=0.46, 95% CI: 0.31–0.71) had lower caries severity than others. The effects of parents’ education, birth rank, living with parents and consanguineous relationship between parents were not significant on caries severity (P>0.05). Conclusions: Female pupils with behavioral problems were at a higher risk of caries severity than other pupils. These pupils need to be educated and coached on proper dental care. In addition, overweight pupils and those with eyesight problems had less caries severity than others. Family structure in this study did not have an effect on the severity of dental caries. PMID:26056644

Survey of local forestry-related ordinances and regulations in the south

Treesearch

Jonathan J. Spink; Karry L. Haney; John L. Greene

2000-01-01

A survey of the 13 southern states was conducted in 1999-2000 to obtain a comprehensive list of forestry-related ordinances enacted by various local governments. Each ordinance was examined to determine the date of adoption, regulatory objective, and its regu1atory provisions. Based on the regulatory objective, the ordinances were categorized into five general types:...

A forward-advancing wave expansion method for numerical solution of large-scale sound propagation problems

NASA Astrophysics Data System (ADS)

Rolla, L. Barrera; Rice, H. J.

2006-09-01

In this paper a "forward-advancing" field discretization method suitable for solving the Helmholtz equation in large-scale problems is proposed. The forward wave expansion method (FWEM) is derived from a highly efficient discretization procedure based on interpolation of wave functions known as the wave expansion method (WEM). The FWEM computes the propagated sound field by means of an exclusively forward advancing solution, neglecting the backscattered field. It is thus analogous to methods such as the (one way) parabolic equation method (PEM) (usually discretized using standard finite difference or finite element methods). These techniques do not require the inversion of large system matrices and thus enable the solution of large-scale acoustic problems where backscatter is not of interest. Calculations using FWEM are presented for two propagation problems and comparisons to data computed with analytical and theoretical solutions and show this forward approximation to be highly accurate. Examples of sound propagation over a screen in upwind and downwind refracting atmospheric conditions at low nodal spacings (0.2 per wavelength in the propagation direction) are also included to demonstrate the flexibility and efficiency of the method.

Solving transient acoustic boundary value problems with equivalent sources using a lumped parameter approach.

PubMed

Fahnline, John B

2016-12-01

An equivalent source method is developed for solving transient acoustic boundary value problems. The method assumes the boundary surface is discretized in terms of triangular or quadrilateral elements and that the solution is represented using the acoustic fields of discrete sources placed at the element centers. Also, the boundary condition is assumed to be specified for the normal component of the surface velocity as a function of time, and the source amplitudes are determined to match the known elemental volume velocity vector at a series of discrete time steps. Equations are given for marching-on-in-time schemes to solve for the source amplitudes at each time step for simple, dipole, and tripole source formulations. Several example problems are solved to illustrate the results and to validate the formulations, including problems with closed boundary surfaces where long-time numerical instabilities typically occur. A simple relationship between the simple and dipole source amplitudes in the tripole source formulation is derived so that the source radiates primarily in the direction of the outward surface normal. The tripole source formulation is shown to eliminate interior acoustic resonances and long-time numerical instabilities.

Learning in stochastic neural networks for constraint satisfaction problems

NASA Technical Reports Server (NTRS)

Johnston, Mark D.; Adorf, Hans-Martin

1989-01-01

Researchers describe a newly-developed artificial neural network algorithm for solving constraint satisfaction problems (CSPs) which includes a learning component that can significantly improve the performance of the network from run to run. The network, referred to as the Guarded Discrete Stochastic (GDS) network, is based on the discrete Hopfield network but differs from it primarily in that auxiliary networks (guards) are asymmetrically coupled to the main network to enforce certain types of constraints. Although the presence of asymmetric connections implies that the network may not converge, it was found that, for certain classes of problems, the network often quickly converges to find satisfactory solutions when they exist. The network can run efficiently on serial machines and can find solutions to very large problems (e.g., N-queens for N as large as 1024). One advantage of the network architecture is that network connection strengths need not be instantiated when the network is established: they are needed only when a participating neural element transitions from off to on. They have exploited this feature to devise a learning algorithm, based on consistency techniques for discrete CSPs, that updates the network biases and connection strengths and thus improves the network performance.

General properties of solutions to inhomogeneous Black-Scholes equations with discontinuous maturity payoffs

NASA Astrophysics Data System (ADS)

O, Hyong-Chol; Jo, Jong-Jun; Kim, Ji-Sok

2016-02-01

We provide representations of solutions to terminal value problems of inhomogeneous Black-Scholes equations and study such general properties as min-max estimates, gradient estimates, monotonicity and convexity of the solutions with respect to the stock price variable, which are important for financial security pricing. In particular, we focus on finding representation of the gradient (with respect to the stock price variable) of solutions to the terminal value problems with discontinuous terminal payoffs or inhomogeneous terms. Such terminal value problems are often encountered in pricing problems of compound-like options such as Bermudan options or defaultable bonds with discrete default barrier, default intensity and endogenous default recovery. Our results can be used in pricing real defaultable bonds under consideration of existence of discrete coupons or taxes on coupons.

Overset meshing coupled with hybridizable discontinuous Galerkin finite elements

DOE PAGES

Kauffman, Justin A.; Sheldon, Jason P.; Miller, Scott T.

2017-03-01

We introduce the use of hybridizable discontinuous Galerkin (HDG) finite element methods on overlapping (overset) meshes. Overset mesh methods are advantageous for solving problems on complex geometrical domains. We also combine geometric flexibility of overset methods with the advantages of HDG methods: arbitrarily high-order accuracy, reduced size of the global discrete problem, and the ability to solve elliptic, parabolic, and/or hyperbolic problems with a unified form of discretization. This approach to developing the ‘overset HDG’ method is to couple the global solution from one mesh to the local solution on the overset mesh. We present numerical examples for steady convection–diffusionmore » and static elasticity problems. The examples demonstrate optimal order convergence in all primal fields for an arbitrary amount of overlap of the underlying meshes.« less

Knowledge of the ordinal position of list items in pigeons.

PubMed

Scarf, Damian; Colombo, Michael

2011-10-01

Ordinal knowledge is a fundamental aspect of advanced cognition. It is self-evident that humans represent ordinal knowledge, and over the past 20 years it has become clear that nonhuman primates share this ability. In contrast, evidence that nonprimate species represent ordinal knowledge is missing from the comparative literature. To address this issue, in the present experiment we trained pigeons on three 4-item lists and then tested them with derived lists in which, relative to the training lists, the ordinal position of the items was either maintained or changed. Similar to the findings with human and nonhuman primates, our pigeons performed markedly better on the maintained lists compared to the changed lists, and displayed errors consistent with the view that they used their knowledge of ordinal position to guide responding on the derived lists. These findings demonstrate that the ability to acquire ordinal knowledge is not unique to the primate lineage. (PsycINFO Database Record (c) 2011 APA, all rights reserved).

Numerical Integration Techniques for Curved-Element Discretizations of Molecule–Solvent Interfaces

PubMed Central

Bardhan, Jaydeep P.; Altman, Michael D.; Willis, David J.; Lippow, Shaun M.; Tidor, Bruce; White, Jacob K.

2012-01-01

Surface formulations of biophysical modeling problems offer attractive theoretical and computational properties. Numerical simulations based on these formulations usually begin with discretization of the surface under consideration; often, the surface is curved, possessing complicated structure and possibly singularities. Numerical simulations commonly are based on approximate, rather than exact, discretizations of these surfaces. To assess the strength of the dependence of simulation accuracy on the fidelity of surface representation, we have developed methods to model several important surface formulations using exact surface discretizations. Following and refining Zauhar’s work (J. Comp.-Aid. Mol. Des. 9:149-159, 1995), we define two classes of curved elements that can exactly discretize the van der Waals, solvent-accessible, and solvent-excluded (molecular) surfaces. We then present numerical integration techniques that can accurately evaluate nonsingular and singular integrals over these curved surfaces. After validating the exactness of the surface discretizations and demonstrating the correctness of the presented integration methods, we present a set of calculations that compare the accuracy of approximate, planar-triangle-based discretizations and exact, curved-element-based simulations of surface-generalized-Born (sGB), surface-continuum van der Waals (scvdW), and boundary-element method (BEM) electrostatics problems. Results demonstrate that continuum electrostatic calculations with BEM using curved elements, piecewise-constant basis functions, and centroid collocation are nearly ten times more accurate than planartriangle BEM for basis sets of comparable size. The sGB and scvdW calculations give exceptional accuracy even for the coarsest obtainable discretized surfaces. The extra accuracy is attributed to the exact representation of the solute–solvent interface; in contrast, commonly used planar-triangle discretizations can only offer improved approximations with increasing discretization and associated increases in computational resources. The results clearly demonstrate that our methods for approximate integration on an exact geometry are far more accurate than exact integration on an approximate geometry. A MATLAB implementation of the presented integration methods and sample data files containing curved-element discretizations of several small molecules are available online at http://web.mit.edu/tidor. PMID:17627358

Review of Hybrid (Deterministic/Monte Carlo) Radiation Transport Methods, Codes, and Applications at Oak Ridge National Laboratory

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wagner, John C; Peplow, Douglas E.; Mosher, Scott W

2010-01-01

This paper provides a review of the hybrid (Monte Carlo/deterministic) radiation transport methods and codes used at the Oak Ridge National Laboratory and examples of their application for increasing the efficiency of real-world, fixed-source Monte Carlo analyses. The two principal hybrid methods are (1) Consistent Adjoint Driven Importance Sampling (CADIS) for optimization of a localized detector (tally) region (e.g., flux, dose, or reaction rate at a particular location) and (2) Forward Weighted CADIS (FW-CADIS) for optimizing distributions (e.g., mesh tallies over all or part of the problem space) or multiple localized detector regions (e.g., simultaneous optimization of two or moremore » localized tally regions). The two methods have been implemented and automated in both the MAVRIC sequence of SCALE 6 and ADVANTG, a code that works with the MCNP code. As implemented, the methods utilize the results of approximate, fast-running 3-D discrete ordinates transport calculations (with the Denovo code) to generate consistent space- and energy-dependent source and transport (weight windows) biasing parameters. These methods and codes have been applied to many relevant and challenging problems, including calculations of PWR ex-core thermal detector response, dose rates throughout an entire PWR facility, site boundary dose from arrays of commercial spent fuel storage casks, radiation fields for criticality accident alarm system placement, and detector response for special nuclear material detection scenarios and nuclear well-logging tools. Substantial computational speed-ups, generally O(10{sup 2-4}), have been realized for all applications to date. This paper provides a brief review of the methods, their implementation, results of their application, and current development activities, as well as a considerable list of references for readers seeking more information about the methods and/or their applications.« less

Market segmentation for multiple option healthcare delivery systems--an application of cluster analysis.

PubMed

Jarboe, G R; Gates, R H; McDaniel, C D

1990-01-01

Healthcare providers of multiple option plans may be confronted with special market segmentation problems. This study demonstrates how cluster analysis may be used for discovering distinct patterns of preference for multiple option plans. The availability of metric, as opposed to categorical or ordinal, data provides the ability to use sophisticated analysis techniques which may be superior to frequency distributions and cross-tabulations in revealing preference patterns.

Least squares regression methods for clustered ROC data with discrete covariates.

PubMed

Tang, Liansheng Larry; Zhang, Wei; Li, Qizhai; Ye, Xuan; Chan, Leighton

2016-07-01

The receiver operating characteristic (ROC) curve is a popular tool to evaluate and compare the accuracy of diagnostic tests to distinguish the diseased group from the nondiseased group when test results from tests are continuous or ordinal. A complicated data setting occurs when multiple tests are measured on abnormal and normal locations from the same subject and the measurements are clustered within the subject. Although least squares regression methods can be used for the estimation of ROC curve from correlated data, how to develop the least squares methods to estimate the ROC curve from the clustered data has not been studied. Also, the statistical properties of the least squares methods under the clustering setting are unknown. In this article, we develop the least squares ROC methods to allow the baseline and link functions to differ, and more importantly, to accommodate clustered data with discrete covariates. The methods can generate smooth ROC curves that satisfy the inherent continuous property of the true underlying curve. The least squares methods are shown to be more efficient than the existing nonparametric ROC methods under appropriate model assumptions in simulation studies. We apply the methods to a real example in the detection of glaucomatous deterioration. We also derive the asymptotic properties of the proposed methods. © 2016 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Numerical study of the effects of lamp configuration and reactor wall roughness in an open channel water disinfection UV reactor.

PubMed

Sultan, Tipu

2016-07-01

This article describes the assessment of a numerical procedure used to determine the UV lamp configuration and surface roughness effects on an open channel water disinfection UV reactor. The performance of the open channel water disinfection UV reactor was numerically analyzed on the basis of the performance indictor reduction equivalent dose (RED). The RED values were calculated as a function of the Reynolds number to monitor the performance. The flow through the open channel UV reactor was modelled using a k-ε model with scalable wall function, a discrete ordinate (DO) model for fluence rate calculation, a volume of fluid (VOF) model to locate the unknown free surface, a discrete phase model (DPM) to track the pathogen transport, and a modified law of the wall to incorporate the reactor wall roughness effects. The performance analysis was carried out using commercial CFD software (ANSYS Fluent 15.0). Four case studies were analyzed based on open channel UV reactor type (horizontal and vertical) and lamp configuration (parallel and staggered). The results show that lamp configuration can play an important role in the performance of an open channel water disinfection UV reactor. The effects of the reactor wall roughness were Reynolds number dependent. The proposed methodology is useful for performance optimization of an open channel water disinfection UV reactor. Copyright © 2016 Elsevier Ltd. All rights reserved.

Kalman filters for fractional discrete-time stochastic systems along with time-delay in the observation signal

NASA Astrophysics Data System (ADS)

Torabi, H.; Pariz, N.; Karimpour, A.

2016-02-01

This paper investigates fractional Kalman filters when time-delay is entered in the observation signal in the discrete-time stochastic fractional order state-space representation. After investigating the common fractional Kalman filter, we try to derive a fractional Kalman filter for time-delay fractional systems. A detailed derivation is given. Fractional Kalman filters will be used to estimate recursively the states of fractional order state-space systems based on minimizing the cost function when there is a constant time delay (d) in the observation signal. The problem will be solved by converting the filtering problem to a usual d-step prediction problem for delay-free fractional systems.

Error analysis of multipoint flux domain decomposition methods for evolutionary diffusion problems

NASA Astrophysics Data System (ADS)

Arrarás, A.; Portero, L.; Yotov, I.

2014-01-01

We study space and time discretizations for mixed formulations of parabolic problems. The spatial approximation is based on the multipoint flux mixed finite element method, which reduces to an efficient cell-centered pressure system on general grids, including triangles, quadrilaterals, tetrahedra, and hexahedra. The time integration is performed by using a domain decomposition time-splitting technique combined with multiterm fractional step diagonally implicit Runge-Kutta methods. The resulting scheme is unconditionally stable and computationally efficient, as it reduces the global system to a collection of uncoupled subdomain problems that can be solved in parallel without the need for Schwarz-type iteration. Convergence analysis for both the semidiscrete and fully discrete schemes is presented.

A comparison of representations for discrete multi-criteria decision problems☆

PubMed Central

Gettinger, Johannes; Kiesling, Elmar; Stummer, Christian; Vetschera, Rudolf

2013-01-01

Discrete multi-criteria decision problems with numerous Pareto-efficient solution candidates place a significant cognitive burden on the decision maker. An interactive, aspiration-based search process that iteratively progresses toward the most preferred solution can alleviate this task. In this paper, we study three ways of representing such problems in a DSS, and compare them in a laboratory experiment using subjective and objective measures of the decision process as well as solution quality and problem understanding. In addition to an immediate user evaluation, we performed a re-evaluation several weeks later. Furthermore, we consider several levels of problem complexity and user characteristics. Results indicate that different problem representations have a considerable influence on search behavior, although long-term consistency appears to remain unaffected. We also found interesting discrepancies between subjective evaluations and objective measures. Conclusions from our experiments can help designers of DSS for large multi-criteria decision problems to fit problem representations to the goals of their system and the specific task at hand. PMID:24882912

Fractional discrete-time consensus models for single- and double-summator dynamics

NASA Astrophysics Data System (ADS)

Wyrwas, Małgorzata; Mozyrska, Dorota; Girejko, Ewa

2018-04-01

The leader-following consensus problem of fractional-order multi-agent discrete-time systems is considered. In the systems, interactions between opinions are defined like in Krause and Cucker-Smale models but the memory is included by taking the fractional-order discrete-time operator on the left-hand side of the nonlinear systems. In this paper, we investigate fractional-order models of opinions for the single- and double-summator dynamics of discrete-time by analytical methods as well as by computer simulations. The necessary and sufficient conditions for the leader-following consensus are formulated by proposing a consensus control law for tracking the virtual leader.

Satellite Remote Sensing of Tropical Precipitation and Ice Clouds for GCM Verification

NASA Technical Reports Server (NTRS)

Evans, K. Franklin

2001-01-01

This project, supported by the NASA New Investigator Program, has primarily been funding a graduate student, Darren McKague. Since August 1999 Darren has been working part time at Raytheon, while continuing his PhD research. Darren is planning to finish his thesis work in May 2001, thus some of the work described here is ongoing. The proposed research was to use GOES visible and infrared imager data and SSM/I microwave data to obtain joint distributions of cirrus cloud ice mass and precipitation for a study region in the Eastern Tropical Pacific. These joint distributions of cirrus cloud and rainfall were to be compared to those from the CSU general circulation model to evaluate the cloud microphysical amd cumulus parameterizations in the GCM. Existing algorithms were to be used for the retrieval of cloud ice water path from GOES (Minnis) and rainfall from SSM/I (Wilheit). A theoretical study using radiative transfer models and realistic variations in cloud and precipitation profiles was to be used to estimate the retrieval errors. Due to the unavailability of the GOES satellite cloud retrieval algorithm from Dr. Minnis (a co-PI), there was a change in the approach and emphasis of the project. The new approach was to develop a completely new type of remote sensing algorithm - one to directly retrieve joint probability density functions (pdf's) of cloud properties from multi-dimensional histograms of satellite radiances. The usual approach is to retrieve individual pixels of variables (i.e. cloud optical depth), and then aggregate the information. Only statistical information is actually needed, however, and so a more direct method is desirable. We developed forward radiative transfer models for the SSM/I and GOES channels, originally for testing the retrieval algorithms. The visible and near infrared ice scattering information is obtained from geometric ray tracing of fractal ice crystals (Andreas Macke), while the mid-infrared and microwave scattering is computed with Mie scattering. The radiative transfer is performed with the Spherical Harmonic Discrete Ordinate Method (developed by the PI), and infrared molecular absorption is included with the correlated k-distribution method. The SHDOM radiances have been validated by comparison to version 2 of DISORT (the community "standard" discrete-ordinates radiative transfer model), however we use SHDOM since it is computationally more efficient.

Global exponential stability of BAM neural networks with time-varying delays: The discrete-time case

NASA Astrophysics Data System (ADS)

Raja, R.; Marshal Anthoni, S.

2011-02-01

This paper deals with the problem of stability analysis for a class of discrete-time bidirectional associative memory (BAM) neural networks with time-varying delays. By employing the Lyapunov functional and linear matrix inequality (LMI) approach, a new sufficient conditions is proposed for the global exponential stability of discrete-time BAM neural networks. The proposed LMI based results can be easily checked by LMI control toolbox. Moreover, an example is also provided to demonstrate the effectiveness of the proposed method.

Urban Runoff: Model Ordinances for Erosion and Sediment Control

EPA Pesticide Factsheets

The model ordinance in this section borrows language from the erosion and sediment control ordinance features that might help prevent erosion and sedimentation and protect natural resources more fully.

(U) Second-Order Sensitivity Analysis of Uncollided Particle Contributions to Radiation Detector Responses Using Ray-Tracing

DOE Office of Scientific and Technical Information (OSTI.GOV)

Favorite, Jeffrey A.

The Second-Level Adjoint Sensitivity System (2nd-LASS) that yields the second-order sensitivities of a response of uncollided particles with respect to isotope densities, cross sections, and source emission rates is derived in Refs. 1 and 2. In Ref. 2, we solved problems for the uncollided leakage from a homogeneous sphere and a multiregion cylinder using the PARTISN multigroup discrete-ordinates code. In this memo, we derive solutions of the 2nd-LASS for the particular case when the response is a flux or partial current density computed at a single point on the boundary, and the inner products are computed using ray-tracing. Both themore » PARTISN approach and the ray-tracing approach are implemented in a computer code, SENSPG. The next section of this report presents the equations of the 1st- and 2nd-LASS for uncollided particles and the first- and second-order sensitivities that use the solutions of the 1st- and 2nd-LASS. Section III presents solutions of the 1st- and 2nd-LASS equations for the case of ray-tracing from a detector point. Section IV presents specific solutions of the 2nd-LASS and derives the ray-trace form of the inner products needed for second-order sensitivities. Numerical results for the total leakage from a homogeneous sphere are presented in Sec. V and for the leakage from one side of a two-region slab in Sec. VI. Section VII is a summary and conclusions.« less

Visible and near-infrared laser radiation in a biological tissue. A forward model for medical imaging by optical tomography.

PubMed

Trabelsi, H; Gantri, M; Sediki, E

2010-01-01

We present a numerical model for the study of a general, two-dimensional, time-dependent, laser radiation transfer problem in a biological tissue. The model is suitable for many situations, especially when the external laser source is pulsed or continuous. We used a control volume discrete-ordinate method associated with an implicit, three-level, second-order, time-differencing scheme. In medical imaging by laser techniques, this could be an optical tomography forward model. We considered a very thin rectangular biological tissue-like medium submitted to a visible or a near-infrared laser source. Different cases were treated numerically. The source was assumed to be monochromatic and collimated. We used either a continuous source or a short-pulsed source. The transmitted radiance was computed in detector points on the boundaries. Also, the distribution of the internal radiation intensity for different instants is presented. According to the source type, we examined either the steady-state response or the transient response of the medium. First, our model was validated by experimental results from the literature for a homogeneous biological tissue. The space and angular grid independency of our results is shown. Next, the proposed model was used to study changes in transmitted radiation for a homogeneous background medium in which were imbedded two heterogeneous objects. As a last investigation, we studied a multilayered biological tissue. We simulated near-infrared radiation in human skin, fat and muscle. Some results concerning the effects of fat thickness and positions of the detector source on the reflected radiation are presented.

Revised users manual, Pulverized Coal Gasification or Combustion: 2-dimensional (87-PCGC-2): Final report, Volume 2. [87-PCGC-2

DOE Office of Scientific and Technical Information (OSTI.GOV)

Smith, P.J.; Smoot, L.D.; Brewster, B.S.

1987-12-01

A two-dimensional, steady-state model for describing a variety of reactive and non-reactive flows, including pulverized coal combustion and gasification, is presented. Recent code revisions and additions are described. The model, referred to as 87-PCGC-2, is applicable to cylindrical axi-symmetric systems. Turbulence is accounted for in both the fluid mechanics equations and the combustion scheme. Radiation from gases, walls, and particles is taken into account using either a flux method or discrete ordinates method. The particle phase is modeled in a Lagrangian framework, such that mean paths of particle groups are followed. Several multi-step coal devolatilization schemes are included along withmore » a heterogeneous reaction scheme that allows for both diffusion and chemical reaction. Major gas-phase reactions are modeled assuming local instantaneous equilibrium, and thus the reaction rates are limited by the turbulent rate mixing. A NO/sub x/ finite rate chemistry submodel is included which integrates chemical kinetics and the statistics of the turbulence. The gas phase is described by elliptic partial differential equations that are solved by an iterative line-by-line technique. Under-relaxation is used to achieve numerical stability. The generalized nature of the model allows for calculation of isothermal fluid mechanicsgaseous combustion, droplet combustion, particulate combustion and various mixtures of the above, including combustion of coal-water and coal-oil slurries. Both combustion and gasification environments are permissible. User information and theory are presented, along with sample problems. 106 refs.« less

Sensitivity Equation Derivation for Transient Heat Transfer Problems

NASA Technical Reports Server (NTRS)

Hou, Gene; Chien, Ta-Cheng; Sheen, Jeenson

2004-01-01

The focus of the paper is on the derivation of sensitivity equations for transient heat transfer problems modeled by different discretization processes. Two examples will be used in this study to facilitate the discussion. The first example is a coupled, transient heat transfer problem that simulates the press molding process in fabrication of composite laminates. These state equations are discretized into standard h-version finite elements and solved by a multiple step, predictor-corrector scheme. The sensitivity analysis results based upon the direct and adjoint variable approaches will be presented. The second example is a nonlinear transient heat transfer problem solved by a p-version time-discontinuous Galerkin's Method. The resulting matrix equation of the state equation is simply in the form of Ax = b, representing a single step, time marching scheme. A direct differentiation approach will be used to compute the thermal sensitivities of a sample 2D problem.

On optimal control of linear systems in the presence of multiplicative noise

NASA Technical Reports Server (NTRS)

Joshi, S. M.

1976-01-01

This correspondence considers the problem of optimal regulator design for discrete time linear systems subjected to white state-dependent and control-dependent noise in addition to additive white noise in the input and the observations. A pseudo-deterministic problem is first defined in which multiplicative and additive input disturbances are present, but noise-free measurements of the complete state vector are available. This problem is solved via discrete dynamic programming. Next is formulated the problem in which the number of measurements is less than that of the state variables and the measurements are contaminated with state-dependent noise. The inseparability of control and estimation is brought into focus, and an 'enforced separation' solution is obtained via heuristic reasoning in which the control gains are shown to be the same as those in the pseudo-deterministic problem. An optimal linear state estimator is given in order to implement the controller.

Multidisciplinary Optimization of a Transport Aircraft Wing using Particle Swarm Optimization

NASA Technical Reports Server (NTRS)

Sobieszczanski-Sobieski, Jaroslaw; Venter, Gerhard

2002-01-01

The purpose of this paper is to demonstrate the application of particle swarm optimization to a realistic multidisciplinary optimization test problem. The paper's new contributions to multidisciplinary optimization is the application of a new algorithm for dealing with the unique challenges associated with multidisciplinary optimization problems, and recommendations as to the utility of the algorithm in future multidisciplinary optimization applications. The selected example is a bi-level optimization problem that demonstrates severe numerical noise and has a combination of continuous and truly discrete design variables. The use of traditional gradient-based optimization algorithms is thus not practical. The numerical results presented indicate that the particle swarm optimization algorithm is able to reliably find the optimum design for the problem presented here. The algorithm is capable of dealing with the unique challenges posed by multidisciplinary optimization as well as the numerical noise and truly discrete variables present in the current example problem.

Multilayer shallow water models with locally variable number of layers and semi-implicit time discretization

NASA Astrophysics Data System (ADS)

Bonaventura, Luca; Fernández-Nieto, Enrique D.; Garres-Díaz, José; Narbona-Reina, Gladys

2018-07-01

We propose an extension of the discretization approaches for multilayer shallow water models, aimed at making them more flexible and efficient for realistic applications to coastal flows. A novel discretization approach is proposed, in which the number of vertical layers and their distribution are allowed to change in different regions of the computational domain. Furthermore, semi-implicit schemes are employed for the time discretization, leading to a significant efficiency improvement for subcritical regimes. We show that, in the typical regimes in which the application of multilayer shallow water models is justified, the resulting discretization does not introduce any major spurious feature and allows again to reduce substantially the computational cost in areas with complex bathymetry. As an example of the potential of the proposed technique, an application to a sediment transport problem is presented, showing a remarkable improvement with respect to standard discretization approaches.

Convergence of discrete Aubry–Mather model in the continuous limit

NASA Astrophysics Data System (ADS)

Su, Xifeng; Thieullen, Philippe

2018-05-01

We develop two approximation schemes for solving the cell equation and the discounted cell equation using Aubry–Mather–Fathi theory. The Hamiltonian is supposed to be Tonelli, time-independent and periodic in space. By Legendre transform it is equivalent to find a fixed point of some nonlinear operator, called Lax-Oleinik operator, which may be discounted or not. By discretizing in time, we are led to solve an additive eigenvalue problem involving a discrete Lax–Oleinik operator. We show how to approximate the effective Hamiltonian and some weak KAM solutions by letting the time step in the discrete model tend to zero. We also obtain a selected discrete weak KAM solution as in Davini et al (2016 Invent. Math. 206 29–55), and show that it converges to a particular solution of the cell equation. In order to unify the two settings, continuous and discrete, we develop a more general formalism of the short-range interactions.

Weak Galerkin finite element methods for Darcy flow: Anisotropy and heterogeneity

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lin, Guang; Liu, Jiangguo; Mu, Lin

2014-11-01

This paper presents a family of weak Galerkin finite element methods (WGFEMs) for Darcy flow computation. The WGFEMs are new numerical methods that rely on the novel concept of discrete weak gradients. The WGFEMs solve for pressure unknowns both in element interiors and on the mesh skeleton. The numerical velocity is then obtained from the discrete weak gradient of the numerical pressure. The new methods are quite different than many existing numerical methods in that they are locally conservative by design, the resulting discrete linear systems are symmetric and positive-definite, and there is no need for tuning problem-dependent penalty factors.more » We test the WGFEMs on benchmark problems to demonstrate the strong potential of these new methods in handling strong anisotropy and heterogeneity in Darcy flow.« less

Excitation of Continuous and Discrete Modes in Incompressible Boundary Layers

NASA Technical Reports Server (NTRS)

Ashpis, David E.; Reshotko, Eli

1998-01-01

This report documents the full details of the condensed journal article by Ashpis & Reshotko (JFM, 1990) entitled "The Vibrating Ribbon Problem Revisited." A revised formal solution of the vibrating ribbon problem of hydrodynamic stability is presented. The initial formulation of Gaster (JFM, 1965) is modified by application of the Briggs method and a careful treatment of the complex double Fourier transform inversions. Expressions are obtained in a natural way for the discrete spectrum as well as for the four branches of the continuous spectra. These correspond to discrete and branch-cut singularities in the complex wave-number plane. The solutions from the continuous spectra decay both upstream and downstream of the ribbon, with the decay in the upstream direction being much more rapid than that in the downstream direction. Comments and clarification of related prior work are made.

Continuous analog of multiplicative algebraic reconstruction technique for computed tomography

NASA Astrophysics Data System (ADS)

Tateishi, Kiyoko; Yamaguchi, Yusaku; Abou Al-Ola, Omar M.; Kojima, Takeshi; Yoshinaga, Tetsuya

2016-03-01

We propose a hybrid dynamical system as a continuous analog to the block-iterative multiplicative algebraic reconstruction technique (BI-MART), which is a well-known iterative image reconstruction algorithm for computed tomography. The hybrid system is described by a switched nonlinear system with a piecewise smooth vector field or differential equation and, for consistent inverse problems, the convergence of non-negatively constrained solutions to a globally stable equilibrium is guaranteed by the Lyapunov theorem. Namely, we can prove theoretically that a weighted Kullback-Leibler divergence measure can be a common Lyapunov function for the switched system. We show that discretizing the differential equation by using the first-order approximation (Euler's method) based on the geometric multiplicative calculus leads to the same iterative formula of the BI-MART with the scaling parameter as a time-step of numerical discretization. The present paper is the first to reveal that a kind of iterative image reconstruction algorithm is constructed by the discretization of a continuous-time dynamical system for solving tomographic inverse problems. Iterative algorithms with not only the Euler method but also the Runge-Kutta methods of lower-orders applied for discretizing the continuous-time system can be used for image reconstruction. A numerical example showing the characteristics of the discretized iterative methods is presented.

Finite Volume Element (FVE) discretization and multilevel solution of the axisymmetric heat equation

NASA Astrophysics Data System (ADS)

Litaker, Eric T.

1994-12-01

The axisymmetric heat equation, resulting from a point-source of heat applied to a metal block, is solved numerically; both iterative and multilevel solutions are computed in order to compare the two processes. The continuum problem is discretized in two stages: finite differences are used to discretize the time derivatives, resulting is a fully implicit backward time-stepping scheme, and the Finite Volume Element (FVE) method is used to discretize the spatial derivatives. The application of the FVE method to a problem in cylindrical coordinates is new, and results in stencils which are analyzed extensively. Several iteration schemes are considered, including both Jacobi and Gauss-Seidel; a thorough analysis of these schemes is done, using both the spectral radii of the iteration matrices and local mode analysis. Using this discretization, a Gauss-Seidel relaxation scheme is used to solve the heat equation iteratively. A multilevel solution process is then constructed, including the development of intergrid transfer and coarse grid operators. Local mode analysis is performed on the components of the amplification matrix, resulting in the two-level convergence factors for various combinations of the operators. A multilevel solution process is implemented by using multigrid V-cycles; the iterative and multilevel results are compared and discussed in detail. The computational savings resulting from the multilevel process are then discussed.

The Physical Mechanism for Retinal Discrete Dark Noise: Thermal Activation or Cellular Ultraweak Photon Emission?

PubMed Central

Salari, Vahid; Scholkmann, Felix; Bokkon, Istvan; Shahbazi, Farhad; Tuszynski, Jack

2016-01-01

For several decades the physical mechanism underlying discrete dark noise of photoreceptors in the eye has remained highly controversial and poorly understood. It is known that the Arrhenius equation, which is based on the Boltzmann distribution for thermal activation, can model only a part (e.g. half of the activation energy) of the retinal dark noise experimentally observed for vertebrate rod and cone pigments. Using the Hinshelwood distribution instead of the Boltzmann distribution in the Arrhenius equation has been proposed as a solution to the problem. Here, we show that the using the Hinshelwood distribution does not solve the problem completely. As the discrete components of noise are indistinguishable in shape and duration from those produced by real photon induced photo-isomerization, the retinal discrete dark noise is most likely due to ‘internal photons’ inside cells and not due to thermal activation of visual pigments. Indeed, all living cells exhibit spontaneous ultraweak photon emission (UPE), mainly in the optical wavelength range, i.e., 350–700 nm. We show here that the retinal discrete dark noise has a similar rate as UPE and therefore dark noise is most likely due to spontaneous cellular UPE and not due to thermal activation. PMID:26950936

Accurate artificial boundary conditions for the semi-discretized linear Schrödinger and heat equations on rectangular domains

NASA Astrophysics Data System (ADS)

Ji, Songsong; Yang, Yibo; Pang, Gang; Antoine, Xavier

2018-01-01

The aim of this paper is to design some accurate artificial boundary conditions for the semi-discretized linear Schrödinger and heat equations in rectangular domains. The Laplace transform in time and discrete Fourier transform in space are applied to get Green's functions of the semi-discretized equations in unbounded domains with single-source. An algorithm is given to compute these Green's functions accurately through some recurrence relations. Furthermore, the finite-difference method is used to discretize the reduced problem with accurate boundary conditions. Numerical simulations are presented to illustrate the accuracy of our method in the case of the linear Schrödinger and heat equations. It is shown that the reflection at the corners is correctly eliminated.

On the ordinality of numbers: A review of neural and behavioral studies.

PubMed

Lyons, I M; Vogel, S E; Ansari, D

2016-01-01

The last several years have seen steady growth in research on the cognitive and neuronal mechanisms underlying how numbers are represented as part of ordered sequences. In the present review, we synthesize what is currently known about numerical ordinality from behavioral and neuroimaging research, point out major gaps in our current knowledge, and propose several hypotheses that may bear further investigation. Evidence suggests that how we process ordinality differs from how we process cardinality, but that this difference depends strongly on context-in particular, whether numbers are presented symbolically or nonsymbolically. Results also reveal many commonalities between numerical and nonnumerical ordinal processing; however, the degree to which numerical ordinality can be reduced to domain-general mechanisms remains unclear. One proposal is that numerical ordinality relies upon more general short-term memory mechanisms as well as more numerically specific long-term memory representations. It is also evident that numerical ordinality is highly multifaceted, with symbolic representations in particular allowing for a wide range of different types of ordinal relations, the complexity of which appears to increase over development. We examine the proposal that these relations may form the basis of a richer set of associations that may prove crucial to the emergence of more complex math abilities and concepts. In sum, ordinality appears to be an important and relatively understudied facet of numerical cognition that presents substantial opportunities for new and ground-breaking research. © 2016 Elsevier B.V. All rights reserved.

Numerical time-domain electromagnetics based on finite-difference and convolution

NASA Astrophysics Data System (ADS)

Lin, Yuanqu

Time-domain methods posses a number of advantages over their frequency-domain counterparts for the solution of wideband, nonlinear, and time varying electromagnetic scattering and radiation phenomenon. Time domain integral equation (TDIE)-based methods, which incorporate the beneficial properties of integral equation method, are thus well suited for solving broadband scattering problems for homogeneous scatterers. Widespread adoption of TDIE solvers has been retarded relative to other techniques by their inefficiency, inaccuracy and instability. Moreover, two-dimensional (2D) problems are especially problematic, because 2D Green's functions have infinite temporal support, exacerbating these difficulties. This thesis proposes a finite difference delay modeling (FDDM) scheme for the solution of the integral equations of 2D transient electromagnetic scattering problems. The method discretizes the integral equations temporally using first- and second-order finite differences to map Laplace-domain equations into the Z domain before transforming to the discrete time domain. The resulting procedure is unconditionally stable because of the nature of the Laplace- to Z-domain mapping. The first FDDM method developed in this thesis uses second-order Lagrange basis functions with Galerkin's method for spatial discretization. The second application of the FDDM method discretizes the space using a locally-corrected Nystrom method, which accelerates the precomputation phase and achieves high order accuracy. The Fast Fourier Transform (FFT) is applied to accelerate the marching-on-time process in both methods. While FDDM methods demonstrate impressive accuracy and stability in solving wideband scattering problems for homogeneous scatterers, they still have limitations in analyzing interactions between several inhomogenous scatterers. Therefore, this thesis devises a multi-region finite-difference time-domain (MR-FDTD) scheme based on domain-optimal Green's functions for solving sparsely-populated problems. The scheme uses a discrete Green's function (DGF) on the FDTD lattice to truncate the local subregions, and thus reduces reflection error on the local boundary. A continuous Green's function (CGF) is implemented to pass the influence of external fields into each FDTD region which mitigates the numerical dispersion and anisotropy of standard FDTD. Numerical results will illustrate the accuracy and stability of the proposed techniques.

Matching Extension and the Genus of a Graph,

DTIC Science & Technology

1986-04-01

genus and the cardinality of the maximum matchings of a graph, Discrete Math . 25, 1979, 149-156. oQORE 1967. The Four-Color Problem, Academic Press...Press, New York, 1969, 287-293. M D PLUMMER 1980. On n-extendable graphs, Discrete Math . 31, 1980, 201-210. 1985. A theorem on matchings in the plane

System for Automatic Generation of Examination Papers in Discrete Mathematics

ERIC Educational Resources Information Center

Fridenfalk, Mikael

2013-01-01

A system was developed for automatic generation of problems and solutions for examinations in a university distance course in discrete mathematics and tested in a pilot experiment involving 200 students. Considering the success of such systems in the past, particularly including automatic assessment, it should not take long before such systems are…

Applied Behavior Analysis: Beyond Discrete Trial Teaching

ERIC Educational Resources Information Center

Steege, Mark W.; Mace, F. Charles; Perry, Lora; Longenecker, Harold

2007-01-01

We discuss the problem of autism-specific special education programs representing themselves as Applied Behavior Analysis (ABA) programs when the only ABA intervention employed is Discrete Trial Teaching (DTT), and often for limited portions of the school day. Although DTT has many advantages to recommend its use, it is not well suited to teach…

Comparison of a discrete steepest ascent method with the continuous steepest ascent method for optimal programing

NASA Technical Reports Server (NTRS)

Childs, A. G.

1971-01-01

A discrete steepest ascent method which allows controls which are not piecewise constant (for example, it allows all continuous piecewise linear controls) was derived for the solution of optimal programming problems. This method is based on the continuous steepest ascent method of Bryson and Denham and new concepts introduced by Kelley and Denham in their development of compatible adjoints for taking into account the effects of numerical integration. The method is a generalization of the algorithm suggested by Canon, Cullum, and Polak with the details of the gradient computation given. The discrete method was compared with the continuous method for an aerodynamics problem for which an analytic solution is given by Pontryagin's maximum principle, and numerical results are presented. The discrete method converges more rapidly than the continuous method at first, but then for some undetermined reason, loses its exponential convergence rate. A comparsion was also made for the algorithm of Canon, Cullum, and Polak using piecewise constant controls. This algorithm is very competitive with the continuous algorithm.

Protein structure-structure alignment with discrete Fréchet distance.

PubMed

Jiang, Minghui; Xu, Ying; Zhu, Binhai

2008-02-01

Matching two geometric objects in two-dimensional (2D) and three-dimensional (3D) spaces is a central problem in computer vision, pattern recognition, and protein structure prediction. In particular, the problem of aligning two polygonal chains under translation and rotation to minimize their distance has been studied using various distance measures. It is well known that the Hausdorff distance is useful for matching two point sets, and that the Fréchet distance is a superior measure for matching two polygonal chains. The discrete Fréchet distance closely approximates the (continuous) Fréchet distance, and is a natural measure for the geometric similarity of the folded 3D structures of biomolecules such as proteins. In this paper, we present new algorithms for matching two polygonal chains in two dimensions to minimize their discrete Fréchet distance under translation and rotation, and an effective heuristic for matching two polygonal chains in three dimensions. We also describe our empirical results on the application of the discrete Fréchet distance to protein structure-structure alignment.

Measuring Human Performance on Clustering Problems: Some Potential Objective Criteria and Experimental Research Opportunities

ERIC Educational Resources Information Center

Brusco, Michael J.

2007-01-01

The study of human performance on discrete optimization problems has a considerable history that spans various disciplines. The two most widely studied problems are the Euclidean traveling salesperson problem and the quadratic assignment problem. The purpose of this paper is to outline a program of study for the measurement of human performance on…

Reduction from cost-sensitive ordinal ranking to weighted binary classification.

PubMed

Lin, Hsuan-Tien; Li, Ling

2012-05-01

We present a reduction framework from ordinal ranking to binary classification. The framework consists of three steps: extracting extended examples from the original examples, learning a binary classifier on the extended examples with any binary classification algorithm, and constructing a ranker from the binary classifier. Based on the framework, we show that a weighted 0/1 loss of the binary classifier upper-bounds the mislabeling cost of the ranker, both error-wise and regret-wise. Our framework allows not only the design of good ordinal ranking algorithms based on well-tuned binary classification approaches, but also the derivation of new generalization bounds for ordinal ranking from known bounds for binary classification. In addition, our framework unifies many existing ordinal ranking algorithms, such as perceptron ranking and support vector ordinal regression. When compared empirically on benchmark data sets, some of our newly designed algorithms enjoy advantages in terms of both training speed and generalization performance over existing algorithms. In addition, the newly designed algorithms lead to better cost-sensitive ordinal ranking performance, as well as improved listwise ranking performance.

Accurate interlaminar stress recovery from finite element analysis

NASA Technical Reports Server (NTRS)

Tessler, Alexander; Riggs, H. Ronald

1994-01-01

The accuracy and robustness of a two-dimensional smoothing methodology is examined for the problem of recovering accurate interlaminar shear stress distributions in laminated composite and sandwich plates. The smoothing methodology is based on a variational formulation which combines discrete least-squares and penalty-constraint functionals in a single variational form. The smoothing analysis utilizes optimal strains computed at discrete locations in a finite element analysis. These discrete strain data are smoothed with a smoothing element discretization, producing superior accuracy strains and their first gradients. The approach enables the resulting smooth strain field to be practically C1-continuous throughout the domain of smoothing, exhibiting superconvergent properties of the smoothed quantity. The continuous strain gradients are also obtained directly from the solution. The recovered strain gradients are subsequently employed in the integration o equilibrium equations to obtain accurate interlaminar shear stresses. The problem is a simply-supported rectangular plate under a doubly sinusoidal load. The problem has an exact analytic solution which serves as a measure of goodness of the recovered interlaminar shear stresses. The method has the versatility of being applicable to the analysis of rather general and complex structures built of distinct components and materials, such as found in aircraft design. For these types of structures, the smoothing is achieved with 'patches', each patch covering the domain in which the smoothed quantity is physically continuous.

Efficient Computation of Separation-Compliant Speed Advisories for Air Traffic Arriving in Terminal Airspace

NASA Technical Reports Server (NTRS)

Sadovsky, Alexander V.; Davis, Damek; Isaacson, Douglas R.

2012-01-01

A class of problems in air traffic management asks for a scheduling algorithm that supplies the air traffic services authority not only with a schedule of arrivals and departures, but also with speed advisories. Since advisories must be finite, a scheduling algorithm must ultimately produce a finite data set, hence must either start with a purely discrete model or involve a discretization of a continuous one. The former choice, often preferred for intuitive clarity, naturally leads to mixed-integer programs, hindering proofs of correctness and computational cost bounds (crucial for real-time operations). In this paper, a hybrid control system is used to model air traffic scheduling, capturing both the discrete and continuous aspects. This framework is applied to a class of problems, called the Fully Routed Nominal Problem. We prove a number of geometric results on feasible schedules and use these results to formulate an algorithm that attempts to compute a collective speed advisory, effectively finite, and has computational cost polynomial in the number of aircraft. This work is a first step toward optimization and models refined with more realistic detail.

Spectral Upscaling for Graph Laplacian Problems with Application to Reservoir Simulation

DOE PAGES

Barker, Andrew T.; Lee, Chak S.; Vassilevski, Panayot S.

2017-10-26

Here, we consider coarsening procedures for graph Laplacian problems written in a mixed saddle-point form. In that form, in addition to the original (vertex) degrees of freedom (dofs), we also have edge degrees of freedom. We extend previously developed aggregation-based coarsening procedures applied to both sets of dofs to now allow more than one coarse vertex dof per aggregate. Those dofs are selected as certain eigenvectors of local graph Laplacians associated with each aggregate. Additionally, we coarsen the edge dofs by using traces of the discrete gradients of the already constructed coarse vertex dofs. These traces are defined on themore » interface edges that connect any two adjacent aggregates. The overall procedure is a modification of the spectral upscaling procedure developed in for the mixed finite element discretization of diffusion type PDEs which has the important property of maintaining inf-sup stability on coarse levels and having provable approximation properties. We consider applications to partitioning a general graph and to a finite volume discretization interpreted as a graph Laplacian, developing consistent and accurate coarse-scale models of a fine-scale problem.« less

Coupled discrete element and finite volume solution of two classical soil mechanics problems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chen, Feng; Drumm, Eric; Guiochon, Georges A

One dimensional solutions for the classic critical upward seepage gradient/quick condition and the time rate of consolidation problems are obtained using coupled routines for the finite volume method (FVM) and discrete element method (DEM), and the results compared with the analytical solutions. The two phase flow in a system composed of fluid and solid is simulated with the fluid phase modeled by solving the averaged Navier-Stokes equation using the FVM and the solid phase is modeled using the DEM. A framework is described for the coupling of two open source computer codes: YADE-OpenDEM for the discrete element method and OpenFOAMmore » for the computational fluid dynamics. The particle-fluid interaction is quantified using a semi-empirical relationship proposed by Ergun [12]. The two classical verification problems are used to explore issues encountered when using coupled flow DEM codes, namely, the appropriate time step size for both the fluid and mechanical solution processes, the choice of the viscous damping coefficient, and the number of solid particles per finite fluid volume.« less

Iterative Region-of-Interest Reconstruction from Limited Data Using Prior Information

NASA Astrophysics Data System (ADS)

Vogelgesang, Jonas; Schorr, Christian

2017-12-01

In practice, computed tomography and computed laminography applications suffer from incomplete data. In particular, when inspecting large objects with extremely different diameters in longitudinal and transversal directions or when high resolution reconstructions are desired, the physical conditions of the scanning system lead to restricted data and truncated projections, also known as the interior or region-of-interest (ROI) problem. To recover the searched-for density function of the inspected object, we derive a semi-discrete model of the ROI problem that inherently allows the incorporation of geometrical prior information in an abstract Hilbert space setting for bounded linear operators. Assuming that the attenuation inside the object is approximately constant, as for fibre reinforced plastics parts or homogeneous objects where one is interested in locating defects like cracks or porosities, we apply the semi-discrete Landweber-Kaczmarz method to recover the inner structure of the object inside the ROI from the measured data resulting in a semi-discrete iteration method. Finally, numerical experiments for three-dimensional tomographic applications with both an inherent restricted source and ROI problem are provided to verify the proposed method for the ROI reconstruction.

Discontinuous finite volume element discretization for coupled flow-transport problems arising in models of sedimentation

NASA Astrophysics Data System (ADS)

Bürger, Raimund; Kumar, Sarvesh; Ruiz-Baier, Ricardo

2015-10-01

The sedimentation-consolidation and flow processes of a mixture of small particles dispersed in a viscous fluid at low Reynolds numbers can be described by a nonlinear transport equation for the solids concentration coupled with the Stokes problem written in terms of the mixture flow velocity and the pressure field. Here both the viscosity and the forcing term depend on the local solids concentration. A semi-discrete discontinuous finite volume element (DFVE) scheme is proposed for this model. The numerical method is constructed on a baseline finite element family of linear discontinuous elements for the approximation of velocity components and concentration field, whereas the pressure is approximated by piecewise constant elements. The unique solvability of both the nonlinear continuous problem and the semi-discrete DFVE scheme is discussed, and optimal convergence estimates in several spatial norms are derived. Properties of the model and the predicted space accuracy of the proposed formulation are illustrated by detailed numerical examples, including flows under gravity with changing direction, a secondary settling tank in an axisymmetric setting, and batch sedimentation in a tilted cylindrical vessel.

Genetic Algorithm for Traveling Salesman Problem with Modified Cycle Crossover Operator

PubMed Central

Mohamd Shoukry, Alaa; Gani, Showkat

2017-01-01

Genetic algorithms are evolutionary techniques used for optimization purposes according to survival of the fittest idea. These methods do not ensure optimal solutions; however, they give good approximation usually in time. The genetic algorithms are useful for NP-hard problems, especially the traveling salesman problem. The genetic algorithm depends on selection criteria, crossover, and mutation operators. To tackle the traveling salesman problem using genetic algorithms, there are various representations such as binary, path, adjacency, ordinal, and matrix representations. In this article, we propose a new crossover operator for traveling salesman problem to minimize the total distance. This approach has been linked with path representation, which is the most natural way to represent a legal tour. Computational results are also reported with some traditional path representation methods like partially mapped and order crossovers along with new cycle crossover operator for some benchmark TSPLIB instances and found improvements. PMID:29209364

Genetic Algorithm for Traveling Salesman Problem with Modified Cycle Crossover Operator.

PubMed

Hussain, Abid; Muhammad, Yousaf Shad; Nauman Sajid, M; Hussain, Ijaz; Mohamd Shoukry, Alaa; Gani, Showkat

2017-01-01

Genetic algorithms are evolutionary techniques used for optimization purposes according to survival of the fittest idea. These methods do not ensure optimal solutions; however, they give good approximation usually in time. The genetic algorithms are useful for NP-hard problems, especially the traveling salesman problem. The genetic algorithm depends on selection criteria, crossover, and mutation operators. To tackle the traveling salesman problem using genetic algorithms, there are various representations such as binary, path, adjacency, ordinal, and matrix representations. In this article, we propose a new crossover operator for traveling salesman problem to minimize the total distance. This approach has been linked with path representation, which is the most natural way to represent a legal tour. Computational results are also reported with some traditional path representation methods like partially mapped and order crossovers along with new cycle crossover operator for some benchmark TSPLIB instances and found improvements.

Local search heuristic for the discrete leader-follower problem with multiple follower objectives

NASA Astrophysics Data System (ADS)

Kochetov, Yury; Alekseeva, Ekaterina; Mezmaz, Mohand

2016-10-01

We study a discrete bilevel problem, called as well as leader-follower problem, with multiple objectives at the lower level. It is assumed that constraints at the upper level can include variables of both levels. For such ill-posed problem we define feasible and optimal solutions for pessimistic case. A central point of this work is a two stage method to get a feasible solution under the pessimistic case, given a leader decision. The target of the first stage is a follower solution that violates the leader constraints. The target of the second stage is a pessimistic feasible solution. Each stage calls a heuristic and a solver for a series of particular mixed integer programs. The method is integrated inside a local search based heuristic that is designed to find near-optimal leader solutions.

Nitsche’s Method For Helmholtz Problems with Embedded Interfaces

PubMed Central

Zou, Zilong; Aquino, Wilkins; Harari, Isaac

2016-01-01

SUMMARY In this work, we use Nitsche’s formulation to weakly enforce kinematic constraints at an embedded interface in Helmholtz problems. Allowing embedded interfaces in a mesh provides significant ease for discretization, especially when material interfaces have complex geometries. We provide analytical results that establish the well-posedness of Helmholtz variational problems and convergence of the corresponding finite element discretizations when Nitsche’s method is used to enforce kinematic constraints. As in the analysis of conventional Helmholtz problems, we show that the inf-sup constant remains positive provided that the Nitsche’s stabilization parameter is judiciously chosen. We then apply our formulation to several 2D plane-wave examples that confirm our analytical findings. Doing so, we demonstrate the asymptotic convergence of the proposed method and show that numerical results are in accordance with the theoretical analysis. PMID:28713177

Multigrid one shot methods for optimal control problems: Infinite dimensional control

NASA Technical Reports Server (NTRS)

Arian, Eyal; Taasan, Shlomo

1994-01-01

The multigrid one shot method for optimal control problems, governed by elliptic systems, is introduced for the infinite dimensional control space. ln this case, the control variable is a function whose discrete representation involves_an increasing number of variables with grid refinement. The minimization algorithm uses Lagrange multipliers to calculate sensitivity gradients. A preconditioned gradient descent algorithm is accelerated by a set of coarse grids. It optimizes for different scales in the representation of the control variable on different discretization levels. An analysis which reduces the problem to the boundary is introduced. It is used to approximate the two level asymptotic convergence rate, to determine the amplitude of the minimization steps, and the choice of a high pass filter to be used when necessary. The effectiveness of the method is demonstrated on a series of test problems. The new method enables the solutions of optimal control problems at the same cost of solving the corresponding analysis problems just a few times.

GAMBIT: A Parameterless Model-Based Evolutionary Algorithm for Mixed-Integer Problems.

PubMed

Sadowski, Krzysztof L; Thierens, Dirk; Bosman, Peter A N

2018-01-01

Learning and exploiting problem structure is one of the key challenges in optimization. This is especially important for black-box optimization (BBO) where prior structural knowledge of a problem is not available. Existing model-based Evolutionary Algorithms (EAs) are very efficient at learning structure in both the discrete, and in the continuous domain. In this article, discrete and continuous model-building mechanisms are integrated for the Mixed-Integer (MI) domain, comprising discrete and continuous variables. We revisit a recently introduced model-based evolutionary algorithm for the MI domain, the Genetic Algorithm for Model-Based mixed-Integer opTimization (GAMBIT). We extend GAMBIT with a parameterless scheme that allows for practical use of the algorithm without the need to explicitly specify any parameters. We furthermore contrast GAMBIT with other model-based alternatives. The ultimate goal of processing mixed dependences explicitly in GAMBIT is also addressed by introducing a new mechanism for the explicit exploitation of mixed dependences. We find that processing mixed dependences with this novel mechanism allows for more efficient optimization. We further contrast the parameterless GAMBIT with Mixed-Integer Evolution Strategies (MIES) and other state-of-the-art MI optimization algorithms from the General Algebraic Modeling System (GAMS) commercial algorithm suite on problems with and without constraints, and show that GAMBIT is capable of solving problems where variable dependences prevent many algorithms from successfully optimizing them.

Multivariate normal maximum likelihood with both ordinal and continuous variables, and data missing at random.

PubMed

Pritikin, Joshua N; Brick, Timothy R; Neale, Michael C

2018-04-01

A novel method for the maximum likelihood estimation of structural equation models (SEM) with both ordinal and continuous indicators is introduced using a flexible multivariate probit model for the ordinal indicators. A full information approach ensures unbiased estimates for data missing at random. Exceeding the capability of prior methods, up to 13 ordinal variables can be included before integration time increases beyond 1 s per row. The method relies on the axiom of conditional probability to split apart the distribution of continuous and ordinal variables. Due to the symmetry of the axiom, two similar methods are available. A simulation study provides evidence that the two similar approaches offer equal accuracy. A further simulation is used to develop a heuristic to automatically select the most computationally efficient approach. Joint ordinal continuous SEM is implemented in OpenMx, free and open-source software.