Results 21 to 30 of about 111,857 (228)
A Cancelable Iris- and Steganography-Based User Authentication System for the Internet of Things
Sensors, 2019 Remote user authentication for Internet of Things (IoT) devices is critical to IoT security, as it helps prevent unauthorized access to IoT networks.
Wencheng Yang +7 more
doaj +1 more source
On permutably complemented subalgebras of finite dimensional Lie algebras [PDF]
Algebraic structures and their applications, 2018 Summary: Let \(L\) be a finite-dimensional Lie algebra. We say a subalgebra \(H\) of \(L\) is permutably complemented in \(L\) if there is a subalgebra \(K\) of \(L\) such that \(L=H+K\) and \(H\cap K=0\). Also, if every subalgebra of \(L\) is permutably complemented in \(L\), then \(L\) is called completely factorisable.
openaire +2 more sources
Implementing a Class of Permutation Tests: The coin Package [PDF]
, 2007 The R package coin implements a unified approach to permutation tests providing a huge class of independence tests for nominal, ordered, numeric, and censored data as well as multivariate data at mixed scales.
van de Wiel, Mark A. +14 more
core +2 more sources
Neoplasia: An International Journal for Oncology Research, 2002 To identify a set of genes related to radiosensitivity of cervical squamous cell carcinomas and to establish a predictive method, we compared expression profiles of 9 radiosensitive and 10 radioresistant tumors obtained by biopsy before treatment, on a ...
Osamu Kitahara +4 more
doaj +1 more source
Computing in permutation groups without memory [PDF]
, 2013 Funding: UK Engineering and Physical Sciences Research Council (EP/K033956/1)Memoryless computation is a new technique to compute any function of a set of registers by updating one register at a time while using no memory.
Maximilien Gadouleau +10 more
core +2 more sources
Minimal and random generation of permutation and matrix groups [PDF]
, 2012 We prove explicit bounds on the numbers of elements needed to generate various types of finite permutation groups and finite completely reducible matrix groups, and present examples to show that they are sharp in all cases.
Derek F. Holt +5 more
core +1 more source
Complementing permutations in finite lattices
Journal of Combinatorial Theory, Series B, 1977 AbstractIn a finite lattice L for which the Möbius function is nonvanishing on all upper and lower intervals, we establish the existence of a permutation of L taking each lattice element to one of its complements.
openaire +3 more sources
Topics in computational group theory : primitive permutation groups and matrix group normalisers [PDF]
, 2012 Part I of this thesis presents methods for finding the primitive permutation groups of degree d, where 2500 ≤ d < 4096, using the O'Nan-Scott Theorem and Aschbacher's theorem. Tables of the groups G are given for each O'Nan-Scott class.
Coutts, Hannah Jane
core +2 more sources
On dots in boxes, or Permutation pattern classes and regular languages [PDF]
, 2015 This thesis investigates permutation pattern classes in a language theoretic context. Specifically we explored the regularity of sets of permutations under the rank encoding. We found that the subsets of plus- and minus-(in)decomposable permutations of
Hoffmann, Ruth
core +2 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Adolescents with high‐risk cancer face complex developmental, psychosocial, and ethical challenges that extend beyond disease‐directed treatment. Although international recommendations exist for communication, psychosocial care, pediatric palliative care, survivorship, and shared decision‐making, these have largely evolved within ...
Johanna M. C. Blom +15 more
wiley +1 more source