Computer Sciences Commons^™

Exploring Parameterized Relational Consistency, Shant K. Karakashian, Robert J. Woodward, Berthe Y. Choueiry

School of Computing: Technical Reports

Consistency properties and algorithms for achieving them are at the heart of the success of Constraint Programming. For non-binary Constraint Satisfaction Problems (CSPs), the relational-consistency property R(i,j)C of [Dechter and van Beek 1997] may add new non-binary constraints to the constraint network, thus modifying its topology. The domain-filtering properties of [Bessiere et al. 2008] filter the domains of the variables and leave the constraints unchanged but are restricted to combinations of two constraints. We restate the property of m-wise consistency [Gyssens 1986; Jegou 1993] as relational (*,m)-consistency, R(*,m)C. R(*,m)C ensures that any tuple in a relation is consistent in every …

"Your Cell Will Teach You Everything": Old Wisdom, Modern Science, And The Art Of Attention, Noreen L. Herzfeld

Computer Science Faculty Publications

Here is a brief excerpt of the content:

A brother came to Scetis to visit Abba Moses and asked him "Father, give me a word." The old man said to him "Go, sit in your cell, and your cell will teach you everything." ¹ Among the Desert Fathers, Christian monks of the fourth and fifth centuries, it was customary for a novice to go to an elder and ask for "a word," a word of advice, of counsel, a word to take home and reflect on. What does this word of advice say to us today?

A Multitasking World

"Your …

Naïve Bayes And Similarity Based Methods For Identifying Computer Users Using Keystroke Patterns, Shrijit S. Joshi

Doctoral Dissertations

In this dissertation, we present two methods for identifying computer users using keystroke patterns. In the first method "Competition between naïve Bayes models for user identification," a naïve Bayes model is created for each user. In the training phase of this method, the model of a user is trained using maximum likelihood estimation on the key press latency values extracted from the texts typed by the user. In the user identification phase of this method, for each user we determine the probabilistic likelihood that the typed text belongs to a user. Finally, the typed text is assigned to the user …

Maze Maps & Benchmark Problems, Nathan R. Sturtevant

Moving AI Lab: 2D Maps and Benchmark Problems

Contains 60 maps of size 512x512 and benchmark problem sets. These maps are algorithm-generated mazes with corridor widths of 1, 2, 4, 8, 16, or 32. There are 10 maps and problem sets for each corridor size.

Classification And Cluster Analysis Of Complex Time-Of-Flight Secondary Ion Mass Spectrometry For Biological Samples, Stephen E. Reichenbach, Xue Tian, Qingping Tao, Alex Henderson

School of Computing: Conference and Workshop Papers

Identifying and separating subtly different biological samples is one of the most critical tasks in biological analysis. Time-of-flight secondary ion mass spectrometry (ToF-SIMS) is becoming a popular and important technique in the analysis of biological samples, because it can detect molecular information and characterize chemical composition. ToF-SIMS spectra of biological samples are enormously complex with large mass ranges and many peaks. As a result the classification and cluster analysis are challenging. This study presents a new classification algorithm, the most similar neighbor with a probability-based spectrum similarity measure (MSN- PSSM), which uses all the information in the entire ToF- SIMS …

Spatio-Temporal Event Model For Cyber-Physical Systems, Ying Tan, Mehmet C. Vuran, Steve Goddard

School of Computing: Conference and Workshop Papers

The emerging Cyber-Physical Systems (CPSs) are envisioned to integrate computation, communication and control with the physical world. Therefore, CPS requires close interactions between the cyber and physical worlds both in time and space. These interactions are usually governed by events, which occur in the physical world and should autonomously be reflected in the cyber-world, and actions, which are taken by the CPS as a result of detection of events and certain decision mechanisms. Both event detection and action decision operations should be performed accurately and timely to guarantee temporal and spatial correctness. This calls for a flexible architecture and task …

The Impact Of Communication Medium On Team Performance Patterns, Pilar Pazos, Mario G. Beruvides

Engineering Management & Systems Engineering Faculty Publications

The increased impact of globalization and rapidly changing technologies are some of the biggest challenges facing 21st century organizations. Remote teams supported through computer-based systems have been identified as a key lever to help organizations adapt to this turbulent environment. This study sheds some light on how teams perform and adapt by evaluating performance and synergy over time for teams in two different settings: computer supported and face-to-face. Participants in the study were randomly assigned either to a computer-supported or a face-to face group. Each group met over three sessions to perform a series of tasks that were evaluated using …

Finding Irc-Like Meshes Sans Layer 7 Payloads, Akshay Dua, Jim Binkley, Suresh Singh

Computer Science Faculty Publications and Presentations

We present an algorithm for detecting IRC-like chat networks that does not rely on Layer 7 payload information. The goal is to extract only those meshes from conventional flows where long-term periodic data is being exchanged between an external server and multiple internal clients. Flow data is passed through a series of filters that reduce the memory requirements needed for final candidate mesh sorting. Final outputs consist of two sorted lists including the fanout list, sorted by the number of client hosts in the mesh, and a secondary list called the evil sort. The latter consists of meshes with any …

Squeak By Example, Andrew P. Black, Stéphane Ducasse, Oscar Nierstrasz, Damien Pollet, Damien Cassou, Marcus Denker

Computer Science Faculty Publications and Presentations

Squeak is a modern open-source development environment for the classic Smalltalk-80 programming language. This book, intended for both students and developers, will guide you gently through the language and tools by means of a series of examples and exercises.

Additional material is available from the book's web page at SqueakByExample.org.

Evaluating Similarity-Based Trace Reduction Techniques For Scalable Performance Analysis, Kathryn Marie Mohror, Karen L. Karavanic

Computer Science Faculty Publications and Presentations

Event traces are required to correctly diagnose a number of performance problems that arise on today’s highly parallel systems. Unfortunately, the collection of event traces can produce a large volume of data that is difficult, or even impossible, to store and analyze. One approach for compressing a trace is to identify repeating trace patterns and retain only one representative of each pattern. However, determining the similarity of sections of traces, i.e., identifying patterns, is not straightforward. In this paper, we investigate pattern-based methods for reducing traces that will be used for performance analysis. We evaluate the different methods against several …

Computing Prime Harmonic Sums, Eric Bach, Dominic Klyve, Jonathan P. Sorenson

Scholarship and Professional Work - LAS

We discuss a method for computing Σ �≤� 1/�, using time about �2/3 and space about �1/3. It is based on the Meissel-Lehmer algorithm for computing the prime-counting function �(�), which was adapted and improved by Lagarias, Miller, and Odlyzko. We used this algorithm to determine the first point at which the prime harmonic sum first crosses.

The Hamiltonian Index Of Graphs, Yi Hong, Jian-Liang Lin, Zhi-Sui Tao, Zhi-Hong Chen

Scholarship and Professional Work - LAS

The Hamiltonian index of a graph G is defined as h ( G ) = min { m : L m ( G ) is Hamiltonian } . In this paper, using the reduction method of Catlin [P.A. Catlin, A reduction method to find spanning Eulerian subgraphs, J. Graph Theory 12 (1988) 29–44], we constructed a graph H ̃ ( m ) ( G ) from G and prove that if h ( G ) ≥ 2 , then h ( G ) = min{ m : H ̃ ( m ) ( G ) has a spanning Eulerian subgraph …

A Privacy Enhanced Situation-Aware Middleware Framework For Ubiquitous Computing Environments, Gautham V. Pallapa

Computer Science and Engineering Dissertations - Archive

The Ubiquitous Computing paradigm integrates myriads of small, inexpensive, heterogeneous networked devices, including sensors, distributed throughout the environment, with the intent of enabling context awareness in systems deployed to monitor the environment. This is accomplished by monitoring events, such as access, or utilization of resources, and obtaining knowledge about user activities, and interactions with other entities in the environment. Existing context-aware systems predominantly encapsulate the occurred activities either by using Event-Condition-Action rules, where an instance of the event performs as a trigger, or by prediction mechanisms, such as Dynamic Bayesian Networks, which compute decisions, based on the information obtained. However, …

Lattice Operators And Topologies, Eva Cogan

Publications and Research

Working within a complete (not necessarily atomic) Boolean algebra, we use a sublattice to define a topology on that algebra. Our operators generalize complement on a lattice which in turn abstracts the set theoretic operator. Less restricted than those of Banaschewski and Samuel, the operators exhibit some surprising behaviors. We consider properties of such lattices and their interrelations. Many of these properties are abstractions and generalizations of topological spaces. The approach is similar to that of Bachman and Cohen. It is in the spirit of Alexandroff, Frolík, and Nöbeling, although the setting is more general. Proceeding in this manner, we …

An Analysis Of The Impact Of Information Systems On The Level Of Trust In The Construction Industry, Michael Wayne Jones

Walden Dissertations and Doctoral Studies

Even though the current level of communication and information sharing is greater than it has ever been throughout the history of the construction industry, the problem under investigation stems from the results of current research that indicate that many major projects have difficulty in achieving client expectations, resulting in a negative image of the construction industry. The purpose of this study was to analyze the impact on the level of trust in the use of information systems between construction firms and their clients. The theoretical foundations of this research were based in interdependence and coordination theories. While information systems enable …

Attributes Selection And Package Design To Maximize Visibility Of Objects, Md Zahiduzzaman Miah

Computer Science and Engineering Dissertations - Archive

In recent years, there has been significant interest in the development of ranking functions and efficient top-k retrieval algorithms to help users in ad-hoc search and retrieval in databases (e.g., buyers searching for products in a catalog). We introduce a complementary problem: how to guide a seller in selecting the best attributes of a new tuple (e.g., a new product) to highlight so that it stands out in the crowd of existing competitive products and is widely visible to the pool of potential buyers. For example, assume one wants to sell an iPod in e-commerce site, but the title allows …

Printed Document Authentication Using Texture Coding, Jonathan Blackledge, Khaled Mahmoud

Articles

The use of image based information exchange has grown rapidly over the years in terms of both e-to-e image storage and transmission and in terms of maintaining paper documents in electronic form. Further, with the dramatic improvements in the quality of COTS (Commercial-Off-The-Shelf) printing and scanning devices, the ability to counterfeit electronic and printed documents has become a widespread problem. Consequently, there has been an increasing demand to develop digital watermarking techniques which can be applied to both electronic and printed images (and documents) that can be authenticated, prevent unauthorized copying of their content and, in the case of printed …

Energy Efficient Routing Structures And Wakeup Schemes For Wireless Sensor Networks, Byoung Lee

Computer Science and Engineering Dissertations - Archive

Wireless sensor networks, which consist of a large number of sensor nodes and a base station, are used for many applications aimed at collecting information. Each sensor node is equipped with a small amount of battery, limited memory, finite radio range and small CPU. It gathers required information and it sends the information to the base station. The large number of sensors can cover a large area by cooperating with each other to build a multi-hop wireless network. However, the small amount of battery is one of the critical concerns because sensor network life time depends on battery longevity. It …

The Effects Of Technology On Literacy(S), Thomas Glen Petersen

Masters Theses

"One of the challenges when measuring the effects of technology on literacy(s) is finding a control group where technology; does not play a major role in the culture. The Amish successfully live in a Technocracy where mechanical/electronic tools are used only when absolutely necessary; the Amish are not dependent on them for survival. The crux of the Amish philosophy is humility, serving the community and serving God. Ironically, they have suffered tremendous repercussions for adopting a wholesome, selfless lifestyle which is contrary to most popular world views, regardless of religious or spiritual views"--Purpose, page 40.

Alliances In Graphs: Parameterized Algorithms And On Partitioning Series-Parallel Graphs, Rosa Enciso

Electronic Theses and Dissertations

Alliances are used to denote agreements between members of a group with similar interests. Alliances can occur between nations, biological sequences, business cartels, and other entities. The notion of alliances in graphs was first introduced by Kristiansen, Hedetniemi, and Hedetniemi in . A defensive alliance in a graph G = (V, E) is a non empty set S ⊆ V where, for all x ∈ S, |N[x] ∩ S| ≥ |N[x] − S|. Consequently, every vertex that is a member of a defensive alliance has at least as many vertices defending it as there are vertices attacking it. Alliances can …

On The Application Of Locality To Network Intrusion Detection: Working-Set Analysis Of Real And Synthetic Network Server Traffic, Robert Lee

Electronic Theses and Dissertations

Keeping computer networks safe from attack requires ever-increasing vigilance. Our work on applying locality to network intrusion detection is presented in this dissertation. Network servers that allow connections from both the internal network and the Internet are vulnerable to attack from all sides. Analysis of the behavior of incoming connections for properties of locality can be used to create a normal profile for such network servers. Intrusions can then be detected due to their abnormal behavior. Data was collected from a typical network server both under normal conditions and under specific attacks. Experiments show that connections to the server do …

Search And Delivery Techniques In Peer-To-Peer Networks, Tai Do

Electronic Theses and Dissertations

The presence of millions of interconnected personal computing devices has given rise to a new class of decentralized networking applications, which are loosely labeled as peer-to-peer (P2P) applications. These P2P applications leverage resources such as processing cycles, storage, content, and network bandwidth available to the user devices, which are also known as peers. A number of current systems - SETI@home, Napster, BitTorrent, and Pastry - are examples of these emerging P2P systems. To fully realize the potential of the peer-to-peer technology, there is a need to define and provide a set of core competencies, serving as the basic services upon …

Connectionless Approach: A Localized Scheme To Mobile Ad Hoc Networks, Yao Ho

Electronic Theses and Dissertations

According to a Gartner Group (www.gartner.com) report in September 2008, the worldwide telecommunications market is on pace to reach $2 trillion in 2008. Gartner predicts that by 2012, the ratio of mobile to fixed connections will exceed 4-to-1. The North American mobile data market grew to 141.1 million connections in 2007, with a compound annual growth rate of 41.7 percent. It is believed that a large portion will be ad hoc and multi-hop connections, which will open many opportunities for Mobile Ad hoc NETwork (MANET) applications and Wireless Mesh Network (WMN) applications. A MANET is a self-organizing multi-hop wireless network …

Learning Techniques For Information Retrieval And Mining In High-Dimensional Databases, Hao Cheng

Electronic Theses and Dissertations

The main focus of my research is to design effective learning techniques for information retrieval and mining in high-dimensional databases. There are two main aspects in the retrieval and mining research: accuracy and efficiency. The accuracy problem is how to return results which can better match the ground truth, and the efficiency problem is how to evaluate users' requests and execute learning algorithms as fast as possible. However, these problems are non-trivial because of the complexity of the high-level semantic concepts, the heterogeneous natures of the feature space, the high dimensionality of data representations and the size of the databases. …

A Generic Framework For Arabic To English Machine Translation Of Simplex Sentences Using The Role And Reference Grammar Linguistic Model, Yasser Salem

Other Resources

No abstract provided.

Defining A Forensic Audit, G. S. Smith, D. L. Crumbley

Journal of Digital Forensics, Security and Law

Disclosures about new financial frauds and scandals are continually appearing in the press. As a consequence, the accounting profession's traditional methods of monitoring corporate financial activities are under intense scrutiny. At the same time, there is recognition that principles-based GAAP from the International Accounting Standards Board will become the recognized standard in the U.S. The authors argue that these two factors will change the practices used to fight corporate malfeasance as investigators adapt the techniques of accounting into a forensic audit engagement model.

Visualisation Of Honeypot Data Using Graphviz And Afterglow, Craig Valli

Journal of Digital Forensics, Security and Law

This research in progress paper explores the use of Graphviz and Afterglow for the analysis of data emanating from a honeypot system. Honeypot systems gather a wide range of data that is often difficult to readily search for patterns and trends using conventional log file analysis techniques. The data from the honeypots has been statically extracted and processed through Afterglow scripts to produce inputs suitable for use by the DOT graph based tools contained within Graphviz. This paper explores some of the benefits and drawbacks of currently using this type of approach.

Enabling Context-Aware Applications In Smart Environments‏, Roman Arora

Computer Science and Engineering Theses - Archive

Recognizing human activities is an important feature for the development of contextaware applications that are so fundamental to enabling assistive environments. Only once these applications are able to determine the activities that their inhabitants are performing can they assist the individuals and their special needs. In order to do this, it is necessary to build models that can accurately capture and recognize the observed patterns. Equally important is the need to manage and distribute the information that has been inferred, and to provide Quality of Service (QoS) guarantees so that context-aware applications can react effectively to emergent situations. In this …

Query Auditing Against Partial Disclosure, Mayur Motgi

Computer Science and Engineering Theses - Archive

Many government agencies, businesses, and nonprofit organizations need to collect, analyze, and report data about individuals in order to support their short-term and long-term planning activities. Statistical Databases therefore contain confidential information such as income, credit ratings, type of disease, or test scores of individuals. Such data are typically stored online and analyzed using sophisticated database management systems (DBMS) and software packages. On one hand, such database systems are expected to satisfy user requests of aggregate statistics related to non-confidential and confidential attributes. On the other hand, the system should be secure enough to guard against a user's ability to …

Peon: Privacy-Enhanced Opportunistic Networks With Applications In Assistive Environments, Gauri Vakde

Computer Science and Engineering Theses - Archive

Opportunistic Networking holds a great deal of potential for making communications easier and more flexible in pervasive assistive environments. However, security and privacy must be addressed to make these communications acceptable with respect to protecting patient privacy. We propose Privacy-Enhanced Opportunistic Networking (PEON), a system for using opportunistic networking in privacy-preserving way. PEON uses concepts from anonymous communications, re-routing messages through groups of peer nodes to hide the relation between the sources and destinations. We describe a set of protocols that explore a practical range of trade-offs between privacy and communication costs by modifying how closely the protocol adheres to …