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

Computer Sciences Commons™

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

2005

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 421 - 450 of 1206

Full-Text Articles in Computer Sciences

A Semantic Template Based Designer For Semantic Web Processes, Ranjit Mulye, John A. Miller, Kunal Verma, Karthik Gomadam, Amit P. Sheth Jul 2005

A Semantic Template Based Designer For Semantic Web Processes, Ranjit Mulye, John A. Miller, Kunal Verma, Karthik Gomadam, Amit P. Sheth

Kno.e.sis Publications

The growing popularity of service oriented computing based on Web services standards is creating a need for paradigms to represent and design business processes. Significant work has been done in the representation aspects with regards to WSBPEL. However, design and modeling of business processes is still an open issue. In this paper, we present a novel designer for business processes, which allows for intuitive modeling of Web processes, as well as using a template based approach for semi-automatically integrating partners either at design time or at deployment time. This work has been done as part of the METEOR-S project, which …

Go to article

Cs 214: Object Oriented Programming, Roddy Keish Jul 2005

Cs 214: Object Oriented Programming, Roddy Keish

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Cs 242: Computer Science Iii, Mateen M. Rizki Jul 2005

Cs 242: Computer Science Iii, Mateen M. Rizki

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Cs 205: Computer Literacy And Office Automation, Terri Bauer Jul 2005

Cs 205: Computer Literacy And Office Automation, Terri Bauer

Computer Science & Engineering Syllabi

•To understand basic computer operations and the principal components of a computer and connected peripheral devices
•To understand and examine current operating systems, software utilities, device drivers and
application software
•To define and understand current storage technology and learn about logical file storage and management
•To become proficient in using:
-Windows XP
-Spreadsheet Applications
-Database Applications
-Presentation Graphics Applications
-To understand the basics of email

Go to article

Cs 400/600: Data Structures And Software Design, Jack Jean Jul 2005

Cs 400/600: Data Structures And Software Design, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Cs 415: Social Implications Of Computing, Leo Finkelstein Jul 2005

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.

Go to article

Cs 480/680: Comparative Languages, Krishnaprasad Thirunarayan Jul 2005

Cs 480/680: Comparative Languages, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course will introduce fundamental concepts and paradigms underlying the design of modern programming languages. For concreteness, we study the details of an object-oriented language (e.g. Java), and a functional language (e.g., Scheme). The overall goal is to enable comparison and evaluation of existing languages. The programming assignments will be coded in Java 5 and in Scheme.

Go to article

Cs 765: Foundations Of Neurocomputation, Mateen M. Rizki Jul 2005

Cs 765: Foundations Of Neurocomputation, Mateen M. Rizki

Computer Science & Engineering Syllabi

This course is designed to help you develop a solid understanding of neural network algorithms and architectures. At the end of this course you should be able to read and critically evaluate most neural network papers published in major journals, (e.g. IEEE Transaction on Neural Networks, Neural Networks, and Neural Computation). In addition, you should be able to implement a broad range of network architectures and learning algorithms for a variety of applications.

Go to article

Cs 209: Computer Programming For Business Ii, Dennis Kellermeier Jul 2005

Cs 209: Computer Programming For Business Ii, Dennis Kellermeier

Computer Science & Engineering Syllabi

CS 209 is the second of a two quarter sequence in programming for business students. It is required for Management Information Science majors. The courses are designed to help students achieve a high degree of facility in intermediate level programming.

Go to article

Cs 241: Computer Science Ii, Eric Maston Jul 2005

Cs 241: Computer Science Ii, Eric Maston

Computer Science & Engineering Syllabi

This course is the second in the Introduction to Computer Science (24X) series. It focuses on object oriented concepts and an introduction to data structures.

Go to article

Cs 405/605-01: Introduction To Database Management Systems, Guozhu Dong Jul 2005

Cs 405/605-01: Introduction To Database Management Systems, Guozhu Dong

Computer Science & Engineering Syllabi

Survey of logical and physical aspects of database management systems. Data models including entity-relationship (ER) and relational are presented. Physical implementation (data organization and indexing) methods are discussed. Query languages including SQL, relational algebra, relational calculus, and QBE are introduced. Students will also gain experience in creating and manipulating a database.

Go to article

Cs 141-01: Computer Programming - I, Ronald F. Taylor Jul 2005

Cs 141-01: Computer Programming - I, Ronald F. Taylor

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.

Go to article

Cs 240: Computer Science - I, Ronald F. Taylor Jul 2005

Cs 240: Computer Science - I, Ronald F. Taylor

Computer Science & Engineering Syllabi

Basic concepts of programming and programming languages are introduced. Emphasis is on structured programming and stepwise refinement. For CS/CEO majors with familiarity of a high-level programming language. Co-requisite: MTH 130 and 131; or MTH 134. 4 credit hours.

Go to article

Ceg 720-01: Computer Architecture, Jack Jean Jul 2005

Ceg 720-01: Computer Architecture, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Ceg 260-01: Digital Computer Hardware/Switching Circuits, Eric Maston Jul 2005

Ceg 260-01: Digital Computer Hardware/Switching Circuits, Eric Maston

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.

Go to article

Ceg 360/560-01: Digital System Design, Travis E. Doom Jul 2005

Ceg 360/560-01: 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. 3 hours lecture, 2 hours lab. Prerequisite: CEG260.

Go to article

Cs 206-01: Advanced Concepts/Techniques And Software Productivity Tools, John P. Herzog Jul 2005

Cs 206-01: Advanced Concepts/Techniques And Software Productivity Tools, John P. Herzog

Computer Science & Engineering Syllabi

By the end of this course, the students will have a greater depth of understanding in the areas of spreadsheets, databases, and presentation software using Microsoft Excel, Access, and PowerPoint.

Go to article

Ceg 220-01: Introduction To C Programming For Engineers, Robert Helt Jul 2005

Ceg 220-01: Introduction To C Programming For Engineers, Robert Helt

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: Mm 229 (Calculus I).

Go to article

Ceg 460/660-01: Introduction To Software Computer Engineering, John A. Reisner Jul 2005

Ceg 460/660-01: Introduction To Software Computer Engineering, John A. Reisner

Computer Science & Engineering Syllabi

This course introduces established practices for engineering large-scale software systems. Emphasis is placed on both the technical and managerial aspects of software engineering, and the software development process. This includes techniques for requirements elicitation, analysis, design, testing, and project management. The course emphasizes object-oriented development with the Unified Modeling Language (UML). Hands-on experience is provided through individual homework problems and a group project.

Go to article

Cs 701: Database Systems And Design I, Guozhu Dong Jul 2005

Cs 701: Database Systems And Design I, Guozhu Dong

Computer Science & Engineering Syllabi

An introduction to database design, database system implementation issues and techniques, and advanced data models.

Go to article

Evaluation Of Glycine Max Mrna Clusters, Ronald L. Frank, Fikret Erçal Jul 2005

Evaluation Of Glycine Max Mrna Clusters, Ronald L. Frank, Fikret Erçal

Biological Sciences Faculty Research & Creative Works

Background: Clustering the ESTs from a large dataset representing a single species is a convenient starting point for a number of investigations into gene discovery, genome evolution, expression patterns, and alternatively spliced transcripts. Several methods have been developed to accomplish this, the most widely available being UniGene, a public domain collection of gene-oriented clusters for over 45 different species created and maintained by NCBI. The goal is for each cluster to represent a unique gene, but currently it is not known how closely the overall results represent that reality. UniGene's build procedure begins with initial mRNA clusters before joining ESTs. …

Go to article

Mobility-Pattern Based Localization Update Algorithm For Mobile Wireless Sensor Networks, Mohammad Yacoub Al-Laho Jul 2005

Mobility-Pattern Based Localization Update Algorithm For Mobile Wireless Sensor Networks, Mohammad Yacoub Al-Laho

Electrical & Computer Engineering Theses & Dissertations

In mobile wireless sensor networks, sensors move in the monitored area at any direction and speed. Unlike many other networking hosts, sensor nodes do not have global addresses. They are often identified by using a location-based addressing scheme. Therefore, it is important to have the knowledge of the sensor location indicating where the data came from. In this thesis, three localization update algorithms were designed, Specifically, a sensor movement is divided into three states: Pause, Linear, and Random. Each state adopts different localization update algorithm. Since complex movement involves different mobility patterns, a state transition model is developed to …

Go to article

Querying Private Data In Moving-Object Environments, Reynold Cheng, Yu Zhang, Elisa Bertino, Sunil Prabhakar Jul 2005

Querying Private Data In Moving-Object Environments, Reynold Cheng, Yu Zhang, Elisa Bertino, Sunil Prabhakar

Department of Computer Science Technical Reports

No abstract provided.

Go to article

Po2v: Network Layer Position Verification In Multi-Hopo Wireless Networks, Xizoxin Wu, Cristina Nita-Rotaru Jul 2005

Po2v: Network Layer Position Verification In Multi-Hopo Wireless Networks, Xizoxin Wu, Cristina Nita-Rotaru

Department of Computer Science Technical Reports

No abstract provided.

Go to article

Sole: Scalable On-Line Execution Of Continuous Queries On Spatio-Temporal Data Streams, Mohamed F. Mokbel, Walid G. Aref Jul 2005

Sole: Scalable On-Line Execution Of Continuous Queries On Spatio-Temporal Data Streams, Mohamed F. Mokbel, Walid G. Aref

Department of Computer Science Technical Reports

No abstract provided.

Go to article

Validating Human–Robot Interaction Schemes In Multitasking Environments, Jacob W. Crandall, Michael A. Goodrich, Curtis W. Nielsen, Dan R. Olsen Jr. Jul 2005

Validating Human–Robot Interaction Schemes In Multitasking Environments, Jacob W. Crandall, Michael A. Goodrich, Curtis W. Nielsen, Dan R. Olsen Jr.

Faculty Publications

The ability of robots to autonomously perform tasks is increasing. More autonomy in robots means that the human managing the robot may have available free time. It is desirable to use this free time productively, and a current trend is to use this available free time to manage multiple robots. We present the notion of neglect tolerance as a means for determining how robot autonomy and interface design determine how free time can be used to support multitasking, in general, and multirobot teams, in particular. We use neglect tolerance to 1) identify the maximum number of robots that can be …

Go to article

Valuations Of Possible States (Vps): A Unifying Quantitative Framework For Evaluating Privacy In Collaboration, Rajiv T. Maheswaran, Jonathan Pearce, Pradeep Varakantham, Emma Bowring, Milind Tambe Jul 2005

Valuations Of Possible States (Vps): A Unifying Quantitative Framework For Evaluating Privacy In Collaboration, Rajiv T. Maheswaran, Jonathan Pearce, Pradeep Varakantham, Emma Bowring, Milind Tambe

Research Collection School Of Computing and Information Systems

For agents deployed in real-world settings, such as businesses, universities and research laboratories, it is critical that agents protect their individual users’ privacy when interacting with others entities. Indeed, privacy is recognized as a key motivating factor in design of several multiagent algorithms, such as distributed constraint optimization (DCOP) algorithms. Unfortunately, rigorous and general quantitative metrics for analysis and comparison of such multiagent algorithms with respect to privacy loss are lacking. This paper takes a key step towards developing a general quantitative model from which one can analyze and generate metrics of privacy loss by introducing the VPS (Valuations of …

Go to article

Approximate Strategic Reasoning Through Hierarchical Reduction Of Large Symmetric Games, Michael P. Wellman, Daniel M. Reeves, Kevin M. Lochner, Shih-Fen Cheng, Rahul Suri Jul 2005

Approximate Strategic Reasoning Through Hierarchical Reduction Of Large Symmetric Games, Michael P. Wellman, Daniel M. Reeves, Kevin M. Lochner, Shih-Fen Cheng, Rahul Suri

Research Collection School Of Computing and Information Systems

To deal with exponential growth in the size of a game with the number of agents, we propose an approximation based on a hierarchy of reduced games. The reduced game achieves savings by restricting the number of agents playing any strategy to fixed multiples. We validate the idea through experiments on randomly generated local-effect games. An extended application to strategic reasoning about a complex trading scenario motivates the approach, and demonstrates methods for game-theoretic reasoning over incompletely-specified games at multiple levels of granularity.

Go to article

Strategic Assessment Of Information Security Maturity, Arcot Desai Narasimhalu, Dayasindhu Nagarajan, Raghavan Subramanian Jul 2005

Strategic Assessment Of Information Security Maturity, Arcot Desai Narasimhalu, Dayasindhu Nagarajan, Raghavan Subramanian

Research Collection School Of Computing and Information Systems

CXOs are becoming increasingly interested in the information security maturity of their enterprises. This paper presents a CXO dashboard that will allow better management of the information security resources in an enterprise.

Go to article

Descriptive Naming Of Context Data Providers, Norman H. Cohen, Paul Castro, Archan Misra Jul 2005

Descriptive Naming Of Context Data Providers, Norman H. Cohen, Paul Castro, Archan Misra

Research Collection School Of Computing and Information Systems

Much context data comes from mobile, transient, and unreliable sources. Such resources are best specified by descriptive names identifying what data is needed rather than which source is to provide it. The design of descriptive names has important consequences, but until now little attention has been focused on this problem. We propose a descriptive naming system for providers of context data that provides more flexibility and power than previous naming systems by classifying data providers into “provider kinds” that are organized in an evolving hierarchy of subkinds and superkinds. New provider kinds can be inserted in the hierarchy not only …

Go to article

First Prev Next Last