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

Digital Commons Network™

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

Computer Sciences

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 12271 - 12300 of 13768

Full-Text Articles in Entire DC Network

A Microformatted Registry Alternative, Thomas R. Warne Jul 2006

A Microformatted Registry Alternative, Thomas R. Warne

Theses and Dissertations

To effectively use Web services, providers and consumers need to be connected by a registry. Several registry solutions exist today, including UDDI and WSIL. Also, many organizations simply use Web pages to list available Web services and their descriptions. This research describes a microformat for representing Web service description documents. These microformatted documents can be converted back to the original format for use by machines. They can also contain additional information, making them more useful to people. A registry, allowing indexing and searching of microformatted service descriptions, is also described. The benefits of this solution include: using existing standards; allowing …


Local Url Resolution Protocol, Joseph Clark Ekstrom Jul 2006

Local Url Resolution Protocol, Joseph Clark Ekstrom

Theses and Dissertations

DOGMA is a resource management system designed to create a supercomputer like system from unused desktop computers. Scalability is one of the challenges faced by DOGMA because it uses a strict client/server architecture. Distributing large files over a client server architecture is problematic since available network bandwidth is limited. The Local URL Resolution Protocol(LURP) addresses this problem for environments where there are high node densities. LURP implements a locality aware Peer-to-Peer file distribution model to increase the speed of file distribution while reducing the overall network congestion.


Improving Record Linkage Through Pedigrees, Burdette N. Pixton Jul 2006

Improving Record Linkage Through Pedigrees, Burdette N. Pixton

Theses and Dissertations

Record linkage, in a genealogical context, is the process of identifying individuals from multiple sources which refer to the same real-world entity. Current solutions focus on the individuals in question and on complex rules developed by human experts. Genealogical databases are highly-structured with relationships existing between the individuals and other instances. These relationships can be utilized and human involvement greatly minimized by using a filtered structured neural network. These neural networks, using traditional back-propagation methods, are biased in a way to make the network human readable. The results show an increase in precision and recall when pedigree data is available …


Jumpstarting Phylogenetic Searches, Jesse Lewis Mecham Jul 2006

Jumpstarting Phylogenetic Searches, Jesse Lewis Mecham

Theses and Dissertations

Phylogenetic analysis is a central tool in studies of comparative genomics. When a new region of DNA is isolated and sequenced, researchers are often forced to throw away months of computation on an existing phylogeny of homologous sequences in order to incorporate this new sequence. The previously constructed trees are often discarded, and the researcher begins the search again from scratch. The jumpstarting algorithm uses trees from the prior search as a starting point for a new phylogenetic search. This technique drastically decreases search time for large data sets. This kind of analysis is necessary as researchers analyze tree of …


Markov Approximations: The Characterization Of Undermodeling Errors, Lei Lei Jul 2006

Markov Approximations: The Characterization Of Undermodeling Errors, Lei Lei

Theses and Dissertations

This thesis is concerned with characterizing the quality of Hidden Markov modeling when learning from limited data. It introduces a new perspective on different sources of errors to describe the impact of undermodeling. Our view is that modeling errors can be decomposed into two primary sources of errors: the approximation error and the estimation error. This thesis takes a first step towards exploring the approximation error of low order HMMs that best approximate the true system of a HMM. We introduce the notion minimality and show that best approximations of the true system with complexity greater or equal to the …


Reinforcement Programming: A New Technique In Automatic Algorithm Development, Spencer Kesson White Jul 2006

Reinforcement Programming: A New Technique In Automatic Algorithm Development, Spencer Kesson White

Theses and Dissertations

Reinforcement programming is a new technique for using computers to automatically create algorithms. By using the principles of reinforcement learning and Q-learning, reinforcement programming learns programs based on example inputs and outputs. State representations and actions are provided. A transition function and rewards are defined. The system is trained until the system converges on a policy that can be directly implemented as a computer program. The efficiency of reinforcement programming is demonstrated by comparing a generalized in-place iterative sort learned through genetic programming to a sorting algorithm of the same type created using reinforcement programming. The sort learned by reinforcement …


Optimal Adaptation Of Web Processes With Inter-Service Dependencies, Kunal Verma, Prashant Doshi, Karthik Gomadam, John A. Miller, Amit P. Sheth Jul 2006

Optimal Adaptation Of Web Processes With Inter-Service Dependencies, Kunal Verma, Prashant Doshi, Karthik Gomadam, John A. Miller, Amit P. Sheth

Kno.e.sis Publications

We present methods for optimally adapting Web processes to exogenous events while preserving inter-service dependencies. For example, in a supply chain process, orders placed by the manufacturer may get delayed in arriving. In response to this event, the manufacturer has the choice of either waiting out the delay or changing the supplier. Additionally, there may be compatibility constraints between the different orders, thereby introducing the problem of coordination between them if the manufacturer chooses to change the suppliers. We present our methods within the framework of autonomic Web processes. This framework seeks to add properties of self-configuration, adaptation, and self-optimization …


Querying Formal Contexts With Answer Set Programs, Pascal Hitzler, Markus Krotzsch Jul 2006

Querying Formal Contexts With Answer Set Programs, Pascal Hitzler, Markus Krotzsch

Computer Science and Engineering Faculty Publications

Recent studies showed how a seamless integration of formal concept analysis (FCA), logic of domains, and answer set programming (ASP) can be achieved. Based on these results for combining hierarchical knowledge with classical rule-based formalisms, we introduce an expressive common-sense query language for formal contexts. Although this approach is conceptually based on order-theoretic paradigms, we show how it can be implemented on top of standard ASP systems. Advanced features, such as default negation and disjunctive rules, thus become practically available for processing contextual data.


Geospatial Ontology Development And Semantic Analytics, I. Budak Arpinar, Cartic Ramakrishnan, Molly Azami, Amit P. Sheth, E. Lynn Usery, Mei-Po Kwan Jul 2006

Geospatial Ontology Development And Semantic Analytics, I. Budak Arpinar, Cartic Ramakrishnan, Molly Azami, Amit P. Sheth, E. Lynn Usery, Mei-Po Kwan

Kno.e.sis Publications

Geospatial ontology development and semantic knowledge discovery addresses the need for modeling, analyzing and visualizing multimodal information, and is unique in offering integrated analytics that encompasses spatial, temporal and thematic dimensions of information and knowledge. The comprehensive ability to provide integrated analysis from multiple forms of information and use of explicit knowledge make this approach unique. This also involves specification of spatiotemporal thematic ontologies and populating such ontologies with high quality knowledge. Such ontologies form the basis for defining the meaning of important relations terms, such as near or surrounded by, and enable computation of spatiotemporal thematic proximity measures we …


Cs 205-07: Computer Literacy And Office Automation, John P. Herzog Jul 2006

Cs 205-07: Computer Literacy And Office Automation, John P. Herzog

Computer Science & Engineering Syllabi

Basic computer terminology, word processing, spreadsheets, databases, and graphics.


Ceg 260-01: Digital Computer Hardware, Travis E. Doom Jul 2006

Ceg 260-01: Digital Computer Hardware, Travis E. Doom

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. 3 hours lecture, 2 hours lab. Prerequisite: CS 241.


A Distributed Hierarchical Energy-Efficient Scheme For Large Scale Mobile Wireless Ad Hoc Networks, Wasim El Hajj Jul 2006

A Distributed Hierarchical Energy-Efficient Scheme For Large Scale Mobile Wireless Ad Hoc Networks, Wasim El Hajj

Dissertations

In recent years, wireless networks have enjoyed tremendous development and popularity due to the technological advances of wireless radio devices. While interest in conventional wireless networks continues to evolve, new types of wireless networks, such as Mobile Ad Hoc Networks (MANET) and WirelessSensor Networks (WSN) are evolving fast and receiving much attention from academia, industry, and government.

Scalability and energy-efficiency present two of the most important challenges in Mobile Ad Hoc Networks. Scalability in MANETs can be defined as the capability of the network to provide an acceptable throughput when the network size increases. Energy-efficiency can be defined as using …


Crossing The Chasm: The Xid Technologies Story, Arcot Desai Narasimhalu, Roberto Mariani Jul 2006

Crossing The Chasm: The Xid Technologies Story, Arcot Desai Narasimhalu, Roberto Mariani

Research Collection School Of Computing and Information Systems

XID Technologies is a face processing start up company built initially around a disruptive face recognition technology. The technology innovation came from Kent Ridge Digital Labs, a publicly funded software research laboratory in Singapore. Face recognition is the least intrusive and harmless among the various biometric solutions available in the market. The basic approach to human face recognition is to identify a robust feature set that was unique enough to differentiate amongst the many millions of human faces that the system was required to verify. The technology innovation used by XID framed the problem differently and thereby overcame the challenges …


Brand X, A Cross-Layer Architecture For Quality Of Transport (Qot), Gregory Arthur De Hart Jun 2006

Brand X, A Cross-Layer Architecture For Quality Of Transport (Qot), Gregory Arthur De Hart

Theses and Dissertations

Computing devices are commonly equipped with multiple transport technologies such as IrDA, Bluetooth and WiFi. Transport switching technologies, such as Quality of Transport (QoT), take advantage of this heterogeneity to keep network sessions active as users move in and out of range of various transports or as the networking environment changes. Autonomous transport switching technologies rely on information regarding current network status and the ambient wireless environment in order to make intelligent decisions. This thesis proposes Brand X, a cross-layer architecture designed for a QoT environment to provide timely and accurate environment information in order to facilitate autonomous transport switching. …


A Dynamic Attribute-Based Load Shedding And Data Recovery Scheme For Data Stream Management Systems, Amit Ahuja Jun 2006

A Dynamic Attribute-Based Load Shedding And Data Recovery Scheme For Data Stream Management Systems, Amit Ahuja

Theses and Dissertations

Data streams being transmitted over a network channel with capacity less than the data rate of the data streams is very common when using network channels such as dial-up, low bandwidth wireless links. Not only does this lower capacity creates delays but also causes sequential network problems such as packet losses, network congestion, errors in data packets giving rise to other problems and creating a cycle of problems hard to break out from. In this thesis, we present a new approach for shedding the less informative attribute data from a data stream with a fixed schema to maintain a data …


Corporate Policy Management For A Financial Organization, Mavourneen W. Ballard Jun 2006

Corporate Policy Management For A Financial Organization, Mavourneen W. Ballard

Regis University Student Publications (comprehensive collection)

A large financial organization has intent of deploying a framework to support Corporate and Business Policies and Procedures. Internally, the policies and procedures lack the standardization and consistency necessary to publish policies across a large diverse organization. Additionally, the organization needs to ensure quality in the protocols and templates, products and practices as well as provide a framework to automate the support of policy and procedure administrative aspects related to content management, document retention and destruction and increased search efficiencies. Additional challenges exist external to the organization in the form of Office of the Comptroller of the Currency (OCC) requirements …


Guided Interactive Machine Learning, Aaron J. Pace Jun 2006

Guided Interactive Machine Learning, Aaron J. Pace

Theses and Dissertations

This thesis describes a combination of two current areas of research: the Crayons image classifier system and active learning. Currently Crayons provides no guidance to the user in what pixels should be labeled or when the task is complete. This work focuses on two main areas: 1) active learning for user guidance, and 2) accuracy estimation as a measure of completion. First, I provide a study through simulation and user experiments of seven active learning techniques as they relate to Crayons. Three of these techniques were specifically designed for use in Crayons. These three perform comparably to the others and …


Ontology-Based Free-Form Query Processing For The Semantic Web, Mark S. Vickers Jun 2006

Ontology-Based Free-Form Query Processing For The Semantic Web, Mark S. Vickers

Theses and Dissertations

With the onset of the semantic web, the problem of making semantic content effectively searchable for the general public emerges. Demanding an understanding of ontologies or familiarity with a new query language would likely frustrate semantic web users and prevent widespread success. Given this need, this thesis describes AskOntos, which is a system that uses extraction ontologies to convert conjunctive, free-form queries into structured queries for semantically annotated web pages. AskOntos then executes these structured queries and provides answers as tables of extracted values. In experiments conducted AskOntos was able to translate queries with a precision of 88% and a …


Development Of A Content Management System (Cms) For A Small Polling Organization, Natalia Blokhina Jun 2006

Development Of A Content Management System (Cms) For A Small Polling Organization, Natalia Blokhina

Regis University Student Publications (comprehensive collection)

This paper will address the problem of storing web page content anddocuments in a static form and howthat complicates business processes in a polling organizationthat publishes frequent reports and documents on its website. This paper will also describe how a Content Management System (CMS) can successfully resolve the problems associated with static content. The process of implementing the CMS with PHP and MySQL will also be described and illustrated. Furthermore, this paper will address the common issues that come up in project development and web development such as dealing with expanding scope, planning for change and taking advantage of the …


Masquerader Detection Using Oclep: One-Class Classification Using Length Statistics Of Emerging Patterns, Lijun Chen, Guozhu Dong Jun 2006

Masquerader Detection Using Oclep: One-Class Classification Using Length Statistics Of Emerging Patterns, Lijun Chen, Guozhu Dong

Kno.e.sis Publications

We introduce a new method for masquerader detection that only uses a user’s own data for training, called Oneclass Classification using Length statistics of Emerging Patterns (OCLEP). Emerging patterns (EPs) are patterns whose support increases from one dataset/class to another with a big ratio, and have been very useful in earlier studies. OCLEP classifies a case T as self or masquerader by using the average length of EPs obtained by contrasting T against sets of samples of a user’s normal data. It is based on the observation that one needs long EPs to differentiate instances from a common class, but …


A Metamodel And Uml Profile For Rule-Extended Owl Dl Ontologies, Saartje Brockmans, Peter Haase, Pascal Hitzler, Rudi Studer Jun 2006

A Metamodel And Uml Profile For Rule-Extended Owl Dl Ontologies, Saartje Brockmans, Peter Haase, Pascal Hitzler, Rudi Studer

Computer Science and Engineering Faculty Publications

In this paper we present a MOF compliant metamodel and UML profile for the Semantic Web Rule Language (SWRL) that integrates with our previous work on a metamodel and UML profile for OWL DL. Based on this metamodel and profile, UML tools can be used for visual modeling of rule-extended ontologies.


Mitigating Tcp Degradation Over Intermittent Link Failures Using Intermediate Buffers, M. Brent Reynolds Jun 2006

Mitigating Tcp Degradation Over Intermittent Link Failures Using Intermediate Buffers, M. Brent Reynolds

Theses and Dissertations

This thesis addresses the improvement of data transmission performance in a challenged network. It is well known that the popular Transmission Control Protocol degrades in environments where one or more of the links along the route is intermittently available. To avoid this degradation, this thesis proposes placing at least one node along the path of transmission to buffer and retransmit as needed to overcome the intermittent link. In the four-node, three-link testbed under particular conditions, file transmission time was reduced 20 fold in the case of an intermittent second link when the second node strategically buffers for retransmission opportunity.


Development Of A Malicious Insider Composite Vulnerability Assessment Methodology, William H. King Jun 2006

Development Of A Malicious Insider Composite Vulnerability Assessment Methodology, William H. King

Theses and Dissertations

Trusted employees pose a major threat to information systems. Despite advances in prevention, detection, and response techniques, the number of malicious insider incidents and their associated costs have yet to decline. There are very few vulnerability and impact models capable of providing information owners with the ability to comprehensively assess the effectiveness an organization's malicious insider mitigation strategies. This research uses a multi-dimensional approach: content analysis, attack tree framework, and an intent driven taxonomy model are used to develop a malicious insider Decision Support System (DSS) tool. The DSS tool's utility and applicability is demonstrated using a notional example. This …


Histogram Matching For Camera Pose Neighbor Selection, Parris K. Egbert, Bryan S. Morse, Kevin L. Steele Jun 2006

Histogram Matching For Camera Pose Neighbor Selection, Parris K. Egbert, Bryan S. Morse, Kevin L. Steele

Faculty Publications

A prerequisite to calibrated camera pose estimation is the construction of a camera neighborhood adjacency graph, a connected graph defining the pose neighbors of the camera set. Pose neighbors to a camera C are images containing sufficient overlap in image content with the image from C that they can be used to correctly estimate the pose of C using structure-from-motion techniques. In a video stream, the camera neighborhood adjacency graph is often a simple connected path; frame poses are only estimated relative to their immediate neighbors. We propose a novel method to build more complex camera adjacency graphs that are …


Minimum Spanning Tree Pose Estimation, Parris K. Egbert, Kevin L. Steele Jun 2006

Minimum Spanning Tree Pose Estimation, Parris K. Egbert, Kevin L. Steele

Faculty Publications

The extrinsic camera parameters from video stream images can be accurately estimated by tracking features through the image sequence and using these features to compute parameter estimates. The poses for long video sequences have been estimated in this manner. However, the poses of large sets of still images cannot be estimated using the same strategy because wide-baseline correspondences are not as robust as narrow-baseline feature tracks. Moreover, video pose estimation requires a linear or hierarchically-linear ordering on the images to be calibrated, reducing the image matches to the neighboring video frames. We propose a novel generalization to the linear ordering …


Image Vectorization, Brian L. Price May 2006

Image Vectorization, Brian L. Price

Theses and Dissertations

We present a new technique for creating an editable vector graphic from an object in a raster image. Object selection is performed interactively in subsecond time by calling graph cut with each mouse movement. A renderable mesh is then computed automatically for the selected object and each of its (sub)objects by (1) generating a coarse object mesh; (2) performing recursive graph cut segmentation and hierarchical ordering of subobjects; (3) applying error-driven mesh refinement to each (sub)object. The result is a fully layered object hierarchy that facilitates object-level editing without leaving holes. Object-based vectorization compares favorably with current approaches in the …


Separation Of Ssl Protocol Phases Across Process Boundaries, Kirthikar Anantharam May 2006

Separation Of Ssl Protocol Phases Across Process Boundaries, Kirthikar Anantharam

Theses

Secure Sockets Layer is the de-facto standard used in the industry today for secure communications through web sites. An SSL connection is established by performing a Handshake, which is followed by the Record phase. While the SSL Handshake is computationally intensive and can cause of bottlenecks on an application server, the Record phase can cause similar bottlenecks while encrypting large volumes of data.

SSL Accelerators have been used to improve the performance of SSL-based application servers. These devices are expensive, complex to configure and inflexible to customizations. By separating the SSL Handshake and the Record phases into separate software processes, …


Smart Home Technology For Aging, Fareedh Meeran May 2006

Smart Home Technology For Aging, Fareedh Meeran

Theses

The majority of the growing population, in the US and the rest of the world requires some degree of formal and or informal care either due to the loss of function or failing health as a result of aging and most of them suffer from chronic disorders. The cost and burden of caring for elders is steadily increasing. This thesis focuses on providing the analysis of the technologies with which a Smart Home is built to improve the quality of life of the elderly. A great deal of emphasis is given to the sensor technologies that are the back bone …


Semantic Empowerment Of Health Care And Life Science Applications, Amit P. Sheth May 2006

Semantic Empowerment Of Health Care And Life Science Applications, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.


Temporal Data Mining In A Dynamic Feature Space, Brent K. Wenerstrom May 2006

Temporal Data Mining In A Dynamic Feature Space, Brent K. Wenerstrom

Theses and Dissertations

Many interesting real-world applications for temporal data mining are hindered by concept drift. One particular form of concept drift is characterized by changes to the underlying feature space. Seemingly little has been done to address this issue. This thesis presents FAE, an incremental ensemble approach to mining data subject to concept drift. FAE achieves better accuracies over four large datasets when compared with a similar incremental learning algorithm.