OS and Networks Commons^™

The Design Of Xml-Based Model And Experiment Description Languages For Network Simulation, Andy Hallagan

Honors Theses

The Simulation Automation Framework for Experiments (SAFE) is a project created to raise the level of abstraction in network simulation tools and thereby address issues that undermine credibility. SAFE incorporates best practices in network simulationto automate the experimental process and to guide users in the development of sound scientific studies using the popular ns-3 network simulator. My contributions to the SAFE project: the design of two XML-based languages called NEDL (ns-3 Experiment Description Language) and NSTL (ns-3 Script Templating Language), which facilitate the description of experiments and network simulationmodels, respectively. The languages provide a foundation for the construction of better …

A Framework For The Automation Of Discrete-Event Simulation Experiments, Bryan Ward

Honors Theses

Simulation is an important resource for researchers in diverse fields. However, many researchers have found flaws in the methodology of published simulation studies and have described the state of the simulation community as being in a crisis of credibility. This work describes the project of the Simulation Automation Framework for Experiments (SAFE), which addresses the issues that undermine credibility by automating the workflow in the execution of simulation studies. Automation reduces the number of opportunities for users to introduce error in the scientific process thereby improvingthe credibility of the final results. Automation also eases the job of simulation users and …

Cross-Layer Design For Cooperative Wireless Sensor Networks With Multiple Optimizations, Wei Chen, Heh Miao, Liang Hong

Computer Science Faculty Research

In virtual MIMO technology, distributed single-antenna radio systems cooperate on information transmission and reception as a multiple-antenna MIMO radio system. In this paper, a cooperative transmission scheme, virtual MIMO network formation and reconfiguration algorithms, and a cooperative routing backbone are cross-layered designed for wireless sensor networks (WSNs) to jointly achieve required reliability, energy efficiency and delay reduction. The proposed cooperative transmission scheme minimizes the number of intra communications among cooperative nodes. It can save energy and reduces latency at transmission links even when the distance between cooperative nodes is large. In the proposed routing backbone, energy consumption and latency are …

Spatial Semantics For Better Interoperability And Analysis: Challenges And Experiences In Building Semantically Rich Applications In Web 3.0, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Online Application Monitoring Tool, Sathya Anandan

Master's Projects

In some classes, students take online tests and some types of network activity (for example trying to find the answers in www.google.com) will be considered as cheating during the exam. It would be useful if instructor could monitor online activities of each student to detect cheating. The goal of this project is to develop such a tool using client/server architecture. Tool should display the student's hostname and the website visited during unauthorized web activity. Professor should able to see the applications opened by all students and he will have an option to view the log files of all the students …

Self-Stabilizing Leader Election In Dynamic Networks, Hema Piniganti

UNLV Theses, Dissertations, Professional Papers, and Capstones

The leader election problem is one of the fundamental problems in distributed computing. It has applications in almost every domain. In dynamic networks, topology is expected to change frequently. An algorithm A is self-stabilizing if, starting from a completely arbitrary configuration, the network will eventually reach a legitimate configuration.

Note that any self-stabilizing algorithm for the leader election problem is also an algorithm for the dynamic leader election problem, since when the topology of the network changes, we can consider that the algorithm is starting over again from an arbitrary state. There are a number of such algorithms in the …

Dynamic Distributed Programming And Applications To Swap Edge Problem, Feven Z. Andemeskel

UNLV Theses, Dissertations, Professional Papers, and Capstones

Link failure is a common reason for disruption in communication networks. If communication between processes of a weighted distributed network is maintained by a spanning tree T, and if one edge e of T fails, communication can be restored by finding a new spanning tree, T’. If the network is 2-edge connected, T’ can always be constructed by replacing e by a single edge, e’, of the network. We refer to e’ as a swap edge of e.

The best swap edge problem is to find the best choice of e’, that is, that e which causes the new spanning …

Flexible Bootstrapping-Based Ontology Alignment, Prateek Jain, Pascal Hitzler, Amit P. Sheth

Kno.e.sis Publications

BLOOMS (Jain et al, ISWC2010) is an ontology alignment system which, in its core, utilizes the Wikipedia category hierarchy for establishing alignments. In this paper, we present a Plug-and-Play extension to BLOOMS, which allows to flexibly replace or complement the use of Wikipedia by other online or offline resources, including domain-specific ontologies or taxonomies. By making use of automated translation services and of Wikipedia in languages other than English, it makes it possible to apply BLOOMS to alignment tasks where the input ontologies are written in different languages.

Ontology Alignment For Linked Open Data, Prateek Jain, Pascal Hitzler, Amit P. Sheth, Kunal Verma, Peter Z. Yeh

Kno.e.sis Publications

The Web of Data currently coming into existence through the Linked Open Data (LOD) effort is a major milestone in realizing the Semantic Web vision. However, the development of applications based on LOD faces difficulties due to the fact that the different LOD datasets are rather loosely connected pieces of information. In particular, links between LOD datasets are almost exclusively on the level of instances, and schema-level information is being ignored. In this paper, we therefore present a system for finding schema-level links between LOD datasets in the sense of ontology alignment. Our system, called BLOOMS, is based on the …

Efficient Mining Of Multiple Partial Near-Duplicate Alignments By Temporal Network, Hung-Khoon Tan, Chong-Wah Ngo, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

This paper considers the mining and localization of near-duplicate segments at arbitrary positions of partial near-duplicate videos in a corpus. Temporal network is proposed to model the visual-temporal consistency between video sequence by embedding temporal constraints as directed edges in the network. Partial alignment is then achieved through network flow programming. To handle multiple alignments, we consider two properties of network structure: conciseness and divisibility, to ensure that the mining is efficient and effective. Frame-level matching is further integrated in the temporal network for alignment verification. This results in an iterative alignment-verification procedure to fine tune the localization of near-duplicate …

A Study Of Wireless Network Security, Ningwei Sun

All Capstone Projects

I intend to make a survey in wireless data security since wireless networks are very common, both for organizations and individuals. Many laptop computers have wireless cards pre-installed. The ability to enter a wireless network has great benefits. However, wireless networking has many security issues. Hackers have found wireless networks relatively easy to break into, and even use wireless technology to crack into wired network. As a result, it's very important that enterprises define effective wireless security policies that guard against unauthorized access to important resources.

My survey research may involve these following aspects: wireless network architecture, data security in …

Program Transformations For Information Personalization, Saverio Perugini, Naren Ramakrishnan

Computer Science Faculty Publications

Personalization constitutes the mechanisms necessary to automatically customize information content, structure, and presentation to the end user to reduce information overload. Unlike traditional approaches to personalization, the central theme of our approach is to model a website as a program and conduct website transformation for personalization by program transformation (e.g., partial evaluation, program slicing). The goal of this paper is study personalization through a program transformation lens and develop a formal model, based on program transformations, for personalized interaction with hierarchical hypermedia. The specific research issues addressed involve identifying and developing program representations and transformations suitable for classes of hierarchical …

Cyber Situational Awareness Using Live Hypervisor-Based Virtual Machine Introspection, Dustyn A. Dodge

Theses and Dissertations

In this research, a compiled memory analysis tool for virtualization (CMAT-V) is developed as a virtual machine introspection (VMI) utility to conduct live analysis during cyber attacks. CMAT-V leverages static memory dump analysis techniques to provide live dynamic system state data. Unlike some VMI applications, CMAT-V bridges the semantic gap using derivation techniques. CMAT-V detects Windows-based operating systems and uses the Microsoft Symbol Server to provide this context to the user. This research demonstrates the usefulness of CMAT-V as a situational awareness tool during cyber attacks, tests the detection of CMAT-V from the guest system level and measures its impact …

Code White: A Signed Code Protection Mechanism For Smartphones, Joseph M. Hinson Iv

Theses and Dissertations

This research develops Code White, a hardware-implemented trusted execution mechanism for the Symbian mobile operating system. Code White combines a signed whitelist approach with the execution prevention technology offered by the ARM architecture. Testing shows that it prevents all untrusted user applications from executing while allowing all trusted applications to load and run. Performance testing in contrast with an unmodified Symbian system shows that the difference in load time increases linearly as the application file size increases. The predicted load time for an application with a one megabyte code section remains well below one second, ensuring uninterrupted experience for the …

A Taxonomy-Based Model For Expertise Extrapolation, Delroy H. Cameron, Boanerges Aleman-Meza, Ismailcem Budak Arpinar, Sheron L. Decker, Amit P. Sheth

Kno.e.sis Publications

While many ExpertFinder applications succeed in finding experts, their techniques are not always designed to capture the various levels at which expertise can be expressed. Indeed, expertise can be inferred from relationships between topics and subtopics in a taxonomy. The conventional wisdom is that expertise in subtopics is also indicative of expertise in higher level topics as well. The enrichment of Expertise Profiles for finding experts can therefore be facilitated by taking domain hierarchies into account. We present a novel semantics-based model for finding experts, expertise levels and collaboration levels in a peer review context, such as composing a Program …

Ranking Documents Semantically Using Ontological Relationships, Boanerges Aleman-Meza, I. Budak Arpinar, Mustafa V. Nural, Amit P. Sheth

Kno.e.sis Publications

Although arguable success of today’s keyword based search engines in certain information retrieval tasks, ranking search results in a meaningful way remains an open problem. In this work, the goal is to use of semantic relationships for ranking documents without relying on the existence of any specific structure in a document or links between documents. Instead, real-world entities are identified and the relevance of documents is determined using relationships that are known to exist between the entities in a populated ontology. We introduce a measure of relevance that is based on traversal and the semantics of relationships that link entities …

Pattern Space Maintenance For Data Updates And Interactive Mining, Mengling Feng, Guozhu Dong, Jinyan Li, Yap-Peng Tan, Limsoon Wong

Kno.e.sis Publications

This article addresses the incremental and decremental maintenance of the frequent pattern space. We conduct an in-depth investigation on how the frequent pattern space evolves under both incremental and decremental updates. Based on the evolution analysis, a new data structure, Generator-Enumeration Tree (GE-tree), is developed to facilitate the maintenance of the frequent pattern space. With the concept of GE-tree, we propose two novel algorithms, Pattern Space Maintainer+ (PSM+) and Pattern Space Maintainer− (PSM−), for the incremental and decremental maintenance of frequent patterns. Experimental results demonstrate that the proposed algorithms, on average, outperform the representative state-of-the-art …

Cross-Market Model Adaptation With Pairwise Preference Data For Web Search Ranking, Jing Bai, Fernando Diaz, Yi Chang, Zhaohui Zheng, Keke Chen

Kno.e.sis Publications

Machine-learned ranking techniques automatically learn a complex document ranking function given training data. These techniques have demonstrated the effectiveness and flexibility required of a commercial web search. However, manually labeled training data (with multiple absolute grades) has become the bottleneck for training a quality ranking function, particularly for a new domain. In this paper, we explore the adaptation of machine-learned ranking models across a set of geographically diverse markets with the market-specific pairwise preference data, which can be easily obtained from clickthrough logs. We propose a novel adaptation algorithm, Pairwise-Trada, which is able to adapt ranking models that are trained …

Visual Occam: High Level Visualization And Design Of Process Networks, Mikolaj M. Slomka

UNLV Theses, Dissertations, Professional Papers, and Capstones

With networks, multiprocessors, and multi-threaded systems becoming more common in our world it is increasingly evident that concurrent programming is not something to be ignored or marginalized even though many takes on concurrency (mainly by means of monitors or shared resources) have proven to be difficult to deal with on large scales. Thankfully, a good deal of work has already been done to combat this, through CSP, occam, and other such derivatives, to produce a scalable process oriented paradigm. Still, it is cumbersome to attempt to deal with the intricacies of such communicating networks down to every minutia; if, instead, …

10302 Summary - Learning Paradigms In Dynamic Environments, Barbara Hammer, Pascal Hitzler

Computer Science and Engineering Faculty Publications

The seminar centered around problems which arise in the context of machine learning in dynamic environments. Particular emphasis was put on a couple of specific questions in this context: how to represent and abstract knowledge appropriately to shape the problem of learning in a partially unknown and complex environment and how to combine statistical inference and abstract symbolic representations; how to infer from few data and how to deal with non i.i.d. data, model revision and life-long learning; how to come up with efficient strategies to control realistic environments for which exploration is costly, the dimensionality is high and data …