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 24 for “"Reduction rules"”.
-
An evaluation of South Africa’s debt reduction rules within the context of the mining tax regime
… to align, in taxation terms, the mining debt reduction provisions to the general debt reduction provisions. The literature review aimed to answer a twofold research question, that is, a critical consideration of whether the mining debt reduction provision is aligned to the general debt …
-
The corporate debt reduction tax rules as an added impediment to companies in financial distress
… (hereinafter referred to as the previous debt reduction rules). The previous debt reduction rules were replaced by section 19 and paragraph 12A of the Eighth Schedule to the Act, which came into operation 1 January 2013 (hereinafter referred to as the new debt reduction rules). The new debt …
-
Cohesive Subgraph Detection in Massive Networks
… iteratively reduces the graph size by applying reduction rules on vertices with very low degrees (Reducing) and temporarily removing with the highest degree (Peeling) if the reduction rules cannot be applied. Secondly, based on our framework we design two baseline algorithms, a linear-time …
-
The design of backtrack algorithms.
… model of program synthesis based on a problem reduction problem representation, two reduction rules are developed for transforming a problem specification into a backtrack control structure with specifications for lower level functions. We illustrate these rules with sample problems.
-
Techniques of petri net reduction
… the capability of Petri Nets. Previous Petri Net reduction techniques focussed on reducing a subnet to a single transition and hence not powerful enough to reduce a Petri Net. This paper presents six reduction rules and discusses their drawbacks. A new reduction technique called Knitting Technique …
-
String to String Correction Kernelization
… exists. We show, using two polynomial time reduction rules on large regions of the input strings, that the problem has a problem kernel of size O(k^4). Our algorithm achieves this in a polynomial running time. Additionally, we introduce the problem k-MultiStringToStringCorrection (k-MS2SC), …
-
Formalization of Opaque Definitions for a Dependent Type Theory
… demands some subtlety—for instance, subject reduction may be lost if an opaque type definition doesn’t unfold in exactly the right way. Despite this, there has been relatively little work on formally characterizing opaque definitions. We contribute here a formalization of opaque top-level …
-
Decision diagrams: Extensions and applications to reachability analysis
… decision diagram, ESRBDD, that combines multiple reduction rules, is canonical, and produces a more compact representation than previous efforts. We show that operations on ESRBDDs are at least as efficient as those on the underlying decision diagrams and introduce extensions to ESRBDDs that …
-
Neural Network vs. Rule-Based G2P: A Hybrid Approach to Stress Prediction and Related Vowel Reduction in Bulgarian
… of syllable stress and resulting vowel reductions in the Bulgarian language. We then develop a hybrid G2P approach which combines manually written grapheme-to-phoneme mapping rules with neural network-enabled syllable stress predictions by inserting stress markers in the predicted stress …
-
Uma máquina de redução de grafos extensível para a implementação de fluxos de trabalho
Graph Reduction Machines, are a traditional technique for implementing functional programming languages. They allow to run programs by transforming graphs by the successive application of reduction rules. Web service composition enables the creation of new web services from existing ones. BPEL is a …
-
Flowgraph analysis and active device models for symbolic simulation
… to a transfer function using an explicit set of reduction rules. This thesis develops a heirarchical Mason's signal flowgraph algorithm which expands the capabilities of symbolic simulation. This algorithm creates an environment which is ideally suited to the analysis of large systems with both …
-
Hibridização de heurísticas, com programação inteira e mineração de dados, para a solução de duas variantes do problema do caixeiro viajante
… formulation, new valid inequalities, seven new reduction rules, and four hybrid heuristics, which combine a state-of-the-art heuristic with integer linear programming (ILP) and data mining. For the PCTSP, a separation procedure is proposed for the cut-sets constraints of a literature’s …
-
Phylogenetic decisiveness and no-rainbow hypergraph coloring
… algorithm for decisiveness, (4) develop problem reduction rules, and use them to obtain efficient algorithms for inputs with few loci, (5) apply local search and devise a deterministic and a randomized algorithm for decisiveness(6) devise Boolean satisfiability (SAT) and integer linear …
-
Investigation of different 12V DC/DC Topologies and optimum selection for Automotive
… automotive sector. Due to the strict emission reduction rules in the European union (EU), the transportation industry shifts toward electric vehicles which have driven significant technological advancements and increased the importance of DC/DC converters for energy conversion. In this thesis, …
-
Redundancy identification and parallel test generation using boolean satisfiability
… form. The algorithm is based on a system of five reduction rules which form a complete rule system. Experimental results on the benchmark circuits show that the number of rule applications in all cases is comparable to the size of the original boolean difference formula. Other satisfiability …
-
Argumentation in Romans 1-11
… Dijk's concept of macrostructure and information reduction rules by which the macrostructure of a text is discovered. A particular case of the use of the subordinating particle 'gar' is examined in some detail. Chapter IV presents a profile of Romans, that is, the charting of the grammatical …
-
Graphical structure of unsatisfiable boolean formulae
… Using this theorem, we generate a list of graph reduction rules and an incomplete list of obstructions to satisfiability of looped-multi-hypergraphs. A part of this research, especially the search for unsatisfiable instances of GraphSAT, was carried out using computational tools. Hence, some …
-
Interval-Dependent Attributes in Relational Database Systems
… operators on interval data are defined by reduction rules that map a temporal operator to an operation with a temporal primitive followed by the corresponding traditional non-temporal operator that uses equality on aligned intervals. A key feature of our approach is that operators can …
Page 1 of 2