Software Watermarking Based on Condensed Co-Change Graph Cluster

2010 ◽  
Vol 9 (5) ◽  
pp. 949-955
Author(s):  
Guang Sun ◽  
Xingming Sun
2010 ◽  
Vol 29 (12) ◽  
pp. 3188-3190 ◽  
Author(s):  
Hua JIANG ◽  
Zong-lu SHA ◽  
Ai-cheng XUAN

2004 ◽  
Vol 39 (1) ◽  
pp. 173-185 ◽  
Author(s):  
Patrick Cousot ◽  
Radhia Cousot

2016 ◽  
Vol 5 (1) ◽  
Author(s):  
Dean Eckles ◽  
Brian Karrer ◽  
Johan Ugander

AbstractEstimating the effects of interventions in networks is complicated due to interference, such that the outcomes for one experimental unit may depend on the treatment assignments of other units. Familiar statistical formalism, experimental designs, and analysis methods assume the absence of this interference, and result in biased estimates of causal effects when it exists. While some assumptions can lead to unbiased estimates, these assumptions are generally unrealistic in the context of a network and often amount to assuming away the interference. In this work, we evaluate methods for designing and analyzing randomized experiments under minimal, realistic assumptions compatible with broad interference, where the aim is to reduce bias and possibly overall error in estimates of average effects of a global treatment. In design, we consider the ability to perform random assignment to treatments that is correlated in the network, such as through graph cluster randomization. In analysis, we consider incorporating information about the treatment assignment of network neighbors. We prove sufficient conditions for bias reduction through both design and analysis in the presence of potentially global interference; these conditions also give lower bounds on treatment effects. Through simulations of the entire process of experimentation in networks, we measure the performance of these methods under varied network structure and varied social behaviors, finding substantial bias reductions and, despite a bias–variance tradeoff, error reductions. These improvements are largest for networks with more clustering and data generating processes with both stronger direct effects of the treatment and stronger interactions between units.


2012 ◽  
Vol 268-270 ◽  
pp. 1873-1876
Author(s):  
Dong Lai Fu

To prevent three dimension applications developed using jMonkey Engine from being pirated, a robust software watermarking algorithm was proposed. A watermark based on an initial sequence of scene-graph-traversal was embedded into the software by a numbering system. Since the initial sequence was a very important clue for extracting the embedded watermark, it should be only known by the owner. Furthermore, the algorithm for embedding and extracting the watermark was discussed. Analysis shows that the new method is more robust. And it enjoys the advantage that the size of scene graph does not be changed.


2016 ◽  
Vol 10 (7) ◽  
pp. 147-156 ◽  
Author(s):  
Krishan Kumar ◽  
Viney Kehar ◽  
Prabhpreet Kaur

Sign in / Sign up

Export Citation Format

Share Document