Results 11 to 20 of about 159,834 (164)

FPGA Design and Implementation of Data Covering Based on MD5 Algorithm [PDF]

open access: yesEngineering and Technology Journal, 2016
The protection of information leads to protection of individual privacy for everyone. This protection is performed using encryption. Many types of encryption may be utilized while the simplest one is the covering of information.
Thamir R. Saeed
doaj   +1 more source

Covering codes in Sierpinski graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2010
Graphs and Algorithms For a graph G and integers a and b, an (a, b)-code of G is a set C of vertices such that any vertex from C has exactly a neighbors in C and any vertex not in C has exactly b neighbors in C. In this paper we classify integers a and b for which there exist (a, b)-codes in Sierpinski graphs.
Laurent Beaudou   +4 more
openaire   +4 more sources

New evaluation of general purpose neutron data for stable W-isotopes up to 200 MeV [PDF]

open access: yesEPJ Web of Conferences, 2020
In the frame of the Power Plant Physics and Technology of EUROfusion, new evaluations of general purpose neutron cross-section data were performed for the 180,182,183,184,186W isotopes covering the neutron energy up to 200 MeV.
Konobeyev A.Yu.   +3 more
doaj   +1 more source

On Octonary Codes and their Covering Radii [PDF]

open access: yesAustralas. J Comb., 2014
16 pages, some errors ...
Manoj K. Raut, Manish K. Gupta 0004
openaire   +2 more sources

Object-Oriented Test Case Generation Using Teaching Learning-Based Optimization (TLBO) Algorithm

open access: yesIEEE Access, 2022
Researchers are currently seeking effective methods for automated software testing to reduce time, avoid test case redundancy, and create comprehensive test cases to cover (paths, benches, conditions, and statements).
Ohood Al-Masri   +1 more
doaj   +1 more source

Covering Codes for Hats-on-a-line [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2006
We consider a popular game puzzle, called Hats-on-a-line, wherein a warden has $n$ prisoners, each one wearing a randomly assigned black or white hat, stand in a line. Thus each prisoner can see the colors of all hats before him, but not his or of those behind him. Everyone can hear the answer called out by each prisoner.
Sarang Aravamuthan, Sachin Lodha
openaire   +2 more sources

Covering Codes for Insertions and Deletions [PDF]

open access: yes2020 IEEE International Symposium on Information Theory (ISIT), 2020
A covering code is a set of codewords with the property that the union of balls, suitably defined, around these codewords covers an entire space. Generally, the goal is to find the covering code with the minimum size codebook. While most prior work on covering codes has focused on the Hamming metric, we consider the problem of designing covering codes ...
Lenz, Andreas   +3 more
openaire   +4 more sources

Cover-free codes and separating system codes [PDF]

open access: yes2015 IEEE International Symposium on Information Theory (ISIT), 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Arkadii G. D'yachkov   +3 more
openaire   +2 more sources

Study on Building Business-oriented Resource On-demand Resolution Model [PDF]

open access: yesJisuanji kexue
To address the issue of re-analyzing and repeating development of natural language processing tools and resource ana-lysis plugins when new requirements arise during project development,this paper proposes a business-oriented on-demand resource analysis ...
LIU Yao, QIN Xun, LIU Tianji
doaj   +1 more source

Home - About - Disclaimer - Privacy