Physical Sciences and Mathematics Commons^™

Modelling Situation Awareness For Context‐Aware Decision Support, Yu-Hong Feng, Teck-Hou Teng, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Situation awareness modelling is popularly used in the command and control domain for situation assessment and decision support. However, situation models in real-world applications are typically complex and not easy to use. This paper presents a Context-aware Decision Support (CaDS) system, which consists of a situation model for shared situation awareness modelling and a group of entity agents, one for each individual user, for focused and customized decision support. By incorporating a rule-based inference engine, the entity agents provide functions including event classification, action recommendation, and proactive decision making. The implementation and the performance of the proposed system are demonstrated …

A Symbolic Sonification Of L-Systems, Adam James Wilson

Publications and Research

This paper describes a simple technique for the sonification of branching structures in plants. The example is intended to illustrate a qualitative definition of best practices for sonification aimed at the production of musical material. Visually manifest results of tree growth are modelled and subsequently mapped to pitch, time, and amplitude. Sample results are provided in symbolic music notation.

Flocking In The Time-Dissonance Plane, Adam James Wilson

Publications and Research

This paper describes a technique for the sonification of an idealized model of the flocking behavior of birds, fish, and insects. Flocking agents are represented by pitches that move through time to produce chords of variable dissonance. The objective of each agent is to move toward more consonant chord formations with other agents. The output of the sonification is intended to provide material for use in musical composition.

Shadowing Chaos Via Optimization, Henrik Haakonsen

Mathematics, Statistics, and Computer Science Honors Projects

A prominent idea in the theory of chaos is that of shadowing, which says that, in many cases, the numerical results one sees after accuracy is lost are not total nonsense, but are in fact very close to the exact trajectory for an initial value that is near the one used. Using high-precision computation, I have researched the use of optimization as a way of finding exact shadows for several chaotic systems, such as the quadratic map r x (1 - x) and a billiard problem from the SIAM 100-Digit Challenge.

Quirky, Not Quacky: Quantum Computing For Librarians, Jill Cirasella

Publications and Research

This slideshow introduces librarians and non-scientists to the relatively young field of quantum computing.

Corporate Voting, Paul H. Edelman, Robert B. Thompson

Vanderbilt Law School Faculty Publications

Discussion of shareholder voting frequently begins against a background of the democratic expectations and justifications present in decision-making in the public sphere. Directors are assumed to be agents of the shareholders in much the same way that public officers are representatives of citizens. Recent debates about majority voting and shareholder nomination of directors illustrate this pattern. Yet the corporate process differs in significant ways, partly because the market for shares permits a form of intensity voting and lets markets mediate the outcome in a way that would be foreign to the public setting and partly because the shareholders' role is …

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 …

Equational Coalgebraic Logic, Alexander Kurz, Raul Leal

Engineering Faculty Articles and Research

Coalgebra develops a general theory of transition systems, parametric in a functor T; the functor T specifies the possible one-step behaviours of the system. A fundamental question in this area is how to obtain, for an arbitrary functor T, a logic for T-coalgebras. We compare two existing proposals, Moss’s coalgebraic logic and the logic of all predicate liftings, by providing one-step translations between them, extending the results in [21] by making systematic use of Stone duality. Our main contribution then is a novel coalgebraic logic, which can be seen as an equational axiomatization of Moss’s logic. The three logics are …

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.

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 …

The Philippines, Ma. Regina Justina E. Estuar, David Young Oh

Department of Information Systems & Computer Science Faculty Publications

No abstract provided.

Dynamic Adaptation Of Joint Transmission Power And Contention Window In Vanet, Danda B. Rawat, Gongjun Yan, Dimitrie C. Popescu, Michele C. Weigle, Stephan Olariu

Electrical & Computer Engineering Faculty Publications

In this paper, we propose an algorithm for joint adaptation of transmission power and contention window to improve the performance of vehicular network in a cross layer approach. The high mobility of vehicles in vehicular communication results in the change in topology of the Vehicular Ad-hoc Network (VANET) dynamically, and the communication link between two vehicles might remain active only for short duration of time. In order for VANET to make a connection for long time and to mitigate adverse effects due to high and fixed transmission power, the proposed algorithm adapts transmission power dynamically based on estimated local traffic …

Seasonal Adaptation Of Vegetation Color In Satellite Images For Flight Simulations, Yuzhong Shen, Jiang Li, Vamsi Mantena, Srinivas Jakkula

Electrical & Computer Engineering Faculty Publications

Automatic vegetation identification plays an important role in many applications including remote sensing and high performance flight simulations. This paper proposes a novel method that identifies vegetative areas in satellite images and then alters vegetation color to simulate seasonal changes based on training image pairs. The proposed method first generates a vegetation map for pixels corresponding to vegetative areas, using ISODATA clustering and vegetation classification. The ISODATA algorithm determines the number of clusters automatically. We then apply morphological operations to the clustered images to smooth the boundaries between clusters and to fill holes inside clusters. Six features are then computed …

Parameter Optimization For Image Denoising Based On Block Matching And 3d Collaborative Filtering, Ramu Pedada, Emin Kugu, Jiang Li, Zhanfeng Yue, Yuzhong Shen, Josien P.W. Pluim (Ed.), Benoit M. Dawant (Ed.)

Electrical & Computer Engineering Faculty Publications

Clinical MRI images are generally corrupted by random noise during acquisition with blurred subtle structure features. Many denoising methods have been proposed to remove noise from corrupted images at the expense of distorted structure features. Therefore, there is always compromise between removing noise and preserving structure information for denoising methods. For a specific denoising method, it is crucial to tune it so that the best tradeoff can be obtained. In this paper, we define several cost functions to assess the quality of noise removal and that of structure information preserved in the denoised image. Strength Pareto Evolutionary Algorithm 2 (SPEA2) …