Computer Sciences Commons^™

Segmentation And Model Generation For Large-Scale Cyber Attacks, Steven E. Strapp

Theses

Raw Cyber attack traffic can present more questions than answers to security analysts. Especially with large-scale observables it is difficult to identify which packets are relevant and what attack behaviors are present. Many existing works in Host or Flow Clustering attempt to group similar behaviors to expedite analysis; these works often phrase the problem directly as offline unsupervised machine learning. This work proposes online processing to simultaneously model coordinating actors and segment traffic that is relevant to a target of interest, all while it is being received. The goal is not just to aggregate similar attack behaviors, but to provide …

Riskvis: Supply Chain Visualization With Risk Management And Real-Time Monitoring, Rick S. M. Goh, Zhaoxia Wang, Xiaofeng Yin, Xiuju Fu, Loganathan Ponnanbalam, Sifei Lu, Xiaorong Li

Research Collection School Of Computing and Information Systems

With increased complexity, supply chain networks (SCNs) of modern era face higher risks and lower efficiency due to limited visibility. Hence, there is an immediate need to provide end-to-end supply chain visibility for efficient management of complex supply chains. This paper proposes a visualization scheme based on multi-hierarchical modular design and develops a supply chain visualization platform with risk management and real-time monitoring, named RiskVis, for realizing better Supply Chain Risk Management (SCRM). A Supply Chain Visualizer (SCV) with a graphical visualization platform is mounted as a part of a SCRM management decision-making dashboard and it provides senior management a …

Click-Boosting Random Walk For Image Search Reranking, Xiaopeng Yang, Yongdong Zhang, Ting Yao, Zheng-Jun Zha, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Image reranking is an effective way for improving the retrieval performance of keyword-based image search engines. A fundamental issue underlying the success of existing image reranking approaches is the ability in identifying potentially useful recurrent patterns or relevant training examples from the initial search results. Ideally, these patterns and examples can be leveraged to upgrade the ranks of visually similar images, which are also likely to be relevant. The challenge, nevertheless, originates from the fact that keyword-based queries are used to be ambiguous, resulting in difficulty in predicting the search intention. Mining useful patterns and examples without understanding query is …

An Agent-Based Network Analytic Perspective On The Evolution Of Complex Adaptive Supply Chain Networks, L. Ponnambalam, A. Tan, X. Fu, X. F. Yin, Zhaoxia Wang, R. S. Goh

Research Collection School Of Computing and Information Systems

Supply chain networks of modern era are complex adaptive systems that are dynamic and highly interdependent in nature. Business continuity of these complex systems depend vastly on understanding as to how the supply chain network evolves over time (based on the policies it adapts), and identifying the susceptibility of the evolved networks to external disruptions. The objective of this article is to illustrate as to how an agent-based network analytic perspective can aid this understanding on the network-evolution dynamics, and identification of disruption effects on the evolved networks. To this end, we developed a 4-tier agent based supply chain model …

Flotra: Flower-Shape Trajectory Mining For Instance-Specific Parameter Tuning, Lindawati Lindawati, Feida Zhu, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

The performance of a heuristic algorithm is highly dependent on its parameter configuration, yet finding a good parameter configuration is often a time-consuming task. In this paper we propose FloTra, a Flower graph mining for graph search Trajectory pattern extraction for generic instance-specific automated parameter tuning. This algorithm provides efficient extraction of compact and discriminative features of the search trajectory, upon which problem instances are clustered and the corresponding optimal parameter configurations are computed. Experimental evaluations of our approach on the Quadratic Assignment Problem (QAP) show that our approach offers promising improvement over existing parameter tuning algorithms. In this work, …

Multi-Agent Orienteering Problem With Time-Dependent Capacity Constraints, Cen Chen, Shih-Fen Cheng, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

The Orienteering Problem (OP), as originally defined by Tsiligirides, is the problem of cross-countr sport in which participants get rewards from visiting a predefined set of checkpoints. As Orienteering Problem can be used to describe a wide variety of real-world problems like route planning for facility inspection, patrolling of strategic location, and reward-weighted traveling salesman problem, it has attracted continuous interests from researchers and a large number of variants and corresponding algorithms for solving them have been introduced.

“Network-Theoretic” Queuing Delay Estimation In Theme Park Attractions, Ajay Aravamudhan, Archan Misra, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

Queuing is a common phenomenon in theme parks which negatively affects visitor experience and revenue yields. There is thus a need for park operators to infer the real queuing delays without expensive investment in human effort or complex tracking infrastructure. In this paper, we depart from the classical queuing theory approach and provide a data-driven and online approach for estimating the time-varying queuing delays experienced at different attractions in a theme park. This work is novel in that it relies purely on empirical observations of the entry time of individual visitors at different attractions, and also accommodates the reality that …

Improving Patient Length-Of-Stay In Emergency Department Through Dynamic Resource Allocation Policies, Kar Way Tan, Wei Hao Tan, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

In this work, we consider the problem of allocating doctors in the ambulatory area of a hospital's emergency department (ED) based on a set of policies. Traditional staffing methods are static, hence do not react well to surges in patient demands. We study strategies that intelligently adjust the number of doctors based on current and historical information about the patient arrival. Our main contribution is our proposed data-driven online approach that performs adaptive allocation by utilizing historical as well as current arrivals by running symbiotic simulation in real-time. We build a simulation prototype that models ED process that is close …

Near-Duplicate Video Retrieval: Current Research And Future Trends, Jiajun Liu, Zi Huang, Hongyun Cai, Heng Tao Shen, Chong-Wah Ngo, Wei Wang

Research Collection School Of Computing and Information Systems

The exponential growth of online videos, along with increasing user involvement in video-related activities, has been observed as a constant phenomenon during the last decade. User's time spent on video capturing, editing, uploading, searching, and viewing has boosted to an unprecedented level. The massive publishing and sharing of videos has given rise to the existence of an already large amount of near-duplicate content. This imposes urgent demands on near-duplicate video retrieval as a key role in novel tasks such as video search, video copyright protection, video recommendation, and many more. Driven by its significance, near-duplicate video retrieval has recently attracted …

Interacting Knapsack Problem In Designing Resource Bundles, Truong Huy D. Nguyen, Pradeep Reddy Varakantham, Hoong Chuin Lau, Shih-Fen Cheng

Research Collection School Of Computing and Information Systems

In many real-life businesses, the service provider/seller keeps a log of the visitors’ behavior as a way to assess the efficiency of the current business/operation model and find room for improvement. For example, by tracking when visitors entering attractions in a theme park, theme park owners can detect when and where congestion may occur, thus having contingency plans to reroute the visitors accordingly. Similarly, a Cable TV service provider can track channel switching events at each household to identify uninteresting channels. Subsequently, the repertoire of channels up for subscription can evolve over time to better serve the entertainment demand of …

Sroiq Syntax Approximation By Using Nominal Schemas, Cong Wang, David Carral, Pascal Hitzler

Computer Science and Engineering Faculty Publications

Nominal schemas is a recently introduced extension of description logics which makes it possible to express rules which generalize DL-safe ones. A tractable description logic, ELROV_n, has been identified. This leads us to the question: can we improve approximate reasoning results by employing nominal schemas? In this paper, we investigate how to approximately cast SROIQ into ELROV_n. Using a datalog-based tractable algorithm, a preliminary evaluation shows that our approach can indeed do approximate SROIQ-reasoning with a high recall.

Towards An Efficient Algorithm To Reason Over Description Logics Extended With Nominal Schemas, David Carral, Cong Wang, Pascal Hitzler

Computer Science and Engineering Faculty Publications

Extending description logics with so-called nominal schemas has been shown to be a major step towards integrating description logics with rules paradigms. However, establishing efficient algorithms for reasoning with nominal schemas has so far been a challenge. In this paper, we present an algorithm to reason with the description logic fragment ELROV_n, a fragment that extends EL⁺⁺ with nominal schemas. We also report on an implementation and experimental evaluation of the algorithm, which shows that our approach is indeed rather efficient.

Cs 3100: Data Structures And Algorithms, Erik Marlow Buck

Computer Science & Engineering Syllabi

Student learning outcomes include:

• Analyze basic algorithms for space and time complexity
• Design abstract data types appropriate for a given problem
• Implement data structures in an efficient manner
• Design and Implement non-graphical user-interfaces
• Select and implement appropriate data structures for a given problem
• Design algorithms to solve specific problems

Cs 1161: Introduction To Computer Programming Ii, Vanessa Starkey

Computer Science & Engineering Syllabi

Introduction to advanced programming concepts and techniques. Emphasis is on object-oriented programming and graphical user interfaces. Integrated lecture/lab.

Cs 3180/5180: Comparative Languages, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course will introduce fundamental concepts and paradigms underlying the design of modern programming languages. For concreteness, we study the details of an object-oriented language (e.g. Java, C#, C++), a functional language (e.g. Scheme), and get introduced to multiparadigm languages (e.g. Python, Scala). The overall goal is to enable comparison and evaluation of existing languages. The programming assignments will largely be coded in Java and in Racket (formerly, Scheme) and optionally in Python or Scala.

Cs 4000: Social Implications Of Computing, Leo Finkelstein

Computer Science & Engineering Syllabi

CS 4000 is a communication skills course using as its subject matter current salient issues associated with the social implications of computing. IN addition to the course text, you will need to use certain reading materials in the library and elsewhere, and you will be responsible for using concepts and theories provided in class lectures and discussions.

Cs 7840: Soft Computing, John C. Gallagher

Computer Science & Engineering Syllabi

This course explores soft computation from historical, theoretical, and application viewpoints. Soft computing methods to be considered include evolutionary computation, neural computation, fuzzy set theory, and approximate reasoning. Applications to problems in optimization, control, and classification will be presented.

Cs 1181: Computer Science Ii, Dan C. Wlodarski

Computer Science & Engineering Syllabi

This is the second course in a two-semester sequence introducing fundamental concepts and techniques for computer science and engineering. The course focuses on problem analysis, advanced programming concepts using JAVA and fundamental data structures. Students learn to analyze problems and evaluate potential solutions with respect to choice of data structures and computational efficiency. Student are exposed to the underlying implementation of basic data structures available in JAVA libraries and develop the skilled needs to extend existing data structures and design new data structures to solve increasingly complex problems. This is an integrated writing course.

Ceg 4422/6422-01: Secure Computing Practices, Bin Wang

Computer Science & Engineering Syllabi

No abstract provided.

Cs 7700: Advanced Database Systems, Soon M. Chung

Computer Science & Engineering Syllabi

Introduction of DB design concepts and operating principles of database systems.

A Multi-Configuration Display Methodology Incorporating Reflection For Real-Time Haptic-Interactive Virtual Environments, Mohammad F. Obeid

Computational Modeling & Simulation Engineering Theses & Dissertations

There is a natural need for real-time min-or reflection in many interactive virtual reality applications to achieve visuo-haptic collocation through optical reflection. Its use, however, calls for adjustments to the original model since a mirror reverses image characteristics. This thesis introduces a design and implementation of a generic configuration component for virtual environments that adjusts image characteristics and haptic interfaces to accommodate various display setups while preserving the correct orientation and properties of the original models in the graphical scene. Four different but related approaches were developed for image connection and are compared and contrasted against primary criteria. The haptic …

Optimization Of Solar Cell Arrays Using The Fibonacci Search Algorithm, Felicia Tyyan Farrow

Electrical & Computer Engineering Theses & Dissertations

In our energy hungry world, there is a growing demand to develop creative mechanisms to extract, conserve, and use energy from different resources. The use of solar cells to extract and convert solar energy into electrical energy is a growing and popular field of study because solar energy is clean, free, and renewable. One limitation for photovoltaic (PU) or solar technology is its loss in efficiency and availability as a result of shading or partial shading. Shading or partial shading decreases the total capable output power that the PV system can produce because the array is receiving irradiation from the …

Linear Programming Algorithm With Mixed Real-Integer Variables In Matlab Environments, Gelareh Bakhtyar

Civil & Environmental Engineering Theses & Dissertations

Efficient numerical procedures for solving general Linear Programming (LP) problems with mixed real-integer variables are developed in this work. The proposed algorithms employ the revised dual simplex with Branch and Bound (B&B) algorithms, with special procedures for limited search of subsequent branches. Computational time can be significantly reduced by incorporating the updated inverse formulas into the developed procedures. Both generic LP problems and deterministic pavement maintenance and rehabilitation (M&R) problems are used in this study to vaiidate the developed procedures. Medium to large-scale examples ( 11 pavement M&R) presented in this work have demonstrated that the developed numerical procedures consistently …

Multi-Objective Preliminary Design Optimization Of Planing Craft Using Differential Evolution And Artificial Networks, Robert Eugene Weidman

Mechanical & Aerospace Engineering Theses & Dissertations

The differential evolution (DE) algorithm is an evolutionary algorithm that has been utilized as a metaheuristic optimizer in the last few years. A recently developed multi-objective version of DE is utilized in this research in order to optimize the preliminary design of planing craft. The craft performance is evaluated using the planing hull preliminary design software PHAST. The optimization problem objectives are the craft acquisition cost and the overall measure of effectiveness; the latter comprises various performance aspects: ride quality, transportability, payload, and mobility. Static stability and operating constraints are also considered. Each of the aforementioned four measures of effectiveness …

Http Mailbox - Asynchronous Restful Communication, Sawood Alam

Computer Science Theses & Dissertations

Traditionally, general web services used only the GET and POST methods of HTTP while several other HTTP methods like PUT, PATCH, and DELETE were rarely utilized. Additionally, the Web was mainly navigated by humans using web browsers and clicking on hyperlinks or submitting HTML forms. Clicking on a link is always a GET request while HTML forms only allow GET and POST methods. Recently, several web frameworks/libraries have started supporting RESTful web services through APIs. To support HTTP methods other than GET and POST in browsers, these frameworks have used hidden HTML form fields as a workaround to convey the …

Protein Loop Length Estimation From Medium Resolution Cryoem Images, Andrew R. Mcknight

Computer Science Theses & Dissertations

In the post-genomic era, proteomics research presents a new frontier in life science. Proteins play roles in virtually every biological process, and understanding their atomic structures is the key to unraveling how they carry out their work. Compared to the over half million protein sequences in UniProt, only around 25,000 unique sequences have been atomically modeled and deposited to PDB (Protein Databank). Cryoelectron Microscopy (cryoEM) is an important biophysical technique that produces 3D subnanometer resolution images of molecules not amenable to past approaches like x-ray crystallography or nuclear magnetic resonance. De novo modeling is becoming a promising approach to derive …

Fixed Final Time Optimal Adaptive Control Of Linear Discrete-Time Systems In Input-Output Form, Qiming Zhao, Hao Xu, S. Jagannathan

Electrical and Computer Engineering Faculty Research & Creative Works

In this paper, the fixed final time adaptive optimal regulation of discrete-time linear systems with unknown system dynamics is addressed. First, by transforming the linear systems into the input/output form, the adaptive optimal control design depends only on the measured outputs and past inputs instead of state measurements. Next, due to the time-varying nature of finite-horizon, a novel online adaptive estimator is proposed by utilizing an online approximator to relax the requirement on the system dynamics. An additional error term corresponding to the terminal constraint is defined and minimized overtime. No policy/value iteration is performed by the novel parameter update …

Real-Life Vehicle Routing With Non-Standard Constraints, Wee Leong Lee

Research Collection School Of Computing and Information Systems

Real-life vehicle routing problems comprise of a number of complexities that are not considered by the classical models found in vehicle routing literature. I present, in this paper, a two-stage sweep-based heuristic to find good solutions to a real-life Vehicle Routing Problem (VRP). The problem I shall consider, will deal with some non-standard constraints beyond those normally associated with the classical VRP. Other than considering the capacity constraints for vehicles and the time windows for deliveries, I shall introduce four additional non-standard constraints: merging of customer orders, controlling the maximum number of drop points, matching orders to vehicle types, and …

Tesla: An Extended Study Of An Energy-Saving Agent That Leverages Schedule Flexibility, Jun Young Kwak, Pradeep Varakantham, Rajiv Maheswaran, Milind Tambe, Burcin Becerik-Gerber

Research Collection School Of Computing and Information Systems

This paper presents transformative energy-saving schedule-leveraging agent (TESLA), an agent for optimizing energy usage in commercial buildings. TESLA’s key insight is that adding flexibility to event/meeting schedules can lead to significant energy savings. This paper provides four key contributions: (i) online scheduling algorithms, which are at the heart of TESLA, to solve a stochastic mixed integer linear program for energy-efficient scheduling of incrementally/dynamically arriving meetings and events; (ii) an algorithm to effectively identify key meetings that lead to significant energy savings by adjusting their flexibility; (iii) an extensive analysis on energy savings achieved by TESLA; and (iv) surveys of real …

Applied Hypergame Theory For Network Defense, Alan S. Gibson

Theses and Dissertations

Cyber operations are the most important aspect of military conflicts in the 21st century, but unfortunately they are also among the least understood. The continual battle for network dominance between attackers and defenders is considered to be a complex game. Hypergame theory is an extension of game theory that addresses the kind of games where misperception exists, as is often the case in military engagements. Hypergame theory, like game theory, uses a game model to determine strategy selection, but goes beyond game theory by examining subgames that exist within the full game. The inclusion of misperception and misinformation in the …