Smart agriculture systems with combinations of advanced technologies are used in an attempt to increase the competence of certain farming activities and the standard of living for farm employees by reducing significant labor and tedious tasks. Internet-of-things-based sensors are capable of providing such information about smart agriculture and then acting upon predictions using data analysis. The proposed methodology works alongside a cloud-based server and a mobile-based device (ideally an Android/iOS device) to assist the user in regulating the standing of the plant as monitored by a mix of software packages and hardware devices. Our system detects changes in the moisture, temperature, and light intensity conditions in and around the plant and performs a learning-based call to supply necessary irrigation and illumination to plants. It permits the user to update, manage, and monitor using wireless sensing element networks. The sensors measure the aforementioned parameters and store the data within the cloud, which users can access at any time from anywhere. Farmers will have access to the most up-to-date knowledge so that they can act accordingly and make modifications as needed. This smart planting has become a core tool associated with cost-effective technology in agricultural modernization technologies. The proposed smart modern agriculture tool can be used to monitor climatic factors such as temperature, moisture, and virtually all environmental parameters relevant to the growth of plants.
Community effect and inter community communication and relationship is one of the important aspects of social network analysis. Studying community detection and analyzing the behaviors of the communities can give us information about the group as well as about the actors in the group. Using graph mining techniques, knowledge extraction is possible from the community graph. In our work, we started with the discussion on related definitions and some of the available algorithms for community detection in social network. Further, we propose a new and simple algorithm for finding the community detection in a social network using graph techniques. An example verifies about the strength of the proposed algorithm.
The development of several popular social networks in recent days and publication of social network data has led to the danger of disclosure of sensitive information of individuals. This necessitated the preservation of privacy before the publication of such data. There are several algorithms developed to preserve privacy in micro data. But these algorithms cannot be applied directly as in social networks the nodes have structural properties along with their labels. k-anonymity and l-diversity are efficient tools to anonymise micro data. So efforts have been made to find out similar algorithms to handle social network anonymisation. In this paper we propose an algorithm which can be used to achieve k-anonymity and l-diversity in social network anonymisation. This algorithm is based upon some existing algorithms developed in this direction.
1 January 2008 in Lecture Notes in Computer Science
This paper focuses on solving the problem of classification and clustering in social network by using Rough Set. When the data set consists of missing or uncertain data then the Rough set is proved to be an efficient tool. To solve a problem under the domain of social network, the problem must satisfy the fundamental property of rough set i.e., the attribute of the problem must holds true for equivalence relation. Hence, before implementing rough set to the specific problem of social network, it must be redefined in a way that properties of transitive, symmetric and reflexive should holds true. In this paper, we have studied on the concept of Fiksel's societal network and used it for redefining the social network problem in terms of equivalence relationships. Further, we had defined the Social network in terms of graph theory and mathematical relations. We had proceeded further in defining the Fiksel's societal network and social network with respect to rough set. Fiksel had defined the social network in terms of structural equivalence. We have discussed on the limitation of Rough set and observed that use of Covering Based Rough Set as an extension of Pawlak's rough set seems to be a better alternative. There are six types of covering based rough set. To keep continuity in this paper, we have mentioned about Covering based rough sets. Covering based rough set extends from partitioning in rough sets to covering of the universe and is flexible, when compared with rigid equivalence relation.
This paper describes the method of representation of the Dynamic Social Network. Authors begin the discussion with a formal introduction where they had brought out the need of the emergence of the Dynamic Social Network and its application in the various fields of science. Authors has carried forward the discussion with description of the two models of the Dynamic Social Network. Portions of the paper is a review work. In the followed section of this work, discussion is carried about how these models can be represented as one of the basic type of Finite State Machine. Finally the paper concludes with a real life example and the application of Dynamic Social Network in MANETS