Note sur la sémantique des structures de contrôle
Note sur la suppression des étiquettes en programmation
Note sur l'algèbre des fonctions
Note: The Smallest Nonevasive Graph Property
A property of n-vertex graphs is called evasive if every algorithm testing this property by asking questions of the form “is there an edge between vertices u and v” requires, in the worst case, to ask about all pairs of vertices. Most “natural” graph properties are either evasive or conjectured to be such, and of the few examples of nontrivial nonevasive properties scattered in the literature the smallest one has n = 6. We exhibit a nontrivial, nonevasive property of 5-vertex graphs and show that...
Notes on a linguistic description as the basis for automatic image understanding
The main paradigm of image understanding and a concept for its practical machine realisation are presented. The crucial elements of the presented approach are the formalisation of human knowledge about the class of images that are to be automatically interpreted, a linguistic description and the realization of cognitive resonance.
Notes on finite asynchronous automata
Notes on the evolution of feature selection methodology
The paper gives an overview of feature selection techniques in statistical pattern recognition with particular emphasis on methods developed within the Institute of Information Theory and Automation research team throughout recent years. Besides discussing the advances in methodology since times of Perez’s pioneering work the paper attempts to put the methods into a taxonomical framework. The methods discussed include the latest variants of the optimal algorithms, enhanced sub-optimal techniques...
Nouvelle présentation d'algorithmes conduisant à des représentations de faible cout d'une fonction booléenne incomplète
Nový pohled na algoritmickou matematiku
Nowhere continuous solutions to elliptic systems
NP-completeness of minimal width unordered tree layout.
NP-completeness of the planar separator problems.
NP-completeness results for minimum planar spanners.
NP-hardness results for intersection graphs
NP-harte Probleme für minimale Polygonüberdeckungen
NTGsim: a graphical user interface and a 3D simulator for nonlinear trajectory generation methodology
Nonlinear Trajectory Generation (NTG), developed by Mark Milam, is a software algorithm used to generate trajectories of constrained nonlinear systems in real-time. The goal of this paper is to present an approach to make NTG more userfriendly. To accomplish this, we have programmed a Graphical User Interface (GUI) in Java, using object oriented design, which wraps the NTG software and allows the user to quickly and efficiently alter the parameters of NTG. This new program, called NTGsim, eliminates...
Nuclei segmentation for computer-aided diagnosis of breast cancer
Number-conserving reversible cellular automata and their computation-universality
We introduce a new model of cellular automaton called a one-dimensional number-conserving partitioned cellular automaton (NC-PCA). An NC-PCA is a system such that a state of a cell is represented by a triple of non-negative integers, and the total (i.e., sum) of integers over the configuration is conserved throughout its evolving (computing) process. It can be thought as a kind of modelization of the physical conservation law of mass (particles) or energy. We also define a reversible version of...
Number-Conserving Reversible Cellular Automata and Their Computation-Universality
We introduce a new model of cellular automaton called a one-dimensional number-conserving partitioned cellular automaton (NC-PCA). An NC-PCA is a system such that a state of a cell is represented by a triple of non-negative integers, and the total (i.e., sum) of integers over the configuration is conserved throughout its evolving (computing) process. It can be thought as a kind of modelization of the physical conservation law of mass (particles) or energy. We also define a reversible version...
Numbering action vertices in workflow graphs
Workflow graphs, consisting of actions, events, and logical switches, are used to model business processes. In order to easily identify the actions within a workflow graph, it is useful to number them in such a way that the numbering reflects the structure of the workflow. However, available tools offer only rudimental numbering schemes. In the paper, a set of natural requirements is defined that a logical numbering should fulfill. It is investigated under what conditions there is an appropriate...