02318nas a2200241   4500008004100000245006700041210006700108260000900175300001400184490000700198520158900205653001601794653001701810653002601827653001501853653002801868100001101896700001301907700001201920700001401932700001301946856011701959       2013                        eng d00aRobustness analysis of social network based on a dynamic model0 aRobustness analysis of social network based on a dynamic model  c2013  a453 - 4610 v113 aDue to the high vulnerability of today's social systems against disruptions, it has become critical to measure and manage the robustness of social networks. In this study the relationship between social network's topology and its robustness in the presence of cascading failures is examined. In the attempt to help practice in increasing the robustness of social systems, the concept of the robustness of social systems is discussed and defined first. And then we propose a new dynamic model of social systems to investigate the robustness of social systems. We theorize that network characteristics such as average path length, node degree, and size of the largest connected component in social networks and so on. Based on the model, a good evaluation method is proposed to investigate the robustness of social networks against the cascading failures of component nodes. Finally, the damage degree of social networks considering cascading failures is investigated through our model. The simulation results confirm that there is a positive relationship between the robustness of social systems and social system performance, while a negative relationship between the topology structure and the robustness of social systems. By the dynamic model, we not only identify the potential key nodes, but also obtain the parameter value which can make the social network reach strongest robustness level. Our work develops a new methodology to the real world application. This research is helpful to increase the robustness of such complex systems and tackle the optimization problem of them.10aDisruptions10aGraph Theory10aNetwork Damage Degree10aRobustness10aSocial Network Analysis1 aWu, H.1 aYing, S.1 aJia, X.1 aZhang, L.1 aChen, X.  uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84892163854&partnerID=40&md5=861e44abb43f2d1f64ca3d9c26ee9c4f01663nas a2200217   4500008004100000245009400041210006900135260000900204300001400213490000600227520096100233653001401194653001901208653001401227653001501241653001501256653001601271100002501287700001601312856011701328       2007                        eng d00aRobust self embedding watermarking technique in the DWT domain for digital colored images0 aRobust self embedding watermarking technique in the DWT domain f  c2007  a211 - 2190 v53 aIn this work, a robust watermarking algorithm is proposed for colored digital images. The 24 bits/pixel RGB images are converted to YCbCr color format, and the Y part is converted to Discrete Wavelet Transform (DWT). The resulted LL part is resized to the original size of the host image and its blocks are scrambled using certain key. The watermark is another copy of the LL part and its pixels are, also, scrambled and each pixel is embedded in one of the scrambled blocks of the LL part. The algorithm takes into account the Human Visual System via relating the embedding process to the intensity of each block of the host image. We have used the average PSNR as a quality measure for the embedding stage. In all our experiments we got more than 68 dB which satisfies the PSNR bench mark. Also we got an average value of 0.15 for MAE, which is the robustness measure. This means that our algorithm is very robust and the watermark is still recognizable.10aCopyright10aDigital images10aEmbedding10aRobustness10aScrambling10aWatermaking1 aAl-Nu'aimi, Al-Tahan1 aQahwaji, R.  uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-44949187327&partnerID=40&md5=d8e2ad97422a0852424c209b57cc93ff