Rear View of Van Containing the Charles Perry Papers

Charles Perry donated his papers of his time as president of the university to the FIU library where they are held in the archives. An interview, filmed by Richard Pabon and Elizabeth Marsh from FIU’s Broadcast Video Production team, recorded this event.

Elizabeth Marsh and Richard Pabon in the Perry Home

This photo shows a film crew in a house with a partial image of Betty Perry leaning in the doorway. Charles Perry donated his papers of his time as president of the university to the FIU library where they are held in the archives. An interview, filmed by Richard Pabon and Elizabeth Marsh from FIU’s Broadcast Video Production team, recorded this event.

Tom Riley and Althea Silvera Packing the Charles Perry Papers

This photo shows Betty Perry, Tom Riley, and Althea Silvera in the floor packingthe Charles Perry Papers in the Perry Palm Beach home. Charles Perry donated his papers of his time as president of the university to the FIU library where they are held in the archives. An interview, filmed by Richard Pabon and Elizabeth Marsh from FIU’s Broadcast Video Production team, recorded this event. Charles Edward Perry (Chuck), 1937-1999, was the founding president of Florida International University in Miami, Florida. He grew up in Logan County, West Virginia and received his bachelor's and masters's degrees from Bowling Green State University. He married Betty Laird in 1961. In 1969, at the age of 32, Perry was the youngest president of any university in the nation. The name of the university reflects Perry’s desire for a title that would not limit the scope of the institution and would support his vision of having close ties to Latin America. Perry and a founding corps opened FIU to 5,667 students in 1972 with only one large building housing six different schools. Perry left the office of President of FIU in 1976 when the student body had grown to 10,000 students and the university had six buildings, offered 134 different degrees and was fully accredited. Charles Perry died on August 30, 1999 at his home in Rockwall, Texas. He is buried on the FIU campus in front of the Graham Center entrance.

Secure information flow via stripping and fast simulation

Type systems for secure information flow aim to prevent a program from leaking information from H (high) to L (low) variables. Traditionally, bisimulation has been the prevalent technique for proving the soundness of such systems. This work introduces a new proof technique based on stripping and fast simulation, and shows that it can be applied in a number of cases where bisimulation fails. We present a progressive development of this technique over a representative sample of languages including a simple imperative language (core theory), a multiprocessing nondeterministic language, a probabilistic language, and a language with cryptographic primitives. In the core theory we illustrate the key concepts of this technique in a basic setting. A fast low simulation in the context of transition systems is a binary relation where simulating states can match the moves of simulated states while maintaining the equivalence of low variables; stripping is a function that removes high commands from programs. We show that we can prove secure information flow by arguing that the stripping relation is a fast low simulation. We then extend the core theory to an abstract distributed language under a nondeterministic scheduler. Next, we extend to a probabilistic language with a random assignment command; we generalize fast simulation to the setting of discrete time Markov Chains, and prove approximate probabilistic noninterference. Finally, we introduce cryptographic primitives into the probabilistic language and prove computational noninterference, provided that the underling encryption scheme is secure.

Characterization of Atlantic Cod Spawning Habitat and Behavior in Icelandic Coastal Waters

The physical habitat used during spawning may potentially be an important factor affecting reproductive output of broadcast spawning marine fishes, particularly for species with complex, substrate-oriented mating systems and behaviors, such as Atlantic cod Gadus morhua. We characterized the habitat use and behavior of spawning Atlantic cod at two locations off the coast of southwestern Iceland during a 2-d research cruise (15–16 April 2009). We simultaneously operated two different active hydroacoustic gear types, a split beam echosounder and a dual frequency imaging sonar (DIDSON), as well as a remotely operated underwater vehicle (ROV). A total of five fish species were identified through ROV surveys: including cusk Brosme brosme, Atlantic cod, haddock Melanogrammus aeglefinus, lemon sole Microstomus kitt, and Atlantic redfish Sebastes spp. Of the three habitats identified in the acoustic surveys, the transitional habitat between boulder/lava field and sand habitats was characterized by greater fish density and acoustic target strength compared to that of sand or boulder/lava field habitats independently. Atlantic cod were observed behaving in a manner consistent with published descriptions of spawning. Individuals were observed ascending 1–5 m into the water column from the bottom at an average vertical swimming speed of 0.20–0.25 m s−1 and maintained an average spacing of 1.0–1.4 m between individuals. Our results suggest that cod do not choose spawning locations indiscriminately despite the fact that it is a broadcast spawning fish with planktonic eggs that are released well above the seafloor.

Two-bit pattern analysis for quantitative information flow

Protecting confidential information from improper disclosure is a fundamental security goal. While encryption and access control are important tools for ensuring confidentiality, they cannot prevent an authorized system from leaking confidential information to its publicly observable outputs, whether inadvertently or maliciously. Hence, secure information flow aims to provide end-to-end control of information flow. Unfortunately, the traditionally-adopted policy of noninterference, which forbids all improper leakage, is often too restrictive. Theories of quantitative information flow address this issue by quantifying the amount of confidential information leaked by a system, with the goal of showing that it is intuitively "small" enough to be tolerated. Given such a theory, it is crucial to develop automated techniques for calculating the leakage in a system. ^ This dissertation is concerned with program analysis for calculating the maximum leakage, or capacity, of confidential information in the context of deterministic systems and under three proposed entropy measures of information leakage: Shannon entropy leakage, min-entropy leakage, and g-leakage. In this context, it turns out that calculating the maximum leakage of a program reduces to counting the number of possible outputs that it can produce. ^ The new approach introduced in this dissertation is to determine two-bit patterns, the relationships among pairs of bits in the output; for instance we might determine that two bits must be unequal. By counting the number of solutions to the two-bit patterns, we obtain an upper bound on the number of possible outputs. Hence, the maximum leakage can be bounded. We first describe a straightforward computation of the two-bit patterns using an automated prover. We then show a more efficient implementation that uses an implication graph to represent the two- bit patterns. It efficiently constructs the graph through the use of an automated prover, random executions, STP counterexamples, and deductive closure. The effectiveness of our techniques, both in terms of efficiency and accuracy, is shown through a number of case studies found in recent literature. ^

The 128-bit block cipher MARS

The purpose of the research is to investigate the emerging data security methodologies that will work with most suitable applications in the academic, industrial and commercial environments. Of several methodologies considered for Advanced Encryption Standard (AES), MARS (block cipher) developed by IBM, has been selected. Its design takes advantage of the powerful capabilities of modern computers to allow a much higher level of performance than can be obtained from less optimized algorithms such as Data Encryption Standards (DES). MARS is unique in combining virtually every design technique known to cryptographers in one algorithm. The thesis presents the performance of 128-bit cipher flexibility, which is a scaled down version of the algorithm MARS. The cryptosystem used showed equally comparable performance in speed, flexibility and security, with that of the original algorithm. The algorithm is considered to be very secure and robust and is expected to be implemented for most of the applications.