Numerical Analysis and Computation Commons^™

Data Mining Based Hybridization Of Meta-Raps, Fatemah Al-Duoli, Ghaith Rabadi

Engineering Management & Systems Engineering Faculty Publications

Though metaheuristics have been frequently employed to improve the performance of data mining algorithms, the opposite is not true. This paper discusses the process of employing a data mining algorithm to improve the performance of a metaheuristic algorithm. The targeted algorithms to be hybridized are the Meta-heuristic for Randomized Priority Search (Meta-RaPS) and an algorithm used to create an Inductive Decision Tree. This hybridization focuses on using a decision tree to perform on-line tuning of the parameters in Meta-RaPS. The process makes use of the information collected during the iterative construction and improvement phases Meta-RaPS performs. The data mining algorithm …

Selection Of Step Size For Total Variation Minimization In Ct, Anna N. Yeboah

College of Graduate Studies: Theses & Dissertations

Medical image reconstruction by total variation minimization is a newly developed area in computed tomography (CT). In compressed sensing literature, it hasbeen shown that signals with sparse representations in an orthonormal basis may be reconstructed via l1-minimization. Furthermore, if an image can be approximately modeled to be piecewise constant, then its gradient is sparse. The application of l1-minimization to a sparse gradient, known as total variation minimization, may then be used to recover the image. In this paper, the steepest descent method is employed to update the approximation of the image. We propose a way to estimate an optimal step …

Grayscale-Image Encryption Using Random Hill Cipher Over Sln(F) Associated With Discrete Wavelet Transformation, D. C. Mishra, R. K. R. K. Sharma

Applications and Applied Mathematics: An International Journal (AAM)

Image data are highly sensitive and prone to incidental decoding by intruders. The security of image data in an insecure network is therefore a major issue. In this paper, we have presented a novel approach for grayscale-image encryption and decryption using Random Hill cipher over SLn(F) associated with discrete wavelet transformation. Earlier techniques for encryption and decryption of image data discussed missing the keys, but in this approach, both the keys and the arrangement of RHC are emphasized. Additionally, keys multiplication side (pre or post) over a grayscale-image data matrix also inevitable to know, to correctly decrypt the encrypted image …

Numerical Studies For Solving Fractional Riccati Differential Equation, N. H. Sweilam, M. M. Khader, A. M. S. Mahdy

Applications and Applied Mathematics: An International Journal (AAM)

In this paper, finite difference method (FDM) and Pade'-variational iteration method (Pade'- VIM) are successfully implemented for solving the nonlinear fractional Riccati differential equation. The fractional derivative is described in the Caputo sense. The existence and the uniqueness of the proposed problem are given. The resulting nonlinear system of algebraic equations from FDM is solved by using Newton iteration method; moreover the condition of convergence is verified. The convergence's domain of the solution is improved and enlarged by Pade'-VIM technique. The results obtained by using FDM is compared with Pade'-VIM. It should be noted that the Pade'-VIM is preferable because …

Degree Constrained Triangulation, Roshan Gyawali

UNLV Theses, Dissertations, Professional Papers, and Capstones

Triangulation of simple polygons or sets of points in two dimensions is a widely investigated problem in computational geometry. Some researchers have considered variations of triangulation problems that include minimum weight triangulation, de-launay triangulation and triangulation refinement. In this thesis we consider a constrained version of the triangulation problem that asks for triangulating a given domain (polygon or point sites) so that the resulting triangulation has an increased number of even degree vertices. This problem is called Degree Constrained Triangulation (DCT). We propose four algorithms to solve DCT problems. We also present experimental results based on the implementation of the …

Geometric Programming Subject To System Of Fuzzy Relation Inequalities, Elyas Shivanian, Mahdi Keshtkar, Esmaile Khorram

Applications and Applied Mathematics: An International Journal (AAM)

In this paper, an optimization model with geometric objective function is presented. Geometric programming is widely used; many objective functions in optimization problems can be analyzed by geometric programming. We often encounter these in resource allocation and structure optimization and technology management, etc. On the other hand, fuzzy relation equalities and inequalities are also used in many areas. We here present a geometric programming model with a monomial objective function subject to the fuzzy relation inequality constraints with maxproduct composition. Simplification operations have been given to accelerate the resolution of the problem by removing the components having no effect on …

Introducing An Efficient Modification Of The Variational Iteration Method By Using Chebyshev Polynomials, M. M. Khader

Applications and Applied Mathematics: An International Journal (AAM)

In this article an efficient modification of the variational iteration method (VIM) is presented using Chebyshev polynomials. Special attention is given to study the convergence of the proposed method. The new modification is tested for some examples to demonstrate reliability and efficiency of the proposed method. A comparison of our numerical results those of the conventional numerical method, the fourth-order Runge-Kutta method (RK4) are given. The comparison shows that the solution using our modification is fast-convergent and is in excellent conformance with the exact solution. Finally, we conclude that the proposed method can be applied to a large class of …

A New Four Point Circular-Invariant Corner-Cutting Subdivision For Curve Design, Jian-Ao Lian

Applications and Applied Mathematics: An International Journal (AAM)

A 4-point nonlinear corner-cutting subdivision scheme is established. It is induced from a special C-shaped biarc circular spline structure. The scheme is circular-invariant and can be effectively applied to 2-dimensional (2D) data sets that are locally convex. The scheme is also extended adaptively to non-convex data. Explicit examples are demonstrated.

Random Number Generation: Types And Techniques, David F. Dicarlo

Senior Honors Theses

What does it mean to have random numbers? Without understanding where a group of numbers came from, it is impossible to know if they were randomly generated. However, common sense claims that if the process to generate these numbers is truly understood, then the numbers could not be random. Methods that are able to let their internal workings be known without sacrificing random results are what this paper sets out to describe. Beginning with a study of what it really means for something to be random, this paper dives into the topic of random number generators and summarizes the key …

Preconditioning Visco-Resistive Mhd For Tokamak Plasmas, Daniel R. Reynolds, Ravi Samtaney, Hilari C. Tiedeman

Mathematics Research

No abstract provided.

Block Preconditioning Of Stiff Implicit Models For Radiative Ionization In The Early Universe, Daniel R. Reynolds, Robert Harkness, Geoffrey So, Michael L. Norman

Mathematics Research

No abstract provided.

Retrieval-Based Face Annotation By Weak Label Regularized Local Coordinate Coding, Dayong Wang, Steven C. H. Hoi, Ying He, Jianke Zhu

Research Collection School Of Computing and Information Systems

Retrieval-based face annotation is a promising paradigm in mining massive web facial images for automated face annotation. Such an annotation paradigm usually encounters two key challenges. The first challenge is how to efficiently retrieve a short list of most similar facial images from facial image databases, and the second challenge is how to effectively perform annotation by exploiting these similar facial images and their weak labels which are often noisy and incomplete. In this paper, we mainly focus on tackling the second challenge of the retrieval-based face annotation paradigm. In particular, we propose an effective Weak Label Regularized Local Coordinate …

Modeling 3d Articulated Motions With Conformal Geometry Videos (Cgvs), Dao T. P. Quynh, Ying He, Xiaoming Chen, Jiazhi Xia, Qian Sun, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

3D articulated motions are widely used in entertainment, sports, military, and medical applications. Among various techniques for modeling 3D motions, geometry videos (GVs) are a compact representation in that each frame is parameterized to a 2D domain, which captures the 3D geometry (x, y, z) to a pixel (r, g, b) in the image domain. As a result, the widely studied image/video processing techniques can be directly borrowed for 3D motion. This paper presents conformal geometry videos (CGVs), a novel extension of the traditional geometry videos by taking into the consideration of the isometric nature of 3D articulated motions. We …

Quantitative Characterization Of Microstructure Features For 1st Generation Advanced High Strength Steels, Margarita Vidrio, Ellen Liu, Donsheng Li, Kyoo Sil Choi, Xin Sun

STAR Program Research Presentations

The role of Advanced High Strength Steels (AHSS) in the automotive industry is important because of its affordability and excellent mechanical properties. The 1st generation of AHSS achieves its preferred combination of strength and ductility by embedding harder martensite grains into softer ferritic matrix. Ductility and strength of these steels are important to safety, formability, application, and life. However, a noticeable degree of inconsistent forming behaviors has been observed in the 1st generation AHSS in production, which seems to be related to the microstructure-level inhomogeneity. The objective of this project is to grain fundamental understandings on how different microstructure level …

Monte Carlo Simulation Of Electron-Induced Air Fluorescence Utilizing Mobile Agents: A New Paradigm For Collaborative Scientific Simulation, Christopher Daniel Walker

Dissertations

A new paradigm for utilization of mobile agents in a modular architecture for scientific simulation is demonstrated through a case study involving Monte Carlo simulation of low energy electron interactions with molecular nitrogen gas. Design and development of Monte Carlo simulations for physical systems of moderate complexity can present a seemingly overwhelming endeavor. The researcher must possess or otherwise develop a thorough understanding the physical system, create mathematical and computational models of the physical system’s components, and forge a simulation utilizing those models. While there is no single route between a collection of physical concepts and a Monte Carlo simulation …

Improved Algorithms For Ear-Clipping Triangulation, Bartosz Kajak

UNLV Theses, Dissertations, Professional Papers, and Capstones

We consider the problem of improving ear-slicing algorithm for triangulating a simple polygon. We propose two variations of ear-slicing technique for generating “good-quality” triangulation. The first approach is based on searching for the best triangle along the boundary. The second approach considers polygon partitioning on a pre-process before applying the ear-slicing. Experimental investigation reveals that both approaches yield better quality triangulation than the standard ear-slicing method.

Shooting Neural Networks Algorithm For Solving Boundary Value Problems In Odes, Kais I. Ibraheem, Bashir M. Khalaf

Applications and Applied Mathematics: An International Journal (AAM)

The objective of this paper is to use Neural Networks for solving boundary value problems (BVPs) in Ordinary Differential Equations (ODEs). The Neural networks use the principle of Back propagation. Five examples are considered to show effectiveness of using the shooting techniques and neural network for solving the BVPs in ODEs. The convergence properties of the technique, which depend on the convergence of the integration technique and accuracy of the interpolation technique are considered.

Dynamic Decision Making And Race Games, Shipra De

Calvert Undergraduate Research Awards

Frequent criticism in dynamic decision making research pertains to the overly complex nature of the decision tasks used in experimentation. To address such concerns we study dynamic decision making with respect to the simple race game Hog, which has a computable optimal decision strategy. In the two-player game of Hog, individuals compete to be the first to reach a designated threshold of points. Players alternate rolling a desired quantity of dice. If the number one appears on any of the dice, the player receives no points for his turn; otherwise, the sum of the numbers appearing on the dice is …

Reliability Measures Of A Three-State Complex System: A Copula Approach, Mangey Ram

Applications and Applied Mathematics: An International Journal (AAM)

Improvement in reliability and production play a very important role in system design. The two key factors, considered in predicting system reliability, are failure distribution of the component and system configuration. This research discusses the mathematical modeling of a highly reliable complex system, which is in three states i.e. normal, partial failed (degraded state) and complete failed state. The system, partial failed is due to the partial failure of internal components or redundancies and completely failed is due to catastrophic failure of the system. Repair rates are general functions of the time spent. All the transition rates are constant except …

Convergence Of The Sinc Method Applied To Volterra Integral Equations, M. Zarebnia, J. Rashidinia

Applications and Applied Mathematics: An International Journal (AAM)

A collocation procedure is developed for the linear and nonlinear Volterra integral equations, using the globally defined Sinc and auxiliary basis functions. We analytically show the exponential convergence of the Sinc collocation method for approximate solution of Volterra integral equations. Numerical examples are included to confirm applicability and justify rapid convergence of our method.

Parallel And Distributed Simulation Of Parabolic And Telegraphic Equations., Ewedafe Simon Uzezi

Student Works (2010-2019)

In this thesis, a parallel implementation of explicit/implicit parallel algorithms such as the stationary iterative methods and the class of iterating alternating methods which includes: Alternating Direction Implicit (ADI), Iterative Alternating Direction Explicit (IADE), for D’Yakonov (IADE-DY), Double sweep Mitchell and Fairweather (MF-DS) and Alternating Group Explicit (AGE) method for solving 1-Dimensional (1-D), 2-Dimensional (2-D) Parabolic (special examples including 1-D, 2-D Bio-Heat Equation) and 1-D, 2-D and 3-D Telegraphic Equations on a distributed environment of Message Passing Interface (MPI) and Parallel Virtual Machine (PVM) platform is presented. To correlate the communication activity with computation, we counted events between significant MPI/PVM …

Circular Nonlinear Subdivision Schemes For Curve Design, Jian-Ao Lian, Yonghui Wang, Yonggao Yang

Applications and Applied Mathematics: An International Journal (AAM)

Two new families of nonlinear 3-point subdivision schemes for curve design are introduced. The first family is ternary interpolatory and the second family is binary approximation. All these new schemes are circular-invariant, meaning that new vertices are generated from local circles formed by three consecutive old vertices. As consequences of the nonlinear schemes, two new families of linear subdivision schemes for curve design are established. The 3-point linear binary schemes, which are corner-cutting depending on the choices of the tension parameter, are natural extensions of the Lane-Riesenfeld schemes. The four families of both nonlinear and linear subdivision schemes are implemented …

Tight Lower Bound For The Sparse Travelling Salesman Problem, Fredrick Mtenzi

Conference papers

The Sparse Travelling Salesman Problem (Sparse TSP) which is a variant of the classical Travelling Salesman Problem (TSP) is the problem of finding the shortest route of the salesman when visiting cities in a region making sure that each city is visited at least once and returning home at the end. In the Sparse TSP, the distance between cities may not obey the triangle inequality; this makes the use of algorithms and formulations designed for the TSP to require modifications in order to produce near-optimal results. A lower bound for optmisation problems gives us the quality guarantee of the near-optimal …

A Covert Encryption Method For Applications In Electronic Data Interchange, Jonathan Blackledge, Dmitry Dubovitskiy

Articles

A principal weakness of all encryption systems is that the output data can be ‘seen’ to be encrypted. In other words, encrypted data provides a ‘flag’ on the potential value of the information that has been encrypted. In this paper, we provide a new approach to ‘hiding’ encrypted data in a digital image.

In conventional (symmetric) encryption, the plaintext is usually represented as a binary stream and encrypted using an XOR type operation with a binary cipher. The algorithm used is ideally designed to: (i) generate a maximum entropy cipher so that there is no bias with regard to any …

On A-Ary Subdivision For Curve Design Ii. 3-Point And 5-Point Interpolatory Schemes, Jian-Ao Lian

Applications and Applied Mathematics: An International Journal (AAM)

The a-ary 3-point and 5-point interpolatery subdivision schemes for curve design are introduced for arbitrary odd integer a greater than or equal to 3. These new schemes further extend the family of the classical 4- and 6-point interpolatory schemes.

Uniform Uncertainty Principle And Signal Recovery Via Regularized Orthogonal Matching Pursuit, Deanna Needell, Roman Vershynin

CMC Faculty Publications and Research

This paper seeks to bridge the two major algorithmic approaches to sparse signal recovery from an incomplete set of linear measurements—L1-minimization methods and iterative methods (Matching Pursuits). We find a simple regularized version of Orthogonal Matching Pursuit (ROMP) which has advantages of both approaches: the speed and transparency of OMP and the strong uniform guarantees of L1-minimization. Our algorithm, ROMP, reconstructs a sparse signal in a number of iterations linear in the sparsity, and the reconstruction is exact provided the linear measurements satisfy the uniform uncertainty principle.

On A-Ary Subdivision For Curve Design: I. 4-Point And 6-Point Interpolatory Schemes, Jian-Ao Lian

Applications and Applied Mathematics: An International Journal (AAM)

The classical binary 4-point and 6-point interpolatery subdivision schemes are generalized to a-ary setting for any integer a greater than or equal to 3. These new a-ary subdivision schemes for curve design are derived easily from their corresponding two-scale scaling functions, a notion from the context of wavelets.

Intelligence Through Interaction: Towards A Unified Theory For Learning, Ah-Hwee Tan, Gail A. Carpenter, Stephen Grossberg

Research Collection School Of Computing and Information Systems

Machine learning, a cornerstone of intelligent systems, has typically been studied in the context of specific tasks, including clustering (unsupervised learning), classification (supervised learning), and control (reinforcement learning). This paper presents a learning architecture within which a universal adaptation mechanism unifies a rich set of traditionally distinct learning paradigms, including learning by matching, learning by association, learning by instruction, and learning by reinforcement. In accordance with the notion of embodied intelligence, such a learning theory provides a computational account of how an autonomous agent may acquire the knowledge of its environment in a real-time, incremental, and continuous manner. Through a …

Socio-Economic Impacts Of Computer Viruses In Tanzania, M Victor

Tanzania Journal of Engineering and Technology (TJET)

This paper reports on a research project conducted with an objective of identifying and assessing various approaches used by different computer users (Management, System Administrators and end users) in Tanzania to combat computer viruses (CVs), and to assess users' awareness level on CVs. Specifically, the study aimed at assessing the awareness level on CVs to the Tanzanian business community; analyze the socio -economic impact caused by CVs in Tanzania and; assess existing methods, capacity and limitations on controlling CVs in Tanzania. Data was collected using both questionnaires and interview from financial institutions such as NBC and BOT, and telecommunications sector …

Review Of The Product Development Process And Information Flow In The Manufacturing Industry: Problems And A Possible Wav Forward, E Opiyo

Tanzania Journal of Engineering and Technology (TJET)

No abstract provided.