Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 16 of 16 for “"Complexity Measurement"”.

  1. Image complexity measurement for predicting target detectability

    … task would be greatly facilitated by an image complexity metric that correlates with the performance of a large number of ATRs. The ideal metric is independent of any specific ATR and does not require advance knowledge of true targets in the image. No currently used metric meets both these …

    arizona-thes Repository record for Image complexity measurement for predicting target detectability (opens in a new tab)

  2. Complexity measurement of a graphical programming language and comparison of a graphical and a textual design language

    For many years the software engineering community has been attacking the software reliability problem on two fronts. First via design methodologies, languages and tools as a precheck on quality and second by measuring the quality of produced software as a postcheck. This research attempts to unify …

    vt Repository record for Complexity measurement of a graphical programming language and comparison of a graphical and a textual design language (opens in a new tab)

  3. Complexity measurement for dealing with class imbalance problems in classification modelling : a thesis submitted in fulfilment of the requirements for the degree of Doctor of Philosophy, Massey University, 2012

    … simultaneously: the imbalance rate, the data complexity, the algorithms and their associated parameters. As suggested in the literature, mining such datasets can only be improved by algorithms tailored to data characteristics; therefore it is important and necessary to do data exploratory …

    massey Repository record for Complexity measurement for dealing with class imbalance problems in classification modelling : a thesis submitted in fulfilment of the requirements for the degree of Doctor of Philosophy, Massey University, 2012 (opens in a new tab)

  4. Comparative Analysis of Entropy Algorithms to Determine the Most Effective Technique for Measuring Complexity in Building Construction

    … operation inefficiency is due to particular complexity factors owing to industry specific uncertainties and interdependences. The study of complexity in construction has become an essential topic to provide advanced methods and concepts for construction industry. It also has raised valid …

    tamu Repository record for Comparative Analysis of Entropy Algorithms to Determine the Most Effective Technique for Measuring Complexity in Building Construction (opens in a new tab)

  5. USEFUL MEASURES OF COMPLEXITY: A MODEL OF ASSESSING DEGREE OF COMPLEXITY IN ENGINEERED SYSTEMS AND ENGINEERING PROJECTS

    … engineers need new ways to measure problem complexity. This research lays the groundwork for measuring the complexity of systems engineering (SE) projects. This research proposes a project complexity measurement model (PCMM) and associated methods to measure complexity. To develop the PCMM, …

    nps Repository record for USEFUL MEASURES OF COMPLEXITY: A MODEL OF ASSESSING DEGREE OF COMPLEXITY IN ENGINEERED SYSTEMS AND ENGINEERING PROJECTS (opens in a new tab)

  6. A preliminary study of the relationship between complexity, motivation, and design quality.

    … study of the relationships between product complexity, design motivation, and design quality. Complexity, as it relates to the design process, is largely undefined and there exists no generally accepted method of measurement. This study applies an independent data set to a complexity …

    louisville Repository record for A preliminary study of the relationship between complexity, motivation, and design quality. (opens in a new tab)

  7. A complexity measure for the specifications of distributed systems.

    In software engineering, complexity measurement is a quantitative approach to estimating the degree of complication, organization and coding style of a computer program or system specification. Existing complexity metrics are mostly for non-distributed systems. This thesis extends them to …

    ottawa-retro Repository record for A complexity measure for the specifications of distributed systems. (opens in a new tab)

  8. Product and Process Based Assembly Time Estimation in Engineering Design

    … assembly time estimation technique maps the complexity of the product connectivity graph to an assembly time. Twenty-nine metrics have been proposed for the complexity measurement of product connectivity graphs. These twenty-nine metrics are mapped to assembly times through the use of …

    clemson Repository record for Product and Process Based Assembly Time Estimation in Engineering Design (opens in a new tab)

  9. Improved error control techniques for data transmission

    … near-optimum performance may be achieved with a complexity lower than the Viterbi algorithm. The soft-output Viterbi algorithm (SOVA) has been investigated as a means of providing soft-decision information for subsequent decoders. Considerations of how to apply SOVA to multi-level codes are …

    lancaster Download file for Improved error control techniques for data transmission (opens in a new tab)

  10. Connective Complexity Methods for Analysis and Prediction in Engineering Design

    Complexity is an aspect of engineering design that is often addressed directly with the principle that 'designs should be simple'. However, such a principle fails to offer an effective means of quantifying the complexity of a given design for comparison and decision making. The measurement of …

    clemson Repository record for Connective Complexity Methods for Analysis and Prediction in Engineering Design (opens in a new tab)

  11. Multiple Target Tracking Using Random Finite Sets

    … it presents challenges in terms of computational complexity, measurement-to-track association ambiguity, clutter, and miss detection. The first half of the dissertation looks into multiple extended target tracking on a moving platform using cameras and a Light Detection and Ranging (LiDAR) …

    umn Repository record for Multiple Target Tracking Using Random Finite Sets (opens in a new tab)

  12. Implications of additive manufacturing on complexity management within supply chains in a production environment.

    … production method to address the management of complexity in supply chains. While several drivers such as changing customer demand patterns and intensifying global competition increase product complexity, the available number of product variants and related processes within the supply chain …

    louisville Repository record for Implications of additive manufacturing on complexity management within supply chains in a production environment. (opens in a new tab)

  13. MCI progression classification for early diagnosis of Alzheimer’s disease using machine learning and deep learning methods

    … propose the use of novel features, based on complexity measurement, from volumetric amyloid PET images, which we use as input to a nonlinear Support Vector Machine (SVM) classifier. We tested this method using the novel PET features alone or in combination with standard PET metrics and …

    oxford Repository record for MCI progression classification for early diagnosis of Alzheimer’s disease using machine learning and deep learning methods (opens in a new tab)

  14. An Investigation of Feasible Logical Depth and Complexity Measures via Automata and Compression Algorithms

    … process or was it generated randomly? Kolmogorov Complexity is a fundamental tool of Algorithmic Information Theory which measures the complexity of such objects. However, there is one major problem: Kolmogorov Complexity is uncomputable. As such, the complexity of such objects are often studied …

    maynooth Download PDF for An Investigation of Feasible Logical Depth and Complexity Measures via Automata and Compression Algorithms (opens in a new tab)

  15. Geometric Configurations of Algorithms for Reduced m x 2 and 2 x 2 Matrix Multiplication

    … numerous efforts were made to reduce the complexity for n × n matrix multiplication. By 1986, the bound was reduced to O(n^2.38) by Coppersmith and Winograd. However this is an asymptotic result rather than an implementable algorithm. The complexity has not been significantly improved for …

    tamu Repository record for Geometric Configurations of Algorithms for Reduced m x 2 and 2 x 2 Matrix Multiplication (opens in a new tab)

  16. Circuit Design Methods with Emerging Nanotechnologies

    … graph model for function representation and complexity measurement. An atomic transformation is constructed to associate the function complexity variation with reversible gates. The efficiency of our heuristic lies in maximally decreasing the function complexity during synthesis steps as well …

    vt Repository record for Circuit Design Methods with Emerging Nanotechnologies (opens in a new tab)