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

Computer Sciences Commons™

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

Wright State University

Discipline
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 1381 - 1410 of 2694

Full-Text Articles in Computer Sciences

Design And Performance Analysis Of A Secure Proces-Sor Scan-Sp With Crypto-Biometric Capabilities, Raghudeep Kannavara Jan 2009

Design And Performance Analysis Of A Secure Proces-Sor Scan-Sp With Crypto-Biometric Capabilities, Raghudeep Kannavara

Browse all Theses and Dissertations

Secure computing is gaining importance in recent times as computing capability is increasingly becoming distributed and information is everywhere. Prevention of piracy and digital rights management has become very important. Information security is mandatory rather than an additional feature. Numerous software techniques have been proposed to provide certain level of copyright and intellectual property protection. Techniques like obfuscation attempt to transform the code into a form that is harder to reverse engineer. Tamper-proofing causes a program to malfunction when it detects that it has been modified. Software watermarking embeds copyright notice in the software code to allow the owners of …


Semantic And Role-Based Access Control For Data Grid Systems, Vineela Muppavarapu Jan 2009

Semantic And Role-Based Access Control For Data Grid Systems, Vineela Muppavarapu

Browse all Theses and Dissertations

A Grid is an integration infrastructure for sharing and coordinated use of diverseresources in dynamic, distributed virtual organizations (VOs). A Data Grid is an architecture for the access, exchange, and sharing of data in the Grid environment. Distributed data resources can be diverse in their formats, schema, quality, access mechanisms, ownership, access policies, and capabilities. In recent years, several organizations have started utilizing Grid technologies to deploy data-intensive and/or computation-intensive applications. As more and more organizations are sharing data resources and participating in Data Grids, the complexity and heterogeneity of the systems is increasing constantly, but their management techniques are …


Automated Transforms Of Software Models: A Design Pattern Approach, Brandon Adam Gump Jan 2009

Automated Transforms Of Software Models: A Design Pattern Approach, Brandon Adam Gump

Browse all Theses and Dissertations

In the realm of software development, projects are plagued by continuous maintenance at the source code level as well as tedious transformations from formal specifications to source code. Such work consumes a large amount of time only to create complicated, un-intelligible, and un-reusable code that is completely detached from initial design rational. To cope with these problems, The Air Force Institute of Technology (AFIT) Wide Spectrum Object Modeling Environment (AWSOME) was designed to generate specifications that can be transformed into abstract designs and finally into source code. The specifications are written in the AFIT Wide-spectrum Language (AWL) and parsed in …


The 4 X 4 Semantic Model: Exploiting Data, Functional, Non-Functional And Execution Semantics Across Business Process, Workflow, Partner Services And Middleware Services Tiers, Amit P. Sheth, Karthik Gomadam Dec 2008

The 4 X 4 Semantic Model: Exploiting Data, Functional, Non-Functional And Execution Semantics Across Business Process, Workflow, Partner Services And Middleware Services Tiers, Amit P. Sheth, Karthik Gomadam

Kno.e.sis Publications

Business processes in the global environment increasingly encompass multiple partners and complex, rapidly changing requirements. In this context it is critical that strategic business objectives align with and map accurately to systems that support flexible and dynamic business processes. To support the demanding requirements of global business processes, we propose a comprehensive, unifying 4 X 4 Semantic Model that uses Semantic Templates to link four tiers of implementation with four types of semantics. The four tiers are the Business Process Tier, the Workflow Enactment Tier, the Partner Services Tier, and the Middleware Services Tier. The four types of semantics are …


Semantic Sensor Web, Amit P. Sheth, Cory Henson, Krishnaprasad Thirunarayan Dec 2008

Semantic Sensor Web, Amit P. Sheth, Cory Henson, Krishnaprasad Thirunarayan

Kno.e.sis Publications

No abstract provided.


Capturing Workflow Event Data For Monitoring, Performance Analysis, And Management Of Scientific Workflows, Matthew Valerio, Satya S. Sahoo, Roger Barga, Jared Jackson Dec 2008

Capturing Workflow Event Data For Monitoring, Performance Analysis, And Management Of Scientific Workflows, Matthew Valerio, Satya S. Sahoo, Roger Barga, Jared Jackson

Kno.e.sis Publications

To effectively support real-time monitoring and performance analysis of scientific workflow execution, varying levels of event data must be captured and made available to interested parties. This paper discusses the creation of an ontology-aware workflow monitoring system for use in the Trident system which utilizes a distributed publish/subscribe event model. The implementation of the publish/subscribe system is discussed and performance results are presented.


Growing Fields Of Interest: Using An Expand And Reduce Strategy For Domain Model Extraction, Christopher Thomas, Pankaj Mehra, Roger Brooks, Amit P. Sheth Dec 2008

Growing Fields Of Interest: Using An Expand And Reduce Strategy For Domain Model Extraction, Christopher Thomas, Pankaj Mehra, Roger Brooks, Amit P. Sheth

Kno.e.sis Publications

Domain hierarchies are widely used as models underlying information retrieval tasks. Formal ontologies and taxonomies enrich such hierarchies further with properties and relationships associated with concepts and categories but require manual effort; therefore they are costly to maintain, and often stale. Folksonomies and vocabularies lack rich category structure and are almost entirely devoid of properties and relationships. Classification and extraction require the coverage of vocabularies and the alterability of folksonomies and can largely benefit from category relationships and other properties. With Doozer, a program for building conceptual models of information domains, we want to bridge the gap between the vocabularies …


Relationship Web: Trailblazing, Analytics And Computing For Human Experience, Amit P. Sheth Oct 2008

Relationship Web: Trailblazing, Analytics And Computing For Human Experience, Amit P. Sheth

Kno.e.sis Publications

This panel presentation was give at the 27th International Conference on Conceptual Modeling (ER 2008), Barcelona, Spain, October 20-23, 2008.


An Ontology-Driven Semantic Mash-Up Of Gene And Biological Pathway Information: Application To The Domain Of Nicotine Dependence, Satya S. Sahoo, Olivier Bodenreider, Joni L. Rutter, Karen J. Skinner, Amit P. Sheth Oct 2008

An Ontology-Driven Semantic Mash-Up Of Gene And Biological Pathway Information: Application To The Domain Of Nicotine Dependence, Satya S. Sahoo, Olivier Bodenreider, Joni L. Rutter, Karen J. Skinner, Amit P. Sheth

Kno.e.sis Publications

Objectives: This paper illustrates how Semantic Web technologies (especially RDF, OWL, and SPARQL) can support information integration and make it easy to create semantic mashups (semantically integrated resources). In the context of understanding the genetic basis of nicotine dependence, we integrate gene and pathway information and show how three complex biological queries can be answered by the integrated knowledge base.

Methods: We use an ontology-driven approach to integrate two gene resources (Entrez Gene and HomoloGene) and three pathway resources (KEGG, Reactome and BioCyc), for five organisms, including humans. We created the Entrez Knowledge Model (EKoM), an information model in OWL …


Ceg 460/660: Introduction To Software Computer Engineering, Jeffrey Mcdonald Oct 2008

Ceg 460/660: Introduction To Software Computer Engineering, Jeffrey Mcdonald

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 sot1ware, 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.


Ceg 453/653: Embedded Systems, Jack Jean Oct 2008

Ceg 453/653: Embedded Systems, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.


Adapting Ranking Functions To User Preference, Keke Chen, Ya Zhang, Zhaohui Zheng, Hongyuan Zha, Gordon Sun Oct 2008

Adapting Ranking Functions To User Preference, Keke Chen, Ya Zhang, Zhaohui Zheng, Hongyuan Zha, Gordon Sun

Kno.e.sis Publications

Learning to rank has become a popular method for web search ranking. Traditionally, expert-judged examples are the major training resource for machine learned web ranking, which is expensive to get for training a satisfactory ranking function. The demands for generating specific web search ranking functions tailored for different domains, such as ranking functions for different regions, have aggravated this problem. Recently, a few methods have been proposed to extract training examples from user clickthrough log. Due to the low cost of getting user preference data, it is attractive to combine these examples in training ranking functions. However, because of the …


Description Logic Reasoning With Decision Diagrams: Compiling Shiq To Disjunctive Datalog, Sebastian Rudolph Oct 2008

Description Logic Reasoning With Decision Diagrams: Compiling Shiq To Disjunctive Datalog, Sebastian Rudolph

Kno.e.sis Publications

We propose a novel method for reasoning in the description logic SHIQ. After a satisfiability preserving transformation from SHIQ to the description logic ALCIb, the obtained ALCIb Tbox T is converted into an ordered binary decision diagram (OBDD) which represents a canonical model for T. This OBDD is turned into a disjunctive datalog program that can be used for Abox reasoning. The algorithm is worst-case optimal w.r.t. data complexity, and admits easy extensions with DL-safe rules and ground conjunctive queries.


Ceg 770: Computer Engineering Mathematics, Yong Pei Oct 2008

Ceg 770: Computer Engineering Mathematics, Yong Pei

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.


Cs 705: Introduction To Data Mining, Guozhu Dong Oct 2008

Cs 705: Introduction To Data Mining, Guozhu Dong

Computer Science & Engineering Syllabi

Data mining is concerned with the extraction of novel and useful knowledge from large amounts of data. This course introduces and studies the fundamental concepts, issues, tasks and techniques of data mining. Topics include data preparation and feature selection, association rules, classification, clustering, evaluation and validation, scalability, spatial and sequence mining, privacy, and data mining applications. 3 hours lecture, 2 hours lab.


Cs 766: Evolutionary Computation, Mateen M. Rizki Oct 2008

Cs 766: Evolutionary Computation, Mateen M. Rizki

Computer Science & Engineering Syllabi

This course explores evolutionary computation from a historical, theoretical, and application viewpoint. An overview of the most common evolutionary search techniques are presented including genetic algorithms, evolutionary programming, evolutionary strategies, and genetic programming. The fundamental issues driving the choice of problem representation and specific genetic operators are discussed. Various applications of evolutionary computation to problems in control, optimization, and pattern recognition are examined.


Cs 141: Computer Programming - I, Michael Ondrasek Oct 2008

Cs 141: Computer Programming - I, Michael Ondrasek

Computer Science & Engineering Syllabi

This course provides a general introduction to the fundamentals of computer programming. Examples from and applications to a broad range of problems are given. No prior knowledge of programming is assumed. The concepts covered will be applied to the Java programming language. Students must register for both lecture and one laboratory section. 4 credit hours. Prerequisite: MTH 127 (College Algebra) or equivalent.


Ceg 320/520: Computer Organization And Assembly Language Programming, Travis E. Doom Oct 2008

Ceg 320/520: Computer Organization And Assembly Language Programming, Travis E. Doom

Computer Science & Engineering Syllabi

Terminology and understanding of functional organizations and sequential operation of a digital computer. Program structure, and machine and assembly language topics including addressing, stacks, argument pasing, arithmetic operations, traps, and input/output. Macros, modularization, linkers, and debuggers are used.


Cs 466/666: Introduction To Formal Languages, Guozhu Dong Oct 2008

Cs 466/666: Introduction To Formal Languages, Guozhu Dong

Computer Science & Engineering Syllabi

CS 466/666 is an introduction to formal language and automata theory. In this course we will examine methods for defining syntax of languages and recognizing patterns: the syntax of languages can be defined using grammars and patterns accepted by finite state machines. Along with presenting the fundamentals of these two topics, the course will develop and investigate the relationships between language definition and pattern recognition. The text will be the third edition of Languages and Machines: An Introduction to the Theory of Computer Science, by Thomas Sudkamp.


Cs 409/609: Principles Of Artificial Intelligence, Shaojun Wang Oct 2008

Cs 409/609: Principles Of Artificial Intelligence, Shaojun Wang

Computer Science & Engineering Syllabi

No abstract provided.


Cs 240: Introduction To Computer Science I, Mateen M. Rizki Oct 2008

Cs 240: Introduction To Computer Science I, Mateen M. Rizki

Computer Science & Engineering Syllabi

No abstract provided.


Cs 415: Social Implications Of Computing, Leo Finkelstein Oct 2008

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 241: Introduction To Computer Science Ii, Ronald F. Taylor Oct 2008

Cs 241: Introduction To Computer Science Ii, Ronald F. Taylor

Computer Science & Engineering Syllabi

A continuation of CS 240. Emphasis is on solving more complex problems using object oriented programming. Prerequisite: CS 240. 4 credit hours.


Cs 400/600: Data Structures And Software Design, Keke Chen Oct 2008

Cs 400/600: Data Structures And Software Design, Keke Chen

Computer Science & Engineering Syllabi

This course will cover the implementation of classical data structures and control structures, an introduction to the fundamentals of algorithm design and analysis, and the basic problem solving techniques.


Ceg/Ee 260: Digital Computer Hardware Switching Circuits, John C. Gallagher Oct 2008

Ceg/Ee 260: Digital Computer Hardware Switching Circuits, John C. Gallagher

Computer Science & Engineering Syllabi

Digital Computer Hardware. Topics include switching algebra and switching
functions, logic design of combinational and sequential circuits using TTL,
combinational logic design with MSI and LSI, busing, storage elements, and
instrumentation.


Cs 205-08: Introduction To Computers And Office Productivity Software, Kim Gros Oct 2008

Cs 205-08: Introduction To Computers And Office Productivity Software, Kim Gros

Computer Science & Engineering Syllabi

Focus on learning MS Office software applications including word processing (intermediate), 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.


Cs 410/610: Theoretical Foundations Of Computing, Thomas Sudkamp Oct 2008

Cs 410/610: Theoretical Foundations Of Computing, Thomas Sudkamp

Computer Science & Engineering Syllabi

This course is an introduction to one of the fundamental topics in the theory of computer science: computability theory. Computability theory is concerned with determining whether there is an algorithmic solution to a problem. The study of computability uses the Turing machine as the basic computational model. A Turing machine is a random access, read-write, finite state automaton. Although the Turing machine provides a simple computational framework, the Church-Turing thesis asserts that any problem that can be solved in any algorithmic manner can be solved by a Turing machine.


Cs 480/680: Comparative Programming Languages, Michael L. Raymer Oct 2008

Cs 480/680: Comparative Programming Languages, Michael L. Raymer

Computer Science & Engineering Syllabi

No abstract provided.


Ceg 221: Advanced C Programming For Engineers, Robert Helt Oct 2008

Ceg 221: Advanced C Programming For Engineers, Robert Helt

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, stacks, queues, hash tables, and binary trees.


Ceg 724: Computer Vision I, Arthur A. Goshtasby Oct 2008

Ceg 724: Computer Vision I, Arthur A. Goshtasby

Computer Science & Engineering Syllabi

This course covers basic techniques for low-level and some mid-level vision. The techniques include: camera calibration, image filtering and edge detection, image segmentation and feature selection, and stereo depth perception.