Cluster-based mechanisms in ad hoc networks not only make a large network appear smaller, but more importantly. In our scheme, each MN is disseminated to predict its own mobility pattern, and this information is disseminated to its neighbors using a scalable clustering algorithm. The work proposes a prediction based Clustering Approach for Route Discovery Protocol (CARDP)using Mobile Agent in M...

This paper aims to address the problem of shape clustering by discovering the common structure which captures the intrinsic structural information of shapes belonging to the same cluster. It is based on a skeleton graph, named common structure skeleton graph (CSSG), which expresses possible correspondences between nodes of the individual skeletons of the cluster. To construct the CSSG, we deriv...

We present tight bounds and heuristics for personalized, multi-product pricing problems. Under mild conditions we show that offering a non-personalize price in the direction of positive vector (factor) has profit guarantee relative to optimal personalized pricing. An non-personalized is choice factor, when known. Using factor with equal components results uniform exceedingly sufficient bound ho...

To increase the analytical tractability of lattice stochastic spatial population models, several approximations have been developed. The pair-edge approximation is a moment-closure method that is effective in predicting persistence criteria and invasion speeds on a homogeneous lattice. Here we evaluate the effectiveness of the pair-edge approximation on a spatially heterogeneous lattice in whic...

An innovative trajectory strategy was proposed and accessed for wire arc additive manufacturing (WAAM), applicable to different more complex geometries, rather than being a single solution. This strategy, named Pixel, can be defined as multitask procedure carry out optimized path planning, whose operation is made through computational algorithms (heuristics), with accessible resources tolerable...

We describe clustering experiments for cross-document coreference for the first Web People Search Evaluation. In our experiments we apply agglomerative clustering to group together documents potentially referring to the same individual. The algorithm is informed by the results of two different summarization strategies and an offthe-shelf named entity recognition component. We present different ...

This paper overviews BUPTTeam’s participation in the Entity Linking task. We tackle the problem of entity disambiguation for large collections of online pages. Specifically, Named Entity Disambiguation is the task to polish the ambiguities of named entities. Several methods have been proposed to solve this problem, but they are largely only focused on one disambiguation mean, Entity Linking or ...

Word clusters have been empirically shown to o‚er important performance improvements on various tasks. Despite their importance, their incorporation in the standard pipeline of feature engineering relies more on a trial-and-error procedure where one evaluates several hyper-parameters, like the number of clusters to be used. In order to beŠer understand the role of such features we systematicall...

A statistical description of heavy particles suspended in incompressible rough self-similar flows is developed. It is shown that, differently from smooth flows, particles do not form fractal clusters. They rather distribute inhomogeneously with a statistics that only depends on a local Stokes number, given by the ratio between the particles' response time and the turnover time associated with t...

Syntactic regularities are repetitive structures in the asserted axioms of an ontology represented as generalisations, which are axioms with variables. The Regularity Inspector for Ontologies (RIO) is a framework for detecting such regularities in ontologies. Established clustering techniques are applied to the signature of the ontology to detect clusters of similar entities. Clustering depends...