Data Mining - Concepts and Techniques.

Power Aware Routing in Mobile Ad Hoc Networks

In this chapter, you will see how the simplex method simplifies when it is applied to a class of optimization problems that are known as “network flow models.” You will also see that if a network flow model has “integer-valued data,” the simplex method finds an optimal solution that is integer-valued.

Flows in Networks

The π-Calculus: A theory of mobile processes by Davide Sangiorgi and David Walker Formal methods have formed the foundation of Computer Science since its inception. Although, initially these formal methods dealt with processes and systems on an individual basis, the paradigm has shifted with the dawn of the age of computer networks. When dealing with systems with interconnected, communicating, dependent, cooperative, and competitive components, the older outlook of analyzing and developing singular systems—and the tools that went with it—were hardly suitable. This led to the development of theories and tools that would support the new paradigm. On the tools end, the development has been widespread and satisfactory: programming languages, development frameworks, databases, and even end-user software products such as word processors, have gained network-awareness. However on the theoretical end, the development has been far less satisfactory. The major work was done by Robin Milner, Joachim Parrow, and David Walker who developed the formalism known as π-calculus in 1989. π-calculus is a process calculus that treats communication between its components as the basic form of computation. It has been quite successful as a foundation of several other calculi in the field and as Milner puts it, it has become common to express ideas about interactions and mobility in variants of the calculus. Introduction The current book serves as a comprehensive reference to π-calculus. Besides Milner's own book on the subject, this is the only other book-length publication on the topic. In many ways, it is much more comprehensive than Milner's: a much wider area of topics are dealt with and in more detail as well. Contents The book is split into seven part. The first part presents the basic theory of π-calculus. However, basic does not mean concise: every topic is discussed in great detail. The section on bisimulation is particularly intensive and provides several insights about the motivation for the theory. Part two discusses several variants of the original calculus. By varying several characteristics of the calculus, such as whether a process can communicate with more than processes at a time, we can obtain these variants. A number of interesting properties of the language are studied by the other when discussing these variants. As can be understood from the title, the calculus' contribution to analyzing mobile processes is a major topic, and it is dealt with extensively starting from part three. The basics are introduced by the way of a sophisticated typing system whose application in speciying complex processes is presented in part four. Part five looks at higher-order π-calculus in which composed systems are considered as first-class citizens. Part six is one of the best in the book and discusses the relation between π-calculus and lambda-calculus, which is an older and more basic calculus. Finally part seven shows how π-calculus can be employed in studying practical, modern software engineering concepts such as object-oriented programming. Impressions One of my disappointments with this book is in how often the reader is left perplexed with some of the theoretical developments, specially in part three. π-calculus is a complicated topic, even for the graduate student audience to which this book is directed, and the author would have done much better by reducing the number of topics and instead focusing on more lucid and detailed explanations. There are several experimental digressions throughout the book, which although interesting, take away from some of the momentum of sequential study. For example, topics such as comparison and encoding of one language to another could be easily moved to a separate section in order to make the content more suitable for self-study. Another issue is the little effort towards making the connection from the theoretical to the practical. The main reason why formal methods have not been adopted in mainstream software development pracitces is that often it is unclear to developers how formalisms can contribute towards the software engineering process. The book would have served its purpose much better if it had spent part of eah chapter discussing the practical application of that chapter's content. For example, congruence checking and bisimulation can be incredbily exciting topics for programmers to learn if they can see practical applications of such powerful techniques. Beyond the above criticism, the book is absolutely indispensible to students and researchers in the field of formal methods. Currently it serves as the primary reference for anyone who wishes to learn the various aspects of π-calculus in detail. Raheel Ahmad

The Ï-Calculus: A theory of mobile processes

More particularly, calculations are developed and examined to reduce the entire quantity of Wireless access points as well as their locations in almost any given atmosphere while with the throughput needs and the necessity to ensure every place in the area can achieve a minimum of k APs. This paper concentrates on using Wireless for interacting with and localizing the robot. We've carried out thorough studies of Wireless signal propagation qualities both in indoor and outside conditions, which forms the foundation for Wireless AP deployment and communication to be able to augment how human operators communicate with this atmosphere, a mobile automatic platform is developed. Gas and oil refineries could be a harmful atmosphere for various reasons, including heat, toxic gasses, and unpredicted catastrophic failures. When multiple Wireless APs are close together, there's a possible for interference. A graph-coloring heuristic can be used to find out AP funnel allocation. Additionally, Wireless fingerprinting based localization is developed. All of the calculations implemented are examined in real life situations using the robot developed and answers are promising. For example, within the gas and oil industry, during inspection, maintenance, or repair of facilities inside a refinery, people might be uncovered to seriously high temps to have a long time, to toxic gasses including methane and H2S, and also to unpredicted catastrophic failures.

/pdf/internet-of-vehicles-from-intelligent-grid-to-autonomous-pma0tn3ofd.pdf

Internet of Vehicles: From Intelligent Grid to Autonomous Cars and Vehicular Clouds

Model-based intrusion detection and knowledge discovery are combined to cluster and classify P2P botnet traffic and other malignant network activity by using a Self-Organizing Map (SOM) self-trained on denied Internet firewall log entries. The SOM analyzed new firewall log entries in a case study to classify similar network activity, and discovered previously unknown local P2P bot traffic and other security issues.

/pdf/a-self-organizing-map-and-its-modeling-for-discovering-df3mfhhrej.pdf

A self-organizing map and its modeling for discovering malignant network traffic

ive text summarization is the task of generating meaningful summary from a given document (short or long). This is a very challenging task for longer documents, since they suffer from repetitions (redundancy) when the given document is long and the generated summary should contain multi-sentences. In this paper we present an approach for applying generative adversarial networks in abstractive text summarization tasks with a novel time-decay attention mechanism. The data generator is modeled as a stochastic policy in reinforcement learning. The generator's goal is to generate summaries which are difficult to be discriminated from real summaries. The discriminator aims to estimate the probability that a summary came from the training data rather than the generator to guide the training of the generative model. This framework corresponds to a minimax two-player game. Qualitatively and quantitatively experimental results (human evaluations and ROUGE scores) show that our model can generate more relevant, less repetitive, grammatically correct, preferable by humans and is promising in solving the abstractive text summarization task.

Generative Adversarial Network with Policy Gradient for Text Summarization

We propose a new approach towards particle swarm optimization named agent-based PSO. The swarm is elevated to the status of a multi-agent system by giving the particles more autonomy, an asynchronous execution, and superior learning capabilities. The problem space is modeled as an environment which forms clusters of points that are known to be non-optimal and this transforms the environment into a more dynamic and informative resource

/pdf/a-multi-agent-based-approach-for-particle-swarm-optimization-1hlb27otir.pdf

A Multi-Agent Based Approach for Particle Swarm Optimization

Summary In this paper, we present a single phase non-blocking coordinated checkpointing algorithm suitable for mobile computing environments. The distinct advantages that make the proposed algorithm suitable for distributed mobile computing systems are the following. It produces a consistent set of checkpoints, without the overhead of taking temporary checkpoints; the algorithm makes sure that only minimum number of processes are required to take checkpoints in any execution of the checkpointing algorithm; it uses very few control messages and the participating processes are interrupted less number of times. Performance analysis shows that our proposed approach outperforms some existing important related works.

A New High Performance Checkpointing Approach for Mobile Computing Systems

In this paper, we present a new approach to designing a scalable, hierarchical overlay P2P system which provides highly efficient data lookup operations as well fault tolerance. Instead of using a distributed hash table (DHT) based approach, we propose the use of Linear Diophantine Equation (LDE) as the mathematical basis to realize a hierarchical P2P architecture. LDE provides a significantly lighter weight mechanism to create and maintain the overlaid P2P structure as compared to DHT based schemes. To the best of our knowledge, ours is the first work that proposes the use of LDEs in designing P2P topologies. In our proposed hierarchical P2P architecture, the number of hops required to search for a resource is independent of the number of nodes/peers in the network n and is instead bounded by (1 + r/2), r being the number of distinct resource types. For most practical purposes, r is significantly smaller than n and hence our proposed architecture provides a highly efficient resource look-up procedure. We have also presented algorithms for handling of new resources and peers joining and leaving the P2P network and fault tolerance in the event of peers crashing or leaving.

Bidyut Gupta

Papers

A self-organizing map and its modeling for discovering malignant network traffic

Generative Adversarial Network with Policy Gradient for Text Summarization

A Multi-Agent Based Approach for Particle Swarm Optimization

A New High Performance Checkpointing Approach for Mobile Computing Systems

LDEPTH: A low diameter hierarchical P2P network architecture