Learn More
Visual secret sharing (VSS) is a technology that encrypts a secret image into several share images. When superimposes the shares, it can restore the secret by human vision. This paper proposes a novel image visual secret sharing scheme to encrypt two secret images in the same time. This scheme turns two secret images into two meaningless shares without any(More)
BACKGROUND It is well known that the quality of life of patients with chronic kidney disease can be improved by dialysis. While previous studies have used retrospective designs and adhered to a standard target prescribed by clinical guidelines, our study prospectively investigates the association between the adequacy of peritoneal dialysis (PD) and measures(More)
Highly conserved sequences (regions or domains) play an important role in phylogenetic analysis. In this study, a novel approach to extract highly conserved sequences as representative regions for the genuses of viruses via protein sequences clustering is proposed. A representative region of one genus is extracted from one distinctive protein sequence group(More)
Multiple secret images sharing scheme deals with the problem that how to secretly distribute several secret images among a group of participants at the same time, and reconstruct these secret images by collecting the shared images or the shares held in qualified subsets. Many studies explore the technique about the secret image sharing, but most of them(More)
Two Hamiltonian cycles $$C_1=\langle u_0,u_1,u_2,...,u_{n-1},u_0 \rangle $$ C 1 = ⟨ u 0 , u 1 , u 2 , . . . , u n - 1 , u 0 ⟩ and $$C_2=\langle v_0,v_1,v_2,...,v_{n-1},v_0 \rangle $$ C 2 = ⟨ v 0 , v 1 , v 2 , . . . , v n - 1 , v 0 ⟩ of a graph G are independent starting at $$u_0$$ u 0 if $$u_0=v_0, u_i\ne v_i$$ u 0 = v 0 , u i ≠ v i for all $$1\le i\le(More)