Other Computer Engineering Commons^™

Artist-Driven Fracturing Of Polyhedral Surface Meshes, Tyler Casella

Master's Theses

This paper presents a robust and artist driven method for fracturing a surface polyhedral mesh via fracture maps. A fracture map is an undirected simple graph with nodes representing positions in UV-space and fracture lines along the surface of a mesh. Fracture maps allow artists to concisely and rapidly define, edit, and apply fracture patterns onto the surface of their mesh.

The method projects a fracture map onto a polyhedral surface and splits its triangles accordingly. The polyhedral mesh is then segmented based on fracture lines to produce a set of independent surfaces called fracture components, containing the visible surface …

Service Oriented Solution Modeling And Variation Propagation Analysis Based On Architectural Building Blocks, Liang-Jie Zhang, Jia Zhang

Jia Zhang

In spite of the widely recognized benefits of applying Service Oriented Architecture (SOA) to design enterprise-scale software systems, its actual application practice is not always a success. One major reason is the lack of a systematic engineering process and tool supported by reusable architectural artifacts. Toward this ultimate goal, this paper proposes a new method of architectural building blocks (ABB)-based SOA solution design and it is applicable to any layered or tiered infrastructure. We present the modeling of solution-level architectural artifacts and their relationships, whose formalization enables event-based variation notification and propagation analysis. The goal is to provide architecture-level support …

Examples Where The Conjunctive And Dempster’S Rules Are Insensitive, Florentin Smarandache, Jean Dezert, Valeri Kroumov

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper we present several counter-examples to the Conjunctive rule and to Dempster rule of combinations in information fusion.

Adaptive Co-Scheduler For Highly Dynamic Resources, Kartik Vedalaveni

Computer and Electronics Engineering: Dissertations, Theses, and Student Research

There are many kinds of scientific applications that run on high throughput computational (HTC) grids. HTC may utilize clusters opportunistically, only running on a given cluster when it is otherwise idle. These widely dispersed HTC clusters are heterogeneous in terms of capability and availability, but can provide significant computing power in aggregate. The scientific algorithms run on them also vary greatly. Some scientific algorithms might use high rates of disk I/O and some might need large amounts of RAM. Most schedulers only consider cpu availability, but unchecked demand on these associated resources that aren’t managed by resource managers may give …

Advancements And Challenges Towards A Collaborative Framework For 3d Tele-Immersive Social Networking, Davide Andrea Mauro, N. E. O’Connor, D. Monaghan, Marc Gowing, P. Fechteler, P. Eisert, J. Wall, E. Izquierdo, D. S. Alexiadis, P. Daras, R. Mekuria, P. Cesar

Computer Sciences and Electrical Engineering Faculty Research

Social experiences realized through teleconferencing systems are still quite different from face to face meetings. The awareness that we are online and in a, to some extent, lesser real world are preventing us from really engaging and enjoying the event. Several reasons account for these differences and have been identified. We think it is now time to bridge these gaps and propose inspiring and innovative solutions in order to provide realistic, believable and engaging online experiences. We present a distributed and scalable framework named REVERIE that faces these challenges and provides a mix of these solutions. Applications built on top …

Paris: A Parallel Rsa-Prime Inspection Tool, Joseph R. White

Master's Theses

Modern-day computer security relies heavily on cryptography as a means to protect the data that we have become increasingly reliant on. As the Internet becomes more ubiquitous, methods of security must be better than ever. Validation tools can be leveraged to help increase our confidence and accountability for methods we employ to secure our systems.

Security validation, however, can be difficult and time-consuming. As our computational ability increases, calculations that were once considered “hard” due to length of computation, can now be done in minutes. We are constantly increasing the size of our keys and attempting to make computations harder …

A Human Proximity Operations System Test Case Validation Approach, Justin Huber, Jeremy Straub

Jeremy Straub

A Human Proximity Operations System (HPOS) poses numerous risks in a real world environment. These risks range from mundane tasks such as avoiding walls and fixed obstacles to the critical need to keep people and processes safe in the context of the HPOS’s situation-specific decision making. Validating the performance of an HPOS, which must operate in a real-world environment, is an ill posed problem due to the complexity that is introduced by erratic (non-computer) actors. In order to prove the HPOS’s usefulness, test cases must be generated to simulate possible actions of these actors, so the HPOS can be shown …