Screening And Sufficiency In Multiobjective Decision Problems With Large Alternative Sets, 2010 Air Force Institute of Technology

#### Screening And Sufficiency In Multiobjective Decision Problems With Large Alternative Sets, Michael D. Cote

*Theses and Dissertations*

Portfolio selection problems with combinatorially-large alternative sets can be impossible to evaluate precisely on a reasonable timescale. When portfolios require complex modeling for performance assessment, prohibitive computational processing times can result. Eliminating a small number of alternatives through an intelligent screening process can greatly reduce the number of alternative combinations, thereby decreasing a problem's evaluation time and cost. A methodology was developed for the class of hierarchical portfolio selection problems in which multiple objectives are all judged on the same sub-objectives. First, a novel capability-based alternative screening process was devised to identify and remove poor alternatives, thereby reducing the ...

Comments Submitted To The Us Patent Office On Enhancing The Quality Of Examination, 2010 Bi-Level Technologies

#### Comments Submitted To The Us Patent Office On Enhancing The Quality Of Examination, Ron D. Katznelson

*Ron D. Katznelson*

No abstract provided.

On Simulating Univariate And Multivariate Burr Type Iii And Type Xii Distributions, 2010 Southern Illinois University Carbondale

#### On Simulating Univariate And Multivariate Burr Type Iii And Type Xii Distributions, Todd C. Headrick, Mohan D. Pant, Yanyan Sheng

*Mohan Dev Pant*

This paper describes a method for simulating univariate and multivariate Burr Type III and Type XII distributions with specified correlation matrices. The methodology is based on the derivation of the parametric forms of a pdf and cdf for this family of distributions. The paper shows how shape parameters can be computed for specified values of skew and kurtosis. It is also demonstrated how to compute percentage points and other measures of central tendency such as the mode, median, and trimmed mean. Examples are provided to demonstrate how this Burr family can be used in the context of distribution fitting using ...

Computing Prime Harmonic Sums, 2010 Butler University

#### Computing Prime Harmonic Sums, Eric Bach, Dominic Klyve, Jonathan P. Sorenson

*Jonathan P. Sorenson*

We discuss a method for computing Σ �≤� 1/�, using time about �2/3 and space about �1/3. It is based on the Meissel-Lehmer algorithm for computing the prime-counting function �(�), which was adapted and improved by Lagarias, Miller, and Odlyzko. We used this algorithm to determine the first point at which the prime harmonic sum first crosses.

Computing Prime Harmonic Sums, 2010 Butler University

#### Computing Prime Harmonic Sums, Eric Bach, Dominic Klyve, Jonathan P. Sorenson

*Jonathan P. Sorenson*

We discuss a method for computing Σ �≤� 1/�, using time about �2/3 and space about �1/3. It is based on the Meissel-Lehmer algorithm for computing the prime-counting function �(�), which was adapted and improved by Lagarias, Miller, and Odlyzko. We used this algorithm to determine the first point at which the prime harmonic sum first crosses.

First-Order And Second-Order Optimality Conditions For Nonsmooth Constrained Problems Via Convolution Smoothing, 2010 Royal Melbourne Institute of Technology, Australia

#### First-Order And Second-Order Optimality Conditions For Nonsmooth Constrained Problems Via Convolution Smoothing, Andrew C. Eberhard, Boris S. Mordukhovich

*Mathematics Research Reports*

This paper mainly concerns deriving first-order and second-order necessary (and partly sufficient) optimality conditions for a general class of constrained optimization problems via smoothing regularization procedures based on infimal-like convolutions/envelopes. In this way we obtain first-order optimality conditions of both lower subdifferential and upper subdifferential types and then second-order conditions of three kinds involving, respectively, generalized second-order directional derivatives, graphical derivatives of first-order subdifferentials, and secondorder subdifferentials defined via coderivatives of first-order constructions.

Time Is Not A Vector: Corrections To The Article “Vectorial Relativity Versus Special Or General Relativity?”, 2010 Universidad Central de Venezuela

#### Time Is Not A Vector: Corrections To The Article “Vectorial Relativity Versus Special Or General Relativity?”, Jorge A. Franco

*Jorge A Franco*

In this work the main conceptual errors that sequentially were introduced in the development of the Special Theory of Relativity (SR) are explained. A simple presentation of the Lorentz Transformations (LT) is given, within where it is emphasized that, by using an incomplete configuration, repeated by more than one hundred years, it leads to a first error of a chain of them, when it is assumed that the cross sectional components, in the movable inertial reference system, are invariant or not affected by its relative movement respect a fixed inertial system, on the basis of a presumed “postulate of isotropy ...

Software Internationalization: A Framework Validated Against Industry Requirements For Computer Science And Software Engineering Programs, 2010 California Polytechnic State University, San Luis Obispo

#### Software Internationalization: A Framework Validated Against Industry Requirements For Computer Science And Software Engineering Programs, John Huân Vũ

*Master's Theses*

View John Huân Vũ's thesis presentation at http://youtu.be/y3bzNmkTr-c.

In 2001, the ACM and IEEE Computing Curriculum stated that it was necessary to address "the need to develop implementation models that are international in scope and could be practiced in universities around the world." With increasing connectivity through the internet, the move towards a global economy and growing use of technology places software internationalization as a more important concern for developers. However, there has been a "clear shortage in terms of numbers of trained persons applying for entry-level positions" in this area. Eric Brechner, Director of Microsoft ...

Patent Examination Policy And The Social Costs Of Examiner Allowance And Rejection Errors, 2010 Bi-Level Technologies

#### Patent Examination Policy And The Social Costs Of Examiner Allowance And Rejection Errors, Ron D. Katznelson

*Ron D. Katznelson*

No abstract provided.

Modular Exponentiation Via The Explicit Chinese Remainder Theorem, 2010 Butler University

#### Modular Exponentiation Via The Explicit Chinese Remainder Theorem, Daniel J. Bernstein, Jonathan P. Sorenson

*Jonathan P. Sorenson*

In this paper we consider the problem of computing xe mod m for large integers x, e, and m. This is the bottleneck in Rabin’s algorithm for testing primality, the Diffie-Hellman algorithm for exchanging cryptographic keys, and many other common algorithms.

Modular Exponentiation Via The Explicit Chinese Remainder Theorem, 2010 Butler University

#### Modular Exponentiation Via The Explicit Chinese Remainder Theorem, Daniel J. Bernstein, Jonathan P. Sorenson

*Jonathan P. Sorenson*

In this paper we consider the problem of computing xe mod m for large integers x, e, and m. This is the bottleneck in Rabin’s algorithm for testing primality, the Diffie-Hellman algorithm for exchanging cryptographic keys, and many other common algorithms.

Selective Recursive Kernel Learning For Online Identification Of Nonlinear Systems With Narx Form, 2010 Zhejiang University

#### Selective Recursive Kernel Learning For Online Identification Of Nonlinear Systems With Narx Form, Yi Liu, Haiqing Wang, Jiang Yu, Ping Li

*Dr. Yi Liu*

Online identification of nonlinear systems is still an important while difficult task in practice. A general and simple online identification method, namely Selective Recursive Kernel Learning (SRKL), is proposed for multi-input–multi-output (MIMO) systems with the nonlinear autoregressive with exogenous input form. A two-stage RKL online identification framework is first formulated, where the information contained by a sample (i.e., the new arriving or old useless one) can be introduced into and/or deleted from the model, recursively. Then, a sparsification strategy to restrict the model complexity is developed to guarantee all the output channels of the MIMO model accurate ...

An Analytical And Numerical Treatment Of The Carter Constant For Inclined Elliptical Orbits About A Massive Kerr Black Hole, 2010 The University of Western Ontario

#### An Analytical And Numerical Treatment Of The Carter Constant For Inclined Elliptical Orbits About A Massive Kerr Black Hole, Peter Komorowski, Sree Ram Valluri, Martin Houde

*WORLDiscoveries Research Showcase*

In an extreme binary black hole system, an orbit will increase its angle of inclination (i) as it evolves in Kerr spacetime. We focus our attention on the behaviour of the Carter constant (Q) for near-polar orbits. The value of Q for bound orbits is non-negative; and an increase in Q corresponds to an increase in i. For a Schwarzschild black hole, the polar orbit represents the boundary between the prograde and retrograde orbits at which Q is at its maximum value. The introduction of spin (S = |J|/M2) to the massive black hole causes this boundary, or Abutment, to ...

Fast Protein Structure Alignment, 2010 Rose-Hulman Institute of Technology

#### Fast Protein Structure Alignment, Yosi Shibberu, Allen Holder, Kyla Lutz

*Mathematical Sciences Technical Reports (MSTR)*

We address the problem of aligning the 3D structures of two proteins. Our pairwise comparisons are based on a new optimization model that is succinctly expressed in terms of linear transformations and highlights the problem’s intrinsic geometry. The optimization problem is approximately solved with a new polynomial time algorithm. The worst case analysis of the algorithm shows that the solution is bounded by a constant depending only on the data of the problem.

Enhanced Metric Regularity And Lipschitzian Properties Of Variational Systems, 2010 University of Alicante, Spain

#### Enhanced Metric Regularity And Lipschitzian Properties Of Variational Systems, Francisco J. Aragón Artacho, Boris S. Mordukhovich

*Mathematics Research Reports*

This paper mainly concerns the study of a large class of variational systems governed by parametric generalized equations, which encompass variational and hemivariational inequalities, complementarity problems, first-order necessary optimality conditions, and other optimization-related models important for optimization theory and applications. An efficient approach to these issues has been developed in our preceding work [1] establishing qualitative and quantitative relationships between conventional metric regularity jsubregularity and Lipschitzian/calmness properties in the framework of parametric generalized equations in arbitrary Banach spaces. This paper provides, on one hand, significant extensions of the major results in [1] to new partial metric regularity and hemiregularity ...

A Majorization Algorithm For Constrained Correlation Matrix Approximation, 2010 General Motors Company

#### A Majorization Algorithm For Constrained Correlation Matrix Approximation, Daniel J. Simon, Jeff Abell

*Electrical Engineering & Computer Science Faculty Publications*

We desire to find a correlation matrix of a given rank that is as close as possible to an input matrix *R*, subject to the constraint that specified elements in must be zero. Our optimality criterion is the weighted Frobenius norm of the approximation error, and we use a constrained majorization algorithm to solve the problem. Although many correlation matrix approximation approaches have been proposed, this specific problem, with the rank specification and the constraints, has not been studied until now. We discuss solution feasibility, convergence, and computational effort. We also present several examples.

Improved Automated Monitoring And New Analysis Algorithm For Circadean Phototaxis Rhythms In Chlamydomonas, 2010 Western Kentucky University

#### Improved Automated Monitoring And New Analysis Algorithm For Circadean Phototaxis Rhythms In Chlamydomonas, Christa Gaskill, Jennifer Forbes-Stovall, Bruce Kessler, Mike Young, Claire A. Rinehart, Sigrid Jacobshagen

*Mathematics Faculty Publications*

Automated monitoring of circadian rhythms is an efficient way of gaining insight into oscillation parameters like period and phase for the underlying pacemaker of the circadian clock. Measurement of the circadian rhythm of phototaxis (swimming towards light) exhibited by the green alga Chlamydomonas reinhardtii has been automated by directing a narrow and dim light beam through a culture at regular intervals and determining the decrease in light transmittance due to the accumulation of cells in the beam. In this study, the monitoring process was optimized by constructing a new computercontrolled measuring machine that limits the test beam to wavelengths reported ...

Improved Automated Monitoring And New Analysis Algorithm For Circadean Phototaxis Rhythms In Chlamydomonas, 2010 Western Kentucky University

#### Improved Automated Monitoring And New Analysis Algorithm For Circadean Phototaxis Rhythms In Chlamydomonas, Christa Gaskill, Jennifer Forbes-Stovall, Bruce Kessler, Mike Young, Claire A. Rinehart, Sigrid Jacobshagen

*Bruce Kessler*

Automated monitoring of circadian rhythms is an efficient way of gaining insight into oscillation parameters like period and phase for the underlying pacemaker of the circadian clock. Measurement of the circadian rhythm of phototaxis (swimming towards light) exhibited by the green alga Chlamydomonas reinhardtii has been automated by directing a narrow and dim light beam through a culture at regular intervals and determining the decrease in light transmittance due to the accumulation of cells in the beam. In this study, the monitoring process was optimized by constructing a new computercontrolled measuring machine that limits the test beam to wavelengths reported ...

Integer Functions On The Cycle Space And Edges Of A Graph, 2010 Wright State University - Main Campus

#### Integer Functions On The Cycle Space And Edges Of A Graph, Dan Slilaty

*Mathematics and Statistics Faculty Publications*

A directed graph has a natural Z-module homomorphism from the underlying graph’s cycle space to Z where the image of an oriented cycle is the number of forward edges minus the number of backward edges. Such a homomorphism preserves the parity of the length of a cycle and the image of a cycle is bounded by the length of that cycle. Pretzel and Youngs (SIAM J. Discrete Math. 3(4):544–553, 1990) showed that any Z-module homomorphism of a graph’s cycle space to Z that satisfies these two properties for all cycles must be such a map ...

The Camassa-Holm Hierarchy And Soliton Perturbations, 2010 Technological University Dublin

#### The Camassa-Holm Hierarchy And Soliton Perturbations, Georgi Grahovski, Rossen Ivanov

*Conference papers*

The theory of soliton perturbations is considered. The focus is on the usefulness of the so-called Generalised Fourier Transform (GFT). This is a method that involves expansions over the complete basis of “squared solutions” of the spectral problem, associated to the soliton equation. The Inverse Scattering Transform for the corresponding hierarchy of soliton equations can be viewed as a GFT where the expansions of the solutions have generalised Fourier coefficients given by the scattering data. The GFT provides a natural setting for the analysis of small perturbations to an integrable equation: starting from a purely soliton solution one can ’modify ...