Three novel blind watermarking techniques are proposed to embed watermarks into digital images for different purposes. The watermarks are designed to be decoded or detected without the original images. The first one, called single watermark embedding (SWE), is used to embed a watermark bit sequence into digital images using two secret keys. The second technique, called multiple watermark embedding (MWE), extends SWE to embed multiple watermarks simultaneously in the same watermark space while minimizing the watermark (distortion) energy. The third technique, called iterative watermark embedding (IWE), embeds watermarks into JPEG-compressed images. The iterative approach of IWE can prevent the potential removal of a watermark in the JPEG recompression process. Experimental results show that embedded watermarks using the proposed techniques can give good image quality and are robust in varying degree to JPEG compression, low-pass filtering, noise contamination, and print-and-scan.Index Terms-Blind watermarking, data hiding, multiple watermarks.

The global increase of gene expression has been frequently established in cancer microarray studies. However, many genes may not deliver informative signals for a given experiment, due to insufficient expression or even non-expression, despite the DNA microarrays massively measuring genes in parallel. Hence the informative gene set, rather than the whole genome, should be more reasonable to represent the genome expression level. We observed that the trend of over-expression for informative genes is more obvious in human cancers, which is to some extent masked using the whole genome without any filtering. Accordingly we proposed a novel normalization method, Informative CrossNorm (ICN), which performs the cross normalization (CrossNorm) on the expression matrix merely containing the informative genes. ICN outperforms other methods with a consistently high precision, F-score, and Matthews correlation coefficient as well as an acceptable recall based on three available spiked-in datasets with ground truth. In addition, nine potential therapeutic target genes for esophageal squamous cell carcinoma (ESCC) were identified using ICN integrated with a protein-protein interaction network, which biologically demonstrates that ICN shows superior performance. Consequently, it is expected that ICN could be applied routinely in cancer microarray studies.

No abstract

Multiple Traveling Salesman Problem (MTSP) is able to model and solve various real-life applications such as multiple scheduling, multiple vehicle routing and multiple path planning problems, etc. While Traveling Salesman Problem (TSP) focuses on searching a path of minimum traveling distance to visit all cities exactly once by one salesman, the objective of the MTSP is to find m paths for m salesmen with a minimized total cost -the sum of traveling distances of all salesmen through all of the respective cities covered. They have to start from a designated depot which is the departing and returning location of all salesmen. Since the MTSP is a NP-hard problem, a new effective Genetic Algorithm with Local operators (GAL) is proposed in this paper to solve the MTSP and generate high quality solution within a reasonable amount of time for real-life applications. Two new local operators, Branch and Bound (BaB) and Cross Elimination (CE), are designed to speed up the convergence of the search process and improve the solution quality. Results demonstrate that GAL finds a better set of paths with a 9.62% saving on average in cost comparing to two existing MTSP algorithms.