Austin Melton - Academia.edu (original) (raw)
Papers by Austin Melton
There are some variations of the definition across different authors. Here it is assumed that Γ i... more There are some variations of the definition across different authors. Here it is assumed that Γ is defined on the whole X (domΓ = X) and it is not permitted Γ(x) = ∅. Usually the domain X and the codomain Y are endowed with a metric; the topologies T1,T2 are the one induced by metrics. In particular X ⊆ Rm and Y ⊆ Rn. However to emphasize that the most important properties of correspondences are topological, definition 1 only requires there to be topologies defined on X and Y .
Fuzzy Sets and Systems, 2017
Motivated by the concept of Sierpinski object for topological systems of S. Vickers, presented re... more Motivated by the concept of Sierpinski object for topological systems of S. Vickers, presented recently by R. Noor and A. K. Srivastava, this paper introduces the Sierpinski object for many-valued topological systems and shows that it has three important properties of the crisp Sierpinski space of general topology.
2016 IEEE 40th Annual Computer Software and Applications Conference (COMPSAC), 2016
ABSTRACT Numerous research results in the areas of software measures and software tools are predi... more ABSTRACT Numerous research results in the areas of software measures and software tools are predicated on a particular programming language, or on some characterizations of a programming language. For example, numerous software measures have been defined only for structured programming languages and several of the reported approaches to program testing define a specific language. However, this proliferation of languages upon which measures and tools are defined makes independent evaluation and comparison of measures and tools problematic.
Workshops in Computing, 1992
Categorical Structures and Their Applications - Proceedings of the North-West European Category Seminar, 2004
Lecture Notes in Computer Science, 1989
Informally we show why a domain with a reasonable collection of properties is a topological space... more Informally we show why a domain with a reasonable collection of properties is a topological space. We then address the question: if one wishes to do programming language semantics in a category of topological spaces instead of the category of complete partial orders (cpos) which category should be used? This question is first considered with respect to objects, i.e., replacing
Journal of Software
Predicting software testability can reduce costs and efforts. Cohesion, as one of software qualit... more Predicting software testability can reduce costs and efforts. Cohesion, as one of software quality metrics, found to be good indicator for software testability. Although there is a good interest in software testability on the class level in the literature, software testability on the package level has not received the same interest. The paper investigates the relationship between a newly proposed package cohesion metric and software testing effort. The empirical analysis used data collected from five Java open source software systems for which JUnit test classes are available. The results show that as good the package cohesion is, as the less testing effort is needed. The stability of the correlations allows us to draw optimistic conclusions about its use as an indicator.
2015 Second International Conference on Trustworthy Systems and Their Applications, 2015
2015 Second International Conference on Trustworthy Systems and Their Applications, 2015
Journal of Systems and Software, 2016
2014 IEEE 38th Annual Computer Software and Applications Conference, 2014
Fuzzy Sets and Systems, 1989
The fuzzy relational model of Buckles and Petty is a rigorous scheme for incorporating non-ideal ... more The fuzzy relational model of Buckles and Petty is a rigorous scheme for incorporating non-ideal or fuzzy information in a relational database. In addition to providing a consistent scheme for representing fuzzy information in the relational structure, the model possesses two critical properties that hold for classical relational databases. These properties are that no two tuples have identical interpretations and each relational operation has a unique result.
In this paper we de ne a Lagois connection, which is a generalization of a special type of Galois... more In this paper we de ne a Lagois connection, which is a generalization of a special type of Galois connection. We begin by introducing two examples of Lagois connections. We then recall the de nition of Galois connection and some of its properties; next we de ne Lagois connection, establish some of its properties, and compare these with properties of Galois connections; and then we (further) develop examples of Lagois connections. Via these examples it is shown that, as is the case of Galois connections, there is a plethora of Lagois connections. Also it is shown that several fundamental situations in computer science and mathematics that cannot be interpreted in terms of Galois connections naturally t into the theory of Lagois connections.
There are some variations of the definition across different authors. Here it is assumed that Γ i... more There are some variations of the definition across different authors. Here it is assumed that Γ is defined on the whole X (domΓ = X) and it is not permitted Γ(x) = ∅. Usually the domain X and the codomain Y are endowed with a metric; the topologies T1,T2 are the one induced by metrics. In particular X ⊆ Rm and Y ⊆ Rn. However to emphasize that the most important properties of correspondences are topological, definition 1 only requires there to be topologies defined on X and Y .
Fuzzy Sets and Systems, 2017
Motivated by the concept of Sierpinski object for topological systems of S. Vickers, presented re... more Motivated by the concept of Sierpinski object for topological systems of S. Vickers, presented recently by R. Noor and A. K. Srivastava, this paper introduces the Sierpinski object for many-valued topological systems and shows that it has three important properties of the crisp Sierpinski space of general topology.
2016 IEEE 40th Annual Computer Software and Applications Conference (COMPSAC), 2016
ABSTRACT Numerous research results in the areas of software measures and software tools are predi... more ABSTRACT Numerous research results in the areas of software measures and software tools are predicated on a particular programming language, or on some characterizations of a programming language. For example, numerous software measures have been defined only for structured programming languages and several of the reported approaches to program testing define a specific language. However, this proliferation of languages upon which measures and tools are defined makes independent evaluation and comparison of measures and tools problematic.
Workshops in Computing, 1992
Categorical Structures and Their Applications - Proceedings of the North-West European Category Seminar, 2004
Lecture Notes in Computer Science, 1989
Informally we show why a domain with a reasonable collection of properties is a topological space... more Informally we show why a domain with a reasonable collection of properties is a topological space. We then address the question: if one wishes to do programming language semantics in a category of topological spaces instead of the category of complete partial orders (cpos) which category should be used? This question is first considered with respect to objects, i.e., replacing
Journal of Software
Predicting software testability can reduce costs and efforts. Cohesion, as one of software qualit... more Predicting software testability can reduce costs and efforts. Cohesion, as one of software quality metrics, found to be good indicator for software testability. Although there is a good interest in software testability on the class level in the literature, software testability on the package level has not received the same interest. The paper investigates the relationship between a newly proposed package cohesion metric and software testing effort. The empirical analysis used data collected from five Java open source software systems for which JUnit test classes are available. The results show that as good the package cohesion is, as the less testing effort is needed. The stability of the correlations allows us to draw optimistic conclusions about its use as an indicator.
2015 Second International Conference on Trustworthy Systems and Their Applications, 2015
2015 Second International Conference on Trustworthy Systems and Their Applications, 2015
Journal of Systems and Software, 2016
2014 IEEE 38th Annual Computer Software and Applications Conference, 2014
Fuzzy Sets and Systems, 1989
The fuzzy relational model of Buckles and Petty is a rigorous scheme for incorporating non-ideal ... more The fuzzy relational model of Buckles and Petty is a rigorous scheme for incorporating non-ideal or fuzzy information in a relational database. In addition to providing a consistent scheme for representing fuzzy information in the relational structure, the model possesses two critical properties that hold for classical relational databases. These properties are that no two tuples have identical interpretations and each relational operation has a unique result.
In this paper we de ne a Lagois connection, which is a generalization of a special type of Galois... more In this paper we de ne a Lagois connection, which is a generalization of a special type of Galois connection. We begin by introducing two examples of Lagois connections. We then recall the de nition of Galois connection and some of its properties; next we de ne Lagois connection, establish some of its properties, and compare these with properties of Galois connections; and then we (further) develop examples of Lagois connections. Via these examples it is shown that, as is the case of Galois connections, there is a plethora of Lagois connections. Also it is shown that several fundamental situations in computer science and mathematics that cannot be interpreted in terms of Galois connections naturally t into the theory of Lagois connections.
Concepts in web ontologies help machines to understand data through the meanings they hold. Furth... more Concepts in web ontologies help machines to understand
data through the meanings they hold. Furthermore,
learning contexts and topics of web documents also have helped
in better semantic-oriented structuring and retrieval of data on
the web. In this short paper we present a novel approach for
domain-independent open learning of domain concepts, context
and topic of any given web document. Our approach is based on a
computational version of the Construction-Integration (CI) model
of text comprehension. Our proposed system mimics the way
humans learn the meanings of textual units and identify domain
concepts, contexts and topics in the form of semantic networks.
We apply our system on a number of web documents with a
range of topics and domains. The resulting semantic networks
provide a quantitative and qualitative insights into the nature of
the given web documents.