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.
Filters
Graph Decompositions and Secret Sharing Schemes
[chapter]
1993
Lecture Notes in Computer Science
Preserved Fulltext
A b s t r a c t In this paper, we continue a study of secret sliaring schemes for access structures based on graphs. ...
Also, we study the 30 (connected) graphs on a t most five vertices, obtaining exact values for the optimal information rate in 26 of the 30 cases, and for the optinid average information rate in 28 of ...
Wen-ai Jackson pointed out the minimal decomposition lI2 of graph G11 i:i Appendix A . ...
doi:10.1007/3-540-47555-9_1
fatcat:o7zhou2v75fqzi774py2mwzdsy
Graph decompositions and secret sharing schemes
1995
Journal of Cryptology
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.
A b s t r a c t In this paper, we continue a study of secret sliaring schemes for access structures based on graphs. ...
Also, we study the 30 (connected) graphs on a t most five vertices, obtaining exact values for the optimal information rate in 26 of the 30 cases, and for the optinid average information rate in 28 of ...
Wen-ai Jackson pointed out the minimal decomposition lI2 of graph G11 i:i Appendix A . ...
doi:10.1007/bf00204801
fatcat:jisyrn2nmzhvxkrhbsfrmkqemu
Secret Sharing Schemes on Sparse Homogeneous Access Structures with Rank Three
2004
Electronic Journal of Combinatorics
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.
Namely, in all these families, the ideal access structures coincide with the vector space ones and, besides, the optimal information rate of a non-ideal access structure is at most $2/3$. ...
One of the main open problems in secret sharing is the characterization of the ideal access structures. This problem has been studied for several families of access structures with similar results. ...
Of course, the optimal information rate of an ideal access structure is equal to one. ...
doi:10.37236/1825
fatcat:zatmgqvthbcoddxs3bkt43iaoq
Ideal secret sharing schemes on graph-based $3$-homogeneous access structures
2021
Transactions on Combinatorics
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.
We prove that for every non-ideal graph-based $3$-homogeneous access structure over the graph $G$ with the maximum degree $d$ there exists a secret sharing scheme with an information rate $\frac{1}{d+1 ...
A graph-based $3-$homogeneous access structure is an access structure in which the participants are the vertices of a connected graph and every subset of the vertices is a minimal qualified subset if it ...
In Figure 2 , we state the optimal information rate of the GB-3h access structures on the non-complete multipartite graphs with five vertices. ...
doi:10.22108/toc.2021.123661.1739
doaj:3d0d0b1c9770463e9ed508c1b1af60e6
fatcat:7yb45upc2zcvbglk6vwqsbv4bi
On secret sharing schemes, matroids and polymatroids
2010
Journal of Mathematical Cryptology
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 2006; you can also visit the original URL.
The file type is application/pdf.
In addition, we study the use of polymatroids for obtaining upper bounds on the optimal information rate of access structures. ...
Finally, we present lower bounds on the optimal information rate of the access structures that are related to two matroids that are not secret sharing representable: the Vamos matroid and the non-Desargues ...
Acknowledgments The second author thanks Ronald Cramer, Bert Gerards, Robbert de Haan and Lex Schrijver for useful discussions, comments, and suggestions. Thanks to Lex Schrijver who pointed out ...
doi:10.1515/jmc.2010.004
fatcat:vh72wvzkmndt5c5bj3kxigjbcu
Data Transmission Reliability Analysis of Wireless Sensor Networks for Social Network Optimization
2022
Journal of Sensors
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.
People publish and obtain information through various channels on the Internet, and online social networks have become one of the most important channels. ...
reliability assessment methods in industrial application environments, the impact of mobile path optimization of mobile wireless sensor networks on data collection efficiency and network reliability, ...
To speed up the filtering of geolocation information and text information, spatial text indexes need to be created for participants in social networks. ...
doi:10.1155/2022/3842722
fatcat:mey2mcqawjfgfhwthsfkafxxjy
An Empirical Study on Core Data Asset Identification in Data Governance
2023
Big Data and Cognitive Computing
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 2023; you can also visit the original URL.
The file type is application/pdf.
Then, we explored the structural features of core data assets on data lineage graphs from an abstraction perspective. ...
Data governance aims to optimize the value derived from data assets and effectively mitigate data-related risks. The rapid growth of data assets increases the risk of data breaches. ...
The nodes highlighted in red are the nodes that the participants had selected.
Table 1 . 1 Basic information of the 10 data lineage graphs. ...
doi:10.3390/bdcc7040161
fatcat:qe6gpk2ojjcgbc5oeyq3r7pjhu
Prioritizing Built Environmental Factors to Tackle Chronic and Infectious Diseases in Remote Northern Territory (NT) Communities of Australia: A Concept Mapping Study
2021
International Journal of Environmental Research and Public Health
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.
Sorting of the indicators resulted in a concept map with nine built environmental domains. ...
Essential services and Facilities for health/safety were the highest ranked domains for both chronic and infectious diseases. ...
Sorting Based on stakeholder participant inputs, a nine-cluster concept map with a stress value of 0.313 was deemed the optimal solution in terms of sorting data and point distances between the 84 indicator ...
doi:10.3390/ijerph18105178
pmid:34068201
pmcid:PMC8152969
fatcat:i5i7cmvi2jhk7o2rz4c3q5jyum
Optimal complexity of secret sharing schemes with four minimal qualified subsets
2010
Designs, Codes and Cryptography
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.
This paper deals with the open problem of optimizing this parameter for secret sharing schemes with general access structures. ...
In this way, the exact value of the optimal complexity is determined for several access structures in that family. For the other ones, we present the best known lower and upper bounds. ...
Acknowlegments We are deeply grateful to one of the anonymous referees who thoroughly and carefully revised our paper, finding even a mistake in our tables, and helped in great measure to improve the presentation ...
doi:10.1007/s10623-010-9446-0
fatcat:hoqbhtepp5ah5olqtprvqilmyi
Management Of Delphi Study Regarding The Development Of Ongoing Behavioral Risk Factor Surveillance System In The Republic Of Moldova
2017
Zenodo
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.
Results: The research found that Delphi panelists similarly trained and competent in the area of knowledge related to the target issue contributed toachievement of the consensus agreement for all items ...
National Strategy on Noncommunicable DiseasesPrevention and Control for the period 2012-2020. ...
Acknowledgments The authors are very grateful for the participation and contribution in Delphi survey, regarding the Development of ongoing behavioral risk factor surveillance in the Repub- ...
doi:10.5281/zenodo.1051164
fatcat:hazjv3cxnbhkpjrnytfd4gsdz4
Classification of Library Resources by Subject on the Library Website: Is There an Optimal Number of Subject Labels?
2009
Information Technology and Libraries
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 conducted a study with 120 students and staff to try to answer the following question: What is the effect of the number of labels in a list on response time to research questions? ...
What we found is that response time increases gradually as the number of the items in the list grow until the list size reaches approximately fifty items. ...
depth and breadth of the tree structure was true for the Web. ...
doi:10.6017/ital.v28i1.3167
fatcat:2immcxmdabbbxmotogrbfcacd4
VoxLens: Making Online Data Visualizations Accessible with an Interactive JavaScript Plug-In
2022
CHI Conference on Human Factors in Computing Systems
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.
ACKNOWLEDGMENTS This work was supported in part by the Mani Charitable Foundation, the University of Washington Center for an Informed Public, and the University of Washington Center for Research and Education ...
We extend our gratitude to the AccessComputing staf for their support and assistance in recruiting participants. ...
In the ffth stage, each participant was given a total of nine tasks. ...
doi:10.1145/3491102.3517431
fatcat:cp2ycuizdjfbbgnnwpkc5d6yji
Development decision centers — a strategy to improve development decision-making
[chapter]
1996
Information Systems and Technology in the International Office of the Future
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.
DDC may become a core facility within community information centers, providing an 'electronic meeting room' with notebook computers for each participant, a workstation for the meeting facilitator/chauffeur ...
They can be integrated into community information centers which are recognized as a 'multisectoral concept' for improving development. ...
The distribution graph shows a separate small graph for each item evaluated. The Y-axis represents the total number of participants who assigned the same value for an item. ...
doi:10.1007/978-0-387-35085-1_21
fatcat:wwgy4byxmzajtoyza3nakfk4au
Edge Compression Techniques for Visualization of Dense Directed Graphs
2013
IEEE Transactions on Visualization and Computer Graphics
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 2016; you can also visit the original URL.
The file type is application/pdf.
For Power Graph Analysis we propose a novel optimal technique based on constraint programming. ...
(c) A Modular Decomposition allows internal structure within modules and nesting. Nine edges remain. ...
(c) A full modular decomposition of the same graph leaves only six aggregate links without any loss of connectivity information for an 85% compression rate. ...
doi:10.1109/tvcg.2013.151
pmid:24051826
fatcat:bjmkimbll5cjzmd7wfsaf2qtbm
A Novel Classification Framework Using the Graph Representations of Electroencephalogram for Motor Imagery based Brain-Computer Interface
2021
IEEE transactions on neural systems and rehabilitation engineering
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.
Our proposed method achieves a mean Kappa value of 0.88 across nine participants, which is superior to other methods we compared it to. ...
A graph embedding model called Ego-CNNs is then used to build a classifier, which can convert the graph from a structural representation to a fixed-dimensional vector for detecting critical structure in ...
For one participant, every 𝐴 describes the graph during different tasks, and has the same location but different structure. ...
doi:10.1109/tnsre.2021.3139095
pmid:34962871
fatcat:7acp2xvsnzfphnsbr3i3r5vmou
« Previous
Showing results 1 — 15 out of 42,174 results