Plackett and Burman analysis to select effective compiler optimizations

Compiler optimizations help to make code run faster at runtime. When the compilation is done before the program is run, compilation time is less of an issue, but how do on-the-fly compilation and optimization impact the overall runtime? If the compiler must compete with the running application for resources, the running application will take more time to complete. This paper investigates the impact of specific compiler optimizations on the overall runtime of an application. A foldover Plackett and Burman design is used to choose compiler optimizations that appear to contribute to shorter overall runtimes. These selected optimizations are compared with the default optimization levels in the Jikes RVM. This method selects optimizations that result in a shorter overall runtime than the default O0, O1, and O2 levels. This shows that careful selection of compiler optimizations can have a significant, positive impact on overall runtime.

Under the Crimson Flag: Fahle Burman's Two Trips to the Michigan Supreme Court

Erick Fahle Burman. a Swedish-born, Finnish-speaking labor and political activist, twice had cases argued on his behalf before the Michigan Supreme Court. In People vs. Burman, Burman, along with nine other defendants, had his conviction affirmed by the court and all ten were forced to pay a fine of $25 each for disturbing the peace. In People vs. Immonen, Burman and his co-defendant, Unto Immonen, had their convictions overturned because of improper evidence being admitted in their lower court trial. Though the conviction was overturned, the two men had already spent several months as prisoners at hard labor in Marquette State Prison located in Michigan's Upper Peninsula. Over twenty-five years separate Burman's two trips to Michigan's high court. On the first occasion, his arrest came less than five years after his arrival as an immigrant to the U. S. On the second occasion, his arrest came less than two years after his return to the state after being away for nearly two decades. On both occasions, Burman was arrested for his involvement with red flags. Though separated by decades, these cases, taken together, are important indicators of the state of Finnish-American radicalism in the years surrounding the red flag incidents and provide interesting insights into the delicacies of political suppression. Examination of these cases within the larger career of Fahle Burman points up his overlooked importance in the history of Finnish-American socialism and communism.

Applications of finite geometries to designs and codes

This dissertation concerns the intersection of three areas of discrete mathematics: finite geometries, design theory, and coding theory. The central theme is the power of finite geometry designs, which are constructed from the points and t-dimensional subspaces of a projective or affine geometry. We use these designs to construct and analyze combinatorial objects which inherit their best properties from these geometric structures. A central question in the study of finite geometry designs is Hamada’s conjecture, which proposes that finite geometry designs are the unique designs with minimum p-rank among all designs with the same parameters. In this dissertation, we will examine several questions related to Hamada’s conjecture, including the existence of counterexamples. We will also study the applicability of certain decoding methods to known counterexamples. We begin by constructing an infinite family of counterexamples to Hamada’s conjecture. These designs are the first infinite class of counterexamples for the affine case of Hamada’s conjecture. We further demonstrate how these designs, along with the projective polarity designs of Jungnickel and Tonchev, admit majority-logic decoding schemes. The codes obtained from these polarity designs attain error-correcting performance which is, in certain cases, equal to that of the finite geometry designs from which they are derived. This further demonstrates the highly geometric structure maintained by these designs. Finite geometries also help us construct several types of quantum error-correcting codes. We use relatives of finite geometry designs to construct infinite families of q-ary quantum stabilizer codes. We also construct entanglement-assisted quantum error-correcting codes (EAQECCs) which admit a particularly efficient and effective error-correcting scheme, while also providing the first general method for constructing these quantum codes with known parameters and desirable properties. Finite geometry designs are used to give exceptional examples of these codes.