A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Uncoverings-by-bases for base-transitive permutation groups
2006
Designs, Codes and Cryptography
Preserved Fulltext
We give constructions for uncoverings-by-bases for many families of basetransitive group (i.e. groups which act transitively on their irredundant bases), including a general construction which works for ...
any base-transitive group with base size 2, and some more specific constructions for other groups. ...
This research was funded by an EPSRC CASE studentship, sponsored by the UK Government Communications Headquarters (GCHQ). ...
doi:10.1007/s10623-006-9005-x
fatcat:x532zcqdhfhafd34pgr5sjv7gy
On the single-orbit conjecture for uncoverings-by-bases
2008
Journal of group theroy
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
An uncovering-by-bases (or UBB) for G is a set U of bases for G such that any r-subset of Ω is disjoint from at least one base in U, where r = d−1 2 , for d the minimum degree of G. ...
The single-orbit conjecture asserts that for any finite permutation group G, there exists a UBB for G contained in a single orbit of G on its irredundant bases. ...
A straightforward contradiction argument shows that an uncovering-by-bases will always exist for any finite permutation group. ...
doi:10.1515/jgt.2008.053
fatcat:ymidgxezi5g3hpbi352cuhghs4
Error-correcting codes from permutation groups
2009
Discrete Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We then formulate a conjecture about uncoverings-by-bases, for which we give some supporting evidence and prove for some special cases. ...
We replace the usual setting for error-correcting codes (i.e. vector spaces over finite fields) with that of permutation groups. ...
In the author's paper [2] , uncoverings-by-bases are constructed for certain families of base-transitive groups. ...
doi:10.1016/j.disc.2008.12.027
fatcat:qrgbvzh52rbyvgwyfee7rcrreq
Permutation codes
2010
European journal of combinatorics (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Note added in proof An affirmative answer to the first problem in Section 2.3 has been announced recently by David Ellis, Ehud Friedgut, and Haran Pilpel. ...
For t > 1, all sharply t-transitive groups were determined (by Jordan for t ≥ 4 and by Zassenhaus for t = 2 and for t = 3). ...
If G is a permutation group which permutes its irredundant bases transitively (a base-transitive group), then G is an IBIS group; the restrictions of the elements of G to the flats of the corresponding ...
doi:10.1016/j.ejc.2009.03.044
fatcat:v7xzgsdcbvdhzgzpq3qxxmvddq
Best permutation
2009
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing Connecting the World Wirelessly - IWCMC '09
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose a best permutation scheme (Basic Besper) for mobility-based network selection in a generic HWN environment and two methods (i.e. ...
According to our performance evaluations, Bespers could always select the best network and permutation based on mobilityrelated factors and many advantages compared with classic best network schemes are ...
− Qj) ˜Qi(1 − Pi)Ui,a • hhoi ff . (1) For VHO, when the MT moves from a state uncovered by the first i groups (i.e. g1, g2, ..., gi) to a state covered by group i, it should handover to group i. ...
doi:10.1145/1582379.1582574
dblp:conf/iwcmc/WangB09
fatcat:tyfm2l4bvjf5bnjxsnlp565l3q
Mobility-Based Network Selection Scheme in Heterogeneous Wireless Networks
2009
VTC Spring 2009 - IEEE 69th Vehicular Technology Conference
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Recently, network selection for heterogeneous wireless networks has been widely studied by categorizing and employing various factors to decide the best network. ...
By analysis and simulations, we demonstrate that mobility-related factors should be considered in network selection schemes, and our scheme achieves the goal of selecting the most appropriate network for ...
transiting rate from 'd' (i.e. 1 U d is the mean residence time in the uncovered area). ...
doi:10.1109/vetecs.2009.5073683
dblp:conf/vtc/WangB09
fatcat:zgb7sdsesfbvler3a5v4shby2a
Covering with Reducts - A Fast Algorithm for Rule Generation
[chapter]
1998
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
A new, efficient algorithm for finding local reducts for each object in data table is described, as well as its parallelization and some optimization notes. ...
A covering approach to the problem of generating rules based on information system is presented in this article. ...
We will prove, that in one cycle at least one uncovered object is covered by newly produced reduct. ...
doi:10.1007/3-540-69115-4_55
fatcat:mqbtu2v445fbdlntb4qkvhldhe
On Block Design and the Special Class of (123)-avoiding Aunu Permutation Pattern: A Slanted Flag Model
2014
IOSR Journal of Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
This paper therefore uncovers yet another rich property of this class of permutation pattern: applications in design theory which interested researchers can further explore. ...
This paper concerns an important application of the (123)-avoiding class of Aunu Permutation studied by earlier by Usman, Magami and Garba under various topics such as enumeration, thin cyclic desighn ...
Thus, for 1 i = , the transition diagram based on some calculable engine can be represented as: The remaining three transition diagrams can be constructed similarly using 2; 3; (3) . ...
doi:10.9790/5728-10325457
fatcat:i5tddp7xs5gybobzo7ljikefnm
A McEliece cryptosystem using permutation codes
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
However, the general framework in these cryptosystems can use any permutation error-correcting code and is interesting. ...
We study a public-key cryptosystem built using two permutation error-correcting codes. We show that these cryptosystems are insecure. ...
Both authors thank Upendra Kapshikar for stimulating discussions on the topic. ...
arXiv:2111.02119v1
fatcat:r5fqjqnkmbas7oksln53kuekau
Inducing a blockmodel structure of two-mode binary data using seriation procedures
2006
Journal of Mathematical Psychology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The key advantages of the proposed method are: (a) it can be used in conjunction with existing two-mode blockmodeling algorithms by facilitating selection of the number of classes for the rows and columns ...
of the matrix and the appropriate types of ideal blocks; (b) the model uses a well-grounded index based on Robinson structure, (c) guaranteed optimal solutions can be obtained for problems of practical ...
q uj ¼ 1 if o(u) ¼ j and 0 otherwise for (1pupm and 1pjpm); U: a reordering of matrix A with the rows permuted based on c and columns permuted based on o, accordingly U ¼ PAQ T ;
Doreian et al. (2004 ...
doi:10.1016/j.jmp.2006.05.005
fatcat:2vvxzuix7jgsxcvp5ouqtrx3pm
What's in a pattern? Examining the Type of Signal Multivariate Analysis Uncovers At the Group Level
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Using an experimental dataset, we show that directional and non-directional group-level MVPA approaches uncover distinct brain regions with only partial overlap. ...
This is in contrast to a directional "activation based" approach typical in univariate group level analysis, in which both signal magnitude and sign are taken into account. ...
Acknowledgments: The study was supported by the I-CORE Program of the Planning and Budgeting Committee ...
arXiv:1605.03482v2
fatcat:uc3te6gqw5b5thx2t74mpv6eby
What's in a pattern? Examining the type of signal multivariate analysis uncovers at the group level
2017
NeuroImage
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Using an experimental dataset, we show that directional and non-directional group-level MVPA approaches uncover distinct brain regions with only partial overlap. ...
This is in contrast to a directional "activation based" approach typical in univariate group level analysis, in which both signal magnitude and sign are taken into account. ...
Acknowledgments The study was supported by the I-CORE Program of the Planning and Budgeting Committee and The Israel Science Foundation (grant No. 51/11), Human Frontiers Science Project Organization ( ...
doi:10.1016/j.neuroimage.2016.11.019
pmid:27851996
fatcat:rgmedgtqyneu7j5ngjmuzmmhwq
Analysis of cell proliferation and tissue remodelling uncovers a KLF4 activity score associated with poor prognosis in colorectal cancer
2018
British Journal of Cancer
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We also uncover a KLF4 transcription factor activity score associated with the tissue remodelling gene signature. ...
The patients were stratified based on gene signatures of cell proliferation and tissue remodelling. ...
To this end we generated 100 permutations of each of the 2423 gene expression samples in the CRCSC cohort and inferred the TF activity scores for these permuted samples, resulting in x jk (k = 1, …,n = ...
doi:10.1038/s41416-018-0253-0
fatcat:gouvvaob45hmxm6bnqweym5l3y
Measuring Sequences of Representations with Temporally Delayed Linear Modelling
[article]
2020
bioRxiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Here, we introduce an analysis toolkit (TDLM) for analysing this activity. ...
We outline how TDLM can successfully reveal human replay during rest, based upon non-invasive magnetoencephalography (MEG) measurements, with strong parallels to rodent hippocampal replay. ...
Y.L. is also grateful for the unique opportunity provided by the ...
doi:10.1101/2020.04.30.066407
fatcat:b2dvptvx6rdxlozqxzogbu46ui
Secure Remote Voting Using Paper Ballots
[article]
2008
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Creation of paper ballots, as well as decryption of votes, is performed by a group of cooperating trusted servers. ...
The protocol tries to minimize the trust put in voter's PC by making the voter responsible for manual encryption of his vote. ...
(After creation of ballots) 1/4 of transitions of each server is revealed preserving paths in uncovered pairs. 2. ...
arXiv:0804.2349v1
fatcat:2gqr4uqbwrephdyu4oqrrmbg4i
« Previous
Showing results 1 — 15 out of 13,449 results