Compromised computers, known as bots, are the major source of spamming and their detection helps greatly improve control of unwanted traffic. In this work we investigate the behavior patterns of spammers based on thei...
详细信息
Compromised computers, known as bots, are the major source of spamming and their detection helps greatly improve control of unwanted traffic. In this work we investigate the behavior patterns of spammers based on their underlying similarities in spamming. To our knowledge, no work has been reported on identifying spam botnets based on spammerspsila temporal characteristics. Our study shows that the relationship among spammers demonstrates highly clustering structures based on features such as content length, time of arrival, frequency of email, active time, inter-arrival time, and content type. Although the dimensions of the collected feature set is low, we perform principal component analysis (PCA) on feature set to identify the features which account for the maximum variance in the spamming patterns. Further, we calculate the proximity between different spammers and classify them into various groups. Each group represents similar proximity. Spammers in the same group inherit similar patterns of spamming a domain. For classification into Botnet groups, we use clustering algorithms such as Hierarchical and *** identify Botnet spammers into a particular group with a precision of 90%.
The problems and drawbacks of existing e-commerce systems are discussed in this paper. A new solving scheme for modern e-commerce system framework is presented. And then, the solution of sharing function and data for ...
详细信息
ISBN:
(纸本)9781479965441
The problems and drawbacks of existing e-commerce systems are discussed in this paper. A new solving scheme for modern e-commerce system framework is presented. And then, the solution of sharing function and data for each node of a modern business flow is designed including data reuse, elastic cart, order of automatic collection, trusteeship calculating of logistics cost request and automatic chamberlain based on Web Services. The new scheme improves the enormous efficiency of commercial affairs.
Formal and efficient protocol analysis by pen and paper is highly desired when informal and model-checking methods are not trusted in proving correctness of complicated e-commerce protocols. Based on strand spaces, th...
详细信息
ISBN:
(纸本)9781424441969
Formal and efficient protocol analysis by pen and paper is highly desired when informal and model-checking methods are not trusted in proving correctness of complicated e-commerce protocols. Based on strand spaces, this paper presents a method for fairness analysis of offline fair exchange protocols. With the new method, this paper formally analyzes an important offline fair exchange protocol -- the ASW certified email protocol, detects two flaws, and makes an improvement. The security analysis shows that such protocols as complicated as fair exchanges can be formally analyzed by pen and paper.
In this paper, we propose a new inpainting algorithm based on color segmentation to preserve the structure of image. We use color segmentation to construct contour lines, and estimate the slope of contour lines and ho...
详细信息
ISBN:
(纸本)9781424418657
In this paper, we propose a new inpainting algorithm based on color segmentation to preserve the structure of image. We use color segmentation to construct contour lines, and estimate the slope of contour lines and how they should extend. We also use the advantage of Bezier curves that fit the curves to the real world. The algorithm also fit to more general cases.
This paper presents a novel Virtual Circle Combined Straight Routing (VCCSR) algorithm for a mobile sink to collect data in wireless sensor networks. Tree-based routing is a common scheme to collect data from sensors ...
详细信息
This paper presents a novel Virtual Circle Combined Straight Routing (VCCSR) algorithm for a mobile sink to collect data in wireless sensor networks. Tree-based routing is a common scheme to collect data from sensors to a sink. Most of the previous proposed tree-like aggregation approaches are not suitable for mobile sink, because the routes between sink and sensors have to be reconstructed when a mobile sink moved. This causes a lot of link reconstruction to waste a lot of energy. The VCCSR algorithm is a structure-based routing with a virtual backbone. A set of cluster heads is located at the virtual backbone. When a mobile sink needs to collect data from sensors, a dynamic tree routing is constructed on the virtual backbone. Each cluster head is able to adjust tree routes when the mobile sink location is updated. This algorithm only needs to update the location information of mobile sink to a part of cluster heads to change their routing. This paper proposes a set of regular updating rules for the virtual structure to adjust routes effectively. The VCCSR algorithm is compared with tree-based algorithms in simulation. This paper demonstrates that a mobile sink can collect data and save energy effectively in a wireless sensor network. The VCCSR algorithm reduces the reconstructing cost so that it can prolong the network lifetime.
This paper proposes a design method and programmable architectures for numerical function generators (NFGs) of two-variable functions. To realize a two-variable function in hardware, we partition a given domain of the...
详细信息
This paper proposes a design method and programmable architectures for numerical function generators (NFGs) of two-variable functions. To realize a two-variable function in hardware, we partition a given domain of the given function into segments, and approximate the function by a polynomial in each segment. This paper introduces two planar segmentation algorithms that efficiently partition a domain of a two-variable function. This paper also introduces two architectures that can realize a wide range of two-variable functions. Our architectures allow a systematic design of two-variable functions. FPGA implementation results show that, for a complicated function, our NFG achieves 58% of memory size and 39% of delay time of a circuit designed using one-variable NFGs.
Efficient intra-node shared memory communication is important for high performance computing (HPC), especially with the emergence of multi-core architectures. As clusters continue to grow in size and complexity, the u...
详细信息
Efficient intra-node shared memory communication is important for high performance computing (HPC), especially with the emergence of multi-core architectures. As clusters continue to grow in size and complexity, the use of virtual machine (VM) technologies has been suggested to ease the increasing number of management issues. As demonstrated by earlier research, shared memory communication must be optimized for VMs to attain the native-level performance required by HPC centers. In this paper, we enhance intra-node shared memory communication for VM environments. We propose a one-copy approach. Instead of following the traditional approach used in most MPI implementations, copying data in and out of a pre-allocated shared memory region, our approach dynamically maps user buffers between VMs, allowing data to be directly copied to its destination. We also propose a grant/mapping cache to reduce expensive buffer mapping cost in VM environment. We integrate this approach into MVAPICH2, our implementation of MPI-2 library. For intra-node communication, we are able to reduce the large message latency in VM-based environments by up to 35%, and increase bandwidth by up to 38% even as compared with unmodified MVAPICH2 running in a native environment. Evaluation with the NAS Parallel Benchmarks suite shows up to 15% improvement.
Offering IPTV to broadband access subscribers is a key challenge as well as a prospective revenue source for ISPs. Despite of its growing interest, no comprehensive study has presented the traffic details of real-worl...
详细信息
ISBN:
(纸本)9781424420674
Offering IPTV to broadband access subscribers is a key challenge as well as a prospective revenue source for ISPs. Despite of its growing interest, no comprehensive study has presented the traffic details of real-world commercial IPTV services yet. We have measured commercial IPTV traffic via four different residential broadband access networks, namely xDSL, Cable, FTTB, and FTTH. In this paper, we present traffic statistics and insight of the IPTV traffic impact onto these end- subscriber broadband accesses. We also present the mathematical formulas to describe traffic behavior and bandwidth demand in IPTV VoD services.
Here is to propose a demonstration of opportunistic wireless mesh networks for broadband wireless Internet access, supporting real-time services, e.g., of voice and video. The enabling technology is of the large-scale...
详细信息
Here is to propose a demonstration of opportunistic wireless mesh networks for broadband wireless Internet access, supporting real-time services, e.g., of voice and video. The enabling technology is of the large-scale cognitive networking, which opportunistically utilizes network resources including both spectrum bandwidth and mesh radio (station) availability. We further demonstrate that: (1) vast saving in the deployment/planning costs of wireless mesh networks can be achieved by establishing fluid networks without predetermined topology; (2) Better (opportunistic) network resource utilization can be achieved to establish reliable communications over multiple wireless hops. The network performance therefore reaches its instantaneous maximum.
In this paper, we define a model of random dynamical systems(RDS) on graphs and prove that they are actually homogeneous discrete-time Markov chains. Moreover, a necessary and sufficient condition is obtained for th...
详细信息
In this paper, we define a model of random dynamical systems(RDS) on graphs and prove that they are actually homogeneous discrete-time Markov chains. Moreover, a necessary and sufficient condition is obtained for that two state vectors can communicate with each other in a random dynamical system(tLDS).
暂无评论