Mathematics Commons^™

Policy-Preferred Paths In As-Level Internet Topology Graphs, Mehmet Engin Tozal

Theory and Applications of Graphs

Using Autonomous System (AS) level Internet topology maps to determine accurate AS-level paths is essential for network diagnostics, performance optimization, security enforcement, business policy management and topology-aware application development. One significant drawback that we have observed in many studies is simplifying the AS-level topology map of the Internet to an undirected graph, and then using the hop distance as a means to find the shortest paths between the ASes. A less significant drawback is restricting the shortest paths to only valley-free paths. Both approaches usually inflate the number of paths between ASes; introduce erroneous paths that do not conform to …

Generalized Differential Calculus And Applications To Optimization, R. Blake Rector

Dissertations and Theses

This thesis contains contributions in three areas: the theory of generalized calculus, numerical algorithms for operations research, and applications of optimization to problems in modern electric power systems. A geometric approach is used to advance the theory and tools used for studying generalized notions of derivatives for nonsmooth functions. These advances specifically pertain to methods for calculating subdifferentials and to expanding our understanding of a certain notion of derivative of set-valued maps, called the coderivative, in infinite dimensions. A strong understanding of the subdifferential is essential for numerical optimization algorithms, which are developed and applied to nonsmooth problems in operations …

Filters And Matrix Factorization, Myung-Sin Song, Palle E. T. Jorgensen

SIUE Faculty Research, Scholarship, and Creative Activity

We give a number of explicit matrix-algorithms for analysis/synthesis

in multi-phase filtering; i.e., the operation on discrete-time signals which

allow a separation into frequency-band components, one for each of the

ranges of bands, say N , starting with low-pass, and then corresponding

filtering in the other band-ranges. If there are N bands, the individual

filters will be combined into a single matrix action; so a representation of

the combined operation on all N bands by an N x N matrix, where the

corresponding matrix-entries are periodic functions; or their extensions to

functions of a complex variable. Hence our setting entails …

Scheduling And Resource Allocation In Wireless Sensor Networks, Yosef Alayev

Dissertations, Theses, and Capstone Projects

In computer science and telecommunications, wireless sensor networks are an active research area. Each sensor in a wireless sensor network has some pre-defined or on demand tasks such as collecting or disseminating data. Network resources, such as broadcast channels, number of sensors, power, battery life, etc., are limited. Hence, a schedule is required to optimally allocate network resources so as to maximize some profit or minimize some cost. This thesis focuses on scheduling problems in the wireless sensor networks environment. In particular, we study three scheduling problems in the wireless sensor networks: broadcast scheduling, sensor scheduling for area monitoring, and …

Validation Of Weak Form Thermal Analysis Algorithms Supporting Thermal Signature Generation, Elton Lewis Freeman

Masters Theses

Extremization of a weak form for the continuum energy conservation principle differential equation naturally implements fluid convection and radiation as flux Robin boundary conditions associated with unsteady heat transfer. Combining a spatial semi-discretization via finite element trial space basis functions with time-accurate integration generates a totally node-based algebraic statement for computing. Closure for gray body radiation is a newly derived node-based radiosity formulation generating piecewise discontinuous solutions, while that for natural-forced-mixed convection heat transfer is extracted from the literature. Algorithm performance, mathematically predicted by asymptotic convergence theory, is subsequently validated with data obtained in 24 hour diurnal field experiments for …

Lectures In Computational Fluid Dynamics Of Incompressible Flow: Mathematics, Algorithms And Implementations, James M. Mcdonough

Mechanical Engineering Textbook Gallery

From Prologue:

The present lecture notes are written to emphasize the mathematics of the Navier–Stokes (N.–S.) equations of incompressible flow and the algorithms that have been developed over the past 30 years for solving them.

Representations, Approximations, And Algorithms For Mathematical Speech Processing, Laura R. Suzuki

Theses and Dissertations

Representing speech signals such that specific characteristics of speech are included is essential in many Air Force and DoD signal processing applications. A mathematical construct called a frame is presented which captures the important time-varying characteristic of speech. Roughly speaking, frames generalize the idea of an orthogonal basis in a Hilbert space, Specific spaces applicable to speech are L₂(R) and the Hardy spaces H_p(D) for p> 1 where D is the unit disk in the complex plane. Results are given for representations in the Hardy spaces involving Carleson's inequalities (and its extensions), …

Algorithms For The Solution Of Systems Of Coupled Second-Order Ordinary Differential Equations, Brendan O'Shea

Articles

Several step-by-step methods for the computer solution systems of coupled second-order ordinary differential equations, are examined from the point of view of efficiency “time-wise” and “storage-wise”. Particular reference is made to a system arising in the close-coupling approximation of the Schroedinger equation. The stability of the solution is also considered.