Results 81 to 90 of about 578 (210)

On secret-sharing matroids

open access: yesJournal of Combinatorial Theory, Series B, 1992
A matroid \(M\) is secret-sharing if there is a finite set \(S\) and a matrix \(A=\{a_{ij}:i\in I, j\in E(M)\}\) with entries in \(S\) such that for all \(X\subseteq E(M)\), the submatrix \(\{a_{ij}:i\in I, j\in X\}\) has precisely \(| S|^{rk(x)}\) distinct rows. The author shows that the Vamos matroid is not secret-sharing.
openaire   +2 more sources

Transformation Teams Leading the Hispanic‐Serving Institutions Movement at HSI Community Colleges

open access: yesNew Directions for Community Colleges, EarlyView.
ABSTRACT The Department of Education defunded discretionary grant programs for enrollment‐based minority‐serving institutions (MSIs) on September 10, 2025, yet Hispanic‐serving institutions (HSIs) still exist and must continue to adapt to their growing population of Latine/x students.
Gina Ann Garcia   +2 more
wiley   +1 more source

Modified F‐tests for assessing tree radial growth under linear‐circular regression models with correlated errors: A comprehensive toolbox rooted in G. E. P. Box's theorems

open access: yesCanadian Journal of Statistics, EarlyView.
Abstract Annual tree growth is a complex biological process. Modelling radial growth in the trunk by linear‐circular regression with one mode and correlated errors has allowed the definition and assessment of a preferred direction for 1 and 2 years. Here, modified F$$ F $$‐tests are presented for 3 years, 1 mode/year; 1 year, 2 modes for possible main ...
Pierre Dutilleul   +2 more
wiley   +1 more source

A partial envelope approach for modelling multivariate spatial‐temporal data

open access: yesCanadian Journal of Statistics, EarlyView.
Abstract In the new era of big data, modelling multivariate spatial‐temporal data is a challenging task due to both the high dimensionality of the features and complex associations among the responses across different locations and time points.
Reisa Widjaja   +3 more
wiley   +1 more source

Fair Verifiable Secret Sharing Driven by Smart Contracts [PDF]

open access: yesJisuanji gongcheng
Unfair issues arise in secret sharing owing to the insufficient consideration given to participants′self-interested behaviors, such as honest participants being unable to reconstruct the shared secret while dishonest participants are able to.
ZHANG Qianhui, YUAN Lingyun, XIE Tianyu, WU Jiaying
doaj   +1 more source

Hypergraph decomposition and secret sharing

open access: yesDiscrete Applied Mathematics, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
G. Di Crescenzo, GALDI, CLEMENTE
openaire   +4 more sources

Captivated by Kinesin

open access: yesCytoskeleton, EarlyView.
ABSTRACT Few proteins have inspired as much curiosity as kinesin. Since its discovery 40 years ago, kinesin has become one of the best understood molecular machines in biology, yet it continues to reveal new questions about how cells organize and move their contents.
Ronald D. Vale
wiley   +1 more source

SDN enabled role based shared secret scheme for virtual machine security in cloud environment

open access: yesCyber Security and Applications
Cloud computing has given a new direction towards the usage of resources based on the demand without depending on the location. Even though there are many advantages with cloud computing there are challenges and security being one among them.
H M Anitha   +4 more
doaj   +1 more source

Breaking Down Online and Digital Reporting Practices: A Research Map From Websites to Social Media

open access: yesCorporate Social Responsibility and Environmental Management, EarlyView.
ABSTRACT This paper adopts a mixed research methodology, integrating bibliometric and systematic literature review (SLR) tools, to systematise the academic contributions and the different bodies of knowledge generated over the last decades on online and digital reporting practices, ranging from websites to social media.
Giuseppe Nicolò   +3 more
wiley   +1 more source

How to Share a Secret

open access: yes, 2007
We consider the following problem. Let S be some secret. A collection of n people Ej share this secret in such a way that each Ej knows some information xj, for a certain fixed integer k, 2≤k≤n, the knowledge of any k of th x’s enables to find S easily, the knowlegde of less than k of the x’s leaves S undetermined.
openaire   +1 more source

Home - About - Disclaimer - Privacy