Big Data Security Management Countermeasures in the Prevention and Control of Computer Network Crime

This paper aims to study the Countermeasures of big data security management in the prevention and control of computer network crime in the absence of relevant legislation and judicial practice. Starting from the concepts and definitions of computer crime and network crime, this paper puts forward the comparison matrix, investigation and statistics method and characteristic measure of computer crime. Through the methods of crime scene investigation, network investigation and network tracking, this paper studies the big data security management countermeasures in the prevention and control of computer network crime from the perspective of criminology. The experimental results show that the phenomenon of low age is serious, and the number of Teenagers Participating in network crime is on the rise. In all kinds of cases, criminals under the age of 35 account for more than 50%.

Characteristic measures of symbolic dynamical systems

A probability measure is a characteristic measure of a topological dynamical system if it is invariant to the automorphism group of the system. We show that zero entropy shifts always admit characteristic measures. We use similar techniques to show that automorphism groups of minimal zero entropy shifts are sofic.

A Comparative Study of Evolutionary Algorithms for Maximizing Reliability of a Flow in Cellular IP Network

The rapid development in technology, witnessed in daily communication, especially in wireless communication, is a good motivation for performance improvement in this field. Cellular IP access network is a suitable environment where a micro mobility of mobile users is implemented and managed. The reliability of Cellular IP network during the communication is an important characteristic measure and must be considered while designing a new model. Evolutionary Algorithms are powerful tools for optimization and problem solving, which require extracting the best solution from a big search space. This chapter explores the reliability issue in Cellular IP of a flow of packets passing through the route from a source to a destination. The main aim of the chapter is to maximize the reliability of the flow passing through a route having number of routers. Two Evolutionary Algorithms (EAs), Genetic Algorithm (GA) and Particle Swarm Optimization (PSO), have been used for this purpose, and a comparative study between the two is performed. Experimental studies of the proposed work have also been performed.

On Asymptotics of Exchangeable Coalescents with Multiple Collisions

We study the number of collisions,Xn, of an exchangeable coalescent with multiple collisions (Λ-coalescent) which starts withnparticles and is driven by rates determined by a finite characteristic measure η(dx) =x−2Λ(dx). Via a coupling technique, we derive limiting laws ofXn, using previous results on regenerative compositions derived from stick-breaking partitions of the unit interval. The possible limiting laws ofXninclude normal, stable with index 1 ≤ α < 2, and Mittag-Leffler distributions. The results apply, in particular, to the case when η is a beta(a− 2,b) distribution with parametersa> 2 andb> 0. The approach taken allows us to derive asymptotics of three other functionals of the coalescent: the absorption time, the length of an external branch chosen at random from thenexternal branches, and the number of collision events that occur before the randomly selected external branch coalesces with one of its neighbours.

On Asymptotics of Exchangeable Coalescents with Multiple Collisions

We study the number of collisions, Xn, of an exchangeable coalescent with multiple collisions (Λ-coalescent) which starts with n particles and is driven by rates determined by a finite characteristic measure η(dx) = x−2Λ(dx). Via a coupling technique, we derive limiting laws of Xn, using previous results on regenerative compositions derived from stick-breaking partitions of the unit interval. The possible limiting laws of Xn include normal, stable with index 1 ≤ α < 2, and Mittag-Leffler distributions. The results apply, in particular, to the case when η is a beta(a − 2, b) distribution with parameters a > 2 and b > 0. The approach taken allows us to derive asymptotics of three other functionals of the coalescent: the absorption time, the length of an external branch chosen at random from the n external branches, and the number of collision events that occur before the randomly selected external branch coalesces with one of its neighbours.

Characterization and Modeling of CNT Based Actuators

In order to get an understanding of the general characteristics of Carbon Nanotube (CNT) based actuators, the system response of the actuator was analyzed. Special techniques were developed in order to generate a reproducible characteristic measure for the material: the R-Curve. On top, the dynamic response of the system was evaluated in different states of the actuator. A model was generated to capture the general behavior of the system. At last an actuator incorporating solid electrolyte was built and tested, showing similar characteristics as the actuator in aqueous electrolyte.