Matching Items (4)
Filtering by

Clear all filters

149703-Thumbnail Image.png
Description
This dissertation studies routing in small-world networks such as grids plus long-range edges and real networks. Kleinberg showed that geography-based greedy routing in a grid-based network takes an expected number of steps polylogarithmic in the network size, thus justifying empirical efficiency observed beginning with Milgram. A counterpart for the grid-based

This dissertation studies routing in small-world networks such as grids plus long-range edges and real networks. Kleinberg showed that geography-based greedy routing in a grid-based network takes an expected number of steps polylogarithmic in the network size, thus justifying empirical efficiency observed beginning with Milgram. A counterpart for the grid-based model is provided; it creates all edges deterministically and shows an asymptotically matching upper bound on the route length. The main goal is to improve greedy routing through a decentralized machine learning process. Two considered methods are based on weighted majority and an algorithm of de Farias and Megiddo, both learning from feedback using ensembles of experts. Tests are run on both artificial and real networks, with decentralized spectral graph embedding supplying geometric information for real networks where it is not intrinsically available. An important measure analyzed in this work is overpayment, the difference between the cost of the method and that of the shortest path. Adaptive routing overtakes greedy after about a hundred or fewer searches per node, consistently across different network sizes and types. Learning stabilizes, typically at overpayment of a third to a half of that by greedy. The problem is made more difficult by eliminating the knowledge of neighbors' locations or by introducing uncooperative nodes. Even under these conditions, the learned routes are usually better than the greedy routes. The second part of the dissertation is related to the community structure of unannotated networks. A modularity-based algorithm of Newman is extended to work with overlapping communities (including considerably overlapping communities), where each node locally makes decisions to which potential communities it belongs. To measure quality of a cover of overlapping communities, a notion of a node contribution to modularity is introduced, and subsequently the notion of modularity is extended from partitions to covers. The final part considers a problem of network anonymization, mostly by the means of edge deletion. The point of interest is utility preservation. It is shown that a concentration on the preservation of routing abilities might damage the preservation of community structure, and vice versa.
ContributorsBakun, Oleg (Author) / Konjevod, Goran (Thesis advisor) / Richa, Andrea (Thesis advisor) / Syrotiuk, Violet R. (Committee member) / Czygrinow, Andrzej (Committee member) / Arizona State University (Publisher)
Created2011
155962-Thumbnail Image.png
Description
Programming is quickly becoming as ubiquitous and essential a skill as general mathematics. However, many elementary and high school students are still not aware of what the computer science field entails. To make matters worse, students who are introduced to computer science are frequently being fed only part of what

Programming is quickly becoming as ubiquitous and essential a skill as general mathematics. However, many elementary and high school students are still not aware of what the computer science field entails. To make matters worse, students who are introduced to computer science are frequently being fed only part of what it is about rather than its entire construction. Consequently, they feel out of their depth when they approach college. Research has discovered that by teaching computer science and programming through a problem-driven approach and focusing on a combination of syntax and computational thinking, students can be prepared when entering higher levels of computer science education.

This thesis describes the design, development, and early user testing of a theory-based virtual world for computer science instruction called System Dot. System Dot was designed to visually manifest programming instructions into interactable objects, giving players a way to see coding as tangible entities rather than text on a white screen. In order for System Dot to convey the true nature of computer science, a custom predictive recursive descent parser was embedded in the program to validate any user-generated solutions to pre-defined logical platforming puzzles.

Steps were taken to adapt the virtual world to player behavior by creating a system to detect their learning style playing the game. Through a dynamic Bayesian network, System Dot aims to classify a player’s learning style based on the Felder-Sylverman Learning Style Model (FSLSM). Testers played through the first half of System Dot, which was enough to test out the Bayesian network and initial learning style classification. This classification was then compared to the assessment by Felder’s Index of Learning Styles Questionnaire (ILSQ). Lastly, this thesis will also discuss ways to use the results from the user testing to implement a personalized feedback system for the virtual world in the future and what has been learned through the learning style method.
ContributorsKury, Nizar (Author) / Nelson, Brian C (Thesis advisor) / Hsiao, Ihan (Committee member) / Kobayashi, Yoshihiro (Committee member) / Arizona State University (Publisher)
Created2017
155101-Thumbnail Image.png
Description
The purpose of this study was to investigate the impacts of three types of instructional presentation methods on learning, efficiency, cognitive load, and learner attitude. A total of 67 employees of a large southwestern university working in the field of research administration were randomly assigned to one of three

The purpose of this study was to investigate the impacts of three types of instructional presentation methods on learning, efficiency, cognitive load, and learner attitude. A total of 67 employees of a large southwestern university working in the field of research administration were randomly assigned to one of three conditions. Each condition presented instructional materials using a different method, namely dynamic integrated, dynamic non-integrated, or non-dynamic non-integrated. Participants completed a short survey, pre-test, cognitive load questions, learner attitude questions, and a post-test during their experience. The results reveal that users of the dynamic integrated condition treatment showed significant improvement in both learning and efficiency. The dynamic non-integrated participants had a faster mean time to complete an assigned task, however, they also had significantly lower average test scores. There were no other significant findings in terms of cognitive load or learner attitude. Limitations, implications and future studies are discussed.
ContributorsBrown, Andrew (Author) / Nelson, Brian (Thesis advisor) / Savenye, Wilhelmina (Committee member) / Atkinson, Robert (Committee member) / Arizona State University (Publisher)
Created2016
155620-Thumbnail Image.png
Description
Video capture, storage, and distribution in wireless video sensor networks

(WVSNs) critically depends on the resources of the nodes forming the sensor

networks. In the era of big data, Internet of Things (IoT), and distributed

demand and solutions, there is a need for multi-dimensional data to be part of

the

Video capture, storage, and distribution in wireless video sensor networks

(WVSNs) critically depends on the resources of the nodes forming the sensor

networks. In the era of big data, Internet of Things (IoT), and distributed

demand and solutions, there is a need for multi-dimensional data to be part of

the Sensor Network data that is easily accessible and consumable by humanity as

well as machinery. Images and video are expected to become as ubiquitous as is

the scalar data in traditional sensor networks. The inception of video-streaming

over the Internet, heralded a relentless research for effective ways of

distributing video in a scalable and cost effective way. There has been novel

implementation attempts across several network layers. Due to the inherent

complications of backward compatibility and need for standardization across

network layers, there has been a refocused attention to address most of the

video distribution over the application layer. As a result, a few video

streaming solutions over the Hypertext Transfer Protocol (HTTP) have been

proposed. Most notable are Apple’s HTTP Live Streaming (HLS) and the Motion

Picture Experts Groups Dynamic Adaptive Streaming over HTTP (MPEG-DASH). These

frameworks, do not address the typical and future WVSN use cases. A highly

flexible Wireless Video Sensor Network Platform and compatible DASH (WVSNP-DASH)

are introduced. The platform's goal is to usher video as a data element that

can be integrated into traditional and non-Internet networks. A low cost,

scalable node is built from the ground up to be fully compatible with the

Internet of Things Machine to Machine (M2M) concept, as well as the ability to

be easily re-targeted to new applications in a short time. Flexi-WVSNP design

includes a multi-radio node, a middle-ware for sensor operation and

communication, a cross platform client facing data retriever/player framework,

scalable security as well as a cohesive but decoupled hardware and software

design.
ContributorsSeema, Adolph (Author) / Reisslein, Martin (Thesis advisor) / Kitchen, Jennifer (Committee member) / Seeling, Patrick (Committee member) / Zhang, Yanchao (Committee member) / Arizona State University (Publisher)
Created2017