Digital Commons Network^™

Xtagger: A New Approach To Authoring Document-Centric Xml, Ionut E. Iacob, Alex Dekhtyar

Computer Science and Software Engineering

The process of authoring document-centric XML documents in humanities disciplines is very different from the approach espoused by the standard XML editing software with the data-centric view of XML. Where data-centric XML is generated by first describing a tree structure of the encoding and then providing the content for the leaf elements, document-centric encodings start with content which is then marked up. In the paper we describe our approach to authoring document-centric XML documents and the tool, xTagger, originally developed for this purpose within the Electronic Boethius project, otherwise enhanced within the ARCHway project, an interdisciplinary project devoted to development …

Writing Math Lessons That Integrate Christian Beliefs: The Kuyers Institute Grant Project, Dave Klanderman, Gary Talsma

ACMS Conference Proceedings 2005

In this paper, we describe multiple math lessons designed to incorporate a Christian perspective. A total of nine lessons, some with materials for multiple class sessions, will soon be published by the Kuyers Institute. These lessons are appropriate for use at the middle school and high school level.

James Clerk Maxwell And Why Read Biographies, Sean Bird

ACMS Conference Proceedings 2005

Why do we read about the lives of others? This paper discusses the value of reading biographies and examines the life of physicist-mathematician James Clerk Maxwell.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 20, Number 8, June 2004, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A ten page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

A Framework For Processing Complex Document-Centric Xml With Overlapping Structures, Ionut E. Iacob, Alex Dekhtyar

Computer Science and Software Engineering

Management of multihierarchical XML encodings has attracted attention of a number of researchers both in databases [8] and in humanities[10]. Encoding documents using multiple hierarchies can yield overlapping markup. Previously proposed solutions to management of document-centric XML with overlapping markup rely on the XML expertise of humans and their ability to maintain correct schemas for complex markup languages.

We demonstrate a unified solution for management of complex, multihierarchical document-centric XML. Our framework includes software for storing, parsing, in-memory access, editing and querying, multihierarchical XML documents with conflicting structures.

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, …

Correspondence Expansion For Wide Baseline Stereo, Parris K. Egbert, Kevin L. Steele

Faculty Publications

We present a new method for generating large numbers of accurate point correspondences between two wide baseline images. This is important for structure-from-motion algorithms, which rely on many correct matches to reduce error in the derived geometric structure. Given a small initial correspondence set we iteratively expand the set with nearby points exhibiting strong affine correlation, and then we constrain the set to an epipolar geometry using RANSAC. A key point to our algorithm is to allow a high error tolerance in the constraint, allowing the correspondence set to expand into many areas of an image before applying a lower …

Active Contours Using A Constraint-Based Implicit Representation, Weiming Liu, Bryan S. Morse, Kalpathi Subramanian, Terry S. Yoo

Faculty Publications

We present a new constraint-based implicit active contour, which shares desirable properties of both parametric and implicit active contours. Like parametric approaches, their representation is compact and can be manipulated interactively. Like other implicit approaches, they can naturally adapt to non-simple topologies. Unlike implicit approaches using level-set methods, representation of the contour does not require a dense mesh. Instead, it is based on specified on-curve and off-curve constraints, which are interpolated using radial basis functions. These constraints are evolved according to specified forces drawn from the relevant literature of both parametric and implicit approaches. This new type of active contour …

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 …

Conceptual Partitioning: An Efficient Method For Continuous Nearest Neighbor Monitoring, Kyriakos Mouratidis, Marios Hadjieleftheriou, Dimitris Papadias

Research Collection School Of Computing and Information Systems

Given a set of objects P and a query point q, a k nearest neighbor (k-NN) query retrieves the k objects in P that lie closest to q. Even though the problem is well-studied for static datasets, the traditional methods do not extend to highly dynamic environments where multiple continuous queries require real-time results, and both objects and queries receive frequent location updates. In this paper we propose conceptual partitioning (CPM), a comprehensive technique for the efficient monitoring of continuous NN queries. CPM achieves low running time by handling location updates only from objects that fall in the vicinity of …

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?

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.

Learning Outcomes Oriented Assessment Methods In An Active Learning Environment, Arcot Desai Narasimhalu

Research Collection School Of Computing and Information Systems

Singapore Management University uses interactive seminar style teaching in class rooms. Most of its students hail from Singapore and are generally new to active learning and constructive participation in the seminar style classes. This paper reports findings from a freshmen first term course titled IS 101: Seminar for ISM Majors.

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.

On Assigning Place Names To Geography Related Web Pages, Wenbo Zong, Dan Wu, Aixin Sun, Ee Peng Lim, Dion Hoe-Lian Goh

Research Collection School Of Computing and Information Systems

In this paper, we attempt to give spatial semantics to web pages by assigning them place names. The entire assignment task is divided into three sub-problems, namely place name extraction, place name disambiguation and place name assignment. We propose our approaches to address these sub-problems. In particular, we have modified GATE, a well-known named entity extraction software, to perform place name extraction using a US Census gazetteer. A rule-based place name disambiguation method and a place name assignment method capable of assigning place names to web page segments have also been proposed. We have evaluated our proposed disambiguation and assignment …

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 …

Dsi: A Fully Distributed Spatial Index For Wireless Data Broadcast, Wang-Chien Lee, Baihua Zheng

Research Collection School Of Computing and Information Systems

Recent announcement of the MSN Direct Service has demonstrated the feasibility and industrial interest in utilizing wireless broadcast for pervasive information services. To support location-based services in wireless data broadcast systems, a distributed spatial index (called DSI) is proposed in this paper. DSI is highly efficient because it has a linear yet fully distributed structure that facilitates multiple search paths to be naturally mixed together by sharing links. Moreover, DSI is very resilient in error-prone wireless communication environments. Search algorithms for two classical location-based queries, window queries and kNN queries, based on DSI are presented. Performance evaluation of DSI shows …

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.

A Semi-Supervised Active Learning Framework For Image Retrieval, Steven Hoi, Michael R. Lyu

Research Collection School Of Computing and Information Systems

Although recent studies have shown that unlabeled data are beneficial to boosting the image retrieval performance, very few approaches for image retrieval can learn with labeled and unlabeled data effectively. This paper proposes a novel semi-supervised active learning framework comprising a fusion of semi-supervised learning and support vector machines. We provide theoretical analysis of the active learning framework and present a simple yet effective active learning algorithm for image retrieval. Experiments are conducted on real-world color images to compare with traditional methods. The promising experimental results show that our proposed scheme significantly outperforms the previous approaches.

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 …

Energy Balanced Broadcasting Through Delayed Intelligence, Michael R. Gosnell, Ryan Arbarelli, Maggie Xiaoyan Cheng, Bruce M. Mcmillin

Computer Science Faculty Research & Creative Works

Ad hoc wireless networks are growing in popularity and usefulness, however they rely on broadcasting as a fundamental process for routing. Improvements to broadcasting have made ad hoc networks more feasible, but sometimes benefit only specific situations. Delayed intelligence (DI) is proposed as a new load balancing approach where small delays are introduced to allow distributed responsibility delegation. Preliminary results show delayed intelligence, when applied in existing broadcasting methods such as passive clustering, can be used to improve the energy disparity and therefore extend ad hoc network lifetime.

Minimum Energy Reliable Paths Using Unreliable Wireless Links, Qunfeng Dong, Suman Banerjee, Micah Adler, Archan Misra

Research Collection School Of Computing and Information Systems

We address the problem of energy-efficient reliable wireless communication in the presence of unreliable or lossy wireless link layers in multi-hop wireless networks. Prior work [1] has provided an optimal energy efficient solution to this problem for the case where link layers implement perfect reliability. However, a more common scenario --- a link layer that is not perfectly reliable, was left as an open problem. In this paper we first present two centralized algorithms, BAMER and GAMER, that optimally solve the minimum energy reliable communication problem in presence of unreliable links. Subsequently we present a distributed algorithm, DAMER, that approximates …

Live Data Views: Programming Pervasive Applications That Use “Timely” And “Dynamic” Data, Jay Black, Paul Castro, Archan Misra, Jerome White

Research Collection School Of Computing and Information Systems

In the absence of generic programming abstractions for dynamic data in most enterprise programming environments, individual applications treat data streams as a special case requiring custom programming. With the growing number of live data sources such as RSS feeds, messaging and presence servers, multimedia streams, and sensor data. a general-purpose client-server programming model is needed to easily incorporate live data into applications. In this paper, we present Live Data Views, a programming abstraction that represents live data as a time-windowed view over a set of data streams. Live Data Views allow applications to create and retrieve stateful abstractions of dynamic …

Synthesizing E-Government Stage Models – A Meta-Synthesis Based On Meta-Ethnography Approach, Keng Siau, Y. Long

Research Collection School Of Computing and Information Systems

The growing interest in e-government raises the question of stages in e-government development. A few stage models for e-government have been proposed. Without a common e-government stage model, different research in e-government may be based on different stage models. This presents a difficulty in comparing and understanding different research results. In this research, we synthesize the existing e-government stage models so that there is a common frame of reference for researchers and practitioners in the area.

Dynamically-Optimized Context In Recommender Systems, Ghim-Eng Yap, Ah-Hwee Tan, Hwee-Hwa Pang

Research Collection School Of Computing and Information Systems

Traditional approaches to recommender systems have not taken into account situational information when making recommendations, and this seriously limits the relevance of the results. This paper advocates context-awareness as a promising approach to enhance the performance of recommenders, and introduces a mechanism to realize this approach. We present a framework that separates the contextual concerns from the actual recommendation module, so that contexts can be readily shared across applications. More importantly, we devise a learning algorithm to dynamically identify the optimal set of contexts for a specific recommendation task and user. An extensive series of experiments has validated that our …

Retesting A Model Of The Deming Management Method, Jesse Barfield, Caroline Fisher, Jing Li, Rajiv Mehta

Business and Information Technology Faculty Research & Creative Works

Anderson et al. (1994) developed a model of the theory of quality management underlying the Deming management method; Anderson et al. (1995) tested that model using path analysis. They used data from an existing database collected from 41 manufacturing plants in the electronics, machinery, and transportation industries with 100 or more employees. In this study, which retests their model, data were gathered from over 100 manufacturing and service companies of all sizes across the US and Canada. The measures used in the original study were modified to apply to both service and manufacturing organizations. The data were analysed using similar …

Protecting Group Dynamic Information In Large Scale Multicast Groups, Yongdong Wu, Tieyan Li, Robert H. Deng

Research Collection School Of Computing and Information Systems

Existing key management schemes can secure group communication efficiently, but are failed on protecting the Group Dynamic Information (GDI) that may undermine group privacy. Recently, Sun et al. proposed a scheme to hide the GDI with batch updating and phantom members inserting so that an adversary is not able to estimate the number of group members. In this paper, we first point out that their scheme is only applicable in departure-only group communication instead of the common conference groups. Secondly, we introduce our method of estimating the group size at a higher confidence level given a prior departure probability. Further, …

A New Architecture For User Authentication And Key Exchange Using Password For Federated Enterprises, Yanjiang Yang, Feng Bao, Robert H. Deng

Research Collection School Of Computing and Information Systems

The rapid rise of federated enterprises entails a new way of trust management by the fact that an enterprise can account for partial trust of its affiliating organizations. On the other hand, password has historically been used as a main means for user authentication because of operational simplicity. We are thus motivated to explore the use of short password for user authentication and key exchange in the context of federated enterprises. Exploiting the special structure of a federated enterprise, our proposed new architecture comprises an external server managed by each affiliating organization and a central server managed by the enterprise …