Search results for "Computer and Information Science"

The design of an agent based model of human activities and communications in cardiac resuscitation

2015

International audience; Cardio-pulmonary arrest is a common emergency situation causing over 400,000 deaths per year, more than a 1000 per day, in the USA alone. The goal of this work is to develop an agent based computer simulator that will allow trainers to experiment with different communication protocols, such as those found in air traffic control. This paper describes the first step in designing the simulator development. The design is based on an analysis of communications during real life training simulations using the FIPA standard categories.

Additivity of affine designs

2020

We show that any affine block design $$\mathcal{D}=(\mathcal{P},\mathcal{B})$$ is a subset of a suitable commutative group $${\mathfrak {G}}_\mathcal{D},$$ with the property that a k-subset of $$\mathcal{P}$$ is a block of $$\mathcal{D}$$ if and only if its k elements sum up to zero. As a consequence, the group of automorphisms of any affine design $$\mathcal{D}$$ is the group of automorphisms of $${\mathfrak {G}}_\mathcal{D}$$ that leave $$\mathcal P$$ invariant. Whenever k is a prime p,  $${\mathfrak {G}}_\mathcal{D}$$ is an elementary abelian p-group.

Symmetric and asymmetric cryptographic key exchange protocols in the octonion algebra

2019

AbstractWe propose three cryptographic key exchange protocols in the octonion algebra. Using the totient function, defined for integral octonions, we generalize the RSA public-key cryptosystem to the octonion arithmetics. The two proposed symmetric cryptographic key exchange protocols are based on the automorphism and the derivation of the octonion algebra.

Finitary shadows of compact subgroups of $$S(\omega )$$

2020

AbstractLet LF be the lattice of all subgroups of the group $$SF(\omega )$$SF(ω) of all finitary permutations of the set of natural numbers. We consider subgroups of $$SF(\omega )$$SF(ω) of the form $$C\cap SF(\omega )$$C∩SF(ω), where C is a compact subgroup of the group of all permutations. In particular, we study their distribution among elements of LF. We measure this using natural relations of orthogonality and almost containedness. We also study complexity of the corresponding families of compact subgroups of $$S(\omega )$$S(ω).

Bornological structures on many-valued sets

2017

Polish G-spaces and continuous logic

2017

Abstract We extend the generalised model theory of H. Becker from [2] to the case of Polish G -spaces when G is an arbitrary Polish group. Our approach is inspired by logic actions of Polish groups which arise in continuous logic.

Unification in superintuitionistic predicate logics and its applications

2018

AbstractWe introduce unification in first-order logic. In propositional logic, unification was introduced by S. Ghilardi, see Ghilardi (1997, 1999, 2000). He successfully applied it in solving systematically the problem of admissibility of inference rules in intuitionistic and transitive modal propositional logics. Here we focus on superintuitionistic predicate logics and apply unification to some old and new problems: definability of disjunction and existential quantifier, disjunction and existential quantifier under implication, admissible rules, a basis for the passive rules, (almost) structural completeness, etc. For this aim we apply modified specific notions, introduced in proposition…

Solution of the Skyrme-Hartree–Fock–Bogolyubovequations in the Cartesian deformed harmonic-oscillator basis. (VIII) hfodd (v2.73y): A new version of …

2017

We describe the new version (v2.73y) of the code HFODD which solves the nuclear Skyrme Hartree-Fock or Skyrme Hartree-Fock-Bogolyubov problem by using the Cartesian deformed harmonic-oscillator basis. In the new version, we have implemented the following new features: (i) full proton-neutron mixing in the particle-hole channel for Skyrme functionals, (ii) the Gogny force in both particle-hole and particle-particle channels, (iii) linear multi-constraint method at finite temperature, (iv) fission toolkit including the constraint on the number of particles in the neck between two fragments, calculation of the interaction energy between fragments, and calculation of the nuclear and Coulomb ene…

Binary Hamming codes and Boolean designs

2021

AbstractIn this paper we consider a finite-dimensional vector space $${\mathcal {P}}$$ P over the Galois field $${\text {GF}}(2),$$ GF ( 2 ) , and the family $${\mathcal {B}}_k$$ B k (respectively, $${\mathcal {B}}_k^*$$ B k ∗ ) of all the k-sets of elements of $$\mathcal {P}$$ P (respectively, of $${\mathcal {P}}^*= {\mathcal {P}} \setminus \{0\}$$ P ∗ = P \ { 0 } ) summing up to zero. We compute the parameters of the 3-design $$({\mathcal {P}},{\mathcal {B}}_k)$$ ( P , B k ) for any (necessarily even) k, and of the 2-design $$({\mathcal {P}}^{*},{\mathcal {B}}_k^{*})$$ ( P ∗ , B k ∗ ) for any k. Also, we find a new proof for the weight distribution of the binary Hamming code. Moreover, we…

Linear and cyclic radio k-labelings of trees

2007

International audience; Motivated by problems in radio channel assignments, we consider radio k-labelings of graphs. For a connected graph G and an integer k ≥ 1, a linear radio k-labeling of G is an assignment f of nonnegative integers to the vertices of G such that |f(x)−f(y)| ≥ k+1−dG(x,y), for any two distinct vertices x and y, where dG(x,y) is the distance between x and y in G. A cyclic k-labeling of G is defined analogously by using the cyclic metric on the labels. In both cases, we are interested in minimizing the span of the labeling. The linear (cyclic, respectively) radio k-labeling number of G is the minimum span of a linear (cyclic, respectively) radio k-labeling of G. In this p…