Digital Commons Network^™

A Scenario-Based Performance Evaluation Of Multicast Routing Protocols For Ad Hoc Networks, Manoj Pandey, Daniel Zappala

Faculty Publications

Current ad hoc multicast routing protocols have been designed to build and maintain a tree or mesh in the face of a mobile environment, with fast reaction to network changes in order to minimize packet loss. However, the performance of these protocols has not been adequately examined under realistic scenarios. Existing performance studies generally use a single, simple mobility model, with low density and often very low traffic rates. In this paper we explore the performance of ad hoc multicast routing protocols under scenarios that include realistic mobility patterns, high density and high traffic load. We use these scenarios to …

Edition Production Technology: An Eclipse Based Platform For Building Image-Based Electronic Editions, Ionut E. Iacob, Alex Dekhtyar, Jerzy W. Jaromczyk, Kevin Kiernan, Neil Moore, Dorothy Carr Porter

Computer Science and Software Engineering

No abstract provided.

The Analysis Of A Link Between A Remote Local Area Network And Its Server Resources, Theresa D. Beaver

Theses and Dissertations

As the Air Force transitions to an expeditionary force, the service's ability to provide computer capabilities at remote locations becomes more and more paramount. One way to provide this support is to create a Local Area Network (LAN) in which the workstations are positioned at the deployed location while the servers are maintained at a Main Operating Base (MOB). This saves the military money, because it eliminates the need to purchase and deploy server equipment as well as eliminating the need to deploy personnel to set-up and maintain the servers. There is, however, a tradeoff. As the number of personnel …

Towards A Systematic Account Of Different Semantics For Logic Programs, Pascal Hitzler

Computer Science and Engineering Faculty Publications

A new methodology has been proposed which allows one to derive uniform characterizations of different declarative semantics for logic programs with negation. One result from this work is that the well-founded semantics can formally be understood as a stratified version of the Fitting (or Kripke–Kleene) semantics. The constructions leading to this result, however, show a certain asymmetry which is not readily understood. We study this situation here with the result that we obtain a coherent picture of relations between different semantics for normal logic programs.

Semantic Management Of Web Services Using The Core Ontology Of Services, Daniel Oberle, Steffen Lamparter, Andreas Eberhart, Stephan Grimm, Sudhir Agarwal, Rudi Studer, Pascal Hitzler

Kno.e.sis Publications

Different Web Service standards like WSDL, WS-Security, WS-Policy etc., henceforth referred to as WS*, factorize Web Service management tasks into different aspects, such as input/output, workflow, or security. The advantages of WS* are multiple and have already achieved industrial impact. WS* descriptions are exchangeable and developers may use different implementations for the same Web Service description. The disadvantages of WS*, however, are also apparent: even though the different standards are complementary, they must overlap and one may produce models composed of different WS* descriptions, which are inconsistent with each other, but the reasons for the inconsistencies are not easily determined. …

Auto-Pipe: A Pipeline Design And Evaluation System, Mark A. Franklin, John Maschmeyer, Eric Tyson, James Buckley, Patrick Crowley

All Computer Science and Engineering Research

Auto-Pipe is a tool that aids in the design, evaluation, and implementation of pipelined applications that are distributed across a set of heterogeneous devices including multiple processors and FPGAs. It has been developed to meet the needs arising in the domains of communications, computation on large datasets, and real time streaming data applications. In this paper, the Auto-Pipe design flow is introduced and two sample applications, developed for compatibility with the Auto-Pipe system, are presented. The sample applications are the Triple-DES encryption standard and a subset of the signal-processing pipeline for VERITAS, a high-energy gamma-ray astrophysics experiment. These applications are …

Analysis Of A Wi-Fi Hotspot Network, David P. Blinn, Tristan Henderson, David Kotz

Dartmouth Scholarship

Wireless hotspot networks have become increasingly popular in recent years as a means of providing Internet access in public areas such as restaurants and airports. In this paper we present the first study of such a hotspot network. We examine five weeks of SNMP traces from the Verizon Wi-Fi HotSpot network in Manhattan. We find that far more cards associated to the network than logged into it. Most clients used the network infrequently and visited few APs. AP utilization was uneven and the network displayed some unusual patterns in traffic load. Some characteristics were similar to those previously observed in …

Phishing Warden: Enhancing Content-Triggered Trust Negotiation To Prevent Phishing Attacks, James Presley Henshaw

Theses and Dissertations

Phishing attacks are spam e-mails that attempt to fool recipients into divulging their identifying information by posing as a message from a well known company and using that company's branding and logos. It is estimated that phishing attacks have cost bank and credit card customers $1.2 billion in the U.S. in 2003. Previous work, content-triggered trust negotiation (CTTN), filters Internet traffic for sensitive data, and prevents a user from disclosing sensitive information to an un-trusted server. However, existing CTTN implementations are vulnerable to client-side scripts that obfuscate any data the client's browser sends to the web server in order to …

Knowledge Management Mechanisms Of Financial Service Sites, Fiona Fui-Hoon Nah, Keng Siau, Y. Tian

Research Collection School Of Computing and Information Systems

How can we effectively acquire, use, and manage knowledge via the Web?

Explicit Building Block Multiobjective Evolutionary Computation: Methods And Applications, Richard O. Day

Theses and Dissertations

This dissertation presents principles, techniques, and performance of evolutionary computation optimization methods. Concentration is on concepts, design formulation, and prescription for multiobjective problem solving and explicit building block (BB) multiobjective evolutionary algorithms (MOEAs). Current state-of-the-art explicit BB MOEAs are addressed in the innovative design, execution, and testing of a new multiobjective explicit BB MOEA. Evolutionary computation concepts examined are algorithm convergence, population diversity and sizing, genotype and phenotype partitioning, archiving, BB concepts, parallel evolutionary algorithm (EA) models, robustness, visualization of evolutionary process, and performance in terms of effectiveness and efficiency. The main result of this research is the development of …

A Framework For Routing And Topological Decision-Making Within A Transformational Communications Architecture, Alexander I. Smith

Theses and Dissertations

A Transformational Communications Architecture (TCA) has been proposed by the US government with the goal of creating "an Internet in the sky." This thesis presents a framework which places user requirements at the heart of routing and topological decision-making within the TCA. It provides new terminology to describe data transmissions and link characteristics and an approach to formulating cost functions to better meet user needs. The framework is intended to stimulate interest and focus efforts on how to meet military specific requirements by taking advantage of the TCA's diverse capabilities and topology. Cost functions using newly-defined parameters are simulated and …

An Evolutionary Algorithm To Generate Hyper-Ellipsoid Detectors For Negative Selection, Joseph M. Shapiro, Gary B. Lamont, Gilbert L. Peterson

Faculty Publications

This paper introduces hyper-ellipsoids as an improvement to hyper-spheres as intrusion detectors in a negative selection problem within an artificial immune system. Since hyper-spheres are a specialization of hyper-ellipsoids, hyper-ellipsoids retain the benefits of hyper-spheres. However, hyper-ellipsoids are much more flexible, mostly in that they can be stretched and reoriented. The viability of using hyper-ellipsoids is established using several pedagogical problems. We conjecture that fewer hyper-ellipsoids than hyper-spheres are needed to achieve similar coverage of nonself space in a negative selection problem. Experimentation validates this conjecture. In pedagogical benchmark problems, the number of hyper-ellipsoids to achieve good results is significantly …

Evaluating G-Portal For Geography Learning And Teaching, Chew-Hung Chang, John G. Hedberg, Yin-Leng Theng, Ee Peng Lim, Tiong-Sa Teh, Dion Hoe-Lian Goh

Research Collection School Of Computing and Information Systems

This paper describes G-Portal, a geospatial digital library of geographical assets, providing an interactive platform to engage students in active manipulation and analysis of information resources and collaborative learning activities. Using a G-Portal application in which students conducted a field study of an environmental problem of beach erosion and sea level rise, we describe a pilot study to evaluate usefulness and usability issues to support the learning of geographical concepts, and in turn teaching.

Efficient Anonymous Roaming And Its Security Analysis, Guomin Yang, Duncan S. Wong, Xiaotie Deng

Research Collection School Of Computing and Information Systems

The Canetti-Krawczyk (CK) model uses resuable modular components to construct indistinguishability-based key exchange protocols. The reusability of modular protocol components makes it easier to construct and prove new protocols when compared with other provably secure approaches. In this paper, we build an efficient anonymous and authenticated key exchange protocol for roaming by using the modular approach under the CK-model. Our protocol requires only four message flows and uses only standard cryptographic primitives. We also propose a one-pass counter based MT-authenticator and show its security under the assumption that there exists a MAC which is secure against chosen message attack.

Verifying Completeness Of Relational Query Results In Data Publishing, Hwee Hwa Pang, Arpit Jain, Krithi Ramamritham, Kian-Lee Tan

Research Collection School Of Computing and Information Systems

In data publishing, the owner delegates the role of satisfying user queries to a third-party publisher. As the publisher may be untrusted or susceptible to attacks, it could produce incorrect query results. In this paper, we introduce a scheme for users to verify that their query results are complete (i.e., no qualifying tuples are omitted) and authentic (i.e., all the result values originated from the owner). The scheme supports range selection on key and non-key attributes, project as well as join queries on relational databases. Moreover, the proposed scheme complies with access control policies, is computationally secure, and can be …

Aggregate Nearest Neighbor Queries In Spatial Databases, Dimitris Papadias, Yufei Tao, Kyriakos Mouratidis, Chun Kit Hui

Research Collection School Of Computing and Information Systems

Given two spatial datasets P (e.g., facilities) and Q (queries), an aggregate nearest neighbor (ANN) query retrieves the point(s) of P with the smallest aggregate distance(s) to points in Q. Assuming, for example, n users at locations q1,...qn, an ANN query outputs the facility p belongs to P that minimizes the sum of distances |pqi| for 1 is less than or equal to i is less than or equal to n that the users have to travel in order to meet there. Similarly, another ANN query may report the point p belongs to P that minimizes the maximum distance that …

Breaking Public Key Cryptosystems On Tamper Resistant Devices In The Presence Of Transient Faults, Feng Bao, Robert H. Deng, Y. Han, A. Jeng, Arcot Desai Narasimhalu, T. Ngair

Research Collection School Of Computing and Information Systems

In this paper we present a method of attacking public-key cryptosystems (PKCs) on tamper resistant devices. The attack makes use of transient faults and seems applicable to many types of PKCs. In particular, we show how to attack the RSA, the E1Gamal signature scheme, the Schnorr signature scheme, and the DSA. We also present some possible methods to counter the attack.

Detecting Malicious Vbscripts Using Anomaly Host Based Ids Based On Principal Component Analysis (Pca), Racha El Sokkary

Archived Theses and Dissertations

Intrusion detection research over the last twenty years has focused on the threat of individuals illegally hacking into systems. Nowadays, intrusion threat to computer systems has changed radically. Instead of dealing with hackers, most current works focus on defending the system against code-driven attacks. Today’s web script codes such as VBScript are receiving increasing focus as a backdoor for attacking many computers through e-mail attachments or infected web sites. The nature of these malicious codes is that they can spread widely causing serious damages to many applications. Moreover, the majority of anti-virus tools used today are able to detect known …

Capturing Design Patterns For Performance Issues In Database-Driven Web Applications, Osama Mabroul Khaled

Archived Theses and Dissertations

The Design patterns technology is a new research topic which aims at helping with communicating technical knowledge in a standard non-technical format. People coming from different technical backgrounds can share this knowledge and apply it in their own way. For example, pieces of designs could be the same for different applications but they get implemented using different programming languages. On the other hand, web applications are becoming more widely spread, especially e-commerce ones, which make light returns on investment and achieve good relations between the companies and the customers. To stabilize this relationship, a web application must have a good …

Parallel Versus Iterated: Comparing Population Oriented And Chained Sequential Simulated Annealing Approaches To Cost-Based Abduction, Heba Abdallah Amer

Archived Theses and Dissertations

Stochastic search techniques are used to solve NP-hard combinatorial optimization problems. Simulated annealing, genetic algorithms and hybridization of both, all attempt to find the best solution with minimal cost and time. Guided Evolutionary Simulated Annealing is one technique of such hybridization. It is based on evolutionary programming where a number of simulated annealing chains are working in a generation to find the optimum solution for a problem. Abduction is the problem of finding the best explanation to a given set of observations. In AI, this has been modeled by a set of hypotheses that need to be assumed to prove …

The Effects Of Digital Audio On Social Presence, Motivation And Perceived Learning In Asynchronous Learning Networks, Eunhee Kim

Dissertations

This study explores the possibilities of applying digital audio to the ALN environment, so that students can speak and listen rather than type and read. Two sets of 1x2 field experiments (text vs. digital audio) were conducted with two formats of digital audio -recorded voice messages and narrated Microsoft PowerPoint presentation - used in several NJIT courses conducted via ALN. The perceptions of communication media were measured from two different user perspectives: active use when the subjects created their assignments using prescribed communication media (audio or text) and passive use when the subjects viewed/listened to other students' work.

The perceptions …

Some Topics On Deterministic Scheduling Problems, Yumei Huo

Dissertations

Sequencing and scheduling problems are motivated by allocation of limited resources over time. The goal is to find an optimal allocation where optimality is defined by some problem specific objectives.

This dissertation considers the scheduling of a set of ri tasks, with precedence constraints, on m >= 1 identical and parallel processors so as to minimize the makespan. Specifically, it considers the situation where tasks, along with their precedence constraints, are released at different times, and the scheduler has to make scheduling decisions without knowledge of future releases. Both preemptive and nonpreemptive schedules are considered. This dissertation shows that optimal …

Scheduling Policies For Disks And Disk Arrays, Chang Liu

Dissertations

Recent rapid advances of magnetic recording technology have enabled substantial increases in disk capacity. There has been less than 10% improvement annually in the random access time to small data blocks on the disk. Such accesses are very common in OLTP applications, which tend to have stringent response time requirements. Scheduling of disk requests is intended to improve their response time, reduce disk service time, and increase disk access bandwidth with respect to the default FCFS scheduling policy.

Shortest Access Time First policy has been shown to outperform other classical disk scheduling policies in numerous studies. Before verifying this conclusion, …

Image Watermarking, Steganography, And Morphological Processing, Yi-Ta Wu

Dissertations

With the fast development of computer technology, research in the fields of multimedia security, image processing, and robot vision have recently become popular. Image watermarking, steganogrphic system, morphological processing and shortest path planning are important subjects among them. In this dissertation, the fundamental techniques are reviewed first followed by the presentation of novel algorithms and theorems for these three subjects.

The research on multimedia security consists of two parts, image watermarking and steganographic system. In image watermarking, several algorithms are developed to achieve different goals as shown below. In order to embed more watermarks and to minimize distortion of watermarked …

Collaborative Examinations In Asyncronous Learning Networks : Field Experiments On Collaborative Learning Through Online Assessments, Jia Shen

Dissertations

With the proliferation of computer networks and the emergence of virtual teams, learning and knowledge sharing in the online environment has become an increasingly important topic. Applying constructivism and collaborative learning theories to assessment, the collaborative online exam is designed featuring students' active participation in various phases of the exam process through small group activities online. A participatory online exam process is designed featuring similar procedures except that students' involvement in each phase of the exam is individual. The collaborative online exam and the participatory online exam are investigated regarding student exam study strategies, group process, exam outcomes, faculty satisfaction, …

Algorithms And Complexity Analyses For Some Combinational Optimization Problems, Hairong Zhao

Dissertations

The main focus of this dissertation is on classical combinatorial optimization problems in two important areas: scheduling and network design.

In the area of scheduling, the main interest is in problems in the master-slave model. In this model, each machine is either a master machine or a slave machine. Each job is associated with a preprocessing task, a slave task and a postprocessing task that must be executed in this order. Each slave task has a dedicated slave machine. All the preprocessing and postprocessing tasks share a single master machine or the same set of master machines. A job may …

Just-In-Time Hypermedia, Li Zhang

Dissertations

Many analytical applications, especially legacy systems, create documents and display screens in response to user queries "dynamically" or in real time . These documents and displays do not exist in advance, and thus hypermedia must be generated 'just in time" -automatically and dynamically.

This dissertation details the idea of 'just-in-time" hypermedia and discusses challenges encountered in this research area. A fully detailed literature review about the research issues and related research work is given. A framework for the 'just-in-time" hypermedia compares virtual documents with static documents, as well as dynamic with static hypermedia functionality. Conceptual 'just-in-time" hypermedia architecture is proposed …

High-Dimensional Indexing Methods Utilizing Clustering And Dimensionality Reduction, Lijuan Zhang

Dissertations

The emergence of novel database applications has resulted in the prevalence of a new paradigm for similarity search. These applications include multimedia databases, medical imaging databases, time series databases, DNA and protein sequence databases, and many others. Features of data objects are extracted and transformed into high-dimensional data points. Searching for objects becomes a search on points in the high-dimensional feature space. The dissimilarity between two objects is determined by the distance between two feature vectors. Similarity search is usually implemented as nearest neighbor search in feature vector spaces. The cost of processing k-nearest neighbor (k-NN) queries via a sequential …

Improving Document Representation By Accumulating Relevance Feedback : The Relevance Feedback Accumulation (Rfa) Algorithm, Razvan Stefan Bot

Dissertations

Document representation (indexing) techniques are dominated by variants of the term-frequency analysis approach, based on the assumption that the more occurrences a term has throughout a document the more important the term is in that document. Inherent drawbacks associated with this approach include: poor index quality, high document representation size and the word mismatch problem. To tackle these drawbacks, a document representation improvement method called the Relevance Feedback Accumulation (RFA) algorithm is presented. The algorithm provides a mechanism to continuously accumulate relevance assessments over time and across users. It also provides a document representation modification function, or document representation learning …

Order Scheduling In Dedicated And Flexible Machine Environments, Haibing Li

Dissertations

Order scheduling models are relatively new in the field of scheduling. Consider a facility with m parallel machines that can process k different products (job types). Each machine can process a given subset of different product types. There are n orders from n different clients. Each order requests specific quantities of the various different products that can be produced concurrently on their given subsets of machines; it may have a release date, a weight and a due date. Preemptions may be allowed. An order can not be shipped until the processing of all the products for the order has been …