Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network™

Open Access. Powered by Scholars. Published by Universities.®

PDF

Series

2006

Computer Sciences

Butler University

Articles 1 - 7 of 7

Full-Text Articles in Entire DC Network

The Pseudosquares Prime Sieve, Jonathan P. Sorenson Jan 2006

The Pseudosquares Prime Sieve, Jonathan P. Sorenson

Scholarship and Professional Work - LAS

We present the pseudosquares prime sieve, which finds all primes up to n.

Go to article

Spanning Trails Containing Given Edges, Weiqi Luo, Zhi-Hong Chen, Wei-Guo Chen Jan 2006

Spanning Trails Containing Given Edges, Weiqi Luo, Zhi-Hong Chen, Wei-Guo Chen

Scholarship and Professional Work - LAS

A graph G is Eulerian-connected if for any u and v in V ( G ) , G has a spanning ( u , v ) -trail. A graph G is edge-Eulerian-connected if for any e ′ and e ″ in E ( G ) , G has a spanning ( e ′ , e ″ ) -trail. For an integer r ⩾ 0 , a graph is called r -Eulerian-connected if for any X ⊆ E ( G ) with | X | ⩽ r , and for any u , v ∈ V ( G ) , G …

Go to article

Spanning Eulerian Subgraphs In Claw-Free Graphs, Zhi-Hong Chen, Hong-Jian Lai, Weiqi Luo, Yehomg Shao Jan 2006

Spanning Eulerian Subgraphs In Claw-Free Graphs, Zhi-Hong Chen, Hong-Jian Lai, Weiqi Luo, Yehomg Shao

Scholarship and Professional Work - LAS

A graph is claw-free if it has no induced K 1,3, subgraph. A graph is essential 4-edge-connected if removing at most three edges, the resulting graph has at most one component having edges. In this note, we show that every essential 4-edge-connected claw free graph has a spanning Eulerian subgraph with maximum degree at most 4.

Go to article

A Metrics Tool For Multi-Language .Net Software Applications, Panos K. Linos, G. Mcgullogh, E. Maier Jan 2006

A Metrics Tool For Multi-Language .Net Software Applications, Panos K. Linos, G. Mcgullogh, E. Maier

Scholarship and Professional Work - LAS

The measurement of software metrics at the MSIL (Microsoft Intermediate Language) level can be as effective as measuring such metrics at the level of each individual language (e.g. VB, Java, C# etc.).

Go to article

Fast Bounds On The Distribution Of Smooth Numbers, Scott T. Parsell, Jonathan P. Sorenson Jan 2006

Fast Bounds On The Distribution Of Smooth Numbers, Scott T. Parsell, Jonathan P. Sorenson

Scholarship and Professional Work - LAS

In this paper we present improvements to Bernstein’s algorithm, which finds rigorous upper and lower bounds for (x, y).

Go to article

Crafting A Measurement Framework Using A Goal-Question-Metric Approach, Panos K. Linos Jan 2006

Crafting A Measurement Framework Using A Goal-Question-Metric Approach, Panos K. Linos

Scholarship and Professional Work - LAS

A discussion on assessing successful Software Engineering Measurement (SEM) programs.

Go to article

Comprehension And Maintenance Of Large Scale Multi-Language Software Applications: Open Issues And Challenges, Kostas Kontogiannis, Panos K. Linos, Kenny Wong Jan 2006

Comprehension And Maintenance Of Large Scale Multi-Language Software Applications: Open Issues And Challenges, Kostas Kontogiannis, Panos K. Linos, Kenny Wong

Scholarship and Professional Work - LAS

During the last decade, the number of software applications that have been deployed as a collection of components implemented in different programming languages and paradigms has increased considerably. When such applications are maintained, traditional program comprehension and reengineering techniques may not be adequate. In this context, this working session aims to stimulate discussion around key issues relating to the comprehension, reengineering, and maintenance of multi-language software applications. Such issues include, but are not limited to, the formalization, management, exploration, and presentation of multi-language program dependencies, as well as the development of practical toolsets for automating and easing the comprehension and …

Go to article