Computer Sciences Commons^™

Parallel Sorting On Multi-Core Architecture, Wei Wang

Browse all Theses and Dissertations

With the limitations given by the power consumption (power wall), memory wall and the instruction level parallelism, the computing industry has turned its direction to multi-core architectures. Nowadays, the multi-core and many-core architectures are becoming the trend of the processor design. But how to exploit these architectures is the primary challenge for the research community. To take advantage of the multi-core architectures, the software design has undergone fundamental changes.

Sorting is a fundamental, important problem in computer science. It is utilized in many applications such as databases and search engines. In this thesis, we will investigate and auto-tune two parallel …

Semi-Supervised Contrafold For Rna Secondary Structure Prediction: A Maximum Entropy Approach, Jianping Feng

Browse all Theses and Dissertations

A novel probabilistic discriminative model based on conditional random fields, CONTRAfold, has recently been proposed for single sequence RNA secondary structure prediction. By incorporating most of the features which closely mirror the local interaction terms of thermodynamics-based models, the CONTRAfold model has outperformed both probabilistic and physics-based techniques, and received the highest single sequence prediction accuracies. CONTRAfold, like most other RNA secondary structure prediction techniques, requires a collection of RNA sequences with known secondary structure to serve as training data for the algorithm. Manual annotation of RNA sequences is both expensive and time-consuming, and there remains a great deal more …

Optimizing Memory Cost With Loop Transformations, Hailong Shi

Browse all Theses and Dissertations

Embedded systems are usually constrained in terms of timing, power, and memory. Many embedded applications, especially in the multi-media and telecom domains, are inherently data dominant. These embedded DSP applications usually exhibit intensive computations in the form of multi-level loops. The performance of these embedded DSP applications mainly depends on the code quality of the loops and the memory hierarchy design. During the design phase of the embedded system, it is important to estimate the overall storage requirement to guide the memory system design and take advantage of the memory system by program transformations and loop transformations.

Loop transformations including …

Towards Optimal Resource Provisioning For Running Mapreduce Programs In Public Clouds, Fengguang Tian

Browse all Theses and Dissertations

Running MapReduce programs in the public cloud introduces the important problem: how to optimize resource provisioning to minimize the financial charge for a specific job? In this thesis, We study the whole process of MapReduce processing and build up a cost function that explicitly models the relationship between the amount of input data, the available system resources (Map and Reduce slots), and the complexity of the Reduce function for the target MapReduce job. The model parameters can be learned from test runs with a small number of nodes on a small amount of data. Based on this cost model, we …

3-D Model Characterization And Identification From Intrinsic Landmarks, John L. Camp

Browse all Theses and Dissertations

A method to automatically characterize and identify 3-D range scans based on intrinsic landmarks is presented. Intrinsic landmarks represent locally unique, intrinsic properties of a scanned surface, regardless of scale or rotation. The number, location, and characteristics of landmarks are used to characterize the scanned models. This method contains a selection process to identify stable, intrinsic landmarks for range scans as well as the identification of those scans. The selection process requires no user interaction or surface assumptions. It uses the principal curvatures at the range points to select the landmarks. First, a large number of landmarks are generated by …

Real Time Semantic Analysis Of Streaming Sensor Data, Harshal Kamlesh Patni

Browse all Theses and Dissertations

The emergence of dynamic information sources - like social, mobile and sensors, has led to ginormous streams of real time data on the web also called, the era of Big Data [1]. Research studies suggest, these dynamic networks have created more data in the last three years than in the entire history of civilization, and this trend will only increase in the coming years [1]. Gigaom article on Big data shows, how the total information generated by these dynamic information sources has completely surpassed the total storage capacity. Thus keeping in mind the problem of ever-increasing data, this thesis focuses …

Optimization Of Scientific Computation For Multicore Systems, Andrew B. Mcclain

Browse all Theses and Dissertations

With the rapid growth of semiconductor technology, chip density has increased significantly. As the power exponent is setting hard limits to frequency increases, multi-core and chip level multi-processors have become prevalent in recent years to take advantage of the increasing chip density. In the new generation of processors, multi-core architecture design is becoming the major trend: IBM/SONY/Toshiba's Cell Broadband Engine processors contain nine cores; NVIDIA graphics processors contain more than 30 cores.

One of the biggest challenges is to efficiently utilize the computational power provided by multi-core systems. The second challenge to achieving high performance in a computer system is …

Spatial Semantics For Better Interoperability And Analysis: Challenges And Experiences In Building Semantically Rich Applications In Web 3.0, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Flexible Bootstrapping-Based Ontology Alignment, Prateek Jain, Pascal Hitzler, Amit P. Sheth

Kno.e.sis Publications

BLOOMS (Jain et al, ISWC2010) is an ontology alignment system which, in its core, utilizes the Wikipedia category hierarchy for establishing alignments. In this paper, we present a Plug-and-Play extension to BLOOMS, which allows to flexibly replace or complement the use of Wikipedia by other online or offline resources, including domain-specific ontologies or taxonomies. By making use of automated translation services and of Wikipedia in languages other than English, it makes it possible to apply BLOOMS to alignment tasks where the input ontologies are written in different languages.

A Clustering Comparison Measure Using Density Profiles And Its Application To The Discovery Of Alternate Clusterings, Eric Bae, James Bailey, Guozhu Dong

Kno.e.sis Publications

Data clustering is a fundamental and very popular method of data analysis. Its subjective nature, however, means that different clustering algorithms or different parameter settings can produce widely varying and sometimes conflicting results. This has led to the use of clustering comparison measures to quantify the degree of similarity between alternative clusterings. Existing measures, though, can be limited in their ability to assess similarity and sometimes generate unintuitive results. They also cannot be applied to compare clusterings which contain different data points, an activity which is important for scenarios such as data stream analysis. In this paper, we introduce a …

Ontology Alignment For Linked Open Data, Prateek Jain, Pascal Hitzler, Amit P. Sheth, Kunal Verma, Peter Z. Yeh

Kno.e.sis Publications

The Web of Data currently coming into existence through the Linked Open Data (LOD) effort is a major milestone in realizing the Semantic Web vision. However, the development of applications based on LOD faces difficulties due to the fact that the different LOD datasets are rather loosely connected pieces of information. In particular, links between LOD datasets are almost exclusively on the level of instances, and schema-level information is being ignored. In this paper, we therefore present a system for finding schema-level links between LOD datasets in the sense of ontology alignment. Our system, called BLOOMS, is based on the …

Three-Dimensional Stereoscopic Exploration System For The Heart, Thomas Wischgoll

Computer Science and Engineering Faculty Publications

No abstract provided.

Cs 241: Computer Programming, Travis E. Doom

Computer Science & Engineering Syllabi

A continuation of CS240. The emphasis is on data abstraction and software engineering. Prerequisite: CS240.

Ceg 233-01: Linux And Windows, Prabhaker Mateti

Computer Science & Engineering Syllabi

Introduction to Linux and Windows systems. GUI and Windowing Systems. Files and Directories. Ownership and Sharing. Programs and Processes. System calls, Libraries. Loading. Dynamic linking. Command Line Shells. Scripting languages. Regular expressions. Clients and Servers. Web browser clients and servers. Secure shell, sftp. SSL/TSL. HTTPS. System Administration. 4 credit hours. 3 hours lectures, 2 hours labs. Prerequisites: CS 240 or CS 220 or equivalent.

Ceg 210-01: Pc Networking I, Chris P. Fickert

Computer Science & Engineering Syllabi

Introduction to networking technologies including infrastructure and architectures, standards, protocols and directory services, administration, security and management. Integrated lecture and lab.

Cs 205: Introduction To Computers And Office Productivity Software, John P. Herzog

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.

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, arrays, pointers, and structures as well as sorting algorithms, linked lists, binary files, complex numbers, and numerical methods applications. 4 credit hours. Prerequisite: CEG220 (Introduction to C Programming for Engineers).

Cs 214: Visual Basic Programming, Vanessa Starkey

Computer Science & Engineering Syllabi

This course will cover the fundamentals of object-oriented computer
programming including design, structure, debugging, and testing. Visual Basic 2008 will be used for
developing programs.

Cs/Bio 471/671: Algorithms For Bioinformatics, Michael L. Raymer

Computer Science & Engineering Syllabi

Theory-oriented approach to the application of contemporary algorithms to bioinformatics. Graph theory, complexity theory, dynamic programming and optimization techniques are introduced in the context of application toward solving specific computational problems in molecular genetics. 4 credit hours.

Cs/Mth 316/516: Survey Of Numerical Methods For Computational Science, Ronald F. Taylor

Computer Science & Engineering Syllabi

Introduction to numerical methods used in the sciences and engineering. Included will be methods for interpolation, data smoothing, integration, differentiation, and solution of systems of linear and nonlinear equations. Discussion of sources of error in numerical methods. Applications to science, engineering and applied mathematics are an integral part of the course. Special topics presented as schedule permits. Four hours lecture.

Cs 141: Computer Programming I, Vanessa Starkey

Computer Science & Engineering Syllabi

Introduction to use of computers as a problem-solving tool. Examples from and applications to a broad range of problems. Methodology for algorithm design and for structured modular implementation is stressed. Three hours lecture, two hours lab.

Cs 415: Social Implications Of Computing, Leo Finkelstein

Computer Science & Engineering Syllabi

CS 415 is a communication skills course using as its subject matter current salient issues associated with the social implications of computing. In addition to the course text, you will need to use certain reading materials in the library and elsewhere, and you will be responsible for using concepts and theories provided in class lectures and discussions.

Cs 405/605: Introduction To Database Management Systems, Soon M. Chung

Computer Science & Engineering Syllabi

Survey of logical and physical aspects of database management systems. Entity Relationship, relational, object-oriented models for databases are presented. Physical implementation methods are discussed.

Cs 209: Computer Programming For Business Ii, David M. Hutchison

Computer Science & Engineering Syllabi

CS 209 is the second in a sequence of two programming classes required for MIS majors. This course will continue teaching students to the basic concepts of programming. Examples are from business applications and emphasis is on problem solving with the computer as a tool.

Ceg 260-01: Digital Computer Hardware/Switching Circuits, Meilin Liu

Computer Science & Engineering Syllabi

We will discuss and cover basic digital, combinational and sequential logic systems. Labs will be used to gain valuable practical experience in implementing elementary circuits and logic designs.

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 409/609: Principles Of Artificial Intelligence, Shaojun Wang

Computer Science & Engineering Syllabi

No abstract provided.

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 770-01: Computer Engineering Mathematics, Bin Wang

Computer Science & Engineering Syllabi

Computer engineering and science students need proficiency in relevant applied mathematics to be able to discover and model difficult real-world computer engineering and science problems. The relationship of these problems to mathematical theory will be discussed. This course provides an introduction to linear and nonlinear programming, probability and stochastic process, and queueing theory. In addition to mathematical theory, appropriate applications will be presented.

Ceg 702-01: Advanced Computer Networks, Yong Pei

Computer Science & Engineering Syllabi

This course provides an in-depth examination of the fundamental concepts and principles in communications and computer networks. Topics include: queuing analysis, ATM, frame relay, performance analysis of routings, and flow and congestion controls.