Physical Sciences and Mathematics Commons^™

Validation Study Of Image Recognition Algorithms, Jacob Miller, Jeremy Evert

Student Research

Developments in machine learning in recent years have created opportunities that previously never existed. One such field with an explosion of opportunity is image recognition, also known as computer vision; the process in which a machine analyzes a digital image.

In order for a machine to ‘see’ as a human does, it must break down the image in a process called image segmentation. The way the machine goes about doing this is important, and many algorithms exist to determine just how a machine will decide to group the pixels in an image.

This research is a validation study of related …

A Mathematical Framework On Machine Learning: Theory And Application, Bin Shi

FIU Electronic Theses and Dissertations

The dissertation addresses the research topics of machine learning outlined below. We developed the theory about traditional first-order algorithms from convex opti- mization and provide new insights in nonconvex objective functions from machine learning. Based on the theory analysis, we designed and developed new algorithms to overcome the difficulty of nonconvex objective and to accelerate the speed to obtain the desired result. In this thesis, we answer the two questions: (1) How to design a step size for gradient descent with random initialization? (2) Can we accelerate the current convex optimization algorithms and improve them into nonconvex objective? For application, …

Phase Contrast Time-Lapse Microscopy Datasets With Automated And Manual Cell Tracking Annotations, Dai Fei Elmer Ker, Zhaozheng Yin, For Full List Of Authors, See Publisher's Website.

Computer Science Faculty Research & Creative Works

Phase contrast time-lapse microscopy is a non-destructive technique that generates large volumes of image-based information to quantify the behaviour of individual cells or cell populations. To guide the development of algorithms for computer-aided cell tracking and analysis, 48 time-lapse image sequences, each spanning approximately 3.5 days, were generated with accompanying ground truths for C2C12 myoblast cells cultured under 4 different media conditions, including with fibroblast growth factor 2 (FGF2), bone morphogenetic protein 2 (BMP2), FGF2 + BMP2, and control (no growth factor). The ground truths generated contain information for tracking at least 3 parent cells and their descendants within these …

Data Stream Algorithms For Large Graphs And High Dimensional Data, Hoa Vu

Doctoral Dissertations

In contrast to the traditional random access memory computational model where the entire input is available in the working memory, the data stream model only provides sequential access to the input. The data stream model is a natural framework to handle large and dynamic data. In this model, we focus on designing algorithms that use sublinear memory and a small number of passes over the stream. Other desirable properties include fast update time, query time, and post processing time. In this dissertation, we consider different problems in graph theory, combinatorial optimization, and high dimensional data processing. The first part of …

Offensive And Defensive Security For Everyday Computer Systems, Ian Markwood

USF Tampa Graduate Theses and Dissertations

This dissertation treats a variety of topics in the computer security domain which have direct impact on everyday life. The first extends false data injection attacks against state estimation in electric power grids and then provides a novel power flow model camouflage method to hamper these attacks. The second deals with automotive theft response, detailing a method for a car to intelligently identify when it has been stolen, based on collected behavioral traits of its driver. The third demonstrates a new attack against the content integrity of the PDF file format, caus- ing humans and computers to see different information …

Iterated Local Search Algorithms For Bike Route Generation, Aidan Pieper

Honors Theses

Planning routes for recreational cyclists is challenging because they prefer longer more scenic routes, not the shortest one. This problem can be modeled as an instance of the Arc Orienteering Problem (AOP), a known NP-Hard optimization problem. Because no known algorithms exist to solve this optimization problem efficiently, we solve the AOP using heuristic algorithms which trade accuracy for speed. We implement and evaluate two different Iterated Local Search (ILS) heuristic algorithms using an open source routing engine called GraphHopper and the OpenStreetMap data set. We propose ILS variants which our experimental results show can produce better routes at the …

Geometric Algorithms For Intervals And Related Problems, Shimin Li

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

In this dissertation, we study several problems related to intervals and develop efficient algorithms for them. Interval problems have many applications in reality because many objects, values, and ranges are intervals in nature, such as time intervals, distances, line segments, probabilities, etc. Problems on intervals are gaining attention also because intervals are among the most basic geometric objects, and for the same reason, computational geometry techniques find useful for attacking these problems. Specifically, the problems we study in this dissertation includes the following: balanced splitting on weighted intervals, minimizing the movements of spreading points, dispersing points on intervals, multiple barrier …

Application Of Cosine Similarity In Bioinformatics, Srikanth Maturu

Department of Computer Science and Engineering: Dissertations, Theses, and Student Research

Finding similar sequences to an input query sequence (DNA or proteins) from a sequence data set is an important problem in bioinformatics. It provides researchers an intuition of what could be related or how the search space can be reduced for further tasks. An exact brute-force nearest-neighbor algorithm used for this task has complexity O(m * n) where n is the database size and m is the query size. Such an algorithm faces time-complexity issues as the database and query sizes increase. Furthermore, the use of alignment-based similarity measures such as minimum edit distance adds an additional complexity to the …

A Legal Perspective On The Trials And Tribulations Of Ai: How Artificial Intelligence, The Internet Of Things, Smart Contracts, And Other Technologies Will Affect The Law, Iria Giuffrida, Fredric Lederer, Nicolas Vermeys

Faculty Publications

No abstract provided.

Opportunity Identification For New Product Planning: Ontological Semantic Patent Classification, Farshad Madani

Dissertations and Theses

Intelligence tools have been developed and applied widely in many different areas in engineering, business and management. Many commercialized tools for business intelligence are available in the market. However, no practically useful tools for technology intelligence are available at this time, and very little academic research in technology intelligence methods has been conducted to date.

Patent databases are the most important data source for technology intelligence tools, but patents inherently contain unstructured data. Consequently, extracting text data from patent databases, converting that data to meaningful information and generating useful knowledge from this information become complex tasks. These tasks are currently …

Auditing Snomed Ct Hierarchical Relations Based On Lexical Features Of Concepts In Non-Lattice Subgraphs, Licong Cui, Olivier Bodenreider, Jay Shi, Guo-Qiang Zhang

Computer Science Faculty Publications

Objective—We introduce a structural-lexical approach for auditing SNOMED CT using a combination of non-lattice subgraphs of the underlying hierarchical relations and enriched lexical attributes of fully specified concept names. Our goal is to develop a scalable and effective approach that automatically identifies missing hierarchical IS-A relations.

Methods—Our approach involves 3 stages. In stage 1, all non-lattice subgraphs of SNOMED CT’s IS-A hierarchical relations are extracted. In stage 2, lexical attributes of fully-specified concept names in such non-lattice subgraphs are extracted. For each concept in a non-lattice subgraph, we enrich its set of attributes with attributes from its ancestor …

The Accuracy, Fairness, And Limits Of Predicting Recidivism, Julie Dressel, Hany Farid

Dartmouth Scholarship

Algorithms for predicting recidivism are commonly used to assess a criminal defendant’s likelihood of committing a crime. These predictions are used in pretrial, parole, and sentencing decisions. Proponents of these systems argue that big data and advanced machine learning make these analyses more accurate and less biased than humans. We show, however, that the widely used commercial risk assessment software COMPAS is no more accurate or fair than predictions made by people with little or no criminal justice expertise. We further show that a simple linear predictor provided with only two features is nearly equivalent to COMPAS with its 137 …

Single-Layer Channel Routing And Placement With Single-Sided Nets, Ronald I. Greenberg, Jau-Der Shih

Ronald Greenberg

This paper considers the optimal offset, feasible offset, and optimal placement problems for a more general form of single-layer VLSI channel routing than has usually been considered in the past. Most prior works require that every net has exactly one terminal on each side of the channel. As long as only one side of the channel contains multiple terminals of the same net, we provide linear-time solutions to all three problems. Such results are implausible if the placement of terminals is entirely unrestricted; in fact, the size of the output for the feasible offset problem may be Ω(n^2). The linear-time …

Minimum Separation For Single-Layer Channel Routing, Ronald I. Greenberg, F. Miller Maley

Ronald Greenberg

We present a linear-time algorithm for determining the minimum height of a single-layer routing channel. The algorithm handles single-sided connections and multiterminal nets. It yields a simple routability test for single-layer switchboxes, correcting an error in the literature.

Equity Trading Evaluation Strategies In Switzerland After The European Mifid Ii, Linn Kristina Karstadt

Walden Dissertations and Doctoral Studies

Swiss bank traders are affected by technological and regulatory challenges, which may affect their broker voting process and may result in a change of trading and evaluation behavior in 2018. Compounded challenges exist when broker evaluation strategies are not effective or Markets in Financial Instruments Directive (MiFID) II compliant. This qualitative, single case study, built on efficient capital market hypothesis and innovative disruption theory, was focused on effective broker evaluation strategies after MiFID II in Switzerland. The sample consisted of 4 buy-side traders, who shared their unique perspectives. Methodological triangulation was achieved through semistructured interviews, a review of the institution's …

Algorithmic Issues In Some Disjoint Clustering Problems In Combinatorial Circuits, Zola Nailah Donovan

Graduate Theses, Dissertations, and Problem Reports

As the modern integrated circuit continues to grow in complexity, the design of very large-scale integrated (VLSI) circuits involves massive teams employing state-of-the-art computer-aided design (CAD) tools. An old, yet significant CAD problem for VLSI circuits is physical design automation. In this problem, one needs to compute the best physical layout of millions to billions of circuit components on a tiny silicon surface. The process of mapping an electronic design to a chip involves several physical design stages, one of which is clustering. Even for combinatorial circuits, there exist several models for the clustering problem. In particular, we consider the …