2010 (Spring),
2010
University of Dayton
2010 (Spring), University Of Dayton. Department Of Mathematics
Colloquia
Abstracts of the talks given at the 2010 Spring Colloquium.
Shark Bay Prawn And Scallop Fisheries: Final Review Report,
2010
Department of Primary Industries and Regional Development, Western Australia
Shark Bay Prawn And Scallop Fisheries: Final Review Report, Western Australia. Department Of Fisheries
Fisheries management papers
The Shark Bay Prawn Fishery and Shark Bay Scallop Fishery operate in the same general areas of Shark Bay (although there are some differences in their areas of operation). The interrelationship between trawling activities for the two target species (prawns and scallops) has raised both management challenges and industry conflicts over time. Harvest level settings for each fishery (in the form of effort levels and the timing and/or location of fishing) are independently set, on the basis of recruitment and abundance surveys of each target species. However, each industry sector strongly believes that the interactions between the fisheries arise because …
Dc/Dc Converter For A Small Scale Wind Hydrogen System,
2010
University of Nebraska--Lincoln
Dc/Dc Converter For A Small Scale Wind Hydrogen System, Joel M. Jacobs
Theses, Dissertations, and Student Research from Electrical & Computer Engineering
An electronic converter is designed for an isolated renewable energy system. In this system, energy produced by a small wind turbine is used to extract hydrogen from water. Unique aspects of this application that affect the performance of the converter will be defined. Design considerations of the individual components will be discussed. Calculations on performance and validation of those calculations are also presented. Lastly, an economic analysis of the produced hydrogen will be performed.
Cs 790: Optimizing Compliers For Modern Architectures,
2010
Wright State University - Main Campus
Cs 790: Optimizing Compliers For Modern Architectures, Meilin Liu
Computer Science & Engineering Syllabi
This course studies compiler optimization for modern architectures. Between parsing the input program and generating the target machine code, optimizing compilers perform a wide range of program transformations on a program to improve its performance. In this course we focus on data dependence analysis, program transformations and loop transformations, loop scheduling, and a combination of these optimizing techniques.
Cs 784: Programming Languages,
2010
Wright State University - Main Campus
Cs 784: Programming Languages, Prabhaker Mateti
Computer Science & Engineering Syllabi
Programming paradigms and concepts for high level programming languages. Techniques for formal specification. 4.000 Credit hours. Prerequisites: CS 480/680.
Cs 740: Algorithms, Complexity And The Theory Of Computability,
2010
Wright State University - Main Campus
Cs 740: Algorithms, Complexity And The Theory Of Computability, Pascal Hitzler
Computer Science & Engineering Syllabi
What does it mean to say that some computational problem is intrinsically more difficult than some other problem? How can I claim that I have found a good algorithmic solution? The study of these questions gives rise to an area of Theoretical Computer Science called Complexity Theory, which is based on a systematic and thorough formal study of the complexity of problems with respect to their algorithmic solvability, using Turing machines as main conceptual tool. In this class, we will understand how problem and algorithmic complexity is measured, and discuss some of the main complexity classes arising from this study. …
Cs 214: Visual Basic Programming,
2010
Wright State University - Main Campus
Cs 214: Visual Basic Programming, Michael Ondrasek
Computer Science & Engineering Syllabi
This course provides a general introduction to the fundamentals of object computer programming. Examples from and applications to a broad range of problems are given. No prior knowledge of programming is assumed. However, students should have a familiarity with programming concepts. The concepts covered will be applied in the Visual Basic programming languages. 4 credit hours.
Conformational Dynamics Of Single Pre-Mrna Molecules During In Vitro Splicing,
2010
Trinity University
Conformational Dynamics Of Single Pre-Mrna Molecules During In Vitro Splicing, J. Abelson, M. Blanco, M. A. Ditzler, F. Fuller, P. Aravamudhan, M. Wood, T. Villa, D. E. Ryan, J. A. Pleiss, Corina Maeder, C. Guthrie
Chemistry Faculty Research
The spliceosome is a complex small nuclear RNA (snRNA)-protein machine that removes introns from pre-mRNAs via two successive phosphoryl transfer reactions. The chemical steps are isoenergetic, yet splicing requires at least eight RNA-dependent ATPases responsible for substantial conformational rearrangements. To comprehensively monitor pre-mRNA conformational dynamics, we developed a strategy for single-molecule FRET (smFRET) that uses a small, efficiently spliced yeast pre-mRNA, Ubc4, in which donor and acceptor fluorophores are placed in the exons adjacent to the 5′ and 3′ splice sites. During splicing in vitro, we observed a multitude of generally reversible time-and ATP-dependent conformational transitions of individual pre-mRNAs. The …
Ceg 770-01: Computer Engineering Mathematics,
2010
Wright State University - Main Campus
Ceg 770-01: Computer Engineering Mathematics, Jack Jean
Computer Science & Engineering Syllabi
No abstract provided.
Maximal Class Numbers Of Cm Number Fields,
2010
Trinity University
Maximal Class Numbers Of Cm Number Fields, Ryan C. Daileda, Raju Krishnamoorthy, Anton Malyshev
Mathematics Faculty Research
Fix a totally real number field F of degree at least 2. Under the assumptions of the generalized Riemann hypothesis and Artin's conjecture on the entirety of Artin L-functions, we derive an upper bound (in terms of the discriminant) on the class number of any CM number field with maximal real subfield F. This bound is a refinement of a bound established by Duke in 2001. Under the same hypotheses, we go on to prove that there exist infinitely many CM-extensions of F whose class numbers essentially meet this improved bound and whose Galois groups are as large …
On The Non-Existence Of A Projective (75, 4,12, 5) Set In Pg(3, 7),
2010
University of Richmond
On The Non-Existence Of A Projective (75, 4,12, 5) Set In Pg(3, 7), Aaron C.S. Chan, James A. Davis, Jonathan Jedwab
Math and Computer Science Faculty Publications
We show by a combination of theoretical argument and computer search that if a projective (75, 4, 12, 5) set in PG(3, 7) exists then its automorphism group must be trivial. This corresponds to the smallest open case of a coding problem posed by H. Ward in 1998, concerning the possible existence of an infinite family of projective two-weight codes meeting the Griesmer bound.
Ceg 479/679-01: Computer Animation,
2010
Wright State University - Main Campus
Ceg 479/679-01: Computer Animation, Thomas Wischgoll
Computer Science & Engineering Syllabi
No abstract provided.
Ceg 463/663-01: The Personal Software Development Process,
2010
Wright State University - Main Campus
Ceg 463/663-01: The Personal Software Development Process, John A. Reisner
Computer Science & Engineering Syllabi
In this course, you will learn about more about one particular way to address some of the challenges and issues associated with successful software development. Specifically, you will learn and use the Personal Software Process (PSP), designed to help individual software practitioners become more adept at their craft through the use of project planning, project tracking, defect analysis, review and verification activities, software measurement, and process management. This course-and the PSP-are somewhat unique in that they aim to help software engineers become more successful, not by examining issues associated with large-scale development (as is the case with many software engineering …
Ceg 433-01: Operating Systems,
2010
Wright State University - Main Campus
Ceg 433-01: Operating Systems, Sarah Gothard
Computer Science & Engineering Syllabi
Overview of operating systems internals. File-system usage and design, process usage and control, virtual memory, multi user systems, access control. Course projects use C++ language.
Ceg 429/629-01: Internet Security,
2010
Wright State University - Main Campus
Ceg 429/629-01: Internet Security, Prabhaker Mateti
Computer Science & Engineering Syllabi
Introduction to security issues arising primarily from computer networks. Topics include node and service authentication, address spoofing, hijacking, SYN floods, smurfing, sniffing, routing tricks, and privacy of data en route. Buffer overruns and other exploitation of software development errors. Hardening of operating systems. Intrusion detection. Firewalls. Ethics. Prerequisites: CEG 433
Ceg 220-01: Introduction To C Programming For Engineers,
2010
Wright State University - Main Campus
Ceg 220-01: Introduction To C Programming For Engineers, Jay Dejongh
Computer Science & Engineering Syllabi
This course provides a general introduction to computers as a problem-solving tool using the C programming language. Emphasis is on algorithms and techniques useful to engineers. Topics include data representation, debugging, and program verification. 4 credit hours. Prerequisite: MTH 229 (Calculus I) or EGR 101 (Engineering Mathematics). The course includes a scheduled laboratory section for which you must register.
Ceg 726-01: Pattern Recognition,
2010
Wright State University - Main Campus
Ceg 726-01: Pattern Recognition, Arthur A. Goshtasby
Computer Science & Engineering Syllabi
This course will discuss fundamentals of Pattern Recognition, including supervised learning and clustering.
Ceg 434/634-01: Concurrent Software Design,
2010
Wright State University - Main Campus
Ceg 434/634-01: Concurrent Software Design, Douglas J. Kelly
Computer Science & Engineering Syllabi
This course provides an introduction to concurrent program design in the UNIX environment. Classical problems of synchronization, concurrency, and their solutions are examined through course projects and through readings on operating system design.
Ceg 461/661-01: Object-Oriented Programming And Design,
2010
Wright State University - Main Campus
Ceg 461/661-01: Object-Oriented Programming And Design, Thomas C. Hartrum
Computer Science & Engineering Syllabi
Study of object-oriented design and programming. Programming topics emphasize the core concepts of encapsulation, inheritance, polymorphism, and dynamic binding. Additional topics include class organization, software maintenance, and design of reusable components. There is a project to be implemented in a modem object-oriented language such as Java or C++.
Ceg 221-01: Introduction To C Programming For Engineers,
2010
Wright State University - Main Campus
Ceg 221-01: Introduction To C Programming For Engineers, Jay Dejongh
Computer Science & Engineering Syllabi
This course introduces advanced constructs, algorithms, and data structures in the C programming language. Emphasis is on problem solving and techniques useful to engineers. Topics include functions, array, pointers, structures as well as sorting algorithms, linked lists, complex numbers, and numerical methods applications. 4 credit hours. Prerequisite: CEG220 (Introduction to C Programming for Engineers).
