Bruce Mull - Academia.edu (original) (raw)

Papers by Bruce Mull

Research paper thumbnail of A.T.White, Enumeration 2-cell imbeddings of connected graphs,Proc.Amer.Math.Soc

ABSTRACT. A systematic approach is developed for enumerating congruence classes of 2-cell imbeddi... more ABSTRACT. A systematic approach is developed for enumerating congruence classes of 2-cell imbeddings of connected graphs on closed orientable 2-manifolds. The method is applied to the wheel graphs and to the complete graphs. Congruence class genus polynomials and congruence class imbedding polynomials are introduced, to summarize important information refining the enumeration. 1. Introduction. An

Research paper thumbnail of A.T.White, Enumeration 2-cell imbeddings of connected graphs,Proc.Amer.Math.Soc

ABSTRACT. A systematic approach is developed for enumerating congruence classes of 2-cell imbeddi... more ABSTRACT. A systematic approach is developed for enumerating congruence classes of 2-cell imbeddings of connected graphs on closed orientable 2-manifolds. The method is applied to the wheel graphs and to the complete graphs. Congruence class genus polynomials and congruence class imbedding polynomials are introduced, to summarize important information refining the enumeration. 1. Introduction. An

Research paper thumbnail of Uniform strong 2-cell imbeddings of bridgeless graphs

Discrete Mathematics, Aug 1, 1995

A strong 2-cell imbedding of a graph G is an open 2-cell imbedding of G in which the image of eve... more A strong 2-cell imbedding of a graph G is an open 2-cell imbedding of G in which the image of every edge of G separates distinct regions of the imbedding. An imbedding is uniform if every region is bounded by the same number of sides. A k-pattern is a uniform, strong 2-cell ...

Research paper thumbnail of Re-Engineering BLUE Financial System Using Round-Trip Engineering and Java Language Conversion Assistant

Conversion of legacy software applications into a new technology platform is common in many of to... more Conversion of legacy software applications into a new technology platform is common in many of today's ICT (Information and Communication Technologies) companies. The objective is to improve performance, as a result of modeling important aspects and features through the development of conversion technologies. Much focus has been made on devis- ing efficient methodologies in software architecture research. This paper presents a combination of round-trip engineering (RTE) and use of JAVA Language Conversion Assistant (JLCA) to migrate legacy software applications developed in multiple programming languages into a uniform object-oriented platform. This re-engineering process is applied to MB-Risk Management's BLUETM Financial System software. An automated process is derived to migrate code from VJ++ (Visual JAVATM), C, and C++ (as used in BLUETM) to a consistent C# platform. The results of conversion show an overall efficiency of 93% of full code conversion for this automated p...

Research paper thumbnail of Enumerating 2Cell Imbeddings of Connected Graphs

Proceedings of The American Mathematical Society, 1988

A systematic approach is developed for enumerating congruence classes of 2-cell imbeddings of con... more A systematic approach is developed for enumerating congruence classes of 2-cell imbeddings of connected graphs on closed orientable 2-manifolds. The method is applied to the wheel graphs and to the complete graphs. Congruence class genus polynomials and congruence class imbedding polynomials are introduced, to summarize important information refining the enumeration.

Research paper thumbnail of Re-Engineering BLUE Financial System Using Round-Trip Engineering and JAVA Language Conversion Assistant

Serp, 2006

ABSTRACT Conversion of legacy software applications into a new technology platform is common in m... more ABSTRACT Conversion of legacy software applications into a new technology platform is common in many of today's ICT (Information and Communication Technologies) companies. The objective is to improve performance, as a result of modeling important aspects and features through the development of conversion technologies. Much focus has been made on devis- ing efficient methodologies in software architecture research. This paper presents a combination of round-trip engineering (RTE) and use of JAVA Language Conversion Assistant (JLCA) to migrate legacy software applications developed in multiple programming languages into a uniform object-oriented platform. This re-engineering process is applied to MB-Risk Management's BLUETM Financial System software. An automated process is derived to migrate code from VJ++ (Visual JAVATM), C, and C++ (as used in BLUETM) to a consistent C# platform. The results of conversion show an overall efficiency of 93% of full code conversion for this automated process.

Research paper thumbnail of A classification hierarchy for 2-cell imbeddings of bridgeless graphs

Two types of cellular imbeddings have been studied in the past—open and closed 2-cell imbeddings.... more Two types of cellular imbeddings have been studied in the past—open and closed 2-cell imbeddings. We introduce a third class of cellular imbeddings, the strong 2-cell imbeddings. When restricted to bridgeless graphs, the strong 2-cell imbeddings, together with the open and closed 2-cell imbeddings, form a hierarchy of cellular imbeddings. We use strong 2-cell imbeddings to generalize a result of J. L. Gross and T. W. Tucker [Topological graph theory (1987; Zbl 0621.05013)] and give sharp characterizations of cellular imbeddings based only on the maximum region size of the imbedding.

Research paper thumbnail of Re-Engineering BLUE Financial System Using Round-Trip Engineering and Java Language Conversion Assistant

Software Engineering Research and Practice, 2006

Conversion of legacy software applications into a new technology platform is common in many of to... more Conversion of legacy software applications into a new technology platform is common in many of today's ICT (Information and Communication Technologies) companies. The objective is to improve performance, as a result of modeling important aspects and features through the development of conversion technologies. Much focus has been made on devis- ing efficient methodologies in software architecture research. This paper presents

Research paper thumbnail of Enumerating <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mn>2</mn></mrow><annotation encoding="application/x-tex">2</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6444em;"></span><span class="mord">2</span></span></span></span>-cell imbeddings of connected graphs

Proceedings of the American Mathematical Society, 1988

A systematic approach is developed for enumerating congruence classes of 2-cell imbeddings of con... more A systematic approach is developed for enumerating congruence classes of 2-cell imbeddings of connected graphs on closed orientable 2-manifolds. The method is applied to the wheel graphs and to the complete graphs. Congruence class genus polynomials and congruence class imbedding polynomials are introduced, to summarize important information refining the enumeration.

Research paper thumbnail of Uniform strong 2-cell imbeddings of bridgeless graphs

Discrete Mathematics, 1995

A strong 2-cell imbedding of a graph G is an open 2-cell imbedding of G in which the image of eve... more A strong 2-cell imbedding of a graph G is an open 2-cell imbedding of G in which the image of every edge of G separates distinct regions of the imbedding. An imbedding is uniform if every region is bounded by the same number of sides. A k-pattern is a uniform, strong 2-cell ...

Research paper thumbnail of Enumerating the orientable 2-cell imbeddings of complete bipartite graphs

Journal of Graph Theory, 1999

ABSTRACT Thesis (Ph. D.)--Western Michigan University, 1990. Includes bibliographical references ... more ABSTRACT Thesis (Ph. D.)--Western Michigan University, 1990. Includes bibliographical references (leaves 209-210).

Research paper thumbnail of A.T.White, Enumeration 2-cell imbeddings of connected graphs,Proc.Amer.Math.Soc

ABSTRACT. A systematic approach is developed for enumerating congruence classes of 2-cell imbeddi... more ABSTRACT. A systematic approach is developed for enumerating congruence classes of 2-cell imbeddings of connected graphs on closed orientable 2-manifolds. The method is applied to the wheel graphs and to the complete graphs. Congruence class genus polynomials and congruence class imbedding polynomials are introduced, to summarize important information refining the enumeration. 1. Introduction. An

Research paper thumbnail of A.T.White, Enumeration 2-cell imbeddings of connected graphs,Proc.Amer.Math.Soc

ABSTRACT. A systematic approach is developed for enumerating congruence classes of 2-cell imbeddi... more ABSTRACT. A systematic approach is developed for enumerating congruence classes of 2-cell imbeddings of connected graphs on closed orientable 2-manifolds. The method is applied to the wheel graphs and to the complete graphs. Congruence class genus polynomials and congruence class imbedding polynomials are introduced, to summarize important information refining the enumeration. 1. Introduction. An

Research paper thumbnail of Uniform strong 2-cell imbeddings of bridgeless graphs

Discrete Mathematics, Aug 1, 1995

A strong 2-cell imbedding of a graph G is an open 2-cell imbedding of G in which the image of eve... more A strong 2-cell imbedding of a graph G is an open 2-cell imbedding of G in which the image of every edge of G separates distinct regions of the imbedding. An imbedding is uniform if every region is bounded by the same number of sides. A k-pattern is a uniform, strong 2-cell ...

Research paper thumbnail of Re-Engineering BLUE Financial System Using Round-Trip Engineering and Java Language Conversion Assistant

Conversion of legacy software applications into a new technology platform is common in many of to... more Conversion of legacy software applications into a new technology platform is common in many of today's ICT (Information and Communication Technologies) companies. The objective is to improve performance, as a result of modeling important aspects and features through the development of conversion technologies. Much focus has been made on devis- ing efficient methodologies in software architecture research. This paper presents a combination of round-trip engineering (RTE) and use of JAVA Language Conversion Assistant (JLCA) to migrate legacy software applications developed in multiple programming languages into a uniform object-oriented platform. This re-engineering process is applied to MB-Risk Management's BLUETM Financial System software. An automated process is derived to migrate code from VJ++ (Visual JAVATM), C, and C++ (as used in BLUETM) to a consistent C# platform. The results of conversion show an overall efficiency of 93% of full code conversion for this automated p...

Research paper thumbnail of Enumerating 2Cell Imbeddings of Connected Graphs

Proceedings of The American Mathematical Society, 1988

A systematic approach is developed for enumerating congruence classes of 2-cell imbeddings of con... more A systematic approach is developed for enumerating congruence classes of 2-cell imbeddings of connected graphs on closed orientable 2-manifolds. The method is applied to the wheel graphs and to the complete graphs. Congruence class genus polynomials and congruence class imbedding polynomials are introduced, to summarize important information refining the enumeration.

Research paper thumbnail of Re-Engineering BLUE Financial System Using Round-Trip Engineering and JAVA Language Conversion Assistant

Serp, 2006

ABSTRACT Conversion of legacy software applications into a new technology platform is common in m... more ABSTRACT Conversion of legacy software applications into a new technology platform is common in many of today&#39;s ICT (Information and Communication Technologies) companies. The objective is to improve performance, as a result of modeling important aspects and features through the development of conversion technologies. Much focus has been made on devis- ing efficient methodologies in software architecture research. This paper presents a combination of round-trip engineering (RTE) and use of JAVA Language Conversion Assistant (JLCA) to migrate legacy software applications developed in multiple programming languages into a uniform object-oriented platform. This re-engineering process is applied to MB-Risk Management&#39;s BLUETM Financial System software. An automated process is derived to migrate code from VJ++ (Visual JAVATM), C, and C++ (as used in BLUETM) to a consistent C# platform. The results of conversion show an overall efficiency of 93% of full code conversion for this automated process.

Research paper thumbnail of A classification hierarchy for 2-cell imbeddings of bridgeless graphs

Two types of cellular imbeddings have been studied in the past—open and closed 2-cell imbeddings.... more Two types of cellular imbeddings have been studied in the past—open and closed 2-cell imbeddings. We introduce a third class of cellular imbeddings, the strong 2-cell imbeddings. When restricted to bridgeless graphs, the strong 2-cell imbeddings, together with the open and closed 2-cell imbeddings, form a hierarchy of cellular imbeddings. We use strong 2-cell imbeddings to generalize a result of J. L. Gross and T. W. Tucker [Topological graph theory (1987; Zbl 0621.05013)] and give sharp characterizations of cellular imbeddings based only on the maximum region size of the imbedding.

Research paper thumbnail of Re-Engineering BLUE Financial System Using Round-Trip Engineering and Java Language Conversion Assistant

Software Engineering Research and Practice, 2006

Conversion of legacy software applications into a new technology platform is common in many of to... more Conversion of legacy software applications into a new technology platform is common in many of today's ICT (Information and Communication Technologies) companies. The objective is to improve performance, as a result of modeling important aspects and features through the development of conversion technologies. Much focus has been made on devis- ing efficient methodologies in software architecture research. This paper presents

Research paper thumbnail of Enumerating <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mn>2</mn></mrow><annotation encoding="application/x-tex">2</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6444em;"></span><span class="mord">2</span></span></span></span>-cell imbeddings of connected graphs

Proceedings of the American Mathematical Society, 1988

A systematic approach is developed for enumerating congruence classes of 2-cell imbeddings of con... more A systematic approach is developed for enumerating congruence classes of 2-cell imbeddings of connected graphs on closed orientable 2-manifolds. The method is applied to the wheel graphs and to the complete graphs. Congruence class genus polynomials and congruence class imbedding polynomials are introduced, to summarize important information refining the enumeration.

Research paper thumbnail of Uniform strong 2-cell imbeddings of bridgeless graphs

Discrete Mathematics, 1995

A strong 2-cell imbedding of a graph G is an open 2-cell imbedding of G in which the image of eve... more A strong 2-cell imbedding of a graph G is an open 2-cell imbedding of G in which the image of every edge of G separates distinct regions of the imbedding. An imbedding is uniform if every region is bounded by the same number of sides. A k-pattern is a uniform, strong 2-cell ...

Research paper thumbnail of Enumerating the orientable 2-cell imbeddings of complete bipartite graphs

Journal of Graph Theory, 1999

ABSTRACT Thesis (Ph. D.)--Western Michigan University, 1990. Includes bibliographical references ... more ABSTRACT Thesis (Ph. D.)--Western Michigan University, 1990. Includes bibliographical references (leaves 209-210).