1,334 Matching Results

Search Results

Advanced search parameters have been applied.

Logic Programming Tools for Dynamic Content Generation and Internet Data Mining

Description: The phenomenal growth of Information Technology requires us to elicit, store and maintain huge volumes of data. Analyzing this data for various purposes is becoming increasingly important. Data mining consists of applying data analysis and discovery algorithms that under acceptable computational efficiency limitations, produce a particular enumeration of patterns over the data. We present two techniques based on using Logic programming tools for data mining. Data mining analyzes data by extracting patterns which describe its structure and discovers co-relations in the form of rules. We distinguish analysis methods as visual and non-visual and present one application of each. We explain that our focus on the field of Logic Programming makes some of the very complex tasks related to Web based data mining and dynamic content generation, simple and easy to implement in a uniform framework.
Access: This item is restricted to UNT Community Members. Login required if off-campus.
Date: December 2000
Creator: Gupta, Anima
Partner: UNT Libraries

Unplug Your Mouse: Workflow Automation with AutoHotkey

Description: This Tech Talk presentation discusses workflow automation with AutoHotkey. AutoHotkey provides an easy to use scripting language for assigning multiple actions to a single key command, or hotkey. The AutoHotkey syntax also supports programming constructs and the creation of graphical user interfaces for developing complex applications. This Tech Talk will demonstrate how to write AutoHotkey scripts and give examples of how the Digital Projects Unit is using the software to streamline repetitive tasks.
Date: February 20, 2013
Creator: Weidner, Andrew & Wilson, Robert John
Partner: UNT Libraries

Calculation of wing spars

Description: The author presents a comparison and combination of the numerical and geometrical determinations of the maximum M, when calculating the maximum bay moment.
Date: August 1, 1921
Creator: Muller-Breslau, H
Partner: UNT Libraries Government Documents Department

Mathematical Programming Approaches to the Three-Group Classification Problem

Description: In the last twelve years there has been considerable research interest in mathematical programming approaches to the statistical classification problem, primarily because they are not based on the assumptions of the parametric methods (Fisher's linear discriminant function, Smith's quadratic discriminant function) for optimality. This dissertation focuses on the development of mathematical programming models for the three-group classification problem and examines the computational efficiency and classificatory performance of proposed and existing models. The classificatory performance of these models is compared with that of Fisher's linear discriminant function and Smith's quadratic discriminant function. Additionally, this dissertation investigates theoretical characteristics of mathematical programming models for the classification problem with three or more groups. A computationally efficient model for the three-group classification problem is developed. This model minimizes directly the number of misclassifications in the training sample. Furthermore, the classificatory performance of the proposed model is enhanced by the introduction of a two-phase algorithm. The same algorithm can be used to improve the classificatory performance of any interval-based mathematical programming model for the classification problem with three or more groups. A modification to improve the computational efficiency of an existing model is also proposed. In addition, a multiple-group extension of a mathematical programming model for the two-group classification problem is introduced. A simulation study on classificatory performance reveals that the proposed models yield lower misclassification rates than Fisher's linear discriminant function and Smith's quadratic discriminant function under certain data configurations. Data configurations, where the parametric methods outperform the proposed models, are also identified. A number of theoretical characteristics of mathematical programming models for the classification problem are identified. These include conditions for the existence of feasible solutions, as well as conditions for the avoidance of degenerate solutions. Additionally, conditions are identified that guarantee the classificatory non-inferiority of one model over another in the training ...
Date: August 1993
Creator: Loucopoulos, Constantine
Partner: UNT Libraries

Defensive Programming

Description: This research explores the concepts of defensive programming as currently defined in the literature. Then these concepts are extended and more explicitly defined. The relationship between defensive programming, as presented in this research, and current programming practices is discussed and several benefits are observed. Defensive programming appears to benefit the entire software life cycle. Four identifiable phases of the software development process are defined, and the relationship between these four phases and defensive programming is shown. In this research, defensive programming is defined as writing programs in such a way that during execution the program itself produces communication allowing the programmer and the user to observe its dynamic states accurately and critically. To accomplish this end, the use of defensive programming snap shots is presented as a software development tool.
Date: May 1980
Creator: Bailey, L. Mark
Partner: UNT Libraries

Generalized parameter-free duality models in discrete minmax fractional programming based on second-order optimality conditions

Description: This article discusses the construction of six generalized second-order parameter-free duality models, and proves several weak, strong, and strict converse duality theorems for a discrete minmax fractional programming problem using two partitioning schemes and various types of generalized second-order (ℱ, β, ɸ, 𝜌, θ, 𝑚)-univexity assumptions.
Date: November 8, 2016
Creator: Zalmai, G. J. & Verma, Ram U.
Partner: UNT College of Arts and Sciences

Sequencing as a factor associated with students' ability to learn programming

Description: The problem of this study concerns the performance of students in computer programming following exposure to a computer-aided instruction (CAI) drill in sequencing and practice exercises. The purpose of this study was to determine whether or not student success rates improve in computer programming after completing CAI sequencing drills and practice exercises.
Date: August 1991
Creator: Honarvar, Hassanali
Partner: UNT Libraries

Fortran M Language Definition

Description: This document defines the Fortran M extensions to Fortran 77. It updates an earlier definition, dated June 1992, in several minor respects.
Date: August 1993
Creator: Foster, Ian & Chandy, K. Mani
Partner: UNT Libraries Government Documents Department

Generic Optimization Program User Manual Version 3.0.0

Description: GenOpt is an optimization program for the minimization of a cost function that is evaluated by an external simulation program. It has been developed for optimization problems where the cost function is computationally expensive and its derivatives are not available or may not even exist. GenOpt can be coupled to any simulation program that reads its input from text files and writes its output to text files. The independent variables can be continuous variables (possibly with lower and upper bounds), discrete variables, or both, continuous and discrete variables. Constraints on dependent variables can be implemented using penalty or barrier functions. GenOpt uses parallel computing to evaluate the simulations. GenOpt has a library with local and global multi-dimensional and one-dimensional optimization algorithms, and algorithms for doing parametric runs. An algorithm interface allows adding new minimization algorithms without knowing the details of the program structure. GenOpt is written in Java so that it is platform independent. The platform independence and the general interface make GenOpt applicable to a wide range of optimization problems. GenOpt has not been designed for linear programming problems, quadratic programming problems, and problems where the gradient of the cost function is available. For such problems, as well as for other problems, special tailored software exists that is more efficient.
Date: May 11, 2009
Creator: Wetter, Michael
Partner: UNT Libraries Government Documents Department

Information Storage and Retrieval Systems

Description: This thesis describes the implementation of a general purpose personal information storage and retrieval system. Chapter one contains an introduction to information storage and retrieval. Chapter two contains a description of the features a useful personal information retrieval system should contain. This description forms the basis for the implementation of the personal information storage and retrieval system described in chapter three. The system is implemented in UCSD Pascal on an Apple II microcomputer.
Date: May 1983
Creator: Creech, Teresa Adams
Partner: UNT Libraries

A Programming Language For Concurrent Processing

Description: This thesis is a proposed solution to the problem of including an effective interrupt mechanism in the set of concurrent- processing primitives of a block-structured programming language or system. The proposed solution is presented in the form of a programming language definition and model. The language is called TRIPLE.
Date: August 1972
Creator: Jackson, Portia M.
Partner: UNT Libraries

Linear Programming--a Management Tool

Description: The purpose of this thesis is to integrate the most up-to-date information on the subject of linear programming into a comprehensive and understandable treatise for the consideration of management. The value of this study, then, is determined by the effectiveness of its presentation so that management may grasp an ample understanding of the subject.
Date: June 1963
Creator: Sosa-Rodriguez, Jose Ramon
Partner: UNT Libraries

Iterative Solution of Linear Programs

Description: By perturbing a linear program to a quadratic program, it is possible to solve the latter in its dual variable space by iterative techniques such as successive over-relaxation (SOR) methods. This provides a solution to the original linear program.
Date: July 1979
Creator: Mangasarian, Olvi L.
Partner: UNT Libraries Government Documents Department