Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Keyword
-
- Adaptively Weighted Discriminator Generative Adversarial Network (1)
- Assorted-Time Normalization (1)
- Constrained motion (1)
- DNA (1)
- Deep Learning (1)
-
- Dual quaternions (1)
- Graph Theory (1)
- Lie groups (1)
- Optimal control (1)
- Optimal pots (1)
- Orthogonal Gated Recurrent Unit with Neumann-Cayley Transformation (1)
- Self-Correcting Optimization (1)
- Self-assembly (1)
- Special Euclidean group (1)
- Symmetric Convolutional Neural Network (1)
- Trajectory optimization (1)
- Trapezohedral Graphs (1)
Articles 1 - 3 of 3
Full-Text Articles in Other Mathematics
Rigid Body Constrained Motion Optimization And Control On Lie Groups And Their Tangent Bundles, Brennan S. Mccann
Rigid Body Constrained Motion Optimization And Control On Lie Groups And Their Tangent Bundles, Brennan S. Mccann
Doctoral Dissertations and Master's Theses
Rigid body motion requires formulations where rotational and translational motion are accounted for appropriately. Two Lie groups, the special orthogonal group SO(3) and the space of quaternions H, are commonly used to represent attitude. When considering rigid body pose, that is spacecraft position and attitude, the special Euclidean group SE(3) and the space of dual quaternions DH are frequently utilized. All these groups are Lie groups and Riemannian manifolds, and these identifications have profound implications for dynamics and controls. The trajectory optimization and optimal control problem on Riemannian manifolds presents significant opportunities for theoretical development. Riemannian optimization is an attractive …
Dna Self-Assembly Of Trapezohedral Graphs, Hytham Abdelkarim
Dna Self-Assembly Of Trapezohedral Graphs, Hytham Abdelkarim
Electronic Theses, Projects, and Dissertations
Self-assembly is the process of a collection of components combining to form an organized structure without external direction. DNA self-assembly uses multi-armed DNA molecules as the component building blocks. It is desirable to minimize the material used and to minimize genetic waste in the assembly process. We will be using graph theory as a tool to find optimal solutions to problems in DNA self-assembly. The goal of this research is to develop a method or algorithm that will produce optimal tile sets which will self-assemble into a target DNA complex. We will minimize the number of tile and bond-edge types …
Novel Architectures And Optimization Algorithms For Training Neural Networks And Applications, Vasily I. Zadorozhnyy
Novel Architectures And Optimization Algorithms For Training Neural Networks And Applications, Vasily I. Zadorozhnyy
Theses and Dissertations--Mathematics
The two main areas of Deep Learning are Unsupervised and Supervised Learning. Unsupervised Learning studies a class of data processing problems in which only descriptions of objects are known, without label information. Generative Adversarial Networks (GANs) have become among the most widely used unsupervised neural net models. GAN combines two neural nets, generative and discriminative, that work simultaneously. We introduce a new family of discriminator loss functions that adopts a weighted sum of real and fake parts, which we call adaptive weighted loss functions. Using the gradient information, we can adaptively choose weights to train a discriminator in the direction …