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

Computer Sciences Commons

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

University of Texas at Arlington

Discipline
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 661 - 666 of 666

Full-Text Articles in Computer Sciences

Game Theoretical Models And Algorithms For Rate Control In Video Compression, Jiancong Luo Jul 2005

Game Theoretical Models And Algorithms For Rate Control In Video Compression, Jiancong Luo

Computer Science and Engineering Dissertations - Archive

This thesis investigates game theory based rate control algorithms for optimizing the bit allocation in video compression. The first algorithm utilizes the cooperative bargaining game in a MB level rate control algorithm to optimize the perceptual quality while guaranteeing "fairness" in bit allocation among macroblocks. The algorithm first allocates the target bits to frames based on their coding complexity; a method to estimate the coding complexity of the remaining frames is proposed. Next, macroblocks of a frame play cooperative games such that each macroblock competes for a share of resources (bits) to optimize its quantization scale while considering the human …


Group Key Distribution Via Local Collaboration In Wireless Sensor Networks, Anuj Chadha Jul 2005

Group Key Distribution Via Local Collaboration In Wireless Sensor Networks, Anuj Chadha

Computer Science and Engineering Theses - Archive

Wireless sensor networks have been recognized as one of the most important technologies in the networking world. Security of sensor networks is one of the major concerns today. To this end, a whole suite of protocols have been designed to provide various security features which includes key management. This thesis covers the issue of group key management in wireless sensor networks. Traditional cryptographic techniques can be used to provide communication privacy and integrity, but do not provide scalable solutions to group key management. A group key management scheme for sensor networks has been discussed that targets at fast response to …


Distributed Streaming For Video On Demand, Shraddha Rumade Jul 2005

Distributed Streaming For Video On Demand, Shraddha Rumade

Computer Science and Engineering Theses - Archive

With the advent of digital media, implementing reliable Video on Demand (VoD) systems over the best effort Internet is a potential issue. Distributed streaming for Video on Demand presents a combination of two techniques. The first being Distributed Video Streaming using Multicast (DVSM) [1] involves video streaming from multiple servers to overcome path congestion. The second technique, Asynchronous Hybrid mechanism for Video on Demand [2] implements segmentation-based periodic broadcast to effectively share network bandwidth. In this work we aim at providing path diversity of multiple senders and maximizing bandwidth sharing via multicast. We exploit alternate paths in case of congestion …


Automating Inhabitant Interactions In Home And Workplace Environments Through Data-Driven Generation Of Hierarchical Partially-Observable Markov Decision Processes, Gregory Michael Youngblood Jul 2005

Automating Inhabitant Interactions In Home And Workplace Environments Through Data-Driven Generation Of Hierarchical Partially-Observable Markov Decision Processes, Gregory Michael Youngblood

Computer Science and Engineering Dissertations - Archive

Markov models provide a useful representation of system behavioral actions and state observations, but they do not scale well. Utilizing a hierarchy and abstraction through hierarchical hidden Markov models (HHMMs) improves scalability, but these structures are usually constructed manually using knowledge engineering techniques. We introduce a new method of automatically constructing HHMMs using the output of a sequential data-mining algorithm, Episode Discovery, and apply it to solving automation problems in the intelligent environment domain. Repetitive behavioral actions in sensor rich environments such as smart homes can be observed and categorized into periodic and frequent episodes through data-mining techniques utilizing the …


A Framework For Model Checking Object Oriented Security Protocol Implementations, Parikshit Singh Jun 2005

A Framework For Model Checking Object Oriented Security Protocol Implementations, Parikshit Singh

Computer Science and Engineering Theses - Archive

With the rapid growth of the Internet, more and more vendors see the Internet as a viable marketplace. Since the Internet is public, providing security in the presence of malicious intruders has become paramount. Security protocols have been proposed to protect systems. These protocols work by exchanging messages, many of which are encrypted. Though it may take a long time for an intruder to break the underlying encryption employed by the protocol, it is possible for the intruder to intervene in the authentication process. It may take years before a crucial loophole is discovered in a security protocol. Until then, …


Graphical Event-Directed Scenario Behavioral Specifications For The Scenario-Based Engineering Process (Sep) Using A Domain Specific Software Architecture (Assa) Philosophy, Miao Xia Dec 1993

Graphical Event-Directed Scenario Behavioral Specifications For The Scenario-Based Engineering Process (Sep) Using A Domain Specific Software Architecture (Assa) Philosophy, Miao Xia

Computer Science and Engineering Theses - Archive

This thesis extends scenarios of a system into real-time event digraphs. A scenario is an event trace resulting from a particular thread of system execution. An event digraph is an event network. Multiple external stimuli result in a wave of execution in distributed and parallel architecture. A graph theoretic formal definition for event digraphs is developed with the finite sets of events and the scenario event order (SEO). A scenario language is developed from the event digraph. In modeling an event digraph, we introduce the frontier expansion mechanism which let the users and the developers go around the question if …