Software Engineering Commons^™

Simulation Scoring Systems, Raynald Bedard

Publications

Simulation scoring systems including software, methods of use, and related methods that provide for simulating and scoring of aircraft flight and other missions, particularly where such simulating is purely electronic and particularly where such scoring is objective and particularly where such scoring has a plurality of gradations, as to distinguish a plurality of skill levels.

Pat: Towards Flexible Verification Under Fairness, Jun Sun, Yang Liu, Jin Song Dong, Jun Pang

Research Collection School Of Computing and Information Systems

Recent development on distributed systems has shown that a variety of fairness constraints (some of which are only recently defined) play vital roles in designing self-stabilizing population protocols. Current practice of system analysis is, however, deficient under fairness. In this work, we present PAT, a toolkit for flexible and efficient system analysis under fairness. A unified algorithm is proposed to model check systems with a variety of fairness effectively in two different settings. Empirical evaluation shows that PAT complements existing model checkers in terms of fairness. We report that previously unknown bugs have been revealed using PAT against systems functioning …

Icodes Global Services (Gs): A Single Load-Planning Capability, Jens G. Pohl

Collaborative Agent Design (CAD) Research Center

Over the past decade the Collaborative Agent Design Research Center (CADRC) at California Polytechnic State University (Cal Poly, San Luis Obispo) and its commercial arm CDM Technologies, Inc. (CDM) have developed a suite of information-centric software tools in support of military deployment and distribution processes. All of these tools feature agents that are capable of reasoning about data in the context provided by an internal information model. Together they represent an evolving suite of adaptive Knowledge Management Enterprise Services (KMES) that can be readily configured into a net-centric, Service-Oriented Architecture (SOA) based planning and decision-support toolset for a particular application …

Bmq-Processor: A High-Performance Border Crossing Event Detection Framework For Large-Scale Monitoring Applications, Jinwon Lee, Seungwoo Kang, Youngki Lee, Sangjeong Lee, Junehwa Song

Research Collection School Of Computing and Information Systems

In this paper, we present BMQ-Processor, a high-performance Border-Crossing Event (BCE) detection framework for large-scale monitoring applications. We first characterize a new query semantics, namely, Border Monitoring Query (BMQ), which is useful for BCE detection in many monitoring applications. It monitors the values of data streams and reports them only when data streams cross the borders of its range. We then propose BMQ-Processor to efficiently handle a large number of BMQs over a high volume of data streams. BMQ-Processor efficiently processes BMQs in a shared and incremental manner. It develops and operates over a novel stateful query index, achieving a …

The Lookup Technique To Replace Nested-If Formulas In Spreadsheet Programming, Thomas A. Grossman Jr., O Ozluk, J Gustavson

Business Analytics and Information Systems

Spreadsheet programmers often implement contingent logic using a nested-IF formula even though this technique is difficult to test and audit and is believed to be risky. We interpret the programming of contingent logic in spreadsheets in the context of traditional computer programming. We investigate the “lookup technique” as an alternative to nested-IF formulas, describe its benefits for testing and auditing, and define its limitations. The lookup technique employs four distinct principles: 1) make logical tests visible; 2) make outcomes visible; 3) make logical structure visible; and 4) replace a multi-function nested-IF formula with a single-function lookup formula. It can be …

An Extendable General Platform For Cluster Analysis And Validation, Brandon Troy Edwards

Theses Digitization Project

This thesis implements a general platform which integrates several commonly used cluster analysis algorithms with ease of use and extendability, along with various validation techniques to analyze the results of algorithms.

Improving Effort Estimation By Voting Software Estimation Models, Luiz Fernando Capretz, Venus Marza

Electrical and Computer Engineering Publications

Estimating software development effort is an important task in the management of large software projects. The task is challenging, and it has been receiving the attentions of researchers ever since software was developed for commercial purpose. A number of estimation models exist for effort prediction. However, there is a need for novel models to obtain more accurate estimations. The primary purpose of this study is to propose a precise method of estimation by selecting the most popular models in order to improve accuracy. Consequently, the final results are very precise and reliable when they are applied to a real dataset …

User Interface Design, Moritz Stefaner, Sebastien Ferre, Saverio Perugini, Jonathan Koren, Yi Zhang

Computer Science Faculty Publications

As detailed in Chap. 1, system implementations for dynamic taxonomies and faceted search allow a wide range of query possibilities on the data. Only when these are made accessible by appropriate user interfaces, the resulting applications can support a variety of search, browsing and analysis tasks. User interface design in this area is confronted with specific challenges. This chapter presents an overview of both established and novel principles and solutions.

A Two-Population Insurgency In Colombia: Quasi-Predator-Prey Models - A Trend Towards Simplicity, John A. Adam, John A. Sokolowski, Catherine M. Banks

Mathematics & Statistics Faculty Publications

A sequence of analytic mathematical models has been developed in the context of the "low-level insurgency" in Colombia, from 1993 to the present. They are based on generalizations of the two-population "predator-prey" model commonly applied in ecological modeling, and interestingly, the less sophisticated models yield more insight into the problem than the more complicated ones, but the formalism is available to adapt the model "upwards" in the event that more data becomes available, or as the situation increases in complexity. Specifically, so-called "forcing terms" were included initially in the coupled differential equations to represent the effects of government policies towards …

Specifying Reusable Aspects, Neelam Soundarajan, Raffi Khatchadourian

Publications and Research

Aspect-Oriented Programming enables developers to manage, in a more modular fashion, implementations of crosscutting concerns that might be scattered or tangled if aspect-oriented techniques were not utilized. Our interest in this paper is in considering techniques for specifying precise properties of aspects. In particular, we are interested in specifying reusable aspects; i.e., aspects that correspond to crosscutting concerns that occur in many systems. These abstract aspects can be reused in various systems where a particular concern is applicable. Although there has been work on issues related to reasoning about aspects and the behaviors of aspect-oriented systems, specifying reusable abstract aspects …

Distributed Utility-Based Rate Adaptation Protocols For Prioritized, Quasi-Elastic Flows, Sharanya Eswaran, Matthew P. Johnson, Archan Misra, Thomas La Porta

Research Collection School Of Computing and Information Systems

This paper considers rate adaptation for streaming multimedia data in a wireless sensor network (WSN) consisting of multiple missions, where each mission subscribes to data streams from multiple sensors, and each sensor's data is utilized by multiple heterogenous missions. We specifically consider the application of the distributed network utility maximization (NUM) framework to a previously unconsidered scenario where the different missions have different priorities, as well as minimum utility demands. When all the utility demands are feasible, we first show that the addition of a penalty for failing to reach the minimum utility demand to the base NUM protocol leads …

A Covert Encryption Method For Applications In Electronic Data Interchange, Jonathan Blackledge, Dmitry Dubovitskiy

Articles

A principal weakness of all encryption systems is that the output data can be ‘seen’ to be encrypted. In other words, encrypted data provides a ‘flag’ on the potential value of the information that has been encrypted. In this paper, we provide a new approach to ‘hiding’ encrypted data in a digital image.

In conventional (symmetric) encryption, the plaintext is usually represented as a binary stream and encrypted using an XOR type operation with a binary cipher. The algorithm used is ideally designed to: (i) generate a maximum entropy cipher so that there is no bias with regard to any …

Software Reverse Engineering Education, Teodoro Cipresso

Master's Theses

No abstract provided.

Control-Theoretic, Mission-Driven, Optimization Techniques For Wireless Sensor Networks, Archan Misra, Sharanya Eswaran, Thomas La Porta

Research Collection School Of Computing and Information Systems

Network Utility Maximization (NUM) techniques, which cast resource sharing problems as one of distributed utility maximization, have been investigated for a variety of optimization problems in wireless and wired networks. Our recent work has extended the NUM framework to consider the case of resource sharing by multiple competing missions in a military-centric wireless sensor network (WSN) environment. Our enhanced NUM-based protocols provide rapid and dynamic mission-based adaptation of tactical wireless networks to support the transport of sensor data streams with very small control overhead. In particular, we focus specifically on mechanisms that capture the joint nature of mission utilities and …