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.
Filters
Multi-level block permutation
2015
NeuroImage
Preserved Fulltext
Here we extend that notion to allow blocks to be nested, in a hierarchical, multi-level definition. ...
In a previous study, we defined exchangeability for blocks of data, as opposed to each datum individually, then allowing permutations to happen within block, or the blocks as a whole to be permuted. ...
Top: Multi-level block definition. Bottom: Visualisation as a tree diagram. ...
doi:10.1016/j.neuroimage.2015.05.092
pmid:26074200
pmcid:PMC4644991
fatcat:6um2kfroy5cknlydvofk4k5v7e
A joint scheme for secure and reliable communication in wireless sensor networks
2013
2013 ACS International Conference on Computer Systems and Applications (AICCSA)
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.
When combined with multi-path routing, the system provides a fault-intrusion tolerant mechanism. ...
The goal is to provide security and reliability for data transmission in multi-path routing by using a single process. ...
This research proposes a scheme for secure and reliable communication in WSNs with multi-path routing using CSEEC. We propose a modified version of CSEEC to support erasure correction. ...
doi:10.1109/aiccsa.2013.6616443
dblp:conf/aiccsa/AlawadhiN13
fatcat:s3x2acvwsrdd7flvewcqohybgy
SpineNet: Learning Scale-Permuted Backbone for Recognition and Localization
[article]
2020
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 similar building blocks, SpineNet models outperform ResNet-FPN models by ~3% AP at various scales while using 10-20% fewer FLOPs. ...
In this paper, we argue encoder-decoder architecture is ineffective in generating strong multi-scale features because of the scale-decreased backbone. ...
Each block B k has an associated feature level L i . Feature maps in an L i block have a resolution of 1 2 i of the input resolution. The blocks in the same level have an identical architecture. ...
arXiv:1912.05027v3
fatcat:fzhbksk73bc7vdegaarnzposqi
Efficient Blockwise Permutation Tests Preserving Exchangeability
2014
International Journal of Statistics in Medical Research
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.
This involves the calculation of the first four moments of the permutation distribution within each block and then over the entire set of data. ...
In order to preserve the exchangeability condition required in permutation tests, we divide the entire set of data into certain exchangeability blocks. ...
Thus, we can only detect regions having small or negligible multi-site effect (i.e. the regions in Figure 1e or 1g with gray level intensity similar to background, denoting the difference between the ...
doi:10.6000/1929-6029.2014.03.02.8
pmid:25289113
pmcid:PMC4185212
fatcat:v5ks3jzezbahjixcdjqsyps254
Partially Permuted Multi-Trellis Belief Propagation for Polar Codes
[article]
2020
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
Experimental results show that for a polar code with block length 1024 and rate 0.5 the error performance gain of the proposed decoder at the frame error rate of 10^(-6) is 0.25 dB compared to multi-trellis ...
In this work, we propose a new variant of the multi-trellis BP decoder which permutes only a subgraph of the original factor graph. ...
Multi-Trellis BP decod- ing
Input:
L 1,j
% LLR channel output
A
% information set
P level
% max. level the rightmost level of the
subgraph can be
P range
% max. no. of stages to be permuted ...
arXiv:1911.08868v2
fatcat:qcpffvcckreyzmb5ui2fmbqkyq
Defending against adversarial attacks by randomized diversification
[article]
2019
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.
We introduce a multi-channel architecture in a gray-box scenario, which assumes that the architecture of the classifier and the training data set are known to the attacker. ...
An additional benefit of multi-channel randomization is the aggregation that fuses soft-outputs from all channels, thus increasing the reliability of the final score. ...
As it can be seen from Figure 2 , the chain of the first 3 blocks can be organized in a parallel multi-channel structure that is followed by one or several aggregation blocks. ...
arXiv:1904.00689v1
fatcat:e6bxnxxf4je5regybarwelae6u
A new block cipher for image encryption based on multi chaotic systems
2020
TELKOMNIKA (Telecommunication Computing Electronics and Control)
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.
The S-box is dynamic, where it is shuffled for each image block using permutation operation. ...
First, a permutation scheme is applied to the image, and then shuffled image is partitioned into blocks of pixels. ...
CONCLUSION In this paper, a new block image encryption algorithm has been introduced to provide high level of security for color image encryption on the basis of the combination of permutation method, ...
doi:10.12928/telkomnika.v18i6.13746
fatcat:ehd3uekvhzfijinojsqjvcqpxa
Advanced Feature Learning on Point Clouds using Multi-resolution Features and Learnable Pooling
[article]
2022
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 2022; you can also visit the original URL.
The file type is application/pdf.
To cope with this problem, we propose a novel point cloud feature learning network, PointStack, using multi-resolution feature learning and learnable pooling (LP). ...
On the other hand, the LP is used as a generalized pooling function that calculates the weighted sum of multi-resolution point features through the attention mechanism with learnable queries, in order ...
Since there are four residual blocks, we use four separate learnable queries for the four level of resolutions in the single-resolution pooling. ...
arXiv:2205.09962v1
fatcat:aku5lranofd3papzjhj4fkioxe
Trade-offs between instantaneous and total capacity in multi-cell flash memories
2012
2012 IEEE International Symposium on Information Theory Proceedings
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 study the capacity of the new WAM codes with relative levels, where the information is represented by multiset permutations induced by the charge levels, and show that it achieves the capacity of any ...
Since capacity can be achieved only with cells that have a large number of levels, we propose a new architecture that consists of multi-cells -each an aggregation of a number of floating gate transistors ...
(The cell is called a singlelevel cell (SLC) if q = 2, and called a multi-level cell (MLC) if q > 2). We call the q states of a cell its levels: level 0, level 1, . . ., level q − 1. ...
doi:10.1109/isit.2012.6284712
dblp:conf/isit/GadJB12
fatcat:xhqwftkjk5eolaarre2hgjj7ei
Dynamic Memory Interconnections for Rapid Access
1984
IEEE transactions on computers
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.
These exhibit trade-offs between the time to access a datum randomly and the time to access serially a block of logically contiguous data. ...
Modules at the lower levels of the multi-level deck may be numbered so that elements belonging to higher level decks are adjacent to each other. ...
59 vi Figure 5.3 The Complete Multi-level Deck Organization Figure 5.4 An Example of a Multi-level Deck Memory ....Figure A.l Access Algorithm for the Aho-Ullman Memory Figure B.l Access Algorithm for ...
doi:10.1109/tc.1984.1676354
fatcat:7hulo5uz5bg45obbhroyfdjetq
Efficient Scale-Permuted Backbone with Learned Resource Distribution
[article]
2020
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.
While this strategy seems to be prevalent for scale-decreased models, it may not be an optimal design for scale-permuted models. ...
However, it is unclear if the improvement adds up when combining scale-permuted backbone with advanced efficient operations and compound scaling. ...
L 2 blocks and high-level {L 6 , L 7 } block, are reallocated to middle-level {L 3 , L 4 , L 5 } blocks. ...
arXiv:2010.11426v1
fatcat:f76rxwssg5bpbl2kfkhfq7tmgq
Enhancement of DES Algorithm with Multi State Logic
2014
International Journal of Research 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 2015; you can also visit the original URL.
The file type is application/pdf.
This replacement adds a new level of protection strength and more robustness against breaking methods. ...
This replacement adds a new level of protection strength and more robustness against breaking methods. ...
The plaintext block is subject to an Initial Permutation to shift the bits around. 2. The 8 parity bits are removed from the key by subjecting the key to its Key Permutation. 3. ...
doi:10.7815/ijorcs.43.2014.085
fatcat:b5ism7tdtbcwfndbay242rnyv4
Multi-center clinical trials: Randomization and ancillary statistics
2008
Annals of Applied Statistics
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2008 pre-print arXiv:0807.4002v1 fatcat:jlczaapm75c6xbkqnl4jqppf2y
Our motivation is prompted by the fact that most current statistical procedures used in the analysis of randomized multi-center studies are model based. ...
The purpose of this paper is to investigate and develop methods for analysis of multi-center randomized clinical trials which only rely on the randomization process as a basis of inference. ...
Multi-center trials. In our development of multi-center trials, it will be assumed that permuted blocks allocate patients to treatments over time. ...
doi:10.1214/07-aoas151
pmid:31431818
pmcid:PMC6701849
fatcat:bvbjxliqlzbkfahb4qzqmv62ze
Fast multiplication of large permutations for disk, flash memory and RAM
2010
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation - ISSAC '10
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 2010; you can also visit the original URL.
The file type is application/pdf.
Yet for large permutations, the standard algorithm is not the fastest for disk or for flash, and surprisingly, it is not even the fastest algorithm for RAM on recent multi-core CPUs. ...
with permutation groups. ...
At the same time write value j at the same index in block k of D ′ as X[j] was written at in block k of D. ...
doi:10.1145/1837934.1838001
dblp:conf/issac/SlaviciDKC10
fatcat:rks55e4zt5hohl6vuq3ymogruq
More is Less: Perfectly Secure Oblivious Algorithms in the Multi-Server Setting
[article]
2018
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.
Yet it is still unclear whether the multi-server setting has any inherent advantages, e.g., whether the multi-server setting can be used to achieve stronger security goals or provably better efficiency ...
The problem of Oblivious RAM (ORAM) has traditionally been studied in a single-server setting, but more recently the multi-server setting has also been considered. ...
the block with key will go into level ℓ ′′ -in the latter case, level ℓ will be destroyed prior to the rebuilding of level ℓ ′′ . ...
arXiv:1809.00825v1
fatcat:srh3i7cyfnhftbghbvhwhad43q
« Previous
Showing results 1 — 15 out of 60,463 results