Computer Engineering Commons^™

An Mpi-Cuda Implementation For Massively Parallel Incompressible Flow Computations On Multi-Gpu Clusters, Dana A. Jacobsen, Julien C. Thibault, Inanc Senocak

Mechanical and Biomedical Engineering Faculty Publications and Presentations

Modern graphics processing units (GPUs) with many-core architectures have emerged as general-purpose parallel computing platforms that can accelerate simulation science applications tremendously. While multi-GPU workstations with several TeraFLOPS of peak computing power are available to accelerate computational problems, larger problems require even more resources. Conventional clusters of central processing units (CPU) are now being augmented with multiple GPUs in each compute-node to tackle large problems. The heterogeneous architecture of a multi-GPU cluster with a deep memory hierarchy creates unique challenges in developing scalable and efficient simulation codes. In this study, we pursue mixed MPI-CUDA implementations and investigate three strategies to …

Some Skepticism About Search Neutrality, James Grimmelmann

Faculty Scholarship

In the last few years, some search-engine critics have suggested that dominant search engines (i.e. Google) should be subject to “search neutrality” regulations. By analogy to network neutrality, search neutrality would require even-handed treatment in search results: It would prevent search engines from playing favorites among websites. Academics, Google competitors, and public-interest groups have all embraced search neutrality.

Despite this sudden interest, the case for search neutrality is too muddled to be convincing. While “neutrality” is an appealing-sounding principle, it lacks a clear definition. This essay explores no fewer than eight different meanings that search-neutrality advocates have given the term. …

Using Simulation Systems For Decision Support, Andreas Tolk

Computational Modeling & Simulation Engineering Faculty Publications

This chapter describes the use of simulation systems for decision support in support of real operations, which is the most challenging application domain in the discipline of modeling and simulation. To this end, the systems must be integrated as services into the operational infrastructure. To support discovery, selection, and composition of services, they need to be annotated regarding technical, syntactic, semantic, pragmatic, dynamic, and conceptual categories. The systems themselves must be complete and validated. The data must be obtainable, preferably via common protocols shared with the operational infrastructure. Agents and automated forces must produce situation adequate behavior. If these requirements …

M&S Body Of Knowledge: Progress Report And Look Ahead, Andreas Tolk

Computational Modeling & Simulation Engineering Faculty Publications

No abstract provided.

Challenges For Human, Social, Cultural, And Behavioral Modeling, S. K. Numrich, Andreas Tolk

Computational Modeling & Simulation Engineering Faculty Publications

Today's military focus has moved away from the force-on-force battlefield of the past century and into the domain of irregular warfare and its companion security, stability, transition and reconstruction missions. With that change in focus has come a need to examine the operational environment from a wider perspective, one that includes the whole range of human experiences and circumstances. As the set of factors and list of players expands, the need for reliable modeling and simulation increases, if for no other reason than to help the human decision maker make sense of this expanded decision space. However, to do this, …

Runtime Assertion Checking For Jml On The Eclipse Platform Using Ast Merging, Amritam Sarcar

Departmental Technical Reports (CS)

The Java Modeling Language (JML) is a formal behavioral interface specification language for Java. It is used for detailed design documentation of Java program modules such as classes and interfaces. JML has been used extensively by many researchers across various projects and has a large and varied spectrum of tool support. It extends from runtime assertion checking (RAC) to theorem proving.

Amongst these tools, RAC and ESC/Java has been used as a common tool for many research projects. RAC for JML is a tool that checks at runtime for possible violations of any specifications. However, lately there has been a …

Estimating Information Amount Under Uncertainty: Algorithmic Solvability And Computational Complexity, Vladik Kreinovich, Gang Xiang

Departmental Technical Reports (CS)

Measurement results (and, more generally, estimates) are never absolutely accurate: there is always an uncertainty, the actual value x is, in general, different from the estimate X. Sometimes, we know the probability of different values of the estimation error dx=X-x, sometimes, we only know the interval of possible values of dx, sometimes, we have interval bounds on the cdf of dx. To compare different measuring instruments, it is desirable to know which of them brings more information - i.e., it is desirable to gauge the amount of information. For probabilistic uncertainty, this amount of information is described by Shannon's entropy; …

Mining Frequent Generalized Patterns For Web Personalization In The Presence Of Taxonomies, P. Giannikopoulos, I. Varlamis, Magdalini Eirinaki

Faculty Publications

The Web is a continuously evolving environment, since its content is updated on a regular basis. As a result, the traditional usage-based approach to generate recommendations that takes as input the navigation paths recorded on the Web page level, is not as effective. Moreover, most of the content available online is either explicitly or implicitly characterized by a set of categories organized in a taxonomy, allowing the page-level navigation patterns to be generalized to a higher, aggregate level. In this direction, the authors present the Frequent Generalized Pattern (FGP) algorithm. FGP takes as input the transaction data and a hierarchy …

A Signal Processing Method To Explore Similarity In Protein Flexibility, Simina Vasilache, Nazanin Mirshahi, Soo-Yeon Ji, James Mottonen, Donald J. Jacobs, Kayvan Najarian

Computer Science Publications

Understanding mechanisms of protein flexibility is of great importance to structural biology. The ability to detect similarities between proteins and their patterns is vital in discovering new information about unknown protein functions. A Distance Constraint Model (DCM) provides a means to generate a variety of flexibility measures based on a given protein structure. Although information about mechanical properties of flexibility is critical for understanding protein function for a given protein, the question of whether certain characteristics are shared across homologous proteins is difficult to assess. For a proper assessment, a quantified measure of similarity is necessary. This paper begins to …

Task Analysis, Modeling, And Automatic Identification Of Elemental Tasks In Robot-Assisted Laparoscopic Surgery, Lavie Pinchas Golenberg

Wayne State University Dissertations

Robotic microsurgery provides many advantages for surgical operations, including tremor filtration, an increase in dexterity, and smaller incisions. There is a growing need for a task analyses on robotic laparoscopic operations to understand better the tasks involved in robotic microsurgery cases. A few research groups have conducted task observations to help systems automatically identify surgeon skill based on task execution. Their gesture analyses, however, lacked depth and their class libraries were composed of ambiguous groupings of gestures that did not share contextual similarities.

A Hierarchical Task Analysis was performed on a four-throw suturing task using a robotic microsurgical platform. Three …

Discrete Coordinate Transformation For Designing All-Dielectric Flat Antennas, Wenxuan Tang, Christos Argyropoulos, Efthymios Kallos, Wei Song, Yang Hao

Department of Electrical and Computer Engineering: Faculty Publications

Transformation electromagnetics provides a practical approach to control electromagnetic fields at will. Based on this principle, novel devices such as the invisible cloak have been proposed. Here we examine the extension of this technique as applied to the design of flat devices in antenna systems. A method using discrete coordinate transformation is proposed, which allows the conversion of conventional devices with curved shapes into flat systems, while preserving their non-dispersive, isotropic, broadband, and lossless properties. Two specific design examples, a flat reflector and a flat lens embedded in free space, are presented. To avoid the loss and narrow bandwidth issues …

Bioinformatic Identification And Characterization Of Human Endothelial Cell-Restricted Genes, Manoj Bhasin, Lei Yuan, Derin B. Keskin, Hasan H. Otu, Towia A. Libermann, Peter Oettgen

Department of Electrical and Computer Engineering: Faculty Publications

Background: In this study, we used a systematic bioinformatics analysis approach to elucidate genes that exhibit an endothelial cell (EC) restricted expression pattern, and began to define their regulation, tissue distribution, and potential biological role.

Results:Using a high throughput microarray platform, a primary set of 1,191 transcripts that are enriched in different primary ECs compared to non-ECs was identified (LCB >3, FDR

Conclusion: The study provides an initial catalogue of EC-restricted genes most of which are ubiquitously expressed in different endothelial cells.

Non-Destructiveapproachto Ellipsometric Monitoring Of A Film Coating On The Inner Surface Of A Tube Shaped Sample, Gregory K. Prilbil, John A. Woollam, Martin M. Liphardt, James D. Welch

Department of Electrical and Computer Engineering: Faculty Publications

Disclosed is the use of a focused electromagnetic beam which is caused to impinge on the top surface of a tube shaped sample, to investigate a film coating on inner surface during fabrication thereof and/or thereafter.

Generating System Requirements For A Mobile Digital Evidence Collection System: A Preliminary Step Towards Enhancing The Forensic Collection Of Digital Devices, Ibrahim Baggili

Electrical & Computer Engineering and Computer Science Faculty Publications

Collecting digital devices in a forensically sound manner is becoming more critical since 80% of all cases have some sort of digital evidence involved in them (Rogers, 2006, p. 1) .The process of documenting and tagging digital devices is cumbersome and involves details that might not apply to other types of evidence, since each evidence item has unique physical characteristics (Hesitis & Wilbon, 2005, p. 17). The process becomes less manageable when a large number of digital devices are seized. This paper examines the information and issues investigators should be aware of when collecting digital devices at crime scenes. Furthermore, …

Wi-Fi Localization Using Rssi Fingerprinting, Michael Quan, Eduardo Navarro, Benjamin Peuker

Computer Engineering

Wireless Local Area Networks using Wi-Fi is becoming more and more ubiquitous. As such, they provide a potential pre-built infrastructure for small area localization. This project serves as a proof of concept for a playground child tracking system to be deployed at Cal Poly's Child Development Playground Lab. The two main options for doing Wi-Fi localization are triangulation and fingerprinting. Triangulation involves mapping signal strength as a function of distance while fingerprinting creates a probability distribution of signal strengths at a given location and uses a map of these distributions to predict a location given signal strength samples. The triangulation …

Higate (High Grade Anti-Tamper Equipment) Prototype And Application To E-Discovery, Yui Sakurai, Yuki Ashino, Tetsutaro Uehara, Hiroshi Yoshiura, Ryoichi Sasaki

Journal of Digital Forensics, Security and Law

These days, most data is digitized and processed in various ways by computers. In the past, computer owners were free to process data as desired and to observe the inputted data as well as the interim results. However, the unrestricted processing of data and accessing of interim results even by computer users is associated with an increasing number of adverse events. These adverse events often occur when sensitive data such as personal or confidential business information must be handled by two or more parties, such as in the case of e-Discovery, used in legal proceedings, or epidemiologic studies. To solve …

Global Constructive Optimization Of Vascular Systems, Manfred Georg, Tobias Preusser, Horst K. Hahn

All Computer Science and Engineering Research

We present a framework for the construction of vascular systems based on optimality principles of theoretical physiology. Given the position and flow distribution of end points of a vascular system, we construct the topology and positions of internal nodes to complete the vascular system in a realistic manner. Optimization is driven by intravascular volume minimization with constraints derived from physiological principles. Direct optimization of a vascular system, including topological changes, is used instead of simulating vessel growth. A good initial topology is found by extracting key information from a previously optimized model with less detail. This technique is used iteratively …

Optimal Time Utility Based Scheduling Policy Design For Cyber-Physical Systems , Terry Tidwell, Robert Glaubius, Christopher D. Gill, William D. Smart

All Computer Science and Engineering Research

Classical scheduling abstractions such as deadlines and priorities do not readily capture the complex timing semantics found in many real-time cyber-physical systems. Time utility functions provide a necessarily richer description of timing semantics, but designing utility-aware scheduling policies using them is an open research problem. In particular, optimal utility accrual scheduling design is needed for real-time cyber-physical domains. In this paper we design optimal utility accrual scheduling policies for cyber-physical systems with periodic, non-preemptable tasks that run with stochastic duration. These policies are derived by solving a Markov Decision Process formulation of the scheduling problem. We use this formulation to …

Cloud Computing For Scalable Planning By Stochastic Search, Qiang Lu, You Xu, Ruoyun Huang, Yixin Chen

All Computer Science and Engineering Research

Graph search has been employed by many AI techniques and applications. A natural way to improve the efficiency of search is to utilize ad- vanced, more powerful computing platforms. However, expensive computing infrastructures, such as supercomputers and large-scale clusters, are traditionally available to only a limited number of projects and researchers. As a results, most AI applications, with access to only commodity com- puters and clusters, cannot benefit from the efficiency improvements of high-performance parallel search algorithms. Cloud computing provides an attractive, highly accessible alternative to other traditional high- performance computing platforms. In this paper, we first show that the …

Sorting As A Streaming Application Executing On Chip Multiprocessors, Roger D. Chamberlain, Greg A. Galloway, Mark A. Franklin

All Computer Science and Engineering Research

Expressing concurrency in applications has always been a difficult and error-prone endeavor, yet effective utilization of multi-core processors requires that the concurrency in applications be understood. One approach to the expression of concurrency is streaming, which has shown real promise as a safe and effective method for many application classes. Here, we express a classic problem, sorting, in the streaming paradigm and explore the implications of various algorithm and architectural design parameters on the performance of the application.