Computer Sciences Commons^™

Effects Of Technology On School Aged Children, Shawn Lamont Lee Jr.

Senior Seminars

The advancements of technology have greatly influenced child development. Throughout the years, as technology became more advanced, I believe that it has caused the development of the child to advance as well. When I speak about child development, it is pertaining to the stages of development in children, which are physical development, social & emotional development, cognitive development, and communication. This paper will take the reader through a timeline of influential technical advancements that have played a factor in child development, followed by an explanation of the stages of development in children, and then it will explain the positive and …

Time Will Tell : Temporal Reasoning In Clinical Narratives And Beyond, Weiyi Sun

Legacy Theses & Dissertations (2009 - 2024)

Temporal reasoning in natural language refers to the extraction and understanding of time-related information conveyed in free text. A clinical narrative temporal reasoning component can enable a spectrum of medical natural language processing (NLP) applications that directly improve patient care documentation efficiency, accessibility and accountability. This dissertation contributes in three subtasks under temporal reasoning: temporal annotation, temporal expression extraction and temporal relation inferences. The temporal annotation work described in the dissertation produced one of the first publicly available clinical narratives. We published one of the first sets of temporal

Computational Modeling-Driven Study Of Signaling Pathway Affecting Cleft Formation During Submandibular Salivary Gland Development, Shayoni Ray

Legacy Theses & Dissertations (2009 - 2024)

Branching morphogenesis is a conserved mechanism of mammalian organ development (salivary glands, lungs, mammary glands, pancreas, kidney, etc.), and has been a classic topic of study for generations of developmental biologists. During the process of tissue formation, several cellular and molecular and protein signaling events occur at successive stages enabling proper formation of tissue shape and structure. In order to provide a comprehensive understanding of the process of branching morphogenesis, we need a systems level approach to integrate multifactorial information. My overall global hypothesis is that multiple mathematical modeling approaches can be utilized to extract crucial cellular and tissue level …

Effective Entity Resolution Methodology For Improving Data Quality And Reliability Of Service-Oriented Applications, Ewa Musial

Legacy Theses & Dissertations (2009 - 2024)

This dissertation proposes new paradigms for improving the testing, reliability of service-oriented applications as well as the quality of data. Since it is difficult to track information flowing through the multiple tiers of an application, testing service-oriented systems can be very challenging. We present a methodology for testing service-oriented applications that takes into account all the components, including services, external services, and data components. The results of our experiments demonstrate that this approach greatly improves the effectiveness of testing service-oriented applications.

Constructing Carmichael Numbers Through Improved Subset-Product Algorithms, W.R. Alford, Jon Grantham, Steven Hayman, Andrew Shallue

Scholarship

style="color: rgb(51, 51, 51); font-family: "Helvetica Neue", Helvetica, Arial, sans-serif; font-size: 14px;">We have constructed a Carmichael number with 10,333,229,505 prime factors, and have also constructed Carmichael numbers with style="color: rgb(51, 51, 51); font-family: "Helvetica Neue", Helvetica, Arial, sans-serif; font-size: 14px;"> prime factors for every style="color: rgb(51, 51, 51); font-family: "Helvetica Neue", Helvetica, Arial, sans-serif; font-size: 14px;"> between 3 and 19,565,220. These computations are the product of implementations of two new algorithms for the subset product problem that exploit the non-uniform distribution of primes style="color: rgb(51, 51, 51); font-family: "Helvetica Neue", Helvetica, Arial, sans-serif; font-size: 14px;">with the property that …

Federated Scheduling For Stochastic Parallel Real-Time Tasks, Jing Li, Kunal Agrawal, Christopher Gill, Chenyang Lu

All Computer Science and Engineering Research

Federated scheduling is a strategy to schedule parallel real-time tasks: It allocates a dedicated cluster of cores to high-utilization task (utilization >1); It uses a multiprocessor scheduling algorithm to schedule and execute all low-utilization tasks sequentially, on a shared cluster of the remaining cores. Prior work has shown that federated scheduling has the best known capacity augmentation bound of 2 for parallel tasks with implicit deadlines. In this paper, we explore the soft real-time performance of federated scheduling and address the average-case workloads instead of the worst-case values. In particular, we consider stochastic tasks -- tasks for which execution time …

Cms Use Of A Data Federation, Kenneth A. Bloom, C.

Kenneth Bloom Publications

CMS is in the process of deploying an Xrootd based infrastructure to facilitate a global data federation. The services of the federation are available to export data from half the physical capacity and the majority of sites are configured to read data over the federation as a back-up. CMS began with a relatively modest set of use-cases for recovery of failed local file opens, debugging and visualization. CMS is finding that the data federation can be used to support small scale analysis and load balancing. Looking forward we see potential in using the federation to provide more flexibility in the …

Inferring Memory Map Instructions, Paul T. Scheid, Ari J. Spilo, Ron K. Cytron

All Computer Science and Engineering Research

We describe the problem of inferring a set of memory map instructions from a reference trace, with the goal of minimizing the number of such instructions as well as the number of unreferenced but mapped storage locations. We prove the related decision problem NP-complete. We then present and compare the results of two heuristic approaches on some actual traces.

Capacity Augmentation Bound Of Federated Scheduling For Parallel Dag Tasks, Jing Li, Abusayeed Saifullah, Kunal Agrawal, Christopher Gill

All Computer Science and Engineering Research

We present a novel federated scheduling approach for parallel real-time tasks under a general directed acyclic graph (DAG) model. We provide a capacity augmentation bound of 2 for hard real-time scheduling; here we use the worst-case execution time and critical-path length of tasks to determine schedulability. This is the best known capacity augmentation bound for parallel tasks. By constructing example task sets, we further show that the lower bound on capacity augmentation of federated scheduling is also 2 for any m > 2. Hence, the gap is closed and bound 2 is a strict bound for federated scheduling. The federated scheduling …

Performance Modeling Of Virtualized Custom Logic Computations, Michael J. Hall, Roger D. Chamberlain

All Computer Science and Engineering Research

Virtualization of custom logic computations (i.e., by sharing a fixed function across distinct data streams) provides a means of reusing hardware resources, particularly when resources are limited. This is common practice in traditional processors where more than one user can share processor resources. In this paper, we virtualize a custom logic block using C-slow techniques to support fine-grain context-switching. We then develop and present an analytic model for several performance measures (throughput, latency, input queue occupancy) for both fine-grained and coarse-grained context switching (to a secondary memory). Next, we calibrate the analytic performance model with empirical measurements. We then validate …

Rt-Openstack: A Real-Time Cloud Management System, Sisu Xi, Chong Li, Chenyang Lu, Christopher D. Gill, Meng Xu, Linh T.X. Phan, Insup Lee, Oleg Sokolsky

All Computer Science and Engineering Research

Clouds have become appealing platforms for running not only general-purpose applications but also real-time applications. However, current clouds cannot provide real-time performance for virtual machines (VM) for two reasons: (1) the lack of a real-time virtual machine monitor (VMM) scheduler on a single host, and (2) the lack of a real-time aware VM placement scheme by the cloud manager. While real-time VM schedulers do exist, prior solutions employ either heuristics-based approaches that cannot always achieve predictable latency or apply real-time scheduling theory that may result in low CPU utilization. We observe the demand and advantage for co-hosting real-time (RT) VMs …

An Efficient Storage And Retrieval Mechanism For Large Unstructured Grids, Oyindamola Akande

Electronic Theses and Dissertations

The size of spatial scientific datasets is steadily increasing due to improvements in instruments and availability of computational resources. Scientific datasets today are often far too large to fit into a single machine's memory or even a single disk. However, much of the research on efficient storage and access to spatial datasets has focused on large multidimensional arrays. In contrast, unstructured grids consisting of collections of implices (e.g. triangles or tetrahedra) present special challenges that have received less attention. Data values found at the vertices of the simplices may be dispersed throughout a datafile, producing especially poor disk locality. Partitioning …

Random Forests Based Rule Learning And Feature Elimination, Sheng Liu

Electronic Theses and Dissertations

Much research combines data from multiple sources in an effort to understand the underlying problems. It is important to find and interpret the most important information from these sources. Thus it will be beneficial to have an effective algorithm that can simultaneously extract decision rules and select critical features for good interpretation while preserving the prediction performance. We propose an efficient approach, combining rule extraction and feature elimination, based on 1-norm regularized random forests. This approach simultaneously extracts a small number of rules generated by random forests and selects important features. To evaluate this approach, we have applied it to …

Truthful Mechanisms For Resource Allocation And Pricing In Clouds, Mahyar Movahednejad

Wayne State University Theses

A major challenging problem for cloud providers is designing efficient mechanisms for

Virtual Machine (VM) provisioning and allocation. Such mechanisms enable the cloud

providers to effectively utilize their available resources and obtain higher profits. Recently,

cloud providers have introduced auction-based models for VM provisioning and allocation

which allow users to submit bids for their requested VMs. We formulate the dynamic

VM provisioning and allocation problem for the auction-based model as an integer program

considering multiple types of resources. We then design truthful greedy and optimal

mechanisms for the problem such that the cloud provider provisions VMs based on the

requests …

Taming Uncertainties In Real-Time Routing For Wireless Networked Sensing And Control, Xiaohui Liu

Wayne State University Theses

Real-time routing is a basic element of closed-loop, real-time sensing and control, but it is challenging due to dynamic, uncertain link/path delays.

The probabilistic nature of link/path delays makes the basic problem of computing the probabilistic distribution of path delays NP-hard, yet quantifying probabilistic path delays is a basic element of real-time routing and may well have to be executed by resource-constrained devices in a distributed manner;

the highly-varying nature of link/path delays makes it necessary to adapt to in-situ delay conditions in real-time routing, but it has been observed that delay-based routing can lead to instability, estimation error, and …

Explicit Preemption Placement For Real-Time Conditional Code Via Graph Grammars And Dynamic Programming, Bo Peng

Wayne State University Theses

Traditional worst-case execution time (WCET) analysis must make very pessimistic assumptions regarding the cost of preemptions for a real-time job. For every potential preemption point, the analysis must add to the WCET of a job the cache-related preemption delay (CRPD) incurred due to the contention for memory resources with other jobs in the system. However, recent work has shown that CRPD can vary at each preemption point (due to the cache lines that must be reloaded for subsequent code after the preemption). Using this observation and information obtained from schedulability analysis on the maximum length of the non-preemptive region of …

The Rna Newton Polytope And Learnability Of Energy Parameters, Elmirasadat Forouzmand

Wayne State University Theses

Computational RNA secondary structure prediction has been a topic of much research interest for several decades now. Despite all the progress made in the field, even the state-of-the-art algorithms do not provide satisfying results, and the accuracy of output is limited for all the existent tools. Very complex energy models, different parameter estimation methods, and recent machine learning approaches had not been the answer for this problem. We believe that the first step to achieve results with high quality is to use the energy model with the potential for predicting accurate output. Hence, it is necessary to have a systematic …

De Novo Co-Assembly Of Bacterial Genomes From Multiple Single Cells, Narjes Sadat Movahedi Tabrizi

Wayne State University Theses

Recent progress in DNA amplication techniques, particularly multiple displacement amplication (MDA), has made it possible to sequence and assemble bacterial genomes from a single cell. However, the quality of single cell genome assembly has not yet reached the quality of normal multicell genome assembly due to the coverage bias and errors caused by MDA. Using a template of more than one cell for MDA or combining separate MDA products has been shown to improve the result of genome assembly from few single cells, but providing identical single cells, as a necessary step for these approaches, is a challenge. As a …

Case Study Of Phased Model For Software Change In A Multiple-Programmer Environment, Yoann Senin

Wayne State University Theses

The aim of this thesis is to perform an empirical study comparing programmers completing software changes assisted by the recently published software process Phased Model for Software Change (PMSC) to those completing software changes without any assistance. There have been numerous researches on software change, but most of them focused more on individual phases of the software change process in lieu of the software change process as a whole. For that reason, this thesis explores the impact of the PMSC process on programmers' performance. The subjects of this study are graduate students with different level of experience.

The results of …

Adapting In-Game Agent Behavior By Observation Of Players Using Learning Behavior Trees, Emmett Tomai, Roberto Flores

Computer Science Faculty Publications

In this paper we describe Learning Behavior Trees, an extension of the popular game AI scripting technique. Behavior Trees provide an effective way for expert designers to describe complex, in-game agent behaviors. Scripted AI captures human intuition about the structure of behavioral decisions, but suffers from brittleness and lack of the natural variation seen in human players. Learning Behavior Trees are designed by a human designer, but then are trained by observation of players performing the same role, to introduce human-like variation to the decision structure. We show that, using this model, a single hand-designed Behavior Tree can cover a …

Why The Data Train Needs Semantic Rails, Krzysztof Janowicz, Frank Van Harmelen, James A. Hendler, Pascal Hitzler

Computer Science and Engineering Faculty Publications

While catchphrases such as big data, smart data, data intensive science, or smart dust highlight different aspects, they share a common theme: Namely, a shift towards a data-centric perspective in which the synthesis and analysis of data at an ever-increasing spatial, temporal, and thematic resolution promises new insights, while, at the same time, reducing the need for strong domain theories as starting points. In terms of the envisioned methodologies, those catchphrases tend to emphasize the role of predictive analytics, i.e., statistical techniques including data mining and machine learning, as well as supercomputing. Interestingly, however, while this perspective takes the availability …

Approaches For Testing And Evaluation Of Xacml Policies, Izzat M. Alsmadi

Computer Science Faculty Publications (Archived)

Security services are provided through: The applications, operating systems, databases, and the network. There are many proposals to use policies to define, implement and evaluate security services. We discussed a full test automation framework to test XACML based policies. Using policies as input the developed tool can generate test cases based on the policy and the general XACML model. We evaluated a large dataset of policy implementations. The collection includes more than 200 test cases that represent instances of policies. Policies are executed and verified, using requests and responses generated for each instance of policies. WSO2 platform is used to …

Issues Related To The Detection Of Source Code Plagiarism In Students Assignments, Izzat M. Alsmadi, I. Alhami, S. Kazakzeh

Computer Science Faculty Publications (Archived)

Detecting similarity or plagiarism in the academic research publications, source code, etc. has been a long time complex and time consuming task. Several algorithms, tools and websites exist that try to find plagiarism or possible plagiarism in those human creative products. In this paper we used source code plagiarism detection tools to assess the level of plagiarism in source codes. We also investigated issues related to accuracy and challenges in detecting possible plagiarism in students' assignments. In a second study, we evaluated some tools against detecting possible plagiarism in research papers. Results showed that such process or decision is not …

Mqvc: Measuring Quranic Verses Similarity And Sura Classification Using N-Gram, M. Akour, Izzat M. Alsmadi, I. Alazzam

Computer Science Faculty Publications (Archived)

Extensive research efforts in the area of Information Retrieval were concentrated on developing retrieval systems related to Arabic language for the different natural language and information retrieval methodologies. However, little effort was conducted in those areas for knowledge extraction from the Holly Muslim book, the Quran. In this paper, we present an approach (MQVC) for retrieving the most similar verses in comparison with a user input verse as a query. To demonstrate the accuracy of our approach, we performed a set of experiments and compared the results with an evaluation from a Quran Specialist who manually identified all relevant chapters …

Test Cases Selection Based On Source Code Features Extraction, I. Alazzam, Izzat M. Alsmadi, M. Akour

Computer Science Faculty Publications (Archived)

Extracting valuable information from source code automatically was the subject of many research papers. Such information can be used for document traceability, concept or feature extraction, etc. In this paper, we used an Information Retrieval (IR) technique: Latent Semantic Indexing (LSI) for the automatic extraction of source code concepts for the purpose of test cases' reduction. We used and updated the open source FLAT Eclipse add on to try several code stemming approaches. The goal is to check the best approach to extract code concepts that can improve the process of test cases' selection or reduction.

2tl: A Raid I/O Scheduling Algorithm For Simultaneously Providing Latency And Throughput Guarantees, Yipkei Kwok

Open Access Theses & Dissertations

It is increasingly common for applications to require that data read from and written to a shared storage system be delivered within a specified amount of time (usually milliseconds), called a latency requirement, or be delivered at a specified rate (measured in megabytes per second), called a throughput requirement. Given an input/output (I/O) workload, which consists of the streams of I/O requests of a set of applications, the storage system, via its I/O scheduler, is expected to simultaneously meet the workload's latency and throughput requirements. In addition, it is expected to provide performance guarantees, i.e., guarantees that it will meet …

Neighbor Discovery Message Hold Times For Mobile Ad Hoc Networks, Joshua Lee Mccartney

Open Access Theses & Dissertations

We present the results of an experimental study designed to understand the impact of neighbor discovery message hold times on network performance measures for a mobile ad hoc network. A physical testbed of pseudo-mobile nodes using the OLSR routing protocol was used for our experiments. We found statistically significant evidence to suggest that setting the neighbor discovery message hold times close to the neighbor discovery message interval time results in the best overall network performance.

Runtime Pipeline I/O Scheduling System For Gpu-Based Heterogeneous Architectures, Julio Cesar Olaya

Open Access Theses & Dissertations

Heterogeneous architectures can improve the performance of applications with computationally intensive operations. Even when these architectures may reduce the execution time of applications, there are opportunities for additional performance improvement as the memory hierarchies of the central processor cores and the coprocessor cores are separate. Applications running on heterogeneous architectures where graphics processing units (GPUs) execute throughput-intense, data-parallel operations may run in a single address space provided by unified virtual addressing or expand the upper bounds of scalability and high performance computing by explicitly partitioning and transferring data across orthogonal host and device address spaces. For explicit handling, applications must …

Platform-Independent Data Locality Analysis To Predict Cache Performance On Abstract Hardware Platforms, Sonish Shrestha

Open Access Theses & Dissertations

This research is part of a co-design project that has the goal of designing hardware systems to match application requirements and efficiently mapping applications to hardware. This thesis is focused on optimizing the platform cache memory hierarchy configuration. To determine application requirements, we characterize the application using platform- independent locality metrics. Next we use locality data and an analytical model to predict cache an application performance of sequential versions of application codes for various cache configurations. After using an analytical model to select a candidate set of cache memory hierarchy configurations, we used architectural simulation to test the selection for …

Multi-Dimensional Emotion Recognition From Geometry And Color Information, Geovany A. Ramirez

Open Access Theses & Dissertations

Emotions play a fundamental role in everyday interactions among humans. Humans are adept at expressing themselves and interpreting others through a multi-modal, subtle and complex process using non-verbal cues including speech prosody, facial expression, eye gaze, body gestures, head motion, posture, and skin color changes. However, recognizing the affective state of humans is a difficult task for computers.

Automatic emotion recognition has focused on analysis of the six discrete basic emotions: happiness, sadness, surprise, fear, anger and disgust. However, humans express more complex and subtle affective states such as confusion, shame, pleasure, anxiety or depression. Therefore, a different representation based …