Digital Commons Network^™

Guided Model Checking With A Bayesian Meta-Heuristic, Michael D. Jones, Peter Lamborn, Kevin Seppi

Faculty Publications

This paper presents a formal verification algorithm for finding errors in models of complex concurrent systems. The algorithm improves explicit guided model checking by applying the Empirical Bayes method to revise heuristic estimates of the distance from a given state to an error state. Guided search using the revised estimates finds errors with less search effort than the original estimates.

A Key Management Scheme For Wireless Sensor Networks Using Deployment Knowledge, Wenliang Du, Jing Deng, Yunghsiang S. Han, Shigang Chen

Electrical Engineering and Computer Science - All Scholarship

To achieve security in wireless sensor networks, it is important to be able to encrypt messages sent among sensor nodes. Keys for encryption purposes must be agreed upon by communicating nodes. Due to resource constraints, achieving such key agreement in wireless sensor networks is non-trivial. Many key agreement schemes used in general networks, such as Diffie-Hellman and public-key based schemes, are not suitable for wireless sensor networks. Pre-distribution of secret keys for all pairs of nodes is not viable due to the large amount of memory used when the network size is large. Recently, a random key predistribution scheme and …

Uncheatable Grid Computing, Wenliang Du, Jing Jia, Manish Mangal, Mummoorthy Murugesan

Electrical Engineering and Computer Science - All Scholarship

Grid computing is a type of distributed computing that has shown promising applications in many fields. A great concern in grid computing is the cheating problem described in the following: a participant is given D = {x1,...,xn}, it needs to compute f(x) for all x ∈ D and return the results of interest to the supervisor. How does the supervisor efficiently ensure that the participant has computed f(x) for all the inputs in D, rather than a subset of it? If participants get paid for conducting the task, there are incentives for cheating. In this paper, we propose a novel …

Reconstructability Analysis With Fourier Transforms, Martin Zwick

Complex Systems Faculty Publications and Presentations

Fourier methods used in two‐ and three‐dimensional image reconstruction can be used also in reconstructability analysis (RA). These methods maximize a variance‐type measure instead of information‐theoretic uncertainty, but the two measures are roughly collinear and the Fourier approach yields results close to that of standard RA. The Fourier method, however, does not require iterative calculations for models with loops. Moreover, the error in Fourier RA models can be assessed without actually generating the full probability distributions of the models; calculations scale with the size of the data rather than the state space. State‐based modeling using the Fourier approach is also …

Adaptive Intelligent User Interfaces With Emotion Recognition, Fatma Nasoz

Electronic Theses and Dissertations

The focus of this dissertation is on creating Adaptive Intelligent User Interfaces to facilitate enhanced natural communication during the Human-Computer Interaction by recognizing users' affective states (i.e., emotions experienced by the users) and responding to those emotions by adapting to the current situation via an affective user model created for each user. Controlled experiments were designed and conducted in a laboratory environment and in a Virtual Reality environment to collect physiological data signals from participants experiencing specific emotions. Algorithms (k-Nearest Neighbor [KNN], Discriminant Function Analysis [DFA], Marquardt-Backpropagation [MBP], and Resilient Backpropagation [RBP]) were implemented to analyze the collected data signals …

Distributed Hybrid Agent Based Intrusion Detection And Real Time Response System, Vaidehi Kasarekar, Byrav Ramamurthy

School of Computing: Conference and Workshop Papers

Wireless LANs are growing rapidly and security has always been a concern. We have implemented a hybrid system, which will not only detect active attacks like identity theft causing denial of service attacks, but will also detect the usage of access point discovery tools. The system responds in real time by sending out an alert to the network administrator.

A Load-Balancing Shared-Protection-Path Reconfiguration Approach In Wdm Wavelength-Routed Networks, Lu Shen, Xi Yang, Byrav Ramamurthy

School of Computing: Conference and Workshop Papers

Wavelength-routed networks (WRN) are very promising candidates for next-generation Internet and telecommunication backbones. In such a network, optical-layer protection is of paramount importance due to the risk of losing large amounts of data under a failure. To protect the network against this risk, service providers usually provide a pair of risk-independent working and protection paths for each optical connection. However, the investment made for the optical-layer protection increases network cost. To reduce the capital expenditure, service providers need to efficiently utilize their network resources. Among all the existing approaches, shared-path protection has proven to be practical and cost-efficient [1]. In …

Imsh: An Iterative Heuristic For Srlg Diverse Routing In Wdm Mesh Networks, Ajay Todimala, Byrav Ramamurthy

School of Computing: Conference and Workshop Papers

Survivable routing of a connection involves computation of a pair of diverse routes such that at most one mute fails when failures occur in the network topology. A subset of links in the network that share the risk of failure at the same time are said to belong to a Shared Risk Link Group (SRLG) [3]. A network with shared risk link groups defined over its links is an SRLG network. A failure of an SRLG is equivalent to the failure of all the links in the SRLG. For a connection to he survivable in an SRLG network its working …

Survivable Traffic Grooming With Differentiated End-To-End Availability Guarantees In Wdm Mesh Networks, Wang Yao, Byrav Ramamurthy

School of Computing: Conference and Workshop Papers

Traffic grooming is critical in WDM optical metropolitan area networks (MANS), where low-rate connections are packed onto high-rate wavelength paths (lightpaths). Various applications in the MAN demand different levels of reliability. Therefore, it is necessary to provision connections with differentiated reliability guarantees in the MAN. In this paper, we first present an analytical model to calculate the availability of connections using different protection schemes in WDM optical MANs with general mesh topologies. Then we propose and simulate two grooming algorithms which can provision availability guaranteed connections based on per-connection requirements.

A Gcd Attack Resistant Crthacs For Secure Group Communications, Xukai Zou, Byrav Ramamurthy, Spyros S. Magliveras

School of Computing: Conference and Workshop Papers

In this paper, we propose an improved CRTHACS scheme for secure group communications. The scheme resists several GCD attacks which exist in the original CRTHACS scheme [2] and were recently reported in [1].

Infrastructure Support For Controlled Experimentation With Software Testing And Regression Testing Techniques, Hyunsook Do, Sebastian Elbaum, Gregg Rothermel

School of Computing: Conference and Workshop Papers

Where the creation, understanding, and assessment of software testing and regression testing techniques are concerned, controlled experimentation is an indispensable research methodology. Obtaining the infrastructure necessary to support such experimentation, however, is difficult and expensive. As a result, progress in experimentation with testing techniques has been slow, and empirical data on the costs and effectiveness of techniques remains relatively scarce. To help address this problem, we have been designing and constructing infrastructure to support controlled experimentation with testing and regression testing techniques. This paper reports on the challenges faced by researchers experimenting with testing techniques, including those that inform the …

An Extended Kernel For Generalized Multiple-Instance Learning, Qingping Tao, Stephen Scott, N. V. Vinodchandran, Thomas Takeo Osugi, Brandon Mueller

School of Computing: Conference and Workshop Papers

The multiple-instance learning (MIL) model has been successful in areas such as drug discovery and content-based image-retrieval. Recently, this model was generalized and a corresponding kernel was introduced to learn generalized MIL concepts with a support vector machine. While this kernel enjoyed empirical success, it has limitations in its representation. We extend this kernel by enriching its representation and empirically evaluate our new kernel on data from content-based image retrieval, biological sequence analysis, and drug discovery. We found that our new kernel generalized noticeably better than the old one in content-based image retrieval and biological sequence analysis and was slightly …

Statistical Procedures For Evaluating Daily And Monthly Hydrologic Model Predictions, Marilyn E. Coffey, Stephen R. Workman, Joseph L. Taraba, Alex W. Fogle

Biosystems and Agricultural Engineering Faculty Publications

The overall study objective was to evaluate the applicability of different qualitative and quantitative methods for comparing daily and monthly SWAT computer model hydrologic streamflow predictions to observed data, and to recommend statistical methods for use in future model evaluations. Statistical methods were tested using daily streamflows and monthly equivalent runoff depths. The statistical techniques included linear regression, Nash-Sutcliffe efficiency, nonparametric tests, t-test, objective functions, autocorrelation, and cross-correlation. None of the methods specifically applied to the non-normal distribution and dependence between data points for the daily predicted and observed data. Of the tested methods, median objective functions, sign test, autocorrelation, …

Approximating First-Order Logic Programs By Feedforward Networks, Pascal Hitzler

Computer Science and Engineering Faculty Publications

We want to apply Funahashi's theorem in order to approximate the T_P operator for first-order (normal) logic programs P via 3-layer feedforward networks. I.e. we need to understand T_P as a continuous function on the reals.

We will need to study some preliminaries from set-theoretic topology first result from [HS00, HHS0_x], which extends results from [HKS99]. We close with some further considerations about the methods and results.

Semantic Integration Of Glycomics Data And Information, William S. York, Amit P. Sheth, Krzysztof J. Kochut, John A. Miller, Christopher Thomas, Karthik Gomadam, X. Yi, Meenakshi Nagarajan

Kno.e.sis Publications

No abstract provided.

Discovering And Ranking Semantic Associations Over A Large Rdf Metabase, Christian Halaschek-Wiener, Boanerges Aleman-Meza, I. Budak Arpinar, Amit P. Sheth

Kno.e.sis Publications

Information retrieval over semantic metadata has recently received a great amount of interest in both industry and academia. In particular, discovering complex and meaningful relationships among this data is becoming an active research topic. Just as ranking of documents is a critical component of today's search engines, the ranking of relationships will be essential in tomorrow's semantic analytics engines. Building upon our recent work on specifying these semantic relationships, which we refer to as Semantic Associations, we demonstrate a system where these associations are discovered among a large semantic metabase represented in RDF. Additionally we employ ranking techniques to provide …

Art Network Discussion, Paul Thomas

Creative Connections Symposium @ BEAP2004 September 4, 2004

No abstract provided.

Speech Enabled E-Learning Technology For Adult Literacy Tutoring, Jason Meade

Theses

This research presents the work involved in developing a speech-enabled e-Learning prototype for use in literacy tutoring. As the main objective was to develop an interface for literacy learning, initial research concentrated on establishing a framework for literacy e-Leaming through the use of speech technology. Requirements for best practice e-Learning and the relevance of learning theories to an e-Learning application were also investigated. The technologies to facilitate this, such as text to speech technologies and mark-up languages, were addressed during the implementation of speech-enabled prototypes. Both server-side and client-side prototypes were implemented to investigate speech technology. Testing found the server-side …

Creating A Video Device Application, Kevin Septor

Honors Theses

A video device, such as a webcam, has the capability to be used in many ways, including recording video and behaving like a security camera. A TV tuner card can also record video, and in addition be used for watching television. However, the video hardware and device driver the operating system uses to access it are only capable of delivering raw frames of video. A user space application is necessary for exploiting the capabilities of such a device beyond reading sequential frames of video. This research explores the desiderata in a powerful video device application, and introduces a program that …

A Similarity Based Concordance Approach To Word Sense Disambiguation, Ramakrishnan B. Guru

Masters Theses

This study attempts to solve the problem of Word Sense Disambiguation using a combination of statistical, probabilistic and word matching algorithms. These algorithms consider that words and sentences have some hidden similarities and that the polysemous words in any context should be assigned to a sense after each execution of the algorithm. The algorithm was tested with sufficient sample data and the efficiency of the disambiguation performance has proven to increase significantly after the inclusion of the concordance methodology.

Using Spki/Sdsi For Distributed Maintenance Of Attribute Release Policies In Shibboleth, Sidharth Nazareth, Sean W. Smith

Computer Science Technical Reports

The Shibboleth middleware from Internet2 provides a way for users at higher-education institutions to access remote electronic content in compliance with the inter-institutional license agreements that govern such access. To protect end-user privacy, Shibboleth permits users to construct attribute release policies that control what user credentials a given content provider can obtain. However, Shibboleth leaves unspecified how to construct these policies. To be effective, a solution needs to accommodate the typical nature of a university: a set of decentralized fiefdoms. This need argues for a public-key infrastructure (PKI) approach---since public-key cryptography does not require parties to agree on a secret …

A Sat-Based Polynomial Space Algorithm For Answer Set Programming, Enrico Giunchiglia, Marco Maratea, Yuliya Lierler

Computer Science Faculty Proceedings & Presentations

The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance boost of SAT solvers during last years. Various translations from ASP to SAT are known but the resulting SAT formula either includes many new variables or may have an unpractical size. There are also well known results showing a one-to-one correspondence between the answer sets of a logic program and the models of its completion. Unfortunately, these results only work for specific classes of problems.

In this paper we present a SAT-Based decision procedure for …

A Fast And Simple Algorithm For Computing M-Shortest Paths In State Graph, M. Sherwood, Laxmi P. Gewali, Henry Selvaraj, Venkatesan Muthukumar

Electrical & Computer Engineering Faculty Research

We consider the problem of computing m shortest paths between a source node s and a target node t in a stage graph. Polynomial time algorithms known to solve this problem use complicated data structures. This paper proposes a very simple algorithm for computing all m shortest paths in a stage graph efficiently. The proposed algorithm does not use any complicated data structure and can be implemented in a straightforward way by using only array data structure. This problem appears as a sub-problem for planning risk reduced multiple k-legged trajectories for aerial vehicles.

Development Of A Systems Engineering Model Of The Chemical Separations Process, Yitung Chen, Darrell Pepper, Sean Hsieh

Separations Campaign (TRP)

The chemical processing of used nuclear fuel is an integral component of any strategy for the transmutation of nuclear waste. Due to the large volume of material that must be handled in this first step of the transmutation process, the efficiency of the separations process is a key factor in the potential economic viability of the transmutation strategies. The ability to optimize the chemical separation systems is vital to ensure the feasibility of the transmutation program.

Systems analysis, or total systems modeling, is one of the strongest tools available to researchers for understanding and optimizing complex systems such as chemical …

Coalgebras And Modal Expansions Of Logics, Alexander Kurz, Alessandra Palmigiano

Engineering Faculty Articles and Research

In this paper we construct a setting in which the question of when a logic supports a classical modal expansion can be made precise. Given a fully selfextensional logic S, we find sufficient conditions under which the Vietoris endofunctor V on S-referential algebras can be defined and we propose to define the modal expansions of S as the logic that arises from the V-coalgebras. As an example, we also show how the Vietoris endofunctor on referential algebras extends the Vietoris endofunctor on Stone spaces. From another point of view, we examine when a category of ‘spaces’ (X,A), ie sets X …

Staging Transformations For Multimodal Web Interaction Management, Michael Narayan, Christopher Williams, Saverio Perugini, Naren Ramakrishnan

Computer Science Faculty Publications

Multimodal interfaces are becoming increasingly ubiquitous with the advent of mobile devices, accessibility considerations, and novel software technologies that combine diverse interaction media. In addition to improving access and delivery capabilities, such interfaces enable flexible and personalized dialogs with websites, much like a conversation between humans. In this paper, we present a software framework for multimodal web interaction management that supports mixed-initiative dialogs between users and websites. A mixed-initiative dialog is one where the user and the website take turns changing the flow of interaction. The framework supports the functional specification and realization of such dialogs using staging transformations – …

Program Transformations For Information Personalization, Saverio Perugini

Computer Science Faculty Publications

Personalization constitutes the mechanisms and technologies necessary to customize information access to the end-user. It can be defined as the automatic adjustment of information content, structure, and presentation. The central thesis of this dissertation is that modeling interaction explicitly in a representation, and studying how partial information can be harnessed in it by program transformations to direct the flow of the interaction, can provide insight into, reveal opportunities for, and define a model for personalized interaction. To evaluate this thesis, a formal modeling methodology is developed for personalizing interactions with information systems, especially hierarchical hypermedia, based on program transformations. The …

Automatically Generating Interfaces For Personalized Interaction With Digital Libraries, Saverio Perugini, Naren Ramakrishnan, Edward A. Fox

Computer Science Faculty Publications

We present an approach to automatically generate interfaces supporting personalized interaction with digital libraries; these interfaces augment the user-DL dialog by empowering the user to (optionally) supply out-of-turn information during an interaction, flatten or restructure the dialog, and inquire about dialog options. Interfaces generated using this approach for CITIDEL are described.

Empowering Agents Within Virtual Environments, Alan Martin, Brian Duffy, Gregory O'Hare, Bianca Schoen-Phelan, John Bradley

Conference Papers

An agent’s embodiment within a virtual environment refers to its representation, and defines its capabilities, within the environment. This paper presents a system for the strong integration of embodiment with the agent’s deliberative mechanism. This mechanism is based upon the Belief-Desire-Intention (BDI) paradigm, and allows the agent to deliberate directly upon the location and animation of its embodiment. This fusion then provides the agent with the ability to freely mutate its embodied form to best suit the task at hand. At the same time, care must be taken to preserve the agents’ sense of self, so that users have a …

An Emergent Framework For Self-Motivation In Developmental Robotics, James Marshall, Doug Blank, Lisa Meeden

Computer Science Faculty Research and Scholarship

This paper explores a philosophy and connectionist al- gorithm for creating a long-term, self-organizing develop- mental robot control system. This intrinsic algorithm and architecture implements self-motivation by creating a sys- tem capable of anticipating its next state, while simultane- ously attempting to seek out that which it cannot predict. These competing internal pressures are designed to drive the system in a manner reminiscent of a co-evolutionary arms race.