On the Critical Behaviour, Crossover Point and Complexity of the Exact Cover Problem
NASA Technical Reports Server (NTRS)
Morris, Robin D.; Smelyanskiy, Vadim N.; Shumow, Daniel; Koga, Dennis (Technical Monitor)
2003-01-01
Research into quantum algorithms for NP-complete problems has rekindled interest in the detailed study a broad class of combinatorial problems. A recent paper applied the quantum adiabatic evolution algorithm to the Exact Cover problem for 3-sets (EC3), and provided an empirical evidence that the algorithm was polynomial. In this paper we provide a detailed study of the characteristics of the exact cover problem. We present the annealing approximation applied to EC3, which gives an over-estimate of the phase transition point. We also identify empirically the phase transition point. We also study the complexity of two classical algorithms on this problem: Davis-Putnam and Simulated Annealing. For these algorithms, EC3 is significantly easier than 3-SAT.
Benchmark problems and solutions
NASA Technical Reports Server (NTRS)
Tam, Christopher K. W.
1995-01-01
The scientific committee, after careful consideration, adopted six categories of benchmark problems for the workshop. These problems do not cover all the important computational issues relevant to Computational Aeroacoustics (CAA). The deciding factor to limit the number of categories to six was the amount of effort needed to solve these problems. For reference purpose, the benchmark problems are provided here. They are followed by the exact or approximate analytical solutions. At present, an exact solution for the Category 6 problem is not available.
Spatial correlations and exact solution of the problem of the boson peak profile in amorphous media
NASA Astrophysics Data System (ADS)
Kirillov, Sviatoslav A.; A. Voyiatzis, George; Kolomiyets, Tatiana M.; H. Anastasiadis, Spiros
1999-11-01
Based on a model correlation function which covers spatial correlations from Gaussian to exponential, we have arrived at an exact analytic solution of the problem of the Boson peak profile in amorphous media. Probe fits made for polyisoprene and triacetin prove the working ability of the formulae obtained.
Ultrafast adiabatic quantum algorithm for the NP-complete exact cover problem
Wang, Hefeng; Wu, Lian-Ao
2016-01-01
An adiabatic quantum algorithm may lose quantumness such as quantum coherence entirely in its long runtime, and consequently the expected quantum speedup of the algorithm does not show up. Here we present a general ultrafast adiabatic quantum algorithm. We show that by applying a sequence of fast random or regular signals during evolution, the runtime can be reduced substantially, whereas advantages of the adiabatic algorithm remain intact. We also propose a randomized Trotter formula and show that the driving Hamiltonian and the proposed sequence of fast signals can be implemented simultaneously. We illustrate the algorithm by solving the NP-complete 3-bit exact cover problem (EC3), where NP stands for nondeterministic polynomial time, and put forward an approach to implementing the problem with trapped ions. PMID:26923834
NASA Astrophysics Data System (ADS)
Wei, Xiao-Ran; Zhang, Yu-He; Geng, Guo-Hua
2016-09-01
In this paper, we examined how printing the hollow objects without infill via fused deposition modeling, one of the most widely used 3D-printing technologies, by partitioning the objects to shell parts. More specifically, we linked the partition to the exact cover problem. Given an input watertight mesh shape S, we developed region growing schemes to derive a set of surfaces that had inside surfaces that were printable without support on the mesh for the candidate parts. We then employed Monte Carlo tree search over the candidate parts to obtain the optimal set cover. All possible candidate subsets of exact cover from the optimal set cover were then obtained and the bounded tree was used to search the optimal exact cover. We oriented each shell part to the optimal position to guarantee the inside surface was printed without support, while the outside surface was printed with minimum support. Our solution can be applied to a variety of models, closed-hollowed or semi-closed, with or without holes, as evidenced by experiments and performance evaluation on our proposed algorithm.
Mathematical modeling of a dynamic thin plate deformation in acoustoelasticity problems
NASA Astrophysics Data System (ADS)
Badriev, I. B.; Paimuhin, V. N.
2018-01-01
The coupled problem of planar acoustic wave propagation through a composite plate covered with a second damping layer with a large logarithmic decrement of oscillations is formulated. The aerohydrodynamic interaction of a plate with external acoustic environment is described by three-dimensional wave equations and the mechanical behavior of a two-layer plate by the classical Kirchhoff-Love model. An exact analytic solution of the problem is found for the case of hinged support of the edges of a plate. On the basis of this, the parameters of the covering damping layer were found, under which it is possible to achieve a practically complete damping of the plate vibration under resonant modes of its acoustic loading.
A combinatorial approach to the design of vaccines.
Martínez, Luis; Milanič, Martin; Legarreta, Leire; Medvedev, Paul; Malaina, Iker; de la Fuente, Ildefonso M
2015-05-01
We present two new problems of combinatorial optimization and discuss their applications to the computational design of vaccines. In the shortest λ-superstring problem, given a family S1,...,S(k) of strings over a finite alphabet, a set Τ of "target" strings over that alphabet, and an integer λ, the task is to find a string of minimum length containing, for each i, at least λ target strings as substrings of S(i). In the shortest λ-cover superstring problem, given a collection X1,...,X(n) of finite sets of strings over a finite alphabet and an integer λ, the task is to find a string of minimum length containing, for each i, at least λ elements of X(i) as substrings. The two problems are polynomially equivalent, and the shortest λ-cover superstring problem is a common generalization of two well known combinatorial optimization problems, the shortest common superstring problem and the set cover problem. We present two approaches to obtain exact or approximate solutions to the shortest λ-superstring and λ-cover superstring problems: one based on integer programming, and a hill-climbing algorithm. An application is given to the computational design of vaccines and the algorithms are applied to experimental data taken from patients infected by H5N1 and HIV-1.
NASA Astrophysics Data System (ADS)
Adem, Abdullahi Rashid; Moawad, Salah M.
2018-05-01
In this paper, the steady-state equations of ideal magnetohydrodynamic incompressible flows in axisymmetric domains are investigated. These flows are governed by a second-order elliptic partial differential equation as a type of generalized Grad-Shafranov equation. The problem of finding exact equilibria to the full governing equations in the presence of incompressible mass flows is considered. Two different types of constraints on position variables are presented to construct exact solution classes for several nonlinear cases of the governing equations. Some of the obtained results are checked for their applications to magnetic confinement plasma. Besides, they cover many previous configurations and include new considerations about the nonlinearity of magnetic flux stream variables.
Time-Accurate, Unstructured-Mesh Navier-Stokes Computations with the Space-Time CESE Method
NASA Technical Reports Server (NTRS)
Chang, Chau-Lyan
2006-01-01
Application of the newly emerged space-time conservation element solution element (CESE) method to compressible Navier-Stokes equations is studied. In contrast to Euler equations solvers, several issues such as boundary conditions, numerical dissipation, and grid stiffness warrant systematic investigations and validations. Non-reflecting boundary conditions applied at the truncated boundary are also investigated from the stand point of acoustic wave propagation. Validations of the numerical solutions are performed by comparing with exact solutions for steady-state as well as time-accurate viscous flow problems. The test cases cover a broad speed regime for problems ranging from acoustic wave propagation to 3D hypersonic configurations. Model problems pertinent to hypersonic configurations demonstrate the effectiveness of the CESE method in treating flows with shocks, unsteady waves, and separations. Good agreement with exact solutions suggests that the space-time CESE method provides a viable alternative for time-accurate Navier-Stokes calculations of a broad range of problems.
Statistical mechanics of the vertex-cover problem
NASA Astrophysics Data System (ADS)
Hartmann, Alexander K.; Weigt, Martin
2003-10-01
We review recent progress in the study of the vertex-cover problem (VC). The VC belongs to the class of NP-complete graph theoretical problems, which plays a central role in theoretical computer science. On ensembles of random graphs, VC exhibits a coverable-uncoverable phase transition. Very close to this transition, depending on the solution algorithm, easy-hard transitions in the typical running time of the algorithms occur. We explain a statistical mechanics approach, which works by mapping the VC to a hard-core lattice gas, and then applying techniques such as the replica trick or the cavity approach. Using these methods, the phase diagram of the VC could be obtained exactly for connectivities c < e, where the VC is replica symmetric. Recently, this result could be confirmed using traditional mathematical techniques. For c > e, the solution of the VC exhibits full replica symmetry breaking. The statistical mechanics approach can also be used to study analytically the typical running time of simple complete and incomplete algorithms for the VC. Finally, we describe recent results for the VC when studied on other ensembles of finite- and infinite-dimensional graphs.
Generic Entity Resolution in Relational Databases
NASA Astrophysics Data System (ADS)
Sidló, Csaba István
Entity Resolution (ER) covers the problem of identifying distinct representations of real-world entities in heterogeneous databases. We consider the generic formulation of ER problems (GER) with exact outcome. In practice, input data usually resides in relational databases and can grow to huge volumes. Yet, typical solutions described in the literature employ standalone memory resident algorithms. In this paper we utilize facilities of standard, unmodified relational database management systems (RDBMS) to enhance the efficiency of GER algorithms. We study and revise the problem formulation, and propose practical and efficient algorithms optimized for RDBMS external memory processing. We outline a real-world scenario and demonstrate the advantage of algorithms by performing experiments on insurance customer data.
The airport gate assignment problem: a survey.
Bouras, Abdelghani; Ghaleb, Mageed A; Suryahatmaja, Umar S; Salem, Ahmed M
2014-01-01
The airport gate assignment problem (AGAP) is one of the most important problems operations managers face daily. Many researches have been done to solve this problem and tackle its complexity. The objective of the task is assigning each flight (aircraft) to an available gate while maximizing both conveniences to passengers and the operational efficiency of airport. This objective requires a solution that provides the ability to change and update the gate assignment data on a real time basis. In this paper, we survey the state of the art of these problems and the various methods to obtain the solution. Our survey covers both theoretical and real AGAP with the description of mathematical formulations and resolution methods such as exact algorithms, heuristic algorithms, and metaheuristic algorithms. We also provide a research trend that can inspire researchers about new problems in this area.
The Airport Gate Assignment Problem: A Survey
Ghaleb, Mageed A.; Salem, Ahmed M.
2014-01-01
The airport gate assignment problem (AGAP) is one of the most important problems operations managers face daily. Many researches have been done to solve this problem and tackle its complexity. The objective of the task is assigning each flight (aircraft) to an available gate while maximizing both conveniences to passengers and the operational efficiency of airport. This objective requires a solution that provides the ability to change and update the gate assignment data on a real time basis. In this paper, we survey the state of the art of these problems and the various methods to obtain the solution. Our survey covers both theoretical and real AGAP with the description of mathematical formulations and resolution methods such as exact algorithms, heuristic algorithms, and metaheuristic algorithms. We also provide a research trend that can inspire researchers about new problems in this area. PMID:25506074
Hidden algebra method (quasi-exact-solvability in quantum mechanics)
DOE Office of Scientific and Technical Information (OSTI.GOV)
Turbiner, Alexander; Instituto de Ciencias Nucleares, Universidad Nacional Autonoma de Mexico, Apartado, Postal 70-543, 04510 Mexico, D. F.
1996-02-20
A general introduction to quasi-exactly-solvable problems of quantum mechanics is presented. Main attention is given to multidimensional quasi-exactly-solvable and exactly-solvable Schroedinger operators. Exact-solvability of the Calogero and Sutherland N-body problems ass ociated with an existence of the hidden algebra slN is discussed extensively.
NASA Technical Reports Server (NTRS)
Hildebrand, Francis B
1943-01-01
A mathematical procedure is herein developed for obtaining exact solutions of shear-lag problems in flat panels and box beams: the method is based on the assumption that the amount of stretching of the sheets in the direction perpendicular to the direction of essential normal stresses is negligible. Explicit solutions, including the treatment of cut-outs, are given for several cases and numerical results are presented in graphic and tabular form. The general theory is presented in a from which further solutions can be readily obtained. The extension of the theory to cover certain cases of non-uniform cross section is indicated. Although the solutions are obtained in terms of infinite series, the present developments differ from those previously given in that, in practical cases, the series usually converge so rapidly that sufficient accuracy is afforded by a small number of terms. Comparisons are made in several cases between the present results and the corresponding solutions obtained by approximate procedures devised by Reissner and by Kuhn and Chiarito.
A fast exact simulation method for a class of Markov jump processes.
Li, Yao; Hu, Lili
2015-11-14
A new method of the stochastic simulation algorithm (SSA), named the Hashing-Leaping method (HLM), for exact simulations of a class of Markov jump processes, is presented in this paper. The HLM has a conditional constant computational cost per event, which is independent of the number of exponential clocks in the Markov process. The main idea of the HLM is to repeatedly implement a hash-table-like bucket sort algorithm for all times of occurrence covered by a time step with length τ. This paper serves as an introduction to this new SSA method. We introduce the method, demonstrate its implementation, analyze its properties, and compare its performance with three other commonly used SSA methods in four examples. Our performance tests and CPU operation statistics show certain advantages of the HLM for large scale problems.
NASA Technical Reports Server (NTRS)
Jara-Almonte, J.; Mitchell, L. D.
1988-01-01
The paper covers two distinct parts: theory and application. The goal of this work was the reduction of model size with an increase in eigenvalue/vector accuracy. This method is ideal for the condensation of large truss- or beam-type structures. The theoretical approach involves the conversion of a continuum transfer matrix beam element into an 'Exact' dynamic stiffness element. This formulation is implemented in a finite element environment. This results in the need to solve a transcendental eigenvalue problem. Once the eigenvalue is determined the eigenvectors can be reconstructed with any desired spatial precision. No discretization limitations are imposed on the reconstruction. The results of such a combined finite element and transfer matrix formulation is a much smaller FEM eigenvalue problem. This formulation has the ability to extract higher eigenvalues as easily and as accurately as lower eigenvalues. Moreover, one can extract many more eigenvalues/vectors from the model than the number of degrees of freedom in the FEM formulation. Typically, the number of eigenvalues accurately extractable via the 'Exact' element method are at least 8 times the number of degrees of freedom. In contrast, the FEM usually extracts one accurate (within 5 percent) eigenvalue for each 3-4 degrees of freedom. The 'Exact' element results in a 20-30 improvement in the number of accurately extractable eigenvalues and eigenvectors.
Hidden algebra method (quasi-exact-solvability in quantum mechanics)
DOE Office of Scientific and Technical Information (OSTI.GOV)
Turbiner, A.
1996-02-01
A general introduction to quasi-exactly-solvable problems of quantum mechanics is presented. Main attention is given to multidimensional quasi-exactly-solvable and exactly-solvable Schroedinger operators. Exact-solvability of the Calogero and Sutherland {ital N}-body problems ass ociated with an existence of the hidden algebra {ital sl}{sub {ital N}} is discussed extensively. {copyright} {ital 1996 American Institute of Physics.}
A fast exact simulation method for a class of Markov jump processes
DOE Office of Scientific and Technical Information (OSTI.GOV)
Li, Yao, E-mail: yaoli@math.umass.edu; Hu, Lili, E-mail: lilyhu86@gmail.com
2015-11-14
A new method of the stochastic simulation algorithm (SSA), named the Hashing-Leaping method (HLM), for exact simulations of a class of Markov jump processes, is presented in this paper. The HLM has a conditional constant computational cost per event, which is independent of the number of exponential clocks in the Markov process. The main idea of the HLM is to repeatedly implement a hash-table-like bucket sort algorithm for all times of occurrence covered by a time step with length τ. This paper serves as an introduction to this new SSA method. We introduce the method, demonstrate its implementation, analyze itsmore » properties, and compare its performance with three other commonly used SSA methods in four examples. Our performance tests and CPU operation statistics show certain advantages of the HLM for large scale problems.« less
Exact image theory for the problem of dielectric/magnetic slab
NASA Technical Reports Server (NTRS)
Lindell, I. V.
1987-01-01
Exact image method, recently introduced for the exact solution of electromagnetic field problems involving homogeneous half spaces and microstrip-like geometries, is developed for the problem of homogeneous slab of dielectric and/or magnetic material in free space. Expressions for image sources, creating the exact reflected and transmitted fields, are given and their numerical evaluation is demonstrated. Nonradiating modes, guided by the slab and responsible for the loss of convergence of the image functions, are considered and extracted. The theory allows, for example, an analysis of finite ground planes in microstrip antenna structures.
Effects of spatial resolution and landscape structure on land cover characterization
NASA Astrophysics Data System (ADS)
Yang, Wenli
This dissertation addressed problems in scaling, problems that are among the main challenges in remote sensing. The principal objective of the research was to investigate the effects of changing spatial scale on the representation of land cover. A second objective was to determine the relationship between such effects, characteristics of landscape structure and scaling procedures. Four research issues related to spatial scaling were examined. They included: (1) the upscaling of Normalized Difference Vegetation Index (NDVI); (2) the effects of spatial scale on indices of landscape structure; (3) the representation of land cover databases at different spatial scales; and (4) the relationships between landscape indices and land cover area estimations. The overall bias resulting from non-linearity of NDVI in relation to spatial resolution is generally insignificant as compared to other factors such as influences of aerosols and water vapor. The bias is, however, related to land surface characteristics. Significant errors may be introduced in heterogeneous areas where different land cover types exhibit strong spectral contrast. Spatially upscaled SPOT and TM NDVIs have information content comparable with the AVHRR-derived NDVI. Indices of landscape structure and spatial resolution are generally related, but the exact forms of the relationships are subject to changes in other factors including the basic patch unit constituting a landscape and the proportional area of foreground land cover under consideration. The extent of agreement between spatially aggregated coarse resolution land cover datasets and full resolution datasets changes with the properties of the original datasets, including the pixel size and class definition. There are close relationships between landscape structure and class areas estimated from spatially aggregated land cover databases. The relationships, however, do not permit extension from one area to another. Inversion calibration across different geographic/ecological areas is, therefore, not feasible. Different rules govern the land cover area changes across resolutions when different upscaling methods are used. Special attention should be given to comparison between land cover maps derived using different methods.
Management: A continuing literature survey with indexes
NASA Technical Reports Server (NTRS)
1978-01-01
This bibliography lists 782 reports, articles, and other documents introduced into the NASA scientific and technical information system in 1977. The citations, and abstracts when available, are reproduced exactly as they appeared originally in IAA and STAR, including the original accession numbers from the respective announcement journals. Topics cover the management of research and development contracts, production, logistics, personnel, safety, reliability and quality control citations. Includes references on: program, project and systems management; management policy, philosophy, tools, and techniques; decisionmaking processes for managers; technology assessment; management of urban problems; and information for managers on Federal resources, expenditures, financing, and budgeting.
Unbiased Taxonomic Annotation of Metagenomic Samples
Fosso, Bruno; Pesole, Graziano; Rosselló, Francesc
2018-01-01
Abstract The classification of reads from a metagenomic sample using a reference taxonomy is usually based on first mapping the reads to the reference sequences and then classifying each read at a node under the lowest common ancestor of the candidate sequences in the reference taxonomy with the least classification error. However, this taxonomic annotation can be biased by an imbalanced taxonomy and also by the presence of multiple nodes in the taxonomy with the least classification error for a given read. In this article, we show that the Rand index is a better indicator of classification error than the often used area under the receiver operating characteristic (ROC) curve and F-measure for both balanced and imbalanced reference taxonomies, and we also address the second source of bias by reducing the taxonomic annotation problem for a whole metagenomic sample to a set cover problem, for which a logarithmic approximation can be obtained in linear time and an exact solution can be obtained by integer linear programming. Experimental results with a proof-of-concept implementation of the set cover approach to taxonomic annotation in a next release of the TANGO software show that the set cover approach further reduces ambiguity in the taxonomic annotation obtained with TANGO without distorting the relative abundance profile of the metagenomic sample. PMID:29028181
Huang, Lixi
2008-11-01
A spectral method of Chebyshev collocation with domain decomposition is introduced for linear interaction between sound and structure in a duct lined with flexible walls backed by cavities with or without a porous material. The spectral convergence is validated by a one-dimensional problem with a closed-form analytical solution, and is then extended to the two-dimensional configuration and compared favorably against a previous method based on the Fourier-Galerkin procedure and a finite element modeling. The nonlocal, exact Dirichlet-to-Neumann boundary condition is embedded in the domain decomposition scheme without imposing extra computational burden. The scheme is applied to the problem of high-frequency sound absorption by duct lining, which is normally ineffective when the wavelength is comparable with or shorter than the duct height. When a tensioned membrane covers the lining, however, it scatters the incident plane wave into higher-order modes, which then penetrate the duct lining more easily and get dissipated. For the frequency range of f=0.3-3 studied here, f=0.5 being the first cut-on frequency of the central duct, the membrane cover is found to offer an additional 0.9 dB attenuation per unit axial distance equal to half of the duct height.
Doebling, Scott William
2016-10-22
This paper documents the escape of high explosive (HE) products problem. The problem, first presented by Fickett & Rivard, tests the implementation and numerical behavior of a high explosive detonation and energy release model and its interaction with an associated compressible hydrodynamics simulation code. The problem simulates the detonation of a finite-length, one-dimensional piece of HE that is driven by a piston from one end and adjacent to a void at the other end. The HE equation of state is modeled as a polytropic ideal gas. The HE detonation is assumed to be instantaneous with an infinitesimal reaction zone. Viamore » judicious selection of the material specific heat ratio, the problem has an exact solution with linear characteristics, enabling a straightforward calculation of the physical variables as a function of time and space. Lastly, implementation of the exact solution in the Python code ExactPack is discussed, as are verification cases for the exact solution code.« less
DOE Office of Scientific and Technical Information (OSTI.GOV)
Singleton, Jr., Robert; Israel, Daniel M.; Doebling, Scott William
For code verification, one compares the code output against known exact solutions. There are many standard test problems used in this capacity, such as the Noh and Sedov problems. ExactPack is a utility that integrates many of these exact solution codes into a common API (application program interface), and can be used as a stand-alone code or as a python package. ExactPack consists of python driver scripts that access a library of exact solutions written in Fortran or Python. The spatial profiles of the relevant physical quantities, such as the density, fluid velocity, sound speed, or internal energy, are returnedmore » at a time specified by the user. The solution profiles can be viewed and examined by a command line interface or a graphical user interface, and a number of analysis tools and unit tests are also provided. We have documented the physics of each problem in the solution library, and provided complete documentation on how to extend the library to include additional exact solutions. ExactPack’s code architecture makes it easy to extend the solution-code library to include additional exact solutions in a robust, reliable, and maintainable manner.« less
Standardized Definitions for Code Verification Test Problems
DOE Office of Scientific and Technical Information (OSTI.GOV)
Doebling, Scott William
This document contains standardized definitions for several commonly used code verification test problems. These definitions are intended to contain sufficient information to set up the test problem in a computational physics code. These definitions are intended to be used in conjunction with exact solutions to these problems generated using Exact- Pack, www.github.com/lanl/exactpack.
Exact parallel algorithms for some members of the traveling salesman problem family
DOE Office of Scientific and Technical Information (OSTI.GOV)
Pekny, J.F.
1989-01-01
The traveling salesman problem and its many generalizations comprise one of the best known combinatorial optimization problem families. Most members of the family are NP-complete problems so that exact algorithms require an unpredictable and sometimes large computational effort. Parallel computers offer hope for providing the power required to meet these demands. A major barrier to applying parallel computers is the lack of parallel algorithms. The contributions presented in this thesis center around new exact parallel algorithms for the asymmetric traveling salesman problem (ATSP), prize collecting traveling salesman problem (PCTSP), and resource constrained traveling salesman problem (RCTSP). The RCTSP is amore » particularly difficult member of the family since finding a feasible solution is an NP-complete problem. An exact sequential algorithm is also presented for the directed hamiltonian cycle problem (DHCP). The DHCP algorithm is superior to current heuristic approaches and represents the first exact method applicable to large graphs. Computational results presented for each of the algorithms demonstrates the effectiveness of combining efficient algorithms with parallel computing methods. Performance statistics are reported for randomly generated ATSPs with 7,500 cities, PCTSPs with 200 cities, RCTSPs with 200 cities, DHCPs with 3,500 vertices, and assignment problems of size 10,000. Sequential results were collected on a Sun 4/260 engineering workstation, while parallel results were collected using a 14 and 100 processor BBN Butterfly Plus computer. The computational results represent the largest instances ever solved to optimality on any type of computer.« less
NASA Technical Reports Server (NTRS)
Williams, F. W.; Anderson, M. S.; Kennedy, D.; Butler, R.; Aston, G.
1990-01-01
A computer program which is designed for efficient, accurate buckling and vibration analysis and optimum design of composite panels is described. The capabilities of the program are given along with detailed user instructions. It is written in FORTRAN 77 and is operational on VAX, IBM, and CDC computers and should be readily adapted to others. Several illustrations of the various aspects of the input are given along the example problems illustrating the use and application of the program.
High dimensional land cover inference using remotely sensed modis data
NASA Astrophysics Data System (ADS)
Glanz, Hunter S.
Image segmentation persists as a major statistical problem, with the volume and complexity of data expanding alongside new technologies. Land cover classification, one of the most studied problems in Remote Sensing, provides an important example of image segmentation whose needs transcend the choice of a particular classification method. That is, the challenges associated with land cover classification pervade the analysis process from data pre-processing to estimation of a final land cover map. Many of the same challenges also plague the task of land cover change detection. Multispectral, multitemporal data with inherent spatial relationships have hardly received adequate treatment due to the large size of the data and the presence of missing values. In this work we propose a novel, concerted application of methods which provide a unified way to estimate model parameters, impute missing data, reduce dimensionality, classify land cover, and detect land cover changes. This comprehensive analysis adopts a Bayesian approach which incorporates prior knowledge to improve the interpretability, efficiency, and versatility of land cover classification and change detection. We explore a parsimonious, parametric model that allows for a natural application of principal components analysis to isolate important spectral characteristics while preserving temporal information. Moreover, it allows us to impute missing data and estimate parameters via expectation-maximization (EM). A significant byproduct of our framework includes a suite of training data assessment tools. To classify land cover, we employ a spanning tree approximation to a lattice Potts prior to incorporate spatial relationships in a judicious way and more efficiently access the posterior distribution of pixel labels. We then achieve exact inference of the labels via the centroid estimator. To detect land cover changes, we develop a new EM algorithm based on the same parametric model. We perform simulation studies to validate our models and methods, and conduct an extensive continental scale case study using MODIS data. The results show that we successfully classify land cover and recover the spatial patterns present in large scale data. Application of our change point method to an area in the Amazon successfully identifies the progression of deforestation through portions of the region.
NASA Astrophysics Data System (ADS)
Mandrà, Salvatore; Giacomo Guerreschi, Gian; Aspuru-Guzik, Alán
2016-07-01
We present an exact quantum algorithm for solving the Exact Satisfiability problem, which belongs to the important NP-complete complexity class. The algorithm is based on an intuitive approach that can be divided into two parts: the first step consists in the identification and efficient characterization of a restricted subspace that contains all the valid assignments of the Exact Satisfiability; while the second part performs a quantum search in such restricted subspace. The quantum algorithm can be used either to find a valid assignment (or to certify that no solution exists) or to count the total number of valid assignments. The query complexities for the worst-case are respectively bounded by O(\\sqrt{{2}n-{M\\prime }}) and O({2}n-{M\\prime }), where n is the number of variables and {M}\\prime the number of linearly independent clauses. Remarkably, the proposed quantum algorithm results to be faster than any known exact classical algorithm to solve dense formulas of Exact Satisfiability. As a concrete application, we provide the worst-case complexity for the Hamiltonian cycle problem obtained after mapping it to a suitable Occupation problem. Specifically, we show that the time complexity for the proposed quantum algorithm is bounded by O({2}n/4) for 3-regular undirected graphs, where n is the number of nodes. The same worst-case complexity holds for (3,3)-regular bipartite graphs. As a reference, the current best classical algorithm has a (worst-case) running time bounded by O({2}31n/96). Finally, when compared to heuristic techniques for Exact Satisfiability problems, the proposed quantum algorithm is faster than the classical WalkSAT and Adiabatic Quantum Optimization for random instances with a density of constraints close to the satisfiability threshold, the regime in which instances are typically the hardest to solve. The proposed quantum algorithm can be straightforwardly extended to the generalized version of the Exact Satisfiability known as Occupation problem. The general version of the algorithm is presented and analyzed.
A set-covering based heuristic algorithm for the periodic vehicle routing problem.
Cacchiani, V; Hemmelmayr, V C; Tricoire, F
2014-01-30
We present a hybrid optimization algorithm for mixed-integer linear programming, embedding both heuristic and exact components. In order to validate it we use the periodic vehicle routing problem (PVRP) as a case study. This problem consists of determining a set of minimum cost routes for each day of a given planning horizon, with the constraints that each customer must be visited a required number of times (chosen among a set of valid day combinations), must receive every time the required quantity of product, and that the number of routes per day (each respecting the capacity of the vehicle) does not exceed the total number of available vehicles. This is a generalization of the well-known vehicle routing problem (VRP). Our algorithm is based on the linear programming (LP) relaxation of a set-covering-like integer linear programming formulation of the problem, with additional constraints. The LP-relaxation is solved by column generation, where columns are generated heuristically by an iterated local search algorithm. The whole solution method takes advantage of the LP-solution and applies techniques of fixing and releasing of the columns as a local search, making use of a tabu list to avoid cycling. We show the results of the proposed algorithm on benchmark instances from the literature and compare them to the state-of-the-art algorithms, showing the effectiveness of our approach in producing good quality solutions. In addition, we report the results on realistic instances of the PVRP introduced in Pacheco et al. (2011) [24] and on benchmark instances of the periodic traveling salesman problem (PTSP), showing the efficacy of the proposed algorithm on these as well. Finally, we report the new best known solutions found for all the tested problems.
A set-covering based heuristic algorithm for the periodic vehicle routing problem
Cacchiani, V.; Hemmelmayr, V.C.; Tricoire, F.
2014-01-01
We present a hybrid optimization algorithm for mixed-integer linear programming, embedding both heuristic and exact components. In order to validate it we use the periodic vehicle routing problem (PVRP) as a case study. This problem consists of determining a set of minimum cost routes for each day of a given planning horizon, with the constraints that each customer must be visited a required number of times (chosen among a set of valid day combinations), must receive every time the required quantity of product, and that the number of routes per day (each respecting the capacity of the vehicle) does not exceed the total number of available vehicles. This is a generalization of the well-known vehicle routing problem (VRP). Our algorithm is based on the linear programming (LP) relaxation of a set-covering-like integer linear programming formulation of the problem, with additional constraints. The LP-relaxation is solved by column generation, where columns are generated heuristically by an iterated local search algorithm. The whole solution method takes advantage of the LP-solution and applies techniques of fixing and releasing of the columns as a local search, making use of a tabu list to avoid cycling. We show the results of the proposed algorithm on benchmark instances from the literature and compare them to the state-of-the-art algorithms, showing the effectiveness of our approach in producing good quality solutions. In addition, we report the results on realistic instances of the PVRP introduced in Pacheco et al. (2011) [24] and on benchmark instances of the periodic traveling salesman problem (PTSP), showing the efficacy of the proposed algorithm on these as well. Finally, we report the new best known solutions found for all the tested problems. PMID:24748696
DOE Office of Scientific and Technical Information (OSTI.GOV)
Doebling, Scott William
This paper documents the escape of high explosive (HE) products problem. The problem, first presented by Fickett & Rivard, tests the implementation and numerical behavior of a high explosive detonation and energy release model and its interaction with an associated compressible hydrodynamics simulation code. The problem simulates the detonation of a finite-length, one-dimensional piece of HE that is driven by a piston from one end and adjacent to a void at the other end. The HE equation of state is modeled as a polytropic ideal gas. The HE detonation is assumed to be instantaneous with an infinitesimal reaction zone. Viamore » judicious selection of the material specific heat ratio, the problem has an exact solution with linear characteristics, enabling a straightforward calculation of the physical variables as a function of time and space. Lastly, implementation of the exact solution in the Python code ExactPack is discussed, as are verification cases for the exact solution code.« less
An entropy maximization problem related to optical communication
NASA Technical Reports Server (NTRS)
Mceliece, R. J.; Rodemich, E. R.; Swanson, L.
1986-01-01
In relation to a problem in optical communication, the paper considers the general problem of maximizing the entropy of a stationary radom process that is subject to an average transition cost constraint. By using a recent result of Justesen and Hoholdt, an exact solution to the problem is presented and a class of finite state encoders that give a good approximation to the exact solution is suggested.
Exact Magnetic Diffusion Solutions for Magnetohydrodynamic Code Verification
DOE Office of Scientific and Technical Information (OSTI.GOV)
Miller, D S
In this paper, the authors present several new exact analytic space and time dependent solutions to the problem of magnetic diffusion in R-Z geometry. These problems serve to verify several different elements of an MHD implementation: magnetic diffusion, external circuit time integration, current and voltage energy sources, spatially dependent conductivities, and ohmic heating. The exact solutions are shown in comparison with 2D simulation results from the Ares code.
Reconciliation of Gene and Species Trees
Rusin, L. Y.; Lyubetskaya, E. V.; Gorbunov, K. Y.; Lyubetsky, V. A.
2014-01-01
The first part of the paper briefly overviews the problem of gene and species trees reconciliation with the focus on defining and algorithmic construction of the evolutionary scenario. Basic ideas are discussed for the aspects of mapping definitions, costs of the mapping and evolutionary scenario, imposing time scales on a scenario, incorporating horizontal gene transfers, binarization and reconciliation of polytomous trees, and construction of species trees and scenarios. The review does not intend to cover the vast diversity of literature published on these subjects. Instead, the authors strived to overview the problem of the evolutionary scenario as a central concept in many areas of evolutionary research. The second part provides detailed mathematical proofs for the solutions of two problems: (i) inferring a gene evolution along a species tree accounting for various types of evolutionary events and (ii) trees reconciliation into a single species tree when only gene duplications and losses are allowed. All proposed algorithms have a cubic time complexity and are mathematically proved to find exact solutions. Solving algorithms for problem (ii) can be naturally extended to incorporate horizontal transfers, other evolutionary events, and time scales on the species tree. PMID:24800245
Layeni, Olawanle P; Akinola, Adegbola P; Johnson, Jesse V
2016-01-01
Two distinct and novel formalisms for deriving exact closed solutions of a class of variable-coefficient differential-difference equations arising from a plate solidification problem are introduced. Thereupon, exact closed traveling wave and similarity solutions to the plate solidification problem are obtained for some special cases of time-varying plate surface temperature.
Riemann-Hilbert technique scattering analysis of metamaterial-based asymmetric 2D open resonators
NASA Astrophysics Data System (ADS)
Kamiński, Piotr M.; Ziolkowski, Richard W.; Arslanagić, Samel
2017-12-01
The scattering properties of metamaterial-based asymmetric two-dimensional open resonators excited by an electric line source are investigated analytically. The resonators are, in general, composed of two infinite and concentric cylindrical layers covered with an infinitely thin, perfect conducting shell that has an infinite axial aperture. The line source is oriented parallel to the cylinder axis. An exact analytical solution of this problem is derived. It is based on the dual-series approach and its transformation to the equivalent Riemann-Hilbert problem. Asymmetric metamaterial-based configurations are found to lead simultaneously to large enhancements of the radiated power and to highly steerable Huygens-like directivity patterns; properties not attainable with the corresponding structurally symmetric resonators. The presented open resonator designs are thus interesting candidates for many scientific and engineering applications where enhanced directional near- and far-field responses, tailored with beam shaping and steering capabilities, are highly desired.
Breeding protocol for the sand fly Nyssomyia neivai (Diptera: Psychodidae) in laboratory conditions.
Goulart, Thais Marchi; da Rocha Silva, Flávia Benini; Machado, Vicente Estevam; Oliveira, Wanderson Henrique Cruz; de Castro, Camila Feitosa; Rodrigues, Marili Villa Nova; Pinto, Mara Cristina
2017-10-01
The information in this protocol covers from the basic steps and material necessary to start a sand fly colony up to the specific details which are important to the success of a Nyssomyia neivai colony. The greatest problems in our colony of Ny. neivai were solved with specific care, for instance, using vermiculite and an adequate number of adults in oviposition containers; the control of fungus with the exact amount of diet for the larvae and humidity control; a second blood meal for females and control of the number of times animals are used for blood meals. Currently, our colony is at F22 generation. Copyright © 2017 Elsevier B.V. All rights reserved.
Solving Integer Programs from Dependence and Synchronization Problems
1993-03-01
DEFF.NSNE Solving Integer Programs from Dependence and Synchronization Problems Jaspal Subhlok March 1993 CMU-CS-93-130 School of Computer ScienceT IC...method Is an exact and efficient way of solving integer programming problems arising in dependence and synchronization analysis of parallel programs...7/;- p Keywords: Exact dependence tesing, integer programming. parallelilzng compilers, parallel program analysis, synchronization analysis Solving
Exact solution of large asymmetric traveling salesman problems.
Miller, D L; Pekny, J F
1991-02-15
The traveling salesman problem is one of a class of difficult problems in combinatorial optimization that is representative of a large number of important scientific and engineering problems. A survey is given of recent applications and methods for solving large problems. In addition, an algorithm for the exact solution of the asymmetric traveling salesman problem is presented along with computational results for several classes of problems. The results show that the algorithm performs remarkably well for some classes of problems, determining an optimal solution even for problems with large numbers of cities, yet for other classes, even small problems thwart determination of a provably optimal solution.
Exact analytical solution of a classical Josephson tunnel junction problem
NASA Astrophysics Data System (ADS)
Kuplevakhsky, S. V.; Glukhov, A. M.
2010-10-01
We give an exact and complete analytical solution of the classical problem of a Josephson tunnel junction of arbitrary length W ɛ(0,∞) in the presence of external magnetic fields and transport currents. Contrary to a wide-spread belief, the exact analytical solution unambiguously proves that there is no qualitative difference between so-called "small" (W≪1) and "large" junctions (W≫1). Another unexpected physical implication of the exact analytical solution is the existence (in the current-carrying state) of unquantized Josephson vortices carrying fractional flux and located near one of the edges of the junction. We also refine the mathematical definition of critical transport current.
Nonlinear Multidimensional Assignment Problems Efficient Conic Optimization Methods and Applications
2015-06-24
WORK UNIT NUMBER 7. PERFORMING ORGANIZATION NAME(S) AND ADDRESS(ES) Arizona State University School of Mathematical & Statistical Sciences 901 S...SUPPLEMENTARY NOTES 14. ABSTRACT The major goals of this project were completed: the exact solution of previously unsolved challenging combinatorial optimization... combinatorial optimization problem, the Directional Sensor Problem, was solved in two ways. First, heuristically in an engineering fashion and second, exactly
Exact solutions for species tree inference from discordant gene trees.
Chang, Wen-Chieh; Górecki, Paweł; Eulenstein, Oliver
2013-10-01
Phylogenetic analysis has to overcome the grant challenge of inferring accurate species trees from evolutionary histories of gene families (gene trees) that are discordant with the species tree along whose branches they have evolved. Two well studied approaches to cope with this challenge are to solve either biologically informed gene tree parsimony (GTP) problems under gene duplication, gene loss, and deep coalescence, or the classic RF supertree problem that does not rely on any biological model. Despite the potential of these problems to infer credible species trees, they are NP-hard. Therefore, these problems are addressed by heuristics that typically lack any provable accuracy and precision. We describe fast dynamic programming algorithms that solve the GTP problems and the RF supertree problem exactly, and demonstrate that our algorithms can solve instances with data sets consisting of as many as 22 taxa. Extensions of our algorithms can also report the number of all optimal species trees, as well as the trees themselves. To better asses the quality of the resulting species trees that best fit the given gene trees, we also compute the worst case species trees, their numbers, and optimization score for each of the computational problems. Finally, we demonstrate the performance of our exact algorithms using empirical and simulated data sets, and analyze the quality of heuristic solutions for the studied problems by contrasting them with our exact solutions.
NASA Technical Reports Server (NTRS)
Chiu, Y. T.; Hilton, H. H.
1977-01-01
Exact closed-form solutions to the solar force-free magnetic-field boundary-value problem are obtained for constant alpha in Cartesian geometry by a Green's function approach. The uniqueness of the physical problem is discussed. Application of the exact results to practical solar magnetic-field calculations is free of series truncation errors and is at least as economical as the approximate methods currently in use. Results of some test cases are presented.
Exact solution for spin precession in the radiationless relativistic Kepler problem
NASA Astrophysics Data System (ADS)
Mane, S. R.
2014-11-01
There is interest in circulating beams of polarized particles in all-electric storage rings to search for nonzero permanent electric dipole moments of subatomic particles. To this end, it is helpful to derive exact analytical solutions of the spin precession in idealized models, both for pedagogical reasons and to serve as benchmark tests for analysis and design of experiments. This paper derives exact solutions for the spin precession in the relativistic Kepler problem. Some counterintuitive properties of the solutions are pointed out.
ERIC Educational Resources Information Center
Fulcher, Lewis P.
1979-01-01
Presents an exact solution to the nonlinear Faraday's law problem of a rod sliding on frictionless rails with resistance. Compares the results with perturbation calculations based on the methods of Poisson and Pincare and of Kryloff and Bogoliuboff. (Author/GA)
Huang, Yi Ting; Spelke, Elizabeth; Snedeker, Jesse
2014-01-01
Number words are generally used to refer to the exact cardinal value of a set, but cognitive scientists disagree about their meanings. Although most psychological analyses presuppose that numbers have exact semantics (two means EXACTLY TWO), many linguistic accounts propose that numbers have lower-bounded semantics (AT LEAST TWO), and that speakers restrict their reference through a pragmatic inference (scalar implicature). We address this debate through studies of children who are in the process of acquiring the meanings of numbers. Adults and 2- and 3-year-olds were tested in a novel paradigm that teases apart semantic and pragmatic aspects of interpretation (the covered box task). Our findings establish that when scalar implicatures are cancelled in the critical trials of this task, both adults and children consistently give exact interpretations for number words. These results, in concert with recent work on real-time processing, provide the first unambiguous evidence that number words have exact semantics. PMID:25285053
Configuring Airspace Sectors with Approximate Dynamic Programming
NASA Technical Reports Server (NTRS)
Bloem, Michael; Gupta, Pramod
2010-01-01
In response to changing traffic and staffing conditions, supervisors dynamically configure airspace sectors by assigning them to control positions. A finite horizon airspace sector configuration problem models this supervisor decision. The problem is to select an airspace configuration at each time step while considering a workload cost, a reconfiguration cost, and a constraint on the number of control positions at each time step. Three algorithms for this problem are proposed and evaluated: a myopic heuristic, an exact dynamic programming algorithm, and a rollouts approximate dynamic programming algorithm. On problem instances from current operations with only dozens of possible configurations, an exact dynamic programming solution gives the optimal cost value. The rollouts algorithm achieves costs within 2% of optimal for these instances, on average. For larger problem instances that are representative of future operations and have thousands of possible configurations, excessive computation time prohibits the use of exact dynamic programming. On such problem instances, the rollouts algorithm reduces the cost achieved by the heuristic by more than 15% on average with an acceptable computation time.
NASA Astrophysics Data System (ADS)
Chanthawara, Krittidej; Kaennakham, Sayan; Toutip, Wattana
2016-02-01
The methodology of Dual Reciprocity Boundary Element Method (DRBEM) is applied to the convection-diffusion problems and investigating its performance is our first objective of the work. Seven types of Radial Basis Functions (RBF); Linear, Thin-plate Spline, Cubic, Compactly Supported, Inverse Multiquadric, Quadratic, and that proposed by [12], were closely investigated in order to numerically compare their effectiveness drawbacks etc. and this is taken as our second objective. A sufficient number of simulations were performed covering as many aspects as possible. Varidated against both exacts and other numerical works, the final results imply strongly that the Thin-Plate Spline and Linear type of RBF are superior to others in terms of both solutions' quality and CPU-time spent while the Inverse Multiquadric seems to poorly yield the results. It is also found that DRBEM can perform relatively well at moderate level of convective force and as anticipated becomes unstable when the problem becomes more convective-dominated, as normally found in all classical mesh-dependence methods.
Anemia in children: prevalence, causes, diagnostic work-up, and long-term consequences.
Allali, Slimane; Brousse, Valentine; Sacri, Anne-Sylvia; Chalumeau, Martin; de Montalembert, Mariane
2017-11-01
Anemia in children is a major public health problem throughout the world. It is often multifactorial, iron deficiency being the most frequent etiology. Consequences are diverse and largely under evaluated. Areas covered: This paper briefly reviews the main causes and focus on the potential consequences of acute and chronic anemia in children. Expert commentary: Anemia in children should never be trivialized. Even if iron deficiency is frequently involved, other potentially life-threatening causes are possible and should be looked for. The exact contribution of anemia to child mortality and morbidity is difficult to assess because of overlapping comorbidities. Chronic anemia may impair growth, cardiac function and cognitive development in infants but other consequences are rather poorly described and should be explored more thoroughly.
A spectral dynamic stiffness method for free vibration analysis of plane elastodynamic problems
NASA Astrophysics Data System (ADS)
Liu, X.; Banerjee, J. R.
2017-03-01
A highly efficient and accurate analytical spectral dynamic stiffness (SDS) method for modal analysis of plane elastodynamic problems based on both plane stress and plane strain assumptions is presented in this paper. First, the general solution satisfying the governing differential equation exactly is derived by applying two types of one-dimensional modified Fourier series. Then the SDS matrix for an element is formulated symbolically using the general solution. The SDS matrices are assembled directly in a similar way to that of the finite element method, demonstrating the method's capability to model complex structures. Any arbitrary boundary conditions are represented accurately in the form of the modified Fourier series. The Wittrick-Williams algorithm is then used as the solution technique where the mode count problem (J0) of a fully-clamped element is resolved. The proposed method gives highly accurate solutions with remarkable computational efficiency, covering low, medium and high frequency ranges. The method is applied to both plane stress and plane strain problems with simple as well as complex geometries. All results from the theory in this paper are accurate up to the last figures quoted to serve as benchmarks.
The Two-Capacitor Problem Revisited: A Mechanical Harmonic Oscillator Model Approach
ERIC Educational Resources Information Center
Lee, Keeyung
2009-01-01
The well-known two-capacitor problem, in which exactly half the stored energy disappears when a charged capacitor is connected to an identical capacitor, is discussed based on the mechanical harmonic oscillator model approach. In the mechanical harmonic oscillator model, it is shown first that "exactly half" the work done by a constant applied…
An Exact Solution to the Draining Reservoir Problem of the Incompressible and Non-Viscous Liquid
ERIC Educational Resources Information Center
Hong, Seok-In
2009-01-01
The exact expressions for the drain time and the height, velocity and acceleration of the free surface are found for the draining reservoir problem of the incompressible and non-viscous liquid. Contrary to the conventional approximate results, they correctly describe the initial time dependence of the liquid velocity and acceleration. Torricelli's…
Exact Solutions to Time-dependent Mdps
NASA Technical Reports Server (NTRS)
Boyan, Justin A.; Littman, Michael L.
2000-01-01
We describe an extension of the Markov decision process model in which a continuous time dimension is included in the state space. This allows for the representation and exact solution of a wide range of problems in which transitions or rewards vary over time. We examine problems based on route planning with public transportation and telescope observation scheduling.
Exact Analytical Solutions for Elastodynamic Impact
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
Exact Electromagnetic Fields Produced by a Finite Wire with Constant Current
ERIC Educational Resources Information Center
Jimenez, J. L.; Campos, I.; Aquino, N.
2008-01-01
We solve exactly the problem of calculating the electromagnetic fields produced by a finite wire with a constant current, by using two methods: retarded potentials and Jefimenko's formalism. One result in this particular case is that the usual Biot-Savart law of magnetostatics gives the correct magnetic field of the problem. We also show…
Analysis of the single-vehicle cyclic inventory routing problem
NASA Astrophysics Data System (ADS)
Aghezzaf, El-Houssaine; Zhong, Yiqing; Raa, Birger; Mateo, Manel
2012-11-01
The single-vehicle cyclic inventory routing problem (SV-CIRP) consists of a repetitive distribution of a product from a single depot to a selected subset of customers. For each customer, selected for replenishments, the supplier collects a corresponding fixed reward. The objective is to determine the subset of customers to replenish, the quantity of the product to be delivered to each and to design the vehicle route so that the resulting profit (difference between the total reward and the total logistical cost) is maximised while preventing stockouts at each of the selected customers. This problem appears often as a sub-problem in many logistical problems. In this article, the SV-CIRP is formulated as a mixed-integer program with a nonlinear objective function. After a thorough analysis of the structure of the problem and its features, an exact algorithm for its solution is proposed. This exact algorithm requires only solutions of linear mixed-integer programs. Values of a savings-based heuristic for this problem are compared to the optimal values obtained for a set of some test problems. In general, the gap may get as large as 25%, which justifies the effort to continue exploring and developing exact and approximation algorithms for the SV-CIRP.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Burke, J.V.
The published work on exact penalization is indeed vast. Recently this work has indicated an intimate relationship between exact penalization, Lagrange multipliers, and problem stability or calmness. In the present work we chronicle this development within a simple idealized problem framework, wherein we unify, extend, and refine much of the known theory. In particular, most of the foundations for constrained optimization are developed with the aid of exact penalization techniques. Our approach is highly geometric and is based upon the elementary subdifferential theory for distance functions. It is assumed that the reader is familiar with the theory of convex setsmore » and functions. 54 refs.« less
Structural factoring approach for analyzing stochastic networks
NASA Technical Reports Server (NTRS)
Hayhurst, Kelly J.; Shier, Douglas R.
1991-01-01
The problem of finding the distribution of the shortest path length through a stochastic network is investigated. A general algorithm for determining the exact distribution of the shortest path length is developed based on the concept of conditional factoring, in which a directed, stochastic network is decomposed into an equivalent set of smaller, generally less complex subnetworks. Several network constructs are identified and exploited to reduce significantly the computational effort required to solve a network problem relative to complete enumeration. This algorithm can be applied to two important classes of stochastic path problems: determining the critical path distribution for acyclic networks and the exact two-terminal reliability for probabilistic networks. Computational experience with the algorithm was encouraging and allowed the exact solution of networks that have been previously analyzed only by approximation techniques.
Artificial immune algorithm for multi-depot vehicle scheduling problems
NASA Astrophysics Data System (ADS)
Wu, Zhongyi; Wang, Donggen; Xia, Linyuan; Chen, Xiaoling
2008-10-01
In the fast-developing logistics and supply chain management fields, one of the key problems in the decision support system is that how to arrange, for a lot of customers and suppliers, the supplier-to-customer assignment and produce a detailed supply schedule under a set of constraints. Solutions to the multi-depot vehicle scheduling problems (MDVRP) help in solving this problem in case of transportation applications. The objective of the MDVSP is to minimize the total distance covered by all vehicles, which can be considered as delivery costs or time consumption. The MDVSP is one of nondeterministic polynomial-time hard (NP-hard) problem which cannot be solved to optimality within polynomial bounded computational time. Many different approaches have been developed to tackle MDVSP, such as exact algorithm (EA), one-stage approach (OSA), two-phase heuristic method (TPHM), tabu search algorithm (TSA), genetic algorithm (GA) and hierarchical multiplex structure (HIMS). Most of the methods mentioned above are time consuming and have high risk to result in local optimum. In this paper, a new search algorithm is proposed to solve MDVSP based on Artificial Immune Systems (AIS), which are inspirited by vertebrate immune systems. The proposed AIS algorithm is tested with 30 customers and 6 vehicles located in 3 depots. Experimental results show that the artificial immune system algorithm is an effective and efficient method for solving MDVSP problems.
Exact solutions for the collaborative pickup and delivery problem.
Gansterer, Margaretha; Hartl, Richard F; Salzmann, Philipp E H
2018-01-01
In this study we investigate the decision problem of a central authority in pickup and delivery carrier collaborations. Customer requests are to be redistributed among participants, such that the total cost is minimized. We formulate the problem as multi-depot traveling salesman problem with pickups and deliveries. We apply three well-established exact solution approaches and compare their performance in terms of computational time. To avoid unrealistic solutions with unevenly distributed workload, we extend the problem by introducing minimum workload constraints. Our computational results show that, while for the original problem Benders decomposition is the method of choice, for the newly formulated problem this method is clearly dominated by the proposed column generation approach. The obtained results can be used as benchmarks for decentralized mechanisms in collaborative pickup and delivery problems.
Pechukas-Yukawa approach to the evolution of the quantum state of a parametrically perturbed system
NASA Astrophysics Data System (ADS)
Qureshi, Mumnuna A.; Zhong, Johnny; Qureshi, Zihad; Mason, Peter; Betouras, Joseph J.; Zagoskin, Alexandre M.
2018-03-01
We consider the evolution of the quantum states of a Hamiltonian that is parametrically perturbed via a term proportional to the adiabatic parameter λ (t ) . Starting with the Pechukas-Yukawa mapping of the energy eigenvalue evolution in a generalized Calogero-Sutherland model of a one-dimensional classical gas, we consider the adiabatic approximation with two different expansions of the quantum state in powers of d λ /d t and compare them with a direct numerical simulation. We show that one of these expansions (Magnus series) is especially convenient for the description of nonadiabatic evolution of the system. Applying the expansion to the exact cover 3-satisfiability problem, we obtain the occupation dynamics, which provides insight into the population of states and sources of decoherence in a quantum system.
Lungu, Radu P; Huckaby, Dale A
2008-07-21
An exactly solvable lattice model describing a binary solution is considered where rodlike molecules of types AA and BB cover the links of a honeycomb lattice, the neighboring molecular ends having three-body and orientation-dependent bonding interactions. At phase coexistence of AA-rich and BB-rich phases, the average fraction of each type of triangle of neighboring molecular ends is calculated exactly. The fractions of the different types of triangles are then used to deduce the local microscopic structure of the coexisting phases for a case of the model that contains two closed loops in the phase diagram.
An exact algorithm for optimal MAE stack filter design.
Dellamonica, Domingos; Silva, Paulo J S; Humes, Carlos; Hirata, Nina S T; Barrera, Junior
2007-02-01
We propose a new algorithm for optimal MAE stack filter design. It is based on three main ingredients. First, we show that the dual of the integer programming formulation of the filter design problem is a minimum cost network flow problem. Next, we present a decomposition principle that can be used to break this dual problem into smaller subproblems. Finally, we propose a specialization of the network Simplex algorithm based on column generation to solve these smaller subproblems. Using our method, we were able to efficiently solve instances of the filter problem with window size up to 25 pixels. To the best of our knowledge, this is the largest dimension for which this problem was ever solved exactly.
ADHD and math - The differential effect on calculation and estimation.
Ganor-Stern, Dana; Steinhorn, Ofir
2018-05-31
Adults with ADHD were compared to controls when solving multiplication problems exactly and when estimating the results of multidigit multiplication problems relative to reference numbers. The ADHD participants were slower than controls in the exact calculation and in the estimation tasks, but not less accurate. The ADHD participants were similar to controls in showing enhanced accuracy and speed for smaller problem sizes, for trials in which the reference numbers were smaller (vs. larger) than the exact answers and for reference numbers that were far (vs. close) from the exact answer. The two groups similarly used the approximated calculation and the sense of magnitude strategies. They differed however in strategy execution, mainly of the approximated calculation strategy, which requires working memory resources. The increase in reaction time associated with using the approximated calculation strategy was larger for the ADHD compared to the control participants. Thus, ADHD seems to selectively impair calculation processes in estimation tasks that rely on working memory, but it does not hamper estimation skills that are based on sense of magnitude. The educational implications of these findings are discussed. Copyright © 2018. Published by Elsevier B.V.
Volumetric formulation for a class of kinetic models with energy conservation.
Sbragaglia, M; Sugiyama, K
2010-10-01
We analyze a volumetric formulation of lattice Boltzmann for compressible thermal fluid flows. The velocity set is chosen with the desired accuracy, based on the Gauss-Hermite quadrature procedure, and tested against controlled problems in bounded and unbounded fluids. The method allows the simulation of thermohydrodyamical problems without the need to preserve the exact space-filling nature of the velocity set, but still ensuring the exact conservation laws for density, momentum, and energy. Issues related to boundary condition problems and improvements based on grid refinement are also investigated.
Finite element analysis of wrinkling membranes
NASA Technical Reports Server (NTRS)
Miller, R. K.; Hedgepeth, J. M.; Weingarten, V. I.; Das, P.; Kahyai, S.
1984-01-01
The development of a nonlinear numerical algorithm for the analysis of stresses and displacements in partly wrinkled flat membranes, and its implementation on the SAP VII finite-element code are described. A comparison of numerical results with exact solutions of two benchmark problems reveals excellent agreement, with good convergence of the required iterative procedure. An exact solution of a problem involving axisymmetric deformations of a partly wrinkled shallow curved membrane is also reported.
Efficient algorithms for a class of partitioning problems
NASA Technical Reports Server (NTRS)
Iqbal, M. Ashraf; Bokhari, Shahid H.
1990-01-01
The problem of optimally partitioning the modules of chain- or tree-like tasks over chain-structured or host-satellite multiple computer systems is addressed. This important class of problems includes many signal processing and industrial control applications. Prior research has resulted in a succession of faster exact and approximate algorithms for these problems. Polynomial exact and approximate algorithms are described for this class that are better than any of the previously reported algorithms. The approach is based on a preprocessing step that condenses the given chain or tree structured task into a monotonic chain or tree. The partitioning of this monotonic take can then be carried out using fast search techniques.
Numerical method for solving the nonlinear four-point boundary value problems
NASA Astrophysics Data System (ADS)
Lin, Yingzhen; Lin, Jinnan
2010-12-01
In this paper, a new reproducing kernel space is constructed skillfully in order to solve a class of nonlinear four-point boundary value problems. The exact solution of the linear problem can be expressed in the form of series and the approximate solution of the nonlinear problem is given by the iterative formula. Compared with known investigations, the advantages of our method are that the representation of exact solution is obtained in a new reproducing kernel Hilbert space and accuracy of numerical computation is higher. Meanwhile we present the convergent theorem, complexity analysis and error estimation. The performance of the new method is illustrated with several numerical examples.
NASA Astrophysics Data System (ADS)
Saad, Shakila; Wan Jaafar, Wan Nurhadani; Jamil, Siti Jasmida
2013-04-01
The standard Traveling Salesman Problem (TSP) is the classical Traveling Salesman Problem (TSP) while Multiple Traveling Salesman Problem (MTSP) is an extension of TSP when more than one salesman is involved. The objective of MTSP is to find the least costly route that the traveling salesman problem can take if he wishes to visit exactly once each of a list of n cities and then return back to the home city. There are a few methods that can be used to solve MTSP. The objective of this research is to implement an exact method called Branch-and-Bound (B&B) algorithm. Briefly, the idea of B&B algorithm is to start with the associated Assignment Problem (AP). A branching strategy will be applied to the TSP and MTSP which is Breadth-first-Search (BFS). 11 nodes of cities are implemented for both problem and the solutions to the problem are presented.
NASA Astrophysics Data System (ADS)
Tisdell, C. C.
2017-08-01
Solution methods to exact differential equations via integrating factors have a rich history dating back to Euler (1740) and the ideas enjoy applications to thermodynamics and electromagnetism. Recently, Azevedo and Valentino presented an analysis of the generalized Bernoulli equation, constructing a general solution by linearizing the problem through a substitution. The purpose of this note is to present an alternative approach using 'exact methods', illustrating that a substitution and linearization of the problem is unnecessary. The ideas may be seen as forming a complimentary and arguably simpler approach to Azevedo and Valentino that have the potential to be assimilated and adapted to pedagogical needs of those learning and teaching exact differential equations in schools, colleges, universities and polytechnics. We illustrate how to apply the ideas through an analysis of the Gompertz equation, which is of interest in biomathematical models of tumour growth.
Surface wave scattering from sharp lateral discontinuities
NASA Astrophysics Data System (ADS)
Pollitz, Fred F.
1994-11-01
The problem of surface wave scattering is re-explored, with quasi-degenerate normal mode coupling as the starting point. For coupling among specified spheroidal and toroidal mode dispersion branches, a set of coupled wave equations is derived in the frequency domain for first-arriving Rayleigh and Love waves. The solutions to these coupled wave equations using linear perturbation theory are surface integrals over the unit sphere covering the lateral distribution of perturbations in Earth structure. For isotropic structural perturbations and surface topographic perturbations, these solutions agree with the Born scattering theory previously obtained by Snieder and Romanowicz. By transforming these surface integrals into line integrals along the boundaries of the heterogeneous regions in the case of sharp discontinuities, and by using uniformly valid Green's functions, it is possible to extend the solution to the case of multiple scattering interactions. The proposed method allows the relatively rapid calculation of exact second order scattered wavefield potentials for scattering by sharp discontinuities, and it has many advantages not realized in earlier treatments. It employs a spherical Earth geometry, uses no far field approximation, and implicitly contains backward as well as forward scattering. Comparisons of asymptotic scattering and an exact solution with single scattering and multiple scattering integral formulations show that the phase perturbation predicted by geometrical optics breaks down for scatterers less than about six wavelengths in diameter, and second-order scattering predicts well both the amplitude and phase pattern of the exact wavefield for sufficiently small scatterers, less than about three wavelengths in diameter for anomalies of a few percent.
NASA Astrophysics Data System (ADS)
Ghani, N. H. A.; Mohamed, N. S.; Zull, N.; Shoid, S.; Rivaie, M.; Mamat, M.
2017-09-01
Conjugate gradient (CG) method is one of iterative techniques prominently used in solving unconstrained optimization problems due to its simplicity, low memory storage, and good convergence analysis. This paper presents a new hybrid conjugate gradient method, named NRM1 method. The method is analyzed under the exact and inexact line searches in given conditions. Theoretically, proofs show that the NRM1 method satisfies the sufficient descent condition with both line searches. The computational result indicates that NRM1 method is capable in solving the standard unconstrained optimization problems used. On the other hand, the NRM1 method performs better under inexact line search compared with exact line search.
Exact solution for the optimal neuronal layout problem.
Chklovskii, Dmitri B
2004-10-01
Evolution perfected brain design by maximizing its functionality while minimizing costs associated with building and maintaining it. Assumption that brain functionality is specified by neuronal connectivity, implemented by costly biological wiring, leads to the following optimal design problem. For a given neuronal connectivity, find a spatial layout of neurons that minimizes the wiring cost. Unfortunately, this problem is difficult to solve because the number of possible layouts is often astronomically large. We argue that the wiring cost may scale as wire length squared, reducing the optimal layout problem to a constrained minimization of a quadratic form. For biologically plausible constraints, this problem has exact analytical solutions, which give reasonable approximations to actual layouts in the brain. These solutions make the inverse problem of inferring neuronal connectivity from neuronal layout more tractable.
Opera: reconstructing optimal genomic scaffolds with high-throughput paired-end sequences.
Gao, Song; Sung, Wing-Kin; Nagarajan, Niranjan
2011-11-01
Scaffolding, the problem of ordering and orienting contigs, typically using paired-end reads, is a crucial step in the assembly of high-quality draft genomes. Even as sequencing technologies and mate-pair protocols have improved significantly, scaffolding programs still rely on heuristics, with no guarantees on the quality of the solution. In this work, we explored the feasibility of an exact solution for scaffolding and present a first tractable solution for this problem (Opera). We also describe a graph contraction procedure that allows the solution to scale to large scaffolding problems and demonstrate this by scaffolding several large real and synthetic datasets. In comparisons with existing scaffolders, Opera simultaneously produced longer and more accurate scaffolds demonstrating the utility of an exact approach. Opera also incorporates an exact quadratic programming formulation to precisely compute gap sizes (Availability: http://sourceforge.net/projects/operasf/ ).
Opera: Reconstructing Optimal Genomic Scaffolds with High-Throughput Paired-End Sequences
Gao, Song; Sung, Wing-Kin
2011-01-01
Abstract Scaffolding, the problem of ordering and orienting contigs, typically using paired-end reads, is a crucial step in the assembly of high-quality draft genomes. Even as sequencing technologies and mate-pair protocols have improved significantly, scaffolding programs still rely on heuristics, with no guarantees on the quality of the solution. In this work, we explored the feasibility of an exact solution for scaffolding and present a first tractable solution for this problem (Opera). We also describe a graph contraction procedure that allows the solution to scale to large scaffolding problems and demonstrate this by scaffolding several large real and synthetic datasets. In comparisons with existing scaffolders, Opera simultaneously produced longer and more accurate scaffolds demonstrating the utility of an exact approach. Opera also incorporates an exact quadratic programming formulation to precisely compute gap sizes (Availability: http://sourceforge.net/projects/operasf/). PMID:21929371
The Poisson-Boltzmann theory for the two-plates problem: some exact results.
Xing, Xiang-Jun
2011-12-01
The general solution to the nonlinear Poisson-Boltzmann equation for two parallel charged plates, either inside a symmetric electrolyte, or inside a 2q:-q asymmetric electrolyte, is found in terms of Weierstrass elliptic functions. From this we derive some exact asymptotic results for the interaction between charged plates, as well as the exact form of the renormalized surface charge density.
A model for solving the prescribed burn planning problem.
Rachmawati, Ramya; Ozlen, Melih; Reinke, Karin J; Hearne, John W
2015-01-01
The increasing frequency of destructive wildfires, with a consequent loss of life and property, has led to fire and land management agencies initiating extensive fuel management programs. This involves long-term planning of fuel reduction activities such as prescribed burning or mechanical clearing. In this paper, we propose a mixed integer programming (MIP) model that determines when and where fuel reduction activities should take place. The model takes into account multiple vegetation types in the landscape, their tolerance to frequency of fire events, and keeps track of the age of each vegetation class in each treatment unit. The objective is to minimise fuel load over the planning horizon. The complexity of scheduling fuel reduction activities has led to the introduction of sophisticated mathematical optimisation methods. While these approaches can provide optimum solutions, they can be computationally expensive, particularly for fuel management planning which extends across the landscape and spans long term planning horizons. This raises the question of how much better do exact modelling approaches compare to simpler heuristic approaches in their solutions. To answer this question, the proposed model is run using an exact MIP (using commercial MIP solver) and two heuristic approaches that decompose the problem into multiple single-period sub problems. The Knapsack Problem (KP), which is the first heuristic approach, solves the single period problems, using an exact MIP approach. The second heuristic approach solves the single period sub problem using a greedy heuristic approach. The three methods are compared in term of model tractability, computational time and the objective values. The model was tested using randomised data from 711 treatment units in the Barwon-Otway district of Victoria, Australia. Solutions for the exact MIP could be obtained for up to a 15-year planning only using a standard implementation of CPLEX. Both heuristic approaches can solve significantly larger problems, involving 100-year or even longer planning horizons. Furthermore there are no substantial differences in the solutions produced by the three approaches. It is concluded that for practical purposes a heuristic method is to be preferred to the exact MIP approach.
NASA Technical Reports Server (NTRS)
Chen, Guanrong
1991-01-01
An optimal trajectory planning problem for a single-link, flexible joint manipulator is studied. A global feedback-linearization is first applied to formulate the nonlinear inequality-constrained optimization problem in a suitable way. Then, an exact and explicit structural formula for the optimal solution of the problem is derived and the solution is shown to be unique. It turns out that the optimal trajectory planning and control can be done off-line, so that the proposed method is applicable to both theoretical analysis and real time tele-robotics control engineering.
Numerical Solution of the Electron Transport Equation in the Upper Atmosphere
DOE Office of Scientific and Technical Information (OSTI.GOV)
Woods, Mark Christopher; Holmes, Mark; Sailor, William C
A new approach for solving the electron transport equation in the upper atmosphere is derived. The problem is a very stiff boundary value problem, and to obtain an accurate numerical solution, matrix factorizations are used to decouple the fast and slow modes. A stable finite difference method is applied to each mode. This solver is applied to a simplifieed problem for which an exact solution exists using various versions of the boundary conditions that might arise in a natural auroral display. The numerical and exact solutions are found to agree with each other to at least two significant digits.
Determining linear vibration frequencies of a ferromagnetic shell
NASA Astrophysics Data System (ADS)
Bagdoev, A. G.; Vardanyan, A. V.; Vardanyan, S. V.; Kukudzhanov, V. N.
2007-10-01
The problems of determining the roots of dispersion equations for free bending vibrations of thin magnetoelastic plates and shells are of both theoretical and practical interest, in particular, in studying vibrations of metallic structures used in controlled thermonuclear reactors. These problems were solved on the basis of the Kirchhoff hypothesis in [1-5]. In [6], an exact spatial approach to determining the vibration frequencies of thin plates was suggested, and it was shown that it completely agrees with the solution obtained according to the Kirchhoff hypothesis. In [7-9], this exact approach was used to solve the problem on vibrations of thin magnetoelastic plates, and it was shown by cumbersome calculations that the solutions obtained according to the exact theory and the Kirchhoff hypothesis differ substantially except in a single case. In [10], the equations of the dynamic theory of elasticity in the axisymmetric problem are given. In [11], the equations for the vibration frequencies of thin ferromagnetic plates with arbitrary conductivity were obtained in the exact statement. In [12], the Kirchhoff hypothesis was used to obtain dispersion relations for a magnetoelastic thin shell. In [5, 13-16], the relations for the Maxwell tensor and the ponderomotive force for magnetics were presented. In [17], the dispersion relations for thin ferromagnetic plates in the transverse field in the spatial statement were studied analytically and numerically. In the present paper, on the basis of the exact approach, we study free bending vibrations of a thin ferromagnetic cylindrical shell. We obtain the exact dispersion equation in the form of a sixth-order determinant, which can be solved numerically in the case of a magnetoelastic thin shell. The numerical results are presented in tables and compared with the results obtained by the Kirchhoff hypothesis. We show a large number of differences in the results, even for the least frequency.
Fast and Exact Continuous Collision Detection with Bernstein Sign Classification
Tang, Min; Tong, Ruofeng; Wang, Zhendong; Manocha, Dinesh
2014-01-01
We present fast algorithms to perform accurate CCD queries between triangulated models. Our formulation uses properties of the Bernstein basis and Bézier curves and reduces the problem to evaluating signs of polynomials. We present a geometrically exact CCD algorithm based on the exact geometric computation paradigm to perform reliable Boolean collision queries. Our algorithm is more than an order of magnitude faster than prior exact algorithms. We evaluate its performance for cloth and FEM simulations on CPUs and GPUs, and highlight the benefits. PMID:25568589
Graphing as a Problem-Solving Strategy.
ERIC Educational Resources Information Center
Cohen, Donald
1984-01-01
The focus is on how line graphs can be used to approximate solutions to rate problems and to suggest equations that offer exact algebraic solutions to the problem. Four problems requiring progressively greater graphing sophistication are presented plus four exercises. (MNS)
Using exact solutions to develop an implicit scheme for the baroclinic primitive equations
NASA Technical Reports Server (NTRS)
Marchesin, D.
1984-01-01
The exact solutions presently obtained by means of a novel method for nonlinear initial value problems are used in the development of numerical schemes for the computer solution of these problems. The method is applied to a new, fully implicit scheme on a vertical slice of the isentropic baroclinic equations. It was not possible to find a global scale phenomenon that could be simulated by the baroclinic primitive equations on a vertical slice.
Constructor theory of probability
2016-01-01
Unitary quantum theory, having no Born Rule, is non-probabilistic. Hence the notorious problem of reconciling it with the unpredictability and appearance of stochasticity in quantum measurements. Generalizing and improving upon the so-called ‘decision-theoretic approach’, I shall recast that problem in the recently proposed constructor theory of information—where quantum theory is represented as one of a class of superinformation theories, which are local, non-probabilistic theories conforming to certain constructor-theoretic conditions. I prove that the unpredictability of measurement outcomes (to which constructor theory gives an exact meaning) necessarily arises in superinformation theories. Then I explain how the appearance of stochasticity in (finitely many) repeated measurements can arise under superinformation theories. And I establish sufficient conditions for a superinformation theory to inform decisions (made under it) as if it were probabilistic, via a Deutsch–Wallace-type argument—thus defining a class of decision-supporting superinformation theories. This broadens the domain of applicability of that argument to cover constructor-theory compliant theories. In addition, in this version some of the argument's assumptions, previously construed as merely decision-theoretic, follow from physical properties expressed by constructor-theoretic principles. PMID:27616914
A new approach on auxiliary vehicle assignment in capacitated location routing problem
NASA Astrophysics Data System (ADS)
Bashiri, Mahdi; Rasoulinejad, Zeinab; Fallahzade, Ehsan
2016-03-01
The location routing problem (LRP) considers locating depots and vehicle routing decisions simultaneously. In classic LRP the number of customers in each route depends on the capacity of the vehicle. In this paper a capacitated LRP model with auxiliary vehicle assignment is presented in which the length of each route is not restricted by main vehicle capacity. Two kinds of vehicles are considered: main vehicles with higher capacity and fixed cost and auxiliary vehicles with lower capacity and fixed cost. The auxiliary vehicles can be added to the transportation system as an alternative strategy to cover the capacity limitations and they are just used to transfer goods from depots to vehicles and cannot serve the customers by themselves. To show the applicability of the proposed model, some numerical examples derived from the well-known instances are used. Moreover the model has been solved by some meta-heuristics for large sized instances. The results show the efficiency of the proposed model and the solution approach, considering the classic model and the exact solution approach, respectively.
On problems in defining abstract and metaphysical concepts--emergence of a new model.
Nahod, Bruno; Nahod, Perina Vukša
2014-12-01
Basic anthropological terminology is the first project covering terms from the domain of the social sciences under the Croatian Special Field Terminology program (Struna). Problems that have been sporadically noticed or whose existence could have been presumed during the processing of terms mainly from technical fields and sciences have finally emerged in "anthropology". The principles of the General Theory of Terminology (GTT), which are followed in Struna, were put to a truly exacting test, and sometimes stretched beyond their limits when applied to concepts that do not necessarily have references in the physical world; namely, abstract and metaphysical concepts. We are currently developing a new terminographical model based on Idealized Cognitive Models (ICM), which will hopefully ensure a better cross-filed implementation of various types of concepts and their relations. The goal of this paper is to introduce the theoretical bases of our model. Additionally, we will present a pilot study of the series of experiments in which we are trying to investigate the nature of conceptual categorization in special languages and its proposed difference form categorization in general language.
Exact analytic solution for the spin-up maneuver of an axially symmetric spacecraft
NASA Astrophysics Data System (ADS)
Ventura, Jacopo; Romano, Marcello
2014-11-01
The problem of spinning-up an axially symmetric spacecraft subjected to an external torque constant in magnitude and parallel to the symmetry axis is considered. The existing exact analytic solution for an axially symmetric body is applied for the first time to this problem. The proposed solution is valid for any initial conditions of attitude and angular velocity and for any length of time and rotation amplitude. Furthermore, the proposed solution can be numerically evaluated up to any desired level of accuracy. Numerical experiments and comparison with an existing approximated solution and with the integration of the equations of motion are reported in the paper. Finally, a new approximated solution obtained from the exact one is introduced in this paper.
An exact stiffness theory for unidirectional xFRP composites
NASA Astrophysics Data System (ADS)
Klasztorny, M.; Konderla, P.; Piekarski, R.
2009-01-01
UD xFRP composites, i.e., isotropic plastics reinforced with long transversely isotropic fibres packed unidirectionally according to the hexagonal scheme are considered. The constituent materials are geometrically and physically linear. The previous formulations of the exact stiffness theory of such composites are revised, and the theory is developed further based on selected boundary-value problems of elasticity theory. The numerical examples presented are focussed on testing the theory with account of previous variants of this theory and experimental values of the effective elastic constants. The authors have pointed out that the exact stiffness theory of UD xFRP composites, with the modifications proposed in our study, will be useful in the engineering practice and in solving the current problems of the mechanics of composite materials.
Exact axisymmetric solutions of the Maxwell equations in a nonlinear nondispersive medium.
Petrov, E Yu; Kudrin, A V
2010-05-14
The features of propagation of intense waves are of great interest for theory and experiment in electrodynamics and acoustics. The behavior of nonlinear waves in a bounded volume is of special importance and, at the same time, is an extremely complicated problem. It seems almost impossible to find a rigorous solution to such a problem even for any model of nonlinearity. We obtain the first exact solution of this type. We present a new method for deriving exact solutions of the Maxwell equations in a nonlinear medium without dispersion and give examples of the obtained solutions that describe propagation of cylindrical electromagnetic waves in a nonlinear nondispersive medium and free electromagnetic oscillations in a cylindrical cavity resonator filled with such a medium.
Xu, Andrew Wei
2010-09-01
In genome rearrangement, given a set of genomes G and a distance measure d, the median problem asks for another genome q that minimizes the total distance [Formula: see text]. This is a key problem in genome rearrangement based phylogenetic analysis. Although this problem is known to be NP-hard, we have shown in a previous article, on circular genomes and under the DCJ distance measure, that a family of patterns in the given genomes--represented by adequate subgraphs--allow us to rapidly find exact solutions to the median problem in a decomposition approach. In this article, we extend this result to the case of linear multichromosomal genomes, in order to solve more interesting problems on eukaryotic nuclear genomes. A multi-way capping problem in the linear multichromosomal case imposes an extra computational challenge on top of the difficulty in the circular case, and this difficulty has been underestimated in our previous study and is addressed in this article. We represent the median problem by the capped multiple breakpoint graph, extend the adequate subgraphs into the capped adequate subgraphs, and prove optimality-preserving decomposition theorems, which give us the tools to solve the median problem and the multi-way capping optimization problem together. We also develop an exact algorithm ASMedian-linear, which iteratively detects instances of (capped) adequate subgraphs and decomposes problems into subproblems. Tested on simulated data, ASMedian-linear can rapidly solve most problems with up to several thousand genes, and it also can provide optimal or near-optimal solutions to the median problem under the reversal/HP distance measures. ASMedian-linear is available at http://sites.google.com/site/andrewweixu .
Entanglement bases and general structures of orthogonal complete bases
DOE Office of Scientific and Technical Information (OSTI.GOV)
Zhong Zaizhe
2004-10-01
In quantum mechanics and quantum information, to establish the orthogonal bases is a useful means. The existence of unextendible product bases impels us to study the 'entanglement bases' problems. In this paper, the concepts of entanglement bases and exact-entanglement bases are defined, and a theorem about exact-entanglement bases is given. We discuss the general structures of the orthogonal complete bases. Two examples of applications are given. At last, we discuss the problem of transformation of the general structure forms.
Hesselmann, Andreas; Görling, Andreas
2011-01-21
A recently introduced time-dependent exact-exchange (TDEXX) method, i.e., a response method based on time-dependent density-functional theory that treats the frequency-dependent exchange kernel exactly, is reformulated. In the reformulated version of the TDEXX method electronic excitation energies can be calculated by solving a linear generalized eigenvalue problem while in the original version of the TDEXX method a laborious frequency iteration is required in the calculation of each excitation energy. The lowest eigenvalues of the new TDEXX eigenvalue equation corresponding to the lowest excitation energies can be efficiently obtained by, e.g., a version of the Davidson algorithm appropriate for generalized eigenvalue problems. Alternatively, with the help of a series expansion of the new TDEXX eigenvalue equation, standard eigensolvers for large regular eigenvalue problems, e.g., the standard Davidson algorithm, can be used to efficiently calculate the lowest excitation energies. With the help of the series expansion as well, the relation between the TDEXX method and time-dependent Hartree-Fock is analyzed. Several ways to take into account correlation in addition to the exact treatment of exchange in the TDEXX method are discussed, e.g., a scaling of the Kohn-Sham eigenvalues, the inclusion of (semi)local approximate correlation potentials, or hybrids of the exact-exchange kernel with kernels within the adiabatic local density approximation. The lowest lying excitations of the molecules ethylene, acetaldehyde, and pyridine are considered as examples.
Entanglement dynamics in a non-Markovian environment: An exactly solvable model
NASA Astrophysics Data System (ADS)
Wilson, Justin H.; Fregoso, Benjamin M.; Galitski, Victor M.
2012-05-01
We study the non-Markovian effects on the dynamics of entanglement in an exactly solvable model that involves two independent oscillators, each coupled to its own stochastic noise source. First, we develop Lie algebraic and functional integral methods to find an exact solution to the single-oscillator problem which includes an analytic expression for the density matrix and the complete statistics, i.e., the probability distribution functions for observables. For long bath time correlations, we see nonmonotonic evolution of the uncertainties in observables. Further, we extend this exact solution to the two-particle problem and find the dynamics of entanglement in a subspace. We find the phenomena of “sudden death” and “rebirth” of entanglement. Interestingly, all memory effects enter via the functional form of the energy and hence the time of death and rebirth is controlled by the amount of noisy energy added into each oscillator. If this energy increases above (decreases below) a threshold, we obtain sudden death (rebirth) of entanglement.
Exact-Output Tracking Theory for Systems with Parameter Jumps
NASA Technical Reports Server (NTRS)
Devasia, Santosh; Paden, Brad; Rossi, Carlo
1996-01-01
In this paper we consider the exact output tracking problem for systems with parameter jumps. Necessary and sufficient conditions are derived for the elimination of switching-introduced output transient. Previous works have studied this problem by developing a regulator that maintains exact tracking through parameter jumps (switches). Such techniques are, however, only applicable to minimum-phase systems. In contrast, our approach is applicable to nonminimum-phase systems and obtains bounded but possibly non-causal solutions. If the reference trajectories are generated by an exo-system, then we develop an exact-tracking controller in a feedback form. As in standard regulator theory, we obtain a linear map from the states of the exo-system to the desired system state which is defined via a matrix differential equation. The constant solution of this differential equation provides asymptotic tracking, and coincides with the feedback law used in standard regulator theory. The obtained results are applied to a simple flexible manipulator with jumps in the pay-load mass.
Exact-Output Tracking Theory for Systems with Parameter Jumps
NASA Technical Reports Server (NTRS)
Devasia, Santosh; Paden, Brad; Rossi, Carlo
1997-01-01
We consider the exact output tracking problem for systems with parameter jumps. Necessary and sufficient conditions are derived for the elimination of switching-introduced output transient. Previous works have studied this problem by developing a regulator that maintains exact tracking through parameter jumps (switches). Such techniques are, however, only applicable to minimum-phase systems. In contrast, our approach is applicable to non-minimum-phase systems and it obtains bounded but possibly non-causal solutions. If the reference trajectories are generated by an exosystem, then we develop an exact-tracking controller in a feed-back form. As in standard regulator theory, we obtain a linear map from the states of the exosystem to the desired system state which is defined via a matrix differential equation. The constant solution of this differential equation provides asymptotic tracking, and coincides with the feedback law used in standard regulator theory. The obtained results are applied to a simple flexible manipulator with jumps in the pay-load mass.
Eshelby problem of polygonal inclusions in anisotropic piezoelectric full- and half-planes
NASA Astrophysics Data System (ADS)
Pan, E.
2004-03-01
This paper presents an exact closed-form solution for the Eshelby problem of polygonal inclusion in anisotropic piezoelectric full- and half-planes. Based on the equivalent body-force concept of eigenstrain, the induced elastic and piezoelectric fields are first expressed in terms of line integral on the boundary of the inclusion with the integrand being the Green's function. Using the recently derived exact closed-form line-source Green's function, the line integral is then carried out analytically, with the final expression involving only elementary functions. The exact closed-form solution is applied to a square-shaped quantum wire within semiconductor GaAs full- and half-planes, with results clearly showing the importance of material orientation and piezoelectric coupling. While the elastic and piezoelectric fields within the square-shaped quantum wire could serve as benchmarks to other numerical methods, the exact closed-form solution should be useful to the analysis of nanoscale quantum-wire structures where large strain and electric fields could be induced by the misfit strain.
A new exact method for line radiative transfer
NASA Astrophysics Data System (ADS)
Elitzur, Moshe; Asensio Ramos, Andrés
2006-01-01
We present a new method, the coupled escape probability (CEP), for exact calculation of line emission from multi-level systems, solving only algebraic equations for the level populations. The CEP formulation of the classical two-level problem is a set of linear equations, and we uncover an exact analytic expression for the emission from two-level optically thick sources that holds as long as they are in the `effectively thin' regime. In a comparative study of a number of standard problems, the CEP method outperformed the leading line transfer methods by substantial margins. The algebraic equations employed by our new method are already incorporated in numerous codes based on the escape probability approximation. All that is required for an exact solution with these existing codes is to augment the expression for the escape probability with simple zone-coupling terms. As an application, we find that standard escape probability calculations generally produce the correct cooling emission by the CII 158-μm line but not by the 3P lines of OI.
Application of the artificial bee colony algorithm for solving the set covering problem.
Crawford, Broderick; Soto, Ricardo; Cuesta, Rodrigo; Paredes, Fernando
2014-01-01
The set covering problem is a formal model for many practical optimization problems. In the set covering problem the goal is to choose a subset of the columns of minimal cost that covers every row. Here, we present a novel application of the artificial bee colony algorithm to solve the non-unicost set covering problem. The artificial bee colony algorithm is a recent swarm metaheuristic technique based on the intelligent foraging behavior of honey bees. Experimental results show that our artificial bee colony algorithm is competitive in terms of solution quality with other recent metaheuristic approaches for the set covering problem.
Application of the Artificial Bee Colony Algorithm for Solving the Set Covering Problem
Crawford, Broderick; Soto, Ricardo; Cuesta, Rodrigo; Paredes, Fernando
2014-01-01
The set covering problem is a formal model for many practical optimization problems. In the set covering problem the goal is to choose a subset of the columns of minimal cost that covers every row. Here, we present a novel application of the artificial bee colony algorithm to solve the non-unicost set covering problem. The artificial bee colony algorithm is a recent swarm metaheuristic technique based on the intelligent foraging behavior of honey bees. Experimental results show that our artificial bee colony algorithm is competitive in terms of solution quality with other recent metaheuristic approaches for the set covering problem. PMID:24883356
NASA Technical Reports Server (NTRS)
Reimers, J. R.; Heller, E. J.
1985-01-01
The exact thermal rotational spectrum of a two-dimensional rigid rotor is obtained using Gaussian wave packet dynamics. The spectrum is obtained by propagating, without approximation, infinite sets of Gaussian wave packets. These sets are constructed so that collectively they have the correct periodicity, and indeed, are coherent states appropriate to this problem. Also, simple, almost classical, approximations to full wave packet dynamics are shown to give results which are either exact or very nearly exact. Advantages of the use of Gaussian wave packet dynamics over conventional linear response theory are discussed.
Treatment of pairing correlations based on the equations of motion for zero-coupled pair operators
NASA Astrophysics Data System (ADS)
Andreozzi, F.; Covello, A.; Gargano, A.; Ye, Liu Jian; Porrino, A.
1985-07-01
The pairing problem is treated by means of the equations of motion for zero-coupled pair operators. Exact equations for the seniority-v states of N particles are derived. These equations can be solved by a step-by-step procedure which consists of progressively adding pairs of particles to a core. The theory can be applied at several levels of approximation depending on the number of core states which are taken into account. Some numerical applications to the treatment of v=0, v=1, and v=2 states in the Ni isotopes are performed. The accuracy of various approximations is tested by comparison with exact results. For the seniority-one and seniority-two problems it turns out that the results obtained from the first-order theory are very accurate, while those of higher order calculations are practically exact. Concerning the seniority-zero problem, a fifth-order calculation reproduces quite well the three lowest states.
Es'kin, V A; Kudrin, A V; Petrov, E Yu
2011-06-01
The behavior of electromagnetic fields in nonlinear media has been a topical problem since the discovery of materials with a nonlinearity of electromagnetic properties. The problem of finding exact solutions for the source-excited nonlinear waves in curvilinear coordinates has been regarded as unsolvable for a long time. In this work, we present the first solution of this type for a cylindrically symmetric field excited by a pulsed current filament in a nondispersive medium that is simultaneously inhomogeneous and nonlinear. Assuming that the medium has a power-law permittivity profile in the linear regime and lacks a center of inversion, we derive an exact solution for the electromagnetic field excited by a current filament in such a medium and discuss the properties of this solution.
JANUS: a bit-wise reversible integrator for N-body dynamics
NASA Astrophysics Data System (ADS)
Rein, Hanno; Tamayo, Daniel
2018-01-01
Hamiltonian systems such as the gravitational N-body problem have time-reversal symmetry. However, all numerical N-body integration schemes, including symplectic ones, respect this property only approximately. In this paper, we present the new N-body integrator JANUS , for which we achieve exact time-reversal symmetry by combining integer and floating point arithmetic. JANUS is explicit, formally symplectic and satisfies Liouville's theorem exactly. Its order is even and can be adjusted between two and ten. We discuss the implementation of JANUS and present tests of its accuracy and speed by performing and analysing long-term integrations of the Solar system. We show that JANUS is fast and accurate enough to tackle a broad class of dynamical problems. We also discuss the practical and philosophical implications of running exactly time-reversible simulations.
A solution to the single-question crowd wisdom problem.
Prelec, Dražen; Seung, H Sebastian; McCoy, John
2017-01-25
Once considered provocative, the notion that the wisdom of the crowd is superior to any individual has become itself a piece of crowd wisdom, leading to speculation that online voting may soon put credentialed experts out of business. Recent applications include political and economic forecasting, evaluating nuclear safety, public policy, the quality of chemical probes, and possible responses to a restless volcano. Algorithms for extracting wisdom from the crowd are typically based on a democratic voting procedure. They are simple to apply and preserve the independence of personal judgment. However, democratic methods have serious limitations. They are biased for shallow, lowest common denominator information, at the expense of novel or specialized knowledge that is not widely shared. Adjustments based on measuring confidence do not solve this problem reliably. Here we propose the following alternative to a democratic vote: select the answer that is more popular than people predict. We show that this principle yields the best answer under reasonable assumptions about voter behaviour, while the standard 'most popular' or 'most confident' principles fail under exactly those same assumptions. Like traditional voting, the principle accepts unique problems, such as panel decisions about scientific or artistic merit, and legal or historical disputes. The potential application domain is thus broader than that covered by machine learning and psychometric methods, which require data across multiple questions.
NASA Astrophysics Data System (ADS)
Sokolovskiy, Vladimir; Grünebohm, Anna; Buchelnikov, Vasiliy; Entel, Peter
2014-09-01
This special issue collects contributions from the participants of the "Information in Dynamical Systems and Complex Systems" workshop, which cover a wide range of important problems and new approaches that lie in the intersection of information theory and dynamical systems. The contributions include theoretical characterization and understanding of the different types of information flow and causality in general stochastic processes, inference and identification of coupling structure and parameters of system dynamics, rigorous coarse-grain modeling of network dynamical systems, and exact statistical testing of fundamental information-theoretic quantities such as the mutual information. The collective efforts reported herein reflect a modern perspective of the intimate connection between dynamical systems and information flow, leading to the promise of better understanding and modeling of natural complex systems and better/optimal design of engineering systems.
Fahrenheit to Celsius: An Exploration in College Algebra.
ERIC Educational Resources Information Center
Fay, Temple H.; Hardie, Keith A.
2003-01-01
Suggests that the classical exact formula for the conversion of degrees Celsius and degrees Fahrenheit is not user-friendly. Offers an approximate linear transformation that is easier to remember and use. Investigates both the exact conversion and the approximate conversion and provides interesting and relevant problems for small group…
Stark, Richard C.; Fox, S. F.; David, M.L.
2005-01-01
Texas Horned Lizards, Phrynosoma cornutum, were tracked using fluorescent powder to determine exact daily movements. Daily linear movements and daily space use were compared between adult males and females. Lizards that traveled the greatest linear distances also covered the largest areas. In Oklahoma, adults emerge from hibernation in late April and early May and mate soon afterward. Males traveled significantly greater distances (and covered significantly larger areas in a day) than females in May but not after May. We propose that males move more and cover more area than females early in the mating season to intercept receptive females. Copyright 2005 Society for the Study of Amphibians and Reptiles.
NASA Astrophysics Data System (ADS)
Noor-E-Alam, Md.; Doucette, John
2015-08-01
Grid-based location problems (GBLPs) can be used to solve location problems in business, engineering, resource exploitation, and even in the field of medical sciences. To solve these decision problems, an integer linear programming (ILP) model is designed and developed to provide the optimal solution for GBLPs considering fixed cost criteria. Preliminary results show that the ILP model is efficient in solving small to moderate-sized problems. However, this ILP model becomes intractable in solving large-scale instances. Therefore, a decomposition heuristic is proposed to solve these large-scale GBLPs, which demonstrates significant reduction of solution runtimes. To benchmark the proposed heuristic, results are compared with the exact solution via ILP. The experimental results show that the proposed method significantly outperforms the exact method in runtime with minimal (and in most cases, no) loss of optimality.
Geometrically derived difference formulae for the numerical integration of trajectory problems
NASA Technical Reports Server (NTRS)
Mcleod, R. J. Y.; Sanz-Serna, J. M.
1982-01-01
An initial value problem for the autonomous system of ordinary differential equations dy/dt = f(y), where y is a vector, is considered. In a number of practical applications the interest lies in obtaining the curve traced by the solution y. These applications include the computation of trajectories in mechanical problems. The term 'trajectory problem' is employed to refer to these cases. Lambert and McLeod (1979) have introduced a method involving local rotation of the axes in the y-plane for the two-dimensional case. The present investigation continues the study of difference schemes specifically derived for trajectory problems. A simple geometrical way of constructing such methods is presented, and the local accuracy of the schemes is investigated. A circularly exact, fixed-step predictor-corrector algorithm is defined, and a variable-step version of a circularly exact algorithm is presented.
Exact finite element method analysis of viscoelastic tapered structures to transient loads
NASA Technical Reports Server (NTRS)
Spyrakos, Constantine Chris
1987-01-01
A general method is presented for determining the dynamic torsional/axial response of linear structures composed of either tapered bars or shafts to transient excitations. The method consists of formulating and solving the dynamic problem in the Laplace transform domain by the finite element method and obtaining the response by a numerical inversion of the transformed solution. The derivation of the torsional and axial stiffness matrices is based on the exact solution of the transformed governing equation of motion, and it consequently leads to the exact solution of the problem. The solution permits treatment of the most practical cases of linear tapered bars and shafts, and employs modeling of structures with only one element per member which reduces the number of degrees of freedom involved. The effects of external viscous or internal viscoelastic damping are also taken into account.
Improved method for implicit Monte Carlo
DOE Office of Scientific and Technical Information (OSTI.GOV)
Brown, F. B.; Martin, W. R.
2001-01-01
The Implicit Monte Carlo (IMC) method has been used for over 30 years to analyze radiative transfer problems, such as those encountered in stellar atmospheres or inertial confinement fusion. Reference [2] provided an exact error analysis of IMC for 0-D problems and demonstrated that IMC can exhibit substantial errors when timesteps are large. These temporal errors are inherent in the method and are in addition to spatial discretization errors and approximations that address nonlinearities (due to variation of physical constants). In Reference [3], IMC and four other methods were analyzed in detail and compared on both theoretical grounds and themore » accuracy of numerical tests. As discussed in, two alternative schemes for solving the radiative transfer equations, the Carter-Forest (C-F) method and the Ahrens-Larsen (A-L) method, do not exhibit the errors found in IMC; for 0-D, both of these methods are exact for all time, while for 3-D, A-L is exact for all time and C-F is exact within a timestep. These methods can yield substantially superior results to IMC.« less
NASA Astrophysics Data System (ADS)
Osterloh, Andreas
2016-12-01
Here I present a method for how intersections of a certain density matrix of rank 2 with the zero polytope can be calculated exactly. This is a purely geometrical procedure which thereby is applicable to obtaining the zeros of SL- and SU-invariant entanglement measures of arbitrary polynomial degree. I explain this method in detail for a recently unsolved problem. In particular, I show how a three-dimensional view, namely, in terms of the Bloch-sphere analogy, solves this problem immediately. To this end, I determine the zero polytope of the three-tangle, which is an exact result up to computer accuracy, and calculate upper bounds to its convex roof which are below the linearized upper bound. The zeros of the three-tangle (in this case) induced by the zero polytope (zero simplex) are exact values. I apply this procedure to a superposition of the four-qubit Greenberger-Horne-Zeilinger and W state. It can, however, be applied to every case one has under consideration, including an arbitrary polynomial convex-roof measure of entanglement and for arbitrary local dimension.
Exact and Heuristic Algorithms for Runway Scheduling
NASA Technical Reports Server (NTRS)
Malik, Waqar A.; Jung, Yoon C.
2016-01-01
This paper explores the Single Runway Scheduling (SRS) problem with arrivals, departures, and crossing aircraft on the airport surface. Constraints for wake vortex separations, departure area navigation separations and departure time window restrictions are explicitly considered. The main objective of this research is to develop exact and heuristic based algorithms that can be used in real-time decision support tools for Air Traffic Control Tower (ATCT) controllers. The paper provides a multi-objective dynamic programming (DP) based algorithm that finds the exact solution to the SRS problem, but may prove unusable for application in real-time environment due to large computation times for moderate sized problems. We next propose a second algorithm that uses heuristics to restrict the search space for the DP based algorithm. A third algorithm based on a combination of insertion and local search (ILS) heuristics is then presented. Simulation conducted for the east side of Dallas/Fort Worth International Airport allows comparison of the three proposed algorithms and indicates that the ILS algorithm performs favorably in its ability to find efficient solutions and its computation times.
Hierarchic models for laminated plates. Ph.D. Thesis
NASA Technical Reports Server (NTRS)
Actis, Ricardo Luis
1991-01-01
Structural plates and shells are three-dimensional bodies, one dimension of which happens to be much smaller than the other two. Thus, the quality of a plate or shell model must be judged on the basis of how well its exact solution approximates the corresponding three-dimensional problem. Of course, the exact solution depends not only on the choice of the model but also on the topology, material properties, loading and constraints. The desired degree of approximation depends on the analyst's goals in performing the analysis. For these reasons models have to be chosen adaptively. Hierarchic sequences of models make adaptive selection of the model which is best suited for the purposes of a particular analysis possible. The principles governing the formulation of hierarchic models for laminated plates are presented. The essential features of the hierarchic models described models are: (1) the exact solutions corresponding to the hierarchic sequence of models converge to the exact solution of the corresponding problem of elasticity for a fixed laminate thickness; and (2) the exact solution of each model converges to the same limit as the exact solution of the corresponding problem of elasticity with respect to the laminate thickness approaching zero. The formulation is based on one parameter (beta) which characterizes the hierarchic sequence of models, and a set of constants whose influence was assessed by a numerical sensitivity study. The recommended selection of these constants results in the number of fields increasing by three for each increment in the power of beta. Numerical examples analyzed with the proposed sequence of models are included and good correlation with the reference solutions was found. Results were obtained for laminated strips (plates in cylindrical bending) and for square and rectangular plates with uniform loading and with homogeneous boundary conditions. Cross-ply and angle-ply laminates were evaluated and the results compared with those of MSC/PROBE. Hierarchic models make the computation of any engineering data possible to an arbitrary level of precision within the framework of the theory of elasticity.
NASA Astrophysics Data System (ADS)
Bollati, Julieta; Tarzia, Domingo A.
2018-04-01
Recently, in Tarzia (Thermal Sci 21A:1-11, 2017) for the classical two-phase Lamé-Clapeyron-Stefan problem an equivalence between the temperature and convective boundary conditions at the fixed face under a certain restriction was obtained. Motivated by this article we study the two-phase Stefan problem for a semi-infinite material with a latent heat defined as a power function of the position and a convective boundary condition at the fixed face. An exact solution is constructed using Kummer functions in case that an inequality for the convective transfer coefficient is satisfied generalizing recent works for the corresponding one-phase free boundary problem. We also consider the limit to our problem when that coefficient goes to infinity obtaining a new free boundary problem, which has been recently studied in Zhou et al. (J Eng Math 2017. https://doi.org/10.1007/s10665-017-9921-y).
NASA Astrophysics Data System (ADS)
Suthikarnnarunai, N.; Olinick, E.
2009-01-01
We present a case study on the application of techniques for solving the Vehicle Routing Problem (VRP) to improve the transportation service provided by the University of The Thai Chamber of Commerce to its staff. The problem is modeled as VRP with time windows, split deliveries, and a mixed fleet. An exact algorithm and a heuristic solution procedure are developed to solve the problem and implemented in the AMPL modeling language and CPLEX Integer Programming solver. Empirical results indicate that the heuristic can find relatively good solutions in a small fraction of the time required by the exact method. We also perform sensitivity analysis and find that a savings in outsourcing cost can be achieved with a small increase in vehicle capacity.
Iso-geometric analysis for neutron diffusion problems
DOE Office of Scientific and Technical Information (OSTI.GOV)
Hall, S. K.; Eaton, M. D.; Williams, M. M. R.
Iso-geometric analysis can be viewed as a generalisation of the finite element method. It permits the exact representation of a wider range of geometries including conic sections. This is possible due to the use of concepts employed in computer-aided design. The underlying mathematical representations from computer-aided design are used to capture both the geometry and approximate the solution. In this paper the neutron diffusion equation is solved using iso-geometric analysis. The practical advantages are highlighted by looking at the problem of a circular fuel pin in a square moderator. For this problem the finite element method requires the geometry tomore » be approximated. This leads to errors in the shape and size of the interface between the fuel and the moderator. In contrast to this iso-geometric analysis allows the interface to be represented exactly. It is found that, due to a cancellation of errors, the finite element method converges more quickly than iso-geometric analysis for this problem. A fuel pin in a vacuum was then considered as this problem is highly sensitive to the leakage across the interface. In this case iso-geometric analysis greatly outperforms the finite element method. Due to the improvement in the representation of the geometry iso-geometric analysis can outperform traditional finite element methods. It is proposed that the use of iso-geometric analysis on neutron transport problems will allow deterministic solutions to be obtained for exact geometries. Something that is only currently possible with Monte Carlo techniques. (authors)« less
Measuring Timber Truck Loads With Image Processing In Paper Mills
NASA Astrophysics Data System (ADS)
Silva, M. Santos; Carvalho, Fernando D.; Rodrigues, F. Carvalho; Goncalves, Ana N. R.
1989-04-01
The raw material for the paper industry is wood. To have an exact account of the stock of piled sawn tree trunks every truck load entering the plant's stockyard must be measured as to the amount of wood being brought in. Weighting down the trucks has its own problems, mainly, due to the high capacity of the tree trunks to absorb water. This problem is further enhanced when calculations must be made to arrive at the mass of sawn tree trunks which must go into the process of producing a certain quantity of paper pulp. The method presented here is based on two fixed cameras which take the image of the truck load. One takes a view of the trunks in order to get information on the average length of the tree trunks. The other obtains a side view which is digitised and by just discriminating against a grey level the area covered by the tree trunk cross section is measured. A simple arithmetic operation gives the volume of wood in the trunk. The same computer, a PC, will register the trucks particulars is almost independent of weather the wood is wet or dry and it serves trucks of any size.
NASA Astrophysics Data System (ADS)
Zhou, Y.-B.; Li, X.-F.
2018-07-01
The electroelastic problem related to two collinear cracks of equal length and normal to the boundaries of a one-dimensional hexagonal piezoelectric quasicrystal layer is analysed. By using the finite Fourier transform, a mixed boundary value problem is solved when antiplane mechanical loading and inplane electric loading are applied. The problem is reduce to triple series equations, which are then transformed to a singular integral equation. For uniform remote loading, an exact solution is obtained in closed form, and explicit expressions for the electroelastic field are determined. The intensity factors of the electroelastic field and the energy release rate at the inner and outer crack tips are given and presented graphically.
An Exact, Compressible One-Dimensional Riemann Solver for General, Convex Equations of State
DOE Office of Scientific and Technical Information (OSTI.GOV)
Kamm, James Russell
2015-03-05
This note describes an algorithm with which to compute numerical solutions to the one- dimensional, Cartesian Riemann problem for compressible flow with general, convex equations of state. While high-level descriptions of this approach are to be found in the literature, this note contains most of the necessary details required to write software for this problem. This explanation corresponds to the approach used in the source code that evaluates solutions for the 1D, Cartesian Riemann problem with a JWL equation of state in the ExactPack package [16, 29]. Numerical examples are given with the proposed computational approach for a polytropic equationmore » of state and for the JWL equation of state.« less
Exact analytical solution to a transient conjugate heat-transfer problem
NASA Technical Reports Server (NTRS)
Sucec, J.
1973-01-01
An exact analytical solution is found for laminar, constant-property, slug flow over a thin plate which is also convectively cooled from below. The solution is found by means of two successive Laplace transformations when a transient in the plate and the fluid is initiated by a step change in the fluid inlet temperature. The exact solution yields the transient fluid temperature, surface heat flux, and surface temperature distributions. The results of the exact transient solution for the surface heat flux are compared to the quasi-steady values, and a criterion for the validity of the quasi-steady results is found. Also the effect of the plate coupling parameter on the surface heat flux are investigated.
NASA Astrophysics Data System (ADS)
Akram, Ghazala; Mahak, Nadia
2018-06-01
The nonlinear Schrödinger equation (NLSE) with the aid of three order dispersion terms is investigated to find the exact solutions via the extended (G'/G2)-expansion method and the first integral method. Many exact traveling wave solutions, such as trigonometric, hyperbolic, rational, soliton and complex function solutions, are characterized with some free parameters of the problem studied. It is corroborated that the proposed techniques are manageable, straightforward and powerful tools to find the exact solutions of nonlinear partial differential equations (PDEs). Some figures are plotted to describe the propagation of traveling wave solutions expressed by the hyperbolic functions, trigonometric functions and rational functions.
The exact fundamental solution for the Benes tracking problem
NASA Astrophysics Data System (ADS)
Balaji, Bhashyam
2009-05-01
The universal continuous-discrete tracking problem requires the solution of a Fokker-Planck-Kolmogorov forward equation (FPKfe) for an arbitrary initial condition. Using results from quantum mechanics, the exact fundamental solution for the FPKfe is derived for the state model of arbitrary dimension with Benes drift that requires only the computation of elementary transcendental functions and standard linear algebra techniques- no ordinary or partial differential equations need to be solved. The measurement process may be an arbitrary, discrete-time nonlinear stochastic process, and the time step size can be arbitrary. Numerical examples are included, demonstrating its utility in practical implementation.
Guidance of Nonlinear Nonminimum-Phase Dynamic Systems
NASA Technical Reports Server (NTRS)
Devasia, Santosh
1996-01-01
The research work has advanced the inversion-based guidance theory for: systems with non-hyperbolic internal dynamics; systems with parameter jumps; and systems where a redesign of the output trajectory is desired. A technique to achieve output tracking for nonminimum phase linear systems with non-hyperbolic and near non-hyperbolic internal dynamics was developed. This approach integrated stable inversion techniques, that achieve exact-tracking, with approximation techniques, that modify the internal dynamics to achieve desirable performance. Such modification of the internal dynamics was used (a) to remove non-hyperbolicity which is an obstruction to applying stable inversion techniques and (b) to reduce large preactuation times needed to apply stable inversion for near non-hyperbolic cases. The method was applied to an example helicopter hover control problem with near non-hyperbolic internal dynamics for illustrating the trade-off between exact tracking and reduction of preactuation time. Future work will extend these results to guidance of nonlinear non-hyperbolic systems. The exact output tracking problem for systems with parameter jumps was considered. Necessary and sufficient conditions were derived for the elimination of switching-introduced output transient. While previous works had studied this problem by developing a regulator that maintains exact tracking through parameter jumps (switches), such techniques are, however, only applicable to minimum-phase systems. In contrast, our approach is also applicable to nonminimum-phase systems and leads to bounded but possibly non-causal solutions. In addition, for the case when the reference trajectories are generated by an exosystem, we developed an exact-tracking controller which could be written in a feedback form. As in standard regulator theory, we also obtained a linear map from the states of the exosystem to the desired system state, which was defined via a matrix differential equation.
Second Computational Aeroacoustics (CAA) Workshop on Benchmark Problems
NASA Technical Reports Server (NTRS)
Tam, C. K. W. (Editor); Hardin, J. C. (Editor)
1997-01-01
The proceedings of the Second Computational Aeroacoustics (CAA) Workshop on Benchmark Problems held at Florida State University are the subject of this report. For this workshop, problems arising in typical industrial applications of CAA were chosen. Comparisons between numerical solutions and exact solutions are presented where possible.
Math Is Not a Problem...When You Know How to Visualize It.
ERIC Educational Resources Information Center
Nelson, Dennis W.
1983-01-01
Visualization is an effective technique for determining exactly what students must do to solve a mathematics problem. Pictures and charts can be used to help children understand which mathematics facts are present and which are missing--an important step toward problem solving. (PP)
DOE Office of Scientific and Technical Information (OSTI.GOV)
Schulze-Halberg, Axel, E-mail: xbataxel@gmail.com; García-Ravelo, Jesús; Pacheco-García, Christian
We consider the Schrödinger equation in the Thomas–Fermi field, a model that has been used for describing electron systems in δ-doped semiconductors. It is shown that the problem becomes exactly-solvable if a particular effective (position-dependent) mass distribution is incorporated. Orthogonal sets of normalizable bound state solutions are constructed in explicit form, and the associated energies are determined. We compare our results with the corresponding findings on the constant-mass problem discussed by Ioriatti (1990) [13]. -- Highlights: ► We introduce an exactly solvable, position-dependent mass model for the Thomas–Fermi potential. ► Orthogonal sets of solutions to our model are constructed inmore » closed form. ► Relation to delta-doped semiconductors is discussed. ► Explicit subband bottom energies are calculated and compared to results obtained in a previous study.« less
NASA Astrophysics Data System (ADS)
Pipkins, Daniel Scott
Two diverse topics of relevance in modern computational mechanics are treated. The first involves the modeling of linear and non-linear wave propagation in flexible, lattice structures. The technique used combines the Laplace Transform with the Finite Element Method (FEM). The procedure is to transform the governing differential equations and boundary conditions into the transform domain where the FEM formulation is carried out. For linear problems, the transformed differential equations can be solved exactly, hence the method is exact. As a result, each member of the lattice structure is modeled using only one element. In the non-linear problem, the method is no longer exact. The approximation introduced is a spatial discretization of the transformed non-linear terms. The non-linear terms are represented in the transform domain by making use of the complex convolution theorem. A weak formulation of the resulting transformed non-linear equations yields a set of element level matrix equations. The trial and test functions used in the weak formulation correspond to the exact solution of the linear part of the transformed governing differential equation. Numerical results are presented for both linear and non-linear systems. The linear systems modeled are longitudinal and torsional rods and Bernoulli-Euler and Timoshenko beams. For non-linear systems, a viscoelastic rod and Von Karman type beam are modeled. The second topic is the analysis of plates and shallow shells under-going finite deflections by the Field/Boundary Element Method. Numerical results are presented for two plate problems. The first is the bifurcation problem associated with a square plate having free boundaries which is loaded by four, self equilibrating corner forces. The results are compared to two existing numerical solutions of the problem which differ substantially.
Introductory Course Based on a Single Problem: Learning Nucleic Acid Biochemistry from AIDS Research
ERIC Educational Resources Information Center
Grover, Neena
2004-01-01
In departure from the standard approach of using several problems to cover specific topics in a class, I use a single problem to cover the contents of the entire semester-equivalent biochemistry classes. I have developed a problem-based service-learning (PBSL) problem on HIV/AIDS to cover nucleic acid concepts that are typically taught in the…
Exact and Metaheuristic Approaches for a Bi-Objective School Bus Scheduling Problem.
Chen, Xiaopan; Kong, Yunfeng; Dang, Lanxue; Hou, Yane; Ye, Xinyue
2015-01-01
As a class of hard combinatorial optimization problems, the school bus routing problem has received considerable attention in the last decades. For a multi-school system, given the bus trips for each school, the school bus scheduling problem aims at optimizing bus schedules to serve all the trips within the school time windows. In this paper, we propose two approaches for solving the bi-objective school bus scheduling problem: an exact method of mixed integer programming (MIP) and a metaheuristic method which combines simulated annealing with local search. We develop MIP formulations for homogenous and heterogeneous fleet problems respectively and solve the models by MIP solver CPLEX. The bus type-based formulation for heterogeneous fleet problem reduces the model complexity in terms of the number of decision variables and constraints. The metaheuristic method is a two-stage framework for minimizing the number of buses to be used as well as the total travel distance of buses. We evaluate the proposed MIP and the metaheuristic method on two benchmark datasets, showing that on both instances, our metaheuristic method significantly outperforms the respective state-of-the-art methods.
Projectile Motion Gets the Hose
ERIC Educational Resources Information Center
Goff, John Eric; Liyanage, Chinthaka
2011-01-01
Students take a weekly quiz in our introductory physics course. During the week in which material focused on projectile motion, we not-so-subtly suggested what problem the students would see on the quiz. The quiz problem was an almost exact replica of a homework problem we worked through in the class preceding the quiz. The goal of the problem is…
Parameterized Algorithmics for Finding Exact Solutions of NP-Hard Biological Problems.
Hüffner, Falk; Komusiewicz, Christian; Niedermeier, Rolf; Wernicke, Sebastian
2017-01-01
Fixed-parameter algorithms are designed to efficiently find optimal solutions to some computationally hard (NP-hard) problems by identifying and exploiting "small" problem-specific parameters. We survey practical techniques to develop such algorithms. Each technique is introduced and supported by case studies of applications to biological problems, with additional pointers to experimental results.
Numerical integration techniques for curved-element discretizations of molecule-solvent interfaces.
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.
Laplace Boundary-Value Problem in Paraboloidal Coordinates
ERIC Educational Resources Information Center
Duggen, L.; Willatzen, M.; Voon, L. C. Lew Yan
2012-01-01
This paper illustrates both a problem in mathematical physics, whereby the method of separation of variables, while applicable, leads to three ordinary differential equations that remain fully coupled via two separation constants and a five-term recurrence relation for series solutions, and an exactly solvable problem in electrostatics, as a…
Solution of the Eshelby problem in gradient elasticity for multilayer spherical inclusions
NASA Astrophysics Data System (ADS)
Volkov-Bogorodskii, D. B.; Lurie, S. A.
2016-03-01
We consider gradient models of elasticity which permit taking into account the characteristic scale parameters of the material. We prove the Papkovich-Neuber theorems, which determine the general form of the gradient solution and the structure of scale effects. We derive the Eshelby integral formula for the gradient moduli of elasticity, which plays the role of the closing equation in the self-consistent three-phase method. In the gradient theory of deformations, we consider the fundamental Eshelby-Christensen problem of determining the effective elastic properties of dispersed composites with spherical inclusions; the exact solution of this problem for classical models was obtained in 1976. This paper is the first to present the exact analytical solution of the Eshelby-Christensen problem for the gradient theory, which permits estimating the influence of scale effects on the stress state and the effective properties of the dispersed composites under study.We also analyze the influence of scale factors.
NASA Astrophysics Data System (ADS)
Wang, Wenlong; Mandrà, Salvatore; Katzgraber, Helmut
We propose a patch planting heuristic that allows us to create arbitrarily-large Ising spin-glass instances on any topology and with any type of disorder, and where the exact ground-state energy of the problem is known by construction. By breaking up the problem into patches that can be treated either with exact or heuristic solvers, we can reconstruct the optimum of the original, considerably larger, problem. The scaling of the computational complexity of these instances with various patch numbers and sizes is investigated and compared with random instances using population annealing Monte Carlo and quantum annealing on the D-Wave 2X quantum annealer. The method can be useful for benchmarking of novel computing technologies and algorithms. NSF-DMR-1208046 and the Office of the Director of National Intelligence (ODNI), Intelligence Advanced Research Projects Activity (IARPA), via MIT Lincoln Laboratory Air Force Contract No. FA8721-05-C-0002.
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.
10 CFR 709.12 - Defining polygraph examination questions.
Code of Federal Regulations, 2010 CFR
2010-01-01
... Protection of National Security § 709.12 Defining polygraph examination questions. The examiner determines the exact wording of the polygraph questions based on the examiner's pretest interview of the covered... 10 Energy 4 2010-01-01 2010-01-01 false Defining polygraph examination questions. 709.12 Section...
10 CFR 709.12 - Defining polygraph examination questions.
Code of Federal Regulations, 2011 CFR
2011-01-01
... Protection of National Security § 709.12 Defining polygraph examination questions. The examiner determines the exact wording of the polygraph questions based on the examiner's pretest interview of the covered... 10 Energy 4 2011-01-01 2011-01-01 false Defining polygraph examination questions. 709.12 Section...
NASA Astrophysics Data System (ADS)
Zhuravlev, V. M.
2017-09-01
Models for the dynamics of a dust-like medium in the self-gravity field are investigated. Solutions of the corresponding problems are constructed by the method of hydrodynamic substitutions generalizing the Cole-Hopf substitutions. The method is extended to multidimensional ideal and viscous fluid flows with cylindrical and spherical symmetries for which exact solutions are constructed. Solutions for the dynamics of self-gravitating dust with arbitrary initial distributions of both fluid density and velocity are constructed using special coordinate transformations. In particular, the problem of cosmological expansion is considered in terms of Newton's gravity theory. Models of a one-dimensional viscous dust fluid flow and some problems of gas hydrodynamics are considered. Examples of exact solutions and their brief analysis are provided.
Sets meeting isometric copies of the lattice Z2 in exactly one point
Jackson, Steve; Mauldin, R. Daniel
2002-01-01
The construction of a subset S of ℝ2 such that each isometric copy of ℤ2 (the lattice points in the plane) meets S in exactly one point is indicated. This provides a positive answer to a problem of H. Steinhaus [Sierpiński, W. (1958) Fund. Math. 46, 191–194]. PMID:12466499
The calculating hemispheres: studies of a split-brain patient.
Funnell, Margaret G; Colvin, Mary K; Gazzaniga, Michael S
2007-06-11
The purpose of the study was to investigate simple calculation in the two cerebral hemispheres of a split-brain patient. In a series of four experiments, the left hemisphere was superior to the right in simple calculation, confirming the previously reported left hemisphere specialization for calculation. In two different recognition paradigms, right hemisphere performance was at chance for all arithmetic operations, with the exception of subtraction in a two-alternative forced choice paradigm (performance was at chance when the lure differed from the correct answer by a magnitude of 1 but above chance when the magnitude difference was 4). In a recall paradigm, the right hemisphere performed above chance for both addition and subtraction, but performed at chance levels for multiplication and division. The error patterns in that experiment suggested that for subtraction and addition, the right hemisphere does have some capacity for approximating the solution even when it is unable to generate the exact solution. Furthermore, right hemisphere accuracy in addition and subtraction was higher for problems with small operands than with large operands. An additional experiment assessed approximate and exact addition in the two hemispheres for problems with small and large operands. The left hemisphere was equally accurate in both tasks but the right hemisphere was more accurate in approximate addition than in exact addition. In exact addition, right hemisphere accuracy was higher for problems with small operands than large, but the opposite pattern was found for approximate addition.
The Dynamic Multi-objective Multi-vehicle Covering Tour Problem
2013-06-01
AI Artificial Intelligence AUV Autonomous Underwater Vehicle CLP Clover Leaf Problem CSP Covering Salesman Problem CTP Covering Tour Problem CVRP...introduces a new formalization - the DMOMCTP. Related works from routing problems, Artificial Intelligence ( AI ), and MOPs are discussed briefly. As a...the rest of that framework being replaced. The codebase differs from jMetal 4.2 in that it can handle the time and DM dependent nature of the DMOMCTP
An outer approximation method for the road network design problem
2018-01-01
Best investment in the road infrastructure or the network design is perceived as a fundamental and benchmark problem in transportation. Given a set of candidate road projects with associated costs, finding the best subset with respect to a limited budget is known as a bilevel Discrete Network Design Problem (DNDP) of NP-hard computationally complexity. We engage with the complexity with a hybrid exact-heuristic methodology based on a two-stage relaxation as follows: (i) the bilevel feature is relaxed to a single-level problem by taking the network performance function of the upper level into the user equilibrium traffic assignment problem (UE-TAP) in the lower level as a constraint. It results in a mixed-integer nonlinear programming (MINLP) problem which is then solved using the Outer Approximation (OA) algorithm (ii) we further relax the multi-commodity UE-TAP to a single-commodity MILP problem, that is, the multiple OD pairs are aggregated to a single OD pair. This methodology has two main advantages: (i) the method is proven to be highly efficient to solve the DNDP for a large-sized network of Winnipeg, Canada. The results suggest that within a limited number of iterations (as termination criterion), global optimum solutions are quickly reached in most of the cases; otherwise, good solutions (close to global optimum solutions) are found in early iterations. Comparative analysis of the networks of Gao and Sioux-Falls shows that for such a non-exact method the global optimum solutions are found in fewer iterations than those found in some analytically exact algorithms in the literature. (ii) Integration of the objective function among the constraints provides a commensurate capability to tackle the multi-objective (or multi-criteria) DNDP as well. PMID:29590111
An outer approximation method for the road network design problem.
Asadi Bagloee, Saeed; Sarvi, Majid
2018-01-01
Best investment in the road infrastructure or the network design is perceived as a fundamental and benchmark problem in transportation. Given a set of candidate road projects with associated costs, finding the best subset with respect to a limited budget is known as a bilevel Discrete Network Design Problem (DNDP) of NP-hard computationally complexity. We engage with the complexity with a hybrid exact-heuristic methodology based on a two-stage relaxation as follows: (i) the bilevel feature is relaxed to a single-level problem by taking the network performance function of the upper level into the user equilibrium traffic assignment problem (UE-TAP) in the lower level as a constraint. It results in a mixed-integer nonlinear programming (MINLP) problem which is then solved using the Outer Approximation (OA) algorithm (ii) we further relax the multi-commodity UE-TAP to a single-commodity MILP problem, that is, the multiple OD pairs are aggregated to a single OD pair. This methodology has two main advantages: (i) the method is proven to be highly efficient to solve the DNDP for a large-sized network of Winnipeg, Canada. The results suggest that within a limited number of iterations (as termination criterion), global optimum solutions are quickly reached in most of the cases; otherwise, good solutions (close to global optimum solutions) are found in early iterations. Comparative analysis of the networks of Gao and Sioux-Falls shows that for such a non-exact method the global optimum solutions are found in fewer iterations than those found in some analytically exact algorithms in the literature. (ii) Integration of the objective function among the constraints provides a commensurate capability to tackle the multi-objective (or multi-criteria) DNDP as well.
The TSP-approach to approximate solving the m-Cycles Cover Problem
NASA Astrophysics Data System (ADS)
Gimadi, Edward Kh.; Rykov, Ivan; Tsidulko, Oxana
2016-10-01
In the m-Cycles Cover problem it is required to find a collection of m vertex-disjoint cycles that covers all vertices of the graph and the total weight of edges in the cover is minimum (or maximum). The problem is a generalization of the Traveling salesmen problem. It is strongly NP-hard. We discuss a TSP-approach that gives polynomial approximate solutions for this problem. It transforms an approximation TSP algorithm into an approximation m-CCP algorithm. In this paper we present a number of successful transformations with proven performance guarantees for the obtained solutions.
An agglomerative hierarchical clustering approach to visualisation in Bayesian clustering problems
Dawson, Kevin J.; Belkhir, Khalid
2009-01-01
Clustering problems (including the clustering of individuals into outcrossing populations, hybrid generations, full-sib families and selfing lines) have recently received much attention in population genetics. In these clustering problems, the parameter of interest is a partition of the set of sampled individuals, - the sample partition. In a fully Bayesian approach to clustering problems of this type, our knowledge about the sample partition is represented by a probability distribution on the space of possible sample partitions. Since the number of possible partitions grows very rapidly with the sample size, we can not visualise this probability distribution in its entirety, unless the sample is very small. As a solution to this visualisation problem, we recommend using an agglomerative hierarchical clustering algorithm, which we call the exact linkage algorithm. This algorithm is a special case of the maximin clustering algorithm that we introduced previously. The exact linkage algorithm is now implemented in our software package Partition View. The exact linkage algorithm takes the posterior co-assignment probabilities as input, and yields as output a rooted binary tree, - or more generally, a forest of such trees. Each node of this forest defines a set of individuals, and the node height is the posterior co-assignment probability of this set. This provides a useful visual representation of the uncertainty associated with the assignment of individuals to categories. It is also a useful starting point for a more detailed exploration of the posterior distribution in terms of the co-assignment probabilities. PMID:19337306
On local search for bi-objective knapsack problems.
Liefooghe, Arnaud; Paquete, Luís; Figueira, José Rui
2013-01-01
In this article, a local search approach is proposed for three variants of the bi-objective binary knapsack problem, with the aim of maximizing the total profit and minimizing the total weight. First, an experimental study on a given structural property of connectedness of the efficient set is conducted. Based on this property, a local search algorithm is proposed and its performance is compared to exact algorithms in terms of runtime and quality metrics. The experimental results indicate that this simple local search algorithm is able to find a representative set of optimal solutions in most of the cases, and in much less time than exact algorithms.
Explore or Exploit? A Generic Model and an Exactly Solvable Case
NASA Astrophysics Data System (ADS)
Gueudré, Thomas; Dobrinevski, Alexander; Bouchaud, Jean-Philippe
2014-02-01
Finding a good compromise between the exploitation of known resources and the exploration of unknown, but potentially more profitable choices, is a general problem, which arises in many different scientific disciplines. We propose a stylized model for these exploration-exploitation situations, including population or economic growth, portfolio optimization, evolutionary dynamics, or the problem of optimal pinning of vortices or dislocations in disordered materials. We find the exact growth rate of this model for treelike geometries and prove the existence of an optimal migration rate in this case. Numerical simulations in the one-dimensional case confirm the generic existence of an optimum.
Equilibrium polymerization on the equivalent-neighbor lattice
NASA Technical Reports Server (NTRS)
Kaufman, Miron
1989-01-01
The equilibrium polymerization problem is solved exactly on the equivalent-neighbor lattice. The Flory-Huggins (Flory, 1986) entropy of mixing is exact for this lattice. The discrete version of the n-vector model is verified when n approaches 0 is equivalent to the equal reactivity polymerization process in the whole parameter space, including the polymerized phase. The polymerization processes for polymers satisfying the Schulz (1939) distribution exhibit nonuniversal critical behavior. A close analogy is found between the polymerization problem of index the Schulz r and the Bose-Einstein ideal gas in d = -2r dimensions, with the critical polymerization corresponding to the Bose-Einstein condensation.
ANALYZING NUMERICAL ERRORS IN DOMAIN HEAT TRANSPORT MODELS USING THE CVBEM.
Hromadka, T.V.
1987-01-01
Besides providing an exact solution for steady-state heat conduction processes (Laplace-Poisson equations), the CVBEM (complex variable boundary element method) can be used for the numerical error analysis of domain model solutions. For problems where soil-water phase change latent heat effects dominate the thermal regime, heat transport can be approximately modeled as a time-stepped steady-state condition in the thawed and frozen regions, respectively. The CVBEM provides an exact solution of the two-dimensional steady-state heat transport problem, and also provides the error in matching the prescribed boundary conditions by the development of a modeling error distribution or an approximate boundary generation.
Some Exact Results for the Schroedinger Wave Equation with a Time Dependent Potential
NASA Technical Reports Server (NTRS)
Campbell, Joel
2009-01-01
The time dependent Schroedinger equation with a time dependent delta function potential is solved exactly for many special cases. In all other cases the problem can be reduced to an integral equation of the Volterra type. It is shown that by knowing the wave function at the origin, one may derive the wave function everywhere. Thus, the problem is reduced from a PDE in two variables to an integral equation in one. These results are used to compare adiabatic versus sudden changes in the potential. It is shown that adiabatic changes in the p otential lead to conservation of the normalization of the probability density.
Explore or exploit? A generic model and an exactly solvable case.
Gueudré, Thomas; Dobrinevski, Alexander; Bouchaud, Jean-Philippe
2014-02-07
Finding a good compromise between the exploitation of known resources and the exploration of unknown, but potentially more profitable choices, is a general problem, which arises in many different scientific disciplines. We propose a stylized model for these exploration-exploitation situations, including population or economic growth, portfolio optimization, evolutionary dynamics, or the problem of optimal pinning of vortices or dislocations in disordered materials. We find the exact growth rate of this model for treelike geometries and prove the existence of an optimal migration rate in this case. Numerical simulations in the one-dimensional case confirm the generic existence of an optimum.
Fully Nonlinear Modeling and Analysis of Precision Membranes
NASA Technical Reports Server (NTRS)
Pai, P. Frank; Young, Leyland G.
2003-01-01
High precision membranes are used in many current space applications. This paper presents a fully nonlinear membrane theory with forward and inverse analyses of high precision membrane structures. The fully nonlinear membrane theory is derived from Jaumann strains and stresses, exact coordinate transformations, the concept of local relative displacements, and orthogonal virtual rotations. In this theory, energy and Newtonian formulations are fully correlated, and every structural term can be interpreted in terms of vectors. Fully nonlinear ordinary differential equations (ODES) governing the large static deformations of known axisymmetric membranes under known axisymmetric loading (i.e., forward problems) are presented as first-order ODES, and a method for obtaining numerically exact solutions using the multiple shooting procedure is shown. A method for obtaining the undeformed geometry of any axisymmetric membrane with a known inflated geometry and a known internal pressure (i.e., inverse problems) is also derived. Numerical results from forward analysis are verified using results in the literature, and results from inverse analysis are verified using known exact solutions and solutions from the forward analysis. Results show that the membrane theory and the proposed numerical methods for solving nonlinear forward and inverse membrane problems are accurate.
NASA Astrophysics Data System (ADS)
Wang, Y. B.; Zhu, X. W.; Dai, H. H.
2016-08-01
Though widely used in modelling nano- and micro- structures, Eringen's differential model shows some inconsistencies and recent study has demonstrated its differences between the integral model, which then implies the necessity of using the latter model. In this paper, an analytical study is taken to analyze static bending of nonlocal Euler-Bernoulli beams using Eringen's two-phase local/nonlocal model. Firstly, a reduction method is proved rigorously, with which the integral equation in consideration can be reduced to a differential equation with mixed boundary value conditions. Then, the static bending problem is formulated and four types of boundary conditions with various loadings are considered. By solving the corresponding differential equations, exact solutions are obtained explicitly in all of the cases, especially for the paradoxical cantilever beam problem. Finally, asymptotic analysis of the exact solutions reveals clearly that, unlike the differential model, the integral model adopted herein has a consistent softening effect. Comparisons are also made with existing analytical and numerical results, which further shows the advantages of the analytical results obtained. Additionally, it seems that the once controversial nonlocal bar problem in the literature is well resolved by the reduction method.
Monotonic Derivative Correction for Calculation of Supersonic Flows
ERIC Educational Resources Information Center
Bulat, Pavel V.; Volkov, Konstantin N.
2016-01-01
Aim of the study: This study examines numerical methods for solving the problems in gas dynamics, which are based on an exact or approximate solution to the problem of breakdown of an arbitrary discontinuity (the Riemann problem). Results: Comparative analysis of finite difference schemes for the Euler equations integration is conducted on the…
Preventing Serious Conduct Problems in School-Age Youth: The Fast Track Program
ERIC Educational Resources Information Center
Slough, Nancy M.; McMahon, Robert J.; Bierman, Karen L.; Coie, John D.; Dodge, Kenneth A.; Foster, E. Michael; Greenberg, Mark T.; Lochman, John E.; McMahon, Robert J.; Pinderhughes, Ellen E.
2008-01-01
Children with early-starting conduct problems have a very poor prognosis and exact a high cost to society. The Fast Track project is a multisite, collaborative research project investigating the efficacy of a comprehensive, long-term, multicomponent intervention designed to "prevent" the development of serious conduct problems in high-risk…
7 CFR 3405.11 - Content of a proposal.
Code of Federal Regulations, 2010 CFR
2010-01-01
... Agriculture Regulations of the Department of Agriculture (Continued) COOPERATIVE STATE RESEARCH, EDUCATION...) The title of the project shown on the “Higher Education Proposal Cover Page” must be brief (80... institution, the targeted need area(s), and the title of the proposal must be identified exactly as shown on...
Application of the maximal covering location problem to habitat reserve site selection: a review
Stephanie A. Snyder; Robert G. Haight
2016-01-01
The Maximal Covering Location Problem (MCLP) is a classic model from the location science literature which has found wide application. One important application is to a fundamental problem in conservation biology, the Maximum Covering Species Problem (MCSP), which identifies land parcels to protect to maximize the number of species represented in the selected sites. We...
NASA Technical Reports Server (NTRS)
Reimers, J. R.; Heller, E. J.
1985-01-01
Exact eigenfunctions for a two-dimensional rigid rotor are obtained using Gaussian wave packet dynamics. The wave functions are obtained by propagating, without approximation, an infinite set of Gaussian wave packets that collectively have the correct periodicity, being coherent states appropriate to this rotational problem. This result leads to a numerical method for the semiclassical calculation of rovibrational, molecular eigenstates. Also, a simple, almost classical, approximation to full wave packet dynamics is shown to give exact results: this leads to an a posteriori justification of the De Leon-Heller spectral quantization method.
Better ILP models for haplotype assembly.
Etemadi, Maryam; Bagherian, Mehri; Chen, Zhi-Zhong; Wang, Lusheng
2018-02-19
The haplotype assembly problem for diploid is to find a pair of haplotypes from a given set of aligned Single Nucleotide Polymorphism (SNP) fragments (reads). It has many applications in association studies, drug design, and genetic research. Since this problem is computationally hard, both heuristic and exact algorithms have been designed for it. Although exact algorithms are much slower, they are still of great interest because they usually output significantly better solutions than heuristic algorithms in terms of popular measures such as the Minimum Error Correction (MEC) score, the number of switch errors, and the QAN50 score. Exact algorithms are also valuable because they can be used to witness how good a heuristic algorithm is. The best known exact algorithm is based on integer linear programming (ILP) and it is known that ILP can also be used to improve the output quality of every heuristic algorithm with a little decline in speed. Therefore, faster ILP models for the problem are highly demanded. As in previous studies, we consider not only the general case of the problem but also its all-heterozygous case where we assume that if a column of the input read matrix contains at least one 0 and one 1, then it corresponds to a heterozygous SNP site. For both cases, we design new ILP models for the haplotype assembly problem which aim at minimizing the MEC score. The new models are theoretically better because they contain significantly fewer constraints. More importantly, our experimental results show that for both simulated and real datasets, the new model for the all-heterozygous (respectively, general) case can usually be solved via CPLEX (an ILP solver) at least 5 times (respectively, twice) faster than the previous bests. Indeed, the running time can sometimes be 41 times better. This paper proposes a new ILP model for the haplotype assembly problem and its all-heterozygous case, respectively. Experiments with both real and simulated datasets show that the new models can be solved within much shorter time by CPLEX than the previous bests. We believe that the models can be used to improve heuristic algorithms as well.
A hybrid heuristic for the multiple choice multidimensional knapsack problem
NASA Astrophysics Data System (ADS)
Mansi, Raïd; Alves, Cláudio; Valério de Carvalho, J. M.; Hanafi, Saïd
2013-08-01
In this article, a new solution approach for the multiple choice multidimensional knapsack problem is described. The problem is a variant of the multidimensional knapsack problem where items are divided into classes, and exactly one item per class has to be chosen. Both problems are NP-hard. However, the multiple choice multidimensional knapsack problem appears to be more difficult to solve in part because of its choice constraints. Many real applications lead to very large scale multiple choice multidimensional knapsack problems that can hardly be addressed using exact algorithms. A new hybrid heuristic is proposed that embeds several new procedures for this problem. The approach is based on the resolution of linear programming relaxations of the problem and reduced problems that are obtained by fixing some variables of the problem. The solutions of these problems are used to update the global lower and upper bounds for the optimal solution value. A new strategy for defining the reduced problems is explored, together with a new family of cuts and a reformulation procedure that is used at each iteration to improve the performance of the heuristic. An extensive set of computational experiments is reported for benchmark instances from the literature and for a large set of hard instances generated randomly. The results show that the approach outperforms other state-of-the-art methods described so far, providing the best known solution for a significant number of benchmark instances.
NASA Technical Reports Server (NTRS)
Lebedeff, S. A.; Hameed, S.
1975-01-01
The problem investigated can be solved exactly in a simple manner if the equations are written in terms of a similarity variable. The exact solution is used to explore two questions of interest in the modelling of urban air pollution, taking into account the distribution of surface concentration downwind of an area source and the distribution of concentration with height.
Proper temperature of the Schwarzschild AdS black hole revisited
NASA Astrophysics Data System (ADS)
Eune, Myungseok; Kim, Wontae
2017-10-01
The Unruh temperature calculated by using the global embedding of the Schwarzschild AdS spacetime into the Minkowski spacetime was identified with the local proper temperature; however, it became imaginary in a certain region outside the event horizon. So, the temperature was assumed to be zero of non-thermal radiation for that region. In this work, we revisit this issue in an exactly soluble two-dimensional Schwarzschild AdS black hole and present an alternative resolution to this problem in terms of the Tolman's procedure. However, the process appears to be non-trivial in the sense that the original procedure assuming the traceless energy-momentum tensor should be extended in such a way that it should cover the non-vanishing case of the energy-momentum tensor in the presence of the trace anomaly. Consequently, we show that the proper temperature turns out to be real everywhere outside the event horizon without any imaginary value, in particular, it vanishes at both the horizon and the asymptotic infinity.
Sim, Jaehyun; Sim, Jun; Park, Eunsung; Lee, Julian
2015-06-01
Many proteins undergo large-scale motions where relatively rigid domains move against each other. The identification of rigid domains, as well as the hinge residues important for their relative movements, is important for various applications including flexible docking simulations. In this work, we develop a method for protein rigid domain identification based on an exhaustive enumeration of maximal rigid domains, the rigid domains not fully contained within other domains. The computation is performed by mapping the problem to that of finding maximal cliques in a graph. A minimal set of rigid domains are then selected, which cover most of the protein with minimal overlap. In contrast to the results of existing methods that partition a protein into non-overlapping domains using approximate algorithms, the rigid domains obtained from exact enumeration naturally contain overlapping regions, which correspond to the hinges of the inter-domain bending motion. The performance of the algorithm is demonstrated on several proteins. © 2015 Wiley Periodicals, Inc.
Optimal shortening of uniform covering arrays
Rangel-Valdez, Nelson; Avila-George, Himer; Carrizalez-Turrubiates, Oscar
2017-01-01
Software test suites based on the concept of interaction testing are very useful for testing software components in an economical way. Test suites of this kind may be created using mathematical objects called covering arrays. A covering array, denoted by CA(N; t, k, v), is an N × k array over Zv={0,…,v-1} with the property that every N × t sub-array covers all t-tuples of Zvt at least once. Covering arrays can be used to test systems in which failures occur as a result of interactions among components or subsystems. They are often used in areas such as hardware Trojan detection, software testing, and network design. Because system testing is expensive, it is critical to reduce the amount of testing required. This paper addresses the Optimal Shortening of Covering ARrays (OSCAR) problem, an optimization problem whose objective is to construct, from an existing covering array matrix of uniform level, an array with dimensions of (N − δ) × (k − Δ) such that the number of missing t-tuples is minimized. Two applications of the OSCAR problem are (a) to produce smaller covering arrays from larger ones and (b) to obtain quasi-covering arrays (covering arrays in which the number of missing t-tuples is small) to be used as input to a meta-heuristic algorithm that produces covering arrays. In addition, it is proven that the OSCAR problem is NP-complete, and twelve different algorithms are proposed to solve it. An experiment was performed on 62 problem instances, and the results demonstrate the effectiveness of solving the OSCAR problem to facilitate the construction of new covering arrays. PMID:29267343
ERIC Educational Resources Information Center
Öllinger, Michael; Jones, Gary; Faber, Amory H.; Knoblich, Günther
2013-01-01
The 8-coin insight problem requires the problem solver to move 2 coins so that each coin touches exactly 3 others. Ormerod, MacGregor, and Chronicle (2002) explained differences in task performance across different versions of the 8-coin problem using the availability of particular moves in a 2-dimensional search space. We explored 2 further…
Exact and Metaheuristic Approaches for a Bi-Objective School Bus Scheduling Problem
Chen, Xiaopan; Kong, Yunfeng; Dang, Lanxue; Hou, Yane; Ye, Xinyue
2015-01-01
As a class of hard combinatorial optimization problems, the school bus routing problem has received considerable attention in the last decades. For a multi-school system, given the bus trips for each school, the school bus scheduling problem aims at optimizing bus schedules to serve all the trips within the school time windows. In this paper, we propose two approaches for solving the bi-objective school bus scheduling problem: an exact method of mixed integer programming (MIP) and a metaheuristic method which combines simulated annealing with local search. We develop MIP formulations for homogenous and heterogeneous fleet problems respectively and solve the models by MIP solver CPLEX. The bus type-based formulation for heterogeneous fleet problem reduces the model complexity in terms of the number of decision variables and constraints. The metaheuristic method is a two-stage framework for minimizing the number of buses to be used as well as the total travel distance of buses. We evaluate the proposed MIP and the metaheuristic method on two benchmark datasets, showing that on both instances, our metaheuristic method significantly outperforms the respective state-of-the-art methods. PMID:26176764
Smith, Kyle K G; Poulsen, Jens Aage; Nyman, Gunnar; Rossky, Peter J
2015-06-28
We develop two classes of quasi-classical dynamics that are shown to conserve the initial quantum ensemble when used in combination with the Feynman-Kleinert approximation of the density operator. These dynamics are used to improve the Feynman-Kleinert implementation of the classical Wigner approximation for the evaluation of quantum time correlation functions known as Feynman-Kleinert linearized path-integral. As shown, both classes of dynamics are able to recover the exact classical and high temperature limits of the quantum time correlation function, while a subset is able to recover the exact harmonic limit. A comparison of the approximate quantum time correlation functions obtained from both classes of dynamics is made with the exact results for the challenging model problems of the quartic and double-well potentials. It is found that these dynamics provide a great improvement over the classical Wigner approximation, in which purely classical dynamics are used. In a special case, our first method becomes identical to centroid molecular dynamics.
A multidomain spectral collocation method for the Stokes problem
NASA Technical Reports Server (NTRS)
Landriani, G. Sacchi; Vandeven, H.
1989-01-01
A multidomain spectral collocation scheme is proposed for the approximation of the two-dimensional Stokes problem. It is shown that the discrete velocity vector field is exactly divergence-free and we prove error estimates both for the velocity and the pressure.
NASA Astrophysics Data System (ADS)
Kahl, Annelen; Dujardin, Jérôme; Dupuis, Sonia; Lehning, Michael
2017-04-01
One of the major problems with solar PV in the context of a fully renewable electricity production at mid-latitudes is the trend of higher production in summer and lower production in winter. This trend is most often exactly opposite to demand patterns, causing a seasonal mismatch that requires extensive balancing power from other production sources or large storage capacities. Which possibilities do we have to bring PV production into closer correlation with demand? This question motivated our research and in response we investigated the effects of placing PV panels at different tilt angles in regions with extensive snow cover to increase winter production from ground reflected short wave radiation. The aim of this project is therefore to quantify the effect of varying snow cover duration (SCD) and of panel tilt angle on the annual total production and on production during winter months when electricity is most needed. We chose Switzerland as ideal test site, because it has a wide range of snow cover conditions and a high potential for renewable electricity production. But methods can be applied to other regions of comparable conditions for snow cover and irradiance. Our analysis can be separated into two steps: 1. A systematic, GIS and satellite-based analysis for all of Switzerland: We use time series of satellite-derived irradiance, and snow cover characteristics together with land surface cover types and elevation information to quantify the environmental conditions and to estimate potential production and ideal tilt angles. 2. A scenario-based analysis that contrasts the production patterns of different placement scenarios for PV panels in urban, rural and mountainous areas. We invoke a model of a fully renewable electricity system (including Switzerland's large hydropower system) at national level to compute the electricity import and storage capacity that will be required to balance the remaining mismatch between production and demand to further illuminate trade-offs between the different placement scenarios. Our results show that in regions with extended periods of snow cover the winter production can be 10% higher without sacrifices on the annual total production. This helps significantly in reducing the energy gap mentioned above; annual required import can be lowered by 10%-20% and forced export due to overproduction during summer months reduces to less than half.
NASA Astrophysics Data System (ADS)
Anjos, Pedro H. A.; Lira, Sérgio A.; Miranda, José A.
2018-04-01
We examine the formation of interfacial patterns when a magnetic liquid droplet (ferrofluid, or a magnetorheological fluid), surrounded by a nonmagnetic fluid, is subjected to a radial magnetic field in a Hele-Shaw cell. By using a vortex-sheet formalism, we find exact stationary solutions for the fluid-fluid interface in the form of n -fold polygonal shapes. A weakly nonlinear, mode-coupling method is then utilized to find time-evolving perturbative solutions for the interfacial patterns. The stability of such nonzero surface tension exact solutions is checked and discussed, by trying to systematically approach the exact stationary shapes through perturbative solutions containing an increasingly larger number of participating Fourier modes. Our results indicate that the exact stationary solutions of the problem are stable, and that a good matching between exact and perturbative shape solutions is achieved just by using a few Fourier modes. The stability of such solutions is substantiated by a linearization process close to the stationary shape, where a system of mode-coupling equations is diagonalized, determining the eigenvalues which dictate the stability of a fixed point.
Numerical Integration Techniques for Curved-Element Discretizations of Molecule–Solvent Interfaces
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
Analysis of Algorithms: Coping with Hard Problems
ERIC Educational Resources Information Center
Kolata, Gina Bari
1974-01-01
Although today's computers can perform as many as one million operations per second, there are many problems that are still too large to be solved in a straightforward manner. Recent work indicates that many approximate solutions are useful and more efficient than exact solutions. (Author/RH)
NASA Technical Reports Server (NTRS)
Akhundova, E. A.; Dodonov, V. V.; Manko, V. I.
1993-01-01
The exact expressions for density matrix and Wigner functions of quantum systems are known only in special cases. Corresponding Hamiltonians are quadratic forms of Euclidean coordinates and momenta. In this paper we consider the problem of one-dimensional free particle movement in the bounded region 0 is less than x is less than a (including the case a = infinity).
Gully erosion in Madagascar: causes and impacts
NASA Astrophysics Data System (ADS)
Raveloson, Andrea; Székely, Balázs; Visnovitz, Ferenc
2017-04-01
Soil erosion has been recognized as the main cause of land degradation worldwide and gully erosion is currently considered as one of the most impressive and striking erosion type. This global environmental problem has numerous causes (both natural and anthropogenic) and inflict serious socio-economic problems all around the world. The present study aims to discuss the occurrence and environmental issues related to lavakization in Madagascar and its impact on landscape (badland formation), land use management, flora and fauna, infrastructures, soil properties and human life itself. We assembled and reviewed lavaka researches since 1953. Exact location of the field surveys, cited triggering factors and results of these scientific papers have been studied in detail and compared with our data collected using satellite imagery. Lavaka distribution was analyzed using GIS methods and the relation between their density and different factors was studied. An overview of the many contributing factors (climate, topography, geology, vegetation cover, fault systems, tectonism and land use including inappropriate cultivation and irrigation systems) is given in order to better understand lavaka formation, distribution and impacts. Synthesis of previous researches might help us define area susceptible to gully formation. This can be used to determine prevention priorities for farmers, to manage their lands sustainably. This is ILARG contribution 18.
The marriage problem and the fate of bachelors
NASA Astrophysics Data System (ADS)
Nieuwenhuizen, Th. M.
In the marriage problem, a variant of the bi-parted matching problem, each member has a “wish-list” expressing his/her preference for all possible partners; this list consists of random, positive real numbers drawn from a certain distribution. One searches the lowest cost for the society, at the risk of breaking up pairs in the course of time. Minimization of a global cost function (Hamiltonian) is performed with statistical mechanics techniques at a finite fictitious temperature. The problem is generalized to include bachelors, needed in particular when the groups have different size, and polygamy. Exact solutions are found for the optimal solution ( T=0). The entropy is found to vanish quadratically in T. Also, other evidence is found that the replica symmetric solution is exact, implying at most a polynomial degeneracy of the optimal solution. Whether bachelors occur or not, depends not only on their intrinsic qualities, or lack thereof, but also on global aspects of the chance for pair formation in society.
General form of a cooperative gradual maximal covering location problem
NASA Astrophysics Data System (ADS)
Bagherinejad, Jafar; Bashiri, Mahdi; Nikzad, Hamideh
2018-07-01
Cooperative and gradual covering are two new methods for developing covering location models. In this paper, a cooperative maximal covering location-allocation model is developed (CMCLAP). In addition, both cooperative and gradual covering concepts are applied to the maximal covering location simultaneously (CGMCLP). Then, we develop an integrated form of a cooperative gradual maximal covering location problem, which is called a general CGMCLP. By setting the model parameters, the proposed general model can easily be transformed into other existing models, facilitating general comparisons. The proposed models are developed without allocation for physical signals and with allocation for non-physical signals in discrete location space. Comparison of the previously introduced gradual maximal covering location problem (GMCLP) and cooperative maximal covering location problem (CMCLP) models with our proposed CGMCLP model in similar data sets shows that the proposed model can cover more demands and acts more efficiently. Sensitivity analyses are performed to show the effect of related parameters and the model's validity. Simulated annealing (SA) and a tabu search (TS) are proposed as solution algorithms for the developed models for large-sized instances. The results show that the proposed algorithms are efficient solution approaches, considering solution quality and running time.
Accurate and Efficient Approximation to the Optimized Effective Potential for Exchange
NASA Astrophysics Data System (ADS)
Ryabinkin, Ilya G.; Kananenka, Alexei A.; Staroverov, Viktor N.
2013-07-01
We devise an efficient practical method for computing the Kohn-Sham exchange-correlation potential corresponding to a Hartree-Fock electron density. This potential is almost indistinguishable from the exact-exchange optimized effective potential (OEP) and, when used as an approximation to the OEP, is vastly better than all existing models. Using our method one can obtain unambiguous, nearly exact OEPs for any reasonable finite one-electron basis set at the same low cost as the Krieger-Li-Iafrate and Becke-Johnson potentials. For all practical purposes, this solves the long-standing problem of black-box construction of OEPs in exact-exchange calculations.
What can Robots Do? Towards Theoretical Analysis
NASA Technical Reports Server (NTRS)
Nogueira, Monica
1997-01-01
Robots have become more and more sophisticated. Every robot has its limits. If we face a task that existing robots cannot solve, then, before we start improving these robots, it is important to check whether it is, in principle, possible to design a robot for this task or not. For that, it is necessary to describe what exactly the robots can, in principle, do. A similar problem - to describe what exactly computers can do - has been solved as early as 1936, by Turing. In this paper, we describe a framework within which we can, hopefully, formalize and answer the question of what exactly robots can do.
NASA Technical Reports Server (NTRS)
Bartels, Robert E.
2002-01-01
A variable order method of integrating initial value ordinary differential equations that is based on the state transition matrix has been developed. The method has been evaluated for linear time variant and nonlinear systems of equations. While it is more complex than most other methods, it produces exact solutions at arbitrary time step size when the time variation of the system can be modeled exactly by a polynomial. Solutions to several nonlinear problems exhibiting chaotic behavior have been computed. Accuracy of the method has been demonstrated by comparison with an exact solution and with solutions obtained by established methods.
Self-similar solutions to isothermal shock problems
NASA Astrophysics Data System (ADS)
Deschner, Stephan C.; Illenseer, Tobias F.; Duschl, Wolfgang J.
We investigate exact solutions for isothermal shock problems in different one-dimensional geometries. These solutions are given as analytical expressions if possible, or are computed using standard numerical methods for solving ordinary differential equations. We test the numerical solutions against the analytical expressions to verify the correctness of all numerical algorithms. We use similarity methods to derive a system of ordinary differential equations (ODE) yielding exact solutions for power law density distributions as initial conditions. Further, the system of ODEs accounts for implosion problems (IP) as well as explosion problems (EP) by changing the initial or boundary conditions, respectively. Taking genuinely isothermal approximations into account leads to additional insights of EPs in contrast to earlier models. We neglect a constant initial energy contribution but introduce a parameter to adjust the initial mass distribution of the system. Moreover, we show that due to this parameter a constant initial density is not allowed for isothermal EPs. Reasonable restrictions for this parameter are given. Both, the (genuinely) isothermal implosion as well as the explosion problem are solved for the first time.
Redundancy allocation problem for k-out-of- n systems with a choice of redundancy strategies
NASA Astrophysics Data System (ADS)
Aghaei, Mahsa; Zeinal Hamadani, Ali; Abouei Ardakan, Mostafa
2017-03-01
To increase the reliability of a specific system, using redundant components is a common method which is called redundancy allocation problem (RAP). Some of the RAP studies have focused on k-out-of- n systems. However, all of these studies assumed predetermined active or standby strategies for each subsystem. In this paper, for the first time, we propose a k-out-of- n system with a choice of redundancy strategies. Therefore, a k-out-of- n series-parallel system is considered when the redundancy strategy can be chosen for each subsystem. In other words, in the proposed model, the redundancy strategy is considered as an additional decision variable and an exact method based on integer programming is used to obtain the optimal solution of the problem. As the optimization of RAP belongs to the NP-hard class of problems, a modified version of genetic algorithm (GA) is also developed. The exact method and the proposed GA are implemented on a well-known test problem and the results demonstrate the efficiency of the new approach compared with the previous studies.
Kolkata Restaurant Problem as a Generalised El Farol Bar Problem
NASA Astrophysics Data System (ADS)
Chakrabarti, Bikas K.
Generalisation of the El Farol bar problem to that of many bars here leads to the Kolkata restaurant problem, where the decision to go to any restaurant or not is much simpler (depending on the previous experience of course, as in the El Farol bar problem). This generalised problem can be exactly analysed in some limiting cases discussed here. The fluctuation in the restaurant service can be shown to have precisely an inverse cubic behavior, as widely seen in the stock market fluctuations.
Elastic-plastic analysis of annular plate problems using NASTRAN
NASA Technical Reports Server (NTRS)
Chen, P. C. T.
1983-01-01
The plate elements of the NASTRAN code are used to analyze two annular plate problems loaded beyond the elastic limit. The first problem is an elastic-plastic annular plate loaded externally by two concentrated forces. The second problem is stressed radially by uniform internal pressure for which an exact analytical solution is available. A comparison of the two approaches together with an assessment of the NASTRAN code is given.
Generalized Buneman Pruning for Inferring the Most Parsimonious Multi-state Phylogeny
NASA Astrophysics Data System (ADS)
Misra, Navodit; Blelloch, Guy; Ravi, R.; Schwartz, Russell
Accurate reconstruction of phylogenies remains a key challenge in evolutionary biology. Most biologically plausible formulations of the problem are formally NP-hard, with no known efficient solution. The standard in practice are fast heuristic methods that are empirically known to work very well in general, but can yield results arbitrarily far from optimal. Practical exact methods, which yield exponential worst-case running times but generally much better times in practice, provide an important alternative. We report progress in this direction by introducing a provably optimal method for the weighted multi-state maximum parsimony phylogeny problem. The method is based on generalizing the notion of the Buneman graph, a construction key to efficient exact methods for binary sequences, so as to apply to sequences with arbitrary finite numbers of states with arbitrary state transition weights. We implement an integer linear programming (ILP) method for the multi-state problem using this generalized Buneman graph and demonstrate that the resulting method is able to solve data sets that are intractable by prior exact methods in run times comparable with popular heuristics. Our work provides the first method for provably optimal maximum parsimony phylogeny inference that is practical for multi-state data sets of more than a few characters.
Reformulation of the covering and quantizer problems as ground states of interacting particles.
Torquato, S
2010-11-01
It is known that the sphere-packing problem and the number-variance problem (closely related to an optimization problem in number theory) can be posed as energy minimizations associated with an infinite number of point particles in d-dimensional Euclidean space R(d) interacting via certain repulsive pair potentials. We reformulate the covering and quantizer problems as the determination of the ground states of interacting particles in R(d) that generally involve single-body, two-body, three-body, and higher-body interactions. This is done by linking the covering and quantizer problems to certain optimization problems involving the "void" nearest-neighbor functions that arise in the theory of random media and statistical mechanics. These reformulations, which again exemplify the deep interplay between geometry and physics, allow one now to employ theoretical and numerical optimization techniques to analyze and solve these energy minimization problems. The covering and quantizer problems have relevance in numerous applications, including wireless communication network layouts, the search of high-dimensional data parameter spaces, stereotactic radiation therapy, data compression, digital communications, meshing of space for numerical analysis, and coding and cryptography, among other examples. In the first three space dimensions, the best known solutions of the sphere-packing and number-variance problems (or their "dual" solutions) are directly related to those of the covering and quantizer problems, but such relationships may or may not exist for d≥4 , depending on the peculiarities of the dimensions involved. Our reformulation sheds light on the reasons for these similarities and differences. We also show that disordered saturated sphere packings provide relatively thin (economical) coverings and may yield thinner coverings than the best known lattice coverings in sufficiently large dimensions. In the case of the quantizer problem, we derive improved upper bounds on the quantizer error using sphere-packing solutions, which are generally substantially sharper than an existing upper bound in low to moderately large dimensions. We also demonstrate that disordered saturated sphere packings yield relatively good quantizers. Finally, we remark on possible applications of our results for the detection of gravitational waves.
Reformulation of the covering and quantizer problems as ground states of interacting particles
NASA Astrophysics Data System (ADS)
Torquato, S.
2010-11-01
It is known that the sphere-packing problem and the number-variance problem (closely related to an optimization problem in number theory) can be posed as energy minimizations associated with an infinite number of point particles in d -dimensional Euclidean space Rd interacting via certain repulsive pair potentials. We reformulate the covering and quantizer problems as the determination of the ground states of interacting particles in Rd that generally involve single-body, two-body, three-body, and higher-body interactions. This is done by linking the covering and quantizer problems to certain optimization problems involving the “void” nearest-neighbor functions that arise in the theory of random media and statistical mechanics. These reformulations, which again exemplify the deep interplay between geometry and physics, allow one now to employ theoretical and numerical optimization techniques to analyze and solve these energy minimization problems. The covering and quantizer problems have relevance in numerous applications, including wireless communication network layouts, the search of high-dimensional data parameter spaces, stereotactic radiation therapy, data compression, digital communications, meshing of space for numerical analysis, and coding and cryptography, among other examples. In the first three space dimensions, the best known solutions of the sphere-packing and number-variance problems (or their “dual” solutions) are directly related to those of the covering and quantizer problems, but such relationships may or may not exist for d≥4 , depending on the peculiarities of the dimensions involved. Our reformulation sheds light on the reasons for these similarities and differences. We also show that disordered saturated sphere packings provide relatively thin (economical) coverings and may yield thinner coverings than the best known lattice coverings in sufficiently large dimensions. In the case of the quantizer problem, we derive improved upper bounds on the quantizer error using sphere-packing solutions, which are generally substantially sharper than an existing upper bound in low to moderately large dimensions. We also demonstrate that disordered saturated sphere packings yield relatively good quantizers. Finally, we remark on possible applications of our results for the detection of gravitational waves.
Green's function enriched Poisson solver for electrostatics in many-particle systems
NASA Astrophysics Data System (ADS)
Sutmann, Godehard
2016-06-01
A highly accurate method is presented for the construction of the charge density for the solution of the Poisson equation in particle simulations. The method is based on an operator adjusted source term which can be shown to produce exact results up to numerical precision in the case of a large support of the charge distribution, therefore compensating the discretization error of finite difference schemes. This is achieved by balancing an exact representation of the known Green's function of regularized electrostatic problem with a discretized representation of the Laplace operator. It is shown that the exact calculation of the potential is possible independent of the order of the finite difference scheme but the computational efficiency for higher order methods is found to be superior due to a faster convergence to the exact result as a function of the charge support.
Asymptotic analysis on a pseudo-Hermitian Riemann-zeta Hamiltonian
NASA Astrophysics Data System (ADS)
Bender, Carl M.; Brody, Dorje C.
2018-04-01
The differential-equation eigenvalue problem associated with a recently-introduced Hamiltonian, whose eigenvalues correspond to the zeros of the Riemann zeta function, is analyzed using Fourier and WKB analysis. The Fourier analysis leads to a challenging open problem concerning the formulation of the eigenvalue problem in the momentum space. The WKB analysis gives the exact asymptotic behavior of the eigenfunction.
Exact Maximum-Entropy Estimation with Feynman Diagrams
NASA Astrophysics Data System (ADS)
Netser Zernik, Amitai; Schlank, Tomer M.; Tessler, Ran J.
2018-02-01
A longstanding open problem in statistics is finding an explicit expression for the probability measure which maximizes entropy with respect to given constraints. In this paper a solution to this problem is found, using perturbative Feynman calculus. The explicit expression is given as a sum over weighted trees.
Some New Twists to Problems Involving the Gaussian Probability Integral
NASA Technical Reports Server (NTRS)
Simon, Marvin K.; Divsalar, Dariush
1997-01-01
Using an alternate form of the Gaussian probability integral discovered a number of years ago, it is shown that the solution to a number of previously considered communication problems can be simplified and in some cases made more accurate(i.e., exact rather than bounded).
Tag SNP selection via a genetic algorithm.
Mahdevar, Ghasem; Zahiri, Javad; Sadeghi, Mehdi; Nowzari-Dalini, Abbas; Ahrabian, Hayedeh
2010-10-01
Single Nucleotide Polymorphisms (SNPs) provide valuable information on human evolutionary history and may lead us to identify genetic variants responsible for human complex diseases. Unfortunately, molecular haplotyping methods are costly, laborious, and time consuming; therefore, algorithms for constructing full haplotype patterns from small available data through computational methods, Tag SNP selection problem, are convenient and attractive. This problem is proved to be an NP-hard problem, so heuristic methods may be useful. In this paper we present a heuristic method based on genetic algorithm to find reasonable solution within acceptable time. The algorithm was tested on a variety of simulated and experimental data. In comparison with the exact algorithm, based on brute force approach, results show that our method can obtain optimal solutions in almost all cases and runs much faster than exact algorithm when the number of SNP sites is large. Our software is available upon request to the corresponding author.
A spectral mimetic least-squares method
DOE Office of Scientific and Technical Information (OSTI.GOV)
Bochev, Pavel; Gerritsma, Marc
We present a spectral mimetic least-squares method for a model diffusion–reaction problem, which preserves key conservation properties of the continuum problem. Casting the model problem into a first-order system for two scalar and two vector variables shifts material properties from the differential equations to a pair of constitutive relations. We also use this system to motivate a new least-squares functional involving all four fields and show that its minimizer satisfies the differential equations exactly. Discretization of the four-field least-squares functional by spectral spaces compatible with the differential operators leads to a least-squares method in which the differential equations are alsomore » satisfied exactly. Additionally, the latter are reduced to purely topological relationships for the degrees of freedom that can be satisfied without reference to basis functions. Furthermore, numerical experiments confirm the spectral accuracy of the method and its local conservation.« less
A spectral mimetic least-squares method
Bochev, Pavel; Gerritsma, Marc
2014-09-01
We present a spectral mimetic least-squares method for a model diffusion–reaction problem, which preserves key conservation properties of the continuum problem. Casting the model problem into a first-order system for two scalar and two vector variables shifts material properties from the differential equations to a pair of constitutive relations. We also use this system to motivate a new least-squares functional involving all four fields and show that its minimizer satisfies the differential equations exactly. Discretization of the four-field least-squares functional by spectral spaces compatible with the differential operators leads to a least-squares method in which the differential equations are alsomore » satisfied exactly. Additionally, the latter are reduced to purely topological relationships for the degrees of freedom that can be satisfied without reference to basis functions. Furthermore, numerical experiments confirm the spectral accuracy of the method and its local conservation.« less
Crossflow effects on the growth rate of inviscid Goertler vortices in a hypersonic boundary layer
NASA Technical Reports Server (NTRS)
Fu, Yibin; Hall, Philip
1992-01-01
The effects of crossflow on the growth rate of inviscid Goertler vortices in a hypersonic boundary layer with pressure gradient are studied. Attention is focused on the inviscid mode trapped in the temperature adjustment layer; this mode has greater growth rate than any other mode. The eigenvalue problem which governs the relationship between the growth rate, the crossflow amplitude, and the wavenumber is solved numerically, and the results are then used to clarify the effects of crossflow on the growth rate of inviscid Goertler vortices. It is shown that crossflow effects on Goertler vortices are fundamentally different for incompressible and hypersonic flows. The neutral mode eigenvalue problem is found to have an exact solution, and as a by-product, we have also found the exact solution to a neutral mode eigenvalue problem which was formulated, but unsolved before, by Bassom and Hall (1991).
Exact and approximate graph matching using random walks.
Gori, Marco; Maggini, Marco; Sarti, Lorenzo
2005-07-01
In this paper, we propose a general framework for graph matching which is suitable for different problems of pattern recognition. The pattern representation we assume is at the same time highly structured, like for classic syntactic and structural approaches, and of subsymbolic nature with real-valued features, like for connectionist and statistic approaches. We show that random walk based models, inspired by Google's PageRank, give rise to a spectral theory that nicely enhances the graph topological features at node level. As a straightforward consequence, we derive a polynomial algorithm for the classic graph isomorphism problem, under the restriction of dealing with Markovian spectrally distinguishable graphs (MSD), a class of graphs that does not seem to be easily reducible to others proposed in the literature. The experimental results that we found on different test-beds of the TC-15 graph database show that the defined MSD class "almost always" covers the database, and that the proposed algorithm is significantly more efficient than top scoring VF algorithm on the same data. Most interestingly, the proposed approach is very well-suited for dealing with partial and approximate graph matching problems, derived for instance from image retrieval tasks. We consider the objects of the COIL-100 visual collection and provide a graph-based representation, whose node's labels contain appropriate visual features. We show that the adoption of classic bipartite graph matching algorithms offers a straightforward generalization of the algorithm given for graph isomorphism and, finally, we report very promising experimental results on the COIL-100 visual collection.
Efficient exact motif discovery.
Marschall, Tobias; Rahmann, Sven
2009-06-15
The motif discovery problem consists of finding over-represented patterns in a collection of biosequences. It is one of the classical sequence analysis problems, but still has not been satisfactorily solved in an exact and efficient manner. This is partly due to the large number of possibilities of defining the motif search space and the notion of over-representation. Even for well-defined formalizations, the problem is frequently solved in an ad hoc manner with heuristics that do not guarantee to find the best motif. We show how to solve the motif discovery problem (almost) exactly on a practically relevant space of IUPAC generalized string patterns, using the p-value with respect to an i.i.d. model or a Markov model as the measure of over-representation. In particular, (i) we use a highly accurate compound Poisson approximation for the null distribution of the number of motif occurrences. We show how to compute the exact clump size distribution using a recently introduced device called probabilistic arithmetic automaton (PAA). (ii) We define two p-value scores for over-representation, the first one based on the total number of motif occurrences, the second one based on the number of sequences in a collection with at least one occurrence. (iii) We describe an algorithm to discover the optimal pattern with respect to either of the scores. The method exploits monotonicity properties of the compound Poisson approximation and is by orders of magnitude faster than exhaustive enumeration of IUPAC strings (11.8 h compared with an extrapolated runtime of 4.8 years). (iv) We justify the use of the proposed scores for motif discovery by showing our method to outperform other motif discovery algorithms (e.g. MEME, Weeder) on benchmark datasets. We also propose new motifs on Mycobacterium tuberculosis. The method has been implemented in Java. It can be obtained from http://ls11-www.cs.tu-dortmund.de/people/marschal/paa_md/.
Human Performance on Hard Non-Euclidean Graph Problems: Vertex Cover
ERIC Educational Resources Information Center
Carruthers, Sarah; Masson, Michael E. J.; Stege, Ulrike
2012-01-01
Recent studies on a computationally hard visual optimization problem, the Traveling Salesperson Problem (TSP), indicate that humans are capable of finding close to optimal solutions in near-linear time. The current study is a preliminary step in investigating human performance on another hard problem, the Minimum Vertex Cover Problem, in which…
RADARSAT: The Antarctic Mapping Project
NASA Technical Reports Server (NTRS)
Jezek, Kenneth C.; Lindstrom, E. (Technical Monitor)
2002-01-01
The first Antarctic Imaging Campaign (AIC) occurred during the period September 9, 1997 through October 20, 1997. The AIC utilized the unique attributes of the Canadian RADARSAT-1 to acquire the first, high-resolution, synthetic aperture imagery covering the entire Antarctic Continent. Although the primary goal of the mission was the acquisition of image data, the nearly flawless execution of the mission enabled additional collections of exact repeat orbit data. These data, covering an extensive portion of the interior Antarctic, potentially are suitable for interferometric analysis of topography and surface velocity. This document summarizes the Project through completion with delivery of products to the NASA DAACs.
Replication of Psycholinguistic Experiments and the Resolution of Inconsistencies
ERIC Educational Resources Information Center
Rákosi, Csilla
2017-01-01
Non-exact replications are regarded as effective tools of problem solving in psycholinguistic research because they lead to more plausible experimental results; however, they are also ineffective tools of problem solving because they trigger cumulative contradictions among different replications of an experiment. This paper intends to resolve this…
Y2K for Librarians: Exactly What You Need To Do.
ERIC Educational Resources Information Center
Doering, William
1999-01-01
Addresses how libraries can prepare for Y2K problems. Discusses technology that might be affected and equipment that should be examined, difficulty of fixing noncompliant hardware and software, identifying problem areas and developing solutions, and dealing with vendors. Includes a checklist of necessary preparations. (AEF)
On Evaluating Human Problem Solving of Computationally Hard Problems
ERIC Educational Resources Information Center
Carruthers, Sarah; Stege, Ulrike
2013-01-01
This article is concerned with how computer science, and more exactly computational complexity theory, can inform cognitive science. In particular, we suggest factors to be taken into account when investigating how people deal with computational hardness. This discussion will address the two upper levels of Marr's Level Theory: the computational…
Exact simulation of max-stable processes.
Dombry, Clément; Engelke, Sebastian; Oesting, Marco
2016-06-01
Max-stable processes play an important role as models for spatial extreme events. Their complex structure as the pointwise maximum over an infinite number of random functions makes their simulation difficult. Algorithms based on finite approximations are often inexact and computationally inefficient. We present a new algorithm for exact simulation of a max-stable process at a finite number of locations. It relies on the idea of simulating only the extremal functions, that is, those functions in the construction of a max-stable process that effectively contribute to the pointwise maximum. We further generalize the algorithm by Dieker & Mikosch (2015) for Brown-Resnick processes and use it for exact simulation via the spectral measure. We study the complexity of both algorithms, prove that our new approach via extremal functions is always more efficient, and provide closed-form expressions for their implementation that cover most popular models for max-stable processes and multivariate extreme value distributions. For simulation on dense grids, an adaptive design of the extremal function algorithm is proposed.
A Path Algorithm for Constrained Estimation
Zhou, Hua; Lange, Kenneth
2013-01-01
Many least-square problems involve affine equality and inequality constraints. Although there are a variety of methods for solving such problems, most statisticians find constrained estimation challenging. The current article proposes a new path-following algorithm for quadratic programming that replaces hard constraints by what are called exact penalties. Similar penalties arise in l1 regularization in model selection. In the regularization setting, penalties encapsulate prior knowledge, and penalized parameter estimates represent a trade-off between the observed data and the prior knowledge. Classical penalty methods of optimization, such as the quadratic penalty method, solve a sequence of unconstrained problems that put greater and greater stress on meeting the constraints. In the limit as the penalty constant tends to ∞, one recovers the constrained solution. In the exact penalty method, squared penalties!are replaced by absolute value penalties, and the solution is recovered for a finite value of the penalty constant. The exact path-following method starts at the unconstrained solution and follows the solution path as the penalty constant increases. In the process, the solution path hits, slides along, and exits from the various constraints. Path following in Lasso penalized regression, in contrast, starts with a large value of the penalty constant and works its way downward. In both settings, inspection of the entire solution path is revealing. Just as with the Lasso and generalized Lasso, it is possible to plot the effective degrees of freedom along the solution path. For a strictly convex quadratic program, the exact penalty algorithm can be framed entirely in terms of the sweep operator of regression analysis. A few well-chosen examples illustrate the mechanics and potential of path following. This article has supplementary materials available online. PMID:24039382
Asymptotically Exact Solution of the Problem of Harmonic Vibrations of an Elastic Parallelepiped
NASA Astrophysics Data System (ADS)
Papkov, S. O.
2017-11-01
An asymptotically exact solution of the classical problem of elasticity about the steadystate forced vibrations of an elastic rectangular parallelepiped is constructed. The general solution of the vibration equations is constructed in the form of double Fourier series with undetermined coefficients, and an infinite system of linear algebraic equations is obtained for determining these coefficients. An analysis of the infinite system permits determining the asymptotics of the unknowns which are used to convolve the double series in both equations of the infinite systems and the displacement and stress components. The efficiency of this approach is illustrated by numerical examples and comparison with known solutions. The spectrum of the parallelepiped symmetric vibrations is studied for various ratios of its sides.
Solving Math Problems Approximately: A Developmental Perspective
Ganor-Stern, Dana
2016-01-01
Although solving arithmetic problems approximately is an important skill in everyday life, little is known about the development of this skill. Past research has shown that when children are asked to solve multi-digit multiplication problems approximately, they provide estimates that are often very far from the exact answer. This is unfortunate as computation estimation is needed in many circumstances in daily life. The present study examined 4th graders, 6th graders and adults’ ability to estimate the results of arithmetic problems relative to a reference number. A developmental pattern was observed in accuracy, speed and strategy use. With age there was a general increase in speed, and an increase in accuracy mainly for trials in which the reference number was close to the exact answer. The children tended to use the sense of magnitude strategy, which does not involve any calculation but relies mainly on an intuitive coarse sense of magnitude, while the adults used the approximated calculation strategy which involves rounding and multiplication procedures, and relies to a greater extent on calculation skills and working memory resources. Importantly, the children were less accurate than the adults, but were well above chance level. In all age groups performance was enhanced when the reference number was smaller (vs. larger) than the exact answer and when it was far (vs. close) from it, suggesting the involvement of an approximate number system. The results suggest the existence of an intuitive sense of magnitude for the results of arithmetic problems that might help children and even adults with difficulties in math. The present findings are discussed in the context of past research reporting poor estimation skills among children, and the conditions that might allow using children estimation skills in an effective manner. PMID:27171224
NASA Technical Reports Server (NTRS)
Groves, Curtis E.; Ilie, marcel; Shallhorn, Paul A.
2014-01-01
Computational Fluid Dynamics (CFD) is the standard numerical tool used by Fluid Dynamists to estimate solutions to many problems in academia, government, and industry. CFD is known to have errors and uncertainties and there is no universally adopted method to estimate such quantities. This paper describes an approach to estimate CFD uncertainties strictly numerically using inputs and the Student-T distribution. The approach is compared to an exact analytical solution of fully developed, laminar flow between infinite, stationary plates. It is shown that treating all CFD input parameters as oscillatory uncertainty terms coupled with the Student-T distribution can encompass the exact solution.
Anomalous transport in turbulent plasmas and continuous time random walks
DOE Office of Scientific and Technical Information (OSTI.GOV)
Balescu, R.
1995-05-01
The possibility of a model of anomalous transport problems in a turbulent plasma by a purely stochastic process is investigated. The theory of continuous time random walks (CTRW`s) is briefly reviewed. It is shown that a particular class, called the standard long tail CTRW`s is of special interest for the description of subdiffusive transport. Its evolution is described by a non-Markovian diffusion equation that is constructed in such a way as to yield exact values for all the moments of the density profile. The concept of a CTRW model is compared to an exact solution of a simple test problem:more » transport of charged particles in a fluctuating magnetic field in the limit of infinite perpendicular correlation length. Although the well-known behavior of the mean square displacement proportional to {ital t}{sup 1/2} is easily recovered, the exact density profile cannot be modeled by a CTRW. However, the quasilinear approximation of the kinetic equation has the form of a non-Markovian diffusion equation and can thus be generated by a CTRW.« less
Exact and approximate solutions for transient squeezing flow
NASA Astrophysics Data System (ADS)
Lang, Ji; Santhanam, Sridhar; Wu, Qianhong
2017-10-01
In this paper, we report two novel theoretical approaches to examine a fast-developing flow in a thin fluid gap, which is widely observed in industrial applications and biological systems. The problem is featured by a very small Reynolds number and Strouhal number, making the fluid convective acceleration negligible, while its local acceleration is not. We have developed an exact solution for this problem which shows that the flow starts with an inviscid limit when the viscous effect has no time to appear and is followed by a subsequent developing flow, in which the viscous effect continues to penetrate into the entire fluid gap. An approximate solution is also developed using a boundary layer integral method. This solution precisely captures the general behavior of the transient fluid flow process and agrees very well with the exact solution. We also performed numerical simulation using Ansys-CFX. Excellent agreement between the analytical and the numerical solutions is obtained, indicating the validity of the analytical approaches. The study presented herein fills the gap in the literature and will have a broad impact on industrial and biomedical applications.
NASA Astrophysics Data System (ADS)
Fatekurohman, Mohamat; Nurmala, Nita; Anggraeni, Dian
2018-04-01
Lungs are the most important organ, in the case of respiratory system. Problems related to disorder of the lungs are various, i.e. pneumonia, emphysema, tuberculosis and lung cancer. Comparing all those problems, lung cancer is the most harmful. Considering about that, the aim of this research applies survival analysis and factors affecting the endurance of the lung cancer patient using comparison of exact, Efron and Breslow parameter approach method on hazard ratio and stratified cox regression model. The data applied are based on the medical records of lung cancer patients in Jember Paru-paru hospital on 2016, east java, Indonesia. The factors affecting the endurance of the lung cancer patients can be classified into several criteria, i.e. sex, age, hemoglobin, leukocytes, erythrocytes, sedimentation rate of blood, therapy status, general condition, body weight. The result shows that exact method of stratified cox regression model is better than other. On the other hand, the endurance of the patients is affected by their age and the general conditions.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Agostini, Federica; Abedi, Ali; Suzuki, Yasumitsu
The decomposition of electronic and nuclear motion presented in Abedi et al. [Phys. Rev. Lett. 105, 123002 (2010)] yields a time-dependent potential that drives the nuclear motion and fully accounts for the coupling to the electronic subsystem. Here, we show that propagation of an ensemble of independent classical nuclear trajectories on this exact potential yields dynamics that are essentially indistinguishable from the exact quantum dynamics for a model non-adiabatic charge transfer problem. We point out the importance of step and bump features in the exact potential that are critical in obtaining the correct splitting of the quasiclassical nuclear wave packetmore » in space after it passes through an avoided crossing between two Born-Oppenheimer surfaces and analyze their structure. Finally, an analysis of the exact potentials in the context of trajectory surface hopping is presented, including preliminary investigations of velocity-adjustment and the force-induced decoherence effect.« less
Linearly exact parallel closures for slab geometry
NASA Astrophysics Data System (ADS)
Ji, Jeong-Young; Held, Eric D.; Jhang, Hogun
2013-08-01
Parallel closures are obtained by solving a linearized kinetic equation with a model collision operator using the Fourier transform method. The closures expressed in wave number space are exact for time-dependent linear problems to within the limits of the model collision operator. In the adiabatic, collisionless limit, an inverse Fourier transform is performed to obtain integral (nonlocal) parallel closures in real space; parallel heat flow and viscosity closures for density, temperature, and flow velocity equations replace Braginskii's parallel closure relations, and parallel flow velocity and heat flow closures for density and temperature equations replace Spitzer's parallel transport relations. It is verified that the closures reproduce the exact linear response function of Hammett and Perkins [Phys. Rev. Lett. 64, 3019 (1990)] for Landau damping given a temperature gradient. In contrast to their approximate closures where the vanishing viscosity coefficient numerically gives an exact response, our closures relate the heat flow and nonvanishing viscosity to temperature and flow velocity (gradients).
Exact states in waveguides with periodically modulated nonlinearity
NASA Astrophysics Data System (ADS)
Ding, E.; Chan, H. N.; Chow, K. W.; Nakkeeran, K.; Malomed, B. A.
2017-09-01
We introduce a one-dimensional model based on the nonlinear Schrödinger/Gross-Pitaevskii equation where the local nonlinearity is subject to spatially periodic modulation in terms of the Jacobi {dn} function, with three free parameters including the period, amplitude, and internal form-factor. An exact periodic solution is found for each set of parameters and, which is more important for physical realizations, we solve the inverse problem and predict the period and amplitude of the modulation that yields a particular exact spatially periodic state. A numerical stability analysis demonstrates that the periodic states become modulationally unstable for large periods, and regain stability in the limit of an infinite period, which corresponds to a bright soliton pinned to a localized nonlinearity-modulation pattern. The exact dark-bright soliton complex in a coupled system with a localized modulation structure is also briefly considered. The system can be realized in planar optical waveguides and cigar-shaped atomic Bose-Einstein condensates.
The bilinear complexity and practical algorithms for matrix multiplication
NASA Astrophysics Data System (ADS)
Smirnov, A. V.
2013-12-01
A method for deriving bilinear algorithms for matrix multiplication is proposed. New estimates for the bilinear complexity of a number of problems of the exact and approximate multiplication of rectangular matrices are obtained. In particular, the estimate for the boundary rank of multiplying 3 × 3 matrices is improved and a practical algorithm for the exact multiplication of square n × n matrices is proposed. The asymptotic arithmetic complexity of this algorithm is O( n 2.7743).
Exact solutions to model surface and volume charge distributions
NASA Astrophysics Data System (ADS)
Mukhopadhyay, S.; Majumdar, N.; Bhattacharya, P.; Jash, A.; Bhattacharya, D. S.
2016-10-01
Many important problems in several branches of science and technology deal with charges distributed along a line, over a surface and within a volume. Recently, we have made use of new exact analytic solutions of surface charge distributions to develop the nearly exact Boundary Element Method (neBEM) toolkit. This 3D solver has been successful in removing some of the major drawbacks of the otherwise elegant Green's function approach and has been found to be very accurate throughout the computational domain, including near- and far-field regions. Use of truly distributed singularities (in contrast to nodally concentrated ones) on rectangular and right-triangular elements used for discretizing any three-dimensional geometry has essentially removed many of the numerical and physical singularities associated with the conventional BEM. In this work, we will present this toolkit and the development of several numerical models of space charge based on exact closed-form expressions. In one of the models, Particles on Surface (ParSur), the space charge inside a small elemental volume of any arbitrary shape is represented as being smeared on several surfaces representing the volume. From the studies, it can be concluded that the ParSur model is successful in getting the estimates close to those obtained using the first-principles, especially close to and within the cell. In the paper, we will show initial applications of ParSur and other models in problems related to high energy physics.
Benavides-Varela, Silvia; Butterworth, Brian; Burgio, Francesca; Arcara, Giorgio; Lucangeli, Daniela; Semenza, Carlo
2016-01-01
It is currently accepted that certain activities within the family environment contribute to develop early numerical skills before schooling. However, it is unknown whether this early experience influences both the exact and the approximate representation of numbers, and if so, which is more important for numerical tasks. In the present study the mathematical performance of 110 children (mean age 5 years 11 months) was evaluated using a battery that included tests of approximate and exact numerical abilities, as well as everyday numerical problems. Moreover, children were assessed on their knowledge of number information learned at home. The parents of the participants provided information regarding daily activities of the children and socio-demographic characteristics of the family. The results showed that the amount of numerical information learned at home was a significant predictor of participants' performance on everyday numerical problems and exact number representations, even after taking account of age, memory span and socio-economic and educational status of the family. We also found that particular activities, such as board games, correlate with the children's counting skills, which are foundational for arithmetic. Crucially, tests relying on approximate representations were not predicted by the numerical knowledge acquired at home. The present research supports claims about the importance and nature of home experiences in the child's acquisition of mathematics. PMID:26903902
Bartlett, Rodney J; Musiał, Monika
2006-11-28
The nCC hierarchy of coupled-cluster approximations, where n guarantees exactness for n electrons and all products of n electrons are derived and applied to several illustrative problems. The condition of exactness for n=2 defines nCCSD=2CC, with nCCSDT=3CC and nCCSDTQ=4CC being exact for three and four electrons. To achieve this, the minimum number of diagrams is evaluated, which is less than in the corresponding CC model. For all practical purposes, nCC is also the proper definition of a size-extensive CI. 2CC is also an orbitally invariant coupled electron pair approximation. The numerical results of nCC are close to those for the full CC variant, and in some cases are closer to the full CI reference result. As 2CC is exact for separated electron pairs, it is the natural zeroth-order approximation for the correlation problem in molecules with other effects introduced as these units start to interact. The nCC hierarchy of approximations has all the attractive features of CC including its size extensivity, orbital invariance, and orbital insensitivity, but in a conceptually appealing form suited to bond breaking, while being computationally less demanding. Excited states from the equation of motion (EOM-2CC) are also reported, which show results frequently approaching those of EOM-CCSDT.
Multiple shooting algorithms for jump-discontinuous problems in optimal control and estimation
NASA Technical Reports Server (NTRS)
Mook, D. J.; Lew, Jiann-Shiun
1991-01-01
Multiple shooting algorithms are developed for jump-discontinuous two-point boundary value problems arising in optimal control and optimal estimation. Examples illustrating the origin of such problems are given to motivate the development of the solution algorithms. The algorithms convert the necessary conditions, consisting of differential equations and transversality conditions, into algebraic equations. The solution of the algebraic equations provides exact solutions for linear problems. The existence and uniqueness of the solution are proved.
Caracciolo, Sergio; Sicuro, Gabriele
2014-10-01
We discuss the equivalence relation between the Euclidean bipartite matching problem on the line and on the circumference and the Brownian bridge process on the same domains. The equivalence allows us to compute the correlation function and the optimal cost of the original combinatorial problem in the thermodynamic limit; moreover, we solve also the minimax problem on the line and on the circumference. The properties of the average cost and correlation functions are discussed.
Validation of the SURE Program, phase 1
NASA Technical Reports Server (NTRS)
Dotson, Kelly J.
1987-01-01
Presented are the results of the first phase in the validation of the SURE (Semi-Markov Unreliability Range Evaluator) program. The SURE program gives lower and upper bounds on the death-state probabilities of a semi-Markov model. With these bounds, the reliability of a semi-Markov model of a fault-tolerant computer system can be analyzed. For the first phase in the validation, fifteen semi-Markov models were solved analytically for the exact death-state probabilities and these solutions compared to the corresponding bounds given by SURE. In every case, the SURE bounds covered the exact solution. The bounds, however, had a tendency to separate in cases where the recovery rate was slow or the fault arrival rate was fast.
Exact law for homogeneous compressible Hall magnetohydrodynamics turbulence
NASA Astrophysics Data System (ADS)
Andrés, N.; Galtier, S.; Sahraoui, F.
2018-01-01
We derive an exact law for three-dimensional (3D) homogeneous compressible isothermal Hall magnetohydrodynamic turbulence, without the assumption of isotropy. The Hall current is shown to introduce new flux and source terms that act at the small scales (comparable or smaller than the ion skin depth) to significantly impact the turbulence dynamics. The law provides an accurate means to estimate the energy cascade rate over a broad range of scales covering the magnetohydrodynamic inertial range and the sub-ion dispersive range in 3D numerical simulations and in in situ spacecraft observations of compressible turbulence. This work is particularly relevant to astrophysical flows in which small-scale density fluctuations cannot be ignored such as the solar wind, planetary magnetospheres, and the interstellar medium.
NASA Astrophysics Data System (ADS)
Ren, Zhengyong; Zhong, Yiyuan; Chen, Chaojian; Tang, Jingtian; Kalscheuer, Thomas; Maurer, Hansruedi; Li, Yang
2018-03-01
During the last 20 years, geophysicists have developed great interest in using gravity gradient tensor signals to study bodies of anomalous density in the Earth. Deriving exact solutions of the gravity gradient tensor signals has become a dominating task in exploration geophysics or geodetic fields. In this study, we developed a compact and simple framework to derive exact solutions of gravity gradient tensor measurements for polyhedral bodies, in which the density contrast is represented by a general polynomial function. The polynomial mass contrast can continuously vary in both horizontal and vertical directions. In our framework, the original three-dimensional volume integral of gravity gradient tensor signals is transformed into a set of one-dimensional line integrals along edges of the polyhedral body by sequentially invoking the volume and surface gradient (divergence) theorems. In terms of an orthogonal local coordinate system defined on these edges, exact solutions are derived for these line integrals. We successfully derived a set of unified exact solutions of gravity gradient tensors for constant, linear, quadratic and cubic polynomial orders. The exact solutions for constant and linear cases cover all previously published vertex-type exact solutions of the gravity gradient tensor for a polygonal body, though the associated algorithms may differ in numerical stability. In addition, to our best knowledge, it is the first time that exact solutions of gravity gradient tensor signals are derived for a polyhedral body with a polynomial mass contrast of order higher than one (that is quadratic and cubic orders). Three synthetic models (a prismatic body with depth-dependent density contrasts, an irregular polyhedron with linear density contrast and a tetrahedral body with horizontally and vertically varying density contrasts) are used to verify the correctness and the efficiency of our newly developed closed-form solutions. Excellent agreements are obtained between our solutions and other published exact solutions. In addition, stability tests are performed to demonstrate that our exact solutions can safely be used to detect shallow subsurface targets.
Capturing Students' Abstraction While Solving Organic Reaction Mechanism Problems across a Semester
ERIC Educational Resources Information Center
Weinrich, M. L.; Sevian, H.
2017-01-01
Students often struggle with solving mechanism problems in organic chemistry courses. They frequently focus on surface features, have difficulty attributing meaning to symbols, and do not recognize tasks that are different from the exact tasks practiced. To be more successful, students need to be able to extract salient features, map similarities…
A chance constraint estimation approach to optimizing resource management under uncertainty
Michael Bevers
2007-01-01
Chance-constrained optimization is an important method for managing risk arising from random variations in natural resource systems, but the probabilistic formulations often pose mathematical programming problems that cannot be solved with exact methods. A heuristic estimation method for these problems is presented that combines a formulation for order statistic...
ERIC Educational Resources Information Center
Seeley, Cathy L.
2017-01-01
The traditional method of teaching math--showing students how to do a procedure, then assigning problems that require them to use that exact procedure--leads to adults who don't know how to approach problems that don't look like those in their math book. Seeley describes an alternative teaching method (upside-down teaching) in which teachers give…
A new shock-capturing numerical scheme for ideal hydrodynamics
NASA Astrophysics Data System (ADS)
Fecková, Z.; Tomášik, B.
2015-05-01
We present a new algorithm for solving ideal relativistic hydrodynamics based on Godunov method with an exact solution of Riemann problem for an arbitrary equation of state. Standard numerical tests are executed, such as the sound wave propagation and the shock tube problem. Low numerical viscosity and high precision are attained with proper discretization.
Problem solving during artificial selection of self-replicating loops
NASA Astrophysics Data System (ADS)
Chou, Hui-Hsien; Reggia, James A.
1998-05-01
Past cellular automata models of self-replication have generally done only one thing: replicate themselves. However, it has recently been demonstrated that such self-replicating structures can be programmed to also carry out a task during the replication process. Past models of this sort have been limited in that the “program” involved is copied unchanged from parent to child, so that each generation of replicants is executing exactly the same program on exactly the same data. Here we take a different approach in which each replicant receives a distinct partial solution that is modified during replication. Under artificial selection, replicants with promising solutions proliferate while those with failed solutions are lost. We show that this approach can be applied successfully to solve an NP-complete problem, the satisfiability problem. Bounds are given on the cellular space size and time needed to solve a given problem, and simulations demonstrate that this approach works effectively. These and other recent results raise the possibility of evolving self-replicating structures that have a simulated metabolism or that carry out useful tasks.
NASA Astrophysics Data System (ADS)
Chen, Guangye; Luis, Chacon; Bird, Robert; Stark, David; Yin, Lin; Albright, Brian
2017-10-01
Leap-frog based explicit algorithms, either ``energy-conserving'' or ``momentum-conserving'', do not conserve energy discretely. Time-centered fully implicit algorithms can conserve discrete energy exactly, but introduce large dispersion errors in the light-wave modes, regardless of timestep sizes. This can lead to intolerable simulation errors where highly accurate light propagation is needed (e.g. laser-plasma interactions, LPI). In this study, we selectively combine the leap-frog and Crank-Nicolson methods to produce a low-dispersion, exactly energy-and-charge-conserving PIC algorithm. Specifically, we employ the leap-frog method for Maxwell equations, and the Crank-Nicolson method for particle equations. Such an algorithm admits exact global energy conservation, exact local charge conservation, and preserves the dispersion properties of the leap-frog method for the light wave. The algorithm has been implemented in a code named iVPIC, based on the VPIC code developed at LANL. We will present numerical results that demonstrate the properties of the scheme with sample test problems (e.g. Weibel instability run for 107 timesteps, and LPI applications.
Sun, Peng; Guo, Jiong; Baumbach, Jan
2012-07-17
The explosion of biological data has largely influenced the focus of today’s biology research. Integrating and analysing large quantity of data to provide meaningful insights has become the main challenge to biologists and bioinformaticians. One major problem is the combined data analysis of data from different types, such as phenotypes and genotypes. This data is modelled as bi-partite graphs where nodes correspond to the different data points, mutations and diseases for instance, and weighted edges relate to associations between them. Bi-clustering is a special case of clustering designed for partitioning two different types of data simultaneously. We present a bi-clustering approach that solves the NP-hard weighted bi-cluster editing problem by transforming a given bi-partite graph into a disjoint union of bi-cliques. Here we contribute with an exact algorithm that is based on fixed-parameter tractability. We evaluated its performance on artificial graphs first. Afterwards we exemplarily applied our Java implementation to data of genome-wide association studies (GWAS) data aiming for discovering new, previously unobserved geno-to-pheno associations. We believe that our results will serve as guidelines for further wet lab investigations. Generally our software can be applied to any kind of data that can be modelled as bi-partite graphs. To our knowledge it is the fastest exact method for weighted bi-cluster editing problem.
Sun, Peng; Guo, Jiong; Baumbach, Jan
2012-06-01
The explosion of biological data has largely influenced the focus of today's biology research. Integrating and analysing large quantity of data to provide meaningful insights has become the main challenge to biologists and bioinformaticians. One major problem is the combined data analysis of data from different types, such as phenotypes and genotypes. This data is modelled as bi-partite graphs where nodes correspond to the different data points, mutations and diseases for instance, and weighted edges relate to associations between them. Bi-clustering is a special case of clustering designed for partitioning two different types of data simultaneously. We present a bi-clustering approach that solves the NP-hard weighted bi-cluster editing problem by transforming a given bi-partite graph into a disjoint union of bi-cliques. Here we contribute with an exact algorithm that is based on fixed-parameter tractability. We evaluated its performance on artificial graphs first. Afterwards we exemplarily applied our Java implementation to data of genome-wide association studies (GWAS) data aiming for discovering new, previously unobserved geno-to-pheno associations. We believe that our results will serve as guidelines for further wet lab investigations. Generally our software can be applied to any kind of data that can be modelled as bi-partite graphs. To our knowledge it is the fastest exact method for weighted bi-cluster editing problem.
Exact moments of the Sachdev-Ye-Kitaev model up to order 1 /N 2
NASA Astrophysics Data System (ADS)
García-García, Antonio M.; Jia, Yiyang; Verbaarschot, Jacobus J. M.
2018-04-01
We analytically evaluate the moments of the spectral density of the q-body Sachdev-Ye-Kitaev (SYK) model, and obtain order 1 /N 2 corrections for all moments, where N is the total number of Majorana fermions. To order 1 /N, moments are given by those of the weight function of the Q-Hermite polynomials. Representing Wick contractions by rooted chord diagrams, we show that the 1 /N 2 correction for each chord diagram is proportional to the number of triangular loops of the corresponding intersection graph, with an extra grading factor when q is odd. Therefore the problem of finding 1 /N 2 corrections is mapped to a triangle counting problem. Since the total number of triangles is a purely graph-theoretic property, we can compute them for the q = 1 and q = 2 SYK models, where the exact moments can be obtained analytically using other methods, and therefore we have solved the moment problem for any q to 1 /N 2 accuracy. The moments are then used to obtain the spectral density of the SYK model to order 1 /N 2. We also obtain an exact analytical result for all contraction diagrams contributing to the moments, which can be evaluated up to eighth order. This shows that the Q-Hermite approximation is accurate even for small values of N.
NASA Astrophysics Data System (ADS)
Magyari, Eugen
2011-01-01
In a recent paper published in this Journal the title problem has been investigated numerically. In the present paper the exact solution for the temperature boundary layer is given in terms of the solution of the flow problem (the Blasius problem) in a compact integral form.
Three-body problem in d-dimensional space: Ground state, (quasi)-exact-solvability
NASA Astrophysics Data System (ADS)
Turbiner, Alexander V.; Miller, Willard; Escobar-Ruiz, M. A.
2018-02-01
As a straightforward generalization and extension of our previous paper [A. V. Turbiner et al., "Three-body problem in 3D space: Ground state, (quasi)-exact-solvability," J. Phys. A: Math. Theor. 50, 215201 (2017)], we study the aspects of the quantum and classical dynamics of a 3-body system with equal masses, each body with d degrees of freedom, with interaction depending only on mutual (relative) distances. The study is restricted to solutions in the space of relative motion which are functions of mutual (relative) distances only. It is shown that the ground state (and some other states) in the quantum case and the planar trajectories (which are in the interaction plane) in the classical case are of this type. The quantum (and classical) Hamiltonian for which these states are eigenfunctions is derived. It corresponds to a three-dimensional quantum particle moving in a curved space with special d-dimension-independent metric in a certain d-dependent singular potential, while at d = 1, it elegantly degenerates to a two-dimensional particle moving in flat space. It admits a description in terms of pure geometrical characteristics of the interaction triangle which is defined by the three relative distances. The kinetic energy of the system is d-independent; it has a hidden sl(4, R) Lie (Poisson) algebra structure, alternatively, the hidden algebra h(3) typical for the H3 Calogero model as in the d = 3 case. We find an exactly solvable three-body S3-permutationally invariant, generalized harmonic oscillator-type potential as well as a quasi-exactly solvable three-body sextic polynomial type potential with singular terms. For both models, an extra first order integral exists. For d = 1, the whole family of 3-body (two-dimensional) Calogero-Moser-Sutherland systems as well as the Tremblay-Turbiner-Winternitz model is reproduced. It is shown that a straightforward generalization of the 3-body (rational) Calogero model to d > 1 leads to two primitive quasi-exactly solvable problems. The extension to the case of non-equal masses is straightforward and is briefly discussed.
DFT treatment of transport through Anderson junction: exact results and approximations
NASA Astrophysics Data System (ADS)
Burke, Kieron
2012-02-01
Since the pioneering break-junction experiments of Reed and Tour measuring the conductance of dithiolated benzene between gold leads, many researchers in physics and chemistry have been calculating conductance for such systems using density functional theory (DFT). Off resonance, the predicted current is often 10-100 times larger than that measured. This error is often ascribed to the application of ground-state DFT to a non-equilibrium problem. I will argue that, in fact, this is largely due to errors in the density functional approximations in popular use, rather than necessarily errors in the methodology. A stark illustration of this principle is the ability of DFT to reproduce the exact transmission through an Anderson junction at zero-temperature and weak bias, including the Kondo plateau, but only if the exact ground-state density functional is used. In fact, this case can be used to reverse-engineer the exact functional for this problem. Popular approximations can also be tested, including both smooth and discontinuous functionals of the density, as well as symmetry-broken approaches. [4pt] [1] Kondo effect given exactly by density functional theory, J. P. Bergfield, Z. Liu, K. Burke, and C. A. Stafford, arXiv:1106.3104; [0pt] [2] Broadening of the Derivative Discontinuity in Density Functional Theory, F. Evers, and P. Schmitteckert, arXiv:1106.3658; [0pt] [3] DFT-based transport calculations, Friedel's sum rule and the Kondo effect, P. Tr"oster, P. Schmitteckert, and F. Evers, arXiv:1106.3669; [0pt] [4] Towards a description of the Kondo effect using time-dependent density functional theory, G. Stefanucci, and S. Kurth, arXiv:1106.3728.
Advanced Joining of Aerospace Metallic Materials.
1986-07-01
uniaxial tensile test with varying temperature and cyclic loading. This simple test problem excercises maray aspects of the phenomena. suOn- ,Ual Yield...6vidence Ia seconde configuration apparait plus n~ faste . 5.3. Ents-e-igne-men-t-s s-u r a dyna-mique de. bain-s de fu-sion A lusage il svest r~vle que la...scanning system for fast and exact alignment of the EB-qun is used. In a fixture the cleaned detail parts are positioned exactly and clamped for welding. At
NASA Astrophysics Data System (ADS)
Castro, E.
2018-02-01
From the perturbative expansion of the exact Green function, an exact counting formula is derived to determine the number of different types of connected Feynman diagrams. This formula coincides with the Arquès-Walsh sequence formula in the rooted map theory, supporting the topological connection between Feynman diagrams and rooted maps. A classificatory summing-terms approach is used, in connection to discrete mathematical theory.
NASA Technical Reports Server (NTRS)
Anderson, Melvin S.; Kennedy, David
1992-01-01
The problem considered is the development of the necessary plate stiffnesses for use in a general purpose program for buckling and vibration of composite plate assemblies. The required stiffnesses are for the assumption of sinusoidal response along the plate length with transverse shear included. The method is based on the exact solution of the plate differential equations for a composite laminate having fully populated A, B, and D matrices which leads to a differential equation of tenth order.
Nakkeeran, K
2001-10-01
We consider a family of N coupled nonlinear Schrödinger equations which govern the simultaneous propagation of N fields in the normal dispersion regime of an optical fiber with various important physical effects. The linear eigenvalue problem associated with the integrable form of all the equations is constructed with the help of the Ablowitz-Kaup-Newell-Segur method. Using the Hirota bilinear method, exact dark soliton solutions are explicitly derived.
An exact plane-stress solution for a class of problems in orthotropic elasticity
NASA Technical Reports Server (NTRS)
Erb, D. A.; Cooper, P. A.; Weisshaar, T. A.
1982-01-01
An exact solution for the stress field within a rectangular slab of orthotropic material is found using a two dimensional Fourier series formulation. The material is required to be in plane stress, with general stress boundary conditions, and the principle axes of the material must be parallel to the sides of the rectangle. Two load cases similar to those encountered in materials testing are investigated using the solution. The solution method has potential uses in stress analysis of composite structures.
Gravitational field of a concentrated mass in Jordan—Brans—Dicke theory
NASA Astrophysics Data System (ADS)
Arutyunyan, G. G.; Papoyan, V. V.
1994-04-01
The problem of determining the gravitational field of a static, spherically symmetric, self-gravitating object is formulated. The small number of physically applicable exact solutions of the equations in Jordan—Brans—Dicke theory is augmented with new exact solutions describing the external gravitational field of the given body. Once a solution has been found, it can be rewritten in modified curvature, homogeneous, and other coordinates by appropriate gauging. In a special case the solution coincides with the well-known Schwarzschild solution.
Performance Evaluation of the Q Exactive HF-X for Shotgun Proteomics.
Kelstrup, Christian D; Bekker-Jensen, Dorte B; Arrey, Tabiwang N; Hogrebe, Alexander; Harder, Alexander; Olsen, Jesper V
2018-01-05
Progress in proteomics is mainly driven by advances in mass spectrometric (MS) technologies. Here we benchmarked the performance of the latest MS instrument in the benchtop Orbitrap series, the Q Exactive HF-X, against its predecessor for proteomics applications. A new peak-picking algorithm, a brighter ion source, and optimized ion transfers enable productive MS/MS acquisition above 40 Hz at 7500 resolution. The hardware and software improvements collectively resulted in improved peptide and protein identifications across all comparable conditions, with an increase of up to 50 percent at short LC-MS gradients, yielding identification rates of more than 1000 unique peptides per minute. Alternatively, the Q Exactive HF-X is capable of achieving the same proteome coverage as its predecessor in approximately half the gradient time or at 10-fold lower sample loads. The Q Exactive HF-X also enables rapid phosphoproteomics with routine analysis of more than 5000 phosphopeptides with short single-shot 15 min LC-MS/MS measurements, or 16 700 phosphopeptides quantified across ten conditions in six gradient hours using TMT10-plex and offline peptide fractionation. Finally, exciting perspectives for data-independent acquisition are highlighted with reproducible identification of 55 000 unique peptides covering 5900 proteins in half an hour of MS analysis.
Rennert, Hanna; Eng, Kenneth; Zhang, Tuo; Tan, Adrian; Xiang, Jenny; Romanel, Alessandro; Kim, Robert; Tam, Wayne; Liu, Yen-Chun; Bhinder, Bhavneet; Cyrta, Joanna; Beltran, Himisha; Robinson, Brian; Mosquera, Juan Miguel; Fernandes, Helen; Demichelis, Francesca; Sboner, Andrea; Kluk, Michael; Rubin, Mark A; Elemento, Olivier
2016-01-01
We describe Exome Cancer Test v1.0 (EXaCT-1), the first New York State-Department of Health-approved whole-exome sequencing (WES)-based test for precision cancer care. EXaCT-1 uses HaloPlex (Agilent) target enrichment followed by next-generation sequencing (Illumina) of tumour and matched constitutional control DNA. We present a detailed clinical development and validation pipeline suitable for simultaneous detection of somatic point/indel mutations and copy-number alterations (CNAs). A computational framework for data analysis, reporting and sign-out is also presented. For the validation, we tested EXaCT-1 on 57 tumours covering five distinct clinically relevant mutations. Results demonstrated elevated and uniform coverage compatible with clinical testing as well as complete concordance in variant quality metrics between formalin-fixed paraffin embedded and fresh-frozen tumours. Extensive sensitivity studies identified limits of detection threshold for point/indel mutations and CNAs. Prospective analysis of 337 cancer cases revealed mutations in clinically relevant genes in 82% of tumours, demonstrating that EXaCT-1 is an accurate and sensitive method for identifying actionable mutations, with reasonable costs and time, greatly expanding its utility for advanced cancer care. PMID:28781886
ERIC Educational Resources Information Center
Shumway, Richard J.
1989-01-01
Illustrated is the problem of solving equations and some different strategies students might employ when using available technology. Gives illustrations for: exact solutions, approximate solutions, and approximate solutions which are graphically generated. (RT)
What your mother never told you about ... physics teaching
NASA Astrophysics Data System (ADS)
Roudebush, Deborah
2010-03-01
When I entered high school teaching after working in industry for several years, I was sure I knew exactly what to do. I was convinced that I would be the sage on the stage and would wow the students with my clear explanations, amazing problem-solving techniques, and perfect lab instructions. I was convinced that the students would soak up the wisdom and insight that I was offering and that, if the students just followed my directions exactly, they would be able to solve new and exciting problems. Instead, I found that the students became amazingly adept at applied mathematics and understood few of the underlying physics concepts. In fact, some of my star students who headed off to become physics majors were unprepared for the thought required and changed majors within two years.
NASA Technical Reports Server (NTRS)
Mei, Chuh; Pates, Carl S., III
1994-01-01
A coupled boundary element (BEM)-finite element (FEM) approach is presented to accurately model structure-acoustic interaction systems. The boundary element method is first applied to interior, two and three-dimensional acoustic domains with complex geometry configurations. Boundary element results are very accurate when compared with limited exact solutions. Structure-interaction problems are then analyzed with the coupled FEM-BEM method, where the finite element method models the structure and the boundary element method models the interior acoustic domain. The coupled analysis is compared with exact and experimental results for a simplistic model. Composite panels are analyzed and compared with isotropic results. The coupled method is then extended for random excitation. Random excitation results are compared with uncoupled results for isotropic and composite panels.
Heuristic algorithms for solving of the tool routing problem for CNC cutting machines
NASA Astrophysics Data System (ADS)
Chentsov, P. A.; Petunin, A. A.; Sesekin, A. N.; Shipacheva, E. N.; Sholohov, A. E.
2015-11-01
The article is devoted to the problem of minimizing the path of the cutting tool to shape cutting machines began. This problem can be interpreted as a generalized traveling salesman problem. Earlier version of the dynamic programming method to solve this problem was developed. Unfortunately, this method allows to process an amount not exceeding thirty circuits. In this regard, the task of constructing quasi-optimal route becomes relevant. In this paper we propose options for quasi-optimal greedy algorithms. Comparison of the results of exact and approximate algorithms is given.
Exact Solution of the Two-Dimensional Problem on an Impact Ideal-Liquid Jet
NASA Astrophysics Data System (ADS)
Belik, V. D.
2018-05-01
The two-dimensional problem on the collision of a potential ideal-liquid jet, outflowing from a reservoir through a nozzle, with an infinite plane obstacle was considered for the case where the distance between the nozzle exit section and the obstacle is finite. An exact solution of this problem has been found using methods of the complex-variable function theory. Simple analytical expressions for the complex velocity of the liquid, its flow rate, and the force of action of the jet on the obstacle have been obtained. The velocity distributions of the liquid at the nozzle exit section, in the region of spreading of the jet, and at the obstacle have been constructed for different distances between the nozzle exit section and the obstacle. Analytical expressions for the thickness of the boundary layer and the Nusselt number at the point of stagnation of the jet have been obtained. A number of distributions of the local friction coefficient and the Nusselt number of the indicated jet are presented.
Bosonization of nonrelativistic fermions on a circle: Tomonaga's problem revisited
NASA Astrophysics Data System (ADS)
Dhar, Avinash; Mandal, Gautam
2006-11-01
We use the recently developed tools for an exact bosonization of a finite number N of nonrelativistic fermions to discuss the classic Tomonaga problem. In the case of noninteracting fermions, the bosonized Hamiltonian naturally splits into an O(N) piece and an O(1) piece. We show that in the large-N and low-energy limit, the O(N) piece in the Hamiltonian describes a massless relativistic boson, while the O(1) piece gives rise to cubic self-interactions of the boson. At finite N and high energies, the low-energy effective description breaks down and the exact bosonized Hamiltonian must be used. We also comment on the connection between the Tomonaga problem and pure Yang-Mills theory on a cylinder. In the dual context of baby universes and multiple black holes in string theory, we point out that the O(N) piece in our bosonized Hamiltonian provides a simple understanding of the origin of two different kinds of nonperturbative O(e-N) corrections to the black hole partition function.
NASA Astrophysics Data System (ADS)
Pickard, William F.
2004-10-01
The classical PERT inverse statistics problem requires estimation of the mean, \\skew1\\bar{m} , and standard deviation, s, of a unimodal distribution given estimates of its mode, m, and of the smallest, a, and largest, b, values likely to be encountered. After placing the problem in historical perspective and showing that it is ill-posed because it is underdetermined, this paper offers an approach to resolve the ill-posedness: (a) by interpreting a and b modes of order statistic distributions; (b) by requiring also an estimate of the number of samples, N, considered in estimating the set {m, a, b}; and (c) by maximizing a suitable likelihood, having made the traditional assumption that the underlying distribution is beta. Exact formulae relating the four parameters of the beta distribution to {m, a, b, N} and the assumed likelihood function are then used to compute the four underlying parameters of the beta distribution; and from them, \\skew1\\bar{m} and s are computed using exact formulae.
Identifying a Probabilistic Boolean Threshold Network From Samples.
Melkman, Avraham A; Cheng, Xiaoqing; Ching, Wai-Ki; Akutsu, Tatsuya
2018-04-01
This paper studies the problem of exactly identifying the structure of a probabilistic Boolean network (PBN) from a given set of samples, where PBNs are probabilistic extensions of Boolean networks. Cheng et al. studied the problem while focusing on PBNs consisting of pairs of AND/OR functions. This paper considers PBNs consisting of Boolean threshold functions while focusing on those threshold functions that have unit coefficients. The treatment of Boolean threshold functions, and triplets and -tuplets of such functions, necessitates a deepening of the theoretical analyses. It is shown that wide classes of PBNs with such threshold functions can be exactly identified from samples under reasonable constraints, which include: 1) PBNs in which any number of threshold functions can be assigned provided that all have the same number of input variables and 2) PBNs consisting of pairs of threshold functions with different numbers of input variables. It is also shown that the problem of deciding the equivalence of two Boolean threshold functions is solvable in pseudopolynomial time but remains co-NP complete.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Dubrovsky, V. G.; Topovsky, A. V.
New exact solutions, nonstationary and stationary, of Veselov-Novikov (VN) equation in the forms of simple nonlinear and linear superpositions of arbitrary number N of exact special solutions u{sup (n)}, n= 1, Horizontal-Ellipsis , N are constructed via Zakharov and Manakov {partial_derivative}-dressing method. Simple nonlinear superpositions are represented up to a constant by the sums of solutions u{sup (n)} and calculated by {partial_derivative}-dressing on nonzero energy level of the first auxiliary linear problem, i.e., 2D stationary Schroedinger equation. It is remarkable that in the zero energy limit simple nonlinear superpositions convert to linear ones in the form of the sums ofmore » special solutions u{sup (n)}. It is shown that the sums u=u{sup (k{sub 1})}+...+u{sup (k{sub m})}, 1 Less-Than-Or-Slanted-Equal-To k{sub 1} < k{sub 2} < Horizontal-Ellipsis < k{sub m} Less-Than-Or-Slanted-Equal-To N of arbitrary subsets of these solutions are also exact solutions of VN equation. The presented exact solutions include as superpositions of special line solitons and also superpositions of plane wave type singular periodic solutions. By construction these exact solutions represent also new exact transparent potentials of 2D stationary Schroedinger equation and can serve as model potentials for electrons in planar structures of modern electronics.« less
Papadopoulou, Maria P; Nikolos, Ioannis K; Karatzas, George P
2010-01-01
Artificial Neural Networks (ANNs) comprise a powerful tool to approximate the complicated behavior and response of physical systems allowing considerable reduction in computation time during time-consuming optimization runs. In this work, a Radial Basis Function Artificial Neural Network (RBFN) is combined with a Differential Evolution (DE) algorithm to solve a water resources management problem, using an optimization procedure. The objective of the optimization scheme is to cover the daily water demand on the coastal aquifer east of the city of Heraklion, Crete, without reducing the subsurface water quality due to seawater intrusion. The RBFN is utilized as an on-line surrogate model to approximate the behavior of the aquifer and to replace some of the costly evaluations of an accurate numerical simulation model which solves the subsurface water flow differential equations. The RBFN is used as a local approximation model in such a way as to maintain the robustness of the DE algorithm. The results of this procedure are compared to the corresponding results obtained by using the Simplex method and by using the DE procedure without the surrogate model. As it is demonstrated, the use of the surrogate model accelerates the convergence of the DE optimization procedure and additionally provides a better solution at the same number of exact evaluations, compared to the original DE algorithm.
Reveal, A General Reverse Engineering Algorithm for Inference of Genetic Network Architectures
NASA Technical Reports Server (NTRS)
Liang, Shoudan; Fuhrman, Stefanie; Somogyi, Roland
1998-01-01
Given the immanent gene expression mapping covering whole genomes during development, health and disease, we seek computational methods to maximize functional inference from such large data sets. Is it possible, in principle, to completely infer a complex regulatory network architecture from input/output patterns of its variables? We investigated this possibility using binary models of genetic networks. Trajectories, or state transition tables of Boolean nets, resemble time series of gene expression. By systematically analyzing the mutual information between input states and output states, one is able to infer the sets of input elements controlling each element or gene in the network. This process is unequivocal and exact for complete state transition tables. We implemented this REVerse Engineering ALgorithm (REVEAL) in a C program, and found the problem to be tractable within the conditions tested so far. For n = 50 (elements) and k = 3 (inputs per element), the analysis of incomplete state transition tables (100 state transition pairs out of a possible 10(exp 15)) reliably produced the original rule and wiring sets. While this study is limited to synchronous Boolean networks, the algorithm is generalizable to include multi-state models, essentially allowing direct application to realistic biological data sets. The ability to adequately solve the inverse problem may enable in-depth analysis of complex dynamic systems in biology and other fields.
8-Step Model Drawing: Singapore's Best Problem-Solving MATH Strategies
ERIC Educational Resources Information Center
Hogan, Bob; Forsten, Char
2007-01-01
In this book, Bob Hogan and Char Forsten introduce American mathematics educators to the model drawing process adapted from the much-acclaimed Singapore approach. They explain what model drawing is and why it's such an effective problem-solving tool. They show exactly how teachers can guide their students through the process, tell which key points…
Integrated Thermal Response Modeling System For Hypersonic Entry Vehicles
NASA Technical Reports Server (NTRS)
Chen, Y.-K.; Milos, F. S.; Partridge, Harry (Technical Monitor)
2000-01-01
We describe all extension of the Markov decision process model in which a continuous time dimension is included ill the state space. This allows for the representation and exact solution of a wide range of problems in which transitions or rewards vary over time. We examine problems based on route planning with public transportation and telescope observation scheduling.
Problem Solving and the Use of Math in Physics Courses
ERIC Educational Resources Information Center
Redish, Edward F.
2006-01-01
Mathematics is an essential element of physics problem solving, but experts often fail to appreciate exactly how they use it. Math may be the language of science, but math-in-physics is a distinct dialect of that language. Physicists tend to blend conceptual physics with mathematical symbolism in a way that profoundly affects the way equations are…
EZLP: An Interactive Computer Program for Solving Linear Programming Problems. Final Report.
ERIC Educational Resources Information Center
Jarvis, John J.; And Others
Designed for student use in solving linear programming problems, the interactive computer program described (EZLP) permits the student to input the linear programming model in exactly the same manner in which it would be written on paper. This report includes a brief review of the development of EZLP; narrative descriptions of program features,…
ERIC Educational Resources Information Center
Lemieux, Colette
1980-01-01
Defines the meaning of the American expression "convenience food," quoting definitions given by dictionaries and specialized publications. Discusses the problem of finding the exact equivalent of this expression in French, and recommends some acceptable translations. (MES)
Publication dates of the North American Fauna series
Banks, Richard C.
1971-01-01
The correct date of publication of numbers in the well-known North American Fauna series, begun in 1889, was printed on the cover of each issue through No. 48. After that time dates of publication that appear on the covers are either incomplete or incorrect. For taxonomic purposes, for developing a chronological survey of a subject, or for other reasons, the exact date of publication of numbers in this important series is useful. We think it important to call attention to the correct dates of publication for numbers beyond 48. Those dealing with birds are listed below by number, followed by the author's name for ease of reference, the date printed on the cover of the issue, and the correct date of publication in parentheses. Numbers not listed do not relate to birds (see J. Mammal., 51: 845, 1970).
On Bipartite Graphs Trees and Their Partial Vertex Covers.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Caskurlu, Bugra; Mkrtchyan, Vahan; Parekh, Ojas D.
2015-03-01
Graphs can be used to model risk management in various systems. Particularly, Caskurlu et al. in [7] have considered a system, which has threats, vulnerabilities and assets, and which essentially represents a tripartite graph. The goal in this model is to reduce the risk in the system below a predefined risk threshold level. One can either restricting the permissions of the users, or encapsulating the system assets. The pointed out two strategies correspond to deleting minimum number of elements corresponding to vulnerabilities and assets, such that the flow between threats and assets is reduced below the predefined threshold level. Itmore » can be shown that the main goal in this risk management system can be formulated as a Partial Vertex Cover problem on bipartite graphs. It is well-known that the Vertex Cover problem is in P on bipartite graphs, however; the computational complexity of the Partial Vertex Cover problem on bipartite graphs has remained open. In this paper, we establish that the Partial Vertex Cover problem is NP-hard on bipartite graphs, which was also recently independently demonstrated [N. Apollonio and B. Simeone, Discrete Appl. Math., 165 (2014), pp. 37–48; G. Joret and A. Vetta, preprint, arXiv:1211.4853v1 [cs.DS], 2012]. We then identify interesting special cases of bipartite graphs, for which the Partial Vertex Cover problem, the closely related Budgeted Maximum Coverage problem, and their weighted extensions can be solved in polynomial time. We also present an 8/9-approximation algorithm for the Budgeted Maximum Coverage problem in the class of bipartite graphs. We show that this matches and resolves the integrality gap of the natural LP relaxation of the problem and improves upon a recent 4/5-approximation.« less
Language and number: a bilingual training study.
Spelke, E S; Tsivkin, S
2001-01-01
Three experiments investigated the role of a specific language in human representations of number. Russian-English bilingual college students were taught new numerical operations (Experiment 1), new arithmetic equations (Experiments 1 and 2), or new geographical or historical facts involving numerical or non-numerical information (Experiment 3). After learning a set of items in each of their two languages, subjects were tested for knowledge of those items, and new items, in both languages. In all the studies, subjects retrieved information about exact numbers more effectively in the language of training, and they solved trained problems more effectively than untrained problems. In contrast, subjects retrieved information about approximate numbers and non-numerical facts with equal efficiency in their two languages, and their training on approximate number facts generalized to new facts of the same type. These findings suggest that a specific, natural language contributes to the representation of large, exact numbers but not to the approximate number representations that humans share with other mammals. Language appears to play a role in learning about exact numbers in a variety of contexts, a finding with implications for practice in bilingual education. The findings prompt more general speculations about the role of language in the development of specifically human cognitive abilities.
Differential Forms: A New Tool in Economics
NASA Astrophysics Data System (ADS)
Mimkes, Jürgen
Econophysics is the transfer of methods from natural to socio-economic sciences. This concept has first been applied to finance1, but it is now also used in various applications of economics and social sciences [2,3]. The present paper focuses on problems in macro economics and growth. 1. Neoclassical theory [4, 5] neglects the “ex post” property of income and growth. Income Y(K, L) is assumed to be a function of capital and labor. But functions cannot model the “ex post” character of income. 2. Neoclassical theory is based on a Cobb Douglas function [6] with variable elasticity α, which may be fitted to economic data. But an undefined elasticity α leads to a descriptive rather than a predictive economic theory. The present paper introduces a new tool - differential forms and path dependent integrals - to macro economics. This is a solution to the problems above: 1. The integral of not exact differential forms is path dependent and can only be calculated “ex post” like income and economic growth. 2. Not exact differential forms can be made exact by an integrating factor, this leads to a new, well defined, unique production function F and a predictive economic theory.
Communication: Correct charge transfer in CT complexes from the Becke'05 density functional
NASA Astrophysics Data System (ADS)
Becke, Axel D.; Dale, Stephen G.; Johnson, Erin R.
2018-06-01
It has been known for over twenty years that density functionals of the generalized-gradient approximation (GGA) type and exact-exchange-GGA hybrids with low exact-exchange mixing fraction yield enormous errors in the properties of charge-transfer (CT) complexes. Manifestations of this error have also plagued computations of CT excitation energies. GGAs transfer far too much charge in CT complexes. This error has therefore come to be called "delocalization" error. It remains, to this day, a vexing unsolved problem in density-functional theory (DFT). Here we report that a 100% exact-exchange-based density functional known as Becke'05 or "B05" [A. D. Becke, J. Chem. Phys. 119, 2972 (2003); 122, 064101 (2005)] predicts excellent charge transfers in classic CT complexes involving the electron donors NH3, C2H4, HCN, and C2H2 and electron acceptors F2 and Cl2. Our approach is variational, as in our recent "B05min" dipole moments paper [Dale et al., J. Chem. Phys. 147, 154103 (2017)]. Therefore B05 is not only an accurate DFT for thermochemistry but is promising as a solution to the delocalization problem as well.
Translations on Eastern Europe, Scientific Affairs, Number 592.
1978-07-13
Period Covered 14. 15. Supplementary Notes 16. Abstracts The serial report contains articles concerning the development of and progress in the...Personnel (NAUKA POLSKA, Mar-Apr 78) 6 ROMANIA New Herbicide To Protect Trifolium Crops (N. Sarpe; AGRICULTURA SOCIALISTA, 13 May 78) 17...Organs," and PAN Member Tadeusz Ruebenbauer: " Rye and Possibilities for Improving It." The following persons presented lectures in exact and
Ground cover changes resulting from low-level camping stress on a remote site
R. E. Leonard; J. M. McBride; P. W. Conkling; J. L. McMahon
1983-01-01
This study reports the effects of low-level camping stress on vegetation in a remote site. South Big Garden Island in Penobscot Bay, Maine, was studied because (1) it had no prior recreational use; thus, comprehensive base line data could be obtained; and (2) the exact number of campers could be monitored throughout the study period. The continuous line-intercept...
NASA Astrophysics Data System (ADS)
Grün, H.; Paltauf, G.; Haltmeier, M.; Burgholzer, P.
2007-07-01
Photoacoustic imaging is based on the generation of acoustic waves in a semitransparent sample (e.g. soft tissue) after illumination with short pulses of light or radio waves. The goal is to recover the spatial distribution of absorbed energy density inside the sample from acoustic pressure signals measured outside the sample (photoacoustic inverse problem). If the acoustic pressure outside the illuminated sample is measured with a large-aperture detector, the signal at a certain time is given by an integral of the generated acoustic pressure distribution over an area that is determined by the shape of the detector. For example a planar detector measures the projections of the initial pressure distribution over planes parallel to the detector plane, which is the Radon transform of the initial pressure distribution. Stable and exact three-dimensional imaging with planar integrating detector requires measurements in all directions of space and so the receiver plane has to be rotated to cover the entire detection surface. We have recently presented a simpler set-up for exact imaging which requires only a single rotation axis and therefor the fragmentation of the area detector into line detectors perpendicular to the rotation axis. Using a two-dimensional reconstruction method and applying the inverse two-dimensional Radon transform afterwards gives an exact reconstruction of the three-dimensional sample with this set-up. In order to achieve high resolution, a fiber based Fabry-Perot interferometer is used. It is a single mode fiber with two fiber bragg gratings on both ends of the line detector. Thermal shifts and vibrations are compensated by frequency locking of the laser. The high resolution and the good performance of this integrating line detector has been demonstrated by photoacoustic measurements with line grid samples and phantoms using a model-based time reversal method for image reconstruction. The time reversed pressure field can be calculated directly by retransmitting the measured pressure on the detector positions in a reversed temporal order.
Efficient Calculation of Exact Exchange Within the Quantum Espresso Software Package
NASA Astrophysics Data System (ADS)
Barnes, Taylor; Kurth, Thorsten; Carrier, Pierre; Wichmann, Nathan; Prendergast, David; Kent, Paul; Deslippe, Jack
Accurate simulation of condensed matter at the nanoscale requires careful treatment of the exchange interaction between electrons. In the context of plane-wave DFT, these interactions are typically represented through the use of approximate functionals. Greater accuracy can often be obtained through the use of functionals that incorporate some fraction of exact exchange; however, evaluation of the exact exchange potential is often prohibitively expensive. We present an improved algorithm for the parallel computation of exact exchange in Quantum Espresso, an open-source software package for plane-wave DFT simulation. Through the use of aggressive load balancing and on-the-fly transformation of internal data structures, our code exhibits speedups of approximately an order of magnitude for practical calculations. Additional optimizations are presented targeting the many-core Intel Xeon-Phi ``Knights Landing'' architecture, which largely powers NERSC's new Cori system. We demonstrate the successful application of the code to difficult problems, including simulation of water at a platinum interface and computation of the X-ray absorption spectra of transition metal oxides.
Exact solutions for postbuckling of a graded porous beam
NASA Astrophysics Data System (ADS)
Ma, L. S.; Ou, Z. Y.
2018-06-01
An exact, closed-form solution for the postbuckling responses of graded porous beams subjected to axially loading is obtained. It was assumed that the properties of the graded porous materials vary continuously through thickness of the beams, the equations governing the axial and transverse deformations are derived based on the classical beam theory and the physical neutral surface concept. The two equations are reduced to a single nonlinear fourth-order integral-differential equation governing the transverse deformations. The nonlinear equation is directly solved without any use of approximation and a closed-form solution for postbuckled deformation is obtained as a function of the applied load. The exact solutions explicitly describe the nonlinear equilibrium paths of the buckled beam and thus are able to provide insight into deformation problems. Based on the exact solutions obtained herein, the effects of various factors such as porosity distribution pattern, porosity coefficient and boundary conditions on postbuckling behavior of graded porous beams have been investigated.
A hierarchical exact accelerated stochastic simulation algorithm
NASA Astrophysics Data System (ADS)
Orendorff, David; Mjolsness, Eric
2012-12-01
A new algorithm, "HiER-leap" (hierarchical exact reaction-leaping), is derived which improves on the computational properties of the ER-leap algorithm for exact accelerated simulation of stochastic chemical kinetics. Unlike ER-leap, HiER-leap utilizes a hierarchical or divide-and-conquer organization of reaction channels into tightly coupled "blocks" and is thereby able to speed up systems with many reaction channels. Like ER-leap, HiER-leap is based on the use of upper and lower bounds on the reaction propensities to define a rejection sampling algorithm with inexpensive early rejection and acceptance steps. But in HiER-leap, large portions of intra-block sampling may be done in parallel. An accept/reject step is used to synchronize across blocks. This method scales well when many reaction channels are present and has desirable asymptotic properties. The algorithm is exact, parallelizable and achieves a significant speedup over the stochastic simulation algorithm and ER-leap on certain problems. This algorithm offers a potentially important step towards efficient in silico modeling of entire organisms.
Adaptation of a Fast Optimal Interpolation Algorithm to the Mapping of Oceangraphic Data
NASA Technical Reports Server (NTRS)
Menemenlis, Dimitris; Fieguth, Paul; Wunsch, Carl; Willsky, Alan
1997-01-01
A fast, recently developed, multiscale optimal interpolation algorithm has been adapted to the mapping of hydrographic and other oceanographic data. This algorithm produces solution and error estimates which are consistent with those obtained from exact least squares methods, but at a small fraction of the computational cost. Problems whose solution would be completely impractical using exact least squares, that is, problems with tens or hundreds of thousands of measurements and estimation grid points, can easily be solved on a small workstation using the multiscale algorithm. In contrast to methods previously proposed for solving large least squares problems, our approach provides estimation error statistics while permitting long-range correlations, using all measurements, and permitting arbitrary measurement locations. The multiscale algorithm itself, published elsewhere, is not the focus of this paper. However, the algorithm requires statistical models having a very particular multiscale structure; it is the development of a class of multiscale statistical models, appropriate for oceanographic mapping problems, with which we concern ourselves in this paper. The approach is illustrated by mapping temperature in the northeastern Pacific. The number of hydrographic stations is kept deliberately small to show that multiscale and exact least squares results are comparable. A portion of the data were not used in the analysis; these data serve to test the multiscale estimates. A major advantage of the present approach is the ability to repeat the estimation procedure a large number of times for sensitivity studies, parameter estimation, and model testing. We have made available by anonymous Ftp a set of MATLAB-callable routines which implement the multiscale algorithm and the statistical models developed in this paper.
Towards de novo identification of metabolites by analyzing tandem mass spectra.
Böcker, Sebastian; Rasche, Florian
2008-08-15
Mass spectrometry is among the most widely used technologies in proteomics and metabolomics. Being a high-throughput method, it produces large amounts of data that necessitates an automated analysis of the spectra. Clearly, database search methods for protein analysis can easily be adopted to analyze metabolite mass spectra. But for metabolites, de novo interpretation of spectra is even more important than for protein data, because metabolite spectra databases cover only a small fraction of naturally occurring metabolites: even the model plant Arabidopsis thaliana has a large number of enzymes whose substrates and products remain unknown. The field of bio-prospection searches biologically diverse areas for metabolites which might serve as pharmaceuticals. De novo identification of metabolite mass spectra requires new concepts and methods since, unlike proteins, metabolites possess a non-linear molecular structure. In this work, we introduce a method for fully automated de novo identification of metabolites from tandem mass spectra. Mass spectrometry data is usually assumed to be insufficient for identification of molecular structures, so we want to estimate the molecular formula of the unknown metabolite, a crucial step for its identification. The method first calculates all molecular formulas that explain the parent peak mass. Then, a graph is build where vertices correspond to molecular formulas of all peaks in the fragmentation mass spectra, whereas edges correspond to hypothetical fragmentation steps. Our algorithm afterwards calculates the maximum scoring subtree of this graph: each peak in the spectra must be scored at most once, so the subtree shall contain only one explanation per peak. Unfortunately, finding this subtree is NP-hard. We suggest three exact algorithms (including one fixed parameter tractable algorithm) as well as two heuristics to solve the problem. Tests on real mass spectra show that the FPT algorithm and the heuristics solve the problem suitably fast and provide excellent results: for all 32 test compounds the correct solution was among the top five suggestions, for 26 compounds the first suggestion of the exact algorithm was correct. http://www.bio.inf.uni-jena.de/tandemms
An exact solution of solute transport by one-dimensional random velocity fields
Cvetkovic, V.D.; Dagan, G.; Shapiro, A.M.
1991-01-01
The problem of one-dimensional transport of passive solute by a random steady velocity field is investigated. This problem is representative of solute movement in porous media, for example, in vertical flow through a horizontally stratified formation of variable porosity with a constant flux at the soil surface. Relating moments of particle travel time and displacement, exact expressions for the advection and dispersion coefficients in the Focker-Planck equation are compared with the perturbation results for large distances. The first- and second-order approximations for the dispersion coefficient are robust for a lognormal velocity field. The mean Lagrangian velocity is the harmonic mean of the Eulerian velocity for large distances. This is an artifact of one-dimensional flow where the continuity equation provides for a divergence free fluid flux, rather than a divergence free fluid velocity. ?? 1991 Springer-Verlag.
A critical evaluation of two-equation models for near wall turbulence
NASA Technical Reports Server (NTRS)
Speziale, Charles G.; Anderson, E. Clay; Abid, Ridha
1990-01-01
A basic theoretical and computational study of two-equation models for near-wall turbulent flows was conducted. Two major problems established for the K-epsilon model are discussed, the lack of natural boundary conditions for the dissipation rate and the appearance of higher-order correlations in the balance of terms for the dissipation rate at the wall. The K-omega equation is shown to have two problems also: an exact viscous term is missing, and the destruction of the dissipation term is not properly damped near the wall. A new K-tau model (where tau = 1/omega is the turbulent time scale) was developed by inclusion of the exact viscous term, and by introduction of new wall damping functions with improved asymptotic behavior. A preliminary test of the new model yields improved predictions for the flat-plate turbulent boundary layer.
NASA Astrophysics Data System (ADS)
Gupta, S. R. D.; Gupta, Santanu D.
1991-10-01
The flow of laser radiation in a plane-parallel cylindrical slab of active amplifying medium with axial symmetry is treated as a problem in radiative transfer. The appropriate one-dimensional transfer equation describing the transfer of laser radiation has been derived by an appeal to Einstein's A, B coefficients (describing the processes of stimulated line absorption, spontaneous line emission, and stimulated line emission sustained by population inversion in the medium) and considering the 'rate equations' to completely establish the rational of the transfer equation obtained. The equation is then exactly solved and the angular distribution of the emergent laser beam intensity is obtained; its numerically computed values are given in tables and plotted in graphs showing the nature of peaks of the emerging laser beam intensity about the axis of the laser cylinder.
NASA Astrophysics Data System (ADS)
Rahmatullah; Ellahi, Rahmat; Mohyud-Din, Syed Tauseef; Khan, Umar
2018-03-01
We have computed new exact traveling wave solutions, including complex solutions of fractional order Boussinesq-Like equations, occurring in physical sciences and engineering, by applying Exp-function method. The method is blended with fractional complex transformation and modified Riemann-Liouville fractional order operator. Our obtained solutions are verified by substituting back into their corresponding equations. To the best of our knowledge, no other technique has been reported to cope with the said fractional order nonlinear problems combined with variety of exact solutions. Graphically, fractional order solution curves are shown to be strongly related to each other and most importantly, tend to fixate on their integer order solution curve. Our solutions comprise high frequencies and very small amplitude of the wave responses.
ERIC Educational Resources Information Center
Katsioloudis, Petros; Moye, Johnny J.
2012-01-01
The purpose of this research was to determine the future critical issues and problems facing the K-12 technology and engineering education profession in the Commonwealth of Virginia. This study was based on the Wicklein nationwide studies (1993a, 2005). Even though this study did not exactly replicate the Wicklein studies--since it was limited to…
Integrated Network Decompositions and Dynamic Programming for Graph Optimization (INDDGO)
DOE Office of Scientific and Technical Information (OSTI.GOV)
The INDDGO software package offers a set of tools for finding exact solutions to graph optimization problems via tree decompositions and dynamic programming algorithms. Currently the framework offers serial and parallel (distributed memory) algorithms for finding tree decompositions and solving the maximum weighted independent set problem. The parallel dynamic programming algorithm is implemented on top of the MADNESS task-based runtime.
Iterative Methods for Elliptic Problems and the Discovery of ’q’.
1984-07-01
K = M’IlN LN 12 is a nonnegative irreducible matrix. Hence the Perron - Frobenius theory [19] tells us that there is exactly one eigenvalue A with W = p...earlier, the Perron - Frobenius theory implies that p is itself an eigenvalue. However, as we have said, in this instance the eigenvalue problem (l.12a
ERIC Educational Resources Information Center
Brusco, Michael; Steinley, Douglas
2010-01-01
Structural balance theory (SBT) has maintained a venerable status in the psychological literature for more than 5 decades. One important problem pertaining to SBT is the approximation of structural or generalized balance via the partitioning of the vertices of a signed graph into "K" clusters. This "K"-balance partitioning problem also has more…
Bohnenblust-Hille inequalities: analytical and computational aspects.
Cavalcante, Wasthenny V; Pellegrino, Daniel M
2018-02-01
The Bohnenblust-Hille polynomial and multilinear inequalities were proved in 1931 and the determination of exact values of their constants is still an open and challenging problem, pursued by various authors. The present paper briefly surveys recent attempts to attack/solve this problem; it also presents new results, like connections with classical results of the linear theory of absolutely summing operators, and new perspectives.
Hu, Xiao-Bing; Wang, Ming; Di Paolo, Ezequiel
2013-06-01
Searching the Pareto front for multiobjective optimization problems usually involves the use of a population-based search algorithm or of a deterministic method with a set of different single aggregate objective functions. The results are, in fact, only approximations of the real Pareto front. In this paper, we propose a new deterministic approach capable of fully determining the real Pareto front for those discrete problems for which it is possible to construct optimization algorithms to find the k best solutions to each of the single-objective problems. To this end, two theoretical conditions are given to guarantee the finding of the actual Pareto front rather than its approximation. Then, a general methodology for designing a deterministic search procedure is proposed. A case study is conducted, where by following the general methodology, a ripple-spreading algorithm is designed to calculate the complete exact Pareto front for multiobjective route optimization. When compared with traditional Pareto front search methods, the obvious advantage of the proposed approach is its unique capability of finding the complete Pareto front. This is illustrated by the simulation results in terms of both solution quality and computational efficiency.
Steiner trees and spanning trees in six-pin soap films
NASA Astrophysics Data System (ADS)
Dutta, Prasun; Khastgir, S. Pratik; Roy, Anushree
2010-02-01
The problem of finding minimum (local as well as absolute) path lengths joining given points (or terminals) on a plane is known as the Steiner problem. The Steiner problem arises in finding the minimum total road length joining several towns and cities. We study the Steiner tree problem using six-pin soap films. Experimentally, we observe spanning trees as well as Steiner trees partly by varying the pin diameter. We propose a possibly exact expression for the length of a spanning tree or a Steiner tree, which fails mysteriously in certain cases.
NASA Technical Reports Server (NTRS)
Anderson, Melvin S.; Kennedy, David
1993-01-01
The problem considered is the development of the necessary plate stiffnesses for use in the general purpose program VICONOPT for buckling and vibration of composite plate assemblies. The required stiffnesses include the effects of transverse shear deformation and are for sinusoidal response along the plate length as required in VICONOPT. The method is based on the exact solution of the plate differential equations for a composite laminate having fully populated A, B, and D stiffness matrices which leads to an ordinary differential equation of tenth order.
Griesemer, James
2015-09-21
Gánti's chemoton model of the minimal chemical organization of living systems and life criteria for the living state and a living world are characterized. It is argued that these are better interpreted as part of a heuristic pursuit of an exact theoretical biology than as a "definition of life." Several problems with efforts to define life are discussed. Clarifying the proper use of Gánti's ideas to serve constructive engineering idealizations helps to show their enduring value. Copyright © 2015 Elsevier Ltd. All rights reserved.
Interior radiances in optically deep absorbing media. I - Exact solutions for one-dimensional model.
NASA Technical Reports Server (NTRS)
Kattawar, G. W.; Plass, G. N.
1973-01-01
An exact analytic solution to the one-dimensional scattering problem with arbitrary single scattering albedo and arbitrary surface albedo is presented. Expressions are given for the emergent flux from a homogeneous layer, the internal flux within the layer, and the radiative heating. A comparison of these results with the values calculated from the matrix operator theory indicates an exceedingly high accuracy. A detailed study is made of the error in the matrix operator results and its dependence on the accuracy of the starting value.
Analytical solution of the optimal three dimensional reentry problem using Chapman's exact equations
NASA Technical Reports Server (NTRS)
Vinh, N. X.; Busemann, A.; Culp, R. D.
1974-01-01
This paper presents the general solution for the optimal three dimensional aerodynamic control of a lifting vehicle entering a planetary atmosphere. A set of dimensionless variables is introduced, and the resulting exact equations of motion have the distinctive advantage that they are completely free of the physical characteristics of the vehicle. Furthermore, a general lift-drag polar is used to define the aerodynamic control. Hence, the results obtained apply to any type of vehicle of arbitrary weight, dimensions and shape, having an arbitrary polar and entering any planetary atmosphere.
NASA Technical Reports Server (NTRS)
1943-01-01
This is the third of a series of reports covering an investigation of the general instability problem by the California Institute of Technology. The first five reports of this series cover investigations of the general instability problem under the loading conditions of pure bending and were prepared under the sponsorship of the Civil Aeronautics Administration. The succeeding reports of this series cover the work done on other loading conditions under the sponsorship of the National Advisory Committee for Aeronautics. This report is concerned primarily with the continuation of the tests of wire-braced specimens, and preliminary tests of sheet-covered specimens that had been made in the experimental investigation on the problem of the general instability of stiffened metal cylinders at the C.I.T.
A new neural network model for solving random interval linear programming problems.
Arjmandzadeh, Ziba; Safi, Mohammadreza; Nazemi, Alireza
2017-05-01
This paper presents a neural network model for solving random interval linear programming problems. The original problem involving random interval variable coefficients is first transformed into an equivalent convex second order cone programming problem. A neural network model is then constructed for solving the obtained convex second order cone problem. Employing Lyapunov function approach, it is also shown that the proposed neural network model is stable in the sense of Lyapunov and it is globally convergent to an exact satisfactory solution of the original problem. Several illustrative examples are solved in support of this technique. Copyright © 2017 Elsevier Ltd. All rights reserved.
Proceedings of the 1977 MACSYMA users' conference (NASA)
NASA Technical Reports Server (NTRS)
1977-01-01
The MACSYMA program for symbolic and algebraic manipulation enables exact, symbolic mathematical computations to be performed on a computer. This program is rather large, and various approaches to the hardware and software problems are examined.
Online Case-Based Discussions: Examining Coverage of the Afforded Problem Space
ERIC Educational Resources Information Center
Ertmer, Peggy A.; Koehler, Adrie A.
2014-01-01
Case studies hold great potential for engaging students in disciplinary content. However, little is known about the extent to which students actually cover the problem space afforded by a particular case study. In this research, we compared the problem space afforded by an instructional design case study with the actual content covered by 16…
NASA Astrophysics Data System (ADS)
Cui, Xianghong; Jin, Yunxue; Chen, Wei; Zhang, Qiuyang; Wang, Shuqi
2018-03-01
A self-lubricated oxide-containing tribo-layer was induced to form by continuously adding particles of MoS2, Fe2O3 or their mixtures onto sliding interfaces of AISI H13 and 52100 steels. The artificial tribo-layer was always noticed to form continuously and cover the worn surface (termed as cover-type), whereas the original tribo-layer spontaneously formed with no additive was usually discontinuous and inserted into the substrate (termed as insert-type). Clearly, the cover-type and insert-type tribo-layers exactly corresponded to low and high wear rates, respectively. For the mixed additives of Fe2O3 + MoS2, the protective tribo-layers presented a load-carrying capability and lubricative function, which are attributed to the existence of Fe2O3 and MoS2. Hence, the wear rates and friction coefficients of H13 steel were markedly reduced.
NASA Technical Reports Server (NTRS)
Haefner, H. (Principal Investigator)
1975-01-01
The author has identified the following significant results. Two different methods, an analog and a digital one, have been developed for rapid and accurate mapping of the areal extent and changes in snow cover in high mountains. The quick-look method is based on individual visual control of each image using a photo quantizer which provides exact references for density slicing with high resolution lith-film. The digital snow classification system is based on discriminant analysis with the data of the four multispectral bands as variables and contains all preprocessing, feature extraction, and mapping steps for an operational application. Two different sets of sampling groups were established which apply to different conditions of snow cover. The first one serves for the normal situation with a uniform dry and new cover. The second one serves for situations with partly thawing and/or frozen snow.
The nonconvex multi-dimensional Riemann problem for Hamilton-Jacobi equations
NASA Technical Reports Server (NTRS)
Osher, Stanley
1989-01-01
Simple inequalities for the Riemann problem for a Hamilton-Jacobi equation in N space dimension when neither the initial data nor the Hamiltonian need be convex (or concave) are presented. The initial data is globally continuous, affine in each orthant, with a possible jump in normal derivative across each coordinate plane, x sub i = 0. The inequalities become equalities wherever a maxmin equals a minmax and thus an exact closed form solution to this problem is then obtained.
Radiative interactions in multi-dimensional chemically reacting flows using Monte Carlo simulations
NASA Technical Reports Server (NTRS)
Liu, Jiwen; Tiwari, Surendra N.
1994-01-01
The Monte Carlo method (MCM) is applied to analyze radiative heat transfer in nongray gases. The nongray model employed is based on the statistical narrow band model with an exponential-tailed inverse intensity distribution. The amount and transfer of the emitted radiative energy in a finite volume element within a medium are considered in an exact manner. The spectral correlation between transmittances of two different segments of the same path in a medium makes the statistical relationship different from the conventional relationship, which only provides the non-correlated results for nongray methods is discussed. Validation of the Monte Carlo formulations is conducted by comparing results of this method of other solutions. In order to further establish the validity of the MCM, a relatively simple problem of radiative interactions in laminar parallel plate flows is considered. One-dimensional correlated Monte Carlo formulations are applied to investigate radiative heat transfer. The nongray Monte Carlo solutions are also obtained for the same problem and they also essentially match the available analytical solutions. the exact correlated and non-correlated Monte Carlo formulations are very complicated for multi-dimensional systems. However, by introducing the assumption of an infinitesimal volume element, the approximate correlated and non-correlated formulations are obtained which are much simpler than the exact formulations. Consideration of different problems and comparison of different solutions reveal that the approximate and exact correlated solutions agree very well, and so do the approximate and exact non-correlated solutions. However, the two non-correlated solutions have no physical meaning because they significantly differ from the correlated solutions. An accurate prediction of radiative heat transfer in any nongray and multi-dimensional system is possible by using the approximate correlated formulations. Radiative interactions are investigated in chemically reacting compressible flows of premixed hydrogen and air in an expanding nozzle. The governing equations are based on the fully elliptic Navier-Stokes equations. Chemical reaction mechanisms were described by a finite rate chemistry model. The correlated Monte Carlo method developed earlier was employed to simulate multi-dimensional radiative heat transfer. Results obtained demonstrate that radiative effects on the flowfield are minimal but radiative effects on the wall heat transfer are significant. Extensive parametric studies are conducted to investigate the effects of equivalence ratio, wall temperature, inlet flow temperature, and nozzle size on the radiative and conductive wall fluxes.
NASA Astrophysics Data System (ADS)
Dobaczewski, Jacek
2010-06-01
Nuclear structure theory is a domain of physics faced at present with great challenges and opportunities. A larger and larger body of high-precision experimental data has been and continues to be accumulated. Experiments on very exotic short-lived isotopes are the backbone of activity at numerous large-scale facilities. Over the years, tremendous progress has been made in understanding the basic features of nuclei. However, the theoretical description of nuclear systems is still far from being complete and is often not very precise. Many questions, both basic and practical, remain unanswered. The goal of publishing this special focus issue of Journal of Physics G: Nuclear and Particle Physics on Open Problems in Nuclear Structure Theory (OPeNST) is to construct a fundamental inventory thereof, so that the tasks and available options become more clearly exposed and that this will help to stimulate a boost in theoretical activity, commensurate with the experimental progress. The requested format and scope of the articles on OPeNST was quite flexible. The journal simply offered the possibility to provide a forum for the material, which is very often discussed at conferences during the coffee breaks but does not normally have sufficient substance to form regular publications. Nonetheless, very often formulating a problem provides a major step towards its solution, and it may constitute a scientific achievement on its own. Prospective authors were therefore invited to find their own balance between the two extremes of very general problems on the one hand (for example, to solve exactly the many-body equations for a hundred particles) and very specific problems on the other hand (for example, those that one could put in one's own grant proposal). The authors were also asked not to cover results already obtained, nor to limit their presentations to giving a review of the subject, although some elements of those could be included to properly introduce the subject matter. The focus of these collected articles is therefore on the discussion of topics that are not yet understood, or that are poorly understood. We very much welcomed presentations on: (i) contradictory approaches, models, or theories that are, at present, difficult to reconcile, (ii) unsolved theoretical problems that hamper applications of existing methods, (iii) limitations of current approaches, (iv) difficulties in deriving and justifying models and theories, (v) generic problems in understanding or describing specific experimental data, and even (vi) all possible, wildest speculations and/or conjectures. The main idea behind the focus issue was to stimulate creative, unbounded thinking and provide young, but not only young, researchers with ideas that would promote further progress in this domain of science. The community of nuclear structure theorists enthusiastically responded to the idea of publishing the volume on OPeNST. It seemed that the idea struck the right chord and many colleagues were willing to share their observations on what research directions to follow and which problems to attack. The volume turned out to be a snapshot of the domain, revealing the burning questions that the community wants to address. All the articles also have a very interesting personal touch. They sometimes even present opposing or conflicting points of view, which is exactly what one would expect within a vibrant scientific discussion. All in all, the Editors of Journal of Physics G are very happy to offer you this unique collection, which will constitute very interesting reading for all those working in nuclear structure theory.
Frames for exact inversion of the rank order coder.
Masmoudi, Khaled; Antonini, Marc; Kornprobst, Pierre
2012-02-01
Our goal is to revisit rank order coding by proposing an original exact decoding procedure for it. Rank order coding was proposed by Thorpe et al. who stated that the order in which the retina cells are activated encodes for the visual stimulus. Based on this idea, the authors proposed in [1] a rank order coder/decoder associated to a retinal model. Though, it appeared that the decoding procedure employed yields reconstruction errors that limit the model bit-cost/quality performances when used as an image codec. The attempts made in the literature to overcome this issue are time consuming and alter the coding procedure, or are lacking mathematical support and feasibility for standard size images. Here we solve this problem in an original fashion by using the frames theory, where a frame of a vector space designates an extension for the notion of basis. Our contribution is twofold. First, we prove that the analyzing filter bank considered is a frame, and then we define the corresponding dual frame that is necessary for the exact image reconstruction. Second, to deal with the problem of memory overhead, we design a recursive out-of-core blockwise algorithm for the computation of this dual frame. Our work provides a mathematical formalism for the retinal model under study and defines a simple and exact reverse transform for it with over than 265 dB of increase in the peak signal-to-noise ratio quality compared to [1]. Furthermore, the framework presented here can be extended to several models of the visual cortical areas using redundant representations.
NASA Astrophysics Data System (ADS)
Krapez, J.-C.
2018-07-01
This work deals with the exact analytical modeling of transfer phenomena in heterogeneous materials exhibiting one-dimensional continuous variations of their properties. Regarding heat transfer, it has recently been shown that by applying a Liouville transformation and multiple Darboux transformations, infinite sequences of solvable profiles of thermal effusivity can be constructed together with the associated temperature (exact) solutions, all in closed-form expressions (vs. the diffusion-time variable and with a growing number of parameters). In addition, a particular class of profiles, the so-called {sech}( {\\hat{ξ }} ) -type profiles, exhibit high agility and at the same time parsimony. In this paper we delve further into the description of these solvable profiles and their properties. Most importantly, their quadrupole formulation is provided, enabling smooth synthetic profiles of effusivity of arbitrary complexity to be built, and allowing the corresponding temperature dynamic response to be obtained very easily thereafter. Examples are given with increasing variability of the effusivity and an increasing number of elementary profiles. These highly flexible profiles are equally relevant to providing an exact analytical solution to wave propagation problems in 1D graded media (i.e., Maxwell's equations, the acoustic equation, the telegraph equation, etc.). From now on, whether it be for diffusion-like or wave-like problems, when the leading properties present (possibly piecewise-) continuously heterogeneous profiles, the classical staircase model can be advantageously replaced by a "high-level" quadrupole model consisting of one or more {sech}( {\\hat{ξ }} ) -type profiles, which makes the latter a true Swiss-Army knife for analytical modeling.
Path Following in the Exact Penalty Method of Convex Programming.
Zhou, Hua; Lange, Kenneth
2015-07-01
Classical penalty methods solve a sequence of unconstrained problems that put greater and greater stress on meeting the constraints. In the limit as the penalty constant tends to ∞, one recovers the constrained solution. In the exact penalty method, squared penalties are replaced by absolute value penalties, and the solution is recovered for a finite value of the penalty constant. In practice, the kinks in the penalty and the unknown magnitude of the penalty constant prevent wide application of the exact penalty method in nonlinear programming. In this article, we examine a strategy of path following consistent with the exact penalty method. Instead of performing optimization at a single penalty constant, we trace the solution as a continuous function of the penalty constant. Thus, path following starts at the unconstrained solution and follows the solution path as the penalty constant increases. In the process, the solution path hits, slides along, and exits from the various constraints. For quadratic programming, the solution path is piecewise linear and takes large jumps from constraint to constraint. For a general convex program, the solution path is piecewise smooth, and path following operates by numerically solving an ordinary differential equation segment by segment. Our diverse applications to a) projection onto a convex set, b) nonnegative least squares, c) quadratically constrained quadratic programming, d) geometric programming, and e) semidefinite programming illustrate the mechanics and potential of path following. The final detour to image denoising demonstrates the relevance of path following to regularized estimation in inverse problems. In regularized estimation, one follows the solution path as the penalty constant decreases from a large value.
Path Following in the Exact Penalty Method of Convex Programming
Zhou, Hua; Lange, Kenneth
2015-01-01
Classical penalty methods solve a sequence of unconstrained problems that put greater and greater stress on meeting the constraints. In the limit as the penalty constant tends to ∞, one recovers the constrained solution. In the exact penalty method, squared penalties are replaced by absolute value penalties, and the solution is recovered for a finite value of the penalty constant. In practice, the kinks in the penalty and the unknown magnitude of the penalty constant prevent wide application of the exact penalty method in nonlinear programming. In this article, we examine a strategy of path following consistent with the exact penalty method. Instead of performing optimization at a single penalty constant, we trace the solution as a continuous function of the penalty constant. Thus, path following starts at the unconstrained solution and follows the solution path as the penalty constant increases. In the process, the solution path hits, slides along, and exits from the various constraints. For quadratic programming, the solution path is piecewise linear and takes large jumps from constraint to constraint. For a general convex program, the solution path is piecewise smooth, and path following operates by numerically solving an ordinary differential equation segment by segment. Our diverse applications to a) projection onto a convex set, b) nonnegative least squares, c) quadratically constrained quadratic programming, d) geometric programming, and e) semidefinite programming illustrate the mechanics and potential of path following. The final detour to image denoising demonstrates the relevance of path following to regularized estimation in inverse problems. In regularized estimation, one follows the solution path as the penalty constant decreases from a large value. PMID:26366044
Lake Erie Wastewater Management Study.
1982-09-01
quality problems, the causes of these problems, and a cost- effective strategy to improve Lake Erie’s water quality.Numerous questions remain...unanswered about the exact relationship between land use and water quality and about the effectiveness of the proposed management strategy. However, enough...Dr. Terry J. Logan of Ohio State University who wrote the biological availa- bility section and developed cost effectiveness of different Best
1975-10-08
Aristotle Parmenides Philosophy Union of opposites...the union of opposites. Even in Heraclitus’s day, however, opinion on the problem of change was sharply divided; e.g., Parmenides regarded change...challenge. Also, if one closely examines the reasoning of Parmenides , one can advance it one step further. It is perfectly logical to state that
2007-02-20
above hypothesis, we must examine the seams of the operation. They are force structuring, distribution management , logistics intelligence, and customer...Iron Mountains, which is exactly what happened. Distribution Management ALOC distribution management problems included an ineffective theater tracking...deployments later the problems remained the same. Force structure and distribution management issues, the use of manual “non-standard” requisition
Cosmological measure with volume averaging and the vacuum energy problem
NASA Astrophysics Data System (ADS)
Astashenok, Artyom V.; del Popolo, Antonino
2012-04-01
In this paper, we give a possible solution to the cosmological constant problem. It is shown that the traditional approach, based on volume weighting of probabilities, leads to an incoherent conclusion: the probability that a randomly chosen observer measures Λ = 0 is exactly equal to 1. Using an alternative, volume averaging measure, instead of volume weighting can explain why the cosmological constant is non-zero.
Elucidation of Heterogeneous Processes Controlling Boost Phase Signatures
1990-09-12
three year research program to develop efficient theoretical methods to study collisional processes involved in radiative signature modeling . The...Marlboro, MD 20772 I. Statement of Problem For strategic defense, it is important to be able to effectively model radiative signaturesl arising from...Thus our computational work was on problems or models for which exact results for making comparisons were available. Our key validations were
Chung M. Chen; Dietmar W. Rose; Rolfe A. Leary
1980-01-01
Describes how dynamic programming can be used to solve optimal stand density problems when yields are given by prior simulation or by a new stand growth equation that is a function of the decision variable. Formulations of the latter type allow use of a calculus-based search procedure; they determine exact optimal residual density at each stage.
Finite Optimal Stopping Problems: The Seller's Perspective
ERIC Educational Resources Information Center
Hemmati, Mehdi; Smith, J. Cole
2011-01-01
We consider a version of an optimal stopping problem, in which a customer is presented with a finite set of items, one by one. The customer is aware of the number of items in the finite set and the minimum and maximum possible value of each item, and must purchase exactly one item. When an item is presented to the customer, she or he observes its…
Confined One Dimensional Harmonic Oscillator as a Two-Mode System
DOE Office of Scientific and Technical Information (OSTI.GOV)
Gueorguiev, V G; Rau, A P; Draayer, J P
2005-07-11
The one-dimensional harmonic oscillator in a box problem is possibly the simplest example of a two-mode system. This system has two exactly solvable limits, the harmonic oscillator and a particle in a (one-dimensional) box. Each of the two limits has a characteristic spectral structure describing the two different excitation modes of the system. Near each of these limits, one can use perturbation theory to achieve an accurate description of the eigenstates. Away from the exact limits, however, one has to carry out a matrix diagonalization because the basis-state mixing that occurs is typically too large to be reproduced in anymore » other way. An alternative to casting the problem in terms of one or the other basis set consists of using an ''oblique'' basis that uses both sets. Through a study of this alternative in this one-dimensional problem, we are able to illustrate practical solutions and infer the applicability of the concept for more complex systems, such as in the study of complex nuclei where oblique-basis calculations have been successful.« less
DOE Office of Scientific and Technical Information (OSTI.GOV)
Wang, Y. B.; Zhu, X. W., E-mail: xiaowuzhu1026@znufe.edu.cn; Dai, H. H.
Though widely used in modelling nano- and micro- structures, Eringen’s differential model shows some inconsistencies and recent study has demonstrated its differences between the integral model, which then implies the necessity of using the latter model. In this paper, an analytical study is taken to analyze static bending of nonlocal Euler-Bernoulli beams using Eringen’s two-phase local/nonlocal model. Firstly, a reduction method is proved rigorously, with which the integral equation in consideration can be reduced to a differential equation with mixed boundary value conditions. Then, the static bending problem is formulated and four types of boundary conditions with various loadings aremore » considered. By solving the corresponding differential equations, exact solutions are obtained explicitly in all of the cases, especially for the paradoxical cantilever beam problem. Finally, asymptotic analysis of the exact solutions reveals clearly that, unlike the differential model, the integral model adopted herein has a consistent softening effect. Comparisons are also made with existing analytical and numerical results, which further shows the advantages of the analytical results obtained. Additionally, it seems that the once controversial nonlocal bar problem in the literature is well resolved by the reduction method.« less
Niedz, Randall P
2016-01-01
ARS-Media for Excel is an ion solution calculator that uses "Microsoft Excel" to generate recipes of salts for complex ion mixtures specified by the user. Generating salt combinations (recipes) that result in pre-specified target ion values is a linear programming problem. Excel's Solver add-on solves the linear programming equation to generate a recipe. Calculating a mixture of salts to generate exact solutions of complex ionic mixtures is required for at least 2 types of problems- 1) formulating relevant ecological/biological ionic solutions such as those from a specific lake, soil, cell, tissue, or organ and, 2) designing ion confounding-free experiments to determine ion-specific effects where ions are treated as statistical factors. Using ARS-Media for Excel to solve these two problems is illustrated by 1) exactly reconstructing a soil solution representative of a loamy agricultural soil and, 2) constructing an ion-based experiment to determine the effects of substituting Na+ for K+ on the growth of a Valencia sweet orange nonembryogenic cell line.
NASA Astrophysics Data System (ADS)
Mukherjee, Anamitra; Patel, Niravkumar D.; Bishop, Chris; Dagotto, Elbio
2015-06-01
Lattice spin-fermion models are important to study correlated systems where quantum dynamics allows for a separation between slow and fast degrees of freedom. The fast degrees of freedom are treated quantum mechanically while the slow variables, generically referred to as the "spins," are treated classically. At present, exact diagonalization coupled with classical Monte Carlo (ED + MC) is extensively used to solve numerically a general class of lattice spin-fermion problems. In this common setup, the classical variables (spins) are treated via the standard MC method while the fermion problem is solved by exact diagonalization. The "traveling cluster approximation" (TCA) is a real space variant of the ED + MC method that allows to solve spin-fermion problems on lattice sizes with up to 103 sites. In this publication, we present a novel reorganization of the TCA algorithm in a manner that can be efficiently parallelized. This allows us to solve generic spin-fermion models easily on 104 lattice sites and with some effort on 105 lattice sites, representing the record lattice sizes studied for this family of models.
Analytic Formulation and Numerical Implementation of an Acoustic Pressure Gradient Prediction
NASA Technical Reports Server (NTRS)
Lee, Seongkyu; Brentner, Kenneth S.; Farassat, F.; Morris, Philip J.
2008-01-01
Two new analytical formulations of the acoustic pressure gradient have been developed and implemented in the PSU-WOPWOP rotor noise prediction code. The pressure gradient can be used to solve the boundary condition for scattering problems and it is a key aspect to solve acoustic scattering problems. The first formulation is derived from the gradient of the Ffowcs Williams-Hawkings (FW-H) equation. This formulation has a form involving the observer time differentiation outside the integrals. In the second formulation, the time differentiation is taken inside the integrals analytically. This formulation avoids the numerical time differentiation with respect to the observer time, which is computationally more efficient. The acoustic pressure gradient predicted by these new formulations is validated through comparison with available exact solutions for a stationary and moving monopole sources. The agreement between the predictions and exact solutions is excellent. The formulations are applied to the rotor noise problems for two model rotors. A purely numerical approach is compared with the analytical formulations. The agreement between the analytical formulations and the numerical method is excellent for both stationary and moving observer cases.
Pernu, Tuomas K.
2017-01-01
The mental realm seems different to the physical realm; the mental is thought to be dependent on, yet distinct from the physical. But how, exactly, are the two realms supposed to be different, and what, exactly, creates the seemingly insurmountable juxtaposition between the mental and the physical? This review identifies and discusses five marks of the mental, features that set characteristically mental phenomena apart from the characteristically physical phenomena. These five marks (intentionality, consciousness, free will, teleology, and normativity) are not presented as a set of features that define mentality. Rather, each of them is something we seem to associate with phenomena we consider mental, and each of them seems to be in tension with the physical view of reality in its own particular way. It is thus suggested how there is no single mind-body problem, but a set of distinct but interconnected problems. Each of these separate problems is analyzed, and their differences, similarities and connections are identified. This provides a useful basis for future theoretical work on psychology and philosophy of mind, that until now has too often suffered from unclarities, inadequacies, and conflations. PMID:28736537
NASA Astrophysics Data System (ADS)
Grinevich, P. G.; Santini, P. M.
2018-04-01
The focusing Nonlinear Schrödinger (NLS) equation is the simplest universal model describing the modulation instability (MI) of quasi monochromatic waves in weakly nonlinear media, the main physical mechanism for the generation of rogue (anomalous) waves (RWs) in Nature. In this paper we investigate the x-periodic Cauchy problem for NLS for a generic periodic initial perturbation of the unstable constant background solution, in the case of N = 1 , 2 unstable modes. We use matched asymptotic expansion techniques to show that the solution of this problem describes an exact deterministic alternate recurrence of linear and nonlinear stages of MI, and that the nonlinear RW stages are described by the N-breather solution of Akhmediev type, whose parameters, different at each RW appearance, are always given in terms of the initial data through elementary functions. This paper is motivated by a preceding work of the authors in which a different approach, the finite gap method, was used to investigate periodic Cauchy problems giving rise to RW recurrence.
Vögeli, Beat; Orts, Julien; Strotz, Dean; Chi, Celestine; Minges, Martina; Wälti, Marielle Aulikki; Güntert, Peter; Riek, Roland
2014-04-01
Confined by the Boltzmann distribution of the energies of the states, a multitude of structural states are inherent to biomolecules. For a detailed understanding of a protein's function, its entire structural landscape at atomic resolution and insight into the interconversion between all the structural states (i.e. dynamics) are required. Whereas dedicated trickery with NMR relaxation provides aspects of local dynamics, and 3D structure determination by NMR is well established, only recently have several attempts been made to formulate a more comprehensive description of the dynamics and the structural landscape of a protein. Here, a perspective is given on the use of exact NOEs (eNOEs) for the elucidation of structural ensembles of a protein describing the covered conformational space. Copyright © 2013 Elsevier Inc. All rights reserved.
ERIC Educational Resources Information Center
Collyer, A. A.
1973-01-01
Discusses theories underlying Newtonian and non-Newtonian fluids by explaining flow curves exhibited by plastic, shear-thining, and shear-thickening fluids and Bingham plastic materials. Indicates that the exact mechanism governing shear-thickening behaviors is a problem of further study. (CC)
... report). The biopsy test is not an exact science. In cases of difficult or unusual problems, second opinions can be helpful. Back to Index The medical information provided in this site is for educational purposes only and is the property of the American ...
Spectral partitioning in equitable graphs.
Barucca, Paolo
2017-06-01
Graph partitioning problems emerge in a wide variety of complex systems, ranging from biology to finance, but can be rigorously analyzed and solved only for a few graph ensembles. Here, an ensemble of equitable graphs, i.e., random graphs with a block-regular structure, is studied, for which analytical results can be obtained. In particular, the spectral density of this ensemble is computed exactly for a modular and bipartite structure. Kesten-McKay's law for random regular graphs is found analytically to apply also for modular and bipartite structures when blocks are homogeneous. An exact solution to graph partitioning for two equal-sized communities is proposed and verified numerically, and a conjecture on the absence of an efficient recovery detectability transition in equitable graphs is suggested. A final discussion summarizes results and outlines their relevance for the solution of graph partitioning problems in other graph ensembles, in particular for the study of detectability thresholds and resolution limits in stochastic block models.
An exact algebraic solution of the infimum in H-infinity optimization with output feedback
NASA Technical Reports Server (NTRS)
Chen, Ben M.; Saberi, Ali; Ly, Uy-Loi
1991-01-01
This paper presents a simple and noniterative procedure for the computation of the exact value of the infimum in the standard H-infinity-optimal control with output feedback. The problem formulation is general and does not place any restrictions on the direct feedthrough terms between the control input and the controlled output variables, and between the disturbance input and the measurement output variables. The method is applicable to systems that satisfy (1) the transfer function from the control input to the controlled output is right-invertible and has no invariant zeros on the j(w) axis and, (2) the transfer function from the disturbance to the measurement output is left-invertible and has no invariant zeros on the j(w) axis. A set of necessary and sufficient conditions for the solvability of H-infinity-almost disturbance decoupling problem via measurement feedback with internal stability is also given.
ANALYZING NUMERICAL ERRORS IN DOMAIN HEAT TRANSPORT MODELS USING THE CVBEM.
Hromadka, T.V.; ,
1985-01-01
Besides providing an exact solution for steady-state heat conduction processes (Laplace Poisson equations), the CVBEM (complex variable boundary element method) can be used for the numerical error analysis of domain model solutions. For problems where soil water phase change latent heat effects dominate the thermal regime, heat transport can be approximately modeled as a time-stepped steady-state condition in the thawed and frozen regions, respectively. The CVBEM provides an exact solution of the two-dimensional steady-state heat transport problem, and also provides the error in matching the prescribed boundary conditions by the development of a modeling error distribution or an approximative boundary generation. This error evaluation can be used to develop highly accurate CVBEM models of the heat transport process, and the resulting model can be used as a test case for evaluating the precision of domain models based on finite elements or finite differences.
A Reconstruction Approach to High-Order Schemes Including Discontinuous Galerkin for Diffusion
NASA Technical Reports Server (NTRS)
Huynh, H. T.
2009-01-01
We introduce a new approach to high-order accuracy for the numerical solution of diffusion problems by solving the equations in differential form using a reconstruction technique. The approach has the advantages of simplicity and economy. It results in several new high-order methods including a simplified version of discontinuous Galerkin (DG). It also leads to new definitions of common value and common gradient quantities at each interface shared by the two adjacent cells. In addition, the new approach clarifies the relations among the various choices of new and existing common quantities. Fourier stability and accuracy analyses are carried out for the resulting schemes. Extensions to the case of quadrilateral meshes are obtained via tensor products. For the two-point boundary value problem (steady state), it is shown that these schemes, which include most popular DG methods, yield exact common interface quantities as well as exact cell average solutions for nearly all cases.
Spectral partitioning in equitable graphs
NASA Astrophysics Data System (ADS)
Barucca, Paolo
2017-06-01
Graph partitioning problems emerge in a wide variety of complex systems, ranging from biology to finance, but can be rigorously analyzed and solved only for a few graph ensembles. Here, an ensemble of equitable graphs, i.e., random graphs with a block-regular structure, is studied, for which analytical results can be obtained. In particular, the spectral density of this ensemble is computed exactly for a modular and bipartite structure. Kesten-McKay's law for random regular graphs is found analytically to apply also for modular and bipartite structures when blocks are homogeneous. An exact solution to graph partitioning for two equal-sized communities is proposed and verified numerically, and a conjecture on the absence of an efficient recovery detectability transition in equitable graphs is suggested. A final discussion summarizes results and outlines their relevance for the solution of graph partitioning problems in other graph ensembles, in particular for the study of detectability thresholds and resolution limits in stochastic block models.
NASA Astrophysics Data System (ADS)
Das Gupta, Santanu; Das Gupta, S. R.
1991-10-01
The flow of laser radiation in a plane-parallel cylindrical slab of active amplifying medium with axial symmetry is treated as a problem in radiative transfer. The appropriate one-dimensional transfer equation describing the transfer of laser radiation has been derived by an appeal to Einstein'sA, B coefficients (describing the processes of stimulated line absorption, spontaneous line emission, and stimulated line emission sustained by population inversion in the medium) and considering the ‘rate equations’ to completely establish the rational of the transfer equation obtained. The equation is then exactly solved and the angular distribution of the emergent laser beam intensity is obtained; its numerically computed values are given in tables and plotted in graphs showing the nature of peaks of the emerging laser beam intensity about the axis of the laser cylinder.
Fast Construction of Near Parsimonious Hybridization Networks for Multiple Phylogenetic Trees.
Mirzaei, Sajad; Wu, Yufeng
2016-01-01
Hybridization networks represent plausible evolutionary histories of species that are affected by reticulate evolutionary processes. An established computational problem on hybridization networks is constructing the most parsimonious hybridization network such that each of the given phylogenetic trees (called gene trees) is "displayed" in the network. There have been several previous approaches, including an exact method and several heuristics, for this NP-hard problem. However, the exact method is only applicable to a limited range of data, and heuristic methods can be less accurate and also slow sometimes. In this paper, we develop a new algorithm for constructing near parsimonious networks for multiple binary gene trees. This method is more efficient for large numbers of gene trees than previous heuristics. This new method also produces more parsimonious results on many simulated datasets as well as a real biological dataset than a previous method. We also show that our method produces topologically more accurate networks for many datasets.
Small-on-large geometric anelasticity
2016-01-01
In this paper, we are concerned with finding exact solutions for the stress fields of nonlinear solids with non-symmetric distributions of defects (or more generally finite eigenstrains) that are small perturbations of symmetric distributions of defects with known exact solutions. In the language of geometric mechanics, this corresponds to finding a deformation that is a result of a perturbation of the metric of the Riemannian material manifold. We present a general framework that can be used for a systematic analysis of this class of anelasticity problems. This geometric formulation can be thought of as a material analogue of the classical small-on-large theory in nonlinear elasticity. We use the present small-on-large anelasticity theory to find exact solutions for the stress fields of some non-symmetric distributions of screw dislocations in incompressible isotropic solids. PMID:27956887
Exact solution for four-order acousto-optic Bragg diffraction with arbitrary initial conditions.
Pieper, Ron; Koslover, Deborah; Poon, Ting-Chung
2009-03-01
An exact solution to the four-order acousto-optic (AO) Bragg diffraction problem with arbitrary initial conditions compatible with exact Bragg angle incident light is developed. The solution, obtained by solving a 4th-order differential equation, is formalized into a transition matrix operator predicting diffracted light orders at the exit of the AO cell in terms of the same diffracted light orders at the entrance. It is shown that the transition matrix is unitary and that this unitary matrix condition is sufficient to guarantee energy conservation. A comparison of analytical solutions with numerical predictions validates the formalism. Although not directly related to the approach used to obtain the solution, it was discovered that all four generated eigenvalues from the four-order AO differential matrix operator are expressed simply in terms of Euclid's Divine Proportion.
Wylie, Judith; Jordan, Julie-Ann; Mulhern, Gerry
2012-09-01
This longitudinal study sought to identify developmental changes in strategy use between 5 and 7 years of age when solving exact calculation problems. Four mathematics and reading achievement subtypes were examined at four time points. Five strategies were considered: finger counting, verbal counting, delayed retrieval, automatic retrieval, and derived fact retrieval. Results provided unique insights into children's strategic development in exact calculation at this early stage. Group analysis revealed relationships between mathematical and/or reading difficulties and strategy choice, shift, and adaptiveness. Use of derived fact retrieval by 7 years of age distinguished children with mathematical difficulties from other achievement subtypes. Analysis of individual differences revealed marked heterogeneity within all subtypes, suggesting (inter alia) no marked qualitative distinction between our two mathematical difficulty subtypes. Copyright © 2012 Elsevier Inc. All rights reserved.
ERIC Educational Resources Information Center
Poncy, Brian C.; Skinner, Christopher H.; McCallum, Elizabeth
2012-01-01
An adapted alternating treatments design was used to compare the effects of class-wide applications of Taped Problems (TP) and Cover, Copy, and Compare (CCC) procedures designed to enhance subtraction fact fluency in an intact third-grade classroom. During the TP procedure, a tape provided an auditory prompt (i.e., the problem), followed by a…
Exact and Approximate Solutions for Transient Squeezing Flow
NASA Astrophysics Data System (ADS)
Lang, Ji; Santhanam, Sridhar; Wu, Qianhong
2017-11-01
In this paper, we report two novel theoretical approaches to examine a fast-developing flow in a thin fluid gap, which is widely observed in industrial applications and biological systems. The problem is featured by a very small Reynolds number and Strouhal number, making the fluid convective acceleration is negligible, while its local acceleration is not. We have developed an exact solution for this problem which shows that the flow starts with an inviscid limit when the viscous effect has no time to appear, and is followed by a subsequent developing flow, in which the viscous effect continues to penetrate into the entire fluid gap. An approximate solution is also developed using a boundary layer integral method. This solution precisely captures the general behavior of the transient fluid flow process, and agrees very well with the exact solution. We also performed numerical simulation using Ansys-CFX. Excellent agreement between the analytical and the numerical solutions is obtained, indicating the validity of the analytical approaches. The study presented herein fills the gap in the literature, and will have a broad impact in industrial and biomedical applications. This work is supported by National Science Foundation CBET Fluid Dynamics Program under Award #1511096, and supported by the Seed Grant from The Villanova Center for the Advancement of Sustainability in Engineering (VCASE).
Exact semi-separation of variables in waveguides with non-planar boundaries
NASA Astrophysics Data System (ADS)
Athanassoulis, G. A.; Papoutsellis, Ch. E.
2017-05-01
Series expansions of unknown fields Φ =∑φn Zn in elongated waveguides are commonly used in acoustics, optics, geophysics, water waves and other applications, in the context of coupled-mode theories (CMTs). The transverse functions Zn are determined by solving local Sturm-Liouville problems (reference waveguides). In most cases, the boundary conditions assigned to Zn cannot be compatible with the physical boundary conditions of Φ, leading to slowly convergent series, and rendering CMTs mild-slope approximations. In the present paper, the heuristic approach introduced in Athanassoulis & Belibassakis (Athanassoulis & Belibassakis 1999 J. Fluid Mech. 389, 275-301) is generalized and justified. It is proved that an appropriately enhanced series expansion becomes an exact, rapidly convergent representation of the field Φ, valid for any smooth, non-planar boundaries and any smooth enough Φ. This series expansion can be differentiated termwise everywhere in the domain, including the boundaries, implementing an exact semi-separation of variables for non-separable domains. The efficiency of the method is illustrated by solving a boundary value problem for the Laplace equation, and computing the corresponding Dirichlet-to-Neumann operator, involved in Hamiltonian equations for nonlinear water waves. The present method provides accurate results with only a few modes for quite general domains. Extensions to general waveguides are also discussed.
High-Order Hyperbolic Residual-Distribution Schemes on Arbitrary Triangular Grids
NASA Technical Reports Server (NTRS)
Mazaheri, Alireza; Nishikawa, Hiroaki
2015-01-01
In this paper, we construct high-order hyperbolic residual-distribution schemes for general advection-diffusion problems on arbitrary triangular grids. We demonstrate that the second-order accuracy of the hyperbolic schemes can be greatly improved by requiring the scheme to preserve exact quadratic solutions. We also show that the improved second-order scheme can be easily extended to third-order by further requiring the exactness for cubic solutions. We construct these schemes based on the LDA and the SUPG methodology formulated in the framework of the residual-distribution method. For both second- and third-order-schemes, we construct a fully implicit solver by the exact residual Jacobian of the second-order scheme, and demonstrate rapid convergence of 10-15 iterations to reduce the residuals by 10 orders of magnitude. We demonstrate also that these schemes can be constructed based on a separate treatment of the advective and diffusive terms, which paves the way for the construction of hyperbolic residual-distribution schemes for the compressible Navier-Stokes equations. Numerical results show that these schemes produce exceptionally accurate and smooth solution gradients on highly skewed and anisotropic triangular grids, including curved boundary problems, using linear elements. We also present Fourier analysis performed on the constructed linear system and show that an under-relaxation parameter is needed for stabilization of Gauss-Seidel relaxation.
NASA Astrophysics Data System (ADS)
Kim, Jin-Hong; Lee, Jun-Seok; Lim, Jungshik; Seo, Jung-Kyo
2009-03-01
Narrow gap distance in cover-layer incident near-field recording (NFR) configuration causes a collision problem in the interface between a solid immersion lens and a disk surface. A polymer cover-layer with smooth surface results in a stable gap servo while a nanocomposite cover-layer with high refractive index shows a collision problem during the gap servo test. Even though a dielectric cover-layer, in which the surface is rougher than the polymer, supplements the mechanical properties, an unclear eye pattern due to an unstable gap servo can be obtained after a chemical mechanical polishing. Not only smooth surface but also good mechanical properties of cover-layer are required for the stable gap servo in the NFR.
An Algorithm for the Weighted Earliness-Tardiness Unconstrained Project Scheduling Problem
NASA Astrophysics Data System (ADS)
Afshar Nadjafi, Behrouz; Shadrokh, Shahram
This research considers a project scheduling problem with the object of minimizing weighted earliness-tardiness penalty costs, taking into account a deadline for the project and precedence relations among the activities. An exact recursive method has been proposed for solving the basic form of this problem. We present a new depth-first branch and bound algorithm for extended form of the problem, which time value of money is taken into account by discounting the cash flows. The algorithm is extended with two bounding rules in order to reduce the size of the branch and bound tree. Finally, some test problems are solved and computational results are reported.
Wave interactions in a three-dimensional attachment line boundary layer
NASA Technical Reports Server (NTRS)
Hall, Philip; Mackerrell, Sharon O.
1988-01-01
The 3-D boundary layer on a swept wing can support different types of hydrodynamic instability. Attention is focused on the so-called spanwise contamination problem, which occurs when the attachment line boundary layer on the leading edge becomes unstable to Tollmien-Schlichting waves. In order to gain insight into the interactions important in that problem, a simplified basic state is considered. This simplified flow corresponds to the swept attachment line boundary layer on an infinite flat plate. The basic flow here is an exact solution of the Navier-Stokes equations and its stability to 2-D waves propagating along the attachment can be considered exactly at finite Reynolds number. This has been done in the linear and weakly nonlinear regimes. The corresponding problem is studied for oblique waves and their interaction with 2-D waves is investigated. In fact, oblique modes cannot be described exactly at finite Reynolds number so it is necessary to make a high Reynolds number approximation and use triple deck theory. It is shown that there are two types of oblique wave which, if excited, cause the destabilization of the 2-D mode and the breakdown of the disturbed flow at a finite distance from the leading edge. First, a low frequency mode related to the viscous stationary crossflow mode is a possible cause of breakdown. Second, a class of oblique wave with frequency comparable with that of the 2-D mode is another cause of breakdown. It is shown that the relative importance of the modes depends on the distance from the attachment line.
Treatment of ice cover and other thin elastic layers with the parabolic equation method.
Collins, Michael D
2015-03-01
The parabolic equation method is extended to handle problems involving ice cover and other thin elastic layers. Parabolic equation solutions are based on rational approximations that are designed using accuracy constraints to ensure that the propagating modes are handled properly and stability constrains to ensure that the non-propagating modes are annihilated. The non-propagating modes are especially problematic for problems involving thin elastic layers. It is demonstrated that stable results may be obtained for such problems by using rotated rational approximations [Milinazzo, Zala, and Brooke, J. Acoust. Soc. Am. 101, 760-766 (1997)] and generalizations of these approximations. The approach is applied to problems involving ice cover with variable thickness and sediment layers that taper to zero thickness.
Sorting cancer karyotypes using double-cut-and-joins, duplications and deletions.
Zeira, Ron; Shamir, Ron
2018-05-03
Problems of genome rearrangement are central in both evolution and cancer research. Most genome rearrangement models assume that the genome contains a single copy of each gene and the only changes in the genome are structural, i.e., reordering of segments. In contrast, tumor genomes also undergo numerical changes such as deletions and duplications, and thus the number of copies of genes varies. Dealing with unequal gene content is a very challenging task, addressed by few algorithms to date. More realistic models are needed to help trace genome evolution during tumorigenesis. Here we present a model for the evolution of genomes with multiple gene copies using the operation types double-cut-and-joins, duplications and deletions. The events supported by the model are reversals, translocations, tandem duplications, segmental deletions, and chromosomal amplifications and deletions, covering most types of structural and numerical changes observed in tumor samples. Our goal is to find a series of operations of minimum length that transform one karyotype into the other. We show that the problem is NP-hard and give an integer linear programming formulation that solves the problem exactly under some mild assumptions. We test our method on simulated genomes and on ovarian cancer genomes. Our study advances the state of the art in two ways: It allows a broader set of operations than extant models, thus being more realistic, and it is the first study attempting to reconstruct the full sequence of structural and numerical events during cancer evolution. Code and data are available in https://github.com/Shamir-Lab/Sorting-Cancer-Karyotypes. ronzeira@post.tau.ac.il, rshamir@tau.ac.il. Supplementary data are available at Bioinformatics online.
General method of solving the Schroedinger equation of atoms and molecules
DOE Office of Scientific and Technical Information (OSTI.GOV)
Nakatsuji, Hiroshi
2005-12-15
We propose a general method of solving the Schroedinger equation of atoms and molecules. We first construct the wave function having the exact structure, using the ICI (iterative configuration or complement interaction) method and then optimize the variables involved by the variational principle. Based on the scaled Schroedinger equation and related principles, we can avoid the singularity problem of atoms and molecules and formulate a general method of calculating the exact wave functions in an analytical expansion form. We choose initial function {psi}{sub 0} and scaling g function, and then the ICI method automatically generates the wave function that hasmore » the exact structure by using the Hamiltonian of the system. The Hamiltonian contains all the information of the system. The free ICI method provides a flexible and variationally favorable procedure of constructing the exact wave function. We explain the computational procedure of the analytical ICI method routinely performed in our laboratory. Simple examples are given using hydrogen atom for the nuclear singularity case, the Hooke's atom for the electron singularity case, and the helium atom for both cases.« less
Citation Matching in Sanskrit Corpora Using Local Alignment
NASA Astrophysics Data System (ADS)
Prasad, Abhinandan S.; Rao, Shrisha
Citation matching is the problem of finding which citation occurs in a given textual corpus. Most existing citation matching work is done on scientific literature. The goal of this paper is to present methods for performing citation matching on Sanskrit texts. Exact matching and approximate matching are the two methods for performing citation matching. The exact matching method checks for exact occurrence of the citation with respect to the textual corpus. Approximate matching is a fuzzy string-matching method which computes a similarity score between an individual line of the textual corpus and the citation. The Smith-Waterman-Gotoh algorithm for local alignment, which is generally used in bioinformatics, is used here for calculating the similarity score. This similarity score is a measure of the closeness between the text and the citation. The exact- and approximate-matching methods are evaluated and compared. The methods presented can be easily applied to corpora in other Indic languages like Kannada, Tamil, etc. The approximate-matching method can in particular be used in the compilation of critical editions and plagiarism detection in a literary work.
Novel view synthesis by interpolation over sparse examples
NASA Astrophysics Data System (ADS)
Liang, Bodong; Chung, Ronald C.
2006-01-01
Novel view synthesis (NVS) is an important problem in image rendering. It involves synthesizing an image of a scene at any specified (novel) viewpoint, given some images of the scene at a few sample viewpoints. The general understanding is that the solution should bypass explicit 3-D reconstruction of the scene. As it is, the problem has a natural tie to interpolation, despite that mainstream efforts on the problem have been adopting formulations otherwise. Interpolation is about finding the output of a function f(x) for any specified input x, given a few input-output pairs {(xi,fi):i=1,2,3,...,n} of the function. If the input x is the viewpoint, and f(x) is the image, the interpolation problem becomes exactly NVS. We treat the NVS problem using the interpolation formulation. In particular, we adopt the example-based everything or interpolation (EBI) mechanism-an established mechanism for interpolating or learning functions from examples. EBI has all the desirable properties of a good interpolation: all given input-output examples are satisfied exactly, and the interpolation is smooth with minimum oscillations between the examples. We point out that EBI, however, has difficulty in interpolating certain classes of functions, including the image function in the NVS problem. We propose an extension of the mechanism for overcoming the limitation. We also present how the extended interpolation mechanism could be used to synthesize images at novel viewpoints. Real image results show that the mechanism has promising performance, even with very few example images.
Approximating the 0-1 Multiple Knapsack Problem with Agent Decomposition and Market Negotiation
DOE Office of Scientific and Technical Information (OSTI.GOV)
Smolinski, B.
The 0-1 multiple knapsack problem appears in many domains from financial portfolio management to cargo ship stowing. Methods for solving it range from approximate algorithms, such as greedy algorithms, to exact algorithms, such as branch and bound. Approximate algorithms have no bounds on how poorly they perform and exact algorithms can suffer from exponential time and space complexities with large data sets. This paper introduces a market model based on agent decomposition and market auctions for approximating the 0-1 multiple knapsack problem, and an algorithm that implements the model (M(x)). M(x) traverses the solution space rather than getting caught inmore » a local maximum, overcoming an inherent problem of many greedy algorithms. The use of agents ensures that infeasible solutions are not considered while traversing the solution space and that traversal of the solution space is not just random, but is also directed. M(x) is compared to a bound and bound algorithm (BB) and a simple greedy algorithm with a random shuffle (G(x)). The results suggest that M(x) is a good algorithm for approximating the 0-1 Multiple Knapsack problem. M(x) almost always found solutions that were close to optimal in a fraction of the time it took BB to run and with much less memory on large test data sets. M(x) usually performed better than G(x) on hard problems with correlated data.« less
Exact solution for an optimal impermeable parachute problem
NASA Astrophysics Data System (ADS)
Lupu, Mircea; Scheiber, Ernest
2002-10-01
In the paper there are solved direct and inverse boundary problems and analytical solutions are obtained for optimization problems in the case of some nonlinear integral operators. It is modeled the plane potential flow of an inviscid, incompressible and nonlimited fluid jet, witch encounters a symmetrical, curvilinear obstacle--the deflector of maximal drag. There are derived integral singular equations, for direct and inverse problems and the movement in the auxiliary canonical half-plane is obtained. Next, the optimization problem is solved in an analytical manner. The design of the optimal airfoil is performed and finally, numerical computations concerning the drag coefficient and other geometrical and aerodynamical parameters are carried out. This model corresponds to the Helmholtz impermeable parachute problem.
So what exactly are social-ecological network studies? Findings from a literature review
To solve most environmental management problems academics and practitioners must work across traditionally compartmentalized management arenas (e.g., food, water, and wildlife) and among spatially distant ecosystems and resource users. Managing interdependent ecosystem services, ...
Singular solution of the Feller diffusion equation via a spectral decomposition.
Gan, Xinjun; Waxman, David
2015-01-01
Feller studied a branching process and found that the distribution for this process approximately obeys a diffusion equation [W. Feller, in Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability (University of California Press, Berkeley and Los Angeles, 1951), pp. 227-246]. This diffusion equation and its generalizations play an important role in many scientific problems, including, physics, biology, finance, and probability theory. We work under the assumption that the fundamental solution represents a probability density and should account for all of the probability in the problem. Thus, under the circumstances where the random process can be irreversibly absorbed at the boundary, this should lead to the presence of a Dirac delta function in the fundamental solution at the boundary. However, such a feature is not present in the standard approach (Laplace transformation). Here we require that the total integrated probability is conserved. This yields a fundamental solution which, when appropriate, contains a term proportional to a Dirac delta function at the boundary. We determine the fundamental solution directly from the diffusion equation via spectral decomposition. We obtain exact expressions for the eigenfunctions, and when the fundamental solution contains a Dirac delta function at the boundary, every eigenfunction of the forward diffusion operator contains a delta function. We show how these combine to produce a weight of the delta function at the boundary which ensures the total integrated probability is conserved. The solution we present covers cases where parameters are time dependent, thereby greatly extending its applicability.
Singular solution of the Feller diffusion equation via a spectral decomposition
NASA Astrophysics Data System (ADS)
Gan, Xinjun; Waxman, David
2015-01-01
Feller studied a branching process and found that the distribution for this process approximately obeys a diffusion equation [W. Feller, in Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability (University of California Press, Berkeley and Los Angeles, 1951), pp. 227-246]. This diffusion equation and its generalizations play an important role in many scientific problems, including, physics, biology, finance, and probability theory. We work under the assumption that the fundamental solution represents a probability density and should account for all of the probability in the problem. Thus, under the circumstances where the random process can be irreversibly absorbed at the boundary, this should lead to the presence of a Dirac delta function in the fundamental solution at the boundary. However, such a feature is not present in the standard approach (Laplace transformation). Here we require that the total integrated probability is conserved. This yields a fundamental solution which, when appropriate, contains a term proportional to a Dirac delta function at the boundary. We determine the fundamental solution directly from the diffusion equation via spectral decomposition. We obtain exact expressions for the eigenfunctions, and when the fundamental solution contains a Dirac delta function at the boundary, every eigenfunction of the forward diffusion operator contains a delta function. We show how these combine to produce a weight of the delta function at the boundary which ensures the total integrated probability is conserved. The solution we present covers cases where parameters are time dependent, thereby greatly extending its applicability.
An efficient technique for higher order fractional differential equation.
Ali, Ayyaz; Iqbal, Muhammad Asad; Ul-Hassan, Qazi Mahmood; Ahmad, Jamshad; Mohyud-Din, Syed Tauseef
2016-01-01
In this study, we establish exact solutions of fractional Kawahara equation by using the idea of [Formula: see text]-expansion method. The results of different studies show that the method is very effective and can be used as an alternative for finding exact solutions of nonlinear evolution equations (NLEEs) in mathematical physics. The solitary wave solutions are expressed by the hyperbolic, trigonometric, exponential and rational functions. Graphical representations along with the numerical data reinforce the efficacy of the used procedure. The specified idea is very effective, expedient for fractional PDEs, and could be extended to other physical problems.
Exact solution of some linear matrix equations using algebraic methods
NASA Technical Reports Server (NTRS)
Djaferis, T. E.; Mitter, S. K.
1979-01-01
Algebraic methods are used to construct the exact solution P of the linear matrix equation PA + BP = - C, where A, B, and C are matrices with real entries. The emphasis of this equation is on the use of finite algebraic procedures which are easily implemented on a digital computer and which lead to an explicit solution to the problem. The paper is divided into six sections which include the proof of the basic lemma, the Liapunov equation, and the computer implementation for the rational, integer and modular algorithms. Two numerical examples are given and the entire calculation process is depicted.
NASA Astrophysics Data System (ADS)
Chuvakhov, P. V.
2014-01-01
An exact expression for a system of both eigenvalues and right/left eigenvectors of a Jacobian matrix for a convective two-equation differential closure RANS operator split along a curvilinear coordinate is derived. It is shown by examples of numerical modeling of supersonic flows over a flat plate and a compression corner with separation that application of the exact system of eigenvalues and eigenvectors to the Roe approach for approximate solution of the Riemann problem gives rise to an increase in the convergence rate, better stability and higher accuracy of a steady-state solution in comparison with those in the case of an approximate system.
Features of sound propagation through and stability of a finite shear layer
NASA Technical Reports Server (NTRS)
Koutsoyannis, S. P.
1976-01-01
The plane wave propagation, the stability and the rectangular duct mode problems of a compressible inviscid linearly sheared parallel, but otherwise homogeneous flow, are shown to be governed by Whittaker's equation. The exact solutions for the perturbation quantities are essentially Whittaker M-functions. A number of known results are obtained as limiting cases of exact solutions. For the compressible finite thickness shear layer it is shown that no resonances and no critical angles exist for all Mach numbers, frequencies and shear layer velocity profile slopes except in the singular case of the vortex sheet.
Wentzel-Kramers-Brillouin method in the Bargmann representation. [of quantum mechanics
NASA Technical Reports Server (NTRS)
Voros, A.
1989-01-01
It is demonstrated that the Bargmann representation of quantum mechanics is ideally suited for semiclassical analysis, using as an example the WKB method applied to the bound-state problem in a single well of one degree of freedom. For the harmonic oscillator, this WKB method trivially gives the exact eigenfunctions in addition to the exact eigenvalues. For an anharmonic well, a self-consistent variational choice of the representation greatly improves the accuracy of the semiclassical ground state. Also, a simple change of scale illuminates the relationship of semiclassical versus linear perturbative expansions, allowing a variety of multidimensional extensions.
Comment on "Exact solution of resonant modes in a rectangular resonator".
Gutiérrez-Vega, Julio C; Bandres, Miguel A
2006-08-15
We comment on the recent Letter by J. Wu and A. Liu [Opt. Lett. 31, 1720 (2006)] in which an exact scalar solution to the resonant modes and the resonant frequencies in a two-dimensional rectangular microcavity were presented. The analysis is incorrect because (a) the field solutions were imposed to satisfy simultaneously both Dirichlet and Neumann boundary conditions at the four sides of the rectangle, leading to an overdetermined problem, and (b) the modes in the cavity were expanded using an incorrect series ansatz, leading to an expression for the mode fields that does not satisfy the Helmholtz equation.
Running Behavioral Experiments with Human Participants: A Practical Guide (Revised Version)
2010-01-20
R. (2000). Social research methods: Qualitative and quantitative approaches. Thousand Oaks, CA: Sage. This is a relatively large book. It covers...guide will be useful to anyone who is starting to run research studies, training people to run studies, or studying the experimental process. When...behavior. Running an experiment in exactly the same way regardless of who is conducting it or where (e.g., different research teams or laboratories) is
Light Scattering by Wavelength-Sized Particles "Dusted" with Subwavelength-Sized Grains
NASA Technical Reports Server (NTRS)
Mishchenko, Michael I.; Dlugach, Janna M.; Mackowski, Daniel W.
2011-01-01
The numerically exact superposition T-matrix method is used to compute the scattering cross sections and the Stokes scattering matrix for polydisperse spherical particles covered with a large number of much smaller grains. We show that the optical effect of the presence of microscopic dust on the surfaces of wavelength-sized, weakly absorbing particles is much less significant than that of a major overall asphericity of the particle shape.
Ellenberger, David; Friede, Tim
2016-08-05
Methods for change point (also sometimes referred to as threshold or breakpoint) detection in binary sequences are not new and were introduced as early as 1955. Much of the research in this area has focussed on asymptotic and exact conditional methods. Here we develop an exact unconditional test. An unconditional exact test is developed which assumes the total number of events as random instead of conditioning on the number of observed events. The new test is shown to be uniformly more powerful than Worsley's exact conditional test and means for its efficient numerical calculations are given. Adaptions of methods by Berger and Boos are made to deal with the issue that the unknown event probability imposes a nuisance parameter. The methods are compared in a Monte Carlo simulation study and applied to a cohort of patients undergoing traumatic orthopaedic surgery involving external fixators where a change in pin site infections is investigated. The unconditional test controls the type I error rate at the nominal level and is uniformly more powerful than (or to be more precise uniformly at least as powerful as) Worsley's exact conditional test which is very conservative for small sample sizes. In the application a beneficial effect associated with the introduction of a new treatment procedure for pin site care could be revealed. We consider the new test an effective and easy to use exact test which is recommended in small sample size change point problems in binary sequences.
NASA Technical Reports Server (NTRS)
Dlugach, Jana M.; Mishchenko, Michael I.; Mackowski, Daniel W.
2012-01-01
Using the results of direct, numerically exact computer solutions of the Maxwell equations, we analyze scattering and absorption characteristics of polydisperse compound particles in the form of wavelength-sized spheres covered with a large number of much smaller spherical grains.The results pertain to the complex refractive indices1.55 + i0.0003,1.55 + i0.3, and 3 + i0.1. We show that the optical effects of dusting wavelength-sized hosts by microscopic grains can vary depending on the number and size of the grains as well as on the complex refractive index. Our computations also demonstrate the high efficiency of the new superposition T-matrix code developed for use on distributed memory computer clusters.
Mobilizing Black America: Solutions to Black Health Problems
1993-04-01
infant-mortality rate for Malaysia (a third world country). (3) Acquired Immune Deficiency Syndrome (AIDS). AIDS is exacting a heavy toll on African...blood cholesterol, obesity , unhealthy diets, and smoking are the leading causes (major risk factors) of these killers. The underlying problems associated...coronary heart disease, hypertension, stroke, some cancers, diabetes, and obesity is to eat foods that are low in saturated-fat and sodium. Blacks consume
Implicit finite difference methods on composite grids
NASA Technical Reports Server (NTRS)
Mastin, C. Wayne
1987-01-01
Techniques for eliminating time lags in the implicit finite-difference solution of partial differential equations are investigated analytically, with a focus on transient fluid dynamics problems on overlapping multicomponent grids. The fundamental principles of the approach are explained, and the method is shown to be applicable to both rectangular and curvilinear grids. Numerical results for sample problems are compared with exact solutions in graphs, and good agreement is demonstrated.
Propagation phenomena in monostable integro-differential equations: Acceleration or not?
NASA Astrophysics Data System (ADS)
Alfaro, Matthieu; Coville, Jérôme
2017-11-01
We consider the homogeneous integro-differential equation ∂t u = J * u - u + f (u) with a monostable nonlinearity f. Our interest is twofold: we investigate the existence/nonexistence of travelling waves, and the propagation properties of the Cauchy problem. When the dispersion kernel J is exponentially bounded, travelling waves are known to exist and solutions of the Cauchy problem typically propagate at a constant speed [7,10,11,22,26,27]. On the other hand, when the dispersion kernel J has heavy tails and the nonlinearity f is nondegenerate, i.e. f‧ (0) > 0, travelling waves do not exist and solutions of the Cauchy problem propagate by accelerating [14,20,27]. For a general monostable nonlinearity, a dichotomy between these two types of propagation behaviour is still not known. The originality of our work is to provide such dichotomy by studying the interplay between the tails of the dispersion kernel and the Allee effect induced by the degeneracy of f, i.e. f‧ (0) = 0. First, for algebraic decaying kernels, we prove the exact separation between existence and nonexistence of travelling waves. This in turn provides the exact separation between nonacceleration and acceleration in the Cauchy problem. In the latter case, we provide a first estimate of the position of the level sets of the solution.
An integer programming formulation of the parsimonious loss of heterozygosity problem.
Catanzaro, Daniele; Labbé, Martine; Halldórsson, Bjarni V
2013-01-01
A loss of heterozygosity (LOH) event occurs when, by the laws of Mendelian inheritance, an individual should be heterozygote at a given site but, due to a deletion polymorphism, is not. Deletions play an important role in human disease and their detection could provide fundamental insights for the development of new diagnostics and treatments. In this paper, we investigate the parsimonious loss of heterozygosity problem (PLOHP), i.e., the problem of partitioning suspected polymorphisms from a set of individuals into a minimum number of deletion areas. Specifically, we generalize Halldórsson et al.'s work by providing a more general formulation of the PLOHP and by showing how one can incorporate different recombination rates and prior knowledge about the locations of deletions. Moreover, we show that the PLOHP can be formulated as a specific version of the clique partition problem in a particular class of graphs called undirected catch-point interval graphs and we prove its general $({\\cal NP})$-hardness. Finally, we provide a state-of-the-art integer programming (IP) formulation and strengthening valid inequalities to exactly solve real instances of the PLOHP containing up to 9,000 individuals and 3,000 SNPs. Our results give perspectives on the mathematics of the PLOHP and suggest new directions on the development of future efficient exact solution approaches.
BiCluE - Exact and heuristic algorithms for weighted bi-cluster editing of biomedical data
2013-01-01
Background The explosion of biological data has dramatically reformed today's biology research. The biggest challenge to biologists and bioinformaticians is the integration and analysis of large quantity of data to provide meaningful insights. One major problem is the combined analysis of data from different types. Bi-cluster editing, as a special case of clustering, which partitions two different types of data simultaneously, might be used for several biomedical scenarios. However, the underlying algorithmic problem is NP-hard. Results Here we contribute with BiCluE, a software package designed to solve the weighted bi-cluster editing problem. It implements (1) an exact algorithm based on fixed-parameter tractability and (2) a polynomial-time greedy heuristics based on solving the hardest part, edge deletions, first. We evaluated its performance on artificial graphs. Afterwards we exemplarily applied our implementation on real world biomedical data, GWAS data in this case. BiCluE generally works on any kind of data types that can be modeled as (weighted or unweighted) bipartite graphs. Conclusions To our knowledge, this is the first software package solving the weighted bi-cluster editing problem. BiCluE as well as the supplementary results are available online at http://biclue.mpi-inf.mpg.de. PMID:24565035
Snow survey and vegetation growth in high mountains (Swiss Alps)
NASA Technical Reports Server (NTRS)
Haefner, H. (Principal Investigator)
1973-01-01
The author has identified the following significant results. A method for mapping snow over large areas was developed combining the possibilities of a Quantimet (QTM 72) to evaluate the exact density level of the snow cover for each individual image (or a selected section of the photo) with the higher resolution of photographic techniques. The density level established on the monitor by visual control is used as reference for the exposure time of a lithographic film, producing a clear tonal separation of all snow- and ice-covered areas from uncovered land in black and white. The data is projected onto special maps 1:500,000 or 1:100,000 showing the contour lines and the hydrographic features only. The areal extent of the snow cover may be calculated directly with the QTM 720 or on the map. Bands 4 and 5 provide the most accurate results for mapping snow. Using all four bands a separation of an old melting snow cover from a new one is possible. Regional meteorological studies combining ERTS-1 imagery and conventional sources describe synoptical evolution of meteorological systems over the Alps.
Graphite distortion ``C`` Reactor. Final report
DOE Office of Scientific and Technical Information (OSTI.GOV)
Wood, N.H.
1962-02-08
This report covers the efforts of the Laboratory in an investigation of the graphite distortion in the ``C`` reactor at Hanford. The particular aspects of the problem to be covered by the Laboratory were possible ``fixes`` to the control rod sticking problem caused by VSR channel distortion.
A study of dynamical behavior of space environment
NASA Technical Reports Server (NTRS)
Wu, S. T.
1974-01-01
Studies have covered a wide range of problems in the space environment, such as the problems of the dynamical behavior of the thermosphere, hydromagnetic wave propagation in the ionosphere, and interplanetary space environment. The theories used to analyze these problems range from a continuum theory of magnetohydrodynamics to the kinetic theory of free molecular flow. This is because the problems encountered covered the entire range of the Knudsen number (i.e., the ratio of mean free path to the characteristic length). Significant results are summarized.
Delving Into Dissipative Quantum Dynamics: From Approximate to Numerically Exact Approaches
NASA Astrophysics Data System (ADS)
Chen, Hsing-Ta
In this thesis, I explore dissipative quantum dynamics of several prototypical model systems via various approaches, ranging from approximate to numerically exact schemes. In particular, in the realm of the approximate I explore the accuracy of Pade-resummed master equations and the fewest switches surface hopping (FSSH) algorithm for the spin-boson model, and non-crossing approximations (NCA) for the Anderson-Holstein model. Next, I develop new and exact Monte Carlo approaches and test them on the spin-boson model. I propose well-defined criteria for assessing the accuracy of Pade-resummed quantum master equations, which correctly demarcate the regions of parameter space where the Pade approximation is reliable. I continue the investigation of spin-boson dynamics by benchmark comparisons of the semiclassical FSSH algorithm to exact dynamics over a wide range of parameters. Despite small deviations from golden-rule scaling in the Marcus regime, standard surface hopping algorithm is found to be accurate over a large portion of parameter space. The inclusion of decoherence corrections via the augmented FSSH algorithm improves the accuracy of dynamical behavior compared to exact simulations, but the effects are generally not dramatic for the cases I consider. Next, I introduce new methods for numerically exact real-time simulation based on real-time diagrammatic Quantum Monte Carlo (dQMC) and the inchworm algorithm. These methods optimally recycle Monte Carlo information from earlier times to greatly suppress the dynamical sign problem. In the context of the spin-boson model, I formulate the inchworm expansion in two distinct ways: the first with respect to an expansion in the system-bath coupling and the second as an expansion in the diabatic coupling. In addition, a cumulant version of the inchworm Monte Carlo method is motivated by the latter expansion, which allows for further suppression of the growth of the sign error. I provide a comprehensive comparison of the performance of the inchworm Monte Carlo algorithms to other exact methodologies as well as a discussion of the relative advantages and disadvantages of each. Finally, I investigate the dynamical interplay between the electron-electron interaction and the electron-phonon coupling within the Anderson-Holstein model via two complementary NCAs: the first is constructed around the weak-coupling limit and the second around the polaron limit. The influence of phonons on spectral and transport properties is explored in equilibrium, for non-equilibrium steady state and for transient dynamics after a quench. I find the two NCAs disagree in nontrivial ways, indicating that more reliable approaches to the problem are needed. The complementary frameworks used here pave the way for numerically exact methods based on inchworm dQMC algorithms capable of treating open systems simultaneously coupled to multiple fermionic and bosonic baths.
Shikonin and its derivatives: a patent review.
Wang, Rubing; Yin, Runting; Zhou, Wen; Xu, Defeng; Li, Shaoshun
2012-09-01
Shikonin and its derivatives are the main components of red pigment extracts from Lithospermum erythrorhizon, whose medicinal properties have been confirmed for a long history, and have aroused great interest as the hallmark molecules responsible for their significant biological activities, especially for their striking anticancer effects. Areas covered in this paper include a review of the total synthesis, biological effects and mechanisms of shikonin and its derivatives for their anticancer activities in the past decade, basing on literature and patents. The current state and problems are also discussed. At present, screening for anticancer shikonin derivatives is based on cellular level to find compounds with stronger cytotoxicity. Though several compounds have been discovered with striking cytotoxicity in vitro, however, no selectivity was observed and undoubtedly, the further outcomes have been disappointing because of their great damage to normal cells. Meanwhile, the presumed mechanisms of action are also established in terms of their cytotoxicity. From a pharmacological point of view, most of the shikonin derivatives are at an early stage of their development, and thus it is difficult to determine the exact effectiveness in cancer treatment. With research in this field going deeper, it can be expected that, despite the difficulties, shikonin derivatives as potential anticancer agents will soon follow.
A Branch-and-Bound Approach for Tautomer Enumeration.
Thalheim, Torsten; Wagner, Barbara; Kühne, Ralph; Middendorf, Martin; Schüürmann, Gerrit
2015-05-01
Knowledge about tautomer forms of a structure is important since, e.g., a property prediction for a molecule can yield to different results which depend on the individual tautomer. Tautomers are isomers that can be transformed to each other through chemical equilibrium reactions. In this paper the first exact Branch-and-Bound (B&B) algorithm to calculate tautomer structures is proposed. The algorithm is complete in the sense of tautomerism and generates all possible tautomers of a structure according to the tautomer definition, it is initialized with. To be efficient, the algorithm takes advantage of symmetric and formation properties. Some restrictions are used to enable an early pruning of some branches of the B&B tree. This is important, since a simple enumeration strategy would lead to number of candidate tautomers that is exponentially increasing with the number of hydrogen atoms and their attachment sites. The proposed implementation of the B&B algorithm covers the majority of the prototropic tautomer cases, but can be adapted to other kinds of tautomerism too. Furthermore, a computer processable definition of tautomerism is given in the form of the moving hydrogen atom problem. © 2015 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.
NASA Astrophysics Data System (ADS)
Richter, Martin; Fingerhut, Benjamin P.
2017-06-01
The description of non-Markovian effects imposed by low frequency bath modes poses a persistent challenge for path integral based approaches like the iterative quasi-adiabatic propagator path integral (iQUAPI) method. We present a novel approximate method, termed mask assisted coarse graining of influence coefficients (MACGIC)-iQUAPI, that offers appealing computational savings due to substantial reduction of considered path segments for propagation. The method relies on an efficient path segment merging procedure via an intermediate coarse grained representation of Feynman-Vernon influence coefficients that exploits physical properties of system decoherence. The MACGIC-iQUAPI method allows us to access the regime of biological significant long-time bath memory on the order of hundred propagation time steps while retaining convergence to iQUAPI results. Numerical performance is demonstrated for a set of benchmark problems that cover bath assisted long range electron transfer, the transition from coherent to incoherent dynamics in a prototypical molecular dimer and excitation energy transfer in a 24-state model of the Fenna-Matthews-Olson trimer complex where in all cases excellent agreement with numerically exact reference data is obtained.
Resonant vibrations of a submerged beam
NASA Astrophysics Data System (ADS)
Achenbach, J. D.; Qu, J.
1986-03-01
Forced vibration of a simply supported submerged beam of circular cross section is investigated by the use of two mathematical methods. In the first approach the problem formulation is reduced to a singular integro-differential equation for the transverse deflection. In the second approach the method of matched asymptotic expansions is employed. The integro-differential equation is solved numerically, to yield an exact solution for the frequency response. Subsequent use of a representation integral yields the radiated far field acoustic pressure. The exact results for the beam deflection are compared with approximate results that are available in the literature. Next, a matched asymptotic expansion is worked out by constructing "inner" and "outer" expansions for frequencies near and not near resonance frequencies, respectively. The two expansions are matched in an appropriate manner to yield a uniformly valid solution. The leading term of the matched asymptotic solution is compared with exact numerical results.
NASA Technical Reports Server (NTRS)
Busemann, A.; Vinh, N. X.; Culp, R. D.
1976-01-01
The problem of determining the trajectories, partially or wholly contained in the atmosphere of a spherical, nonrotating planet, is considered. The exact equations of motion for three-dimensional, aerodynamically affected flight are derived. Modified Chapman variables are introduced and the equations are transformed into a set suitable for analytic integration using asymptotic expansions. The trajectory is solved in two regions: the outer region, where the force may be considered a gravitational field with aerodynamic perturbations, and the inner region, where the force is predominantly aerodynamic, with gravity as a perturbation. The two solutions are matched directly. A composite solution, valid everywhere, is constructed by additive composition. This approach of directly matched asymptotic expansions applied to the exact equations of motion couched in terms of modified Chapman variables yields an analytical solution which should prove to be a powerful tool for aerodynamic orbit calculations.
On the exact solvability of the anisotropic central spin model: An operator approach
NASA Astrophysics Data System (ADS)
Wu, Ning
2018-07-01
Using an operator approach based on a commutator scheme that has been previously applied to Richardson's reduced BCS model and the inhomogeneous Dicke model, we obtain general exact solvability requirements for an anisotropic central spin model with XXZ-type hyperfine coupling between the central spin and the spin bath, without any prior knowledge of integrability of the model. We outline basic steps of the usage of the operators approach, and pedagogically summarize them into two Lemmas and two Constraints. Through a step-by-step construction of the eigen-problem, we show that the condition gj‧2 - gj2 = c naturally arises for the model to be exactly solvable, where c is a constant independent of the bath-spin index j, and {gj } and { gj‧ } are the longitudinal and transverse hyperfine interactions, respectively. The obtained conditions and the resulting Bethe ansatz equations are consistent with that in previous literature.
Liu, Jian; Miller, William H
2011-03-14
We show the exact expression of the quantum mechanical time correlation function in the phase space formulation of quantum mechanics. The trajectory-based dynamics that conserves the quantum canonical distribution-equilibrium Liouville dynamics (ELD) proposed in Paper I is then used to approximately evaluate the exact expression. It gives exact thermal correlation functions (of even nonlinear operators, i.e., nonlinear functions of position or momentum operators) in the classical, high temperature, and harmonic limits. Various methods have been presented for the implementation of ELD. Numerical tests of the ELD approach in the Wigner or Husimi phase space have been made for a harmonic oscillator and two strongly anharmonic model problems, for each potential autocorrelation functions of both linear and nonlinear operators have been calculated. It suggests ELD can be a potentially useful approach for describing quantum effects for complex systems in condense phase.
Envelope and phase distribution of a resonance transmission through a complex environment
NASA Astrophysics Data System (ADS)
Savin, Dmitry V.
2018-06-01
A transmission amplitude is considered for quantum or wave transport mediated by a single resonance coupled to the background of many chaotic states. Such a model provides a useful approach to quantify fluctuations in an established signal induced by a complex environment. Applying random matrix theory to the problem, we derive an exact result for the joint distribution of the transmission intensity (envelope) and the transmission phase at arbitrary coupling to the background with finite absorption. The intensity and phase are distributed within a certain region, revealing essential correlations even at strong absorption. In the latter limit, we obtain a simple asymptotic expression that provides a uniformly good approximation of the exact distribution within its whole support, thus going beyond the Rician distribution often used for such purposes. Exact results are also derived for the marginal distribution of the phase, including its limiting forms at weak and strong absorption.
The Exact Solution to Rank-1 L1-Norm TUCKER2 Decomposition
NASA Astrophysics Data System (ADS)
Markopoulos, Panos P.; Chachlakis, Dimitris G.; Papalexakis, Evangelos E.
2018-04-01
We study rank-1 {L1-norm-based TUCKER2} (L1-TUCKER2) decomposition of 3-way tensors, treated as a collection of $N$ $D \\times M$ matrices that are to be jointly decomposed. Our contributions are as follows. i) We prove that the problem is equivalent to combinatorial optimization over $N$ antipodal-binary variables. ii) We derive the first two algorithms in the literature for its exact solution. The first algorithm has cost exponential in $N$; the second one has cost polynomial in $N$ (under a mild assumption). Our algorithms are accompanied by formal complexity analysis. iii) We conduct numerical studies to compare the performance of exact L1-TUCKER2 (proposed) with standard HOSVD, HOOI, GLRAM, PCA, L1-PCA, and TPCA-L1. Our studies show that L1-TUCKER2 outperforms (in tensor approximation) all the above counterparts when the processed data are outlier corrupted.
General Exact Solution to the Problem of the Probability Density for Sums of Random Variables
NASA Astrophysics Data System (ADS)
Tribelsky, Michael I.
2002-07-01
The exact explicit expression for the probability density pN(x) for a sum of N random, arbitrary correlated summands is obtained. The expression is valid for any number N and any distribution of the random summands. Most attention is paid to application of the developed approach to the case of independent and identically distributed summands. The obtained results reproduce all known exact solutions valid for the, so called, stable distributions of the summands. It is also shown that if the distribution is not stable, the profile of pN(x) may be divided into three parts, namely a core (small x), a tail (large x), and a crossover from the core to the tail (moderate x). The quantitative description of all three parts as well as that for the entire profile is obtained. A number of particular examples are considered in detail.
General exact solution to the problem of the probability density for sums of random variables.
Tribelsky, Michael I
2002-08-12
The exact explicit expression for the probability density p(N)(x) for a sum of N random, arbitrary correlated summands is obtained. The expression is valid for any number N and any distribution of the random summands. Most attention is paid to application of the developed approach to the case of independent and identically distributed summands. The obtained results reproduce all known exact solutions valid for the, so called, stable distributions of the summands. It is also shown that if the distribution is not stable, the profile of p(N)(x) may be divided into three parts, namely a core (small x), a tail (large x), and a crossover from the core to the tail (moderate x). The quantitative description of all three parts as well as that for the entire profile is obtained. A number of particular examples are considered in detail.
Some exact velocity profiles for granular flow in converging hoppers
NASA Astrophysics Data System (ADS)
Cox, Grant M.; Hill, James M.
2005-01-01
Gravity flow of granular materials through hoppers occurs in many industrial processes. For an ideal cohesionless granular material, which satisfies the Coulomb-Mohr yield condition, the number of known analytical solutions is limited. However, for the special case of the angle of internal friction δ equal to ninety degrees, there exist exact parametric solutions for the governing coupled ordinary differential equations for both two-dimensional wedges and three-dimensional cones, both of which involve two arbitrary constants of integration. These solutions are the only known analytical solutions of this generality. Here, we utilize the double-shearing theory of granular materials to determine the velocity field corresponding to these exact parametric solutions for the two problems of gravity flow through converging wedge and conical hoppers. An independent numerical solution for other angles of internal friction is shown to coincide with the analytical solution.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Thakur, Pradeep; Durganandini, P.
We study the spin-1/2 XX model in the presence of three-spin interactions of the XZX+YZY and XZY-YZX types. We solve the problem exactly and show that there is both finite magnetization and electric polarization for low non-zero strengths of the three-spin interactions.
Sequences, Series, and Mathematica.
ERIC Educational Resources Information Center
Mathews, John H.
1992-01-01
Describes how the computer algebra system Mathematica can be used to enhance the teaching of the topics of sequences and series. Examines its capabilities to find exact, approximate, and graphically generated approximate solutions to problems from these topics and to understand proofs about sequences. (MDH)
The Conveyor Belt Problem and Newton's Third Law.
ERIC Educational Resources Information Center
Stewart, Maurice Bruce
1989-01-01
Shows how the thermal power developed by friction is exactly half the supplied power in the general case of a variable force of friction. Investigates the mechanism whereby one-half the input energy is dissipated as heat using mathematical expressions. (YP)
Metamaterials for Miniaturization of Optical Components
2014-09-24
elementary EM fields are exactly the Maxwell equations with proper conserved currents; (iii) a free charge moves uniformly preserving up to the...Disordered Systems -- A Conference in Honor of Leonid Pastur , Hagen, Germany, Some Mathematical Problems in a Neoclassical Theory of Electric Charges
NASA Technical Reports Server (NTRS)
Wolpert, David H.; Macready, William G.
2005-01-01
Recent work on the mathematical foundations of optimization has begun to uncover its rich structure. In particular, the "No Free Lunch" (NFL) theorems state that any two algorithms are equivalent when their performance is averaged across all possible problems. This highlights the need for exploiting problem-specific knowledge to achieve better than random performance. In this paper we present a general framework covering more search scenarios. In addition to the optimization scenarios addressed in the NFL results, this framework covers multi-armed bandit problems and evolution of multiple co-evolving players. As a particular instance of the latter, it covers "self-play" problems. In these problems the set of players work together to produce a champion, who then engages one or more antagonists in a subsequent multi-player game. In contrast to the traditional optimization case where the NFL results hold, we show that in self-play there are free lunches: in coevolution some algorithms have better performance than other algorithms, averaged across all possible problems. We consider the implications of these results to biology where there is no champion.
Integral Method of Boundary Characteristics: Neumann Condition
NASA Astrophysics Data System (ADS)
Kot, V. A.
2018-05-01
A new algorithm, based on systems of identical equalities with integral and differential boundary characteristics, is proposed for solving boundary-value problems on the heat conduction in bodies canonical in shape at a Neumann boundary condition. Results of a numerical analysis of the accuracy of solving heat-conduction problems with variable boundary conditions with the use of this algorithm are presented. The solutions obtained with it can be considered as exact because their errors comprise hundredths and ten-thousandths of a persent for a wide range of change in the parameters of a problem.
An Obstacle Problem for Conical Deformations of Thin Elastic Sheets
NASA Astrophysics Data System (ADS)
Figalli, Alessio; Mooney, Connor
2018-05-01
A developable cone ("d-cone") is the shape made by an elastic sheet when it is pressed at its center into a hollow cylinder by a distance {ɛ}. Starting from a nonlinear model depending on the thickness h > 0 of the sheet, we prove a {Γ} -convergence result as {h → 0} to a fourth-order obstacle problem for curves in {S^2}. We then describe the exact shape of minimizers of the limit problem when {ɛ} is small. In particular, we rigorously justify previous results in the physics literature.
The complex variable boundary element method: Applications in determining approximative boundaries
Hromadka, T.V.
1984-01-01
The complex variable boundary element method (CVBEM) is used to determine approximation functions for boundary value problems of the Laplace equation such as occurs in potential theory. By determining an approximative boundary upon which the CVBEM approximator matches the desired constant (level curves) boundary conditions, the CVBEM is found to provide the exact solution throughout the interior of the transformed problem domain. Thus, the acceptability of the CVBEM approximation is determined by the closeness-of-fit of the approximative boundary to the study problem boundary. ?? 1984.
Parametric robust control and system identification: Unified approach
NASA Technical Reports Server (NTRS)
Keel, Leehyun
1994-01-01
Despite significant advancement in the area of robust parametric control, the problem of synthesizing such a controller is still a wide open problem. Thus, we attempt to give a solution to this important problem. Our approach captures the parametric uncertainty as an H(sub infinity) unstructured uncertainty so that H(sub infinity) synthesis techniques are applicable. Although the techniques cannot cope with the exact parametric uncertainty, they give a reasonable guideline to model the unstructured uncertainty that contains the parametric uncertainty. An additional loop shaping technique is also introduced to relax its conservatism.
Protecting coherence by environmental decoherence: a solvable paradigmatic model
NASA Astrophysics Data System (ADS)
Torres, Juan Mauricio; Seligman, Thomas H.
2017-11-01
We consider a particularly simple exactly solvable model for a qubit coupled to sequentially nested environments. The purpose is to exemplify the coherence conserving effect of a central system, that has been reported as a result of increasing the coupling between near and far environment. The paradigmatic example is the Jaynes-Cummings Hamiltonian, which we introduce into a Kossakowski-Lindblad master equation using alternatively the lowering operator of the oscillator or its number operator as Lindblad operators. The harmonic oscillator is regarded as the near environment of the qubit, while effects of a far environment are accounted for by the two options for the dissipative part of the master equation. The exact solution allows us to cover the entire range of coupling strength from the perturbative regime to strong coupling analytically. The coherence conserving effect of the coupling to the far environment is confirmed throughout.
Lungu, Radu P; Huckaby, Dale A; Buzatu, Florin D
2006-02-01
A model is presented in which the bonds of a honeycomb lattice are covered by rodlike molecules of types AA and BB, molecular ends near a common site having both three-body interactions and orientation-dependent bonding between two A molecular ends and between an A and a B molecular end. Phase diagrams corresponding to the separation into AA-rich and BB-rich phases are calculated exactly. Depending on the relative strengths of the interactions, one of several qualitatively different types of phase diagrams can result, including diagrams containing phenomena such as a double critical point or two separate asymmetric closed loops. The model is essentially a limiting case of a previously considered ternary solution model, and it is equivalent to a two-component system of interacting A and B molecules on the sites of a kagomé lattice.
Efficient Exact Inference With Loss Augmented Objective in Structured Learning.
Bauer, Alexander; Nakajima, Shinichi; Muller, Klaus-Robert
2016-08-19
Structural support vector machine (SVM) is an elegant approach for building complex and accurate models with structured outputs. However, its applicability relies on the availability of efficient inference algorithms--the state-of-the-art training algorithms repeatedly perform inference to compute a subgradient or to find the most violating configuration. In this paper, we propose an exact inference algorithm for maximizing nondecomposable objectives due to special type of a high-order potential having a decomposable internal structure. As an important application, our method covers the loss augmented inference, which enables the slack and margin scaling formulations of structural SVM with a variety of dissimilarity measures, e.g., Hamming loss, precision and recall, Fβ-loss, intersection over union, and many other functions that can be efficiently computed from the contingency table. We demonstrate the advantages of our approach in natural language parsing and sequence segmentation applications.
2015-03-26
Turkish Airborne Early Warning and Control (AEW& C ) aircraft in the combat arena. He examines three combat scenarios Turkey might encounter to cover and...to limited SAR assets, constrained budgets, logistic- maintenance problems, and high risk level of military flights. In recent years, the Turkish Air...model, Set Covering Location Problem (SCLP), defines the minimum number of SAR DPs to cover all fighter aircraft training areas (TAs). The second
A Review Of Oculoplastic Photography: A Guide For Clinician Photographers
Yap, Jun Fai; Wai, Yong Zheng; Ng, Qi Xiong
2016-01-01
Clinical photography in the field of oculoplastic surgery has many applications. It is possible for clinicians to obtain standardized clinical photographs without a studio. A clinician photographer has the advantage of knowing exactly what to photograph as well as having immediate access to the images. In order to maintain standardization in the photographs, the photographic settings should remain constant. This article covers essential photographic equipment, camera settings, patient pose, and digital asset management. PMID:27630805
Polynomial modal analysis of slanted lamellar gratings.
Granet, Gérard; Randriamihaja, Manjakavola Honore; Raniriharinosy, Karyl
2017-06-01
The problem of diffraction by slanted lamellar dielectric and metallic gratings in classical mounting is formulated as an eigenvalue eigenvector problem. The numerical solution is obtained by using the moment method with Legendre polynomials as expansion and test functions, which allows us to enforce in an exact manner the boundary conditions which determine the eigensolutions. Our method is successfully validated by comparison with other methods including in the case of highly slanted gratings.
NASA Technical Reports Server (NTRS)
Misiakos, K.; Lindholm, F. A.
1986-01-01
Several parameters of certain three-dimensional semiconductor devices including diodes, transistors, and solar cells can be determined without solving the actual boundary-value problem. The recombination current, transit time, and open-circuit voltage of planar diodes are emphasized here. The resulting analytical expressions enable determination of the surface recombination velocity of shallow planar diodes. The method involves introducing corresponding one-dimensional models having the same values of these parameters.
Portfolios with nonlinear constraints and spin glasses
NASA Astrophysics Data System (ADS)
Gábor, Adrienn; Kondor, I.
1999-12-01
In a recent paper Galluccio, Bouchaud and Potters demonstrated that a certain portfolio problem with a nonlinear constraint maps exactly onto finding the ground states of a long-range spin glass, with the concomitant nonuniqueness and instability of the optimal portfolios. Here we put forward geometric arguments that lead to qualitatively similar conclusions, without recourse to the methods of spin glass theory, and give two more examples of portfolio problems with convex nonlinear constraints.
A multilevel probabilistic beam search algorithm for the shortest common supersequence problem.
Gallardo, José E
2012-01-01
The shortest common supersequence problem is a classical problem with many applications in different fields such as planning, Artificial Intelligence and especially in Bioinformatics. Due to its NP-hardness, we can not expect to efficiently solve this problem using conventional exact techniques. This paper presents a heuristic to tackle this problem based on the use at different levels of a probabilistic variant of a classical heuristic known as Beam Search. The proposed algorithm is empirically analysed and compared to current approaches in the literature. Experiments show that it provides better quality solutions in a reasonable time for medium and large instances of the problem. For very large instances, our heuristic also provides better solutions, but required execution times may increase considerably.
Helping the Hyperactive Child.
ERIC Educational Resources Information Center
Texas State Dept. of Mental Health and Mental Retardation, Austin.
This brief booklet discusses the characteristics, causes, and treatments of attention deficit disorders with hyperactivity. Although children with this condition may be overly active, fidgety, distractible, aggressive, impulsive, and have difficulty learning, the primary problem is their inability to concentrate and pay attention. The exact origin…
PRINCIPLES OF SYNCHROTRON TECHNIQUES, POTENTIAL AND LIMITATIONS
Once environmental contaminants, such as arsenic, chromium, cadmium and lead, are detected, the problem becomes how to deal with them. For the past decade, researchers at the US EPA in Cincinnati have been employing synchrotron speciation methods to determine the exact chemical f...
Non Kolmogorov Probability Models Outside Quantum Mechanics
NASA Astrophysics Data System (ADS)
Accardi, Luigi
2009-03-01
This paper is devoted to analysis of main conceptual problems in the interpretation of QM: reality, locality, determinism, physical state, Heisenberg principle, "deterministic" and "exact" theories, laws of chance, notion of event, statistical invariants, adaptive realism, EPR correlations and, finally, the EPR-chameleon experiment.
Efficient sequential and parallel algorithms for finding edit distance based motifs.
Pal, Soumitra; Xiao, Peng; Rajasekaran, Sanguthevar
2016-08-18
Motif search is an important step in extracting meaningful patterns from biological data. The general problem of motif search is intractable and there is a pressing need to develop efficient, exact and approximation algorithms to solve this problem. In this paper, we present several novel, exact, sequential and parallel algorithms for solving the (l,d) Edit-distance-based Motif Search (EMS) problem: given two integers l,d and n biological strings, find all strings of length l that appear in each input string with atmost d errors of types substitution, insertion and deletion. One popular technique to solve the problem is to explore for each input string the set of all possible l-mers that belong to the d-neighborhood of any substring of the input string and output those which are common for all input strings. We introduce a novel and provably efficient neighborhood exploration technique. We show that it is enough to consider the candidates in neighborhood which are at a distance exactly d. We compactly represent these candidate motifs using wildcard characters and efficiently explore them with very few repetitions. Our sequential algorithm uses a trie based data structure to efficiently store and sort the candidate motifs. Our parallel algorithm in a multi-core shared memory setting uses arrays for storing and a novel modification of radix-sort for sorting the candidate motifs. The algorithms for EMS are customarily evaluated on several challenging instances such as (8,1), (12,2), (16,3), (20,4), and so on. The best previously known algorithm, EMS1, is sequential and in estimated 3 days solves up to instance (16,3). Our sequential algorithms are more than 20 times faster on (16,3). On other hard instances such as (9,2), (11,3), (13,4), our algorithms are much faster. Our parallel algorithm has more than 600 % scaling performance while using 16 threads. Our algorithms have pushed up the state-of-the-art of EMS solvers and we believe that the techniques introduced in this paper are also applicable to other motif search problems such as Planted Motif Search (PMS) and Simple Motif Search (SMS).
NASA Technical Reports Server (NTRS)
1943-01-01
This is the fourth of a series of reports covering an investigation of the general instability problem by the California Institute of Technology. The first five reports of this series cover investigations of the general instability problem under the loading conditions of pure bending and were prepared under the sponsorship of the Civil Aeronautics Administration. The succeeding reports of this series cover the work done on other loading conditions under the sponsorship of the National Advisory Committee for Aeronautics. This report is to deal primarily with the continuation of tests of sheet-covered specimens and studies of the buckling phenomena of unstiffened circular cylinders.
Application of the perturbation iteration method to boundary layer type problems.
Pakdemirli, Mehmet
2016-01-01
The recently developed perturbation iteration method is applied to boundary layer type singular problems for the first time. As a preliminary work on the topic, the simplest algorithm of PIA(1,1) is employed in the calculations. Linear and nonlinear problems are solved to outline the basic ideas of the new solution technique. The inner and outer solutions are determined with the iteration algorithm and matched to construct a composite expansion valid within all parts of the domain. The solutions are contrasted with the available exact or numerical solutions. It is shown that the perturbation-iteration algorithm can be effectively used for solving boundary layer type problems.
Geometrically derived difference formulae for the numerical integration of trajectory problems
NASA Technical Reports Server (NTRS)
Mcleod, R. J. Y.; Sanz-Serna, J. M.
1981-01-01
The term 'trajectory problem' is taken to include problems that can arise, for instance, in connection with contour plotting, or in the application of continuation methods, or during phase-plane analysis. Geometrical techniques are used to construct difference methods for these problems to produce in turn explicit and implicit circularly exact formulae. Based on these formulae, a predictor-corrector method is derived which, when compared with a closely related standard method, shows improved performance. It is found that this latter method produces spurious limit cycles, and this behavior is partly analyzed. Finally, a simple variable-step algorithm is constructed and tested.
Periodic Heterogeneous Vehicle Routing Problem With Driver Scheduling
NASA Astrophysics Data System (ADS)
Mardiana Panggabean, Ellis; Mawengkang, Herman; Azis, Zainal; Filia Sari, Rina
2018-01-01
The paper develops a model for the optimal management of logistic delivery of a given commodity. The company has different type of vehicles with different capacity to deliver the commodity for customers. The problem is then called Periodic Heterogeneous Vehicle Routing Problem (PHVRP). The goal is to schedule the deliveries according to feasible combinations of delivery days and to determine the scheduling of fleet and driver and routing policies of the vehicles. The objective is to minimize the sum of the costs of all routes over the planning horizon. We propose a combined approach of heuristic algorithm and exact method to solve the problem.
A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem
NASA Astrophysics Data System (ADS)
Jäger, Gerold; Zhang, Weixiong
The Hamiltonian cycle problem (HCP) is an important combinatorial problem with applications in many areas. While thorough theoretical and experimental analyses have been made on the HCP in undirected graphs, little is known for the HCP in directed graphs (DHCP). The contribution of this work is an effective algorithm for the DHCP. Our algorithm explores and exploits the close relationship between the DHCP and the Assignment Problem (AP) and utilizes a technique based on Boolean satisfiability (SAT). By combining effective algorithms for the AP and SAT, our algorithm significantly outperforms previous exact DHCP algorithms including an algorithm based on the award-winning Concorde TSP algorithm.
NASA Astrophysics Data System (ADS)
Zhang, Sheng; Hong, Siyu
2018-07-01
In this paper, a generalized Ablowitz-Kaup-Newell-Segur (AKNS) hierarchy in inhomogeneities of media described by variable coefficients is investigated, which includes some important nonlinear evolution equations as special cases, for example, the celebrated Korteweg-de Vries equation modeling waves on shallow water surfaces. To be specific, the known AKNS spectral problem and its time evolution equation are first generalized by embedding a finite number of differentiable and time-dependent functions. Starting from the generalized AKNS spectral problem and its generalized time evolution equation, a generalized AKNS hierarchy with variable coefficients is then derived. Furthermore, based on a systematic analysis on the time dependence of related scattering data of the generalized AKNS spectral problem, exact solutions of the generalized AKNS hierarchy are formulated through the inverse scattering transform method. In the case of reflectionless potentials, the obtained exact solutions are reduced to n-soliton solutions. It is graphically shown that the dynamical evolutions of such soliton solutions are influenced by not only the time-dependent coefficients but also the related scattering data in the process of propagations.
NASA Astrophysics Data System (ADS)
Bagherinejad, Jafar; Niknam, Azar
2018-03-01
In this paper, a leader-follower competitive facility location problem considering the reactions of the competitors is studied. A model for locating new facilities and determining levels of quality for the facilities of the leader firm is proposed. Moreover, changes in the location and quality of existing facilities in a competitive market where a competitor offers the same goods or services are taken into account. The competitor could react by opening new facilities, closing existing ones, and adjusting the quality levels of its existing facilities. The market share, captured by each facility, depends on its distance to customer and its quality that is calculated based on the probabilistic Huff's model. Each firm aims to maximize its profit subject to constraints on quality levels and budget of setting up new facilities. This problem is formulated as a bi-level mixed integer non-linear model. The model is solved using a combination of Tabu Search with an exact method. The performance of the proposed algorithm is compared with an upper bound that is achieved by applying Karush-Kuhn-Tucker conditions. Computational results show that our algorithm finds near the upper bound solutions in a reasonable time.
Mukherjee, Anamitra; Patel, Niravkumar D.; Bishop, Chris; ...
2015-06-08
Lattice spin-fermion models are quite important to study correlated systems where quantum dynamics allows for a separation between slow and fast degrees of freedom. The fast degrees of freedom are treated quantum mechanically while the slow variables, generically referred to as the “spins,” are treated classically. At present, exact diagonalization coupled with classical Monte Carlo (ED + MC) is extensively used to solve numerically a general class of lattice spin-fermion problems. In this common setup, the classical variables (spins) are treated via the standard MC method while the fermion problem is solved by exact diagonalization. The “traveling cluster approximation” (TCA)more » is a real space variant of the ED + MC method that allows to solve spin-fermion problems on lattice sizes with up to 10 3 sites. In this paper, we present a novel reorganization of the TCA algorithm in a manner that can be efficiently parallelized. Finally, this allows us to solve generic spin-fermion models easily on 10 4 lattice sites and with some effort on 10 5 lattice sites, representing the record lattice sizes studied for this family of models.« less
DOE Office of Scientific and Technical Information (OSTI.GOV)
Mukherjee, Anamitra; Patel, Niravkumar D.; Bishop, Chris
Lattice spin-fermion models are quite important to study correlated systems where quantum dynamics allows for a separation between slow and fast degrees of freedom. The fast degrees of freedom are treated quantum mechanically while the slow variables, generically referred to as the “spins,” are treated classically. At present, exact diagonalization coupled with classical Monte Carlo (ED + MC) is extensively used to solve numerically a general class of lattice spin-fermion problems. In this common setup, the classical variables (spins) are treated via the standard MC method while the fermion problem is solved by exact diagonalization. The “traveling cluster approximation” (TCA)more » is a real space variant of the ED + MC method that allows to solve spin-fermion problems on lattice sizes with up to 10 3 sites. In this paper, we present a novel reorganization of the TCA algorithm in a manner that can be efficiently parallelized. Finally, this allows us to solve generic spin-fermion models easily on 10 4 lattice sites and with some effort on 10 5 lattice sites, representing the record lattice sizes studied for this family of models.« less
NASA Astrophysics Data System (ADS)
Coley, Alan
2010-05-01
In this book the use of inhomogeneous models in cosmology, both in modelling structure formation and interpreting cosmological observations, is discussed. The authors concentrate on exact solutions, and particularly the Lemaitre-Tolman (LT) and Szekeres models (the important topic of averaging is not discussed). The book serves to demonstrate that inhomogeneous metrics can generate realistic models of cosmic structure formation and nonlinear evolution and shows that general relativity has a lot more to offer to cosmology than just the standard spatially homogeneous FLRW model. I would recommend this book to people working in theoretical cosmology. In the introduction (and in the concluding chapter and throughout the book) a reasonable discussion of the potential problems with the standard FLRW cosmology is presented, and a list of examples illustrating the limitations of standard FLRW cosmology are discussed (including potential problems with perturbation methods). In particular, the authors argue that the assumptions of isotropy and spatial homogeneity (and consequently the Copernican principle) must be properly challenged and revisited. Indeed, it is possible for `good old general relativity' to be used to explain cosmological observations without introducing speculative elements. In part I of the book the necessary background is presented (readers need a background in general relativity theory at an advanced undergraduate or graduate level). There is a good (and easy to read) review of the exact spherically symmetric dust Lemaitre-Tolman model (LT) (often denoted the LTB model) and the Lemaitre and Szekeres models. Light propogation (i.e. null geodesics, for both central and off-center observers) in exact inhomogeneous (LT) models is reviewed. In part II a number of applications of exact inhomogeneous models are presented (taken mainly from the authors' own work). In chapter 4, the evolution of exact inhomogeneous models (primarily the LT model, but also the Szekeres model) is studied regarding structure formation. I thought that the authors describe the advantages and drawbacks of the idealized exact solutions used in the physical modelling in a reasonable manner (although more concise conclusions might have been useful). The authors also address the formation of a galaxy with a central black hole, the formation and evolution of rich galactic clusters and voids and other structures, and the effects of radiation in the models. The most interesting application is presented in chapter 5; namely, the effects of inhomogeneities on observations such as the luminosity distance relation and the explanation of the observed dimming of distant SN Ia (which is usually interpreted within the standard FLRW model in terms of the existence of dark energy). The main conclusion of this work is that data can be reproduced within the LT model (via inhomogeneities in general relativity, but without introducing dark energy). In particular, a number of exact LT solutions were surveyed, and a full discussion of various models in the literature (and a critique of the various assumptions) is presented. In the next chapter the possible resolution of the horizon problem without inflation, in terms of shell crossing in a LT model, is discussed. This is perhaps the most controversial chapter of the book. In the final chapter 7, the influence of inhomogeneous structures in the path of a light ray (for both center and off-center observers in a special Szekeres Swiss cheese model) on the observed temperature distribution of the CMB is discussed. This is a very important topic, but only a heuristic and qualitative study is presented here; more work on the multipole moments of higher order would be necessary for a more comprehensive analysis.
Accurate quantum chemical calculations
NASA Technical Reports Server (NTRS)
Bauschlicher, Charles W., Jr.; Langhoff, Stephen R.; Taylor, Peter R.
1989-01-01
An important goal of quantum chemical calculations is to provide an understanding of chemical bonding and molecular electronic structure. A second goal, the prediction of energy differences to chemical accuracy, has been much harder to attain. First, the computational resources required to achieve such accuracy are very large, and second, it is not straightforward to demonstrate that an apparently accurate result, in terms of agreement with experiment, does not result from a cancellation of errors. Recent advances in electronic structure methodology, coupled with the power of vector supercomputers, have made it possible to solve a number of electronic structure problems exactly using the full configuration interaction (FCI) method within a subspace of the complete Hilbert space. These exact results can be used to benchmark approximate techniques that are applicable to a wider range of chemical and physical problems. The methodology of many-electron quantum chemistry is reviewed. Methods are considered in detail for performing FCI calculations. The application of FCI methods to several three-electron problems in molecular physics are discussed. A number of benchmark applications of FCI wave functions are described. Atomic basis sets and the development of improved methods for handling very large basis sets are discussed: these are then applied to a number of chemical and spectroscopic problems; to transition metals; and to problems involving potential energy surfaces. Although the experiences described give considerable grounds for optimism about the general ability to perform accurate calculations, there are several problems that have proved less tractable, at least with current computer resources, and these and possible solutions are discussed.
Ultra-high-field fMRI insights on insight: Neural correlates of the Aha!-moment.
Tik, Martin; Sladky, Ronald; Luft, Caroline Di Bernardi; Willinger, David; Hoffmann, André; Banissy, Michael J; Bhattacharya, Joydeep; Windischberger, Christian
2018-04-17
Finding creative solutions to difficult problems is a fundamental aspect of human culture and a skill highly needed. However, the exact neural processes underlying creative problem solving remain unclear. Insightful problem solving tasks were shown to be a valid method for investigating one subcomponent of creativity: the Aha!-moment. Finding insightful solutions during a remote associates task (RAT) was found to elicit specific cortical activity changes. Considering the strong affective components of Aha!-moments, as manifested in the subjectively experienced feeling of relief following the sudden emergence of the solution of the problem without any conscious forewarning, we hypothesized the subcortical dopaminergic reward network to be critically engaged during Aha. To investigate those subcortical contributions to insight, we employed ultra-high-field 7 T fMRI during a German Version of the RAT. During this task, subjects were exposed to word triplets and instructed to find a solution word being associated with all the three given words. They were supposed to press a button as soon as they felt confident about their solution without further revision, allowing us to capture the exact event of Aha!-moment. Besides the finding on cortical involvement of the left anterior middle temporal gyrus (aMTG), here we showed for the first time robust subcortical activity changes related to insightful problem solving in the bilateral thalamus, hippocampus, and the dopaminergic midbrain comprising ventral tegmental area (VTA), nucleus accumbens (NAcc), and caudate nucleus. These results shed new light on the affective neural mechanisms underlying insightful problem solving. © 2018 The Authors Human Brain Mapping Published by Wiley Periodicals, Inc.
RT DDA: A hybrid method for predicting the scattering properties by densely packed media
NASA Astrophysics Data System (ADS)
Ramezan Pour, B.; Mackowski, D.
2017-12-01
The most accurate approaches to predicting the scattering properties of particulate media are based on exact solutions of the Maxwell's equations (MEs), such as the T-matrix and discrete dipole methods. Applying these techniques for optically thick targets is challenging problem due to the large-scale computations and are usually substituted by phenomenological radiative transfer (RT) methods. On the other hand, the RT technique is of questionable validity in media with large particle packing densities. In recent works, we used numerically exact ME solvers to examine the effects of particle concentration on the polarized reflection properties of plane parallel random media. The simulations were performed for plane parallel layers of wavelength-sized spherical particles, and results were compared with RT predictions. We have shown that RTE results monotonically converge to the exact solution as the particle volume fraction becomes smaller and one can observe a nearly perfect fit for packing densities of 2%-5%. This study describes the hybrid technique composed of exact and numerical scalar RT methods. The exact methodology in this work is the plane parallel discrete dipole approximation whereas the numerical method is based on the adding and doubling method. This approach not only decreases the computational time owing to the RT method but also includes the interference and multiple scattering effects, so it may be applicable to large particle density conditions.
NASA Astrophysics Data System (ADS)
Xianqiang, He; Delu, Pan; Yan, Bai; Qiankun, Zhu
2005-10-01
The numerical model of the vector radiative transfer of the coupled ocean-atmosphere system is developed based on the matrix-operator method, which is named PCOART. In PCOART, using the Fourier analysis, the vector radiative transfer equation (VRTE) splits up into a set of independent equations with zenith angle as only angular coordinate. Using the Gaussian-Quadrature method, VRTE is finally transferred into the matrix equation, which is calculated by using the adding-doubling method. According to the reflective and refractive properties of the ocean-atmosphere interface, the vector radiative transfer numerical model of ocean and atmosphere is coupled in PCOART. By comparing with the exact Rayleigh scattering look-up-table of MODIS(Moderate-resolution Imaging Spectroradiometer), it is shown that PCOART is an exact numerical calculation model, and the processing methods of the multi-scattering and polarization are correct in PCOART. Also, by validating with the standard problems of the radiative transfer in water, it is shown that PCOART could be used to calculate the underwater radiative transfer problems. Therefore, PCOART is a useful tool to exactly calculate the vector radiative transfer of the coupled ocean-atmosphere system, which can be used to study the polarization properties of the radiance in the whole ocean-atmosphere system and the remote sensing of the atmosphere and ocean.
NASA Astrophysics Data System (ADS)
Almazmumy, Mariam; Ebaid, Abdelhalim
2017-08-01
In this article, the flow and heat transfer of a non-Newtonian nanofluid between two coaxial cylinders through a porous medium has been investigated. The velocity, temperature, and nanoparticles concentration of the present mathematical model are governed by a system of nonlinear ordinary differential equations. The objective of this article is to obtain new exact solutions for the temperature and the nanoparticles concentration and, therefore, compare them with the previous approximate results in the literature. Moreover, the velocity equation has been numerically solved. The effects of the pressure gradient, thermophoresis, third-grade, Brownian motion, and porosity parameters on the included phenomena have been discussed through several tables and plots. It is found that the velocity profile is increased by increasing the pressure gradient parameter, thermophoresis parameter (slightly), third-grade parameter, and Brownian motion parameter (slightly); however, it decreases with an increase in the porosity parameter and viscosity power index. In addition, the temperature and the nanoparticles concentration reduce with the strengthen of the Brownian motion parameter, while they increase by increasing the thermophoresis parameter. Furthermore, the numerical solution and the physical interpretation in the literature for the same problem have been validated with the current exact analysis, where many remarkable differences and errors have been concluded. Therefore, the suggested analysis may be recommended with high trust for similar problems.
Exact Boson-Fermion Duality on a 3D Euclidean Lattice
Chen, Jing-Yuan; Son, Jun Ho; Wang, Chao; ...
2018-01-05
The idea of statistical transmutation plays a crucial role in descriptions of the fractional quantum Hall effect. However, a recently conjectured duality between a critical boson and a massless two-component Dirac fermion extends this notion to gapless systems. This duality sheds light on highly nontrivial problems such as the half-filled Landau level, the superconductor-insulator transition, and surface states of strongly coupled topological insulators. Although this boson-fermion duality has undergone many consistency checks, it has remained unproven. Here, we describe the duality in a nonperturbative fashion using an exact UV mapping of partition functions on a 3D Euclidean lattice.
ADM For Solving Linear Second-Order Fredholm Integro-Differential Equations
NASA Astrophysics Data System (ADS)
Karim, Mohd F.; Mohamad, Mahathir; Saifullah Rusiman, Mohd; Che-Him, Norziha; Roslan, Rozaini; Khalid, Kamil
2018-04-01
In this paper, we apply Adomian Decomposition Method (ADM) as numerically analyse linear second-order Fredholm Integro-differential Equations. The approximate solutions of the problems are calculated by Maple package. Some numerical examples have been considered to illustrate the ADM for solving this equation. The results are compared with the existing exact solution. Thus, the Adomian decomposition method can be the best alternative method for solving linear second-order Fredholm Integro-Differential equation. It converges to the exact solution quickly and in the same time reduces computational work for solving the equation. The result obtained by ADM shows the ability and efficiency for solving these equations.
Meulenbroek, Bernard; Ebert, Ute; Schäfer, Lothar
2005-11-04
The dynamics of ionization fronts that generate a conducting body are in the simplest approximation equivalent to viscous fingering without regularization. Going beyond this approximation, we suggest that ionization fronts can be modeled by a mixed Dirichlet-Neumann boundary condition. We derive exact uniformly propagating solutions of this problem in 2D and construct a single partial differential equation governing small perturbations of these solutions. For some parameter value, this equation can be solved analytically, which shows rigorously that the uniformly propagating solution is linearly convectively stable and that the asymptotic relaxation is universal and exponential in time.
Exact Boson-Fermion Duality on a 3D Euclidean Lattice.
Chen, Jing-Yuan; Son, Jun Ho; Wang, Chao; Raghu, S
2018-01-05
The idea of statistical transmutation plays a crucial role in descriptions of the fractional quantum Hall effect. However, a recently conjectured duality between a critical boson and a massless two-component Dirac fermion extends this notion to gapless systems. This duality sheds light on highly nontrivial problems such as the half-filled Landau level, the superconductor-insulator transition, and surface states of strongly coupled topological insulators. Although this boson-fermion duality has undergone many consistency checks, it has remained unproven. We describe the duality in a nonperturbative fashion using an exact UV mapping of partition functions on a 3D Euclidean lattice.
Bounding filter - A simple solution to lack of exact a priori statistics.
NASA Technical Reports Server (NTRS)
Nahi, N. E.; Weiss, I. M.
1972-01-01
Wiener and Kalman-Bucy estimation problems assume that models describing the signal and noise stochastic processes are exactly known. When this modeling information, i.e., the signal and noise spectral densities for Wiener filter and the signal and noise dynamic system and disturbing noise representations for Kalman-Bucy filtering, is inexactly known, then the filter's performance is suboptimal and may even exhibit apparent divergence. In this paper a system is designed whereby the actual estimation error covariance is bounded by the covariance calculated by the estimator. Therefore, the estimator obtains a bound on the actual error covariance which is not available, and also prevents its apparent divergence.
Nonlinear low-frequency electrostatic wave dynamics in a two-dimensional quantum plasma
DOE Office of Scientific and Technical Information (OSTI.GOV)
Ghosh, Samiran, E-mail: sran_g@yahoo.com; Chakrabarti, Nikhil, E-mail: nikhil.chakrabarti@saha.ac.in
2016-08-15
The problem of two-dimensional arbitrary amplitude low-frequency electrostatic oscillation in a quasi-neutral quantum plasma is solved exactly by elementary means. In such quantum plasmas we have treated electrons quantum mechanically and ions classically. The exact analytical solution of the nonlinear system exhibits the formation of dark and black solitons. Numerical simulation also predicts the possible periodic solution of the nonlinear system. Nonlinear analysis reveals that the system does have a bifurcation at a critical Mach number that depends on the angle of propagation of the wave. The small-amplitude limit leads to the formation of weakly nonlinear Kadomstev–Petviashvili solitons.
Features of sound propagation through and stability of a finite shear layer
NASA Technical Reports Server (NTRS)
Koutsoyannis, S. P.
1977-01-01
The plane wave propagation, the stability, and the rectangular duct mode problems of a compressible, inviscid, linearly sheared, parallel, homogeneous flow are shown to be governed by Whittaker's equation. The exact solutions for the perturbation quantities are essentially the Whittaker M-functions where the nondimensional quantities have precise physical meanings. A number of known results are obtained as limiting cases of the exact solutions. For the compressible finite thickness shear layer it is shown that no resonances and no critical angles exist for all Mach numbers, frequencies, and shear layer velocity profile slopes except in the singular case of the vortex sheet.
Exact Boson-Fermion Duality on a 3D Euclidean Lattice
NASA Astrophysics Data System (ADS)
Chen, Jing-Yuan; Son, Jun Ho; Wang, Chao; Raghu, S.
2018-01-01
The idea of statistical transmutation plays a crucial role in descriptions of the fractional quantum Hall effect. However, a recently conjectured duality between a critical boson and a massless two-component Dirac fermion extends this notion to gapless systems. This duality sheds light on highly nontrivial problems such as the half-filled Landau level, the superconductor-insulator transition, and surface states of strongly coupled topological insulators. Although this boson-fermion duality has undergone many consistency checks, it has remained unproven. We describe the duality in a nonperturbative fashion using an exact UV mapping of partition functions on a 3D Euclidean lattice.
NASA Astrophysics Data System (ADS)
Sander, Oliver; Schiela, Anton
2014-12-01
We formulate the static mechanical coupling of a geometrically exact Cosserat rod to a nonlinearly elastic continuum. In this setting, appropriate coupling conditions have to connect a one-dimensional model with director variables to a three-dimensional model without directors. Two alternative coupling conditions are proposed, which correspond to two different configuration trace spaces. For both, we show existence of solutions of the coupled problems, using the direct method of the calculus of variations. From the first-order optimality conditions, we also derive the corresponding conditions for the dual variables. These are then interpreted in mechanical terms.
Fast and reliable symplectic integration for planetary system N-body problems
NASA Astrophysics Data System (ADS)
Hernandez, David M.
2016-06-01
We apply one of the exactly symplectic integrators, which we call HB15, of Hernandez & Bertschinger, along with the Kepler problem solver of Wisdom & Hernandez, to solve planetary system N-body problems. We compare the method to Wisdom-Holman (WH) methods in the MERCURY software package, the MERCURY switching integrator, and others and find HB15 to be the most efficient method or tied for the most efficient method in many cases. Unlike WH, HB15 solved N-body problems exhibiting close encounters with small, acceptable error, although frequent encounters slowed the code. Switching maps like MERCURY change between two methods and are not exactly symplectic. We carry out careful tests on their properties and suggest that they must be used with caution. We then use different integrators to solve a three-body problem consisting of a binary planet orbiting a star. For all tested tolerances and time steps, MERCURY unbinds the binary after 0 to 25 years. However, in the solutions of HB15, a time-symmetric HERMITE code, and a symplectic Yoshida method, the binary remains bound for >1000 years. The methods' solutions are qualitatively different, despite small errors in the first integrals in most cases. Several checks suggest that the qualitative binary behaviour of HB15's solution is correct. The Bulirsch-Stoer and Radau methods in the MERCURY package also unbind the binary before a time of 50 years, suggesting that this dynamical error is due to a MERCURY bug.
The rotating movement of three immiscible fluids - A benchmark problem
Bakker, M.; Oude, Essink G.H.P.; Langevin, C.D.
2004-01-01
A benchmark problem involving the rotating movement of three immiscible fluids is proposed for verifying the density-dependent flow component of groundwater flow codes. The problem consists of a two-dimensional strip in the vertical plane filled with three fluids of different densities separated by interfaces. Initially, the interfaces between the fluids make a 45??angle with the horizontal. Over time, the fluids rotate to the stable position whereby the interfaces are horizontal; all flow is caused by density differences. Two cases of the problem are presented, one resulting in a symmetric flow field and one resulting in an asymmetric flow field. An exact analytical solution for the initial flow field is presented by application of the vortex theory and complex variables. Numerical results are obtained using three variable-density groundwater flow codes (SWI, MOCDENS3D, and SEAWAT). Initial horizontal velocities of the interfaces, as simulated by the three codes, compare well with the exact solution. The three codes are used to simulate the positions of the interfaces at two times; the three codes produce nearly identical results. The agreement between the results is evidence that the specific rotational behavior predicted by the models is correct. It also shows that the proposed problem may be used to benchmark variable-density codes. It is concluded that the three models can be used to model accurately the movement of interfaces between immiscible fluids, and have little or no numerical dispersion. ?? 2003 Elsevier B.V. All rights reserved.
Modeling winter ozone episodes near oil and natural gas fields in Wyoming
NASA Astrophysics Data System (ADS)
Wu, Yuling; Rappenglück, Bernhard; Pour-Biazar, Arastoo; Field, Robert A.; Soltis, Jeff
2017-04-01
Wintertime ozone episodes have been reported in the oil and natural gas (O&NG) producing fields in Uintah Basin, Utah and the Upper Green River Basin (UGRB) in Wyoming in recent years. High concentrations of ozone precursors facilitated by favorable meteorological conditions, including low wind and shallow boundary layer (BL), were found in these episodes, although the exact roles of these precursor species in different O&NG fields are to be determined. Meanwhile, snow cover is also found to play an important role in these winter ozone episodes as the cold snow covered surface enhances the inversion, further limits the BL and the high snow albedo greatly boosts photolysis reactions that are closely related to ozone chemistry. In this study, we utilize model simulation to explore the role of chemical compositions, in terms of different VOC groups and NOx, and that of the enhanced photolysis due to snow cover in the UGRB ozone episodes in the late winter of 2011.
Numerical solution of the electron transport equation
NASA Astrophysics Data System (ADS)
Woods, Mark
The electron transport equation has been solved many times for a variety of reasons. The main difficulty in its numerical solution is that it is a very stiff boundary value problem. The most common numerical methods for solving boundary value problems are symmetric collocation methods and shooting methods. Both of these types of methods can only be applied to the electron transport equation if the boundary conditions are altered with unrealistic assumptions because they require too many points to be practical. Further, they result in oscillating and negative solutions, which are physically meaningless for the problem at hand. For these reasons, all numerical methods for this problem to date are a bit unusual because they were designed to try and avoid the problem of extreme stiffness. This dissertation shows that there is no need to introduce spurious boundary conditions or invent other numerical methods for the electron transport equation. Rather, there already exists methods for very stiff boundary value problems within the numerical analysis literature. We demonstrate one such method in which the fast and slow modes of the boundary value problem are essentially decoupled. This allows for an upwind finite difference method to be applied to each mode as is appropriate. This greatly reduces the number of points needed in the mesh, and we demonstrate how this eliminates the need to define new boundary conditions. This method is verified by showing that under certain restrictive assumptions, the electron transport equation has an exact solution that can be written as an integral. We show that the solution from the upwind method agrees with the quadrature evaluation of the exact solution. This serves to verify that the upwind method is properly solving the electron transport equation. Further, it is demonstrated that the output of the upwind method can be used to compute auroral light emissions.
Effects of Cover Stories on Problem Solving in a Statistics Course
ERIC Educational Resources Information Center
Ricks, Travis Rex; Wiley, Jennifer
2014-01-01
Does having more knowledge or interest in the topics used in example problems facilitate or hinder learning in statistics? Undergraduates enrolled in Introductory Psychology received a lesson on central tendency. Following the lesson, half of the students completed a worksheet with a baseball cover story while the other half received a weather…
Quantum harmonic oscillator in a thermal bath
NASA Technical Reports Server (NTRS)
Zhang, Yuhong
1993-01-01
The influence functional path-integral treatment of quantum Brownian motion is briefly reviewed. A newly derived exact master equation of a quantum harmonic oscillator coupled to a general environment at arbitrary temperature is discussed. It is applied to the problem of loss of quantum coherence.
Event-driven Monte Carlo: Exact dynamics at all time scales for discrete-variable models
NASA Astrophysics Data System (ADS)
Mendoza-Coto, Alejandro; Díaz-Méndez, Rogelio; Pupillo, Guido
2016-06-01
We present an algorithm for the simulation of the exact real-time dynamics of classical many-body systems with discrete energy levels. In the same spirit of kinetic Monte Carlo methods, a stochastic solution of the master equation is found, with no need to define any other phase-space construction. However, unlike existing methods, the present algorithm does not assume any particular statistical distribution to perform moves or to advance the time, and thus is a unique tool for the numerical exploration of fast and ultra-fast dynamical regimes. By decomposing the problem in a set of two-level subsystems, we find a natural variable step size, that is well defined from the normalization condition of the transition probabilities between the levels. We successfully test the algorithm with known exact solutions for non-equilibrium dynamics and equilibrium thermodynamical properties of Ising-spin models in one and two dimensions, and compare to standard implementations of kinetic Monte Carlo methods. The present algorithm is directly applicable to the study of the real-time dynamics of a large class of classical Markovian chains, and particularly to short-time situations where the exact evolution is relevant.
Exact Solutions for Wind-Driven Coastal Upwelling and Downwelling over Sloping Topography
NASA Astrophysics Data System (ADS)
Choboter, P.; Duke, D.; Horton, J.; Sinz, P.
2009-12-01
The dynamics of wind-driven coastal upwelling and downwelling are studied using a simplified dynamical model. Exact solutions are examined as a function of time and over a family of sloping topographies. Assumptions in the two-dimensional model include a frictionless ocean interior below the surface Ekman layer, and no alongshore dependence of the variables; however, dependence in the cross-shore and vertical directions is retained. Additionally, density and alongshore momentum are advected by the cross-shore velocity in order to maintain thermal wind. The time-dependent initial-value problem is solved with constant initial stratification and no initial alongshore flow. An alongshore pressure gradient is added to allow the cross-shore flow to be geostrophically balanced far from shore. Previously, this model has been used to study upwelling over flat-bottom and sloping topographies, but the novel feature in this work is the discovery of exact solutions for downwelling. These exact solutions are compared to numerical solutions from a primitive-equation ocean model, based on the Princeton Ocean Model, configured in a similar two-dimensional geometry. Many typical features of the evolution of density and velocity during downwelling are displayed by the analytical model.
Yu, Yang; Wang, Sihan; Tang, Jiafu; Kaku, Ikou; Sun, Wei
2016-01-01
Productivity can be greatly improved by converting the traditional assembly line to a seru system, especially in the business environment with short product life cycles, uncertain product types and fluctuating production volumes. Line-seru conversion includes two decision processes, i.e., seru formation and seru load. For simplicity, however, previous studies focus on the seru formation with a given scheduling rule in seru load. We select ten scheduling rules usually used in seru load to investigate the influence of different scheduling rules on the performance of line-seru conversion. Moreover, we clarify the complexities of line-seru conversion for ten different scheduling rules from the theoretical perspective. In addition, multi-objective decisions are often used in line-seru conversion. To obtain Pareto-optimal solutions of multi-objective line-seru conversion, we develop two improved exact algorithms based on reducing time complexity and space complexity respectively. Compared with the enumeration based on non-dominated sorting to solve multi-objective problem, the two improved exact algorithms saves computation time greatly. Several numerical simulation experiments are performed to show the performance improvement brought by the two proposed exact algorithms.
1994-09-30
STS068-232-083 (30 September-11 October 1994) --- This is a view of Mount Pinatubo, Philippine Islands, orient with the coast to the top. View westward across central Luzon and Mount Pinatubo. Manilla Bay is in partial sunglint along the left edge of the frame. The extensive flows of volcanic ash (lahars) extending from the mountain are readily seen despite partial cloud cover. The ash is mobilized with every rain in this typhoon-ridden region, flowing down valleys, filling drainage channels, and covering fields and towns. The STS-68 crew obtained excellent photographs of the region, for comparison to the radar data also obtained on the mission. Photographs in sunglint have proven particularly helpful because they show the exact outlines of surface water, which provides a datum point for the radar returns.
NASA Technical Reports Server (NTRS)
Grossman, B.; Moretti, G.
1973-01-01
A computer program to predict the inviscid, transonic flow field about isolated nacelles was developed. The problem was to be formulated to solve Euler's equations without any approximation (such as small disturbances) and hence the terminology exact solution. The flow field was complicated by the presence of imbedded shock waves, an engine-inlet interface, and exhaust plumes. Furthermore, the transonic nacelles of interest had a very slender but blunt cowl lip. This created two distinct length scales, the length of the nacelle and the cowl lip radius that can differ by several orders of magnitude. These aspects of the flow field presented many numerical difficulties. The approach to the problem was to calculate the nacelle flow field using the method of time-dependent computations (TDC). Although at the time of the issuance of this contract, other approaches to transonic flow calculations existed, it was felt that TDC offered the most effective means of meeting the goals of the contract.
A Hybrid alldifferent-Tabu Search Algorithm for Solving Sudoku Puzzles
Crawford, Broderick; Paredes, Fernando; Norero, Enrique
2015-01-01
The Sudoku problem is a well-known logic-based puzzle of combinatorial number-placement. It consists in filling a n 2 × n 2 grid, composed of n columns, n rows, and n subgrids, each one containing distinct integers from 1 to n 2. Such a puzzle belongs to the NP-complete collection of problems, to which there exist diverse exact and approximate methods able to solve it. In this paper, we propose a new hybrid algorithm that smartly combines a classic tabu search procedure with the alldifferent global constraint from the constraint programming world. The alldifferent constraint is known to be efficient for domain filtering in the presence of constraints that must be pairwise different, which are exactly the kind of constraints that Sudokus own. This ability clearly alleviates the work of the tabu search, resulting in a faster and more robust approach for solving Sudokus. We illustrate interesting experimental results where our proposed algorithm outperforms the best results previously reported by hybrids and approximate methods. PMID:26078751
Johnson, Jason K.; Oyen, Diane Adele; Chertkov, Michael; ...
2016-12-01
Inference and learning of graphical models are both well-studied problems in statistics and machine learning that have found many applications in science and engineering. However, exact inference is intractable in general graphical models, which suggests the problem of seeking the best approximation to a collection of random variables within some tractable family of graphical models. In this paper, we focus on the class of planar Ising models, for which exact inference is tractable using techniques of statistical physics. Based on these techniques and recent methods for planarity testing and planar embedding, we propose a greedy algorithm for learning the bestmore » planar Ising model to approximate an arbitrary collection of binary random variables (possibly from sample data). Given the set of all pairwise correlations among variables, we select a planar graph and optimal planar Ising model defined on this graph to best approximate that set of correlations. Finally, we demonstrate our method in simulations and for two applications: modeling senate voting records and identifying geo-chemical depth trends from Mars rover data.« less
DOE Office of Scientific and Technical Information (OSTI.GOV)
Johnson, Jason K.; Oyen, Diane Adele; Chertkov, Michael
Inference and learning of graphical models are both well-studied problems in statistics and machine learning that have found many applications in science and engineering. However, exact inference is intractable in general graphical models, which suggests the problem of seeking the best approximation to a collection of random variables within some tractable family of graphical models. In this paper, we focus on the class of planar Ising models, for which exact inference is tractable using techniques of statistical physics. Based on these techniques and recent methods for planarity testing and planar embedding, we propose a greedy algorithm for learning the bestmore » planar Ising model to approximate an arbitrary collection of binary random variables (possibly from sample data). Given the set of all pairwise correlations among variables, we select a planar graph and optimal planar Ising model defined on this graph to best approximate that set of correlations. Finally, we demonstrate our method in simulations and for two applications: modeling senate voting records and identifying geo-chemical depth trends from Mars rover data.« less
Counterexamples to Moffatt's statements on vortex knots.
Bogoyavlenskij, Oleg
2017-04-01
One of the well-known problems of hydrodynamics is studied: the problem of classification of vortex knots for ideal fluid flows. In the literature there are known Moffatt statements that all torus knots K_{m,n} for all rational numbers m/n (0
NASA Technical Reports Server (NTRS)
Macfarlane, J. J.
1992-01-01
We investigate the convergence properties of Lambda-acceleration methods for non-LTE radiative transfer problems in planar and spherical geometry. Matrix elements of the 'exact' A-operator are used to accelerate convergence to a solution in which both the radiative transfer and atomic rate equations are simultaneously satisfied. Convergence properties of two-level and multilevel atomic systems are investigated for methods using: (1) the complete Lambda-operator, and (2) the diagonal of the Lambda-operator. We find that the convergence properties for the method utilizing the complete Lambda-operator are significantly better than those of the diagonal Lambda-operator method, often reducing the number of iterations needed for convergence by a factor of between two and seven. However, the overall computational time required for large scale calculations - that is, those with many atomic levels and spatial zones - is typically a factor of a few larger for the complete Lambda-operator method, suggesting that the approach should be best applied to problems in which convergence is especially difficult.
The exact calculation of quadrupole sources for some incompressible flows
NASA Technical Reports Server (NTRS)
Brentner, Kenneth S.
1988-01-01
This paper is concerned with the application of the acoustic analogy of Lighthill to the acoustic and aerodynamic problems associated with moving bodies. The Ffowcs Williams-Hawkings equation, which is an interpretation of the acoustic analogy for sound generation by moving bodies, manipulates the source terms into surface and volume sources. Quite often in practice the volume sources, or quadrupoles, are neglected for various reasons. Recently, Farassat, Long and others have attempted to use the FW-H equation with the quadrupole source and neglected to solve for the surface pressure on the body. The purpose of this paper is to examine the contribution of the quadrupole source to the acoustic pressure and body surface pressure for some problems for which the exact solution is known. The inviscid, incompressible, 2-D flow, calculated using the velocity potential, is used to calculate the individual contributions of the various surface and volume source terms in the FW-H equation. The relative importance of each of the sources is then assessed.
Optimization Issues with Complex Rotorcraft Comprehensive Analysis
NASA Technical Reports Server (NTRS)
Walsh, Joanne L.; Young, Katherine C.; Tarzanin, Frank J.; Hirsh, Joel E.; Young, Darrell K.
1998-01-01
This paper investigates the use of the general purpose automatic differentiation (AD) tool called Automatic Differentiation of FORTRAN (ADIFOR) as a means of generating sensitivity derivatives for use in Boeing Helicopter's proprietary comprehensive rotor analysis code (VII). ADIFOR transforms an existing computer program into a new program that performs a sensitivity analysis in addition to the original analysis. In this study both the pros (exact derivatives, no step-size problems) and cons (more CPU, more memory) of ADIFOR are discussed. The size (based on the number of lines) of the VII code after ADIFOR processing increased by 70 percent and resulted in substantial computer memory requirements at execution. The ADIFOR derivatives took about 75 percent longer to compute than the finite-difference derivatives. However, the ADIFOR derivatives are exact and are not functions of step-size. The VII sensitivity derivatives generated by ADIFOR are compared with finite-difference derivatives. The ADIFOR and finite-difference derivatives are used in three optimization schemes to solve a low vibration rotor design problem.
Pulling adsorbed polymers at an angle: A low temperature theory
NASA Astrophysics Data System (ADS)
Iliev, Gerasim; Whittington, Stuart
2012-02-01
We consider several partially-directed walk models in two- and three-dimensions to study the problem of a homopolymer interacting with a surface while subject to a force at the terminal monomer. The force is applied with a component parallel to the surface as well as a component perpendicular to the surface. Depending on the relative values of the force in each direction, the force can either enhance the adsorption transition or lead to desorption in an adsorbed polymer. For each model, we determine the associated generating function and extract the phase diagram, identifying states where the polymer is thermally desorbed, adsorbed, and under the influence of the force. We note the different regimes that appear in the problem and provide a low temperature approximation to describe them. The approximation is exact at T=0 and models the exact results extremely well for small values of T. This work is an extension of a model considered by S. Whittington and E. Orlandini.
A Hybrid alldifferent-Tabu Search Algorithm for Solving Sudoku Puzzles.
Soto, Ricardo; Crawford, Broderick; Galleguillos, Cristian; Paredes, Fernando; Norero, Enrique
2015-01-01
The Sudoku problem is a well-known logic-based puzzle of combinatorial number-placement. It consists in filling a n(2) × n(2) grid, composed of n columns, n rows, and n subgrids, each one containing distinct integers from 1 to n(2). Such a puzzle belongs to the NP-complete collection of problems, to which there exist diverse exact and approximate methods able to solve it. In this paper, we propose a new hybrid algorithm that smartly combines a classic tabu search procedure with the alldifferent global constraint from the constraint programming world. The alldifferent constraint is known to be efficient for domain filtering in the presence of constraints that must be pairwise different, which are exactly the kind of constraints that Sudokus own. This ability clearly alleviates the work of the tabu search, resulting in a faster and more robust approach for solving Sudokus. We illustrate interesting experimental results where our proposed algorithm outperforms the best results previously reported by hybrids and approximate methods.
Research requirements to improve reliability of civil helicopters
NASA Technical Reports Server (NTRS)
Dougherty, J. J., III; Barrett, L. D.
1978-01-01
The major reliability problems of the civil helicopter fleet as reported by helicopter operational and maintenance personnel are documented. An assessment of each problem is made to determine if the reliability can be improved by application of present technology or whether additional research and development are required. The reliability impact is measured in three ways: (1) The relative frequency of each problem in the fleet. (2) The relative on-aircraft manhours to repair, associated with each fleet problem. (3) The relative cost of repair materials or replacement parts associated with each fleet problem. The data reviewed covered the period of 1971 through 1976 and covered only turbine engine aircraft.
Modeling the influence of snow cover temperature and water content on wet-snow avalanche runout
NASA Astrophysics Data System (ADS)
Valero, Cesar Vera; Wever, Nander; Christen, Marc; Bartelt, Perry
2018-03-01
Snow avalanche motion is strongly dependent on the temperature and water content of the snow cover. In this paper we use a snow cover model, driven by measured meteorological data, to set the initial and boundary conditions for wet-snow avalanche calculations. The snow cover model provides estimates of snow height, density, temperature and liquid water content. This information is used to prescribe fracture heights and erosion heights for an avalanche dynamics model. We compare simulated runout distances with observed avalanche deposition fields using a contingency table analysis. Our analysis of the simulations reveals a large variability in predicted runout for tracks with flat terraces and gradual slope transitions to the runout zone. Reliable estimates of avalanche mass (height and density) in the release and erosion zones are identified to be more important than an exact specification of temperature and water content. For wet-snow avalanches, this implies that the layers where meltwater accumulates in the release zone must be identified accurately as this defines the height of the fracture slab and therefore the release mass. Advanced thermomechanical models appear to be better suited to simulate wet-snow avalanche inundation areas than existing guideline procedures if and only if accurate snow cover information is available.
Large-N -approximated field theory for multipartite entanglement
NASA Astrophysics Data System (ADS)
Facchi, P.; Florio, G.; Parisi, G.; Pascazio, S.; Scardicchio, A.
2015-12-01
We try to characterize the statistics of multipartite entanglement of the random states of an n -qubit system. Unable to solve the problem exactly we generalize it, replacing complex numbers with real vectors with Nc components (the original problem is recovered for Nc=2 ). Studying the leading diagrams in the large-Nc approximation, we unearth the presence of a phase transition and, in an explicit example, show that the so-called entanglement frustration disappears in the large-Nc limit.
A collocation-shooting method for solving fractional boundary value problems
NASA Astrophysics Data System (ADS)
Al-Mdallal, Qasem M.; Syam, Muhammed I.; Anwar, M. N.
2010-12-01
In this paper, we discuss the numerical solution of special class of fractional boundary value problems of order 2. The method of solution is based on a conjugating collocation and spline analysis combined with shooting method. A theoretical analysis about the existence and uniqueness of exact solution for the present class is proven. Two examples involving Bagley-Torvik equation subject to boundary conditions are also presented; numerical results illustrate the accuracy of the present scheme.
A Fuzzy Logic Optimal Control Law Solution to the CMMCA Tracking Problem
1993-03-01
or from a transfer function. Many times, however, the resulting algorithms are so complex as to be completely or essentially useless. Applications...implemented in a nearly real time computer simulation. Located within the LQ framework are all the performance data for both the ClMCA and the CX...repuired nor desired. 34 - / k more general and less exacting framework was used. In order to concentrate on tho theory and problem solution, it was
DOE Office of Scientific and Technical Information (OSTI.GOV)
Gorbachev, D V; Ivanov, V I
Gauss and Markov quadrature formulae with nodes at zeros of eigenfunctions of a Sturm-Liouville problem, which are exact for entire functions of exponential type, are established. They generalize quadrature formulae involving zeros of Bessel functions, which were first designed by Frappier and Olivier. Bessel quadratures correspond to the Fourier-Hankel integral transform. Some other examples, connected with the Jacobi integral transform, Fourier series in Jacobi orthogonal polynomials and the general Sturm-Liouville problem with regular weight are also given. Bibliography: 39 titles.
Automated bond order assignment as an optimization problem.
Dehof, Anna Katharina; Rurainski, Alexander; Bui, Quang Bao Anh; Böcker, Sebastian; Lenhof, Hans-Peter; Hildebrandt, Andreas
2011-03-01
Numerous applications in Computational Biology process molecular structures and hence strongly rely not only on correct atomic coordinates but also on correct bond order information. For proteins and nucleic acids, bond orders can be easily deduced but this does not hold for other types of molecules like ligands. For ligands, bond order information is not always provided in molecular databases and thus a variety of approaches tackling this problem have been developed. In this work, we extend an ansatz proposed by Wang et al. that assigns connectivity-based penalty scores and tries to heuristically approximate its optimum. In this work, we present three efficient and exact solvers for the problem replacing the heuristic approximation scheme of the original approach: an A*, an ILP and an fixed-parameter approach (FPT) approach. We implemented and evaluated the original implementation, our A*, ILP and FPT formulation on the MMFF94 validation suite and the KEGG Drug database. We show the benefit of computing exact solutions of the penalty minimization problem and the additional gain when computing all optimal (or even suboptimal) solutions. We close with a detailed comparison of our methods. The A* and ILP solution are integrated into the open-source C++ LGPL library BALL and the molecular visualization and modelling tool BALLView and can be downloaded from our homepage www.ball-project.org. The FPT implementation can be downloaded from http://bio.informatik.uni-jena.de/software/.
Sparse Regression as a Sparse Eigenvalue Problem
NASA Technical Reports Server (NTRS)
Moghaddam, Baback; Gruber, Amit; Weiss, Yair; Avidan, Shai
2008-01-01
We extend the l0-norm "subspectral" algorithms for sparse-LDA [5] and sparse-PCA [6] to general quadratic costs such as MSE in linear (kernel) regression. The resulting "Sparse Least Squares" (SLS) problem is also NP-hard, by way of its equivalence to a rank-1 sparse eigenvalue problem (e.g., binary sparse-LDA [7]). Specifically, for a general quadratic cost we use a highly-efficient technique for direct eigenvalue computation using partitioned matrix inverses which leads to dramatic x103 speed-ups over standard eigenvalue decomposition. This increased efficiency mitigates the O(n4) scaling behaviour that up to now has limited the previous algorithms' utility for high-dimensional learning problems. Moreover, the new computation prioritizes the role of the less-myopic backward elimination stage which becomes more efficient than forward selection. Similarly, branch-and-bound search for Exact Sparse Least Squares (ESLS) also benefits from partitioned matrix inverse techniques. Our Greedy Sparse Least Squares (GSLS) generalizes Natarajan's algorithm [9] also known as Order-Recursive Matching Pursuit (ORMP). Specifically, the forward half of GSLS is exactly equivalent to ORMP but more efficient. By including the backward pass, which only doubles the computation, we can achieve lower MSE than ORMP. Experimental comparisons to the state-of-the-art LARS algorithm [3] show forward-GSLS is faster, more accurate and more flexible in terms of choice of regularization
NASA Technical Reports Server (NTRS)
Wolpert, David H.; Macready, William G.
2005-01-01
Recent work on the foundations of optimization has begun to uncover its underlying rich structure. In particular, the "No Free Lunch" (NFL) theorems [WM97] state that any two algorithms are equivalent when their performance is averaged across all possible problems. This highlights the need for exploiting problem-specific knowledge to achieve better than random performance. In this paper we present a general framework covering most search scenarios. In addition to the optimization scenarios addressed in the NFL results, this framework covers multi-armed bandit problems and evolution of multiple co-evolving agents. As a particular instance of the latter, it covers "self-play" problems. In these problems the agents work together to produce a champion, who then engages one or more antagonists in a subsequent multi-player game In contrast to the traditional optimization case where the NFL results hold, we show that in self-play there are free lunches: in coevolution some algorithms have better performance than other algorithms, averaged across all possible problems. However in the typical coevolutionary scenarios encountered in biology, where there is no champion, NFL still holds.
Persuasive Aid: Looking the Gift Horse in the Mouth
1998-09-14
9% E-I c I The National War College National Defense University Persuasive AId. Looklng the Gift Horse In the Mouth A paper submitted In...14 SEP 1998 2. REPORT TYPE 3. DATES COVERED 14-09-1998 to 14-09-1998 4. TITLE AND SUBTITLE Persuasive Aid. Looking the Gift Horse in the Mouth...Interest). The adage goes that one should “never look a gift horse In the mouth.” Yet that IS exactly what many aid recipients are doing - questioning
Combinatorial interpretation of Haldane-Wu fractional exclusion statistics.
Aringazin, A K; Mazhitov, M I
2002-08-01
Assuming that the maximal allowed number of identical particles in a state is an integer parameter, q, we derive the statistical weight and analyze the associated equation that defines the statistical distribution. The derived distribution covers Fermi-Dirac and Bose-Einstein ones in the particular cases q=1 and q--> infinity (n(i)/q-->1), respectively. We show that the derived statistical weight provides a natural combinatorial interpretation of Haldane-Wu fractional exclusion statistics, and present exact solutions of the distribution equation.
Novel Genetic Models to Study the Role of Inflammation in Brain Injury-Induced Alzheimer’s Pathology
2013-10-01
REPORT TYPE Annual 3. DATES COVERED 30 Sep 2012 – 29 Sep 2013 4 . TITLE AND SUBTITLE 5a. CONTRACT NUMBER Novel Genetic Models to Study the Role...infiltration and activation of monocytes due to disruption of the blood-brain barrier [ 4 -6]. Assessing the exact roles of these cells in AD pathogenesis...paradigm of TBI Statement of Work: Task 1. Generate animals required for studies (timeframe, months 2- 4 ) Task 2. Perform FPI (timeframe, months 4 -8
Linking soil systems to societal value systems
NASA Astrophysics Data System (ADS)
Helming, Katharina; Daedlow, Katrin; Techen, Anja; Kaiser, David Brian
2017-04-01
Sustainable management of soils is needed to avoid soil degradation and to maintain soil functions. This requires the assessment of how human activities drive soil management, how soil management affect soil functions and soil degradation, which trade-offs occur and how they compromise sustainable development targets. In the frame of the German research programme "Soils as a sustainable resource for the bio-economy - BonaRes", we developed an enhanced approach of the DPSIR (driver-pressure-state-impact-response) cycle which helps to assess these interrelations. Because not all soil functions can be maximized simultaneously in space and time and trade-offs are inevitable, it depends on the societal value system to decide which management practices and respective soil functional performances are valued sustainably. We analysed the applicability of three valuation concepts being prominent in research about social-ecological systems, namely resource efficiency, ecosystem services, and ethics and equity. The concept of resource efficiency is based in the life-cycle thinking and is often applied at the level of the farming systems and in the context of bio-economy strategies. It covers the use of natural (water, energy, nutrients, land) and economic resources. At the landscape level, the concept of ecosystem services is prominent. Here, the contribution of soils to the provisioning, regulating and cultural services of the natural ecosystems is considered. Ethical considerations include the intrinsic values of nature as well as issues of local and global equity between different societal groups, generations, and localities. The three concepts cover different problem dimensions and complexity levels of soil management and decision making. Alone, none of them are capable to discover complex questions of sustainable soil management and development. Rather, the exact spatial and temporal framing of the sustainability problem at stake determines which combination of the value system is appropriate. Exemplified by some studies on soil management, we conclude with an outlook on criteria for selecting and combining value systems to assess the involvement of soil functions to specific Sustainable Development Goals at different spatial, temporal and decision making scales.
NASA Astrophysics Data System (ADS)
Heusler, Stefan
2006-12-01
The main focus of the second, enlarged edition of the book Mathematica for Theoretical Physics is on computational examples using the computer program Mathematica in various areas in physics. It is a notebook rather than a textbook. Indeed, the book is just a printout of the Mathematica notebooks included on the CD. The second edition is divided into two volumes, the first covering classical mechanics and nonlinear dynamics, the second dealing with examples in electrodynamics, quantum mechanics, general relativity and fractal geometry. The second volume is not suited for newcomers because basic and simple physical ideas which lead to complex formulas are not explained in detail. Instead, the computer technology makes it possible to write down and manipulate formulas of practically any length. For researchers with experience in computing, the book contains a lot of interesting and non-trivial examples. Most of the examples discussed are standard textbook problems, but the power of Mathematica opens the path to more sophisticated solutions. For example, the exact solution for the perihelion shift of Mercury within general relativity is worked out in detail using elliptic functions. The virial equation of state for molecules' interaction with Lennard-Jones-like potentials is discussed, including both classical and quantum corrections to the second virial coefficient. Interestingly, closed solutions become available using sophisticated computing methods within Mathematica. In my opinion, the textbook should not show formulas in detail which cover three or more pages—these technical data should just be contained on the CD. Instead, the textbook should focus on more detailed explanation of the physical concepts behind the technicalities. The discussion of the virial equation would benefit much from replacing 15 pages of Mathematica output with 15 pages of further explanation and motivation. In this combination, the power of computing merged with physical intuition would be of benefit even for newcomers. In summary, this book shows in a convincing manner how classical problems in physics can be attacked with modern computing technology. The second volume is interesting for experienced users of Mathematica. For students, the textbook can be very useful in combination with a seminar.
A feasible DY conjugate gradient method for linear equality constraints
NASA Astrophysics Data System (ADS)
LI, Can
2017-09-01
In this paper, we propose a feasible conjugate gradient method for solving linear equality constrained optimization problem. The method is an extension of the Dai-Yuan conjugate gradient method proposed by Dai and Yuan to linear equality constrained optimization problem. It can be applied to solve large linear equality constrained problem due to lower storage requirement. An attractive property of the method is that the generated direction is always feasible and descent direction. Under mild conditions, the global convergence of the proposed method with exact line search is established. Numerical experiments are also given which show the efficiency of the method.
Numerical solution of sixth-order boundary-value problems using Legendre wavelet collocation method
NASA Astrophysics Data System (ADS)
Sohaib, Muhammad; Haq, Sirajul; Mukhtar, Safyan; Khan, Imad
2018-03-01
An efficient method is proposed to approximate sixth order boundary value problems. The proposed method is based on Legendre wavelet in which Legendre polynomial is used. The mechanism of the method is to use collocation points that converts the differential equation into a system of algebraic equations. For validation two test problems are discussed. The results obtained from proposed method are quite accurate, also close to exact solution, and other different methods. The proposed method is computationally more effective and leads to more accurate results as compared to other methods from literature.
Solving fractional optimal control problems within a Chebyshev-Legendre operational technique
NASA Astrophysics Data System (ADS)
Bhrawy, A. H.; Ezz-Eldien, S. S.; Doha, E. H.; Abdelkawy, M. A.; Baleanu, D.
2017-06-01
In this manuscript, we report a new operational technique for approximating the numerical solution of fractional optimal control (FOC) problems. The operational matrix of the Caputo fractional derivative of the orthonormal Chebyshev polynomial and the Legendre-Gauss quadrature formula are used, and then the Lagrange multiplier scheme is employed for reducing such problems into those consisting of systems of easily solvable algebraic equations. We compare the approximate solutions achieved using our approach with the exact solutions and with those presented in other techniques and we show the accuracy and applicability of the new numerical approach, through two numerical examples.
1980-02-01
to estimate f -..ell, -noderately ,-ell, or- poorly. 1 ’The sansitivity *of a rec-ilarized estimate of f to the noise is made explicit. After giving the...AD-A 7 .SA92 925 WISCONSIN UN! V-MADISON DEFT OF STATISTICS F /S 11,’ 1 ILL POSED PRORLEMS: NUMERICAL ANn STATISTICAL METHODS FOR MILOL-ETC(U FEB 80 a...estimate f given z. We first define the 1 intrinsic rank of the problem where jK(tit) f (t)dt is known exactly. This 0 definition is used to provide insight
Pigache, Francois; Messine, Frédéric; Nogarede, Bertrand
2007-07-01
This paper deals with a deterministic and rational way to design piezoelectric transformers in radial mode. The proposed approach is based on the study of the inverse problem of design and on its reformulation as a mixed constrained global optimization problem. The methodology relies on the association of the analytical models for describing the corresponding optimization problem and on an exact global optimization software, named IBBA and developed by the second author to solve it. Numerical experiments are presented and compared in order to validate the proposed approach.
A fast isogeometric BEM for the three dimensional Laplace- and Helmholtz problems
NASA Astrophysics Data System (ADS)
Dölz, Jürgen; Harbrecht, Helmut; Kurz, Stefan; Schöps, Sebastian; Wolf, Felix
2018-03-01
We present an indirect higher order boundary element method utilising NURBS mappings for exact geometry representation and an interpolation-based fast multipole method for compression and reduction of computational complexity, to counteract the problems arising due to the dense matrices produced by boundary element methods. By solving Laplace and Helmholtz problems via a single layer approach we show, through a series of numerical examples suitable for easy comparison with other numerical schemes, that one can indeed achieve extremely high rates of convergence of the pointwise potential through the utilisation of higher order B-spline-based ansatz functions.
A modified form of conjugate gradient method for unconstrained optimization problems
NASA Astrophysics Data System (ADS)
Ghani, Nur Hamizah Abdul; Rivaie, Mohd.; Mamat, Mustafa
2016-06-01
Conjugate gradient (CG) methods have been recognized as an interesting technique to solve optimization problems, due to the numerical efficiency, simplicity and low memory requirements. In this paper, we propose a new CG method based on the study of Rivaie et al. [7] (Comparative study of conjugate gradient coefficient for unconstrained Optimization, Aus. J. Bas. Appl. Sci. 5(2011) 947-951). Then, we show that our method satisfies sufficient descent condition and converges globally with exact line search. Numerical results show that our proposed method is efficient for given standard test problems, compare to other existing CG methods.
NASA Technical Reports Server (NTRS)
Dillard, J. P.
1981-01-01
The study objective was to develop or modify methods in an operational framework that would allow incorporation of satellite derived snow cover observations for prediction of snowmelt derived runoff. Data were reviewed and verified for five basins in the Pacific Northwest. The data were analyzed for up to a 6-year period ending July 1978, and in all cases cover a low, average, and high snow cover/runoff year. Cloud cover is a major problem in these springtime runoff analyses and have hampered data collection for periods of up to 52 days. Tree cover and terrain are sufficiently dense and rugged to have caused problems. The interpretation of snowlines from satellite data was compared with conventional ground truth data and tested in operational streamflow forecasting models. When the satellite snow-covered area (SCA) data are incorporated in the SSARR (Streamflow Synthesis and Reservoir Regulation) model, there is a definite but minor improvement.
A Comprehensive Investigation of Copper Pitting Corrosion in a Drinking Water Distribution System
Copper pipe pitting is a complicated corrosion process for which exact causes and solutions are uncertain. This paper presents the findings of a comprehensive investigation of a cold water copper pitting corrosion problem in a drinking water distribution system, including a refi...
Public Sector Employee Assistance Programs.
ERIC Educational Resources Information Center
Kemp, Donna R.; Verlinde, Beverly
This document discusses employee assistance programs (EAPs), programs which have been developed to help employees deal with personal problems that seriously affect job performance. It reviews literature which specifically addresses EAPs in the public sector, noting that there are no exact figures on how many public entities have EAPs. Previous…
Pattern-set generation algorithm for the one-dimensional multiple stock sizes cutting stock problem
NASA Astrophysics Data System (ADS)
Cui, Yaodong; Cui, Yi-Ping; Zhao, Zhigang
2015-09-01
A pattern-set generation algorithm (PSG) for the one-dimensional multiple stock sizes cutting stock problem (1DMSSCSP) is presented. The solution process contains two stages. In the first stage, the PSG solves the residual problems repeatedly to generate the patterns in the pattern set, where each residual problem is solved by the column-generation approach, and each pattern is generated by solving a single large object placement problem. In the second stage, the integer linear programming model of the 1DMSSCSP is solved using a commercial solver, where only the patterns in the pattern set are considered. The computational results of benchmark instances indicate that the PSG outperforms existing heuristic algorithms and rivals the exact algorithm in solution quality.
NASA Astrophysics Data System (ADS)
Voloshinov, V. V.
2018-03-01
In computations related to mathematical programming problems, one often has to consider approximate, rather than exact, solutions satisfying the constraints of the problem and the optimality criterion with a certain error. For determining stopping rules for iterative procedures, in the stability analysis of solutions with respect to errors in the initial data, etc., a justified characteristic of such solutions that is independent of the numerical method used to obtain them is needed. A necessary δ-optimality condition in the smooth mathematical programming problem that generalizes the Karush-Kuhn-Tucker theorem for the case of approximate solutions is obtained. The Lagrange multipliers corresponding to the approximate solution are determined by solving an approximating quadratic programming problem.
Pham, Tuan Anh; Hà, Minh Hoàng; Nguyen, Xuan Hoai
2018-06-01
This data article contains data related to the research article entitled, "Solving the multi-vehicle multi-covering tour problem" (Pham et al., 2017) [4]. All data of this article was generated from instances kroA100, kroB100, kroC100, kroD100, kroA200, and kroB200 from TSPLIB. It can be downloaded from public repository. This data can be used as benchmarks for the covering tour problem (CTP) variants, such as m -CTP- p , m -CTP, mm -CTP- p , mm -CTP, mm -CTP-o, mm -CTP-wo. We tested our algorithm on these data and results are shown in Pham et al. (2017) [4].
DOE Office of Scientific and Technical Information (OSTI.GOV)
Schroeder, E.; Bagot, B.; McNeill, R.L.
1990-05-09
The purpose of this User's Guide is to show by example many of the features of Toolkit II. Some examples will be copies of screens as they appear while running the Toolkit. Other examples will show what the user should enter in various situations; in these instances, what the computer asserts will be in boldface and what the user responds will be in regular type. The User's Guide is divided into four sections. The first section, FOCUS Databases'', will give a broad overview of the Focus administrative databases that are available on the VAX; easy-to-use reports are available for mostmore » of them in the Toolkit. The second section, Getting Started'', will cover the steps necessary to log onto the Computer Center VAX cluster and how to start Focus and the Toolkit. The third section, Using the Toolkit'', will discuss some of the features in the Toolkit -- the available reports and how to access them, as well as some utilities. The fourth section, Helpful Hints'', will cover some useful facts about the VAX and Focus as well as some of the more common problems that can occur. The Toolkit is not set in concrete but is continually being revised and improved. If you have any opinions as to changes that you would like to see made to the Toolkit or new features that you would like included, please let us know. Since we do try to respond to the needs of the user and make periodic improvement to the Toolkit, this User's Guide may not correspond exactly to what is available in the computer. In general, changes are made to provide new options or features; rarely is an existing feature deleted.« less
NASA Technical Reports Server (NTRS)
1943-01-01
This is the second of a series of reports covering an investigation of the general instability problem by the California Institute of Technology. The first five reports of this series cover investigations of the general instability problem under the loading conditions of pure bending and were prepared under the sponsorship of the Civil Aeronautics Administration. The succeeding reports of this series cover the work done on other loading conditions under the sponsorship of the National Advisory Committee for Aeronautics.
Third Computational Aeroacoustics (CAA) Workshop on Benchmark Problems
NASA Technical Reports Server (NTRS)
Dahl, Milo D. (Editor)
2000-01-01
The proceedings of the Third Computational Aeroacoustics (CAA) Workshop on Benchmark Problems cosponsored by the Ohio Aerospace Institute and the NASA Glenn Research Center are the subject of this report. Fan noise was the chosen theme for this workshop with representative problems encompassing four of the six benchmark problem categories. The other two categories were related to jet noise and cavity noise. For the first time in this series of workshops, the computational results for the cavity noise problem were compared to experimental data. All the other problems had exact solutions, which are included in this report. The Workshop included a panel discussion by representatives of industry. The participants gave their views on the status of applying computational aeroacoustics to solve practical industry related problems and what issues need to be addressed to make CAA a robust design tool.
Space Applications and Global Information Infrastructure: a Global Approach against Epidemics
NASA Astrophysics Data System (ADS)
Bastos, C. R.
2002-01-01
Brazilian space expenditures correspond to a low-middle rank among the space-faring nations. In this regard, international partnerships have opened doors for the country to take part in a wider range of projects than it would be possible if carried out on its own. Within the above framework, this paper will address a concept in which countries join efforts in pursuit of common objectives and needs in the field of health, countries whose similarities tend to make them face the same types of health problems. Exactly for this reason, such countries can get together and share the costs, risks and ultimately the benefits of their joint efforts. Infectious diseases are mankind's leading causes of death. And their agents travel around the world by the action of their vectors: insects, birds, winds, infected individuals, and others. The ways how Global Information Infrastructure and Space applications can be very helpful in the detection, identification, tracking and fighting migratory diseases will then be discussed. A concept for an international cooperative initiative is presented, addressing its composition, its implementation, the international coordination requirements, the financial and funding issues related to its implementation and sustainability, and the roles to be played by such an organization. The funding issue deserves a closer attention, since many good ideas are killed by financial problems in their early implementation stages. Finally, a conclusion drives the audience's attention towards the potential advantages of space-based assets in covering large portions of the Earth, and consequently being suitable for global initiatives for the benefit of mankind.
Probabilistic treatment of the uncertainty from the finite size of weighted Monte Carlo data
NASA Astrophysics Data System (ADS)
Glüsenkamp, Thorsten
2018-06-01
Parameter estimation in HEP experiments often involves Monte Carlo simulation to model the experimental response function. A typical application are forward-folding likelihood analyses with re-weighting, or time-consuming minimization schemes with a new simulation set for each parameter value. Problematically, the finite size of such Monte Carlo samples carries intrinsic uncertainty that can lead to a substantial bias in parameter estimation if it is neglected and the sample size is small. We introduce a probabilistic treatment of this problem by replacing the usual likelihood functions with novel generalized probability distributions that incorporate the finite statistics via suitable marginalization. These new PDFs are analytic, and can be used to replace the Poisson, multinomial, and sample-based unbinned likelihoods, which covers many use cases in high-energy physics. In the limit of infinite statistics, they reduce to the respective standard probability distributions. In the general case of arbitrary Monte Carlo weights, the expressions involve the fourth Lauricella function FD, for which we find a new finite-sum representation in a certain parameter setting. The result also represents an exact form for Carlson's Dirichlet average Rn with n > 0, and thereby an efficient way to calculate the probability generating function of the Dirichlet-multinomial distribution, the extended divided difference of a monomial, or arbitrary moments of univariate B-splines. We demonstrate the bias reduction of our approach with a typical toy Monte Carlo problem, estimating the normalization of a peak in a falling energy spectrum, and compare the results with previously published methods from the literature.
Well-posedness of nonlocal parabolic differential problems with dependent operators.
Ashyralyev, Allaberen; Hanalyev, Asker
2014-01-01
The nonlocal boundary value problem for the parabolic differential equation v'(t) + A(t)v(t) = f(t) (0 ≤ t ≤ T), v(0) = v(λ) + φ, 0 < λ ≤ T in an arbitrary Banach space E with the dependent linear positive operator A(t) is investigated. The well-posedness of this problem is established in Banach spaces C 0 (β,γ) (E α-β ) of all E α-β -valued continuous functions φ(t) on [0, T] satisfying a Hölder condition with a weight (t + τ)(γ). New Schauder type exact estimates in Hölder norms for the solution of two nonlocal boundary value problems for parabolic equations with dependent coefficients are established.
MODIS Snow Cover Mapping Decision Tree Technique: Snow and Cloud Discrimination
NASA Technical Reports Server (NTRS)
Riggs, George A.; Hall, Dorothy K.
2010-01-01
Accurate mapping of snow cover continues to challenge cryospheric scientists and modelers. The Moderate-Resolution Imaging Spectroradiometer (MODIS) snow data products have been used since 2000 by many investigators to map and monitor snow cover extent for various applications. Users have reported on the utility of the products and also on problems encountered. Three problems or hindrances in the use of the MODIS snow data products that have been reported in the literature are: cloud obscuration, snow/cloud confusion, and snow omission errors in thin or sparse snow cover conditions. Implementation of the MODIS snow algorithm in a decision tree technique using surface reflectance input to mitigate those problems is being investigated. The objective of this work is to use a decision tree structure for the snow algorithm. This should alleviate snow/cloud confusion and omission errors and provide a snow map with classes that convey information on how snow was detected, e.g. snow under clear sky, snow tinder cloud, to enable users' flexibility in interpreting and deriving a snow map. Results of a snow cover decision tree algorithm are compared to the standard MODIS snow map and found to exhibit improved ability to alleviate snow/cloud confusion in some situations allowing up to about 5% increase in mapped snow cover extent, thus accuracy, in some scenes.
NASA Astrophysics Data System (ADS)
Lawrence, G.; Barnard, C.; Viswanathan, V.
1986-11-01
Historically, wave optics computer codes have been paraxial in nature. Folded systems could be modeled by "unfolding" the optical system. Calculation of optical aberrations is, in general, left for the analyst to do with off-line codes. While such paraxial codes were adequate for the simpler systems being studied 10 years ago, current problems such as phased arrays, ring resonators, coupled resonators, and grazing incidence optics require a major advance in analytical capability. This paper describes extension of the physical optics codes GLAD and GLAD V to include a global coordinate system and exact ray aberration calculations. The global coordinate system allows components to be positioned and rotated arbitrarily. Exact aberrations are calculated for components in aligned or misaligned configurations by using ray tracing to compute optical path differences and diffraction propagation. Optical path lengths between components and beam rotations in complex mirror systems are calculated accurately so that coherent interactions in phased arrays and coupled devices may be treated correctly.
Dark energy fingerprints in the nonminimal Wu-Yang wormhole structure
NASA Astrophysics Data System (ADS)
Balakin, Alexander B.; Zayats, Alexei E.
2014-08-01
We discuss new exact solutions to nonminimally extended Einstein-Yang-Mills equations describing spherically symmetric static wormholes supported by the gauge field of the Wu-Yang type in a dark energy environment. We focus on the analysis of three types of exact solutions to the gravitational field equations. Solutions of the first type relate to the model, in which the dark energy is anisotropic; i.e., the radial and tangential pressures do not coincide. Solutions of the second type correspond to the isotropic pressure tensor; in particular, we discuss the exact solution, for which the dark energy is characterized by the equation of state for a string gas. Solutions of the third type describe the dark energy model with constant pressure and energy density. For the solutions of the third type, we consider in detail the problem of horizons and find constraints for the parameters of nonminimal coupling and for the constitutive parameters of the dark energy equation of state, which guarantee that the nonminimal wormholes are traversable.
A large class of solvable multistate Landau–Zener models and quantum integrability
NASA Astrophysics Data System (ADS)
Chernyak, Vladimir Y.; Sinitsyn, Nikolai A.; Sun, Chen
2018-06-01
The concept of quantum integrability has been introduced recently for quantum systems with explicitly time-dependent Hamiltonians (Sinitsyn et al 2018 Phys. Rev. Lett. 120 190402). Within the multistate Landau–Zener (MLZ) theory, however, there has been a successful alternative approach to identify and solve complex time-dependent models (Sinitsyn and Chernyak 2017 J. Phys. A: Math. Theor. 50 255203). Here we compare both methods by applying them to a new class of exactly solvable MLZ models. This class contains systems with an arbitrary number of interacting states and shows quick growth with N number of exact adiabatic energy crossing points, which appear at different moments of time. At each N, transition probabilities in these systems can be found analytically and exactly but complexity and variety of solutions in this class also grow with N quickly. We illustrate how common features of solvable MLZ systems appear from quantum integrability and develop an approach to further classification of solvable MLZ problems.
Chindelevitch, Leonid; Trigg, Jason; Regev, Aviv; Berger, Bonnie
2014-01-01
Constraint-based models are currently the only methodology that allows the study of metabolism at the whole-genome scale. Flux balance analysis is commonly used to analyse constraint-based models. Curiously, the results of this analysis vary with the software being run, a situation that we show can be remedied by using exact rather than floating-point arithmetic. Here we introduce MONGOOSE, a toolbox for analysing the structure of constraint-based metabolic models in exact arithmetic. We apply MONGOOSE to the analysis of 98 existing metabolic network models and find that the biomass reaction is surprisingly blocked (unable to sustain non-zero flux) in nearly half of them. We propose a principled approach for unblocking these reactions and extend it to the problems of identifying essential and synthetic lethal reactions and minimal media. Our structural insights enable a systematic study of constraint-based metabolic models, yielding a deeper understanding of their possibilities and limitations. PMID:25291352
Construction of exact constants of motion and effective models for many-body localized systems
NASA Astrophysics Data System (ADS)
Goihl, M.; Gluza, M.; Krumnow, C.; Eisert, J.
2018-04-01
One of the defining features of many-body localization is the presence of many quasilocal conserved quantities. These constants of motion constitute a cornerstone to an intuitive understanding of much of the phenomenology of many-body localized systems arising from effective Hamiltonians. They may be seen as local magnetization operators smeared out by a quasilocal unitary. However, accurately identifying such constants of motion remains a challenging problem. Current numerical constructions often capture the conserved operators only approximately, thus restricting a conclusive understanding of many-body localization. In this work, we use methods from the theory of quantum many-body systems out of equilibrium to establish an alternative approach for finding a complete set of exact constants of motion which are in addition guaranteed to represent Pauli-z operators. By this we are able to construct and investigate the proposed effective Hamiltonian using exact diagonalization. Hence, our work provides an important tool expected to further boost inquiries into the breakdown of transport due to quenched disorder.
High order finite volume WENO schemes for the Euler equations under gravitational fields
NASA Astrophysics Data System (ADS)
Li, Gang; Xing, Yulong
2016-07-01
Euler equations with gravitational source terms are used to model many astrophysical and atmospheric phenomena. This system admits hydrostatic balance where the flux produced by the pressure is exactly canceled by the gravitational source term, and two commonly seen equilibria are the isothermal and polytropic hydrostatic solutions. Exact preservation of these equilibria is desirable as many practical problems are small perturbations of such balance. High order finite difference weighted essentially non-oscillatory (WENO) schemes have been proposed in [22], but only for the isothermal equilibrium state. In this paper, we design high order well-balanced finite volume WENO schemes, which can preserve not only the isothermal equilibrium but also the polytropic hydrostatic balance state exactly, and maintain genuine high order accuracy for general solutions. The well-balanced property is obtained by novel source term reformulation and discretization, combined with well-balanced numerical fluxes. Extensive one- and two-dimensional simulations are performed to verify well-balanced property, high order accuracy, as well as good resolution for smooth and discontinuous solutions.
1981-06-15
relationships 5 3. Normalized energy in ambiguity function for i = 0 14 k ilI SACLANTCEN SR-50 A RESUME OF STOCHASTIC, TIME-VARYING, LINEAR SYSTEM THEORY WITH...the order in which systems are concatenated is unimportant. These results are exactly analogous to the results of time-invariant linear system theory in...REFERENCES 1. MEIER, L. A rdsum6 of deterministic time-varying linear system theory with application to active sonar signal processing problems, SACLANTCEN
NASA Astrophysics Data System (ADS)
Barsan, Victor
2018-05-01
Several classes of transcendental equations, mainly eigenvalue equations associated to non-relativistic quantum mechanical problems, are analyzed. Siewert's systematic approach of such equations is discussed from the perspective of the new results recently obtained in the theory of generalized Lambert functions and of algebraic approximations of various special or elementary functions. Combining exact and approximate analytical methods, quite precise analytical outputs are obtained for apparently untractable problems. The results can be applied in quantum and classical mechanics, magnetism, elasticity, solar energy conversion, etc.
Analytical Solution for the Free Vibration Analysis of Delaminated Timoshenko Beams
Abedi, Maryam
2014-01-01
This work presents a method to find the exact solutions for the free vibration analysis of a delaminated beam based on the Timoshenko type with different boundary conditions. The solutions are obtained by the method of Lagrange multipliers in which the free vibration problem is posed as a constrained variational problem. The Legendre orthogonal polynomials are used as the beam eigenfunctions. Natural frequencies and mode shapes of various Timoshenko beams are presented to demonstrate the efficiency of the methodology. PMID:24574879
DOE Office of Scientific and Technical Information (OSTI.GOV)
Singleton, Jr., Robert
This report documents the implementation of several related 1D heat flow problems in the verification package ExactPack [1]. In particular, the planar sandwich class defined in Ref. [2], as well as the classes PlanarSandwichHot, PlanarSandwichHalf, and other generalizations of the planar sandwich problem, are defined and documented here. A rather general treatment of 1D heat flow is presented, whose main results have been implemented in the class Rod1D. All planar sandwich classes are derived from the parent class Rod1D.
Analysis of combustion instability in liquid fuel rocket motors. Ph.D. Thesis
NASA Technical Reports Server (NTRS)
Wong, K. W.
1979-01-01
The development of an analytical technique used in the solution of nonlinear velocity-sensitive combustion instability problems is presented. The Galerkin method was used and proved successful. The pressure wave forms exhibit a strong second harmonic distortion and a variety of behaviors are possible depending on the nature of the combustion process and the parametric values involved. A one dimensional model provides insight into the problem by allowing a comparison of Galerkin solutions with more exact finite difference computations.
One-dimensional Coulomb problem in Dirac materials
NASA Astrophysics Data System (ADS)
Downing, C. A.; Portnoi, M. E.
2014-11-01
We investigate the one-dimensional Coulomb potential with application to a class of quasirelativistic systems, so-called Dirac-Weyl materials, described by matrix Hamiltonians. We obtain the exact solution of the shifted and truncated Coulomb problems, with the wave functions expressed in terms of special functions (namely, Whittaker functions), while the energy spectrum must be determined via solutions to transcendental equations. Most notably, there are critical band gaps below which certain low-lying quantum states are missing in a manifestation of atomic collapse.
A possible generalization of the harmonic oscillator potential
NASA Technical Reports Server (NTRS)
Levai, Geza
1995-01-01
A four-parameter potential is analyzed, which contains the three-dimensional harmonic oscillator as a special case. This potential is exactly solvable and retains several characteristics of the harmonic oscillator, and also of the Coulomb problem. The possibility of similar generalizations of other potentials is also pointed out.
Colliding impulsive gravitational waves
DOE Office of Scientific and Technical Information (OSTI.GOV)
Nutku, Y.; Halil, M.
1977-11-28
We formulate the problem of colliding plane gravitational waves with two polarizations as the harmonic mappings of Riemannian manifolds and construct an exact solution of the vacuum Einstein field equations describing the interaction of colliding impulsive gravitational waves which in the limit of collinear polarization reduces to the solution of Khan and Penrose.
Confidence Scoring of Speaking Performance: How Does Fuzziness become Exact?
ERIC Educational Resources Information Center
Jin, Tan; Mak, Barley; Zhou, Pei
2012-01-01
The fuzziness of assessing second language speaking performance raises two difficulties in scoring speaking performance: "indistinction between adjacent levels" and "overlap between scales". To address these two problems, this article proposes a new approach, "confidence scoring", to deal with such fuzziness, leading to "confidence" scores between…
ERIC Educational Resources Information Center
McLarty, Joyce R.
The problem of establishing appropriate passing scores is one of evaluation rather than estimation and not amenable to exact solution. It must therefore be approached by (1) identifying criteria for judging the acceptability of the passing score, (2) collecting the data appropriate to assessing each relevant criterion, and (3) judging how well the…
ERIC Educational Resources Information Center
Fischer, Gerhard H.
1987-01-01
A natural parameterization and formalization of the problem of measuring change in dichotomous data is developed. Mathematically-exact definitions of specific objectivity are presented, and the basic structures of the linear logistic test model and the linear logistic model with relaxed assumptions are clarified. (SLD)
Don't Just Do the Math--Type It!
ERIC Educational Resources Information Center
Stephens, Greg
2016-01-01
Most word processors, including Google Docs™ and Microsoft® Word, include an equation editor. These are great tools for the occasional homework problem or project assignment. Getting the mathematics to display correctly means making decisions about exactly which elements of an expression go where. The feedback is immediate: Students can see…
Computerized Diagnostic Testing: Problems and Possibilities.
ERIC Educational Resources Information Center
McArthur, David L.
The use of computers to build diagnostic inferences is explored in two contexts. In computerized monitoring of liquid oxygen systems for the space shuttle, diagnoses are exact because they can be derived within a world which is closed. In computerized classroom testing of reading comprehension, programs deliver a constrained form of adaptive…
Phonological Precedence in Dyslexia: A Case Study
ERIC Educational Resources Information Center
Schneider-Zioga, Patricia
2012-01-01
Developmental dyslexia is believed to involve a phonological deficit of which the exact properties have not been clearly established. This article presents the findings of a longitudinal case study that suggest that, at least for some people with dyslexia, the fundamental problem involves a disturbance of temporal-spatial ordering abilities. A…
Solution of the advection-dispersion equation: Continuous load of finite duration
Runkel, R.L.
1996-01-01
Field studies of solute fate and transport in streams and rivers often involve an. experimental release of solutes at an upstream boundary for a finite period of time. A review of several standard references on surface-water-quality modeling indicates that the analytical solution to the constant-parameter advection-dispersion equation for this type of boundary condition has been generally overlooked. Here an exact analytical solution that considers a continuous load of unite duration is compared to an approximate analytical solution presented elsewhere. Results indicate that the exact analytical solution should be used for verification of numerical solutions and other solute-transport problems wherein a high level of accuracy is required. ?? ASCE.
An O(log sup 2 N) parallel algorithm for computing the eigenvalues of a symmetric tridiagonal matrix
NASA Technical Reports Server (NTRS)
Swarztrauber, Paul N.
1989-01-01
An O(log sup 2 N) parallel algorithm is presented for computing the eigenvalues of a symmetric tridiagonal matrix using a parallel algorithm for computing the zeros of the characteristic polynomial. The method is based on a quadratic recurrence in which the characteristic polynomial is constructed on a binary tree from polynomials whose degree doubles at each level. Intervals that contain exactly one zero are determined by the zeros of polynomials at the previous level which ensures that different processors compute different zeros. The exact behavior of the polynomials at the interval endpoints is used to eliminate the usual problems induced by finite precision arithmetic.