Search
Skip to Search Results- 1 Gut, Ivo
- 1Andersson, Leif
- 1Besnier, Francois
- 1Bonar, Christopher David
- 1Broda, Kurtis N
- 1Burden, Michael P
- 23Graduate and Postdoctoral Studies (GPS), Faculty of
- 23Graduate and Postdoctoral Studies (GPS), Faculty of /Theses and Dissertations
- 1Biological Sciences, Department of
- 1Biological Sciences, Department of/Journal Articles (Biological Sciences)
- 1Computing Science, Department of
- 1Computing Science, Department of/Technical Reports (Computing Science)
-
A high-density SNP-based linkage map of the chicken genome reveals sequence features correlated with recombination rate
Download2019-03-01
Gut, Ivo, Lathrop, Mark , Muir, William M. , Foglio, Mario , Wong, Gane K., Groenen, Martien A. , Megens, Hendrik-Jan , Cheng, Hans H. , Besnier, Francois , Crooijmans, Richard PMA , Wahlberg, Per , Andersson, Leif
-
A Novel Method of Measuring Refractory Black Carbon Mass and Number Distributions by Inversion of CPMA-SP2 Data
DownloadFall 2017
A new method of examining mass and number distributions of nanoscale refractive black carbon (rBC) particles has been developed. This method will be useful for atmospheric scientists conducting semi-continuous measurement of atmospheric rBC. The new method uses a Centrifugal Particle Mass...
-
Acoustic and elastic least-squares two-way wave equation migration with exact adjoint operator
DownloadSpring 2017
A major problem in exploration seismology entails estimating subsurface structures and properties via linearized inversion. The problem is often called ''least-squares migration" where seismic imaging is posed as an iterative least-squares problem. The iterative solution employs the method of...
-
1998
Technical report TR98-06. In this paper, we examine the bandwidth problem in circular-arc graphs, chordal graphs with a bounded number of leaves in the clique tree, and k-polygon graphs (fixed k). All of these graph classes admit efficient approximation algorithms which are based on exact or...
-
Fall 2016
In this thesis, we present approximation algorithms for various NP-hard vehicle routing problems, as well as for a related maximum group coverage problem. Our main contribution is a framework to build good constant-factor approximation algorithms for variants of the multi-depot $k$-travelling...
-
Fall 2015
In this thesis, we consider two closely related clustering problems, Min Sum k-Clustering (MSkC) and Balanced k-Median (BkM). In Min Sum k-clustering, one is given a graph and a parameter k, and has to partition the vertices in the graph into k clusters to minimize the sum of pairwise distances...
-
Approximation Algorithms for Multi-processor Task Scheduling Problems on Identical Parallel Processors
DownloadFall 2013
In this thesis we present approximation algorithms for some multi-processor task scheduling problems. In a scheduling problem, there is a set of processors P that can be used to process a set of tasks T and the goal is to find a feasible scheduling of the tasks on the processors, while optimizing...
-
Spring 2023
In this thesis, we present Approximation Schemes for the Min Sum k Clustering problem on a number of classes of graph metrics. In Min Sum k Clustering problem introduced by Sahni and Gonzalez [22] in 1976, given a graph G(V, E) with metric edge costs and parameter k, we are asked to partition V...
-
Development of a Model using Machine Learning Intended to be Embedded in a Wearable Device to Detect Muscle Fatigue based on sEMG Data Associated with a Sustained Single 80% Maximum Voluntary Contraction
DownloadFall 2021
Background: Muscle fatigue is the progressive reduction in a muscle's ability to contract and exert force when performing a sustained task. Muscle fatigue may prevent the task from being complete and increase the risk of injury. Eventually, the performance of individuals during athletic...