Results 1 to 10 of about 531,358 (115)
Probabilistic Community Detection in Social Networks
The detection of community structures is a very crucial research area. The problem of community detection has received considerable attention from a large portion of the scientific community.
Stavros Souravlas +3 more
doaj +1 more source
Computational Analysis of Interleaving PN-Sequences with Different Polynomials
Binary PN-sequences generated by LFSRs exhibit good statistical properties; however, due to their intrinsic linearity, they are not suitable for cryptographic applications. In order to break such a linearity, several approaches can be implemented.
Sara D. Cardell +2 more
doaj +1 more source
Linear Complexity of Hidden Weighted Bit Functions [PDF]
Boolean functions are crucial primitive in block cipher and are also used to design pseudorandom sequences. They play a crucial role in the design of symmetric cryptography and its analysis, and the study on the cryptographic properties of Boolean ...
CHEN Zhiru, FENG Ligang, ZHU Youwen
doaj +1 more source
An Efficient Algorithm to Compute the Linear Complexity of Binary Sequences
Binary sequences are algebraic structures currently used as security elements in Internet of Things devices, sensor networks, e-commerce, and cryptography. In this work, a contribution to the evaluation of such sequences is introduced.
Amparo Fúster-Sabater +2 more
doaj +1 more source
Associative synaptic plasticity is synapse specific and requires coincident activity in presynaptic and postsynaptic neurons to activate NMDA receptors (NMDARs). The resultant Ca2+ influx is the critical trigger for the induction of synaptic plasticity.
Owen Rackham +3 more
doaj +1 more source
Synchronizing Many Filesystems in Near Linear Time
Finding a provably correct subquadratic synchronization algorithm for many filesystem replicas is one of the main theoretical problems in operational transformation (OT) and conflict-free replicated data types (CRDT) frameworks.
Elod P. Csirmaz, Laszlo Csirmaz
doaj +1 more source
Pseudorandom sequences with large linear complexity have been widely applied in electronic countermeasures, mobile communication and cryptography.
Jiang Ma +3 more
doaj +1 more source
Interleaving Shifted Versions of a PN-Sequence
The output sequence of the shrinking generator can be considered as an interleaving of determined shifted versions of a single PN -sequence. In this paper, we present a study of the interleaving of a PN-sequence and shifted versions of itself. We analyze
Sara Díaz Cardell +2 more
doaj +1 more source
Modified Classical Graph Algorithms for the DNA Fragment Assembly Problem
DNA fragment assembly represents an important challenge to the development of efficient and practical algorithms due to the large number of elements to be assembled.
Guillermo M. Mallén-Fullerton +3 more
doaj +1 more source
Linear complexity is an important criterion to characterize the unpredictability of pseudo-random sequences, and large linear complexity corresponds to high cryptographic strength.
Jiang Ma +3 more
doaj +1 more source

