Physical Sciences and Mathematics Commons^™

Information Availability And Security Policy, Andrew P. Martin, Deepak Khazanchi

Information Systems and Quantitative Analysis Faculty Proceedings & Presentations

Information availability is a key element of information security. However, information availability has not been addressed with the same enthusiasm as confidentiality and integrity because availability is impacted by many variables which cannot easily be controlled. The principal goal of this research is to characterize information availability in detail and investigate how effective enterprise security policy can ensure availability.

Min–Max Hyperellipsoidal Clustering For Anomaly Detection In Network Security, Suseela T. Sarasamma, Qiuming Zhu

Computer Science Faculty Publications

A novel hyperellipsoidal clustering technique is presented for an intrusion-detection system in network security. Hyperellipsoidal clusters toward maximum intracluster similarity and minimum intercluster similarity are generated from training data sets. The novelty of the technique lies in the fact that the parameters needed to construct higher order data models in general multivariate Gaussian functions are incrementally derived from the data sets using accretive processes. The technique is implemented in a feedforward neural network that uses a Gaussian radial basis function as the model generator. An evaluation based on the inclusiveness and exclusiveness of samples with respect to specific criteria is …

An Approach To The Optimization Of Convergent Networks On Ip/Mpls With An Optical Gmpls Backbone In Multicast, Yezid Donoso, Carolina Alvarado, Alfredo J. Perez, Ivan Herazo

Computer Science Faculty Publications

This paper shows the solution of a multiobjective scheme for multicast transmissions in MPLS networks with a GMLS optical backbone using evolutive algorithms. It has not been showed models that optimize one or more parameters integrating these two types of networks. Because the proposed scheme is a NP-Hard problem, an algorithm has been developed to solve the problem on polynomial time. The main contributions of this paper are the proposed mathematical model and the algorithm to solve it.

Mutual Knowledge And Its Impact On Virtual Team Performance, Alanah Davis, Deepak Khazanchi

Information Systems and Quantitative Analysis Faculty Proceedings & Presentations

This paper describes the notion of mutual knowledge and its potential impact on virtual team performance. Based on a review of the literature, including proponents and opponents for the concept of mutual knowledge in group interaction, we suggest that there is a gap in our understanding of what is known about mutual knowledge as it impacts team dynamics and ultimately virtual team performance. We conclude the paper by discussing the importance of mutual knowledge for virtual team performance and the research issues that need to be addressed in this domain.

Electronic Medical Records: Barriers To Adoption And Diffusion, Halbana Tarmizi, Deepak Khazanchi, Cherie Noteboom

Information Systems and Quantitative Analysis Faculty Proceedings & Presentations

The primary goal of this paper is to explore why information technology (IT) solutions such as electronic medical records (EMR) have failed to gain a foothold in the healthcare sector. Based on a review of extant research, we propose a framework for classifying the barriers to the adoption and diffusion of EMR in the healthcare sector. We map all barriers reported in the literature onto the classification scheme to demonstrate its efficacy. We conclude by suggesting potential opportunities for applying the classification framework to research and practice.

Answer Set Programming Based On Propositional Satisfiability, Enrico Giunchiglia, Yuliya Lierler, Marco Maratea

Computer Science Faculty Publications

Answer set programming (ASP) emerged in the late 1990s as a new logic programming paradigm that has been successfully applied in various application domains. Also motivated by the availability of efficient solvers for propositional satisfiability (SAT), various reductions from logic programs to SAT were introduced. All these reductions, however, are limited to a subclass of logic programs or introduce new variables or may produce exponentially bigger propositional formulas. In this paper, we present a SAT-based procedure, called ASPSAT, that (1) deals with any (nondisjunctive) logic program, (2) works on a propositional formula without additional variables (except for those possibly introduced …

Elementary Sets For Logic Programs, Martin Gebser, Joohyung Lee, Yuliya Lierler

Computer Science Faculty Proceedings & Presentations

By introducing the concepts of a loop and a loop formula, Lin and Zhao showed that the answer sets of a nondisjunctive logic program are exactly the models of its Clark’s completion that satisfy the loop formulas of all loops. Recently, Gebser and Schaub showed that the Lin-Zhao theorem remains correct even if we restrict loop formulas to a special class of loops called “elementary loops.” In this paper, we simplify and generalize the notion of an elementary loop, and clarify its role. We propose the notion of an elementary set, which is almost equivalent to the notion of an …

Model Generation For Generalized Quantifiers Via Answer Set Programming, Yuliya Lierler, Günther Görz

Computer Science Faculty Proceedings & Presentations

For the semantic evaluation of natural language sentences, in particular those containing generalized quantifiers, we subscribe to the generate and test methodology to produce models of such sentences. These models are considered as means by which the sentences can be interpreted within a natural language processing system. The goal of this paper is to demonstrate that answer set programming is a simple, efficient and particularly well suited model generation technique for this purpose, leading to a straightforward implementation.

Experiments With Sat-Based Answer Set Programming, Enrico Giunchiglia, Yuliya Lierler, Marco Maratea, A. Tacchella

Computer Science Faculty Proceedings & Presentations

Answer Set Programming (ASP) emerged in the late 1990s as a new logic programming paradigm which has been successfully applied in various application domains. Propositional satisfiability (SAT) is one of the most studied problems in Computer Science. ASP and SAT are closely related: Recent works have studied their relation, and efficient SAT-based ASP solvers (like assat and Cmodels) exist. In this paper we report about (i) the extension of the basic procedures in Cmodels in order to incorporate the most popular SAT reasoning strategies, and (ii) an extensive comparative analysis involving also other state-of-the-art answer set solvers. The experimental analysis …

Organizational Transformation Through Business Models: A Framework For Business Model Design, Peter Keen, Sajda Qureshi

Information Systems and Quantitative Analysis Faculty Proceedings & Presentations

Organizations are increasingly inter-connected as they source talent, goods and services from other organizations located in disparate parts of the world. They seek new ways of creating value for themselves, customers and partners. They operate outside and across traditional industry boundaries and definitions. These innovations have lead to a focus on business models as a fundamental statement of direction and identity. This paper highlights what is known about the business model concept and where and why it differs from more established concepts of business strategy. It illustrates how the application of business models has transformed organizations. The contribution of this …

Information Systems And Health Care Xiii: Examining The Critical Requirements, Design Approaches And Evaluation Methods For A Public Health Emergency Response System, Ann L. Fruhling

Information Systems and Quantitative Analysis Faculty Publications

Research pertaining to emergency response systems has accelerated over the past few years, particularly since 9/11 events, and more recently due to Hurricane Katrina and concern over a potential of an avian flu pandemic. This study examines the requirements that are the most demanding with respect to software and hardware, and the associated design strategies for a public health emergency response system (ERS) for electronic laboratory diagnostics consultation. In addition, this study illustrates ways to evaluate the design decisions.

An important goal of a public health ERS is to improve the communication and notification of life-threatening diseases and harmful agents. …

The Impacts Of The Cascading Style Sheet Standard On Mobile Computing, Matt Germonprez, Michel Avital, Nikhil Srinivasan

Information Systems and Quantitative Analysis Faculty Publications

By design, mobile computing aims to support numerous expressions of varying interfaces, contexts, and automation. Thus, as mobile computing becomes more prevalent, it is important that designers build systems in support of as many as possible unique, in-use, and user-defined characteristics. We explore these requirements and propose to support them with two existing standardized technologies: Hypertext Markup Language (HTML) and cascading style sheets (CSS). Whereas we investigate the impact of the CSS standard in the context of computing in general and mobile computing in particular, we also focus on two emerging roles of this standard: device independence and usability. Our …

Topologies Of Agents Interactions In Knowledge Intensive Multi-Agentsystems For Networked Information Services, Qiuming Zhu

Computer Science Faculty Publications

Agents in a multi-agent system (mAS) could interact and cooperate in many different ways. The topology of agent interaction determines how the agents control and communicate with each other, what are the control and communication capabilities of each agent and the whole system, and how efficient the control and communications are. In consequence, the topology affects the agents’ ability to share knowledge, integrate knowledge, and make efficient use of knowledge in MAS. This paper presents an overview of four major MAS topologic models, assesses their advantages and disadvantages in terms of agent autonomy, adaptation, scalability, and efficiency of cooperation. Some …