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 20 of 20 for “"binary string"”.

  1. The Binary String-to-String Correction Problem

    String-to-String Correction is the process of transforming some mutable string M into an exact copy of some other string (the target string T), using a shortest sequence of well-defined edit operations. The formal STRING-TO-STRING CORRECTION problem asks for the optimal solution using just two …

    uvic Repository record for The Binary String-to-String Correction Problem (opens in a new tab)

  2. Studies of active information in search.

    … examples considered are the location of a hidden string using a hamming distance, the encoding of a binary string using a perceptron, and developing programs using nand gates. In all of these cases, it is shown that the search processes work by making use of problem specific information. In …

    baylor Repository record for Studies of active information in search. (opens in a new tab)

  3. Prediction, Volatility and Complexity of Financial Markets:a move-based approach

    … the direction of the movements, creating a binary string: 1 for “up” and 0 for “down”. We show that it is possible to use this representation in order to create effective forecasting models based on the distance between the different sequences. Their parameters are determined by cross …

    aston Repository record for Prediction, Volatility and Complexity of Financial Markets:a move-based approach (opens in a new tab) Download PDF for Prediction, Volatility and Complexity of Financial Markets:a move-based approach (opens in a new tab)

  4. Querying and Updating XML Data based on Node Labeling Schemes

    … this thesis we propose a novel Compact Dynamic Binary String (CDBS) encoding to efficiently process updates. CDBS has two important properties which form the foundations of this thesis: (1) CDBS supports that CDBS codes can be inserted between any two consecutive CDBS codes with orders kept and …

    nus Repository record for Querying and Updating XML Data based on Node Labeling Schemes (opens in a new tab) Download file for Querying and Updating XML Data based on Node Labeling Schemes (opens in a new tab)

  5. Probabilistic Shape Parsing and Action Recognition Through Binary Spatio-Temporal Feature Description

    … As the second contribution in this thesis, a binary spatio-temporal feature descriptor is presented. Recent work shows that binary spatial feature descriptors are effective for increasing the efficiency of object recognition, while retaining comparable performance to state of the art …

    ottawa-retro Repository record for Probabilistic Shape Parsing and Action Recognition Through Binary Spatio-Temporal Feature Description (opens in a new tab)

  6. Linking cis-regulatory regions using transcription factor binding signatures

    … “signatures”. TF-binding signatures are binary string representations (e.g. 0011001...), where each position indicates binding (“1”) or not (“0”) of a TF to a CRE. We apply a cosine similarity metric to enhancer-promoter pairs linked in published studies involving CRISPRi-FlowFISH, …

    ubc Repository record for Linking cis-regulatory regions using transcription factor binding signatures (opens in a new tab) Download PDF for Linking cis-regulatory regions using transcription factor binding signatures (opens in a new tab)

  7. Discourse Segmentation of Judicial Decisions for Fact Extraction

    … based on the representation of legal texts as binary strings, where contiguous subsequences of 1's represent sentences containing Facts and, conversely, contiguous subsequences of 0's correspond to sentences containing non-Facts. The first approach consists of classifying each sentence in the …

    concordia Download PDF for Discourse Segmentation of Judicial Decisions for Fact Extraction (opens in a new tab)

  8. Fractal Imaging Theory and Applications beyond Compression

    … allows us to securely embed with redundancy a binary string within an image. Finally, we discuss some theory of certain random fractal transforms with potential applications to texturing.

    guelph Repository record for Fractal Imaging Theory and Applications beyond Compression (opens in a new tab)

  9. Simultaneous Plant/Controller Optimization of Traction Control for Electric Vehicle

    … to represent the variables, respectively, as a binary string, a real-valued number, and a novel rule base encoding based on the definition of a partially ordered set (poset) by delta inclusion. Simultaneous optimization results indicate that, under straight-line acceleration and unless energy …

    waterloo Repository record for Simultaneous Plant/Controller Optimization of Traction Control for Electric Vehicle (opens in a new tab)

  10. Characteristics and regularities of graphs and words

    … in discrete structures such as graphs, trees and strings that appear in Mathematics and Computer Science but also in many other interdisciplinary areas including bioinformatics, pattern matching and data compression. We investigate several types of regularities and characteristics appearing in …

    kings Repository record for Characteristics and regularities of graphs and words (opens in a new tab) Download PDF for Characteristics and regularities of graphs and words (opens in a new tab)

  11. Data Processing in Continuous-Variable Quantum Key Distribution Under Composable Finite-Size Security

    … shared correlations into a final secret binary string. In this work, we investigate the operation of three Gaussian-modulated coherent-state (GMCS) CV-QKD protocols: the homodyne detection, heterodyne detection and the continuous-variable measurement-device-independent (CV-MDI) protocol. …

    whiterose Download PDF for Data Processing in Continuous-Variable Quantum Key Distribution Under Composable Finite-Size Security (opens in a new tab)

  12. Early detection of morbidity in feedlot cattle using pattern recognition techniques

    … clustering and finally the development of a binary string to aid in the classification of M feeding behaviour. The developed procedure resulted in an overall classification accuracy of 84 % (82.5 and 85 % accuracy for H and M, respectively) for the model dataset, and 75 % overall (100 and 50 …

    sask Repository record for Early detection of morbidity in feedlot cattle using pattern recognition techniques (opens in a new tab)

  13. Confidentiality for Security in Discrete-Event Systems

    … reversible encoding method that can convert any binary string into a series of labels from a sequence of arbitrary non-empty sets. By using arbitrary sets, the outputs of this encoding method can be modelled by a certain type of automaton, allowing for more situations to be captured. This general …

    queens Repository record for Confidentiality for Security in Discrete-Event Systems (opens in a new tab)

  14. Computational and Structural Approaches to Periodicities in Strings

    … is a (<em>d</em>, <em>n</em>)-string } where <em>r</em>(<em><strong>x</strong></em>) is the number of runs in the string <em><strong>x</strong></em>, and a (<em>d</em>, <em>n</em>)-string is a string with length <em>n</em> and exactly <em>d</em> distinct symbols. Our …

    mcmaster Repository record for Computational and Structural Approaches to Periodicities in Strings (opens in a new tab)

  15. Perceptually based methods for robust image hashing

    … functions. Their purpose is to extract a short binary string from a large digital message. A key feature of conventional cryptographic (and other) hashing algorithms such as message digest 5 (MD5) and secure hash algorithm 1 (SHA-1) is that they are extremely sensitive to the message; i.e., …

    texas Repository record for Perceptually based methods for robust image hashing (opens in a new tab)

  16. Enumeration of Factorizations in the Symmetric Group: From Centrality to Non-centrality

    … which arises in the study of connections between string theory and Yang-Mills theory, is the chief problem motivating this research. This thesis introduces a refinement of the (p,q,n)-dipole problem, namely, the (a,b,c,d)- dipole problem. A Join-Cut analysis of the (a,b,c,d)-dipole problem leads …

    waterloo Repository record for Enumeration of Factorizations in the Symmetric Group: From Centrality to Non-centrality (opens in a new tab)

  17. Robust Face Representation and Recognition Under Low Resolution and Difficult Lighting Conditions

    … adapt the interpolated pixels. A Modified Local Binary Pattern (MLBP) methodology for feature extraction is proposed to obtain robust face recognition under varying lighting conditions. Original LBP operator compares pixels in a local neighborhood with the center pixel and converts the resultant …

    odu Repository record for Robust Face Representation and Recognition Under Low Resolution and Difficult Lighting Conditions (opens in a new tab)

  18. Wind farm layout optimization under uncertainty with landowners' financial and noise concerns

    … landowner participation scenarios as a binary string variable, along with number of turbines. The optimal Cost-of-Energy results are compared to actual Cost-of-Energy data and found to be realistic. System Model 2 advances Model 1 with an optimization-under-uncertainty formulation. A …

    iastate Repository record for Wind farm layout optimization under uncertainty with landowners' financial and noise concerns (opens in a new tab)

  19. Modular and Robust Computation with Deterministic Chemical Reaction Networks

    … providing an arbitrarily long input (e.g. a binary string) quite difficult. (2) It promotes modular design of CRNs. Designing chemical systems from modular components that communicate via concentration signals is now possible, and we demonstrate its effectiveness in multiple constructions …

    iastate Repository record for Modular and Robust Computation with Deterministic Chemical Reaction Networks (opens in a new tab)

  20. INFORMATION THEORETIC SECRET KEY GENERATION: STRUCTURED CODES AND TREE PACKING

    … theoretic security requirements of increasing stringency: weak, strong and perfect secrecy, as well as different types of sources: finite-valued and continuous, are studied. Specifically, three different models are investigated. First, we consider strong secrecy generation for a discrete …

    maryland Repository record for INFORMATION THEORETIC SECRET KEY GENERATION: STRUCTURED CODES AND TREE PACKING (opens in a new tab)