Efficient Algorithms for the Maximum Convex Sum Problem
| dc.contributor.author | Thaher, Mohammed Shaban Atieh | |
| dc.date.accessioned | 2014-07-06T21:16:41Z | |
| dc.date.available | 2017-05-04T20:12:55Z | |
| dc.date.issued | 2014 | en |
| dc.description.abstract | This research is designed to develop and investigate newly defined problems: the Maximum Convex Sum (MCS), and its generalisation, the K-Maximum Convex Sum (K-MCS), in a two-dimensional (2D) array based on dynamic programming. The study centres on the concept of finding the most useful informative array portion as defined by different parameters involved in data, which is generically expressed in this thesis as the Maximum Sum Problem (MSP). This concept originates in the Maximum Sub-Array (MSA) problem, which relies on rectangular regions to find the informative array portion. From the above it follows that MSA and MCS belong to MSP. This research takes a new stand in using an alternative shape in the MSP context, which is the convex shape. Since 1977, there has been substantial research in the development of the Maximum Sub-Array (MSA) problem to find informative sub-array portions, running in the best possible time complexity. Conventionally the research norm has been to use the rectangular shape in the MSA framework without any investigation into an alternative shape for the MSP. Theoretically there are shapes that can improve the MSP outcome and their utility in applications; research has rarely discussed this. To advocate the use of a different shape in the MSP context requires rigorous investigation and also the creation of a platform to launch a new exploratory research area. This can then be developed further by considering the implications and practicality of the new approach. This thesis strives to open up a new research frontier based on using the convex shape in the MSP context. This research defines the new MCS problem in 2D; develops and evaluates algorithms that serve the MCS problem running in the best possible time complexity; incorporates techniques to advance the MCS algorithms; generalises the MCS problem to cover the K-Disjoint Maximum Convex Sums (K-DMCS) problem and the K-Overlapping Maximum Convex Sums (K-OMCS) problem; and eventually implements the MCS algorithmic framework using real data in an ecology application. Thus, this thesis provides a theoretical and practical framework that scientifically contributes to addressing some of the research gaps in the MSP and the new research path: the MCS problem. The MCS and K-MCS algorithmic models depart from using the rectangular shape as in MSA, and retain a time complexity that is within the best known time complexities of the MSA algorithms. Future in-depth studies on the Maximum Convex Sum (MCS) problem can advance the algorithms developed in this thesis and their time complexity. | en |
| dc.identifier.uri | http://hdl.handle.net/10092/9347 | |
| dc.identifier.uri | http://dx.doi.org/10.26021/1272 | |
| dc.language.iso | en | |
| dc.publisher | University of Canterbury. Computer Science and Software Engineering | en |
| dc.relation.isreferencedby | NZCU | en |
| dc.rights | Copyright Mohammed Shaban Atieh Thaher | en |
| dc.rights.uri | https://canterbury.libguides.com/rights/theses | en |
| dc.subject | Maximum Convex Sum (MCS) | en |
| dc.subject | K-Maximum Convex Sum (K-MCS) | en |
| dc.subject | Maximum Sub-Array (MSA) | en |
| dc.title | Efficient Algorithms for the Maximum Convex Sum Problem | en |
| dc.type | Theses / Dissertations | |
| thesis.degree.discipline | Computer Science | en |
| thesis.degree.grantor | University of Canterbury | en |
| thesis.degree.level | Doctoral | en |
| thesis.degree.name | Doctor of Philosophy | en |
| uc.bibnumber | 2009883 | |
| uc.college | Faculty of Engineering | en |
| uc.embargo | 24 | en |