806 resultados para Conference Graph
Resumo:
Recently, research projects such as PADLR and SWAP have developed tools like Edutella or Bibster, which are targeted at establishing peer-to-peer knowledge management (P2PKM) systems. In such a system, it is necessary to obtain provide brief semantic descriptions of peers, so that routing algorithms or matchmaking processes can make decisions about which communities peers should belong to, or to which peers a given query should be forwarded. This paper proposes the use of graph clustering techniques on knowledge bases for that purpose. Using this clustering, we can show that our strategy requires up to 58% fewer queries than the baselines to yield full recall in a bibliographic P2PKM scenario.
Resumo:
During the 6th International Sustainable Food Planning Conference, the so-called Design LABs partly replaced the regular parallel sessions. The reason for this change was twofold. On the one hand it aims to break through an endless series of parallel presentations, and on the other hand the LAB’s aim was to produce innovative design solutions for increasing the amount of food production in the city. This article describes this experiment to enhance the delivery of urban design concepts, which could substantially produce more food than current models. During the conference each of the parallel sessions half of the time consisted of a design-LAB, in which participants were brought together around a map with the task to design a substantial amount of food productive spaces in the case study site. The results of this experiment were dual: 1. a very committed attitude of delegates to this part of the conference and 2. the design tasks resulted in innovative design results. These results not only emphasise the potential design measures onsite but also pledged for a strong and more intensive connectivity with the city and the landscape around it. This makes it possible to link the supply and use of resources with the typology of the region, hence determining an effective and productive urban agriculture system.
Resumo:
Biological systems exhibit rich and complex behavior through the orchestrated interplay of a large array of components. It is hypothesized that separable subsystems with some degree of functional autonomy exist; deciphering their independent behavior and functionality would greatly facilitate understanding the system as a whole. Discovering and analyzing such subsystems are hence pivotal problems in the quest to gain a quantitative understanding of complex biological systems. In this work, using approaches from machine learning, physics and graph theory, methods for the identification and analysis of such subsystems were developed. A novel methodology, based on a recent machine learning algorithm known as non-negative matrix factorization (NMF), was developed to discover such subsystems in a set of large-scale gene expression data. This set of subsystems was then used to predict functional relationships between genes, and this approach was shown to score significantly higher than conventional methods when benchmarking them against existing databases. Moreover, a mathematical treatment was developed to treat simple network subsystems based only on their topology (independent of particular parameter values). Application to a problem of experimental interest demonstrated the need for extentions to the conventional model to fully explain the experimental data. Finally, the notion of a subsystem was evaluated from a topological perspective. A number of different protein networks were examined to analyze their topological properties with respect to separability, seeking to find separable subsystems. These networks were shown to exhibit separability in a nonintuitive fashion, while the separable subsystems were of strong biological significance. It was demonstrated that the separability property found was not due to incomplete or biased data, but is likely to reflect biological structure.
Resumo:
Quantitatively assessing the importance or criticality of each link in a network is of practical value to operators, as that can help them to increase the network's resilience, provide more efficient services, or improve some other aspect of the service. Betweenness is a graph-theoretical measure of centrality that can be applied to communication networks to evaluate link importance. However, as we illustrate in this paper, the basic definition of betweenness centrality produces inaccurate estimations as it does not take into account some aspects relevant to networking, such as the heterogeneity in link capacity or the difference between node-pairs in their contribution to the total traffic. A new algorithm for discovering link centrality in transport networks is proposed in this paper. It requires only static or semi-static network and topology attributes, and yet produces estimations of good accuracy, as verified through extensive simulations. Its potential value is demonstrated by an example application. In the example, the simple shortest-path routing algorithm is improved in such a way that it outperforms other more advanced algorithms in terms of blocking ratio
Resumo:
Fault location has been studied deeply for transmission lines due to its importance in power systems. Nowadays the problem of fault location on distribution systems is receiving special attention mainly because of the power quality regulations. In this context, this paper presents an application software developed in Matlabtrade that automatically calculates the location of a fault in a distribution power system, starting from voltages and currents measured at the line terminal and the model of the distribution power system data. The application is based on a N-ary tree structure, which is suitable to be used in this application due to the highly branched and the non- homogeneity nature of the distribution systems, and has been developed for single-phase, two-phase, two-phase-to-ground, and three-phase faults. The implemented application is tested by using fault data in a real electrical distribution power system
Resumo:
Slides and an essay on the Web Graph, search engines and how Google calculates Page Rank
Resumo:
The first International Conference on Web Science is taking place in Athens, concurrently with this course. The material here will allow you to get familiar with the conference presentations and posters so that you can write a summary of the conference from a particular topical perspective. (Both the attached HTML summaries are currently in draft form and need to have the preview images and metadata checked.)
Resumo:
This presentation is for students on the 3rd year ECS Multimedia course where students run their own conference, and submit and review papers. In this presentation we look at the different ways that you can participate in an academic conference: Paper, poster and demo, and give some advice on each.
Resumo:
This presentation is for students on the 3rd year ECS Multimedia course where students run their own conference, and submit and review papers. In this presentation we explain the academic review process, look at the structure of a review, and give some examples of positive and negative reviews.
Resumo:
This presentation is for students on the 3rd year ECS Multimedia course where students run their own conference, and submit and review papers. In this presentation we explain how to interpret reviews, find underlying problems, and make changes that will address them.
Resumo:
These are the introduction slides for the Multimedia Systems Course in ECS. They introduce the unusual structure of the course (it is run as a student conference), and explains the shape and purpose of an academic conference.
Resumo:
A PowerPoint presentation that outlines the key issues that people planning a conference poster need to consider.
Resumo:
This is a 9-minute narrated video of the PowerPoint presentation of the same name
Resumo:
*Test* to check feasibility for use for ZeroWIN conference