Physical Sciences and Mathematics Commons^™

Workshop | Body Worn Video Recorders: The Socio-Technical Implications Of Gathering Direct Evidence, Katina Michael, Alexander Hayes

Alexander Hayes Mr.

- From in-car video recording to body-worn video recording

- Exploring available technologies: how do they work, pros and cons

- Storing direct evidence in secure storage: factors to consider

- Citizens “shooting” back with POV tech – what are their rights?

- Crowdsourced sousveillance- harnessing public data for forensic profiling

- Police force policies and practices on the application of new media

Bayesian Analysis Of Hypothesis Testing Problems For General Population: A Kullback–Leibler Alternative, Naveen Bansal, Gholamhossein Hamedani, Ru Sheng

Naveen Bansal

We consider a hypothesis problem with directional alternatives. We approach the problem from a Bayesian decision theoretic point of view and consider a situation when one side of the alternatives is more important or more probable than the other. We develop a general Bayesian framework by specifying a mixture prior structure and a loss function related to the Kullback–Leibler divergence. This Bayesian decision method is applied to Normal and Poisson populations. Simulations are performed to compare the performance of the proposed method with that of a method based on a classical z-test and a Bayesian method based on the …

Creating Composite Age Groups To Smooth Percentile Rank Distributions Of Small Samples, Francesca Lopez, Amy Olson, Naveen Bansal

Naveen Bansal

Individually administered tests are often normed on small samples, a process that may result in irregularities within and across various age or grade distributions. Test users often smooth distributions guided by Thurstone assumptions (normality and linearity) to result in norms that adhere to assumptions made about how the data should look. Test users, however, may come across particular tests or sets of data in which the Thurstone assumptions are untenable. When users expect deviations from normality within age or grade, an alternate method is desirable. The authors present a relatively simple procedure that allows the user to treat observed raw …

Improving Processor Efficiency By Statically Pipelining Instructions, Ian Finlayson, Brandon Davis, Peter Gavin, Gang-Ryung Uh, David Whalley, Magnus Själander, Gary Tyson

Gang-Ryung Uh

A new generation of applications requires reduced power consumption without sacrificing performance. Instruction pipelining is commonly used to meet application performance requirements, but some implementation aspects of pipelining are inefficient with respect to energy usage. We propose static pipelining as a new instruction set architecture to enable more efficient instruction flow through the pipeline, which is accomplished by exposing the pipeline structure to the compiler. While this approach simplifies hardware pipeline requirements, significant modifications to the compiler are required. This paper describes the code generation and compiler optimizations we implemented to exploit the features of this architecture. We show that …

Exploiting Redundancy To Boost Performance In A Raid-10 Style Cluster-Based File System, Yifeng Zhu, Hong Jiang, Xiao Qin, Dan Feng, David Swanson

Yifeng Zhu

While aggregating the throughput of existing disks on cluster nodes is a cost-effective approach to alleviate the I/O bottleneck in cluster computing, this approach suffers from potential performance degradations due to contentions for shared resources on the same node between storage data processing and user task computation. This paper proposes to judiciously utilize the storage redundancy in the form of mirroring existed in a RAID-10 style file system to alleviate this performance degradation. More specifically, a heuristic scheduling algorithm is developed, motivated from the observations of a simple cluster configuration, to spatially schedule write operations on the nodes with less …

Amp: An Affinity-Based Metadata Prefetching Scheme In Large-Scale Distributed Storage Systems, Lin Li, Xuemin Li, Hong Jiang, Yifeng Zhu

Yifeng Zhu

Prefetching is an effective technique for improving file access performance, which can reduce access latency for I/O systems. In distributed storage system, prefetching for metadata files is critical for the overall system performance. In this paper, an Affinity-based Metadata Prefetching (APM) scheme is proposed for metadata servers in large-scale distributed storage systems to provide aggressive metadata prefetching. Through mining useful information about metadata assesses from past history, AMP can discover metadata file affinities accurately and intelligently for prefetching. Compared with LRU and some of the latest file prefetching algorithms such as NEXUS and C-miner, trace-driven simulations show that AMP can …

Hba: Distributed Metadata Management For Large Cluster-Based Storage Systems, Yifeng Zhu, Hong Jiang, Jun Wang, Feng Xian

Yifeng Zhu

An efficient and distributed scheme for file mapping or file lookup is critical in decentralizing metadata management within a group of metadata servers. This paper presents a novel technique called Hierarchical Bloom Filter Arrays (HBA) to map filenames to the metadata servers holding their metadata. Two levels of probabilistic arrays, namely, the Bloom filter arrays with different levels of accuracies, are used on each metadata server. One array, with lower accuracy and representing the distribution of the entire metadata, trades accuracy for significantly reduced memory overhead, whereas the other array, with higher accuracy, caches partial distribution information and exploits the …

Smartstore: A New Metadata Organization Paradigm With Semantic-Awareness For Next-Generation File Systems, Yu Hua, Hong Jiang, Yifeng Zhu, Dan Feng, Lei Tian

Yifeng Zhu

Existing storage systems using hierarchical directory tree do not meet scalability and functionality requirements for exponentially growing datasets and increasingly complex queries in Exabyte-level systems with billions of files. This paper proposes semantic-aware organization, called SmartStore, which exploits metadata semantics of files to judiciously aggregate correlated files into semantic-aware groups by using information retrieval tools. Decentralized design improves system scalability and reduces query latency for complex queries (range and top-k queries), which is conducive to constructing semantic-aware caching, and conventional filename-based query. SmartStore limits search scope of complex query to a single or a minimal number of semantically related groups …

A Pedagogical Evaluation Of New State Model Diagrams For Teaching Internetwork Technologies, Stanislaw Maj, Gurpreet Kohli, Tony Fetherston

Tony Fetherston

Curriculum based on internetworking devices is primarily based on the Command Line Interface (CLI) and case studies. However a single CLI command may produce output that is not only hierarchical but must also be interpreted - both represent learning difficulties for novices. It should also be noted that device status requires many different CLI commands. Internetworking curriculum also typically defines devices as 'black boxes' - this is not a good teaching strategy. New state models were designed that diagrammatically integrated relevant output from different CLI commands with protocol finite state information and protocol stacks by means of tables. The diagrams …

Query-Oriented Keyphrase Extraction, Minghui Qiu, Yaliang Li, Jing Jiang

Minghui QIU

People often issue informational queries to search engines to find out more about some entities or events. While a Wikipedia-like summary would be an ideal answer to such queries, not all queries have a corresponding Wikipedia entry. In this work we propose to study query-oriented keyphrase extraction, which can be used to assist search results summarization. We propose a general method for keyphrase extraction for our task, where we consider both phraseness and informativeness. We discuss three criteria for phraseness and four ways to compute informativeness scores. Using a large Wikipedia corpus and 40 queries, our empirical evaluation shows that …

Electromagnetic Waves In Contaminated Soils, Arvin Farid, Akram Alshawabkeh, Carey Rappaport

Akram N. Alshawabkeh

No abstract provided.

Personality Types In Software Engineering, Luiz Capretz

Luiz Fernando Capretz

No abstract provided.

Using Scala Strategically Across The Undergraduate Curriculum, Mark Lewis, Konstantin Läufer, George Thiruvathukal

George K. Thiruvathukal

Various hybrid-paradigm languages, designed to balance compile-time error detection, conciseness, and performance, have emerged. Scala, e.g., is interoperable with Java and has become an early leader in adoption, especially in the start-up and open-source spaces. Workshop participants experience Scala’s value as a teaching language in the CS curriculum through four lecture-lab modules: In CS1, the read-eval-print loop and simple, uniform syntax aid programming in the small. In CS2, higher-order methods allow concise, efficient manipulation of collections. Advanced topics include domain-specific languages, concurrency, web apps/services, and mobile apps. Laptop recommended with Scala installed.

Stratified Polymorphism And Primitive Recursion, Norman Danner, Daniel Leivant

Norman Danner

Natural restrictions on the syntax of the second-order (i.e., polymorphic) lambda calculus are of interest for programming language theory. One of the authors showed in Leivant (1991) that when type abstraction in that calculus is stratified into levels, the definable numeric functions are precisely the super-elementary functions (level [script E]₄ in the Grzegorczyk Hierarchy). We define here a second-order lambda calculus in which type abstraction is stratified to levels up to ω^ω, an ordinal that permits highly uniform (and finite) type inference rules. Referring to this system, we show that the numeric functions definable in …

Adventures In Time And Space, Norman Danner, James Royer

Norman Danner

This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its first-order programs characterize the polynomial-time computable functions, and its second-order programs characterize the type-2 basic feasible functionals of Mehlhorn and of Cook and Urquhart. (The ATR-types are confined to levels 0, 1, and 2.) The type system comes in two parts, one that primarily restricts the sizes of values of expressions and a second that primarily restricts the time required to evaluate expressions. The size-restricted part is motivated by Bellantoni and Cook's and Leivant's implicit characterizations of …

Circuit Principles And Weak Pigeonhole Variants, Chris Pollett, Norman Danner

Norman Danner

This paper considers the relational versions of the surjective, partial surjective, and multifunction weak pigeonhole principles for PV, , , and formulas as well as relativizations of these formulas to higher levels of the bounded arithmetic hierarchy. We show that the partial surjective weak pigeonhole principle for formulas implies that for each k there is a string of length 2^2nk which is hard to block-recognize by circuits of size n^k. These principles in turn imply the partial surjective principle for formulas. We show that the surjective weak pigeonhole principle for formulas in implies …

The Education Issue, George Thiruvathukal

George K. Thiruvathukal

This article is focused on computing education for the 21st Century and how a renewed focus on education is needed to ensure that our discipline remains vibrant and relevant to all students, regardless of whether they are CS majors or not. After all, many graduates end up in a computer science-related job (e.g. information technology, programming, networking/security, etc.) The article specifically focuses on education-related articles that have appeared within the last year or so in the IEEE Computer Society.

Simulation Of Circuit Creation In Tor: Preliminary Results, William Boyd, Norman Danner, Danny Krizanc

Norman Danner

We describe a methodology for simulating Tor relay up/down behavior over time and give some preliminary results.

Effectiveness And Detection Of Denial Of Service Attacks In Tor, Norman Danner, Samuel Defabbia-Kane, Danny Krizanc, Marc Liberatore

Norman Danner

Tor is one of the more popular systems for anonymizing near-real-time communications on the Internet. Borisov et al. [2007] proposed a denial-of-service-based attack on Tor (and related systems) that significantly increases the probability of compromising the anonymity provided. In this article, we analyze the effectiveness of the attack using both an analytic model and simulation. We also describe two algorithms for detecting such attacks, one deterministic and proved correct, the other probabilistic and verified in simulation.

A Static Cost Analysis For A Higher-Order Language, Norman Danner, Jennifer Paykin, James Royer

Norman Danner

We develop a static complexity analysis for a higher-order functional language with structural list recursion. The complexity of an expression is a pair consisting of a cost and a potential. The former is defined to be the size of the expression's evaluation derivation in a standard big-step operational semantics. The latter is a measure of the "future" cost of using the value of that expression. A translation function ||.|| maps target expressions to complexities. Our main result is the following Soundness Theorem: If t is a term in the target language, then the cost component of ||t|| is an upper …

Two Algorithms In Search Of A Type System, Norman Danner, James Royer

Norman Danner

The authors’ ATR programming formalism is a version of call-by-value PCF under a complexity-theoretically motivated type system. ATR programs run in type-2 polynomial-time and all standard type-2 basic feasible functionals are ATR -definable ( ATR types are confined to levels 0, 1, and 2). A limitation of the original version of ATR is that the only directly expressible recursions are tail-recursions. Here we extend ATR so that a broad range of affine recursions are directly expressible. In particular, the revised ATR can fairly naturally express the classic insertion- and selection-sort algorithms, thus overcoming a sticking point of most prior implicit-complexity-based …

Recognition And Resolution Of 'Comprehension Uncertainty' In Ai, Sukanto Bhattacharya, Kuldeep Kumar

Kuldeep Kumar

Handling uncertainty is an important component of most intelligent behaviour – so uncertainty resolution is a key step in the design of an artificially intelligent decision system (Clark, 1990). Like other aspects of intelligent systems design, the aspect of uncertainty resolution is also typically sought to be handled by emulating natural intelligence (Halpern, 2003; Ball and Christensen, 2009). In this regard, a number of computational uncertainty resolution approaches have been proposed and tested by Artificial Intelligence (AI) researchers over the past several decades since birth of Al as a scientific discipline in early 1950s post- publication of Alan Turing's landmark …

Touch: In-Memory Spatial Join By Hierarchical Data-Oriented Partitioning, Sadegh Nobari, Farhan Tauheed, Thomas Heinis, Panagiotis Karras, Stéphane Bressan, Anastasia Ailamaki

Sadegh Nobari

Efficient spatial joins are pivotal for many applications and particularly important for geographical information systems or for the simulation sciences where scientists work with spatial models. Past research has primarily focused on disk-based spatial joins; efficient in- memory approaches, however, are important for two reasons: a) main memory has grown so large that many datasets fit in it and b) the in-memory join is a very time-consuming part of all disk-based spatial joins.

Socio-Adaptive Systems Challenge Problems Workshop Report, Scott Hissam, Mark Klein, Gabriel Moreno

Gabriel A. Moreno

Socio-adaptive systems are systems in which human and computational elements interact as peers. The behavior of the system arises from the properties of both types of elements and the nature of their collective reaction to changes in their environment, the mission they support, and the availability of resources they use. The Software Engineering Institute (SEI) held the Socio-Adaptive Systems Challenge Problem Workshop in Pittsburgh, PA, on April 12-13, 2012. The workshop’s goal was to identify the challenges associated with resource allocation for warfighters operating at the tactical edge, where networks are often unreliable, and bandwidth limited and inconsistent. This report …

Automated Extraction Of Community Mobility Measures From Gps Stream Data Using Temporal Dbscan, Sungsoon Hwang, Timothy Hanke, Christian Evans

Sungsoon Hwang

Inferring community mobility of patients from GPS data has received much attention in health research. Developing robust mobility (or physical activity) monitoring systems relies on the automated algorithm that classifies GPS track points into events (such as stops where activities are conducted, and routes taken) accurately. This paper describes the method that automatically extracts community mobility measures from GPS track data. The method uses temporal DBSCAN in classifying track points, and temporal filtering in removing noises (any misclassified track points). The result shows that the proposed method classifies track points with 88% accuracy. The percent of misclassified track points decreased …

Empirical Evaluation Of Bug Linking, Tegawendé F. Bissyande, Ferdian Thung, Shaowei Wang, David Lo, Lingxiao Jiang, Laurent Réveillère

David LO

To collect software bugs found by users, development teams often setup bug trackers using systems such as Bugzilla. Developers would then fix some of the bugs and commit corresponding code changes into version control systems such as svn or git. Unfortunately, the links between bug reports and code changes are missing for many software projects as the bug tracking and version control systems are often maintained separately. Yet, linking bug reports to fix commits is important as it could shed light into the nature of bug fixing processes and expose patterns in software management. Bug linking solutions, such as ReLink, …

Automatic Defect Categorization, Ferdian Thung, David Lo, Lingxiao Jiang

David LO

Defects are prevalent in software systems. In order to understand defects better, industry practitioners often categorize bugs into various types. One common kind of categorization is the IBM’s Orthogonal Defect Classification (ODC). ODC proposes various orthogonal classification of defects based on much information about the defects, such as the symptoms and semantics of the defects, the root cause analysis of the defects, and many more. With these category labels, developers can better perform post-mortem analysis to find out what the common characteristics of the defects that plague a particular software project are. Albeit the benefits of having these categories, for …

On The Road To Intelligent Web Applications, Hisham Assal, Kym Pohl, Jens Pohl

Hisham Assal

Increasing access to data sources on the Internet offers expanding opportunities for equipping intelligent applications with the content they require whether broad in scope or rich in detail. Although typically originating within the web in a semi-structured form, with the use of inference-based translation and analysis mechanisms such content can be transformed into useful information and ultimately into actionable knowledge. Service-Oriented Architecture (SOA) offers a platform for accessing the web as invocable resources and effectively incorporating multiple sources of data and capabilities on the Internet into enterprise applications. Adding inference capabilities to SOA-based applications not only aids in the translation …

Space-Time Signal Processing For Distributed Pattern Detection In Sensor Networks, Randy Paffenroth, Philip Du Toit, Louis Scharf, Anura Jayasumana, Vidarshana Banadara, Ryan Nong

Randy C. Paffenroth

We present a theory and algorithm for detecting and classifying weak, distributed patterns in network data that provide actionable information with quantiable measures of uncertainty. Our work demonstrates the eectiveness of space-time inference on graphs, robust matrix completion, and second order analysis for the detection of distributed patterns that are not discernible at the level of individual nodes. Motivated by the importance of the problem, we are specically interested in detecting weak patterns in computer networks related to Cyber Situational Awareness. Our focus is on scenarios where the nodes (terminals, routers, servers, etc.) are sensors that provide measurements (of packet …

Human Resource Information Systems: Information Security Concerns For Organizations, Humayun Zafar

Humayun Zafar

We explore HRIS and e-HR security by presenting information security fundamentals and how they pertain to organizations. With increasing use of enterprise systems such as HRIS and e-HR, security of such systems is an area that is worthy of further exploration. Even then, there is surprisingly little research in this area, albeit that extensive work is present in regard to HRIS privacy. While focusing on HRIS and e-HR security, we introduce aspects of HRIS and e-HR security and how it can be enhanced in organizations. A research model is also presented along with propositions that can guide future research.