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

Digital Commons Network™

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

2011

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 14041 - 14070 of 17417

Full-Text Articles in Entire DC Network

Ceg 468/668: Managing The Software Development Process, John A. Reisner Jan 2011

Ceg 468/668: Managing The Software Development Process, John A. Reisner

Computer Science & Engineering Syllabi

This course will cover some of the challenges and issues associated with software project management. Emphasis will occur on two fronts: (1) the software project manager's view (that is, what considerations and obstacles confront project managers during software development), and (2) the organizational view (that is, how organizations can foster a climate where software project management is performed effectively throughout an organization).

Go to article

Ceg 498: Design Experience, Thomas C. Hartrum Jan 2011

Ceg 498: Design Experience, Thomas C. Hartrum

Computer Science & Engineering Syllabi

CEG 498 (Design Experience) is a summative computer engineering design project course that builds upon previous engineering, science, mathematics and communications course work. CEG 498 projects are a minimum of two quarters in length and must be completed in groups of at least three students. Projects are selected under the guidance of the course instructor and are tailored to both student interest and formal classroom preparation. Students are evaluated both on their individual contributions as recorded in a graded engineering journal and on the quality of their collective efforts as reflected in g10up generated products.

Go to article

Ceg/Mth 416/616: Matrix Computations, Ronald F. Taylor Jan 2011

Ceg/Mth 416/616: Matrix Computations, Ronald F. Taylor

Computer Science & Engineering Syllabi

This course is a survey of numerical methods in linear algebra for application to problems in engineering and the sciences. Emphasis is on using modern software tools on high performance computing systems. This course covers the mathematics of linear equations, eigenvalue problems, singular value decomposition, and least squares. Material covered will be relevant to applications areas such as structural analysis, heat transfer, neural networks, mechanical vibrations, and image processing in biomedical engineering.

Go to article

Ceg 720: Computer Architecture I, Soon M. Chung Jan 2011

Ceg 720: Computer Architecture I, Soon M. Chung

Computer Science & Engineering Syllabi

Review of sequential computer architecture and study of parallel computers. Topics include memory hierarchy, reduced instruction set computer, pipeline processing, multiprocessing, various parallel computers, interconnection networks, and fault-tolerant computing.

Go to article

Cs 400/600-02: Data Structures And Algorithms, Sarah Gothard Jan 2011

Cs 400/600-02: Data Structures And Algorithms, Sarah Gothard

Computer Science & Engineering Syllabi

Study of the implementation of data structures and control structures in professional computer programs. Introduction to the fundamentals of complexity and analysis. Study of common standard problems and solutions (e.g., transitive closure and critical path). Emphasis on high-level language software design.

Go to article

Cs 470/670-01: Systems Simulation, Thomas C. Hartrum Jan 2011

Cs 470/670-01: Systems Simulation, Thomas C. Hartrum

Computer Science & Engineering Syllabi

Introduction to simulation and comparison with other techniques. Discrete simulation models. Introduction to queuing theory and stochastic processes. Comparison of simulation languages. Simulation methodology and selected applications.

Go to article

Ceg 739: Medical Image Analysis, Arthur A. Goshtasby Jan 2011

Ceg 739: Medical Image Analysis, Arthur A. Goshtasby

Computer Science & Engineering Syllabi

This course discusses applications of image analysis in medical imaging. Methods for analysis of both 2-D and 3-D (volumetric} images are covered.

Go to article

Cs 205-01: Introduction To Computers And Office Productivity Software, Terri Bauer Jan 2011

Cs 205-01: Introduction To Computers And Office Productivity Software, Terri Bauer

Computer Science & Engineering Syllabi

Focus on learning MS Office software applications including intermediate word processing, spreadsheets, database and presentation graphics using a case study approach where critical thinking and problem solving skills are required. Computer concepts are integrated throughout the course to provide an understanding of the basics of computing, the latest technological advances and how they are used in industry. Ethics and issues encountered in business are discussed to challenge students on societal impact of technology.

Go to article

Cs 340-01: Programming Language Workshop In C#, Krishnaprasad Thirunarayan Jan 2011

Cs 340-01: Programming Language Workshop In C#, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course is designed as a self-study in C#. You are expected to learn the language and solve a set of programming problems assigned to you using MS Visual Studio .NET. There are no exams. We officially meet only once in the quarter.

Go to article

Ceg 360/560 Ee 451/651: Digital System Design, Travis E. Doom Jan 2011

Ceg 360/560 Ee 451/651: Digital System Design, Travis E. Doom

Computer Science & Engineering Syllabi

Design of digital systems. Topics include flip-flops, registers, counters, programmable logic devices, memory devices, register-level design, and microcomputer system organization. Students must show competency in the design of digital systems.

Go to article

Cs 714-01: Machine Learning, Shaojun Wang Jan 2011

Cs 714-01: Machine Learning, Shaojun Wang

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Ceg 433/633: Operating Systems, Thomas Wischgoll Jan 2011

Ceg 433/633: Operating Systems, Thomas Wischgoll

Computer Science & Engineering Syllabi

The purpose of the class is for everyone to understand the issues involved with the management of resources in multi-user computer systems. Emphasis is on problems of file-system design, process scheduling, memory allocation, protection, and tools needed for solutions. Course projects use the C/C++ language and include the design of portions of an operating system.

Go to article

Ceg 460/660: Introduction To Software Computer Engineering, Thomas C. Hartrum Jan 2011

Ceg 460/660: Introduction To Software Computer Engineering, Thomas C. Hartrum

Computer Science & Engineering Syllabi

This course is concerned with the techniques of designing and constructing large programs. Some of the required basic concepts necessarily have to be developed using small programs as examples. To this extent, we also study programming-in-the-small. The overall objectives are to present an overview of issues in the development of software, to discuss terminology, to illustrate via example case studies, and to give sufficiently detailed advice on how to develop quality software. Hands-on experience is emphasized through the use of homework and a class project.

Go to article

Ceg 730: Distributed Computing Principles, Prabhaker Mateti Jan 2011

Ceg 730: Distributed Computing Principles, Prabhaker Mateti

Computer Science & Engineering Syllabi

This course is about the foundations and principles involved in distributed systems with an introduction to recent systems and languages. The next course (CEG 830) concentrates on systems related issues, and on the design of distributed systems and applications.

Go to article

Ceg 750: Microprocessor, Jack Jean Jan 2011

Ceg 750: Microprocessor, Jack Jean

Computer Science & Engineering Syllabi

Design and implement an MC6812 computer system based on an Axiom CSM-12C32 board that allows the loading of a 6812 application program from a PC so as to reconfigure the system as both an analog waveform storage scope and a digital logic analyzer.

Go to article

Ceg 411/611: Microprocessor-Based System Design, Jack Jean Jan 2011

Ceg 411/611: Microprocessor-Based System Design, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Ceg 750: Microprocessor, Jack Jean Jan 2011

Ceg 750: Microprocessor, Jack Jean

Computer Science & Engineering Syllabi

Design and implement an MC6812 computer system based on an Axiom CSM-12C32 board that allows the loading of a 6812 application program from a PC so as to reconfigure the system as both an analog waveform storage scope and a digital logic analyzer.

Go to article

Ceg 404/604: Wireless Sensor Networks, Bin Wang Jan 2011

Ceg 404/604: Wireless Sensor Networks, Bin Wang

Computer Science & Engineering Syllabi

In this course we will provide an introduction to Wireless Sensor Networks (WSN) and cover latest topics in WSNs. The goal of this course is to give an overview of fundamental problems in the area of WSNs. We will discuss existing solutions for some of these problems.

Go to article

Linguistics As Structure In Computer Animation: Toward A More Effective Synthesis Of Brow Motion In American Sign Language, Rosalee Wolfe, Peter Cook, John C. Mcdonald, Jerry Schnepp Jan 2011

Linguistics As Structure In Computer Animation: Toward A More Effective Synthesis Of Brow Motion In American Sign Language, Rosalee Wolfe, Peter Cook, John C. Mcdonald, Jerry Schnepp

Visual Communications and Technology Education Faculty Publications

Computer-generated three-dimensional animation holds great promise for synthesizing utterances in American Sign Language (ASL) that are not only grammatical, but well tolerated by members of the Deaf community. Unfortunately, animation poses several challenges stemming from the necessity of grappling with massive amounts of data. However, the linguistics of ASL can aid in surmounting the challenge by providing structure and rules for organizing animation data. An exploration of the linguistic and extra linguistic behavior of the brows from an animator’s viewpoint yields a new approach for synthesizing nonmanuals that differs from the conventional animation of anatomy and instead offers a different …

Go to article

Essays On Hedge Fund Replication: Methodological Assessment And Development Of The Factor Approach, Nonlinear Modeling And Policy Perspectives, Guillaume Weisang Jan 2011

Essays On Hedge Fund Replication: Methodological Assessment And Development Of The Factor Approach, Nonlinear Modeling And Policy Perspectives, Guillaume Weisang

2011

This dissertation is concerned with hedge fund replication, a subject of a practical and theoretical importance, both from an investment and a risk management point of view. One of our goals is to extend known methodologies in order to enhance our understanding of an industry that is known for its secrecy and its lack of transparency. A second goal is to contribute to the quantitative finance literature with improved techniques for hedge fund replication. Hedge fund replication (HFR) is approached from the methodological as well as from practical and regulatory perspectives. The first two chapters provide the motivation and the …

Go to article

Encapsulated Energy-Transfer Cassettes With Extremely Well Resolved Fluorescent Outputs, Yuichiro Ueno, Jiney Jose, Aurore Loudet, Cesar Perez-Bolivar, Pavel Anzenbacher Jr., Kevin Burgess Jan 2011

Encapsulated Energy-Transfer Cassettes With Extremely Well Resolved Fluorescent Outputs, Yuichiro Ueno, Jiney Jose, Aurore Loudet, Cesar Perez-Bolivar, Pavel Anzenbacher Jr., Kevin Burgess

Chemistry Faculty Publications

This paper concerns the development of water-compatible fluorescent imaging probes with tunable photonic properties that can be excited at a single wavelength. Bichromophoric cassettes 1a-1c consisting of a BODIPY donor and a cyanine acceptor were prepared using a simple synthetic route, and their photophysical properties were investigated. Upon excitation of the BODIPY moiety at 488 nm the excitation energy is transferred through an acetylene bridge to the cyanine dye acceptor, which emits light at approximately 600, 700, and 800 nm, i.e., with remarkable dispersions. This effect is facilitated by efficient energy transfer that gives a "quasi-Stokes" shift between 86 and …

Go to article

Conversations From The Classroom: Reflections On Feminist Music Therapy Pedagogy In Teaching Music Therapy, Nicole Hahna Jan 2011

Conversations From The Classroom: Reflections On Feminist Music Therapy Pedagogy In Teaching Music Therapy, Nicole Hahna

Expressive Therapies Dissertations

Four music therapy educators participated in semi-structured, in-depth interviews as part of a qualitative study. The purpose of this study was to explore the phenomena of feminist pedagogy as experienced by music therapy educators using phenomenological inquiry. The study examined the following research questions: (a) do music therapy educators use feminist music therapy pedagogy in teaching music therapy, (b) if so, how do they use feminist music therapy pedagogy, (c) what is their experience in using feminist music therapy pedagogy, and (d) how do feminist music therapy educators define their use of feminist pedagogy in undergraduate and graduate music therapy …

Go to article

A Multi-Agent Prediction Market Based On Boolean Network Evolution, Janyl Jumadinova, Mihaela Teodora Matache, Prithviraj Dasgupta Jan 2011

A Multi-Agent Prediction Market Based On Boolean Network Evolution, Janyl Jumadinova, Mihaela Teodora Matache, Prithviraj Dasgupta

Mathematics Faculty Proceedings & Presentations

—Prediction markets have been shown to be a useful tool in forecasting the outcome of future events by aggregating public opinion about the events’ outcome. Previous research on prediction markets has mostly analyzed the prediction markets by building complex analytical models. In this paper, we posit that simpler yet powerful Boolean rules can be used to adequately describe the operations of a prediction market. We have used a multi-agent based prediction market where Boolean network based rules are used to capture the evolution of the beliefs of the market’s participants, as well as to aggregate the prices in the market. …

Go to article

Composition Operators Whose Symbols Have Orthogonal Powers, Valentin Matache Jan 2011

Composition Operators Whose Symbols Have Orthogonal Powers, Valentin Matache

Mathematics Faculty Publications

Composition operators on the Hilbert Hardy space H2 whose symbols are analytic selfmaps of the open unit disk having orthogonal powers are considered. The spectra and essential spectra of such operators are described. In the general case of an arbitrary analytic selfmap of the open unit disk, it is proved that the composition operator induced by that map has essential spectral radius less than 1 if and only if the map under consideration is a non–inner map with a fixed point in the unit disk. The canonical decomposition of a non–unitary composition contraction is determined.

Go to article

Boolean Modeling Of Biochemical Networks, Tomáš Helikar, Naomi Kochi, John Konvalina, Jim A. Rogers Jan 2011

Boolean Modeling Of Biochemical Networks, Tomáš Helikar, Naomi Kochi, John Konvalina, Jim A. Rogers

Mathematics Faculty Publications

The use of modeling to observe and analyze the mechanisms of complex biochemical network function is becoming an important methodological tool in the systems biology era. Number of different approaches to model these networks have been utilized-- they range from analysis of static connection graphs to dynamical models based on kinetic interaction data. Dynamical models have a distinct appeal in that they make it possible to observe these networks in action, but they also pose a distinct challenge in that they require detailed information describing how the individual components of these networks interact in living cells. Because this level of …

Go to article

Termination Of Grounding Is Not Preserved By Strongly Equivalent Transformations, Yuliya Lierler, Vladimir Lifschitz Jan 2011

Termination Of Grounding Is Not Preserved By Strongly Equivalent Transformations, Yuliya Lierler, Vladimir Lifschitz

Computer Science Faculty Proceedings & Presentations

The operation of a typical answer set solver begins with grounding—replacing the given program with a program without variables that has the same answer sets. When the given program contains function symbols, the process of grounding may not terminate. In this note we give an example of a pair of consistent, strongly equivalent programs such that one of them can be grounded by LPARSE, DLV, and gringo, and the other cannot.

Go to article

Weighted-Sequence Problem: Asp Vs Casp And Declarative Vs Problem-Oriented Solving, Yuliya Lierler, Shaden Smith, Miroslaw Truszczyński, Alex Westlund Jan 2011

Weighted-Sequence Problem: Asp Vs Casp And Declarative Vs Problem-Oriented Solving, Yuliya Lierler, Shaden Smith, Miroslaw Truszczyński, Alex Westlund

Computer Science Faculty Proceedings & Presentations

Search problems with large variable domains pose a challenge to current answer-set programming (ASP) systems as large variable domains make grounding take a long time, and lead to large ground theories that may make solving infeasible. To circumvent the “grounding bottleneck” researchers proposed to integrate constraint solving techniques with ASP in an approach called constraint ASP (CASP). In the paper, we evaluate an ASP system CLINGO and a CASP system CLINGCON on a handcrafted problem involving large integer domains that is patterned after the database task of determining the optimal join order. We find that search methods used by CLINGO …

Go to article

A Transition System For Ac Language Algorithms, Yuliya Lierler, Yaunlin Zhang Jan 2011

A Transition System For Ac Language Algorithms, Yuliya Lierler, Yaunlin Zhang

Computer Science Faculty Proceedings & Presentations

Recently a logic programming language AC was proposed by Mellarkod et al. (2008) to integrate answer set programming (ASP) and constraint logic programming. In a similar vein, Gebser et al. (2009) proposed a CLINGCON language integrating ASP and finite domain constraints. A distinguishing feature of these languages is their capacity to allow new efficient inference algorithms that combine traditional ASP procedures and other efficient methods in constraint programming. In this paper we show that a transition system introduced by Nieuwenhuis et al. (2006) can be extended to model the “hybrid” ACSOLVER algorithm, by Mellarkod et al., designed for processing a …

Go to article

Testing A Tpack-Based Technology Integration Observation Instrument, Mark Hofer, Neal Grandgenett, Judith B. Harris, Kathy Swan Jan 2011

Testing A Tpack-Based Technology Integration Observation Instrument, Mark Hofer, Neal Grandgenett, Judith B. Harris, Kathy Swan

Teacher Education Faculty Proceedings & Presentations

Teachers’ knowledge for technology integration – conceptualized as technological pedagogical content knowledge, or TPACK (Mishra & Koehler 2006) – is difficult to discern, much less assess. Given the complexity, situatedness and interdependence of the types of knowledge represented by the TPACK construct, well-triangulated ways to assess demonstrated technology integration knowledge are needed. In 2009, three of the authors created and tested a rubric that was found to be a valid and reliable instrument to assess the TPACK evident in teachers’ written lesson plans (Harris, Grandgenett & Hofer 2010). We have now also developed a TPACK-based observation rubric that testing has …

Go to article

Evaluation Of Essential Genes In Correlation Networks Using Measures Of Centrality, Kathryn Dempsey Cooper, Hesham Ali Jan 2011

Evaluation Of Essential Genes In Correlation Networks Using Measures Of Centrality, Kathryn Dempsey Cooper, Hesham Ali

Interdisciplinary Informatics Faculty Proceedings & Presentations

Correlation networks are emerging as powerful tools for modeling relationships in high-throughput data such as gene expression. Other types of biological networks, such as protein-protein interaction networks, are popular targets of study in network theory, and previous analysis has revealed that network structures identified using graph theoretic techniques often relate to certain biological functions. Structures such as highly connected nodes and groups of nodes have been found to correspond to essential genes and protein complexes, respectively. The correlation network, which measures the level of co-variation of gene expression levels, shares some structural properties with other types of biological networks. We …

Go to article

First Prev Next Last