108,325 research outputs found
Link stability estimation based on link connectivity changes in mobile ad-hoc networks
No full textDear Wang,
Re: Link Stability Estimation Based on Link Connectivity Changes in Mobile Ad-hoc Networks
I have not been able to assess if this is an author version peer-reviewed or is it an author version non peer reviewed. Could you please clarify this so I can proceed to add your paper to Spiral. Spiral digital repository only accept peer-reviewed papers.
30/11/12 author has confirmed peer reviewe
An initial exploration of the link relationship between UK university Web sites.
No full textAggregates of links are of interest to information scientists in the same way as citation counts are: as potential sources of data from which new knowledge can be mined. Builds on the recent discovery of a correlation between a Web link count measure and the research quality of British universities by applying a range of multivariate statistical techniques to counts of links between pairs of universities. This represents an initial attempt at developing an understanding of this phenomenon. Extracts plausible results. Also identifies outliers in the data by the techniques, some of which were verified by being tracked down to identifiable Web phenomena. This is an important outcome because successful anomaly identification is a precondition to more effective analysis of this kind of data. The identification of groupings is encouraging evidence that Web links between universities can be mined for significant results, although it is clear that more methodological development is needed, if any but the simplest patterns are to be extracted. Finally, based upon the types of patterns extracted, argues that none of the methods used are capable of fully analysing link structures on their own
A Binary Linear Programming-Based K-Means Algorithm For Clustering with Must-Link and Cannot-Link Constraints
No full textClustering is probably the most extensively studied problem in unsupervised learning. Traditional clustering algorithms assign objects to clusters exclusively based on features of the objects. Constrained clustering is a generalization of traditional clustering where additional information about a dataset is given in the form of constraints. It has been shown that the clustering accuracy can be improved substantially by accounting for these constraints. We consider the constrained clustering problem where additional information is given in the form of must-link and cannot-link constraints for some pairs of objects. Various algorithms have been developed for this specific clustering problem. We propose a binary linear programming-based k-means approach that can consider must-link and cannot-link constraints. In a computational experiment, we compare the proposed algorithm to the DILS CC algorithm, which represents the state-of-the-art. Our results on 75 problem instances indicate that the proposed algorithm delivers better clusterings than the DILS CC algorithm in much shorter running time
k-link shortest paths in weighted subdivisions
No full textAbstract. We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the path. We prove structural properties of optimal paths and utilize these results to obtain approximation algorithms that yield a path having O(k) links and weighted length at most (1 + ǫ) times the weighted length of an optimal k-link path, for any fixed ǫ> 0. Some of our results make use of a new solution for the 1-link case, based on computing optimal solutions for a special sum-of-fractionals (SOF) problem. We have implemented a system, based on the CORE library, for computing optimal 1-link paths; we experimentally compare our new solution with a previous method for 1-link optimal paths based on a prune-and-search scheme.
K-link+
No full textThis chapter introduces a distributed framework for OKM (Organizational Knowledge Management) which allows IKWs (Individual Knowledge Workers) to build virtual communities that manage and share knowledge within workspaces. The proposed framework, called K-link+, supports the emergent way of doing business of IKWs, which allows users to work at any time from everywhere, by exploiting the VO (Virtual Office) model. Moreover, since semantic aspects represent a key point in dealing with organizational knowledge, K-link+ is supported by an ontological framework composed of: (i) an UO (Upper Ontology), which defines a shared common background on organizational knowledge domains; (ii) a set of UO specializations, namely Workspace Ontologies or Personal Ontologies, that can be used to manage and search content; (iii) a set of COKE (Core Organizational Knowledge Entities) which provides a shared definition of human resources, technological resources, knowledge objects, services; and (iv) an annotation mechanism that allows users to create associations between ontology concepts and knowledge objects. K-link+ features a hybrid (partly centralized and partly distributed) protocol to guarantee the consistency of shared knowledge and a distributed voting mechanism to foster the evolution of ontologies on the basis of user needs.</jats:p
K-link+
No full textThis chapter introduces a distributed framework for OKM (Organizational Knowledge Management) which allows IKWs (Individual Knowledge Workers) to build virtual communities that manage and share knowledge within workspaces. The proposed framework, called K-link+, supports the emergent way of doing business of IKWs, which allows users to work at any time from everywhere, by exploiting the VO (Virtual Office) model. Moreover, since semantic aspects represent a key point in dealing with organizational knowledge, K-link+ is supported by an ontological framework composed of: (i) an UO (Upper Ontology), which defines a shared common background on organizational knowledge domains; (ii) a set of UO specializations, namely Workspace Ontologies or Personal Ontologies, that can be used to manage and search content; (iii) a set of COKE (Core Organizational Knowledge Entities) which provides a shared definition of human resources, technological resources, knowledge objects, services; and (iv) an annotation mechanism that allows users to create associations between ontology concepts and knowledge objects. K-link+ features a hybrid (partly centralized and partly distributed) protocol to guarantee the consistency of shared knowledge and a distributed voting mechanism to foster the evolution of ontologies on the basis of user needs. </jats:p
Efficient Algorithm for the k-Means Problem with Must-Link and Cannot-Link Constraints
No full textEfficient Algorithm for the k-Means Problem with Must-Link and Cannot-Link Constraint
Link Services or Link Agents?
No full textA general link service for the WWW has been used within an Electronic Libraries' project. Experience using it shows that as the links become increasingly interesting to the user, processing them becomes increasingly expensive. Eventually textual analysis, ontological services and remote database lookups conflict with the goal of prompt delivery of documents. This paper summarizes the history of the Link Service software behind the Open Journal project together with the kind of links that it has been used to produce. Building on this work it then discusses how the paradigm, architecture and user interface of the DLS have been newly modified both in response to user feedback and also to allow more linking facilities to be added to the WWW environment. We then introduce AgentDLS, an agent-style system that offers suggestions to help the user's browsing and information discovery activities
Link level modelling techniques for analysing the configuration of link adaptation algorithms in mobile radio networks
No full textThe operation of Link Adaptation algorithms is based on channel quality estimates. It is therefore important to analyse the performance of such algorithms with link level models that properly capture the channel conditions and dynamics. Previous research [1] concluded that the use of simple link level models does not give an accurate prediction of the estimated performance of Link Adaptation algorithms. Following this previous work, this paper shows that the link level model considered for the study of Link Adaptation algorithms can also influence the decisions regarding the optimum configuration of the algorithm
- …
