An adaptive cluster based routing scheme for mobile wireless sensor networks

Clustering schemes improve energy efficiency of wireless sensor networks. The inclusion of mobility as a new criterion for the cluster creation and maintenance adds new challenges for these clustering schemes. Cluster formation and cluster head selection is done on a stochastic basis for most of the algorithms. In this paper we introduce a cluster formation and routing algorithm based on a mobility factor. The proposed algorithm is compared with LEACH-M protocol based on metrics viz. number of cluster head transitions, average residual energy, number of alive nodes and number of messages lost

Energy Aware Cluster-based Multihop Routing Protocol for Sensor Networks

Clustering combined with multihop communication is a promising solution to cope with the energy requirements of large scale Wireless Sensor Networks. In this work, a new cluster based routing protocol referred to as Energy Aware Cluster-based Multihop (EACM) Routing Protocol is introduced, with multihop communication between cluster heads for transmitting messages to the base station and direct communication within clusters. We propose EACM with both static and dynamic clustering. The network is partitioned into near optimal load balanced clusters by using a voting technique, which ensures that the suitability of a node to become a cluster head is determined by all its neighbors. Results show that the new protocol performs better than LEACH on network lifetime and energy dissipation

A nature-inspired approach to speed up optimum-path forest clustering and its application to intrusion detection in computer networks

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Knowledge Flows and Networks: the Interplay between Local and Global Linkages within Bangalore IT Cluster

This doctoral work gains deeper insight into the dynamics of knowledge flows within and across clusters, unfolding their features, directions and strategic implications. Alliances, networks and personnel mobility are acknowledged as the three main channels of inter-firm knowledge flows, thus offering three heterogeneous measures to analyze the phenomenon. The interplay between the three channels and the richness of available research methods, has allowed for the elaboration of three different papers and perspectives. The common empirical setting is the IT cluster in Bangalore, for its distinguished features as a high-tech cluster and for its steady yearly two-digit growth around the service-based business model. The first paper deploys both a firm-level and a tie-level analysis, exploring the cases of 4 domestic companies and of 2 MNCs active the cluster, according to a cluster-based perspective. The distinction between business-domain knowledge and technical knowledge emerges from the qualitative evidence, further confirmed by quantitative analyses at tie-level. At firm-level, the specialization degree seems to be influencing the kind of knowledge shared, while at tie-level both the frequency of interaction and the governance mode prove to determine differences in the distribution of knowledge flows. The second paper zooms out and considers the inter-firm networks; particularly focusing on the role of cluster boundary, internal and external networks are analyzed, in their size, long-term orientation and exploration degree. The research method is purely qualitative and allows for the observation of the evolving strategic role of internal network: from exploitation-based to exploration-based. Moreover, a causal pattern is emphasized, linking the evolution and features of the external network to the evolution and features of internal network. The final paper addresses the softer and more micro-level side of knowledge flows: personnel mobility. A social capital perspective is here developed, which considers both employees’ acquisition and employees’ loss as building inter-firm ties, thus enhancing company’s overall social capital. Negative binomial regression analyses at dyad-level test the significant impact of cluster affiliation (cluster firms vs non-cluster firms), industry affiliation (IT firms vs non-IT fims) and foreign affiliation (MNCs vs domestic firms) in shaping the uneven distribution of personnel mobility, and thus of knowledge flows, among companies.

Improving availability of mobile networks using a cluster routing protocol with redundant cluster head

We show a cluster based routing protocol in order to improve the convergence of the clusters and of the network it is proposed to use a backup cluster head. The use of a event discrete simulator is used for the implementation and the simulation of a hierarchical routing protocol called the Backup Cluster Head Protocol (BCHP). Finally it is shown that the BCHP protocol improves the convergence and availability of the network through a comparative analysis with the Ad Hoc On Demand Distance Vector (AODV)[1] routing protocol and Cluster Based Routing Protocol (CBRP)[2]

Nonparametric generalized belief propagation based on pseudo-junction tree for cooperative localization in wireless networks

Non-parametric belief propagation (NBP) is a well-known message passing method for cooperative localization in wireless networks. However, due to the over-counting problem in the networks with loops, NBP’s convergence is not guaranteed, and its estimates are typically less accurate. One solution for this problem is non-parametric generalized belief propagation based on junction tree. However, this method is intractable in large-scale networks due to the high-complexity of the junction tree formation, and the high-dimensionality of the particles. Therefore, in this article, we propose the non-parametric generalized belief propagation based on pseudo-junction tree (NGBP-PJT). The main difference comparing with the standard method is the formation of pseudo-junction tree, which represents the approximated junction tree based on thin graph. In addition, in order to decrease the number of high-dimensional particles, we use more informative importance density function, and reduce the dimensionality of the messages. As by-product, we also propose NBP based on thin graph (NBP-TG), a cheaper variant of NBP, which runs on the same graph as NGBP-PJT. According to our simulation and experimental results, NGBP-PJT method outperforms NBP and NBP-TG in terms of accuracy, computational, and communication cost in reasonably sized networks.

An Adaptation of the Hoshen-Kopelman Cluster Counting Algorithm for Honeycomb Networks

We develop a simplified implementation of the Hoshen-Kopelman cluster counting algorithm adapted for honeycomb networks. In our implementation of the algorithm we assume that all nodes in the network are occupied and links between nodes can be intact or broken. The algorithm counts how many clusters there are in the network and determines which nodes belong to each cluster. The network information is stored into two sets of data. The first one is related to the connectivity of the nodes and the second one to the state of links. The algorithm finds all clusters in only one scan across the network and thereafter cluster relabeling operates on a vector whose size is much smaller than the size of the network. Counting the number of clusters of each size, the algorithm determines the cluster size probability distribution from which the mean cluster size parameter can be estimated. Although our implementation of the Hoshen-Kopelman algorithm works only for networks with a honeycomb (hexagonal) structure, it can be easily changed to be applied for networks with arbitrary connectivity between the nodes (triangular, square, etc.). The proposed adaptation of the Hoshen-Kopelman cluster counting algorithm is applied to studying the thermal degradation of a graphene-like honeycomb membrane by means of Molecular Dynamics simulation with a Langevin thermostat. ACM Computing Classification System (1998): F.2.2, I.5.3.

Efficient Learning of Bayesian Networks with Bounded Tree-width

Learning Bayesian networks with bounded tree-width has attracted much attention recently, because low tree-width allows exact inference to be performed efficiently. Some existing methods \cite{korhonen2exact, nie2014advances} tackle the problem by using $k$-trees to learn the optimal Bayesian network with tree-width up to $k$. Finding the best $k$-tree, however, is computationally intractable. In this paper, we propose a sampling method to efficiently find representative $k$-trees by introducing an informative score function to characterize the quality of a $k$-tree. To further improve the quality of the $k$-trees, we propose a probabilistic hill climbing approach that locally refines the sampled $k$-trees. The proposed algorithm can efficiently learn a quality Bayesian network with tree-width at most $k$. Experimental results demonstrate that our approach is more computationally efficient than the exact methods with comparable accuracy, and outperforms most existing approximate methods.

Short-term wind power forecast based on cluster analysis and artificial neural networks

[EN]In this paper an architecture for an estimator of short-term wind farm power is proposed. The estimator is made up of a Linear Machine classifier and a set of k Multilayer Perceptrons, training each one for a specific subspace of the input space. The splitting of the input dataset into the k clusters is done using a k-means technique, obtaining the equivalent Linear Machine classifier from the cluster centroids...

Guiding Monte Carlo tree searches with neural networks in the game of go

A dissertation submitted in fulfillment of the requirements to the degree of Master in Computer Science and Computer Engineering

Tree regularized neural networks for key point analysis

This thesis contributes to the ArgMining 2021 shared task on Key Point Analysis. Key Point Analysis entails extracting and calculating the prevalence of a concise list of the most prominent talking points, from an input corpus. These talking points are usually referred to as key points. Key point analysis is divided into two subtasks: Key Point Matching, which involves assigning a matching score to each key point/argument pair, and Key Point Generation, which consists of the generation of key points. The task of Key Point Matching was approached using different models: a pretrained Sentence Transformers model and a tree-constrained Graph Neural Network were tested. The best model was the fine-tuned Sentence Transformers, which achieved a mean Average Precision score of 0.75, ranking 12 compared to other participating teams. The model was then used for the subtask of Key Point Generation using the extractive method in the selection of key point candidates and the model developed for the previous subtask to evaluate them.

Mixed rain forest in southeastern Brazil: tree species regeneration and floristic relationships in a remaining stretch of forest near the city of Itaberá, Brazil

The aim of this work was to evaluate the floristic composition, richness, and diversity of the upper and lower strata of a stretch of mixed rain forest near the city of Itaberá, in southeastern Brazil. We also investigated the differences between this conservation area and other stretches of mixed rain forest in southern and southeastern Brazil, as well as other nearby forest formations, in terms of their floristic relationships. For our survey of the upper stratum (diameter at breast height [DBH] > 15 cm), we established 50 permanent plots of 10 × 20 m. Within each of those plots, we designated five, randomly located, 1 × 1 m subplots, in order to survey the lower stratum (total height > 30 cm and DBH < 15 cm). In the upper stratum, we sampled 1429 trees and shrubs, belonging to 134 species, 93 genera, and 47 families. In the lower stratum, we sampled 758 trees and shrubs, belonging to 93 species, 66 genera, and 39 families. In our floristic and phytosociological surveys, we recorded 177 species, belonging to 106 genera and 52 families. The Shannon Diversity Index was 4.12 and 3.5 for the upper and lower strata, respectively. Cluster analysis indicated that nearby forest formations had the strongest floristic influence on the study area, which was therefore distinct from other mixed rain forests in southern Brazil and in the Serra da Mantiqueira mountain range.

Tree performance and fruit yield and quality of `Okitsu` Satsuma mandarin grafted on 12 rootstocks

The citriculture in Brazil, as well as in other important regions in the world, is based on very few mandarin cultivars. This fact leads to a short harvest period and higher prices for off-season fruit. The `Okitsu` Satsuma (Citrus unshiu Marc.) is among the earliest ripening mandarin cultivars and it is considered to be tolerant to, citrus canker (Xanthomonas citri subsp. citri Schaad et al.) and to citrus variegated chlorosis (Xylella fastidiosa Wells et al.). Despite having regular fruit quality under hot climate conditions, the early fruit maturation and absence of seeds of `Okitsu` fruits are well suited for the local market in the summer(December through March), when the availability of citrus fruits for fresh consumption is limited. Yet, only a few studies have been conducted in Brazil on rootstocks for `Okitsu`. Consequently, a field trial was carried out in Bebeclouro, Sao Paulo State, to evaluate the horticultural performance of `Okitsu` Satsuma mandarin budded onto 12 rootstocks: the citrandarin `Changsha` mandarin (Citrus reticulata Blanco) x Poncirus trifoliata `English Small`: the hybrid Rangpur lime (Citrus limonia Osbeck) x `Swingle` citrumelo (P. trifoliata (L.) Raf. x Citrus paradisi Macfad.); the trifoliates (P. trifoliata (L) Raf)`Rubidoux`,`FCAV` and `Flying Dragon`(P. trifoliata var. monstrosa); the mandarins `Sun Chu Sha Kat`(C. reticulata Blanco) and `Sunki`(Citrus sunki (Hayata) Hort. ex. Tanaka); the Rangpur limes (C. limonia Osbeck) `Cravo Limeira` and `Cravo FCAV`;`Carrizo` citrange (Citrus sinensis x P. trifoliata), `Swingle` citrumelo (P. trifoliata x C. paradisi), and `Orlando` tangelo (C. paradisi x Citrus tangerina cv. `Dancy`). The experimental grove was planted in 2001, using a 6 m x 3 m spacing, in a randomized block design. No supplementary irrigation was applied. Fruit yield, canopy volume, and fruit quality were assessed for each rootstock. A cluster multivariate analysis identified three different rootstock pairs with similar effects on plant growth, yield and fruit quality of `Okitsu` mandarin. The `Flying Dragon `trifoliate had a unique effect over the `Okitsu` trees performance, inducing lower canopy volume and higher yield efficiency and fruit quality, and might be suitable for high-density plantings. The `Cravo Limeira` and `Cravo FCAV` Rangpur limes induced early-ripening of fruits, with low fruit quality. `Sun Chu Sha Kat` and `Sunki` mandarins and the `Orlando` tangelo conferred lower yield efficiency and less content of soluble solids for the latter rootstock. (C) 2009 Elsevier B.V. All rights reserved.