Research Papers, Essays, Term Papers.
Computer Sciences
Type: thesis. Topic: Computer Sciences. Code: info0027.
Format: pdf. Pages: 172
Format: pdf. Pages: 172
A framework for semantic web implementation
The Semantic Web is the vision of the future Web. Its aim is to enable machines to process Web documents in a way that makes it possible for the computer software to "understand" the meaning of the document contents. Each document on the Semantic Web is to be enriched with meta-data that express the semantics of its contents. Many infrastructures, technologies and standards have been developed and have proven their theoretical use for the Semantic Web, yet very few applications have been created. Most of the current Semantic Web applications were developed for research purposes. This project investigates the major factors restricting the wide spread of Semantic Web applications. We identify the two most important requirements for a successful implementation as the automatic production of the semantically annotated document, and the creation and maintenance of semantic based knowledge base. This research proposes a framework for Semantic Web implementation based on context-oriented controlled automatic Annotation; for short, we called the framework the Semantic Web Implementation Framework (SWIF) and the system that implements this framework the Semantic Web Implementation System (SWIS). The proposed architecture provides for a Semantic Web implementation of stand-alone websites that automatically annotates Web pages before being uploaded to the Intranet or Internet, and maintains persistent storage of Resource Description Framework (RDF) data for both the domain memory, denoted by Control Knowledge, and the meta-data of the Web site¿s pages. We believe that the presented implementation of the major parts of SWIS introduce a competitive system with current state of art Annotation tools and knowledge management systems; this is because it handles input documents in the ii context in which they are created in addition to the automatic learning and verification of knowledge using only the available computerized corporate databases. In this work, we introduce the concept of Control Knowledge (CK) that represents the application¿s domain memory and use it to verify the extracted knowledge. Learning is based on the number of occurrences of the same piece of information in different documents. We introduce the concept of Verifiability in the context of Annotation by comparing the extracted text¿s meaning with the information in the CK and the use of the proposed database table Verifiability_Tab. We use the linguistic concept Thematic Role in investigating and identifying the correct meaning of words in text documents, this helps correct relation extraction. The verb lexicon used contains the argument structure of each verb together with the thematic structure of the arguments. We also introduce a new method to chunk conjoined statements and identify the missing subject of the produced clauses. We use the semantic class of verbs that relates a list of verbs to a single property in the ontology, which helps in disambiguating the verb in the input text to enable better information extraction and Annotation. Consequently we propose the following definition for the annotated document or what is sometimes called the ¿Intelligent Document¿ ¿The Intelligent Document is the document that clearly expresses its syntax and semantics for human use and software automation¿. This work introduces a promising improvement to the quality of the automatically generated annotated document and the quality of the automatically extracted information in the knowledge base. Our approach in the area of using Semantic Web iii technology opens new opportunities for diverse areas of applications. E-Learning applications can be greatly improved and become more effective.
Pay with PayPal
Price: 4.99 GBP (5.96 EUR, 7.85 USD)
Type: thesis. Topic: Computer Sciences. Code: info0002.
Format: pdf. Pages: 120
Format: pdf. Pages: 120
A Publish-Subscribe System for Data Replication and Synchronization Among Integrated Person-Centric Information Systems
Synchronization of data across an integrated system of heterogeneous databases is a difficult but important task, especially in the context of integrating health care information throughout a region, state, or nation. This thesis describes the design and implementation of a data replication and synchronization tool, called the Sync Engine, which allows users to define custom data-sharing patterns and transformations for an integrated system of heterogeneous person-centric databases. This thesis also discusses the relationship between the Sync Engine`s contributions and several relevant issues in the area of data integration and replication. The Sync Engine`s design and implementation was validated by adapting it to CHARM, a real world integrated system currently in use at the Utah Department of Health
Pay with PayPal
Price: 4.99 GBP (5.96 EUR, 7.85 USD)
Type: thesis. Topic: Computer Sciences. Code: info0019.
Format: pdf. Pages: 120
Format: pdf. Pages: 120
Achieving self-managed deployment in a distributed environment via utility functions
This dissertation presents algorithms and mechanisms that enable self-managed, scalable and efficient deployment of large-scale scientific and engineering applications in a highly dynamic and unpredictable distributed environment. Typically these applications are composed of a large number of distributed components and it is important to meet the computational power and network bandwidth requirements of those components and their interactions. However satisfying these requirements in a large-scale, shared, heterogeneous, and highly dynamic distributed environment is a significant challenge. As systems and applications grow in scale and complexity, attaining the desired level of performance in this uncertain environment using current approaches based on global knowledge, centralized scheduling and manual reallocation becomes infeasible. This dissertation focuses on the modeling of the application and underlying architecture into a common abstraction and on the incorporations of autonomic features into those abstractions to achieve self-managed deployment. In particular, we developed techniques for automatically identifying application components and their estimated resource requirements within an application and used them in order to model the application into a graph abstraction. We also developed techniques that allow the distributed resources to self-organize in a utility-aware way while assuming minimal knowledge about the system. Finally, to achieve self-managed deployment of application components to the distributed nodes, we designed a scalable and adaptive scheduling algorithm which is governed by a utility function. The utility function, which combines several application and system level attributes, governs both the initial deployment of the application components and their reconfigurations despite the dynamism and uncertainty associated with the computing environment. The experimental results show that it is possible to achieve and maintain efficient deployment by applying the utility function derived in this paper based solely on locally available information and without costly global communication or synchronization. The self-management is therefore decentralized and provides better adaptability, scalability and robustness.
Pay with PayPal
Price: 4.99 GBP (5.96 EUR, 7.85 USD)
Type: thesis. Topic: Computer Sciences. Code: info0020.
Format: pdf. Pages: 82
Format: pdf. Pages: 82
Apriori approach to graph-based clustering of text documents
This thesis report introduces a new technique of document clustering based on frequent senses. The developed system, named GDClust (Graph-Based Document Clustering) [1], works with frequent senses rather than dealing with frequent keywords used in traditional text mining techniques. GDClust presents text documents as hierarchical document-graphs and uses an Apriori paradigm to find the frequent subgraphs, which reflect frequent senses. Discovered frequent subgraphs are then utilized to generate accurate sense-based document clusters. We propose a novel multilevel Gaussian minimum support strategy for candidate subgraph generation. Additionally, we introduce another novel mechanism called Subgraph-Extension mining that reduces the number of candidates and overhead imposed by the traditional Apriori-based candidate generation mechanism. GDClust utilizes an English language thesaurus (WordNet [2]) to construct document-graphs and exploits graph-based data mining techniques for sense discovery and clustering. It is an automated system and requires minimal human interaction for the clustering purpose.
Pay with PayPal
Price: 4.99 GBP (5.96 EUR, 7.85 USD)
Type: thesis. Topic: Computer Sciences. Code: info0003.
Format: pdf. Pages: 70
Format: pdf. Pages: 70
Automated Data Type Identification And Localization
This research presents a new and unique technique called SÁDI, statistical analysis data identification, for identifying the type of data on a digital device and its storage format based on data type, specifically the values of the bytes representing the data being examined. This research incorporates the automation required for specialized data identification tools to be useful and applicable in real-world applications. The SÁDI technique utilizes the byte values of the data stored on a digital storage device in such a way that the accuracy of the technique does not rely solely on the potentially misleading metadata information but rather on the values of the data itself. SÁDI provides the capability to identify what digitally stored data actually represents. The identification of the relevancy of data is often dependent upon the identification of the type of data being examined. Typical file type identification is based upon file extensions or magic keys. These typical techniques fail in many typical forensic analysis scenarios, such as needing to deal with embedded data, as in the case of Microsoft Word files or file fragments. These typical techniques for file identification can also be easily circumvented, and individuals with nefarious purposes often do so.
Pay with PayPal
Price: 3.99 GBP (4.77 EUR, 6.27 USD)
Type: thesis. Topic: Computer Sciences. Code: info0021.
Format: pdf. Pages: 57
Format: pdf. Pages: 57
Automated radio network design using ant colony optimization
Radio networks can provide reliable communication for rural intelligent transportation systems (ITS). Engineers manually design these radio networks by selecting tower locations and equipment while meeting a series of constraints such as coverage, bandwidth, maximum delay, and redundancy, all while minimizing network cost. As network size and constraints grow, the design process can quickly become overwhelming. In this thesis we model the network design problem (NDP) as a generalized Steiner tree-star (GSTS) problem. Any solution to the minimum Steiner tree (MST) problem on a constructed GSTS graph will directly identify the tower locations and equipment needed to build the network at an optimal cost. The direct MST solution can only satisfy coverage constraints. Because the MST problem is known to be NP-hard, our research applies ant colony optimization (ACO) to find near-optimal MST solutions. Using ACO also allows us to meet bandwidth, maximum delay, and redundancy constraints. We verify that our approach finds near-optimal designs by comparing it against a 2-approximation algorithm in several different scenarios.
Pay with PayPal
Price: 4.99 GBP (5.96 EUR, 7.85 USD)
Type: thesis. Topic: Computer Sciences. Code: info0005.
Format: pdf. Pages: 120
Format: pdf. Pages: 120
Better Application Security
Static analysis tools analyze source code for vulnerabilities. However, these types of tools suffer from various problems that limit their effectiveness. This thesis examines these static analysis tools and suggests techniques for making them more efficient at detecting different types of vulnerabilities. The thesis further analyzes possible causes for these vulnerabilities by examining the source code written by programmers of various categories. Finally, this thesis discusses solutions and techniques to improve general security awareness as well as the importance of secure coding among the students and software developers.
Pay with PayPal
Price: 4.99 GBP (5.96 EUR, 7.85 USD)
Type: thesis. Topic: Computer Sciences. Code: info0016.
Format: pdf. Pages: 53
Format: pdf. Pages: 53
Channel Assignment in Multi-Radio Wireless Mesh Networks
Wireless mesh networks offer many advantages in terms of connectivity and reliability. They provide multiple paths between nodes and are self healing. Traditionally, wireless mesh networks were typically used with nodes equipped with a single radio. There are however, limitations in single radio wireless mesh network, such as lower throughput and its limited use of the available wireless channels. This thesis focuses on the Hybrid Channel Allocation scheme which efficiently utilizes multiple wireless interfaces to achieve better throughput thereby increasing the network capacity. In this thesis we introduce and evaluate different methods to improve the network throughput of a multi radio wireless mesh network. We present the Random and Greedy channel assignment protocols which utilize multiple radio interfaces to improve the throughput and minimize the radio interference of the wireless network. We also implement the Superimposed Code based channel assignment proposed in [5], to evaluate and compare its performance with the Random and Greedy protocols. These channel assignment protocols allow different nodes in the same network to communicate with each other without causing too much interference to their neighbors. Network scenarios have been designed using the discrete event simulator Opnet Modeler 11.5TM. These network scenarios have been created to compare and evaluate the performance of the channel assignment protocols under different conditions. Simulation results are presented and discussed.
Pay with PayPal
Price: 4.99 GBP (5.96 EUR, 7.85 USD)
Type: thesis. Topic: Computer Sciences. Code: info0015.
Format: pdf. Pages: 59
Format: pdf. Pages: 59
Cougaar Agent Architecture
The Cougaar distributed agent architecture, originally a DARPA-funded research project, provides a platform for developing distributed agent systems. Testing its ability to solve complex problems using a large number of agents in an interesting topic of research. In this thesis, the Cougaar distributed agent architecture is studied from the standpoint of Sudoku. Through analysis and experimentation, insight is gained into both the properties and weaknesses of Cougaar. Cougaar`s performance when solving Sudoku puzzles is then compared with other Sudoku solving techniques. The Cougaar agent approach solves Sudoku puzzles in a human-like fashion, reaching solutions using both analysis and guessing. Cougaar is shown to be capable of solving Sudoku puzzles in a distributed agent architecture. Although not as fast as traditional techniques, the Cougaar distributed agent approach is able to provide solutions to Sudoku puzzles using fewer guesses. Additionally, solving Sudoku puzzles with Cougaar exposed some reliability issues and demonstrated the overhead required for communication. These results open the way for additional study of Cougaar.
Pay with PayPal
Price: 4.99 GBP (5.96 EUR, 7.85 USD)
Type: thesis. Topic: Computer Sciences. Code: info0029.
Format: pdf. Pages: 190
Format: pdf. Pages: 190
Database Metadata Requirements for Automated Web Development
The Web has come a long way. It started as a distributed document repository and quickly became the spring board for a new type of application. Propped on top of the original HTML+HTTP architecture, this new application platform shifted the way the architecture was used so that commands and functionality were embedded in the form data of Web requests rather than in the HTTP command conveying the request. This approach enabled Web requests to convey any type of data, not just document operations. This is occurring because the Web provides such a powerful platform on which to create applications. This is occurring because web development methods are still evolving toward the structure and stability required taking on this enormous new role.
As the needs of developers change, certain themes that arise more frequently than others become embedded into new environments to support those needs. Until recently, Web application programming has largely been done with a set of keywords and metaphors developed long before the Web became a popular place to program. APIs have been developed to support Web specific features, but they are no replacement for fundamental changes in the programming environment itself. The growth of Web applications requires a new type of programming designed specifically for the needs of the Web.
This thesis aims to contribute towards the development of an abstract framework to generate abstract and dynamic Web user interfaces that are not developed to a specific platform. To meet this aim, this thesis suggests a general implementation of a prototype system that uses the information in database metadata in conjunction with PHP. Database metadata is richer in providing the information needed to build dynamic user interfaces. This thesis uses PHP and the abstract library ADOdb to provide us with a generalised database metadata based prototype. PHP does not have any restrictions on accessing and extracting database metadata from numerous database management systems. As a result, PHP and relational database were used to build the proposed framework. Additionally, ADOdb was used to link the two mentioned technologies.
The implemented framework in this thesis demonstrates that it is possible to generate different automatic Web entry forms that are not specific at any platform.
Pay with PayPal
Price: 4.99 GBP (5.96 EUR, 7.85 USD)
