As an effective way to securely transfer secret images,secret image sharing(SIS)has been a noteworthy area of research.Basically in a SIS scheme,a secret image is shared via shadows and could be reconstructed by havin...As an effective way to securely transfer secret images,secret image sharing(SIS)has been a noteworthy area of research.Basically in a SIS scheme,a secret image is shared via shadows and could be reconstructed by having the required number of them.A major downside of this method is its noise-like shadows,which draw the malicious users'attention.In order to overcome this problem,SIS schemes with meaningful shadows are introduced in which the shadows are first hidden in innocent-looking cover images and then shared.In most of these schemes,the cover image cannot be recovered without distortion,which makes them useless in case of utilising critical cover images such as military or medical images.Also,embedding the secret data in Least significant bits of the cover image,in many of these schemes,makes them very fragile to steganlysis.A reversible IWT-based SIS scheme using Rook polynomial and Hamming code with authentication is proposed.In order to make the scheme robust to steganalysis,the shadow image is embedded in coefficients of Integer wavelet transform of the cover image.Using Rook polynomial makes the scheme more secure and moreover makes authentication very easy and with no need to share private key to participants.Also,utilising Hamming code lets us embed data with much less required modifications on the cover image which results in high-quality stego images.展开更多
Determinations of fracture network connections would help the investigators remove those ＂meaningless＂ no-flow-passing fractures, providing an updated and more effective fracture network that could considerably impr...Determinations of fracture network connections would help the investigators remove those ＂meaningless＂ no-flow-passing fractures, providing an updated and more effective fracture network that could considerably improve the computation efficiency in the pertinent numerical simulations of fluid flow and solute transport. The effective algorithms with higher computational efficiency are needed to accomplish this task in large-scale fractured rock masses. A new approach using R tree indexing was proposed for determining fracture connection in 3D stochastically distributed fracture network. By com- paring with the traditional exhaustion algorithm, it was observed that from the simulation results, this approach was much more effective; and the more the fractures were investigated, the more obvious the advantages of the approach were. Furthermore, it was indicated that the runtime used for creating the R tree indexing has a major part in the total of the runtime used for calculating Minimum Bounding Rectangles （MBRs）, creating the R tree indexing, precisely finding out fracture intersections, and identifying flow paths, which are four important steps to determine fracture connections. This proposed approach for the determination of fracture connections in three-dimensional fractured rocks are expected to provide efficient preprocessing and critical database for practically accomplishing numerical computation of fluid flow and solute transport in large-scale fractured rock masses.展开更多
In this paper,we show that there exist precisely W(A) Ferrers matrices F(C1,C2,…,cm)such that the rook polynomials is equal to the rook polynomial of Ferrers matrix F(b1,b2,…,bm), where A={b1,b2-1,…,bm-m+1} is a re...In this paper,we show that there exist precisely W(A) Ferrers matrices F(C1,C2,…,cm)such that the rook polynomials is equal to the rook polynomial of Ferrers matrix F(b1,b2,…,bm), where A={b1,b2-1,…,bm-m+1} is a repeated set,W(A) is weight of A.展开更多
In this paper, both the roman domination number and the number of minimum roman dominating sets are found for any rectangular rook’s graph. In a similar fashion, the roman domination number and the number of minimum ...In this paper, both the roman domination number and the number of minimum roman dominating sets are found for any rectangular rook’s graph. In a similar fashion, the roman domination number and the number of minimum roman dominating sets are found on the square bishop’s graph for odd board sizes. Also found are the number of minimum total dominating sets associated with the light-colored squares when n?≡1(mod12)? (with n>1), and same for the dark-colored squares when n?≡7(mod12) .展开更多
Both independence and independence-separation problems on chessboard graphs have been studied in detail, with hundreds of papers in the broader independence category, and several on the independence-separation problem...Both independence and independence-separation problems on chessboard graphs have been studied in detail, with hundreds of papers in the broader independence category, and several on the independence-separation problem variant for chessboard graphs. In this paper, the inde-pendence-separation problem is considered on the d-dimensional rook’s graph. A lower bound of k, for , is found for the independence-separation number on the d-dimensional rook’s graph, denoted by . For the case where , it is found that when n is odd and , . Conjecture and discussion are added.展开更多
Let m, n ∈ N, and V be an m-dimensional vector space over a field F of characteristic 0. Let U = F ＋ V and Rn be the rook monoid. In this paper, we construct a certain quasi-idempotent in the annihilator of U^×...Let m, n ∈ N, and V be an m-dimensional vector space over a field F of characteristic 0. Let U = F ＋ V and Rn be the rook monoid. In this paper, we construct a certain quasi-idempotent in the annihilator of U^×n in FRn, which comes from some one-dimensional two-sided ideal of rook monoid algebra. We show that the two-sided ideal generated by this element is indeed the whole annihilator of U^×n in FR^n.展开更多
基金Iran National Science Foundation,Grant/Award Number:99009224。
文摘As an effective way to securely transfer secret images,secret image sharing(SIS)has been a noteworthy area of research.Basically in a SIS scheme,a secret image is shared via shadows and could be reconstructed by having the required number of them.A major downside of this method is its noise-like shadows,which draw the malicious users'attention.In order to overcome this problem,SIS schemes with meaningful shadows are introduced in which the shadows are first hidden in innocent-looking cover images and then shared.In most of these schemes,the cover image cannot be recovered without distortion,which makes them useless in case of utilising critical cover images such as military or medical images.Also,embedding the secret data in Least significant bits of the cover image,in many of these schemes,makes them very fragile to steganlysis.A reversible IWT-based SIS scheme using Rook polynomial and Hamming code with authentication is proposed.In order to make the scheme robust to steganalysis,the shadow image is embedded in coefficients of Integer wavelet transform of the cover image.Using Rook polynomial makes the scheme more secure and moreover makes authentication very easy and with no need to share private key to participants.Also,utilising Hamming code lets us embed data with much less required modifications on the cover image which results in high-quality stego images.
基金Supported by the Major State Basic Research Development Program of China （973 Program） （2010CB428804） the National Science Foundation ot China （40672172） and the Major Science and Technology Program for Water Pollution Control and Treatment（2009ZX07212-003）
文摘Determinations of fracture network connections would help the investigators remove those ＂meaningless＂ no-flow-passing fractures, providing an updated and more effective fracture network that could considerably improve the computation efficiency in the pertinent numerical simulations of fluid flow and solute transport. The effective algorithms with higher computational efficiency are needed to accomplish this task in large-scale fractured rock masses. A new approach using R tree indexing was proposed for determining fracture connection in 3D stochastically distributed fracture network. By com- paring with the traditional exhaustion algorithm, it was observed that from the simulation results, this approach was much more effective; and the more the fractures were investigated, the more obvious the advantages of the approach were. Furthermore, it was indicated that the runtime used for creating the R tree indexing has a major part in the total of the runtime used for calculating Minimum Bounding Rectangles （MBRs）, creating the R tree indexing, precisely finding out fracture intersections, and identifying flow paths, which are four important steps to determine fracture connections. This proposed approach for the determination of fracture connections in three-dimensional fractured rocks are expected to provide efficient preprocessing and critical database for practically accomplishing numerical computation of fluid flow and solute transport in large-scale fractured rock masses.
文摘In this paper,we show that there exist precisely W(A) Ferrers matrices F(C1,C2,…,cm)such that the rook polynomials is equal to the rook polynomial of Ferrers matrix F(b1,b2,…,bm), where A={b1,b2-1,…,bm-m+1} is a repeated set,W(A) is weight of A.
文摘In this paper, both the roman domination number and the number of minimum roman dominating sets are found for any rectangular rook’s graph. In a similar fashion, the roman domination number and the number of minimum roman dominating sets are found on the square bishop’s graph for odd board sizes. Also found are the number of minimum total dominating sets associated with the light-colored squares when n?≡1(mod12)? (with n>1), and same for the dark-colored squares when n?≡7(mod12) .
文摘Both independence and independence-separation problems on chessboard graphs have been studied in detail, with hundreds of papers in the broader independence category, and several on the independence-separation problem variant for chessboard graphs. In this paper, the inde-pendence-separation problem is considered on the d-dimensional rook’s graph. A lower bound of k, for , is found for the independence-separation number on the d-dimensional rook’s graph, denoted by . For the case where , it is found that when n is odd and , . Conjecture and discussion are added.
基金Supported by National Natural Science Foundation of China(Grant No.11301195)a research foundation of Huaqiao University(Grant No.2014KJTD14)
文摘Let m, n ∈ N, and V be an m-dimensional vector space over a field F of characteristic 0. Let U = F ＋ V and Rn be the rook monoid. In this paper, we construct a certain quasi-idempotent in the annihilator of U^×n in FRn, which comes from some one-dimensional two-sided ideal of rook monoid algebra. We show that the two-sided ideal generated by this element is indeed the whole annihilator of U^×n in FR^n.
