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

Computer Sciences Commons™

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

2006

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 631 - 660 of 1262

Full-Text Articles in Computer Sciences

Ceg 777-01: Computer Aided Geometric Design, Arthur A. Goshtasby Apr 2006

Ceg 777-01: Computer Aided Geometric Design, Arthur A. Goshtasby

Computer Science & Engineering Syllabi

To cover the fundamentals of geometric modeling, including design of curves and surfaces, composite curves and surfaces, and subdivision techniques for creation of free-form shapes.


Ceg 211-01: Pc Networking Ii, Karen Meyer Apr 2006

Ceg 211-01: Pc Networking Ii, Karen Meyer

Computer Science & Engineering Syllabi

Focuses on server installation, administration, multiple protocol integration, systems maintenance, and troubleshooting. Includes hands-on class and laboratory assignments.


Cs 776: Functional Programming, Krishnaprasad Thirunarayan Apr 2006

Cs 776: Functional Programming, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course will discuss important concepts of functional programming such as recursive definitions, higher-order functions, type inference, polymorphism, abstract data types, modules etc. The programming exercises will illustrate the utility of list-processing, pattern matching, abstraction of data/control, strong typing, and parameterized modules (functors). We also study the mathematical reasoning involved in the design of functional programs and techniques for proving properties about functions so defined. The programming assignments will be coded in SML '97 (Standard ML of New Jersey). and Haskell.


Ceg 702-01: Advanced Communication Networks, Bin Wang Apr 2006

Ceg 702-01: Advanced Communication Networks, Bin Wang

Computer Science & Engineering Syllabi

This is a graduate level course on advanced computer communication and networking technologies. The course involves both a reading/lecture/discussion component and a project component. We will read papers on various aspects of advanced computer networking: LAN/WAN technologies, congestion/flow control, self-similar traffic analysis, queuing theory, link scheduling, routing, internetworking, multicast, wireless technologies, quality of services, and peer-to-peer networks. Various technical and research issues involved will be studied in depth.


Cs 205-01, 02, 03: Computer Literacy And Office Automation, Ann Tirpack Apr 2006

Cs 205-01, 02, 03: Computer Literacy And Office Automation, Ann Tirpack

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
-Word Processing Applications
-Spreadsheet Applications
-Database Applications
-Presentation Graphics Applications
•To understand the basics of e-mail
•To introduce networking concepts including the Internet and its components and web browser basics
•To learn ways to protect your data and avoid computer disasters


Cs 242-01: Computer Science Iii, Mateen M. Rizki Apr 2006

Cs 242-01: Computer Science Iii, Mateen M. Rizki

Computer Science & Engineering Syllabi

No abstract provided.


Cs 801: Advanced Database Systems, Soon M. Chung Apr 2006

Cs 801: Advanced Database Systems, Soon M. Chung

Computer Science & Engineering Syllabi

Introduction of current trends and research issues in database systems.


Cs 241-02: Computer Science Ii, Eric Maston Apr 2006

Cs 241-02: 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.


Answer Set Programming Based On Propositional Satisfiability, Enrico Giunchiglia, Yuliya Lierler, Marco Maratea Apr 2006

Answer Set Programming Based On Propositional Satisfiability, Enrico Giunchiglia, Yuliya Lierler, Marco Maratea

Computer Science Faculty Publications

Answer set programming (ASP) emerged in the late 1990s as a new logic programming paradigm that has been successfully applied in various application domains. Also motivated by the availability of efficient solvers for propositional satisfiability (SAT), various reductions from logic programs to SAT were introduced. All these reductions, however, are limited to a subclass of logic programs or introduce new variables or may produce exponentially bigger propositional formulas. In this paper, we present a SAT-based procedure, called ASPSAT, that (1) deals with any (nondisjunctive) logic program, (2) works on a propositional formula without additional variables (except for those possibly introduced …


New Fellow: Robert A. Willis, Jr. Apr 2006

New Fellow: Robert A. Willis, Jr.

Virginia Journal of Science

Robert A. Willis, Jr. has been named Fellow of the Virginia Academy of Science. He has been an active member of the Virginia Academy of Science and the Association of Departments of Computer, Information Science/Engineering at Minority Institutions (ADMI) for nearly fifteen years.


Crawdad: A Community Resource For Archiving Wireless Data At Dartmouth, Jihwang Yeo, David Kotz, Tristan Henderson Apr 2006

Crawdad: A Community Resource For Archiving Wireless Data At Dartmouth, Jihwang Yeo, David Kotz, Tristan Henderson

Dartmouth Scholarship

Wireless network researchers are seriously starved for data about how real users, applications, and devices use real networks under real network conditions. CRAWDAD, a Community Resource for Archiving Wireless Data at Dartmouth, is a new NSF-funded project to build a wireless network data archive for the research community. We host wireless data, and provide tools and documents to make it easy to collect and use wireless network data. We hope that this resource will help researchers identify and evaluate real and interesting problems in mobile and pervasive computing. This report outlines the CRAWDAD project, the kick-off workshop that was held …


Reversing Ticket Based Probing (Rtbp) Routing For Manet, Turgut Yucel Apr 2006

Reversing Ticket Based Probing (Rtbp) Routing For Manet, Turgut Yucel

Electrical & Computer Engineering Theses & Dissertations

The delay-constrained maximum-bandwidth routing problem in MANET (Mobile Ad hoc Networks) is to find the maximum bandwidth path which satisfies a given delay constraint. The research challenge for this problem is that the networking information used for routing may be imprecise. The Ticket-Based Probing (TBP) routing algorithm provides a heuristic approach by using two types of ticket. In this thesis a Reversing Ticket-based Probing (RTBP) routing algorithm is proposed. The RTBP has two novel features compared to the original ticket based probing algorithms. The first feature is using just one type ticket, instead of two types of ticket. RTBP generates …


Whole Word Phonetic Displays For Speech Articulation Training, Fansheng Meng Apr 2006

Whole Word Phonetic Displays For Speech Articulation Training, Fansheng Meng

Electrical & Computer Engineering Theses & Dissertations

The main objective of this dissertation is to investigate and develop speech recognition technologies for speech training for people with hearing impairments. During the course of this work, a computer aided speech training system for articulation speech training was also designed and implemented. The speech training system places emphasis on displays to improve children's pronunciation of isolated Consonant-Vowel-Consonant (CVC) words, with displays at both the phonetic level and whole word level. This dissertation presents two hybrid methods for combining Hidden Markov Models (HMMs) and Neural Networks (NNs) for speech recognition. The first method uses NN outputs as posterior probability estimators …


A Non-Linear Technique For The Enhancement Of Extremely Non-Uniform Lighting Images, Ender Oguslu Apr 2006

A Non-Linear Technique For The Enhancement Of Extremely Non-Uniform Lighting Images, Ender Oguslu

Electrical & Computer Engineering Theses & Dissertations

At night scenes, either the low intensity areas that are under poor light or the high intensity areas that are overexposed cannot be clearly seen. Various image processing techniques have been developed to recover the meaningful information under extremely low lighting conditions. Among these, the algorithms based on integrated neighborhood dependency of pixel characteristics and based on the illuminance reflectance model perform well for improving the visual quality of digital images captured under nonuniform and extremely low lighting conditions. Although these techniques perform well in low lighting conditions, they cannot perform well in overexposed regions under dark environments such as …


Extracting A Mobility Model From Real User Traces, Minkyong Kim, David Kotz, Songkuk Kim Apr 2006

Extracting A Mobility Model From Real User Traces, Minkyong Kim, David Kotz, Songkuk Kim

Dartmouth Scholarship

Understanding user mobility is critical for simulations of mobile devices in a wireless network, but current mobility models often do not reflect real user movements. In this paper, we provide a foundation for such work by exploring mobility characteristics in traces of mobile users. We present a method to estimate the physical location of users from a large trace of mobile devices associating with access points in a wireless network. Using this method, we extracted tracks of always-on Wi-Fi devices from a 13-month trace. We discovered that the speed and pause time each follow a log-normal distribution and that the …


Realizing The Open-Closed Principle, Chong-Wei Xu, Jose Hughes Apr 2006

Realizing The Open-Closed Principle, Chong-Wei Xu, Jose Hughes

Faculty Articles

The first principle in developing large software systems is the open-closed principle (OCP). This principle seems asking for two conflict goals. How to realize the principle in the real software practice? What are the enabling technologies that can be used to implement the principle? This paper uses a case study to demonstrate the importance of the principle, the design methodology for realizing the principle, and its enabling technologies.


Interactive Fault Localization Techniques In A Spreadsheet Environment, Joseph R. Ruthruff, Margaret Burnett, Gregg Rothermel Apr 2006

Interactive Fault Localization Techniques In A Spreadsheet Environment, Joseph R. Ruthruff, Margaret Burnett, Gregg Rothermel

School of Computing: Faculty Publications

End-user programmers develop more software than any other group of programmers, using software authoring devices such as multimedia simulation builders, e-mail filtering editors, by-demonstration macro builders, and spreadsheet environments. Despite this, there has been only a little research on finding ways to help these programmers with the dependability of the software they create. We have been working to address this problem in several ways, one of which includes supporting end-user debugging activities through interactive fault localization techniques. This paper investigates fault localization techniques in the spreadsheet domain, the most common type of end-user programming environment. We investigate a technique previously …


Traffic Grooming, Routing, And Wavelength Assignment In Wdm Transport Networks With Sparse Grooming Resources, Osama Awwad Apr 2006

Traffic Grooming, Routing, And Wavelength Assignment In Wdm Transport Networks With Sparse Grooming Resources, Osama Awwad

Masters Theses

While a single fiber strand in wavelength division multiplexing (WDM) has over a terabit-per-second bandwidth and a wavelength channel has over a gigabit-persecond transmission speed, the network may still be required to support traffic requests at rates that are lower than the full wavelength capacity. To avoid assigning an entire lightpath to a small request, many researchers have looked at adding traffic grooming to the routing and wavelength assignment (RWA) problem. In this work, we consider the RWA problem with traffic grooming (GRWA) for mesh networks under static and dynamic lightpath connection requests. The GRWA problem is NPComplete since it …


An Interactive Relaxation Approach For Anomaly Detection And Preventive Measures In Computer Networks, Garrick A. Bell Apr 2006

An Interactive Relaxation Approach For Anomaly Detection And Preventive Measures In Computer Networks, Garrick A. Bell

Theses and Dissertations

It is proposed to develop a framework of detecting and analyzing small and widespread changes in specific dynamic characteristics of several nodes. The characteristics are locally measured at each node in a large network of computers and analyzed using a computational paradigm known as the Relaxation technique. The goal is to be able to detect the onset of a worm or virus as it originates, spreads-out, attacks and disables the entire network. Currently, selective disabling of one or more features across an entire subnet, e.g. firewalls, provides limited security and keeps us from designing high performance net-centric systems. The most …


Predictability Of Wlan Mobility And Its Effects On Bandwidth Provisioning, Libo Song, Udayan Deshpande, Ulaş C. Kozat, David Kotz, Ravi Jain Apr 2006

Predictability Of Wlan Mobility And Its Effects On Bandwidth Provisioning, Libo Song, Udayan Deshpande, Ulaş C. Kozat, David Kotz, Ravi Jain

Dartmouth Scholarship

Wireless local area networks (WLANs) are emerging as a popular technology for access to the Internet and enterprise networks. In the long term, the success of WLANs depends on services that support mobile network clients. \par Although other researchers have explored mobility prediction in hypothetical scenarios, evaluating their predictors analytically or with synthetic data, few studies have been able to evaluate their predictors with real user mobility data. As a first step towards filling this fundamental gap, we work with a large data set collected from the Dartmouth College campus-wide wireless network that hosts more than 500 access points and …


Channel Sampling Strategies For Monitoring Wireless Networks, Udayan Deshpande, Tristan Henderson, David Kotz Apr 2006

Channel Sampling Strategies For Monitoring Wireless Networks, Udayan Deshpande, Tristan Henderson, David Kotz

Dartmouth Scholarship

Monitoring the activity on an IEEE 802.11 network is useful for many applications, such as network management, optimizing deployment, or detecting network attacks. Deploying wireless sniffers to monitor every access point in an enterprise network, however, may be expensive or impractical. Moreover, some applications may require the deployment of multiple sniffers to monitor the numerous channels in an 802.11 network. In this paper, we explore sampling strategies for monitoring multiple channels in 802.11b/g networks. We describe a simple sampling strategy, where each channel is observed for an equal, predetermined length of time, and consider applications where such a strategy might …


Anonymous Signature Schemes, Guomin Yang, Duncan S. Wong, Xiaotie Deng, Huaxiong Wang Apr 2006

Anonymous Signature Schemes, Guomin Yang, Duncan S. Wong, Xiaotie Deng, Huaxiong Wang

Research Collection School Of Computing and Information Systems

Digital signature is one of the most important primitives in public key cryptography. It provides authenticity, integrity and non-repudiation to many kinds of applications. On signer privacy however, it is generally unclear or suspicious of whether a signature scheme itself can guarantee the anonymity of the signer. In this paper, we give some affirmative answers to it. We formally define the signer anonymity for digital signature and propose some schemes of this type. We show that a signer anonymous signature scheme can be very useful by proposing a new anonymous key exchange protocol which allows a client Alice to establish …


Sgpm: Static Group Pattern Mining Using Apriori-Like Sliding Window, John Goh, David Taniar, Ee Peng Lim Apr 2006

Sgpm: Static Group Pattern Mining Using Apriori-Like Sliding Window, John Goh, David Taniar, Ee Peng Lim

Research Collection School Of Computing and Information Systems

Mobile user data mining is a field that focuses on extracting interesting pattern and knowledge out from data generated by mobile users. Group pattern is a type of mobile user data mining method. In group pattern mining, group patterns from a given user movement database is found based on spatio-temporal distances. In this paper, we propose an improvement of efficiency using area method for locating mobile users and using sliding window for static group pattern mining. This reduces the complexity of valid group pattern mining problem. We support the use of static method, which uses areas and sliding windows instead …


Effect Of Changing Requirements: A Tracking Mechanism For The Analysis Workflow, Subhajit Datta, Robert Van Engelen Apr 2006

Effect Of Changing Requirements: A Tracking Mechanism For The Analysis Workflow, Subhajit Datta, Robert Van Engelen

Research Collection School Of Computing and Information Systems

Managing the effects of changing requirements remains one of the greatest challenges of enterprise software development. The iterative and incremental model provides an expedient framework for addressing such concerns. This paper presents a set of metrics - Mutation Index, Component Set, Dependency Index - and a methodology to measure the effects of requirement changes in the analysis workflow from one iteration to another. Results from a sample case study are included to highlight a usage scenario. Future directions of our work based on this mechanism are also discussed.


Significant Tectonic And Climatic Events For The Yakutat Block Collision, Gulf Of Alaska: Pleistocene Glacial Intensification In The St. Elias Mountains And The Relationship Between The Fairweather And Transition Faults, Sean P.S. Gulick, Bryce A. Willems, Jeffrey T. Freymueller, Ross D. Powell, John M. Jaeger, Jay Kalbas, John M. Jaeger, Terry L. Pavlis, Lindsay A, Lowe, Larry A. Mayer, James V. Gardner Apr 2006

Significant Tectonic And Climatic Events For The Yakutat Block Collision, Gulf Of Alaska: Pleistocene Glacial Intensification In The St. Elias Mountains And The Relationship Between The Fairweather And Transition Faults, Sean P.S. Gulick, Bryce A. Willems, Jeffrey T. Freymueller, Ross D. Powell, John M. Jaeger, Jay Kalbas, John M. Jaeger, Terry L. Pavlis, Lindsay A, Lowe, Larry A. Mayer, James V. Gardner

Center for Coastal and Ocean Mapping

No abstract provided.


A Unified Log-Based Relevance Feedback Scheme For Image Retrieval, Steven Hoi, Michael R. Lyu, Rong Jin Apr 2006

A Unified Log-Based Relevance Feedback Scheme For Image Retrieval, Steven Hoi, Michael R. Lyu, Rong Jin

Research Collection School Of Computing and Information Systems

Relevance feedback has emerged as a powerful tool to boost the retrieval performance in content-based image retrieval (CBIR). In the past, most research efforts in this field have focused on designing effective algorithms for traditional relevance feedback. Given that a CBIR system can collect and store users' relevance feedback information in a history log, an image retrieval system should be able to take advantage of the log data of users' feedback to enhance its retrieval performance. In this paper, we propose a unified framework for log-based relevance feedback that integrates the log of feedback data into the traditional relevance feedback …


Efficient Client-To-Server Assignments For Distributed Virtual Environments, Nguyen Binh Duong Ta, Suiping Zhou Apr 2006

Efficient Client-To-Server Assignments For Distributed Virtual Environments, Nguyen Binh Duong Ta, Suiping Zhou

Research Collection School Of Computing and Information Systems

Distributed Virtual Environments (DVEs) are distributed systems that allow multiple geographically distributed clients (users) to interact simultaneously in a computer-generated, shared virtual world. Applications of DVEs can be seen in many areas nowadays, such as online games, military simulations, collaborative designs, etc. To support large-scale DVEs with real-time interactions among thousands or more distributed clients, a geographically distributed server architecture (GDSA) is generally needed, and the virtual world can be partitioned into many distinct zones to distribute the load among the servers. Due to the geographic distributions of clients and servers in such architectures, it is essential to efficiently assign …


Experimental And Empirical Perspectives On Grid Resource Allocation For The Singapore Market, Danny Oh, Steven Miller, Nan Hu Apr 2006

Experimental And Empirical Perspectives On Grid Resource Allocation For The Singapore Market, Danny Oh, Steven Miller, Nan Hu

Research Collection School Of Computing and Information Systems

In this paper, we describe our work on using the Tycoon system developed by HP Labs to provide a market-based resource allocation and bidding framework for a grid. We discuss how we intend to evaluate the feasibility of the Tycoon system by measuring its economic performance using agent-based simulation experiments for a particular type of grid usage scenario, namely, the digital media market scenario. We will also discuss a related effort in collecting and using real grid data from the National Grid Pilot Platform in Singapore and how we will be using real data collected to derive actual usage patterns …


Enterprise Agility And The Enabling Role Of Information Technology, Eric Overby, Anandhi S. Bharadwaj, V. Sambamurthy Apr 2006

Enterprise Agility And The Enabling Role Of Information Technology, Eric Overby, Anandhi S. Bharadwaj, V. Sambamurthy

Research Collection School Of Computing and Information Systems

In turbulent environments, enterprise agility, that is, the ability of firms to sense environmental change and respond readily, is an important determinant of firm success. We define and deconstruct enterprise agility, delineate enterprise agility from similar concepts in the business research literature, explore the underlying capabilities that support enterprise agility, explicate the enabling role of information technology (IT) and digital options, and propose a method for measuring enterprise agility. The concepts in this paper are offered as foundational building blocks for the overall research program on enterprise agility and the enabling role of IT.


Fisa: Feature-Based Instance Selection For Imbalanced Text Classification, Aixin Sun, Ee Peng Lim, Boualem Benatallah, Mahbub Hassan Apr 2006

Fisa: Feature-Based Instance Selection For Imbalanced Text Classification, Aixin Sun, Ee Peng Lim, Boualem Benatallah, Mahbub Hassan

Research Collection School Of Computing and Information Systems

Support Vector Machines (SVM) classifiers are widely used in text classification tasks and these tasks often involve imbalanced training. In this paper, we specifically address the cases where negative training documents significantly outnumber the positive ones. A generic algorithm known as FISA (Feature-based Instance Selection Algorithm), is proposed to select only a subset of negative training documents for training a SVM classifier. With a smaller carefully selected training set, a SVM classifier can be more efficiently trained while delivering comparable or better classification accuracy. In our experiments on the 20-Newsgroups dataset, using only 35% negative training examples and 60% learning …