Current Search:   Hoffman, Frederick (x)

View All Items

  • CSV Spreadsheet
(1 - 13 of 13)
AUTOMATED SOFTWARE DEVELOPMENT METHODOLOGY (ASDM): AN ARCHITECTURE OF A KNOWLEDGE-BASED EXPERT SYSTEM
Title
AUTOMATED SOFTWARE DEVELOPMENT METHODOLOGY (ASDM): AN ARCHITECTURE OF A KNOWLEDGE-BASED EXPERT SYSTEM.
Creator
BLACKBURN, MARK R., Florida Atlantic University, Hoffman, Frederick
Abstract/Description
This paper describes an Automated Software Development Methodology (ASDM) that encompasses a formal model for characterizing the specifications of a system that will ultimately manifest itself in a software system. This paper focuses on the semantic specification model of ASDM and the architecture of a knowledge-based expert system (KBES) supporting the semantic model. ASDM is a knowledge-based expert system, because it provides expertise and assistance m the construction of formal...
Show moreThis paper describes an Automated Software Development Methodology (ASDM) that encompasses a formal model for characterizing the specifications of a system that will ultimately manifest itself in a software system. This paper focuses on the semantic specification model of ASDM and the architecture of a knowledge-based expert system (KBES) supporting the semantic model. ASDM is a knowledge-based expert system, because it provides expertise and assistance m the construction of formal requirement and design specifications while hiding the formal specification techniques and semantic model from the user. ASDM is a knowledge-based system, because the system represents formally characterized knowledge of the ASDM semantic model, and it represents application domain specific knowledge of a problem domain. Lastly, this paper introduces the concept of an Application Domain Communication Model (ADCM), with its associated characterization and interpretation facilities, for defining a set of user interface scenarios that represent a cognitive model of an application domain engineering world.
Show less
Date Issued
1987
PURL
http://purl.flvc.org/fcla/dt/14359
Subject Headings
Computer-aided design, Automatic programming (Computer science)
Format
Document (PDF)
Characterization of optimal normal bases
Title
Characterization of optimal normal bases.
Creator
Munoz-Connolly, Leonela, Florida Atlantic University, Mullin, Ronald C., Hoffman, Frederick
Abstract/Description
Recent interest in cryptographic systems has generated many mathematical results involving computations in finite fields. In particular, it is known that the use of optimal normal bases significantly reduces the complexity of computations in certain finite fields. This thesis examines three specific aspects of optimal normal bases. First, the effect of optimal normal bases on computations in finite fields is analyzed. Second, the known constructions of optimal normal bases are presented....
Show moreRecent interest in cryptographic systems has generated many mathematical results involving computations in finite fields. In particular, it is known that the use of optimal normal bases significantly reduces the complexity of computations in certain finite fields. This thesis examines three specific aspects of optimal normal bases. First, the effect of optimal normal bases on computations in finite fields is analyzed. Second, the known constructions of optimal normal bases are presented. Finally, the generators of optimal normal bases are discussed in terms of their order in the field.
Show less
Date Issued
2000
PURL
http://purl.flvc.org/fcla/dt/15755
Subject Headings
Finite fields (Algebra), Normal basis theorem
Format
Document (PDF)
Examples of deterministic and Monte Carlo algorithms for cryptographic applications
Title
Examples of deterministic and Monte Carlo algorithms for cryptographic applications.
Creator
McPherson, Joe Cullen, Florida Atlantic University, Hoffman, Frederick
Abstract/Description
In this thesis two different types of computer algorithms, Deterministic and Monte Carlo, are illustrated. Implementations of the Berlekamp-Massey algorithm and the Parallelized Pollard Rho Search are described here. The questions of what these two algorithms provide to the field of cryptography and why they have proven themselves important to cryptography are briefly discussed. It is also shown that with a little extra knowledge, the Parallelized Pollard Rho Search may be easily modified to...
Show moreIn this thesis two different types of computer algorithms, Deterministic and Monte Carlo, are illustrated. Implementations of the Berlekamp-Massey algorithm and the Parallelized Pollard Rho Search are described here. The questions of what these two algorithms provide to the field of cryptography and why they have proven themselves important to cryptography are briefly discussed. It is also shown that with a little extra knowledge, the Parallelized Pollard Rho Search may be easily modified to improve its performance.
Show less
Date Issued
2000
PURL
http://purl.flvc.org/fcla/dt/12687
Subject Headings
Monte Carlo method, Computer algorithms, Cryptography
Format
Document (PDF)
IDC - Interim Data Collector: An expert system based upon a relational database management system
Title
IDC - Interim Data Collector: An expert system based upon a relational database management system.
Creator
Cohn, Steven., Florida Atlantic University, Hoffman, Frederick
Abstract/Description
This thesis examines IDC--the Interim Data Collector, a program developed to store diverse technical data in the domain of avionics. The program generates a dialogue through menus and allows rapid data entry and retrieval based on operator supplied information about the modules. The program is written in CLIPPER (a superset of DBASE III+). I will show that IDC exhibits the characteristics associated with programs known as expert systems. These include data directed search, hierarchical...
Show moreThis thesis examines IDC--the Interim Data Collector, a program developed to store diverse technical data in the domain of avionics. The program generates a dialogue through menus and allows rapid data entry and retrieval based on operator supplied information about the modules. The program is written in CLIPPER (a superset of DBASE III+). I will show that IDC exhibits the characteristics associated with programs known as expert systems. These include data directed search, hierarchical dynamic pruning, an interactive user interface and a blackboard type inference engine. I also discuss the various sources of faults which contribute to reliability problems during program use and examine several techniques to increase the reliability of the expert system.
Show less
Date Issued
1990
PURL
http://purl.flvc.org/fcla/dt/14615
Subject Headings
Avionics--Computer programs
Format
Document (PDF)
investigation of a proper pairwise balanced design on 30 points
Title
An investigation of a proper pairwise balanced design on 30 points.
Creator
Berg, Melissa Mary-Jane., Florida Atlantic University, Mullin, Ronald C., Hoffman, Frederick
Abstract/Description
In this paper, we assume a proper pairwise balanced design on 30 points exists. We then get some results that reveal what the largest line size may be and the maximum number of lines of this size. Using these results, we look at one of two cases. We investigate the structure of the linear spaces in this case having no lines of sizes 2, 3, 6 and 30 and rule out many possibilities in order to get a minimum number of possible solutions.
Date Issued
2000
PURL
http://purl.flvc.org/fcla/dt/12710
Subject Headings
Vector spaces, Block designs
Format
Document (PDF)
DESIGN/IMPLEMENTATION OF AN EXPERT SYSTEM USING A DATA BASE MANAGEMENT SYSTEM ARCHITECTURE IN DEVELOPMENT OF ITS INFERENCE ENGINE
Title
DESIGN/IMPLEMENTATION OF AN EXPERT SYSTEM USING A DATA BASE MANAGEMENT SYSTEM ARCHITECTURE IN DEVELOPMENT OF ITS INFERENCE ENGINE.
Creator
LABOONE, PERRY ALLEN., Florida Atlantic University, Hoffman, Frederick, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description
The subject of this thesis is the design and implement at ion of an expert system from a standard data base management software language. The advantages and limitations of such a system design are discussed and supported by an accompanying implementation. Both, the design and implementation, demonstrate what gives the expertise or personification of human reasoning to a machine and why this type of reasoning is well suited to certain types of problems. This fundamental departure from...
Show moreThe subject of this thesis is the design and implement at ion of an expert system from a standard data base management software language. The advantages and limitations of such a system design are discussed and supported by an accompanying implementation. Both, the design and implementation, demonstrate what gives the expertise or personification of human reasoning to a machine and why this type of reasoning is well suited to certain types of problems. This fundamental departure from traditional deterministic analytical problem solving is accomplished by developing a system that is heuristic in nature. This heuristic implementation provides for a system that assists in the development of an emerging solution, rather than a deterministic solution in and of itself (i.e., a system that is programmed with a set of meta-knowledge rules that governs the decision making process and acts upon a second set of knowledge rules).
Show less
Date Issued
1986
PURL
http://purl.flvc.org/fcla/dt/14349
Subject Headings
Expert systems (Computer science), Systems design
Format
Document (PDF)
SYMMETRIES IN GOPPA CODES
Title
SYMMETRIES IN GOPPA CODES.
Creator
SAYRS, BRIAN GEORGE., Florida Atlantic University, Hoffman, Frederick, Charles E. Schmidt College of Science, Department of Mathematical Sciences
Abstract/Description
Properties of Goppa codes are studied. These are "good" codes in the sense that they asymptotically approach the Varshamov-Gilbert bound. E. N. Gilbert and R. R. Varshamov have shown (independently) that it is possible to construct an (n, k) linear code over GF(q) with minimum distance d if [equation] and there are long Goppa codes which achieve this bound [10]. Subclasses of Goppa codes which remain invariant under symmetries are given special attention.
Date Issued
1979
PURL
http://purl.flvc.org/fcla/dt/13989
Subject Headings
Mathematics--Research
Format
Document (PDF)
graphical approach to the traveling salesman problem
Title
A graphical approach to the traveling salesman problem.
Creator
Garrett, Randy L., Florida Atlantic University, Hoffman, Frederick, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description
This report details an approach to solving the Traveling Salesman Problem (TSP) using learning automata and a unique geometric approach. Two-dimensional Euclidean TSPs are considered and the type of learning automata used are commonly called neural networks. A standard neural net algorithm called back propagation proved to be fairly good at learning the sample figures, but a newer substitute for back propagation, called counter propagation, performed extremely well. An important goal of this...
Show moreThis report details an approach to solving the Traveling Salesman Problem (TSP) using learning automata and a unique geometric approach. Two-dimensional Euclidean TSPs are considered and the type of learning automata used are commonly called neural networks. A standard neural net algorithm called back propagation proved to be fairly good at learning the sample figures, but a newer substitute for back propagation, called counter propagation, performed extremely well. An important goal of this research was to derive increased theoretical understanding of the TSP. This goal has been satisfied, especially with regard to instabilities in path length and the order of points traversed along the minimal path route. In addition, some applications to larger point problems are considered, and it is shown that configurations with isolated clusters of relatively closely spaced points relative to the convex hull apexes and the fixed points map quite well into the geometric figures presented here.
Show less
Date Issued
1989
PURL
http://purl.flvc.org/fcla/dt/11939
Subject Headings
Traveling-salesman problem
Format
Document (PDF)
GROUP-THEORETIC PROOF OF BURNSIDE'S P('A)Q('B) THEOREM
Title
A GROUP-THEORETIC PROOF OF BURNSIDE'S P('A)Q('B) THEOREM.
Creator
HOCH, ALLEN ANTON., Florida Atlantic University, Hoffman, Frederick, Charles E. Schmidt College of Science, Department of Mathematical Sciences
Abstract/Description
In this thesis we give a self-contained exposition of the group-theoretic proofs of the Burnside p^a g^b theorem. The Burnside p^a g^b theorem states that all groups of order p^a g^b are solvable, where p and q are primes. The proof was suggested by Thompson, and published by Goldschmidt, Bender, and Matsuyama.
Date Issued
1979
PURL
http://purl.flvc.org/fcla/dt/13983
Subject Headings
Mathematics--Research
Format
Document (PDF)
MINIMUM K-CENTER PROBLEM FOR GRID GRAPH
Title
THE MINIMUM K-CENTER PROBLEM FOR GRID GRAPH.
Creator
HSUEH, CHI-FU, Florida Atlantic University, Hadlock, Frank O., Hoffman, Frederick, Charles E. Schmidt College of Science, Department of Mathematical Sciences
Abstract/Description
A study was made of the problem of locating M facilities on a connected grid graph, so that M is the minimum and so that every demand node on the graph is within given distance K of one of these M facilities. We call this problem briefly the G(N,K,M) problem, with N denoting the total number of demand nodes. An algorithm for solving this problem by using backtrack technique is presented in this thesis. A heuristic algorithm is also present; although the resulting M is not always minimum, it...
Show moreA study was made of the problem of locating M facilities on a connected grid graph, so that M is the minimum and so that every demand node on the graph is within given distance K of one of these M facilities. We call this problem briefly the G(N,K,M) problem, with N denoting the total number of demand nodes. An algorithm for solving this problem by using backtrack technique is presented in this thesis. A heuristic algorithm is also present; although the resulting M is not always minimum, it tends to be near minimum. The advantage over the backtrack algorithm is that the heuristic algorithm operates very quickly. Algorithms represented in this thesis are programmed in the Pascal language for the Univac 1100 computer at Florida Atlantic University, Boca Raton, Florida.
Show less
Date Issued
1981
PURL
http://purl.flvc.org/fcla/dt/14077
Subject Headings
Graph theory, Algorithms
Format
Document (PDF)
proposal for a binary stream cipher based on chaos theory
Title
A proposal for a binary stream cipher based on chaos theory.
Creator
Kanser, Heather Lianna, Florida Atlantic University, Mullin, Ronald C., Hoffman, Frederick, Charles E. Schmidt College of Science, Department of Mathematical Sciences
Abstract/Description
Today new secure cryptosystems are in great demand. Computers are becoming more powerful and old cryptosystems, such as the Data Encryption Standard (DES), are becoming outdated. This thesis describes a new binary additive strewn cipher (HK cryptosystem) that is based on the logistic map. The logistic map is not random, but works under simple rules to become complex, thus making it ideal for implementation in cryptography. Instead of basing the algorithm on one logistic map, the HK...
Show moreToday new secure cryptosystems are in great demand. Computers are becoming more powerful and old cryptosystems, such as the Data Encryption Standard (DES), are becoming outdated. This thesis describes a new binary additive strewn cipher (HK cryptosystem) that is based on the logistic map. The logistic map is not random, but works under simple rules to become complex, thus making it ideal for implementation in cryptography. Instead of basing the algorithm on one logistic map, the HK cryptosystem. averages several uncoupled logistic maps. Averaging the maps increases the dimension of such a system, thus providing greater security. This thesis will explore the strengths and weaknesses of the HK cryptosystem and will end by introducing a modified version, called the HK8 cryptosystem that does not have the apparent weakness of the HK system.
Show less
Date Issued
2000
PURL
http://purl.flvc.org/fcla/dt/12685
Subject Headings
Chaotic behavior in systems, Computers--Access control, Cryptography
Format
Document (PDF)
Transforming directed graphs into uncertain rules
Title
Transforming directed graphs into uncertain rules.
Creator
Lantigua, Jose Salvador., Florida Atlantic University, Hoffman, Frederick, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description
The intent of this thesis is to show how rule structures can be derived from influence diagrams and how these structures can be mapped to existing rule-based shell paradigms. We shall demonstrate this mapping with an existing shell having the Evidence (E) --> Hypothesis (H), Certainty Factor (CF) paradigm structure. Influence diagrams are graphical representations of hypothesis to evidence, directed forms of Bayesian influence networks. These allow for inferencing about both diagnostic and...
Show moreThe intent of this thesis is to show how rule structures can be derived from influence diagrams and how these structures can be mapped to existing rule-based shell paradigms. We shall demonstrate this mapping with an existing shell having the Evidence (E) --> Hypothesis (H), Certainty Factor (CF) paradigm structure. Influence diagrams are graphical representations of hypothesis to evidence, directed forms of Bayesian influence networks. These allow for inferencing about both diagnostic and predictive (or causal) behavior based on uncertain evidence. We show how this can be implemented through a Probability (P) to CF mapping algorithm and a rule-set conflict resolution methodology. The thesis contains a discussion about the application of probabilistic semantics from Bayesian networks and of decision theory, to derive qualitative assertions about the likelihood of an occurrence; the sensitivity of a conclusion; and other indicators of usefulness. We show an example of this type of capability by the addition of a probability range function for the premise clause in our shell's rule structure.
Show less
Date Issued
1989
PURL
http://purl.flvc.org/fcla/dt/14570
Subject Headings
Decision-making--Mathematical models, Probabilities, Expert systems (Computer science)
Format
Document (PDF)
system for assisting in the determination of geometric similarity between machined cylindrical parts
Title
A system for assisting in the determination of geometric similarity between machined cylindrical parts.
Creator
Lockard, Alan A. L., Florida Atlantic University, Hoffman, Frederick, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description
The costs associated with the design and manufacture of machined components can be significantly reduced by the ability to identify and group similar parts. This activity is generally accomplished by assigning each part a Group Technology code number based on its most significant characteristics. Attempts to accomplish this are hindered by: the relatively small amount of information that can be encoded in a code of manageable length, inconsistencies in human interpretation of design and...
Show moreThe costs associated with the design and manufacture of machined components can be significantly reduced by the ability to identify and group similar parts. This activity is generally accomplished by assigning each part a Group Technology code number based on its most significant characteristics. Attempts to accomplish this are hindered by: the relatively small amount of information that can be encoded in a code of manageable length, inconsistencies in human interpretation of design and manufacturing data, the commitment of resources required to review and encode all candidate components at a facility, and the heuristic nature of determining what constitutes significant similarity for any particular application. These problems are addressed by the development of a system that assists in the determination of similarity by comparing CAD (Computer Aided Design) files, rather than Group Technology codes, in a manufacturing oriented frame-based system.
Show less
Date Issued
1989
PURL
http://purl.flvc.org/fcla/dt/14497
Subject Headings
Computer-aided design, Machine parts, Group technology, Manufacturing processes--Data processing
Format
Document (PDF)