scholarly journals Decidable Inequalities over Infinite Trees

10.29007/s21n ◽  
2018 ◽  
Author(s):  
Sabine Bauer ◽  
Steffen Jost ◽  
Martin Hofmann
Keyword(s):  
Entire Range ◽  
Decision Procedure ◽  
Object Oriented ◽  
Rational Numbers ◽  
Resource Analysis ◽  
Analysis Problem ◽  
Inference Mechanism ◽  
Combinatorics Of Words ◽  
Infinite Trees ◽  
The Given

Linear tree constraints are given by pointwise linear inequalities between infinite trees labeled with nonnegative rational numbers. Satisfiablity of such constraints is at least as hard as solving the Skolem-Mahler-Lech Problem. We provide an interesting subcase, for which we prove that satisfiablity is decidable. Our decision procedure is based on intricate arguments using automata and combinatorics of words.Our subcase allows to construct an inference mechanism for resource bounds of object oriented Java-like programs: actual resource bounds can be read off from solutions of tree constraints. So far, only the case of degenerated tree constraints (i.e. lists) was known to be decidable which, however, is insufficient to generally solve the given resource analysis problem. The present paper therefore provides a generalisation to trees of higher degree in order to cover the entire range of constraints encountered by resource analysis.

scholarly journals Theory of finite or infinite trees revisited

2008 ◽  
Vol 8 (04) ◽  
pp. 431-489 ◽  
Author(s):  
KHALIL DJELLOUL ◽  
THI-BICH-HANH DAO ◽  
THOM FRÜHWIRTH
Keyword(s):  
Constraint Satisfaction ◽  
Decision Procedure ◽  
Constraint Satisfaction Problem ◽  
Free Variable ◽  
Constraint Solver ◽  
First Order ◽  
Infinite Trees ◽  
Order Constraint ◽  
Infinite Set ◽  
Rewriting Rules

AbstractWe present in this paper a first-order axiomatization of an extended theoryTof finite or infinite trees, built on a signature containing an infinite set of function symbols and a relationfinite(t), which enables to distinguish between finite and infinite trees. We show thatThas at least one model and prove its completeness by giving not only a decision procedure, but a full first-order constraint solver that gives clear and explicit solutions for any first-order constraint satisfaction problem inT. The solver is given in the form of 16 rewriting rules that transform any first-order constraintinto an equivalent disjunction φ of simple formulas such that φ is either the formulatrueor the formulafalseor a formula having at least one free variable, being equivalent neither totruenor tofalseand where the solutions of the free variables are expressed in a clear and explicit way. The correctness of our rules implies the completeness ofT. We also describe an implementation of our algorithm in CHR (Constraint Handling Rules) and compare the performance with an implementation in C++ and that of a recent decision procedure for decomposable theories.

Qualitative: Open Source Python Tool for Quality Estimation over Multiple Machine Translation Outputs

2014 ◽  
Vol 102 (1) ◽  
pp. 5-16
Author(s):  
Avramidis Eleftherios ◽  
Poustka Lukas ◽  
Schmeier Sven
Keyword(s):  
Object Oriented ◽  
Object Oriented Programming ◽  
Language Models ◽  
Hooking Up ◽  
Quality Estimation ◽  
Web Based ◽  
Sentence Level ◽  
On Line ◽  
The Given ◽  
Selection Of

Abstract “Qualitative” is a python toolkit for ranking and selection of sentence-level output by different MT systems using Quality Estimation. The toolkit implements a basic pipeline for annotating the given sentences with black-box features. Consequently, it applies a machine learning mechanism in order to rank data based on models pre-trained on human preferences. The preprocessing pipeline includes support for language models, PCFG parsing, language checking tools and various other pre-processors and feature generators. The code follows the principles of object-oriented programming to allow modularity and extensibility. The tool can operate by processing both batch-files and single sentences. An XML-RPC interface is provided for hooking up with web-services and a graphical animated web-based interface demonstrates its potential on-line use.

LINGUOACOUSTIC RESOURCES IN OBJECT-ORIENTED DYNAMIC ENVIRONMENT

2021 ◽  
Vol 79 (3) ◽  
pp. 19-25
Author(s):  
ZDORONOK JULIA A. ◽  
Keyword(s):  
Foreign Language ◽  
Dynamic Environment ◽  
Object Oriented ◽  
Learning Material ◽  
Immediate Feedback ◽  
Linguistic Unit ◽  
Conscious Level ◽  
Speech Structures ◽  
Audiovisual Presentation ◽  
The Given

This article is devoted to the study of linguoacoustic resources, which are presented in an object-oriented dynamic environment as ready-to-use phrases. The systematization of linguoacoustic resources in the form of a phrasebook in an object-oriented dynamic environment determines the direction of a person in the study of a foreign language at a conscious level and supports this process with the standard of correct speech behavior, for which the acoustic component is primary. The formation of mental actions in an object-oriented dynamic environment occurs gradually due to the fragmentation of linguoacoustic material into doses, followed by assignment with immediate feedback. The presence of audiovisual components that serve as a guideline instead of rules-instructions, speaks of the acquiring of a foreign language at the functional level, which begins with obtaining a standard of speech behavior. The situation, which is given in the audiovisual presentation, contains everything that the linguistic unit contains, so that the learners acting as the characters depicted in the example have no doubts about what kind of speech action they should perform. As a result, the ability to perceive, understand and recognize speech structures in the given communication conditions is formed. In this way, the student becomes proficient due to a system, for which it is necessary not the rote learning, but the meaningful memorizing of learning material.

Generalization Data Mining in Fuzzy Object-Oriented Databases

2011 ◽  
pp. 85-112
Author(s):  
Rafal Angryk ◽  
Roy Ladner ◽  
Frederick E. Petry
Keyword(s):  
Data Mining ◽  
Relational Databases ◽  
Complex Structure ◽  
Object Oriented ◽  
Concept Hierarchy ◽  
Fuzzy Concept ◽  
Fuzzy Similarity ◽  
Specific Attribute ◽  
The Given ◽  
Object Oriented Databases

In this chapter, we consider the application of generalization-based data mining to fuzzy similarity-based object-oriented databases (OODBs). Attribute generalization algorithms have been most commonly applied to relational databases, and we extend these approaches. A key aspect of generalization data mining is the use of a concept hierarchy. The objects of the database are generalized by replacing specific attribute values by the next higher-level term in the hierarchy. This will then eventually result in generalizations that represent a summarization of the information in the database. We focus on the generalization of similarity-based simple fuzzy attributes for an OODB using approaches to the fuzzy concept hierarchy developed from the given similarity relation of the database. Then consideration is given to applying this approach to complex structure-valued data in the fuzzy OODB.

scholarly journals Test Case Prioritization & Selection for an Object Oriented Software using Genetic Algorithm.

2020 ◽  
Vol 9 (4) ◽  
pp. 349-354
Keyword(s):  
Genetic Algorithm ◽  
Object Oriented ◽  
Test Case ◽  
Test Cases ◽  
Test Case Prioritization ◽  
Test Case Selection ◽  
Case Selection ◽  
Selection For ◽  
The Given

In this paper our aim is to propose a Test Case Selection and Prioritization technique for OOP for ordering the test cases as per in accordance with their priority for finding the faults in the OOS. We have used the heuristic Genetic Algorithm, in order to generating the order of these prioritized test cases for a given OOS. The motive is to put a test case first into the ordered sequence that may have the highest prospective of finding an error in the given OOS & then soon..

scholarly journals Research of the cooperation technology between the air traffic control service and the aerodrome service

2021 ◽  
Vol 24 (4) ◽  
pp. 8-19
Author(s):  
K. A. Batalov ◽  
M. V. Kulakov ◽  
I. A. Chekhov
Keyword(s):  
Mathematical Model ◽  
Traffic Control ◽  
Air Traffic Control ◽  
Entire Range ◽  
Study Circles ◽  
Sequence Of Events ◽  
Proposed Model ◽  
The Mathematical Model ◽  
The Given ◽  
Control Service

The article considers the process of cooperation between the ATC and airport operation services. The analysis considers the procedures of cooperation while inspecting a runway before performing flights, aircraft departure and arrival that encompass the entire range of coordinated operations. For each procedure, the costs of aircraft delays are calculated. The assessment was carried out by synthesizing the chronology of services cooperation in real conditions. On the basis of the collected data flowcharts of services cooperation to ensure flights of an airport and the ATM services were built. To provide a visual comparison of the existing and proposed model sof services cooperation the networks of services cooperation were built based on the mathematical model of the graphic chart. The operation network establishes the sequence of events to provide departure of one aircraft operating a scheduled flight of an airline. Within the given study the ATC service and the aerodrome service are involved to ensure a departure. Cooperation between the operation and dispatch service of the airport and an aircraft crew is conditional because in this case they do not impact the technology of cooperation. The network is a particular set of dots(summits)interconnected by lines (links). In the case of our study, circles are events (performed work). Directional segments (lines) are work connecting events to each other. While assessing the process of cooperation during arrival and departure, two cases were considered: the runway is occupied or clear.The runway could be occupied for different reasons: available vehicles, people, animals or flocks of birds on the runway. The study of the cooperation technology was carried out for 12 monthsof making scheduled flights at Zhukovsky and Ostafievo airports on the basis of every day flight plans.

PRINCIPAL TYPE ASSIGNMENT TO LAMBDA TERMS

1991 ◽  
Vol 02 (02) ◽  
pp. 149-162 ◽  
Author(s):  
SACHIO HIROKAWA
Keyword(s):  
Decision Procedure ◽  
General Type ◽  
Principal Type ◽  
Type Assignment ◽  
The Given

A principal type-scheme of a λ-term is a most general type-scheme for the term. This paper presents two characterizations of principal type assignment figures. By the first characterization, a decision procedure is shown for the principality of a type assignment figure. By the second characterization, an algorithm is presented which transforms a type assignment to a λ-term into a principal type assignment to the term in O(k4m4) steps where k is the size of the given type and m is the size of the given term. This gives a new proof for the principal type-scheme theorem which states: if a λ-term has a type then it has a principal type. The proof in this paper is simpler than known proofs which use the unification.

Teaching Rational Numbers—Junior High School

1984 ◽  
Vol 31 (6) ◽  
pp. 43-46
Author(s):  
Fernand J. Prevost
Keyword(s):  
High School ◽  
Junior High School ◽  
Junior High ◽  
Rational Numbers ◽  
Whole Numbers ◽  
The Given

Whole numbers are used to count sets, report measures, and order a set. You can report the sum and difference of two counts, report the product of twice a measure, and divide two whole numbers to determine how many subsets of a given size are contained in a larger set or find how many objects will be in each subset if you divide the given set into a specified number of parts.

Generalization Data Mining in Fuzzy Object-Oriented Databases

2008 ◽  
pp. 2121-2140
Author(s):  
Rafal Angryk ◽  
Roy Ladner ◽  
Frederick E. Petry
Keyword(s):  
Data Mining ◽  
Relational Databases ◽  
Complex Structure ◽  
Object Oriented ◽  
Concept Hierarchy ◽  
Fuzzy Concept ◽  
Fuzzy Similarity ◽  
Specific Attribute ◽  
The Given ◽  
Object Oriented Databases

In this chapter, we consider the application of generalization-based data mining to fuzzy similarity-based object-oriented databases (OODBs). Attribute generalization algorithms have been most commonly applied to relational databases, and we extend these approaches. A key aspect of generalization data mining is the use of a concept hierarchy. The objects of the database are generalized by replacing specific attribute values by the next higher-level term in the hierarchy. This will then eventually result in generalizations that represent a summarization of the information in the database. We focus on the generalization of similarity-based simple fuzzy attributes for an OODB using approaches to the fuzzy concept hierarchy developed from the given similarity relation of the database. Then consideration is given to applying this approach to complex structure-valued data in the fuzzy OODB.

5Code – An Integrated Programming Environment for Beginners

i-com ◽  
2016 ◽  
Vol 15 (1) ◽  
Author(s):  
Markus Dahm ◽  
Frano Barnjak ◽  
Moritz Heilemann
Keyword(s):  
Cognitive Load ◽  
Web Application ◽  
Object Oriented ◽  
Object Oriented Programming ◽  
Programming Environment ◽  
Introductory Courses ◽  
Integrated Development Environment ◽  
Development Environment ◽  
Integrated Development ◽  
The Given

AbstractBased on experience in teaching programming, we developed the integrated development environment (IDE) 5Code especially to support beginners. As a first step, a simple, understandable formula was developed how to advance from the problem to the program in 5 operative steps:In order to reduce the cognitive load of the learners effectively, 5Code was designed such that all 5 steps are permanently presented, accessible and executable. Thus, learners are provided with the entire programming context from presentation of the task via own notes and annotations to the code area. Learners can mark and annotate any part of the given task’s text; these annotations can be edited as notes with own comments. Furthermore, the notes can be dragged into the code area, where they are shown as comments in the coding language. Any modifications in the comments are synchronized between notes and code. 5Code is implemented as a web-application. It is used in university introductory courses on object oriented programming.

Sign in / Sign up

Export Citation Format

Share Document