Florida Institute of Technology
Engineering Systems
In this study, we investigated the development of clinical disease and immune responses in the development of an experimental model of flea allergy dermatitis. Dogs were randomly divided into four treatment groups and were infested with... more
In this study, we investigated the development of clinical disease and immune responses in the development of an experimental model of flea allergy dermatitis. Dogs were randomly divided into four treatment groups and were infested with fleas on two different feeding schedules (continuous and episodic). Group 1 consisted of four non-exposed dogs (negative controls) and Group 2 consisted of six dogs exposed to fleas continually. Groups 3 and 4 consisted of 14 dogs each that were exposed to fleas on an episodic schedule (two consecutive days every other week for 12 weeks). Group 4 also received intraperitoneal injections of a low dose of lectin (ricin) with immunomodulatory properties. The purpose of Group 4 was to investigate the effects of ricin on enhancing the development of clinical signs, flea antigen-specific IgE levels and altering the number of CD4þ and CD8þ T cell subsets in peripheral blood. Clinical signs developed in all flea exposed dogs, however, the dermatology lesion scores were less and shorter in duration for continuously exposed dogs compared to episodic exposed dogs, independent of ricin treatment. Lesion development was concentrated in the flea triangle and consisted principally of erythema, followed by alopecia, excoriation, papules, and crusts. CD4þ and CD8þ lymphocyte subsets or IgE levels were not altered by ricin treatment. Flea antigen-specific IgE values were highest in dogs exposed to fleas on a continuous basis compared to those episodically exposed. A greater percentage of clinical responder dogs with negative flea-specific IgE titers or negative intradermal test (IDT) were present in the episodic exposure groups than in the continuous exposure group. IgE titers corresponded slightly better with clinical responders than the IDT. The agreement between the IgE titers and IDT was good (weighted k ¼ 0:67). Histopathology of skin samples were consistent with a Type I hypersensitivity. In conclusion, we were able to develop a model of flea allergy dermatitis by experimentally exposing dogs to fleas on an episodic and continuous feeding schedule. In this study, continuously exposed dogs did not develop immunotolerance, and ricin did not enhance the development of FAD. #
In this paper, a structured approach for collecting lessons learned information obtained from system development projects is discussed. To aid in the analysis of lessons learned, the collection framework incorporates techniques associated... more
In this paper, a structured approach for collecting lessons learned information obtained from system development projects is discussed. To aid in the analysis of lessons learned, the collection framework incorporates techniques associated with approximate reasoning. The primary goal of collecting lessons learned is to improve organizational and project performance. Therefore, this approach concentrates on focusing the collection of lessons learned on this goal. This approach ties the collection of lessons learned to the process model used by the organization. This model is typically based on capability models such as the Systems Engineering Capability Maturity Model (SE-CMM 1 ) and Software CMM (SW-CMM), as well as process standards such as ISO 9000 and the organizations standard engineering practices. This approach utilizes the organizations process framework to provide a structured, lessons learned program which can be used by projects during and at the completion of their execution.
In previous work we developed techniques for modeling software development processes quantitatively in terms of development cost, product quality, and project schedule using simulation. This work has predominately been applied to the... more
In previous work we developed techniques for modeling software development processes quantitatively in terms of development cost, product quality, and project schedule using simulation. This work has predominately been applied to the software project management planning function. The goal of our current work is to develop a "forward looking" approach that integrates metrics with simulation models of the software development process in order to support the software project management controlling function. This "forward-looking" approach provides predictions of project performance and the impact of various management decisions. It can be used to assess the project's conformance to planned schedule and resource consumption. This paper reports on work with a leading software development firm to create an approach, that includes a flexible metrics repository and a discrete event simulation model.
In this paper, we present a "forward-looking" decision support framework that integrates timely metrics data with simulation models of the software development process in order to support the software project management control function.... more
In this paper, we present a "forward-looking" decision support framework that integrates timely metrics data with simulation models of the software development process in order to support the software project management control function. This forward-looking approach provides predictions of project performance and the impact of various management decisions. Tradeoffs among performance measures are accomplished using Outcome Based Control Limits (OBCLs) and are augmented using multi-criteria utility functions and financial measures of performance to evaluate various process alternatives. The decision support framework enables the program manager to take corrective action as necessary on a project with the simulation model providing insight on potential performance impacts of the proposed corrective actions. A real world example is presented.
This paper presents a systems engineering entrepreneurship approach to developing projects at a university that are complex, multi-disciplinary in nature, integration oriented, and that may span departments, colleges, and have long... more
This paper presents a systems engineering entrepreneurship approach to developing projects at a university that are complex, multi-disciplinary in nature, integration oriented, and that may span departments, colleges, and have long completion schedules. Fundamental systems engineering principles are used to manage cost, schedule, and performance aspects of projects as well as to manage and control project risk. Entrepreneurial principles are used as part of the cost-benefit analysis in project evaluation. As an illustrative example, we present a project to develop an adaptive optics and atmospheric turbulence compensation system for a 0.8 meter optical telescope. A system engineering approach is used to identify and document stakeholder requirements, establish a project baseline, and use a requirements driven methodology to manage and control the project throughout its system development life-cycle. This approach is most suitable for technically complex projects that require collaboration and integration of diverse activities and resources as is often the case for multi-disciplinary projects or activities in centers of excellence or multiuniversity research initiatives.
By implementing student teams and incorporating a systems engineering approach, we have developed a unique video game-based product that combines the entertaining aspects of a popular video game set in a magical world, with dynamic,... more
By implementing student teams and incorporating a systems engineering approach, we have developed a unique video game-based product that combines the entertaining aspects of a popular video game set in a magical world, with dynamic, adaptable, multi-disciplinary instructional material. The video game knowledge module (VGKM) system integrates the fun NeverWinter Nights TM role-playing video game environment with educational knowledge modules, an entertaining story line, and out-of-game activities to build and demonstrate a compelling, interactive, collaborative, multi-disciplinary learning tool. Different knowledge modules can be built by interested faculty, educators, or entrepreneurial development teams, emphasizing different subject matter and integrated to produce a tailored course of study, correct academic deficiencies, or assist with training and certification, qualification, or assessment programs. Knowledge modules can span disciplines, departments, and even colleges and universities. A built-in assessment and rewards and punishment capability is included in the VGKM. The knowledge modules have a variety of dynamic features such as multiple or single user capable, directed in-game interaction by an educator, remote site multi-user interaction over the internet, localized WLAN/LAN networks, and asynchronous learning. A significant aspect of VGKM is character persistence. This allows the student to transfer a character from module to module, and game to game while maintaining the characters attributes, "possessions", experience, accumulated items, abilities, and ingame treasures.
In sheared coherent beam interferometric imaging, an estimate of the average reflectivity profile of the object can be computed from measurements of point to point phase differences in the far field interference pattern and a suitable... more
In sheared coherent beam interferometric imaging, an estimate of the average reflectivity profile of the object can be computed from measurements of point to point phase differences in the far field interference pattern and a suitable phase reconstruction technique. The phase difference information is encoded in the irradiance of three identical, shifted and superimposed speckled laser beam patterns. A minimum variance phase reconstruction technique is presented to estimate the phase of the field in the measurement plane from the phase differences and evaluate its performance. Prior knowledge of the phase covariance is used in the minimum variance reconstructor. Analytic calculations and computer simulations are used to evaluate phase reconstruction errors as a function of object coherence area and spatial sample spacing in the measurement plane. The performance of the minimum variance reconstructor is compared to two least squares reconstructor implementations. Theoretical performance comparisons are made between the minimum variance reconstructor and a new implementation of the least squares formalism. The new least squares reconstructor uses the same error metric as the minimum variance reconstructor but does not use any statistical information in estimating the measurement plane phase function. Comparisons of the minimum variance reconstructor with a conventional implementation of the least squares formalism are also made. The performance of the minimum variance reconstructor is demonstrated for objects which are optically smooth as well as optically rough. A small random double point source object is used to demonstrate the near diffraction limited resolution of the minimum variance wavefront reconstructor. Phase and image reconstructions are demonstrated for extended objects.
Phase differences in the far field of a coherently illuminated object are used to estimate the twodimensional phase in the measurement plane of an imaging system. A previously derived phasecorrelation function is used in a... more
Phase differences in the far field of a coherently illuminated object are used to estimate the twodimensional phase in the measurement plane of an imaging system. A previously derived phasecorrelation function is used in a minimum-variance phase-estimation algorithm to map phase-difference measurements optimally to estimates of the phase on a grid of points in the measurement plane. Theoretical and computer-simulation comparisons between the minimum-variance phase estimator and conventional least-squares estimators are made. The minimum-variance phase estimator produces a lower aperture-averaged mean-square phase error for all values of a sampling parameter .
We show that the Fisher-Rao Riemannian metric is a natural, intrinsic tool for computing shape geodesics. When a parameterized probability density function is used to represent a landmark-based shape, the modes of deformation are... more
We show that the Fisher-Rao Riemannian metric is a natural, intrinsic tool for computing shape geodesics. When a parameterized probability density function is used to represent a landmark-based shape, the modes of deformation are automatically established through the Fisher information of the density. Consequently, given two shapes parameterized by the same density model, the geodesic distance between them under the action of the Fisher-Rao metric is a convenient shape distance measure. It has the advantage of being an intrinsic distance measure and invariant to reparameterization. We first model shape landmarks using a Gaussian mixture model and then compute geodesic distances between two shapes using the Fisher-Rao metric corresponding to the mixture model. We illustrate our approach by computing Fisher geodesics between 2D corpus callosum shapes. Shape representation via the mixture model and shape deformation via the Fisher geodesic are hereby unified in this approach.
Accurate density estimation methodologies play an integral role in a variety of scientific disciplines, with applications including simulation models, decision support tools, and exploratory data analysis. In the past, histograms and... more
Accurate density estimation methodologies play an integral role in a variety of scientific disciplines, with applications including simulation models, decision support tools, and exploratory data analysis. In the past, histograms and kernel density estimators have been the predominant tools of choice, primarily due to their ease of use and mathematical simplicity. More recently, the use of wavelets for density estimation has gained in popularity due to their ability to approximate a large class of functions, including those with localized, abrupt variations. However, a well-known attribute of wavelet bases is that they can not be simultaneously symmetric, orthogonal, and compactly supported. Multiwavelets-a more general, vector-valued, construction of wavelets-overcome this disadvantage, making them natural choices for estimating density functions, many of which exhibit local symmetries around features such as a mode. We extend the methodology of wavelet density estimation to use multiwavelet bases and illustrate several empirical results where multiwavelet estimators outperform their wavelet counterparts at coarser resolution levels.
Density estimation for observational data plays an integral role in a broad spectrum of applications, e.g., statistical data analysis and information-theoretic image registration. Of late, wavelet-based density estimators have gained in... more
Density estimation for observational data plays an integral role in a broad spectrum of applications, e.g., statistical data analysis and information-theoretic image registration. Of late, wavelet-based density estimators have gained in popularity due to their ability to approximate a large class of functions, adapting well to difficult situations such as when densities exhibit abrupt changes. The decision to work with wavelet density estimators brings along with it theoretical considerations (e.g., non-negativity, integrability) and empirical issues (e.g., computation of basis coefficients) that must be addressed in order to obtain a bona fide density. In this paper, we present a new method to accurately estimate a non-negative density which directly addresses many of the problems in practical wavelet density estimation. We cast the estimation procedure in a maximum likelihood framework which estimates the square root of the density , allowing us to obtain the natural non-negative density representation . Analysis of this method will bring to light a remarkable theoretical connection with the Fisher information of the density and, consequently, lead to an efficient constrained optimization procedure to estimate the wavelet coefficients. We illustrate the effectiveness of the algorithm by evaluating its performance on mutual information-based image registration, shape point set alignment, and empirical comparisons to known densities. The present method is also compared to fixed and variable bandwidth kernel density estimators.
Shape matching plays a prominent role in the comparison of similar structures. We present a unifying framework for shape matching that uses mixture-models to couple both the shape representation and deformation. The theoretical foundation... more
Shape matching plays a prominent role in the comparison of similar structures. We present a unifying framework for shape matching that uses mixture-models to couple both the shape representation and deformation. The theoretical foundation is drawn from information geometry wherein information matrices are used to establish intrinsic distances between parametric densities. When a parameterized probability density function is used to represent a landmark-based shape, the modes of deformation are automatically established through the information matrix of the density. We first show that given two shapes parameterized by Gaussian mixture models, the well known Fisher information matrix of the mixture model is also a Riemannian metric (actually the Fisher-Rao Riemannian metric) and can therefore be used for computing shape geodesics. The Fisher-Rao metric has the advantage of being an intrinsic metric and invariant to reparameterization. The geodesiccomputed using this metric-establishes an intrinsic deformation between the shapes, thus unifying both shape representation and deformation. A fundamental drawback of the Fisher-Rao metric is that it is not available in closed-form for the Gaussian mixture model. Consequently, shape comparisons are computationally very expensive. To address this, we develop a new Riemannian metric based on generalized φ-entropy measures. In sharp contrast to the Fisher-Rao metric, the new metric is available in closedform. Geodesic computations using the new metric are considerably more efficient. We validate the performance and discriminative capabilities of these new information geometry based metrics by pairwise matching of corpus callosum shapes. We also study deformations of fish shapes that have various topological properties. A comprehensive comparative analysis is also provided using other landmark based distances, including the Hausdorff distance, the Procrustes metric, landmark based diffeomorphisms, and the bending energies of the thin-plate (TPS) and Wendland splines.
The accelerated evolution and explosion of the Internet and social media is generating voluminous quantities of data (on zettabyte scales). Paramount amongst the desires to manipulate and extract actionable intelligence from vast big data... more
The accelerated evolution and explosion of the Internet and social media is generating voluminous quantities of data (on zettabyte scales). Paramount amongst the desires to manipulate and extract actionable intelligence from vast big data volumes is the need for scalable, performance-conscious analytics algorithms. To directly address this need, we propose a novel MapReduce implementation of the exemplar-based clustering algorithm known as Affinity Propagation. Our parallelization strategy extends to the multilevel Hierarchical Affinity Propagation algorithm and enables tiered aggregation of unstructured data with minimal free parameters, in principle requiring only a similarity measure between data points. We detail the linear run-time complexity of our approach, overcoming the limiting quadratic complexity of the original algorithm. Experimental validation of our clustering methodology on a variety of synthetic and real data sets (e.g. images and point data) demonstrates our competitiveness against other state-of-the-art MapReduce clustering techniques.
- by Adrian Peter and +2
- •
- Parallel Algorithms
The presence of microorganisms on the International Space Station (ISS) poses a threat to the health and safety of the ISS crew. Currently the ISS utilizes culture-based methods to detect and identify microorganisms. These methods are out... more
The presence of microorganisms on the International Space Station (ISS) poses a threat to the health and safety of the ISS crew. Currently the ISS utilizes culture-based methods to detect and identify microorganisms. These methods are out dated and time-consuming. Molecular methods can deliver accurate results and require less processing time. This article details an approach to determine which molecular methods instrument most closely meets the Microbial Monitoring System (MMS) requirements for use on the ISS. We utilize the decision-theoretic Analytical Hierarchy Process and Quality Function Deployment while aligning the systems requirements vs. instrument capabilities in a Pugh Matrix to perform a quantitative assessment of six candidate systems, with the analysis yielding a single recommended instrument for use on the ISS. We demonstrate our techniques to be very effective for selection of the best instrument-the recommended system is currently under consideration for use on the ISS.
This paper proposes a new affine registration algorithm for matching two point sets in IR 2 or IR 3 . The input point sets are represented as probability density functions, using either Gaussian mixture models or discrete density models,... more
This paper proposes a new affine registration algorithm for matching two point sets in IR 2 or IR 3 . The input point sets are represented as probability density functions, using either Gaussian mixture models or discrete density models, and the problem of registering the point sets is treated as aligning the two distributions. Since polynomials transform as symmetric tensors under an affine transformation, the distributions' moments, which are the expected values of polynomials, also transform accordingly. Therefore, instead of solving the harder problem of aligning the two distributions directly, we solve the softer problem of matching the distributions' moments. By formulating a least-squares problem for matching moments of the two distributions up to degree three, the resulting cost function is a polynomial that can be efficiently optimized using techniques originated from algebraic geometry: the global minimum of this polynomial can be determined by solving a system of polynomial equations. The algorithm is robust in the presence of noises and outliers, and we validate the proposed algorithm on a variety of point sets with varying degrees of deformation and noise.
Shape matching plays a prominent role in the analysis of medical and biological structures. Recently, a unifying framework was introduced for shape matching that uses mixture-models to couple both the shape representation and deformation.... more
Shape matching plays a prominent role in the analysis of medical and biological structures. Recently, a unifying framework was introduced for shape matching that uses mixture-models to couple both the shape representation and deformation. Essentially, shape distances were defined as geodesics induced by the Fisher-Rao metric on the manifold of mixture-model represented shapes. A fundamental drawback of the Fisher-Rao metric is that it is NOT available in closed-form for the mixture model. Consequently, shape comparisons are computationally very expensive. Here, we propose a new Riemannian metric based on generalized phi-entropy measures. In sharp contrast to the Fisher-Rao metric, our new metric is available in closed-form. Geodesic computations using the new metric are considerably more efficient. Discriminative capabilities of this new metric are studied by pairwise matching of corpus callosum shapes. Comparisons are conducted with the Fisher-Rao metric and the thin-plate spline b...
Terrain characteristics can significantly alter the quality of the results provided by the deployment methodology of large-scale wireless sensor networks. For example, transmissions between nodes that are heavily obstructed will require... more
Terrain characteristics can significantly alter the quality of the results provided by the deployment methodology of large-scale wireless sensor networks. For example, transmissions between nodes that are heavily obstructed will require additional transmission power to establish connection between nodes. In some cases, heavily obstructed areas may prevent nodes from establishing a connection at all. Therefore, terrain analysis and classification of specific deployment areas should be incorporated in the methodology process for evaluation and optimization of the performance of wireless sensor networks upon deployment. Although there exists radio frequency (RF) models capable of modeling obstructions, such as vegetation, foliage, etc., automatic assignment of parameter values for these models may be troublesome, specifically in highly irregular deployments terrains, where proximity of poor and optimal conditions for signal propagation may be adjacent to each other. In these situations, parameter estimation for modeling terrain obstruction may result in overly optimistic or pessimistic results, causing characterizations or predictions that deviate from the true performance of the WSN once deployed. This paper presents the results of employing a support vector machine for automatic terrain classification. The approach can be used to automatically determine areas of high obstruction, which is essential to estimate obstruction parameters in simulations and enhancing the overall decision-making process during pre-deployment of large-scale and irregular deployment terrains.
- by Adrian Peter and +1
- •
For advantages such as a richer representation power and inherent robustness to noise, probability density functions are becoming a staple for complex problems in shape analysis. We consider a principled and geometric approach to... more
For advantages such as a richer representation power and inherent robustness to noise, probability density functions are becoming a staple for complex problems in shape analysis. We consider a principled and geometric approach to selecting the model order for a class of shape density models where the square-root of the distribution is expanded in an orthogonal series. The free parameters associated with these estimators can then be rigorously selected using the Minimum Description Length (MDL) criterion for model selection. Under these models, it is shown that the MDL has a closed-form representation, atypical for most applications of MDL in density estimation. We provide a straightforward application of our derivations by using this closed-from MDL criterion to select the optimal multiresolution level(s) for a class of square-root, wavelet density estimators. Experimental evaluation of our technique is conducted on one and two dimensional density estimation problems in shape analysis, with comparative analysis against other popular model selection criteria such as Bayesian and Akaike information criteria.
For over 30 years, the static Hamilton-Jacobi (HJ) equation, specifically its incarnation as the eikonal equation, has been a bedrock for a plethora of computer vision models, including popular applications such as shape-from-shading,... more
For over 30 years, the static Hamilton-Jacobi (HJ) equation, specifically its incarnation as the eikonal equation, has been a bedrock for a plethora of computer vision models, including popular applications such as shape-from-shading, medial axis representations, level-set segmentation, and geodesic processing (i.e. path planning). Numerical solutions to this nonlinear partial differential equation have long relied on staples like fast marching and fast sweeping algorithmsapproaches which rely on intricate convergence analysis, approximations, and specialized implementations. Here, we present a new variational functional on a scalar field comprising a spatially varying quadratic term and a standard regularization term. The Euler-Lagrange equation corresponding to the new functional is a linear differential equation which when discretized results in a linear system of equations. This approach leads to many algorithm choices since there are myriad efficient sparse linear solvers. The limiting behavior, for a particular case, of this linear differential equation can be shown to converge to the nonlinear eikonal. In addition, our approach eliminates the need to explicitly construct viscosity solutions as customary with direct solutions to the eikonal. Though our solution framework is applicable to the general class of eikonal problems, we detail specifics for the popular vision applications of shapefrom-shading, vessel segmentation, and path planning. We showcase experimental results on a variety of images and complex mazes, in which we hold our own against state-ofthe art fast marching and fast sweeping techniques, while retaining the considerable advantages of a linear systems approach.
- by Adrian Peter and +1
- •
The modus operandi for machine learning is to represent data as feature vectors and then proceed with training algorithms that seek to optimally partition the feature space S ⊂ R n into labeled regions. This holds true even when the... more
The modus operandi for machine learning is to represent data as feature vectors and then proceed with training algorithms that seek to optimally partition the feature space S ⊂ R n into labeled regions. This holds true even when the original data are functional in nature, i.e. curves or surfaces that are inherently varying over a continuum such as time or space. Functional data are often reduced to summary statistics, locally-sensitive characteristics, and global signatures with the objective of building comprehensive feature vectors that uniquely characterize each function. The present work directly addresses representational issues of functional data for supervised learning. We propose a novel classification by discriminative interpolation (CDI) framework wherein functional data in the same class are adaptively reconstructed to be more similar to each other, while simultaneously repelling nearest neighbor functional data in other classes. Akin to other recent nearest-neighbor metric learning paradigms like stochastic k -neighborhood selection and large margin nearest neighbors, our technique uses class-specific representations which gerrymander similar functional data in an appropriate parameter space. Experimental validation on several time series datasets establish the proposed discriminative interpolation framework as competitive or better in comparison to recent state-of-the-art techniques which continue to rely on the standard feature vector representation.
- by Adrian Peter
- •