Computer Sciences Commons^™

How Does Information Technology Effect Development? Integrating Theory And Practice Into A Process Model, Sajda Qureshi

Information Systems and Quantitative Analysis Faculty Proceedings & Presentations

The concept of development suggests that countries and regions grow to become self-sustaining partners in what is being called the global economy. In more recent years this concept has been synonymous with the emergence of an “information society” whose wheels are oiled by information sharing and the application of knowledge. Some international agencies even propose that information and communications technologies enable development to be achieved more effectively and efficiently. While success stories abound, there is a recognition that not all investments in information technology bring about growth or economic development. So the question remains: how does information technology effect development? …

Hierarchical Kohonenen Net For Anomaly Detection In Network Security, Suseela T. Sarasamma, Qiuming Zhu, Julie Huff

Computer Science Faculty Publications

A novel multilevel hierarchicalKohonen Net (K-Map) for an intrusion detection system is presented. Each level of the hierarchical map is modeled as a simple winner-take-all K-Map. One significant advantage of this multilevel hierarchical K-Map is its computational efficiency. Unlike other statistical anomaly detection methods such as nearest neighbor approach, K-means clustering or probabilistic analysis that employ distance computation in the feature space to identify the outliers, our approach does not involve costly point-to-point computation in organizing the data into clusters. Another advantage is the reduced network size. We use the classification capability of the K-Map on selected dimensions of data …

Information Technology (It) Appropriateness: The Contingency Theory Of “Fit” And It Implementation In Small And Medium Enterprises, Deepak Khazanchi

Information Systems and Quantitative Analysis Faculty Publications

There is little doubt that advanced information and communication technologies (IT) arc changing the way businesses operate and conduct commerce. As the advent of a more secure Internet and new transmission standards makes it easier and cheaper for businesses to conduct inter-organizational commerce, it is incumbent upon SME managers to assess whether implementing new technologies such as Electronic Data Interchange (EDI) over the Internet, XML or web-based e-commerce is the "right thing to do" for their organizations. The key question implicit in this decision is addressed in this paper: "Under what conditions should businesses consider themselves likely candidates for (new) …

How To Overcome The Knowledge Paradox: Activate Knowledge Identity, Not Just Organize Information, Sajda Qureshi, Peter Keen

Information Systems and Quantitative Analysis Faculty Proceedings & Presentations

A paradox appears to thwart traditional knowledge sharing efforts in organizations: the greater the benefit of a piece of knowledge to an organization the less likely that it will be shared. This paper suggests that in order to mobilize knowledge where there is demand for it, it has to be activated. This paper considers the knowledge identity of the person whose knowledge is to be activated and uses these identities to analyze a case study in which highly distributed knowledge is activated. The analysis reveals activation effects needed to mobilize each of the knowledge identities.

Disjunctive Answer Set Programming Via Satisfiability, Yuliya Lierler

Computer Science Faculty Proceedings & Presentations

Using SAT solvers as inference engines in answer set programming systems showed to be a promising approach in building efficient systems. Nowadays SAT based answer set programming systems successfully work with nondisjunctive programs. This paper proposes a way to use SAT solvers for finding answer sets for disjunctive logic programs. We implement two different ways of SAT solver invocation used in nondisjunctive answer set programming. The algorithms are based on the definition of completion for disjunctive programs and the extension of loop formula to the disjunctive case. We propose the necessary modifications to the algorithms known for nondisjunctive programs in …

Cmodels – Sat-Based Disjunctive Answer Set Solver, Yuliya Lierler

Computer Science Faculty Proceedings & Presentations

Disjunctive logic programming under the stable model semantics [GL91] is a new methodology called answer set programming (ASP) for solving combinatorial search problems. This programming method uses answer set solvers, such as DLV [Lea05], GNT [Jea05], SMODELS [SS05], ASSAT [LZ02], CMODELS [Lie05a]. Systems DLV and GNT are more general as they work with the class of disjunctive logic programs, while other systems cover only normal programs. DLV is uniquely designed to find the answer sets for disjunctive logic programs. On the other hand, GNT first generates possible stable model candidates and then tests the candidate on the minimality using system …

Cmodels For Tight Disjunctive Logic Programs, Yuliya Lierler

Computer Science Faculty Proceedings & Presentations

Disjunctive logic programming under the stable model semantics [GL91] is a new answer set programming (ASP) methodology for solving combinatorial search problems. It is a form of declarative programming related to logic programming languages, such as Prolog, where the solutions to a problem are represented by answer sets, and not by answer substitutions produced in response to a query as in convential logic programming. Instead of Prolog systems, this programming method uses answer set solvers, such as smodels1, smodelscc2, cmodels3, dlv4, and gnt1. These systems made it possible for ASP to be successfully applied in such areas as planning, bounded …

Leveraging Human Genomic Information To Identify Nonhuman Primate Sequences For Expression Array Development, Eliot R. Spindel, Mark Pauley, Yibing Jia, Courtney Gravett, Shaun L. Thompson, Nicholas F. Boyle, Sergio R. Ojeda, Robert B. Norgren Jr.

Interdisciplinary Informatics Faculty Publications

Background: Nonhuman primates (NHPs) are essential for biomedical research due to their similarities to humans. The utility of NHPs will be greatly increased by the application of genomicsbased approaches such as gene expression profiling. Sequence information from the 3' end of genes is the key resource needed to create oligonucleotide expression arrays.

Results: We have developed the algorithms and procedures necessary to quickly acquire sequence information from the 3' end of nonhuman primate orthologs of human genes. To accomplish this, we identified terminal exons of over 15,000 human genes by aligning mRNA sequences with genomic sequence. We found …

Adaptive Decision Support For Academic Course Scheduling Using Intelligent Software Agents, Prithviraj Dasgupta, Deepak Khazanchi

Information Systems and Quantitative Analysis Faculty Publications

Academic course scheduling is a complex operation that requires the interaction between different users including instructors and course schedulers to satisfy conflicting constraints in an optimal manner. Traditionally, this problem has been addressed as a constraint satisfaction problem where the constraints are stationary over time. In this paper, we address academic course scheduling as a dynamic decision support problem using an agent-enabled adaptive decision support system. In this paper, we describe the Intelligent Agent Enabled Decision Support (IAEDS) system, which employs software agents to assist humans in making strategic decisions under dynamic and uncertain conditions. The IAEDS system has a …

A Maximal Chain Approach For Scheduling Tasks In A Multiprocessor Systems, Sachin Pawaskar, Hesham Ali

Computer Science Faculty Proceedings & Presentations

Scheduling dependent tasks is one of the most challenging versions of the scheduling problem in parallel and distributed systems. It is known to be computationally intractable in its general form as well as several restricted cases. As a result, researchers have studied restricted forms of the problem by constraining either the task graph representing the parallel tasks or the computer model. Also, in an attempt to solve the problem in the general case, a number of heuristics have been developed. In this paper, we study the scheduling problem for a fixed number of processors m. In the proposed work, we …

Bcl2 Translocation Defines A Unique Tumor Subset Within The Germinal Center B-Cell-Like Diffuse Large B-Cell Lymphoma, Javeed Iqbal, Warren G. Sanger, Andreas Rosenwald, Diane L. Pickering, Barbara Dave, Sandeep Dave, Li Xiao, Kahai Cao, Qiuming Zhu, Simon Sherman, Christine P. Hans, Dennis D. Weisenburger, Timothy C. Greiner, Randy D. Gascoyne, German Ott, H. Konrad Müller-Hermelink, Jan Delabie, Rita M. Braziel, Elaine S. Jaffe, Elias Campo, James C. Lynch, Joseph M. Conners, Julie M. Vose, James O. Armitage, Thomas M. Grogan, Louis M. Staudt, Wing C. Chan

Computer Science Faculty Publications

Gene expression profiling of diffuse large B-cell lymphoma (DLBCL) has revealed prognostically important subgroups: germinal center B-cell-like (GCB) DLBCL, activated B cell-like (ABC) DLBCL, and primary mediastinal large B-cell lymphoma. The t(14;18)(q32;q21) has been reported previously to define a unique subset within the GCB-DLBCL. We evaluated for the translocation in 141 cases of DLBCL that were successfully gene expression profiled. Using a dual-probe fluorescence in situ hybridization assay, we detected the t(14;18) in 17% of DLBCLs and in 34% of the GCB subgroup which contained the vast majority of positive cases. In addition, 12 t(14;18)-positive cases detected by polymerase chain …

Algorithmic Fusion Of Gene Expression Profiling For Diffuse Large B-Cell Lymphoma Outcome Prediction, Qiuming Zhu, Hongmei Cui, Kahai Cao, Wing C. Chan

Computer Science Faculty Publications

Many different methods and techniques have been investigated for the processing and analysis of microarray gene expression profiling datasets. It is noted that the accuracy and reliability of the results are often dependent on the measurement approaches applied, and no single measurement so far is guaranteed to generate a satisfactory result. In this paper, an algorithmic fusion approach is presented for extracting genes that are predictive to clinical outcomes (survival-fatal) of diffuse large B-cell lymphoma on a set of microarray data for gene expression profiling. The approach integrates a set of measurements from different aspects in terms of the discrepancy …

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 …

Automatic Compilation Of Protocol Insecurity Problems Into Logic Programming, Alessandro Armondo, Luca Compagna, Yuliya Lierler

Computer Science Faculty Proceedings & Presentations

In this paper we show how protocol insecurity problems expressed in a multi-set rewriting formalism can be automatically translated into logic programming problems. The proposed translation paves the way to the construction of model-checkers for security protocols based on state-of-the-art solvers for logic programs. We have assessed the effectiveness of the approach by running the proposed reduction against a selection of insecurity problems drawn from the Clark & Jacob library of security protocols: by running state-of-the-art solvers against the resulting logic programming problems most of the (known) attacks on the considered protocols are found in a few seconds.

Sat-Based Answer Set Programming, Enrico Giunchiglia, Yuliya Lierler, Marco Maratea

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 …

When Are Behaviour Networks Well-Behaved?, Bernhard Nebel, Yuliya Lierler

Computer Science Faculty Proceedings & Presentations

Agents operating in the real world have to deal with a constantly changing and only partially predictable environment and are nevertheless expected to choose reasonable actions quickly. This problem is addressed by a number of action-selection mechanisms. Behaviour networks as proposed by Maes are one such mechanism, which is quite popular. In general, it seems not possible to predict when behaviour networks are well-behaved. However, they perform quite well in the robotic soccer context. In this paper, we analyse the reason for this success by identifying conditions that make behaviour networks goal converging, i.e., force them to reach the goals …

Cmodels-2: Sat-Based Answer Set Solver Enhanced To Non-Tight Programs, Yuliya Lierler, Marco Maratea

Computer Science Faculty Proceedings & Presentations

Answer set programming is a new programming paradigm proposed in [1] and [2], and based on the answer set semantics of Prolog [3]. It is well known that an answer set for a logic program is also a model of the program’s completion [4]. The converse is true when the logic program is “tight” [6, 5]. Lin and Zhao [7] showed that for non-tight programs the models of completion which do not correspond to answer sets can be eliminated by adding to the completion what they called “loop formulas”. Nevertheless, their solver ASSAT¹ has some disadvantages: it can work …

A Study Of The Factors Related To The Successful Merger Of Information Technology Departments Within Local Government, Angela Patton

Student Work

This study focuses on the merger process of Information Technology (IT) departments within local government. The research that exists indicates that local government mergers, in general, have a high rate of failure. In addition, the political, managerial, cultural, and behavioral aspects that impact these mergers are ignored.

The importance of computers to the departments/agencies housed within local government has made the IT departments a critical part of the local government structure. This study looks at the problems faced by the merging IT departments within local government in order to gain a better understanding of this process and to increase the …

Implementation E-Commerce Application Using Lotus Domino, Jianrong Dai

Student Work

E-commerce technologies enable enterprises to exchange information instantaneously, eliminate paperwork, and advertise their products and services to a global market. The Domino Server family, an integrated messaging and Web application software platform, is easy to build and manage integrated, collaborative solutions. In this project, I build a basic functional Domino-powered e-commerce application named E-Bookstore. The EBookstore web site contains three main components of an e-commerce web site (catalog of items, shopping cart, and checkout function), and provides a powerful search function to the customer. The unique session ID for each E-Bookstore web user is generated and stored, and is attached …

Goal-Converging Behavior Networks And Self-Solving Planning Domains, Bernhard Nebel, Yuliya Lierler

Computer Science Faculty Proceedings & Presentations

Agents operating in the real world have to deal with a constantly changing and only partially predictable environment and are nevertheless expected to choose reasonable actions quickly. One way to address this problem is to use behavior networks as proposed by Maes, which support real-time decision making. Robotic soccer appears to be one domain where behavior networks have been proven to be particularly successful. In this paper, we analyze the reason for the success by identifying conditions that make behavior networks goal converging, i.e., allow them to reach the goals regardless of which particular action selection scheme is used. In …

Computing Answer Sets Of A Logic Program Via-Enumeration Of Sat Certificates, Yuliya Lierler, Marco Maratea

Computer Science Faculty Proceedings & Presentations

Answer set programming is a new programming paradigm proposed based on the answer set semantics of Prolog. It is well known that an answer set for a logic program is also a model of the program's completion. The converse is true when the logic program is "tight". Lin and Zhao showed that for non-tight programs the models of completion which do not correspond to answer sets can be eliminated by adding to the completion what they called "loop formulas". Nevertheless, their solver ASSAT 1 has some disadvantages: it can work only with basic rules, and it can compute only one …

Introducing The Global Diffusion Of The Internet Series, Peter Wolcott, Seymour E. Goodman

Information Systems and Quantitative Analysis Faculty Publications

Many genes can play a role in multiple biological processes or molecular functions. Identifying multifunctional genes at the genome-wide level and studying their properties can shed light upon the complexity of molecular events that underpin cellular functioning, thereby leading to a better understanding of the functional landscape of the cell. However, to date, genome-wide analysis of multifunctional genes (and the proteins they encode) has been limited. Here we introduce a computational approach that uses known functional annotations to extract genes playing a role in at least two distinct biological processes. We leverage functional genomics data sets for three organisms—H. sapiens, …

A Pseudo Nearest-Neighbor Approach For Missing Data Recovery On Gaussian Random Data Sets, Xiaolu Huang, Qiuming Zhu

Computer Science Faculty Publications

Missing data handling is an important preparation step for most data discrimination or mining tasks. Inappropriate treatment of missing data may cause large errors or false results. In this paper, we study the effect of a missing data recovery method, namely the pseudo- nearest neighbor substitution approach, on Gaussian distributed data sets that represent typical cases in data discrimination and data mining applications. The error rate of the proposed recovery method is evaluated by comparing the clustering results of the recovered data sets to the clustering results obtained on the originally complete data sets. The results are also compared with …

Understanding And Measuring Corporate Is Sophistication: An Exploratory Investigation Using Ground Theory, Deepak Khazanchi

Information Systems and Quantitative Analysis Faculty Publications

This paper describes the results of an exploratory study that culminated in the development of a set of theoretical dimensions for “Corporate IS Sophistication”. These indicators were developed utilizing grounded theory to analyze archival corporate data and data from in-depth interviews with functional IT executives in two Norwegian and one North American firm.

An Iterative Initial-Points Refinement Algorithm For Categorical Data Clustering, Ying Sun, Qiuming Zhu, Zhengxin Chen

Computer Science Faculty Publications

The original k-means clustering algorithm is designed to work primarily on numeric data sets. This prohibits the algorithm from being directly applied to categorical data clustering in many data mining applications. The k-modes algorithm [Z. Huang, Clustering large data sets with mixed numeric and categorical value, in: Proceedings of the First Pacific Asia Knowledge Discovery and Data Mining Conference. World Scientific, Singapore, 1997, pp. 21–34] extended the k-means paradigm to cluster categorical data by using a frequency-based method to update the cluster modes versus the k-means fashion of minimizing a numerically valued cost. However, as is …

Ventures Into Capturing Effort In Programming, Barbara Bernal-Thomas, Briana B. Morrison

Computer Science Faculty Proceedings & Presentations

The quest for teaching a method of data collection in programming experiences was marked with successes and failures. We believe that software development curricula must provide students with knowledge and experience related to the practice of data collection, which will measure the effort put into a software project. By recording their past effort in software projects, students can more accurately estimate the amount of effort and time required to complete a future software project. Students can also learn the amount of effort required to develop “correct” software and begin to estimate the amount of time required, per software phase, to …

An Empirical Analysis Of Electronic Data Interchange (Edi) Implementation Benefits In Kentucky Small- And Medium-Sized Enterprises: Some Implications For New It Implementation, Deepak Khazanchi

Information Systems and Quantitative Analysis Faculty Publications

This paper reports that the benefits accrued from implementing and integrating Electronic Data Interchange (EDI) within small and medium-sized enterprises (SMEs) can be conceptualized into two factors. First, firms derive operational/tactical benefits by predominantly focusing on increasing internal utility of this technology. Second, firms derive strategic benefits from EDI in the form of better external relationships and alliances with trading partners and an enhanced ability to compete in their market. Among other significant findings, there are clear indications from the correlation statistics reported here that experience with EDI, industrial category of a firm and the level of ED! integral ton …

Electronic Commerce Application Development: A Comparison Of User And It Professional Perspectives, Douglas Havelka, Deepak Khazanchi

Information Systems and Quantitative Analysis Faculty Proceedings & Presentations

Based on the theory of reasoned action and previous research identifying differences in beliefs between IS specialists and IS users, this paper outlines a proposed study to investigate differences/similarities in beliefs of users and developers in the context of electronic commerce application development projects. The authors are currently in the process of collecting data to address research question posed in this proposal.

Expanding The Notion Of Relevance In Is Research: A Proposal And Some Recommendations, Deepak Khazanchi, Bjørn Erik Munkvold

Information Systems and Quantitative Analysis Faculty Publications

Based on an analysis of a priori discussion on the notion of relevance, this paper proposes a holistic view of relevance in IS research. This expanded notion of relevance incorporates a broader definition of audience/stakeholder, and includes additional dimensions such as scope/value of relevant research, time frame, and "situatedness" of relevance. In view of this definition, it is argued that "practical relevance" is not the sole goal of academic research. Hence, the authors recommend, for example, that knowledge claims in IS need to be better communicated and targeted for the future development and recognition of the IS discipline.

Is Information Systems A Science? An Inquiry Into The Nature Of The Information Systems Discipline, Deepak Khazanchi, Bjørn Erik Munkvold

Information Systems and Quantitative Analysis Faculty Publications

The Information Systems (IS) discipline is apparently undergoing an identity crisis. Academicians question the need for IS departments in colleges stating the absence of a core for the field and its integration within other business functions as a basis for its elimination. At the same time, many practitioners, as reflected in the US government's recent IT labor shortage report, continue to ignore IS as a distinct field of study. This article briefly outlines these and other challenges and argues that notwithstanding underlying philosophical differences, it can be concluded that IS is an emerging scientific discipline. This conclusion is reached through …