Time-correlation of GSM telephone traffic is important for wireless network performance, but lack of in-depth investigation, especially in large-scale networks. In this paper, we investigate this topic using the data ...
详细信息
Time-correlation of GSM telephone traffic is important for wireless network performance, but lack of in-depth investigation, especially in large-scale networks. In this paper, we investigate this topic using the data of call detail records (CDR) collected in June 2013 from thousands of GSM base stations. Based on results obtained by the Modified Allan Variance (MAVAR), we confirm the long-range dependency for all base stations, which is consistent with existing results. But through comprehensive chi-square test we believe that the call arrivals can NOT always be modeled as Poisson distribution in short-term in most cases, which disagree with previous conclusions. Our work may be beneficial to energy saving, realistic traffic modelling and performance evaluation of cellular networks.
作者:
Felicia Olmeta-SchultLauren Massa SegalSam TynerTwila Alexandra MoonRyan Dz-Wei ChowProsanta ChakrabartyMartin PacesaAnna Igorevna PodgornaiaJennifer ChenBipin SinghBo CaoRishi Raj Singh SidhuBryce W Q TanPrashant SoodStuart ParkerMatthew A ScultDesiree Van HauteNikos KonstantinidesBeat A SchwendimannSudhakar SrivastavaRaffaele FiorenzaKen Dutton-RegesterRachel HaleEmre Ozan PolatEdward LauAudrey L MayerEaston R WhiteEnvironmental and Natural Resource Sciences
Washington State University Vancouver WA 98686 USA. folmeta@wsu.edu lsegal3@*** sctyner@iastate.edu twila.science@*** ryan.chow@yale.edu prosanta@lsu.edu m.pacesa@bioc.uzh.ch anna.podgornaia@*** jennifer.s.chen@yale.edu bipin.singh@bmu.edu.in bocao@*** rishirajsidhu@*** brycetan03@*** drprashantsood@*** parkstua@isu.edu matthew.scult@duke.edu desireevanhaute@*** nk1845@nyu.edu beat.schwendimann@*** sudhakar.srivastava@*** ralphie.fiorenza@*** ken.dutton-regester@qimrberghofer.edu.au r.hale@soton.ac.uk emre-ozan.polat@icfo.es lau1@stanford.edu almayer@mtu.edu eawhite@ucdavis.edu. Department of Plant Pathology
University of Nebraska-Lincoln Lincoln NE 68583 USA. folmeta@wsu.edu lsegal3@*** sctyner@iastate.edu twila.science@*** ryan.chow@yale.edu prosanta@lsu.edu m.pacesa@bioc.uzh.ch anna.podgornaia@*** jennifer.s.chen@yale.edu bipin.singh@bmu.edu.in bocao@*** rishirajsidhu@*** brycetan03@*** drprashantsood@*** parkstua@isu.edu matthew.scult@duke.edu desireevanhaute@*** nk1845@nyu.edu beat.schwendimann@*** sudhakar.srivastava@*** ralphie.fiorenza@*** ken.dutton-regester@qimrberghofer.edu.au r.hale@soton.ac.uk emre-ozan.polat@icfo.es lau1@stanford.edu almayer@mtu.edu eawhite@ucdavis.edu. Center for Statistics and Applications in Forensic Evidence
Iowa State University Ames IA 50014 USA. folmeta@wsu.edu lsegal3@*** sctyner@iastate.edu twila.science@*** ryan.chow@yale.edu prosanta@lsu.edu m.pacesa@bioc.uzh.ch anna.podgornaia@*** jennifer.s.chen@yale.edu bipin.singh@bmu.edu.in bocao@*** rishirajsidhu@*** brycetan03@*** drprashantsood@*** parkstua@isu.edu matthew.scult@duke.edu desireevanhaute@*** nk1845@nyu.edu beat.schwendimann@*** sudhakar.srivastava@*** ralphie.fiorenza@*** ken.dutton-regester@qimrberghofer.edu.au r.hale@soton.ac.uk emre-ozan.polat@icfo.es lau1@stanford.edu almayer@mtu.edu eawhite@ucdavis.edu. National Snow and Ice Data Center
University of Colorado Boulder CO 80309 USA. folmeta@wsu.edu lsegal3@gmail.com sctyner@iastate.edu twila.science@gma
EEG-fMRI research to study brain function became popular because of the complementarity of the modalities. Through the use of data-driven approaches such as jointICA, sources extracted from EEG can be linked to region...
详细信息
This paper presents the design and implementation of an information flow tracking framework based on code rewrite to prevent sensitive information leaks in browsers, combining the ideas of taint and information flow a...
详细信息
This paper presents the design and implementation of an information flow tracking framework based on code rewrite to prevent sensitive information leaks in browsers, combining the ideas of taint and information flow analysis. Our system has two main processes. First, it abstracts the semantic of JavaScript code and converts it to a general form of intermediate representation on the basis of JavaScript abstract syntax tree. Second, the abstract intermediate representation is implemented as a special taint engine to analyze tainted information flow. Our approach can ensure fine-grained isolation for both confidentiality and integrity of information. We have implemented a proof-of-concept prototype, named JSTFlow, and have deployed it as a browser proxy to rewrite web applications at runtime. The experiment results show that JSTFlow can guarantee the security of sensitive data and detect XSS attacks with about 3x performance overhead. Because it does not involve any modifications to the target system, our system is readily deployable in practice.
The research on community structure is a key to analyze the network functionality and topology, and thus it is significant to detect and analysis the community structure. During the abstract process from an actual sys...
详细信息
The research on community structure is a key to analyze the network functionality and topology, and thus it is significant to detect and analysis the community structure. During the abstract process from an actual system to a network, especially for a large-scale network, it is inevitable to have mistaken connections between nodes or have connection missing. In addition, in real applications, from time to time we can obtain prior information in the form of pairwise constraints between nodes besides topology information, although they may be inaccurate or conflicted. These noises in the network-related information will dramatically reduce the accuracy of community detection. Hence, in this paper, we introduce a dissimilarity index to determine the trustworthiness of pairwise constraints and settle the conflict of pairwise constraints. Then, focusing on the community detection with false connections or conflicted connections, we propose a pairwise constrained structure-enhanced extremal optimization-based semi-supervised algorithm (PCSEO-SS algorithm). Compared with existing semi-supervised community detection approaches, the experimental results executed on real networks and synthetic networks, show that PCSEO-SS can solve the problem of false connections or conflicted connections to some extent and detect the community structure more precisely.
The formal model of spatial directional relations is one of the most important parts in spatial relation research. The most of models are based on Minimum Bounding Rectangle (MBR), and they are not compliant with the ...
详细信息
The formal model of spatial directional relations is one of the most important parts in spatial relation research. The most of models are based on Minimum Bounding Rectangle (MBR), and they are not compliant with the regular pattern of human cognition. In order to get a closer conclusion to human cognition on directional relationship, Angle Histogram model based on Double-projection and Rounded-subdivision (AHDPRS) is proposed in this paper. The model uses the maximum inscribed circles to find out the maximum parts of the object, and calculates the directional relationship between the centers of the circles. This model ignores the inessential details to ensure the result which will be closer to human cognition. The experiments show that this model is feasible.
Since the SIFT feature point extraction algorithm with scale changes, rotation transformation invariance, is widely used in image registration. In this paper, the SIFT algorithm is applied to three-dimensional point c...
详细信息
Since the SIFT feature point extraction algorithm with scale changes, rotation transformation invariance, is widely used in image registration. In this paper, the SIFT algorithm is applied to three-dimensional point cloud coarse registration, the proposed 3DSIFT extraction algorithm is suitable for three-dimensional point cloud data, then point coordinates, curvature, the nearest neighbor distance mean and other information compose fourteen-dimensional vector to conduct correspondence match, use the interior point rate of Ransac to obtain optimal transformation, and finally transform the coordinates for source point clouds using the optimal transform, complete the point cloud data coarse registration. Experimental results show that our coarse registration algorithm can effectively extract feature points, and it is robust for the point cloud with noisy point, it can provide accurate and effective initial value for the precise registration such as ICP.
Since the method of isotropic filtering will result in blurring sharp features, a new approach of anisotropic filtering algorithm is proposed, direction and scale of such filter vary according to changes of sharp feat...
详细信息
暂无评论