Software Engineering Commons^™

A Social Relation Aware Routing Protocol For Mobile Ad Hoc Networks, Jisun An, Yangwoo Ko, Dongman Lee

Research Collection School Of Computing and Information Systems

In this paper, we propose a social relation aware routing protocol for mobile ad hoc networks, which is designed for content sharing mobile social applications. Since a content can be shared by a group of users who have similar interests, the similarity of users' interests is a good metric to predict who will consume which contents. Shared interests can be exploited in routing and replication of content request and reply to achieve enhanced efficacy in content sharing. Since routing determines which content will be forwarded by whom, a route selected based on similarity of interest increases the utilization of contents …

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 …

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 …

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 …

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 …

Sub-Circuit Selection And Replacement Algorithms Modeled As Term Rewriting Systems, Eric D. Simonaire

Theses and Dissertations

Intent protection is a model of software obfuscation which, among other criteria, prevents an adversary from understanding the program’s function for use with contextual information. Relating this framework for obfuscation to malware detection, if a malware detector can perfectly normalize a program P and any obfuscation (variant) of the program O(P), the program is not intent protected. The problem of intent protection on programs can also be modeled as intent protection on combinational logic circuits. If a malware detector can perfectly normalize a circuit C and any obfuscation (variant) O(C) of the circuit, the circuit is not intent protected. In …

Secureqemu: Emulation-Based Software Protection Providing Encrypted Code Execution And Page Granularity Code Signing, William B. Kimball

Theses and Dissertations

This research presents an original emulation-based software protection scheme providing protection from reverse code engineering (RCE) and software exploitation using encrypted code execution and page-granularity code signing, respectively. Protection mechanisms execute in trusted emulators while remaining out-of-band of untrusted systems being emulated. This protection scheme is called SecureQEMU and is based on a modified version of Quick Emulator (QEMU) [5]. RCE is a process that uncovers the internal workings of a program. It is used during vulnerability and intellectual property (IP) discovery. To protect from RCE program code may have anti-disassembly, anti-debugging, and obfuscation techniques incorporated. These techniques slow the …

Steganography In Ipv6, Barret Miller

Computer Science and Computer Engineering Undergraduate Honors Theses

Steganography is the process of hiding a secret message within another message such that it is difficult to detect the presence of the secret message. In other words, the existence of the secret message is hidden. A covert channel refers to the actual medium that is used to communicate the information such as a message, image, or file. This honors thesis uses steganography within the source address fields of Internet Protocol Version 6 (IPv6) packets to create a covert channel through which clandestine messages are passed from one party to another. A fully functional computer program was designed and written …

Calibrating Function Point Backfiring Conversion Ratios Using Neuro-Fuzzy Technique, Justin Wong, Luiz Fernando Capretz, Danny Ho

Electrical and Computer Engineering Publications

Software estimation is an important aspect in software development projects because poor estimations can lead to late delivery, cost overruns, and possibly project failure. Backfiring is a popular technique for sizing and predicting the volume of source code by converting the function point metric into source lines of code mathematically using conversion ratios. While this technique is popular and useful, there is a high margin of error in backfiring. This research introduces a new method to reduce that margin of error. Neural networks and fuzzy logic in software prediction models have been demonstrated in the past to have improved performance …

Privacy Engine For Context-Aware Enterprise Application Services, Marion Blount, John Davis, Maria Ebling, William Jerome, Barry Leiba, Xuan Liu, Archan Misra

Research Collection School Of Computing and Information Systems

Satisfying the varied privacy preferences of individuals, while exposing context data to authorized applications and individuals, remains a major challenge for context-aware computing. This paper describes our experiences in building a middleware component, the context privacy engine (CPE), that enforces a role-based, context-dependent privacy model for enterprise domains. While fundamentally an ACL-based access control scheme, CPE extends the traditional ACL mechanism with usage control and context constraints. This paper focuses on discussing issues related to managing and evaluating context-dependent privacy policies. Extensive experimental studies with a production-grade implementation and real-life context sources demonstrate that the CPE can support a large …

Profile-Guided Program Simplification For Effective Testing And Analysis, Lingxiao Jiang, Zhendong Su

Research Collection School Of Computing and Information Systems

Many testing and analysis techniques have been developed for inhouse use. Although they are effective at discovering defects before a program is deployed, these techniques are often limited due to the complexity of real-world code and thus miss program faults. It will be the users of the program who eventually experience failures caused by the undetected faults. To take advantage of the large number of program runs carried by the users, recent work has proposed techniques to collect execution profiles from the users for developers to perform post-deployment failure analysis. However, in order to protect users' privacy and to reduce …

An Exploratory Overview Of Teaching Computer Game Development, Mario Guimaraes, Meg C. Murray

Faculty Articles

The computer game industry has exploded reaching sales of several billion dollars a year and, consequently, a majority of college students are familiar with the gaming environment. In fact, videogame development has been cited as one way to motivate students to explore the world of Computer Science. However, most videogames are extremely complex computer programs created by a team of developers including programmers and graphic artists and represent thousands of hours of work. Fortunately there are software tools available that provide a way for simple computer games to be created fairly easily using a building block approach. This paper discusses …

On The Assessment Of Pointcut Design In Evolving Aspect-Oriented Software, Raffi Khatchadourian, Phil Greenwood, Awais Rashid

Publications and Research

No abstract provided.

Model Checking Csp Revisited: Introducing A Process Analysis Toolkit, Jun Sun, Yang Liu, Jin Song Dong

Research Collection School Of Computing and Information Systems

FDR, initially introduced decades ago, is the de facto analyzer for Communicating Sequential Processes (CSP). Model checking techniques have been evolved rapidly since then. This paper describes PAT, i.e., a process analysis toolkit which complements FDR in several aspects. PAT is designed to analyze event-based compositional system models specified using CSP as well as shared variables and asynchronous message passing. It supports automated refinement checking, model checking of LTL extended with events, etc. In this paper, we highlight how partial order reduction is applied to improve refinement checking in PAT. Experiment results show that PAT outperforms FDR in some cases.

Specification Mining Of Symbolic Scenario-Based Models, David Lo, Shahar Maoz

Research Collection School Of Computing and Information Systems

Many dynamic analysis approaches to specification mining, which extract behavioral models from execution traces, do not consider object identities. This limits their power when used to analyze traces of general object oriented programs. In this work we present a novel specification mining approach that considers object identities, and, moreover, generalizes from specifications involving concrete objects to their symbolic class-level abstractions. Our approach uses data mining methods to extract significant scenario-based specifications in the form of Damm and Harel's live sequence charts (LSC), a formal and expressive extension of classic sequence diagrams. We guarantee that all mined symbolic LSCs are significant …

A Study Of Early Stage Game Design And Prototyping, Brien Colwell, Richard C. Davis, James A. Landay

Research Collection School Of Computing and Information Systems

Computer games and simulations can be valuable teaching and communication tools, and they are a powerful form of self-expression. Unfortunately, creating games requires programming, and programming requires time and skill. Some tools facilitate game creation to motivate novice programmers, but programming is still necessary. Other systems require less programming, but they are narrowly focused. To enable faster, simpler, and more expressive tools for professionals and amateurs, we have explored the processes and tools used in the early stages of game and simulation design. Interviews with educators clarified the uses of simulations in the classroom, while interviews with professional game designers …

Specifying And Verifying Sensor Networks: An Experiment Of Formal Methods, Jin Song Dong, Jing Sun, Jun Sun, Kenji Taguchi, Xian Zhang

Research Collection School Of Computing and Information Systems

With the development of sensor technology and electronic miniaturization, wireless sensor networks have shown a wide range of promising applications as well as challenges. Early stage sensor network analysis is critical, which allows us to reveal design errors before sensor deployment. Due to their distinguishable features, system specification and verification of sensor networks are highly non-trivial tasks. On the other hand, numerous formal theories and analysis tools have been developed in formal methods community, which may offer a systematic method for formal analysis of sensor networks. This paper presents our attempt on applying formal methods to sensor network specification/verification. An …

Link Layer Multicast Using Smart Antennas: No Client Left Behind, Souvik Sen, Jie Xiong, Rahul Ghosh, Romit Roy Choudhury

Research Collection School Of Computing and Information Systems

Wireless link layer multicast is an important service primitive for emerging applications, such as live video, streaming audio, and other content telecasts. The broadcast nature of the wireless channel is amenable to multicast because a single packet transmission may be received by all clients in the multicast group. However, in view of diverse channel conditions at different clients, the rate of such a transmission is bottlenecked by the rate of the weakest client. Multicast throughput degrades severely. Attempts to increase the data rate result in lower reliability and higher unfairness. This paper utilizes smart beamforming antennas to improve multicast performance …

Specifying And Verifying Event-Based Fairness Enhanced Systems, Jun Sun, Yang Liu, Jin Song Dong, Hai H. Wang

Research Collection School Of Computing and Information Systems

Liveness/Fairness plays an important role in software specification, verification and development. Existing event-based compositional models are safety-centric. In this paper, we describe a framework for systematically specifying and verifying event-based systems under fairness assumptions. We introduce different event annotations to associate fairness constraints with individual events. Fairness annotated events can be used to embed liveness/fairness assumptions in event-based models flexibly and naturally. We show that state-of-the-art verification algorithms can be extended to verify models under fairness assumptions, with little computational overhead. We further improve the algorithm by other model checking techniques like partial order reduction. A toolset named Pat has …

Resource-Aware Video Multicasting Via Access Gateways In Wireless Mesh Networks, Wanqing Tu, Cormac J. Sreenan, Chun Tung Chou, Archan Misra

Research Collection School Of Computing and Information Systems

This paper studies video multicasting in large scale areas using wireless mesh networks. The focus is on the use of Internet access gateways that allow a choice of alternative routes to avoid potentially lengthy multi-hop wireless paths with low capacity. A set of heuristic-based algorithms are described that together aim to maximize network capacity: the two-tier integrated architecture algorithm, the weighted gateway uploading algorithm, the link-controlled routing tree algorithm, and the alternative channel assignment algorithm. These algorithms use different approaches to arrange multicast group members into a clustered and two-tier integrated architecture in which network protocols can make use of …