scholarly journals Pairwise interaction processes for modeling cellular network topology

2012 ◽  
Author(s):  
David B. Taylor ◽  
Harpreet S. Dhillon ◽  
Thomas D. Novlan ◽  
Jeffrey G. Andrews
Keyword(s):  
Network Topology ◽  
Cellular Network ◽  
Pairwise Interaction ◽  
Interaction Processes

Research on Location Management Based on Irregular Cellular Network Topology Model

2010 ◽  
Vol 21 (6) ◽  
pp. 1353-1363
Author(s):  
Xiao-Min ZHAO ◽  
Mei-Ya LANG ◽  
Qing-Zhang CHEN
Keyword(s):  
Network Topology ◽  
Cellular Network ◽  
Location Management ◽  
Topology Model

scholarly journals Bounds for the Probability Generating Functional of a Gibbs Point Process

2014 ◽  
Vol 46 (1) ◽  
pp. 21-34 ◽  
Author(s):  
Kaspar Stucki ◽  
Dominic Schuhmacher
Keyword(s):  
Point Process ◽  
Poisson Point Process ◽  
Upper Bounds ◽  
Pairwise Interaction ◽  
Summary Statistics ◽  
Lower And Upper Bounds ◽  
Generating Functional ◽  
Interaction Processes ◽  
Gibbs Point Process ◽  
Process Approximation

We derive explicit lower and upper bounds for the probability generating functional of a stationary locally stable Gibbs point process, which can be applied to summary statistics such as the F function. For pairwise interaction processes we obtain further estimates for the G and K functions, the intensity, and higher-order correlation functions. The proof of the main result is based on Stein's method for Poisson point process approximation.

Point process limits of lattice processes

1982 ◽  
Vol 19 (01) ◽  
pp. 210-216 ◽  
Author(s):  
Julian Besag ◽  
Robin Milne ◽  
Stan Zachary
Keyword(s):  
Point Process ◽  
Pairwise Interaction ◽  
Interaction Point ◽  
Interaction Processes ◽  
Lattice Processes ◽  
Suitable Sequence

Starting from a suitable sequence of auto-Poisson lattice schemes, it is shown that (almost) any purely inhibitory pairwise-interaction point process can be obtained in the limit. Further pairwise-interaction processes are obtained as limits of sequences of auto-logistic lattice schemes.

Point process limits of lattice processes

1982 ◽  
Vol 19 (1) ◽  
pp. 210-216 ◽  
Author(s):  
Julian Besag ◽  
Robin Milne ◽  
Stan Zachary
Keyword(s):  
Point Process ◽  
Pairwise Interaction ◽  
Interaction Point ◽  
Interaction Processes ◽  
Lattice Processes ◽  
Suitable Sequence

Starting from a suitable sequence of auto-Poisson lattice schemes, it is shown that (almost) any purely inhibitory pairwise-interaction point process can be obtained in the limit. Further pairwise-interaction processes are obtained as limits of sequences of auto-logistic lattice schemes.

scholarly journals Antitamper Image Watermarking Based on Cellular Network Topology for IoT-Themed Mobile Forensics

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Xiao-zhu Xie ◽  
Ching-Chun Chang ◽  
Zhong-Liang Yang ◽  
Li Li
Keyword(s):  
Mobile Devices ◽  
Network Topology ◽  
Mobile Communications ◽  
Cellular Network ◽  
Image Watermarking ◽  
Computational Cost ◽  
Lookup Table ◽  
Mobile Forensics ◽  
Interdisciplinary Field ◽  
Reference Matrix

The Internet of Things (IoT) connects physical and digital worlds with mobile devices, accompanied by a surge in cybersecurity issues. With the rapid adoption of mobile devices, mobile forensics emerges as a new interdisciplinary field that concerns many forms of sabotage and cybercrime in the context of mobile computing. One of the most common cyberattacks is tampering. Digital watermarking is a tamper-evident technique used to protect data integrity. In this paper, we present an antitamper image watermarking scheme designed for mobile communications with low computational cost. A reference matrix based on cellular network topology is introduced to guide the watermark embedding and extraction processes. This reference matrix serves as a lookup table to reduce computational complexity, thereby enabling efficient implementation on mobile devices. Our scheme is aimed at offering high accuracy in detecting and localizing tampered regions. We also achieve a high watermarking capacity while leaving the visual quality of the carrier images nearly unharmed. Experimental results validate the effectiveness of our scheme against various types of simulated forgery including cropping and copy/paste attacks.

scholarly journals Bounds for the Probability Generating Functional of a Gibbs Point Process

2014 ◽  
Vol 46 (01) ◽  
pp. 21-34 ◽  
Author(s):  
Kaspar Stucki ◽  
Dominic Schuhmacher
Keyword(s):  
Point Process ◽  
Poisson Point Process ◽  
Upper Bounds ◽  
Pairwise Interaction ◽  
Summary Statistics ◽  
Lower And Upper Bounds ◽  
Generating Functional ◽  
Interaction Processes ◽  
Gibbs Point Process ◽  
Process Approximation

We derive explicit lower and upper bounds for the probability generating functional of a stationary locally stable Gibbs point process, which can be applied to summary statistics such as the F function. For pairwise interaction processes we obtain further estimates for the G and K functions, the intensity, and higher-order correlation functions. The proof of the main result is based on Stein's method for Poisson point process approximation.

Sign in / Sign up

Export Citation Format

Share Document