Results 21 to 30 of about 6,954,298 (295)

Portals to Knowledge: CD-ROM Encyclopaedias, with Specific Reference to Microsoft Encarta 99 Encyclopedia

open access: yesLexikos, 2012
The close interaction between linguistics and lexicography over the last few decades has had many good effects, not least of which has been the development of a theoretical framework or meta lexicography.
Phillip Adriaan Louw
doaj   +1 more source

Structural Accessibility and Structural Observability of Nonlinear Networked Systems [PDF]

open access: yesIEEE Transactions on Network Science and Engineering, 2020
The classical notions of structural controllability and structural observability are receiving increasing attention in Network Science, since they provide a mathematical basis to answer how the network structure of a dynamic system affects its controllability and observability properties.
Marco Tulio Angulo   +2 more
openaire   +3 more sources

A conditional role-involved purpose-based access control model [PDF]

open access: yes, 2011
This paper presents a role-involved conditional purpose-based access control (RCPBAC) model, where a purpose is defined as the intension of data accesses or usages. RCPBAC allows users using some data for certain purpose with conditions. The structure of
Bertino, Elisa   +2 more
core   +1 more source

Access Structures in a Standard Translation Dictionary Toegangstrukture in 'n standaard vertalende woordeboek

open access: yesLexikos, 2012
<p>The access structure is the primary guide structure in the central texts of any standard translation dictionary. The metalexicographical term "guide structures" refers to the set of structures that provides a framework within which the ...
Phillip Adriaan Louw
doaj   +1 more source

Design and Implementation of SIMD Unaligned Memory Access Structure [PDF]

open access: yesJisuanji gongcheng, 2016
Single Instruction Multiple Data(SIMD) is an effective approach to realize data level parallelism,but accessing unaligned data seriously affects vectorization of the program and causes processor performance degradation.In order to reduce the latency of ...
YU Chenglong,WANG Yongwen
doaj   +1 more source

EERTREE: An Efficient Data Structure for Processing Palindromes in Strings [PDF]

open access: yes, 2015
We propose a new linear-size data structure which provides a fast access to all palindromic substrings of a string or a set of strings. This structure inherits some ideas from the construction of both the suffix trie and suffix tree. Using this structure,
Rubinchik, Mikhail, Shur, Arseny M.
core   +1 more source

GlyTouCan: an accessible glycan structure repository [PDF]

open access: yesGlycobiology, 2017
Rapid and continued growth in the generation of glycomic data has revealed the need for enhanced development of basic infrastructure for presenting and interpreting these datasets in a manner that engages the broader biomedical research community. Early in their growth, the genomic and proteomic fields implemented mechanisms for assigning unique gene ...
Michael Tiemeyer   +18 more
openaire   +4 more sources

On the Structure of the Capacity Region of Asynchronous Memoryless Multiple-Access Channels [PDF]

open access: yes, 2008
The asynchronous capacity region of memoryless multiple-access channels is the union of certain polytopes. It is well-known that vertices of such polytopes may be approached via a technique called successive decoding.
Marina, Ninoslav, Rimoldi, Bixio
core   +4 more sources

A Verifiable Multi-Secret Sharing Scheme for Hierarchical Access Structure

open access: yesAxioms
Sharing confidential information is a critical concern in today’s world. Secret sharing schemes facilitate the sharing of secrets in a way that ensures only authorized participants (shareholders) can access the secret using their allocated shares ...
Irfan Alam   +3 more
doaj   +1 more source

The complexity of the connected graph access structure on seven participants

open access: yesJournal of Mathematical Cryptology, 2017
In this paper, we study an important problem in secret sharing that determines the exact value or bound for the complexity. First, we use the induced subgraph complexity of the graph G with access structure Γ to obtain a lower bound on the complexity of ...
Hadian Dehkordi Massoud, Safi Ali
doaj   +1 more source

Home - About - Disclaimer - Privacy