Physical Sciences and Mathematics | Open Access Articles

Sparsification Of Social Networks Using Random Walks, Bryan Wilder

HIM 1990-2015

Analysis of large network datasets has become increasingly important. Algorithms have been designed to find many kinds of structure, with numerous applications across the social and biological sciences. However, a tradeoff is always present between accuracy and scalability; otherwise promising techniques can be computationally infeasible when applied to networks with huge numbers of nodes and edges. One way of extending the reach of network analysis is to sparsify the graph by retaining only a subset of its edges. The reduced network could prove much more tractable. For this thesis, I propose a new sparsification algorithm that preserves the properties of …

Go to article

Prototype Of An Educational Video Game For Knowledge Retention In Youth Health Education, Jennifer Vogel

HIM 1990-2015

There is some debate about the most effective and least controversial means of sex education in schools. In several states, state law does not require education about Sexually Transmitted Diseases and Human Immunodeficiency Virus Infection/Acquired Immunodeficiency Syndrome (STDs and HIV/AIDS.) There is also debate about the effect and pervasiveness of sexual situations in video games and its effect on the healthy sexual development of adolescents. This research therefore aims to try to solve these two problems and answer the following question: Is it possible to represent sex in a more realistic and educational way through a video game while teaching …

Go to article

Computation Of Boolean Formulas Using Sneak Paths In Crossbar Computing, Alvaro Velasquez

HIM 1990-2015

Memristor-based nano-crossbar computing is a revolutionary computing paradigm that does away with the traditional Von Neumann architectural separation of memory and computation units. The computation of Boolean formulas using memristor circuits has been a subject of several recent investigations. Crossbar computing, in general, has also been a topic of active interest, but sneak paths have posed a hurdle in the design of pervasive general-purpose crossbar computing paradigms. In this paper, we demonstrate that sneak paths in nano-crossbar computing can be exploited to design a Boolean-formula evaluation strategy. We demonstrate our approach on a simple Boolean formula and a 1-bit addition …

Go to article

Directory-Based Cache Coherence In Smtp Machines Without Memory Overhead Using Sparse Directories, Anton Kiriwas

HIM 1990-2015

As computing power has increased over the past few decades, science and engineering have found more and more uses for this new found computing power. With the advent of multiprocessor machines, we are achieving MIPS and FLOPS ratings previously unthought-of. Distributed shared-memory machines (DSM) are quickly becoming a powerful tool for computing, and the ability to build them from commodity off-the-shelf parts would be a great benefit to computing in general. In the paper entitled, "SMTp: An Architecture for Next-generation Scalable Multi-threading", Heinrich, et al. presents an architecture for a scalable DSM built from slightly modified machines capable of simultaneous …

Go to article

Physical Sciences and Mathematics Commons^™

Full-Text Articles in Physical Sciences and Mathematics

Sparsification Of Social Networks Using Random Walks, Bryan Wilder

HIM 1990-2015

Prototype Of An Educational Video Game For Knowledge Retention In Youth Health Education, Jennifer Vogel

HIM 1990-2015

Computation Of Boolean Formulas Using Sneak Paths In Crossbar Computing, Alvaro Velasquez

HIM 1990-2015

Directory-Based Cache Coherence In Smtp Machines Without Memory Overhead Using Sparse Directories, Anton Kiriwas

HIM 1990-2015