35 Matching Results

Search Results

Advanced search parameters have been applied.

Visualization of Surfaces and 3D Vector Fields

Description: Visualization of trivariate functions and vector fields with three components in scientific computation is still a hard problem in compute graphic area. People build their own visualization packages for their special purposes. And there exist some general-purpose packages (MatLab, Vis5D), but they all require extensive user experience on setting all the parameters in order to generate images. We present a simple package to produce simplified but productive images of 3-D vector fields. We used this method to render the magnetic field and current as solutions of the Ginzburg-Landau equations on a 3-D domain.
Date: August 2002
Creator: Li, Wentong
Partner: UNT Libraries

A Constructive Method for Finding Critical Point of the Ginzburg-Landau Energy Functional

Description: In this work I present a constructive method for finding critical points of the Ginzburg-Landau energy functional using the method of Sobolev gradients. I give a description of the construction of the Sobolev gradient and obtain convergence results for continuous steepest descent with this gradient. I study the Ginzburg-Landau functional with magnetic field and the Ginzburg-Landau functional without magnetic field. I then present the numerical results I obtained by using steepest descent with the discretized Sobolev gradient.
Date: August 2008
Creator: Kazemi, Parimah
Partner: UNT Libraries

General Purpose Programming on Modern Graphics Hardware

Description: I start with a brief introduction to the graphics processing unit (GPU) as well as general-purpose computation on modern graphics hardware (GPGPU). Next, I explore the motivations for GPGPU programming, and the capabilities of modern GPUs (including advantages and disadvantages). Also, I give the background required for further exploring GPU programming, including the terminology used and the resources available. Finally, I include a comprehensive survey of previous and current GPGPU work, and end with a look at the future of GPU programming.
Date: May 2008
Creator: Fleming, Robert
Partner: UNT Libraries

Accurate Joint Detection from Depth Videos towards Pose Analysis

Description: Joint detection is vital for characterizing human pose and serves as a foundation for a wide range of computer vision applications such as physical training, health care, entertainment. This dissertation proposed two methods to detect joints in the human body for pose analysis. The first method detects joints by combining body model and automatic feature points detection together. The human body model maps the detected extreme points to the corresponding body parts of the model and detects the position of implicit joints. The dominant joints are detected after implicit joints and extreme points are located by a shortest path based methods. The main contribution of this work is a hybrid framework to detect joints on the human body to achieve robustness to different body shapes or proportions, pose variations and occlusions. Another contribution of this work is the idea of using geodesic features of the human body to build a model for guiding the human pose detection and estimation. The second proposed method detects joints by segmenting human body into parts first and then detect joints by making the detection algorithm focusing on each limb. The advantage of applying body part segmentation first is that the body segmentation method narrows down the searching area for each joint so that the joint detection method can provide more stable and accurate results.
Date: May 2018
Creator: Kong, Longbo
Partner: UNT Libraries

Real Time Assessment of a Video Game Player's State of Mind Using Off-the-Shelf Electroencephalography

Description: The focus of this research is on the development of a real time application that uses a low cost EEG headset to measure a player's state of mind while they play a video game. Using data collected using the Emotiv EPOC headset, various EEG processing techniques are tested to find ways of measuring a person's engagement and arousal levels. The ability to measure a person's engagement and arousal levels provide an opportunity to develop a model that monitor a person's flow while playing video games. Identifying when certain events occur, like when the player dies, will make it easier to identify when a player has left a state of flow. The real time application Brainwave captures data from the wireless Emotiv EPOC headset. Brainwave converts the raw EEG data into more meaningful brainwave band frequencies. Utilizing the brainwave frequencies the program trains multiple machine learning algorithms with data designed to identify when the player dies. Brainwave runs while the player plays through a video gaming monitoring their engagement and arousal levels for changes that cause the player to leave a state of flow. Brainwave reports to researchers and developers when the player dies along with the identification of the players exit of the state of flow.
Date: December 2016
Creator: McMahan, Timothy
Partner: UNT Libraries

Modeling and Simulation of the Vector-Borne Dengue Disease and the Effects of Regional Variation of Temperature in the Disease Prevalence in Homogenous and Heterogeneous Human Populations

Description: The history of mitigation programs to contain vector-borne diseases is a story of successes and failures. Due to the complex interplay among multiple factors that determine disease dynamics, the general principles for timely and specific intervention for incidence reduction or eradication of life-threatening diseases has yet to be determined. This research discusses computational methods developed to assist in the understanding of complex relationships affecting vector-borne disease dynamics. A computational framework to assist public health practitioners with exploring the dynamics of vector-borne diseases, such as malaria and dengue in homogenous and heterogeneous populations, has been conceived, designed, and implemented. The framework integrates a stochastic computational model of interactions to simulate horizontal disease transmission. The intent of the computational modeling has been the integration of stochasticity during simulation of the disease progression while reducing the number of necessary interactions to simulate a disease outbreak. While there are improvements in the computational time reducing the number of interactions needed for simulating disease dynamics, the realization of interactions can remain computationally expensive. Using multi-threading technology to improve performance upon the original computational model, multi-threading experimental results have been tested and reported. In addition, to the contact model, the modeling of biological processes specific to the corresponding pathogen-carrier vector to increase the specificity of the vector-borne disease has been integrated. Last, automation for requesting, retrieving, parsing, and storing specific weather data and geospatial information from federal agencies to study the differences between homogenous and heterogeneous populations has been implemented.
Date: August 2016
Creator: Bravo-Salgado, Angel D
Partner: UNT Libraries

RADIX 95n: Binary-to-Text Data Conversion

Description: This paper presents Radix 95n, a binary to text data conversion algorithm. Radix 95n (base 95) is a variable length encoding scheme that offers slightly better efficiency than is available with conventional fixed length encoding procedures. Radix 95n advances previous techniques by allowing a greater pool of 7-bit combinations to be made available for 8-bit data translation. Since 8-bit data (i.e. binary files) can prove to be difficult to transfer over 7-bit networks, the Radix 95n conversion technique provides a way to convert data such as compiled programs or graphic images to printable ASCII characters and allows for their transfer over 7-bit networks.
Date: August 1991
Creator: Jones, Greg, 1963-2017.
Partner: UNT Libraries

Real-time Rendering of Burning Objects in Video Games

Description: In recent years there has been growing interest in limitless realism in computer graphics applications. Among those, my foremost concentration falls into the complex physical simulations and modeling with diverse applications for the gaming industry. Different simulations have been virtually successful by replicating the details of physical process. As a result, some were strong enough to lure the user into believable virtual worlds that could destroy any sense of attendance. In this research, I focus on fire simulations and its deformation process towards various virtual objects. In most game engines model loading takes place at the beginning of the game or when the game is transitioning between levels. Game models are stored in large data structures. Since changing or adjusting a large data structure while the game is proceeding may adversely affect the performance of the game. Therefore, developers may choose to avoid procedural simulations to save resources and avoid interruptions on performance. I introduce a process to implement a real-time model deformation while maintaining performance. It is a challenging task to achieve high quality simulation while utilizing minimum resources to represent multiple events in timely manner. Especially in video games, this overwhelming criterion would be robust enough to sustain the engaging player's willing suspension of disbelief. I have implemented and tested my method on a relatively modest GPU using CUDA. My experiments conclude this method gives a believable visual effect while using small fraction of CPU and GPU resources.
Date: August 2013
Creator: Amarasinghe, Dhanyu Eshaka
Partner: UNT Libraries

Geostatistical Inspired Metamodeling and Optimization of Nanoscale Analog Circuits

Description: The current trend towards miniaturization of modern consumer electronic devices significantly affects their design. The demand for efficient all-in-one appliances leads to smaller, yet more complex and powerful nanoelectronic devices. The increasing complexity in the design of such nanoscale Analog/Mixed-Signal Systems-on-Chip (AMS-SoCs) presents difficult challenges to designers. One promising design method used to mitigate the burden of this design effort is the use of metamodeling (surrogate) modeling techniques. Their use significantly reduces the time for computer simulation and design space exploration and optimization. This dissertation addresses several issues of metamodeling based nanoelectronic based AMS design exploration. A surrogate modeling technique which uses geostatistical based Kriging prediction methods in creating metamodels is proposed. Kriging prediction techniques take into account the correlation effects between input parameters for performance point prediction. We propose the use of Kriging to utilize this property for the accurate modeling of process variation effects of designs in the deep nanometer region. Different Kriging methods have been explored for this work such as simple and ordinary Kriging. We also propose another metamodeling technique Kriging-Bootstrapped Neural Network that combines the accuracy and process variation awareness of Kriging with artificial neural network models for ultra-fast and accurate process aware metamodeling design. The proposed methodologies combine Kriging metamodels with selected algorithms for ultra-fast layout optimization. The selected algorithms explored are: Gravitational Search Algorithm (GSA), Simulated Annealing Optimization (SAO), and Ant Colony Optimization (ACO). Experimental results demonstrate that the proposed Kriging metamodel based methodologies can perform the optimizations with minimal computational burden compared to traditional (SPICE-based) design flows.
Date: May 2014
Creator: Okobiah, Oghenekarho
Partner: UNT Libraries

Procedural Generation of Content for Online Role Playing Games

Description: Video game players demand a volume of content far in excess of the ability of game designers to create it. For example, a single quest might take a week to develop and test, which means that companies such as Blizzard are spending millions of dollars each month on new content for their games. As a result, both players and developers are frustrated with the inability to meet the demand for new content. By generating content on-demand, it is possible to create custom content for each player based on player preferences. It is also possible to make use of the current world state during generation, something which cannot be done with current techniques. Using developers to create rules and assets for a content generator instead of creating content directly will lower development costs as well as reduce the development time for new game content to seconds rather than days. This work is part of the field of computational creativity, and involves the use of computers to create aesthetically pleasing game content, such as terrain, characters, and quests. I demonstrate agent-based terrain generation, and economic modeling of game spaces. I also demonstrate the autonomous generation of quests for online role playing games, and the ability to play these quests using an emulated Everquest server.
Date: August 2014
Creator: Doran, Jonathon
Partner: UNT Libraries

Optimizing Non-pharmaceutical Interventions Using Multi-coaffiliation Networks

Description: Computational modeling is of fundamental significance in mapping possible disease spread, and designing strategies for its mitigation. Conventional contact networks implement the simulation of interactions as random occurrences, presenting public health bodies with a difficult trade off between a realistic model granularity and robust design of intervention strategies. Recently, researchers have been investigating the use of agent-based models (ABMs) to embrace the complexity of real world interactions. At the same time, theoretical approaches provide epidemiologists with general optimization models in which demographics are intrinsically simplified. The emerging study of affiliation networks and co-affiliation networks provide an alternative to such trade off. Co-affiliation networks maintain the realism innate to ABMs while reducing the complexity of contact networks into distinctively smaller k-partite graphs, were each partition represent a dimension of the social model. This dissertation studies the optimization of intervention strategies for infectious diseases, mainly distributed in school systems. First, concepts of synthetic populations and affiliation networks are extended to propose a modified algorithm for the synthetic reconstruction of populations. Second, the definition of multi-coaffiliation networks is presented as the main social model in which risk is quantified and evaluated, thereby obtaining vulnerability indications for each school in the system. Finally, maximization of the mitigation coverage and minimization of the overall cost of intervention strategies are proposed and compared, based on centrality measures.
Date: May 2013
Creator: Loza, Olivia G.
Partner: UNT Libraries

Synchronous Chaos, Chaotic Walks, and Characterization of Chaotic States by Lyapunov Spectra

Description: Four aspects of the dynamics of continuous-time dynamical systems are studied in this work. The relationship between the Lyapunov exponents of the original system and the Lyapunov exponents of induced Poincare maps is examined. The behavior of these Poincare maps as discriminators of chaos from noise is explored, and the possible Poissonian statistics generated at rarely visited surfaces are studied.
Date: August 1993
Creator: Albert, Gerald (Gerald Lachian)
Partner: UNT Libraries

Convexity-Preserving Scattered Data Interpolation

Description: Surface fitting methods play an important role in many scientific fields as well as in computer aided geometric design. The problem treated here is that of constructing a smooth surface that interpolates data values associated with scattered nodes in the plane. The data is said to be convex if there exists a convex interpolant. The problem of convexity-preserving interpolation is to determine if the data is convex, and construct a convex interpolant if it exists.
Date: December 1995
Creator: Leung, Nim Keung
Partner: UNT Libraries

Multiresolutional/Fractal Compression of Still and Moving Pictures

Description: The scope of the present dissertation is a deep lossy compression of still and moving grayscale pictures while maintaining their fidelity, with a specific goal of creating a working prototype of a software system for use in low bandwidth transmission of still satellite imagery and weather briefings with the best preservation of features considered important by the end user.
Date: December 1993
Creator: Kiselyov, Oleg E.
Partner: UNT Libraries

The Role of Intelligent Mobile Agents in Network Management and Routing

Description: In this research, the application of intelligent mobile agents to the management of distributed network environments is investigated. Intelligent mobile agents are programs which can move about network systems in a deterministic manner in carrying their execution state. These agents can be considered an application of distributed artificial intelligence where the (usually small) agent code is moved to the data and executed locally. The mobile agent paradigm offers potential advantages over many conventional mechanisms which move (often large) data to the code, thereby wasting available network bandwidth. The performance of agents in network routing and knowledge acquisition has been investigated and simulated. A working mobile agent system has also been designed and implemented in JDK 1.2.
Date: December 2000
Creator: Balamuru, Vinay Gopal
Partner: UNT Libraries

Uniqueness of Positive Solutions for Elliptic Dirichlet Problems

Description: In this paper we consider the question of uniqueness of positive solutions for Dirichlet problems of the form - Δ u(x)= g(λ,u(x)) in B, u(x) = 0 on ϑB, where A is the Laplace operator, B is the unit ball in RˆN, and A>0. We show that if g(λ,u)=uˆ(N+2)/(N-2) + λ, that is g has "critical growth", then large positive solutions are unique. We also prove uniqueness of large solutions when g(λ,u)=A f(u) with f(0) < 0, f "superlinear" and monotone. We use a number of methods from nonlinear functional analysis such as variational identities, Sturm comparison theorems and methods of order. We also present a regularity result on linear elliptic equation where a coefficient has critical growth.
Date: December 1990
Creator: Ali, Ismail, 1961-
Partner: UNT Libraries

A Framework for Analyzing and Optimizing Regional Bio-Emergency Response Plans

Description: The presence of naturally occurring and man-made public health threats necessitate the design and implementation of mitigation strategies, such that adequate response is provided in a timely manner. Since multiple variables, such as geographic properties, resource constraints, and government mandated time-frames must be accounted for, computational methods provide the necessary tools to develop contingency response plans while respecting underlying data and assumptions. A typical response scenario involves the placement of points of dispensing (PODs) in the affected geographic region to supply vaccines or medications to the general public. Computational tools aid in the analysis of such response plans, as well as in the strategic placement of PODs, such that feasible response scenarios can be developed. Due to the sensitivity of bio-emergency response plans, geographic information, such as POD locations, must be kept confidential. The generation of synthetic geographic regions allows for the development of emergency response plans on non-sensitive data, as well as for the study of the effects of single geographic parameters. Further, synthetic representations of geographic regions allow for results to be published and evaluated by the scientific community. This dissertation presents methodology for the analysis of bio-emergency response plans, methods for plan optimization, as well as methodology for the generation of synthetic geographic regions.
Date: December 2010
Creator: Schneider, Tamara
Partner: UNT Libraries

DirectShow Approach to Low-Cost Multimedia Security Surveillance System

Description: In response to the recent intensive needs for civilian security surveillance, both full and compact versions of a Multimedia Security Surveillance (MSS) system have been built up. The new Microsoft DirectShow technology was applied in implementing the multimedia stream-processing module. Through Microsoft Windows Driver Model interface, the chosen IEEE1394 enabled Fire-i cameras as external sensors are integrated with PC based continuous storage unit. The MSS application also allows multimedia broadcasting and remote controls. Cost analysis is included.
Date: December 2002
Creator: Xiao, Wu
Partner: UNT Libraries

Higher Compression from the Burrows-Wheeler Transform with New Algorithms for the List Update Problem

Description: Burrows-Wheeler compression is a three stage process in which the data is transformed with the Burrows-Wheeler Transform, then transformed with Move-To-Front, and finally encoded with an entropy coder. Move-To-Front, Transpose, and Frequency Count are some of the many algorithms used on the List Update problem. In 1985, Competitive Analysis first showed the superiority of Move-To-Front over Transpose and Frequency Count for the List Update problem with arbitrary data. Earlier studies due to Bitner assumed independent identically distributed data, and showed that while Move-To-Front adapts to a distribution faster, incurring less overwork, the asymptotic costs of Frequency Count and Transpose are less. The improvements to Burrows-Wheeler compression this work covers are increases in the amount, not speed, of compression. Best x of 2x-1 is a new family of algorithms created to improve on Move-To-Front's processing of the output of the Burrows-Wheeler Transform which is like piecewise independent identically distributed data. Other algorithms for both the middle stage of Burrows-Wheeler compression and the List Update problem for which overwork, asymptotic cost, and competitive ratios are also analyzed are several variations of Move One From Front and part of the randomized algorithm Timestamp. The Best x of 2x - 1 family includes Move-To-Front, the part of Timestamp of interest, and Frequency Count. Lastly, a greedy choosing scheme, Snake, switches back and forth as the amount of compression that two List Update algorithms achieves fluctuates, to increase overall compression. The Burrows-Wheeler Transform is based on sorting of contexts. The other improvements are better sorting orders, such as “aeioubcdf...” instead of standard alphabetical “abcdefghi...” on English text data, and an algorithm for computing orders for any data, and Gray code sorting instead of standard sorting. Both techniques lessen the overwork incurred by whatever List Update algorithms are used by reducing the difference between adjacent sorted ...
Date: August 2001
Creator: Chapin, Brenton
Partner: UNT Libraries

Hyperbolic Monge-Ampère Equation

Description: In this paper we use the Sobolev steepest descent method introduced by John W. Neuberger to solve the hyperbolic Monge-Ampère equation. First, we use the discrete Sobolev steepest descent method to find numerical solutions; we use several initial guesses, and explore the effect of some imposed boundary conditions on the solutions. Next, we prove convergence of the continuous Sobolev steepest descent to show local existence of solutions to the hyperbolic Monge-Ampère equation. Finally, we prove some results on the Sobolev gradients that mainly arise from general nonlinear differential equations.
Access: This item is restricted to UNT Community Members. Login required if off-campus.
Date: August 2006
Creator: Howard, Tamani M.
Partner: UNT Libraries

The Procedural Generation of Interesting Sokoban Levels

Description: As video games continue to become larger, more complex, and more costly to produce, research into methods to make game creation easier and faster becomes more valuable. One such research topic is procedural generation, which allows the computer to assist in the creation of content. This dissertation presents a new algorithm for the generation of Sokoban levels. Sokoban is a grid-based transport puzzle which is computational interesting due to being PSPACE-complete. Beyond just generating levels, the question of whether or not the levels created by this algorithm are interesting to human players is explored. A study was carried out comparing player attention while playing hand made levels versus their attention during procedurally generated levels. An auditory Stroop test was used to measure attention without disrupting play.
Date: May 2015
Creator: Taylor, Joshua
Partner: UNT Libraries

Condition-dependent Hilbert Spaces for Steepest Descent and Application to the Tricomi Equation

Description: A steepest descent method is constructed for the general setting of a linear differential equation paired with uniqueness-inducing conditions which might yield a generally overdetermined system. The method differs from traditional steepest descent methods by considering the conditions when defining the corresponding Sobolev space. The descent method converges to the unique solution to the differential equation so that change in condition values is minimal. The system has a solution if and only if the first iteration of steepest descent satisfies the system. The finite analogue of the descent method is applied to example problems involving finite difference equations. The well-posed problems include a singular ordinary differential equation and Laplace’s equation, each paired with respective Dirichlet-type conditions. The overdetermined problems include a first-order nonsingular ordinary differential equation with Dirichlet-type conditions and the wave equation with both Dirichlet and Neumann conditions. The method is applied in an investigation of the Tricomi equation, a long-studied equation which acts as a prototype of mixed partial differential equations and has application in transonic flow. The Tricomi equation has been studied for at least ninety years, yet necessary and sufficient conditions for existence and uniqueness of solutions on an arbitrary mixed domain remain unknown. The domains of interest are rectangular mixed domains. A new type of conditions is introduced. Ladder conditions take the uncommon approach of specifying information on the interior of a mixed domain. Specifically, function values are specified on the parabolic portion of a mixed domain. The remaining conditions are specified on the boundary. A conjecture is posed and states that ladder conditions are necessary and sufficient for existence and uniqueness of a solution to the Tricomi equation. Numerical experiments, produced by application of the descent method, provide strong evidence in support of the conjecture. Ladder conditions allow for a continuous deformation from Dirichlet ...
Date: August 2014
Creator: Montgomery, Jason W.
Partner: UNT Libraries

Modeling Epidemics on Structured Populations: Effects of Socio-demographic Characteristics and Immune Response Quality

Description: Epidemiologists engage in the study of the distribution and determinants of health-related states or events in human populations. Eventually, they will apply that study to prevent and control problems and contingencies associated with the health of the population. Due to the spread of new pathogens and the emergence of new bio-terrorism threats, it has become imperative to develop new and expand existing techniques to equip public health providers with robust tools to predict and control health-related crises. In this dissertation, I explore the effects caused in the disease dynamics by the differences in individuals’ physiology and social/behavioral characteristics. Multiple computational and mathematical models were developed to quantify the effect of those factors on spatial and temporal variations of the disease epidemics. I developed statistical methods to measure the effects caused in the outbreak dynamics by the incorporation of heterogeneous demographics and social interactions to the individuals of the population. Specifically, I studied the relationship between demographics and the physiological characteristics of an individual when preparing for an infectious disease epidemic.
Date: August 2014
Creator: Reyes Silveyra, Jorge A.
Partner: UNT Libraries