Search results for "Discrete"

Algorithms and Logic as Programming Primers

2019

To adapt all-immersive digitalization, the Finnish National Curriculum 2014 (FNC-2014) ‘digi-jumps’ by integrating programming into elementary education. However, applying the change to mathematics teachers’ everyday praxis is hindered by a too high-level specification. To elaborate FNC-2014 into more concrete learning targets, we review the computer science syllabi of countries that are well ahead, as well as the education recommendations set by computer science organizations, such as ACM and IEEE. The whole mathematics syllabus should be critically viewed in the light of these recommendations and feedback collected from software professionals and educators. The feedback reveals an imbalan…

Convergence of dynamic programming principles for the $p$-Laplacian

2018

We provide a unified strategy to show that solutions of dynamic programming principles associated to the $p$-Laplacian converge to the solution of the corresponding Dirichlet problem. Our approach includes all previously known cases for continuous and discrete dynamic programming principles, provides new results, and gives a convergence proof free of probability arguments.

Varieties Generated by Certain Models of Reversible Finite Automata

2006

Reversible finite automata with halting states (RFA) were first considered by Ambainis and Freivalds to facilitate the research of Kondacs-Watrous quantum finite automata. In this paper we consider some of the algebraic properties of RFA, namely the varieties these automata generate. Consequently, we obtain a characterization of the boolean closure of the classes of languages recognized by these models.

Toward learning autonomous pallets by using fuzzy rules, applied in a Conwip system

2012

Published version of an article in the journal: The International Journal of Advanced Manufacturing Technology. Also available from the publisher at: http://dx.doi.org/10.1007/s00170-012-4057-8 Nowadays, material planning and control strategies are becoming continuously complex tasks spanning from individual plants to logistic networks. In fact, this is the consequence of increasing intricacy in product variants and their respective convolution in networks’ structures. Customers ask for specific products with individual characteristics that force companies for more clever performances by more flexibility. For doing so, the existing planning and control systems, which work based on central m…

The radio antipodal and radio numbers of the hypercube

2011

International audience; A radio k-labeling of a connected graph G is an assignment f of non negative integers to the vertices of G such that |f(x) − f(y)| \ge k + 1 − d(x, y), for any two vertices x and y, where d(x, y) is the distance between x and y in G. The radio antipodal number is the minimum span of a radio (diam(G) − 1)-labeling of G and the radio number is the minimum span of a radio (diam(G))-labeling of G. In this paper, the radio antipodal number and the radio number of the hypercube are determined by using a generalization of binary Gray codes.

About Vertex Mappings

2019

Summary In [6] partial graph mappings were formalized in the Mizar system [3]. Such mappings map some vertices and edges of a graph to another while preserving adjacency. While this general approach is appropriate for the general form of (multidi)graphs as introduced in [7], a more specialized version for graphs without parallel edges seems convenient. As such, partial vertex mappings preserving adjacency between the mapped verticed are formalized here.

Using 2-colorings in the theory of uniquely Hamiltonian graphs

2019

We use the concept of 2-coloring in analyzing UH3 graphs and building exact specifications of functions to find new UH3 graphs by Hamiltonian cycle edge extractions

A general framework for group authentication and key exchange protocols

2014

Published version of a chapter in the book: Foundations and Practice of Security. Also available from the publisher at: http://dx.doi.org/10.1007/978-3-319-05302-8_3 In this paper, we propose a novel framework for group authentication and key exchange protocols. There are three main advantages of our framework. First, it is a general one, where different cryptographic primitives can be used for different applications. Second, it works in a one-to-multiple mode, where a party can authenticate several parties mutually. Last, it can provide several security features, such as protection against passive adversaries and impersonate attacks, implicit key authentication, forward and backward securi…

Labour migration and wages

2001

On modified α-ϕ-fuzzy contractive mappings and an application to integral equations

2016

Abstract We introduce the notion of a modified α-ϕ-fuzzy contractive mapping and prove some results in fuzzy metric spaces for such kind of mappings. The theorems presented provide a generalization of some interesting results in the literature. Two examples and an application to integral equations are given to illustrate the usability of our theory.