scholarly journals What is the optimal bin size of a histogram: An informal description

2017 ◽  
Vol 12 ◽  
pp. 731-736
Author(s):  
Afshin Gholamy ◽  
Vladik Kreinovich
Keyword(s):  
Informal Description

First description of the algorithms

2011 ◽  
Author(s):  
Jean-Marc Couveignes ◽  
Bas Edixhoven
Keyword(s):  
Finite Fields ◽  
Modular Forms ◽  
Minimal Polynomial ◽  
Galois Representations ◽  
Essential Step ◽  
Sufficient Precision ◽  
Informal Description

This chapter provides the first, informal description of the algorithms. It explains how the computation of the Galois representations V attached to modular forms over finite fields should proceed. The essential step is to approximate the minimal polynomial P of (3.1) with sufficient precision so that P itself can be obtained.

Signal Recovery by Linear Estimation

2019 ◽  
pp. 260-385
Author(s):  
John Stillwell
Keyword(s):  
Human Activities ◽  
Mathematical Concept ◽  
Rational Numbers ◽  
Precise Definition ◽  
Computable Analysis ◽  
Signal Recovery ◽  
Linear Estimation ◽  
Definition Of ◽  
Computable Sequence ◽  
Informal Description

This chapter develops the basic results of computability theory, many of which are about noncomputable sequences and sets, with the goal of revealing the limits of computable analysis. Two of the key examples are a bounded computable sequence of rational numbers whose limit is not computable, and a computable tree with no computable infinite path. Computability is an unusual mathematical concept, because it is most easily used in an informal way. One often talks about it in terms of human activities, such as making lists, rather than by applying a precise definition. Nevertheless, there is a precise definition of computability, so this informal description of computations can be formalized.

scholarly journals СТВОРЕННЯ ОНТОЛОГІЇ ПРЕДМЕТНОЇ ГАЛУЗІ МАЙБУТНІМ ІНЖЕНЕРОМ-ПЕДАГОГОМ КОМП’ЮТЕРНОГО ПРОФІЛЮ

2016 ◽  
Vol 53 (3) ◽  
pp. 74
Author(s):  
Serhiy V. Kozibroda
Keyword(s):  
Information Technology ◽  
Information System ◽  
Knowledge Base ◽  
Computer System ◽  
Computer Technology ◽  
Domain Knowledge ◽  
Professional Activity ◽  
Huge Amount ◽  
Knowledge Ontology ◽  
Informal Description

The problem of creation of the domain knowledge ontology in education of future engineering teachers in branch of Information Technology is considered in the article. The ontology of Information System domain knowledge has been built. This enables to combine a huge amount of existing information into a single knowledge base that combines several disciplines. It has been shown in the process of investigation that Protege OWL programming product is the best for the creation of computer system ontology in preparing future engineering teachers and makes it possible to describe not only concepts, but also specific objects. It is based on a logical model that allows creating definitions of Information System domain knowledge of informal description. The structure and methods of building and using in future the ontology of Information System domain knowledge in the professional activity future engineering teachers in the area of computer technology has been studied.

Solutions to Selected Exercises

2019 ◽  
pp. 447-608
Author(s):  
John Stillwell
Keyword(s):  
Human Activities ◽  
Mathematical Concept ◽  
Rational Numbers ◽  
Computability Theory ◽  
Precise Definition ◽  
Computable Analysis ◽  
Infinite Path ◽  
Definition Of ◽  
Computable Sequence ◽  
Informal Description

This chapter develops the basic results of computability theory, many of which are about noncomputable sequences and sets, with the goal of revealing the limits of computable analysis. Two of the key examples are a bounded computable sequence of rational numbers whose limit is not computable, and a computable tree with no computable infinite path. Computability is an unusual mathematical concept, because it is most easily used in an informal way. One often talks about it in terms of human activities, such as making lists, rather than by applying a precise definition. Nevertheless, there is a precise definition of computability, so this informal description of computations can be formalized.

Informal description and analysis of geographic requirements: an approach based on problems

2006 ◽  
Vol 6 (3) ◽  
pp. 223-245 ◽  
Author(s):  
Maria Augusta V. Nelson ◽  
Paulo S. C. Alencar ◽  
Donald D. Cowan
Keyword(s):  
Informal Description

scholarly journals Methodology for Development of Event-driven Software Systems using CIAO Specification Language

2020 ◽  
Vol 19 (3) ◽  
pp. 481-514
Author(s):  
Irina Afanasieva ◽  
Fedor Novikov ◽  
Ludmila Fedorchenko
Keyword(s):  
Unified Modeling Language ◽  
Reactive Systems ◽  
Cooperative Interaction ◽  
Software Systems ◽  
Complex Behavior ◽  
Specific Domain ◽  
Regular Form ◽  
Original Solution ◽  
Event Driven ◽  
Informal Description

Event-driven software systems, belonging to the class of systems with complex behavior in the scientific literature, are reactive systems, which react to the same input effect in different ways depending on their state and background. It is convenient to describe such systems using state-transition models utilizing special language tools, both graphical and textual. Methodology for automated development of systems with complex behavior using the designed CIAO language (Cooperative Interaction of Automata Objects), which allows formally specifying the required behavior based on an informal description of the reacting system, is presented. An informal description of a reacting system can be provided verbally in a natural language or in another way adopted in a specific domain. Further, according to this specification in the CIAO language, a software system for interacting automata in the C++ programming language is generated with a special system. The generated program implements a behavior guaranteed to correspond to a given specification and original informal description. CIAO provides both graphical and textual notation. Graphic notation is based on an extended notation of state machine diagrams and component diagrams of the unified modeling language UML, which are well established in describing the behavior of event-driven systems. The text syntax of the CIAO language is described by context-free grammar in regular form. Automatically generated C++ code allows using of both library and any external functions written manually. At the same time, the evident correspondence of the formal specification and the generated code is preserved on conditions that the external functions conform to their specifications. As an example, an original solution to D. Knut's problem of a responsive elevator control system is proposed. The effectiveness of the proposed methodology is demonstrated, since the automaton-converter generating the C++ code is presented as a responsive system, is specified in the CIAO language and implemented by the bootstrapping. The proposed methodology is compared with other well-known formal methods for describing systems with complex behavior.

Sign in / Sign up

Export Citation Format

Share Document