Zobrazeno 1 - 10
of 69
pro vyhledávání: '"Shyong Jian Shyu"'
Publikováno v:
Heliyon, Vol 9, Iss 10, Pp e20550- (2023)
Goldbach's conjecture is an unsolved legendary problem. In this paper, we investigate an optimization problem as an attempt to discuss potential applications of the conjecture. In an optimization perspective, the research question, modelled from desi
Externí odkaz:
https://doaj.org/article/24a538ebfdfe475b84b20a15e7fb8449
Publikováno v:
The Scientific World Journal, Vol 2013 (2013)
Materials acquisition is one of the critical challenges faced by academic libraries. This paper presents an integer programming model of the studied problem by considering how to select materials in order to maximize the average preference and the bu
Externí odkaz:
https://doaj.org/article/5476b370c9de415b94b4556e5b264b80
Publikováno v:
Theoretical Computer Science. 882:29-48
Given a text T and a set of r patterns P 1 , P 2 , … , P r , the exact multiple pattern matching problem reports the ending positions of all occurrences of P i in T for 1 ≤ i ≤ r . By transforming all substrings with a fixed length of T into a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eb85cce59f99ff74046a254776dabe29
https://doi.org/10.1016/j.tcs.2021.06.003
https://doi.org/10.1016/j.tcs.2021.06.003
Autor:
Shyong Jian Shyu
Publikováno v:
IEEE Transactions on Circuits and Systems for Video Technology. 28:2397-2401
A $k$ out of $n$ visual cryptographic scheme [( $k, n)$ -VCS] encodes a secret image $P$ into $n$ transparencies (shares) in such a way that any $k$ shares reveal $P$ in a visual sense when they are superimposed (equivalent to the “OR” operation)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::24dd894718b12eb07211ff6a7cddddd2
https://doi.org/10.1109/tcsvt.2017.2707923
https://doi.org/10.1109/tcsvt.2017.2707923
Autor:
Shyong Jian Shyu, Ying Zhen Tsai
Publikováno v:
Communications in Computer and Information Science ISBN: 9789811391897
ICS
ICS
A (k, n) threshold secret sharing scheme encrypts a secret s into n parts (called shares), which are distributed to n participants, such that any k participants can recover s using their shares, any group of less than k ones cannot. A robust threshol
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fc603aa118887d86dfd95c189a88a09a
https://doi.org/10.1007/978-981-13-9190-3_50
https://doi.org/10.1007/978-981-13-9190-3_50
Publikováno v:
I-SPAN
The aim of a (k, n) threshold secret sharing scheme is to encrypt a secret s into n parts (called shares) such that any k participants can recover s using their shares, while any group of less than k ones cannot. To deal with multimedia data, the eff
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2a78b8bf755443744c8f11e5a622b910
https://doi.org/10.1109/i-span.2018.00068
https://doi.org/10.1109/i-span.2018.00068
Autor:
Shyong Jian Shyu, Ying Zhen Tsai
Publikováno v:
Security with Intelligent Computing and Big-data Services ISBN: 9783319764504
A (k, n) threshold secret sharing scheme encrypts a secret s into n parts (called shares), which are distributed into n participants, such that any k participants can recover s using their shares, any group of less than k ones cannot. When the size o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::407598d4460220eec90fd54ada8fe1d8
https://doi.org/10.1007/978-3-319-76451-1_20
https://doi.org/10.1007/978-3-319-76451-1_20
Publikováno v:
Displays. 39:80-92
For visual secret sharing (VSS), general access structure (GAS), which can freely define the qualified set and the forbidden set, provides dealers the ability to share secret information with the qualified set but not the forbidden set. In previous s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dcbc5a1584035140d14021178114035b
https://doi.org/10.1016/j.displa.2015.09.001
https://doi.org/10.1016/j.displa.2015.09.001