All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 3 Next

Displaying 41 – 60 of 120

Showing per page

Sobre el tamaño de muestra para experimentos aleatorios con imprecisión difusa.

M.ª Angeles Gil Alvarez, Pedro Gil Alvarez (1988)

Trabajos de Estadística

Statistical Inference deals with the drawing of conclusions about a random experiment on the basis of the information contained in a sample from it. A random experiment can be defined by means of the set of its possible outcomes (sample space) and the ability of observation of the experimenter. It is usually assumed that this ability allows the experimenter to describe the observable events as subsets of the sample space. In this paper, we will consider that the experimenter can only express the...

Some classes of divergence measures between fuzzy subsets and between fuzzy partitions.

Susana Montes, Pedro Gil (1998)

Mathware and Soft Computing

The aim of this paper is to present and study one important class of divergence measure between fuzzy subsets, and one important class of divergence measure between fuzzy partitions, each of them having some specific properties. In the first case, the divergence measure attempts to quantify the degree of difference between two fuzzy subsets ? and ? by comparing the fuzziness of both ? and ? with the fuzziness of the intermediate fuzzy subset. In the second case, we use this divergence between subsets...

Some decompositions of Bernoulli sets and codes

Aldo de Luca (2005)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

A decomposition of a set X of words over a d -letter alphabet A = { a 1 , ... , a d } is any sequence X 1 , ... , X d , Y 1 , ... , Y d of subsets of A * such that the sets X i , i = 1 , ... , d , are pairwise disjoint, their union is X , and for all i , 1 ≤ i ≤ d , X i ∼ a i Y i , where ∼ denotes the commutative equivalence relation. We introduce some suitable decompositions that we call good, admissible, and normal. A normal decomposition is admissible and an admissible decomposition is good. We prove that a set is commutatively prefix if and only if it has a normal decomposition. In particular,...

Some decompositions of Bernoulli sets and codes

Aldo de Luca (2010)

RAIRO - Theoretical Informatics and Applications

A decomposition of a set X of words over a d-letter alphabet A = {a1,...,ad} is any sequence X1,...,Xd,Y1,...,Yd of subsets of A* such that the sets Xi, i = 1,...,d, are pairwise disjoint, their union is X, and for all i, 1 ≤ i ≤ d, Xi ~ aiYi, where ~ denotes the commutative equivalence relation. We introduce some suitable decompositions that we call good, admissible, and normal. A normal decomposition is admissible and an admissible decomposition is good. We prove that a set is commutatively prefix...

Some maximum multigraphs and edge/vertex distance colourings

Zdzisław Skupień (1995)

Discussiones Mathematicae Graph Theory

Shannon-Vizing-type problems concerning the upper bound for a distance chromatic index of multigraphs G in terms of the maximum degree Δ(G) are studied. Conjectures generalizing those related to the strong chromatic index are presented. The chromatic d-index and chromatic d-number of paths, cycles, trees and some hypercubes are determined. Among hypercubes, however, the exact order of their growth is found.

Some MDS Codes over Gf(64) Connected with the Binary Doubly-Even [72,36,16] Code

Bouyuklieva, Stefka (2007)

Serdica Journal of Computing

* The author is supported by a Return Fellowship from the Alexander von Humboldt Foundation.MDS [8,4,5] codes over a field with 64 elements are constructed. All such codes which are self-dual under a Hermitian type inner product are classified. The connection between these codes and a putative binary self- dual [72,36,16] code is considered.

Some methods to obtain t-norms and t-conorms on bounded lattices

Gül Deniz Çaylı (2019)

Kybernetika

In this study, we introduce new methods for constructing t-norms and t-conorms on a bounded lattice L based on a priori given t-norm acting on [ a , 1 ] and t-conorm acting on [ 0 , a ] for an arbitrary element a ∈ L ∖ { 0 , 1 } . We provide an illustrative example to show that our construction methods differ from the known approaches and investigate the relationship between them. Furthermore, these methods are generalized by iteration to an ordinal sum construction for t-norms and t-conorms on a bounded lattice.

Some necessary and sufficient conditions for the output controllability of temporal Boolean control networks

Yang Liu, Jianquan Lu, Bo Wu (2014)

ESAIM: Control, Optimisation and Calculus of Variations

This paper investigates the output controllability problem of temporal Boolean networks with inputs (control nodes) and outputs (controlled nodes). A temporal Boolean network is a logical dynamic system describing cellular networks with time delays. Using semi-tensor product of matrices, the temporal Boolean networks can be converted into discrete time linear dynamic systems. Some necessary and sufficient conditions on the output controllability via two kinds of inputs are obtained by providing...

Some new Results for Additive Self-Dual Codes over GF(4)

Varbanov, Zlatko (2007)

Serdica Journal of Computing

* Supported by COMBSTRU Research Training Network HPRN-CT-2002-00278 and the Bulgarian National Science Foundation under Grant MM-1304/03.Additive code C over GF(4) of length n is an additive subgroup of GF(4)n. It is well known [4] that the problem of finding stabilizer quantum error-correcting codes is transformed into problem of finding additive self-orthogonal codes over the Galois field GF(4) under a trace inner product. Our purpose is to construct good additive self-dual codes of length 13...

Currently displaying 41 – 60 of 120