Data Visualization Software | Tulip MACOSPOL The DIMES project | Join the journey to map the Internet, download the DIMES agent today EgoNet | Download EgoNet software for free 1+1=1 : la formule des réseaux On parle de réseau lorsque des éléments interagissent entre eux au sein d’un groupe. Ils sont étudiés aussi bien par les sciences humaines et sociales, les sciences du vivant et de la terre, que les sciences et techniques de l'information et de la communication. De façon étonnante, tous ces réseaux apparemment distincts ont certains points communs. Ce texte cherche à proposer une synthèse accessible à des non-spécialistes de ce qui est commun (mais aussi différent) dans les différents types de réseaux. La triade « constituants, règles, réseau » Souvent nous tentons d’aborder un réseau social, technique ou autre par le réductionnisme : en étudiant le comportement de ses constituants. Deux hommes veulent se confronter au tir à la corde. Les constituants plus les règles donnent le réseau Le réseau peut être déterminé par ses constituants et ses règles. En fait il faut considérer les trois aspects avec deux d’entre eux déterminant le troisième. La perte (partielle) de notre capacité à prévoir
Risk Controversies visualized Last Update: Oct. 5th 2011 New brochure (german version) available online. Download PDF (2MB) The aim of the reseach project is to develop an internet based visualisation of risk related controversies as argumentation maps on the basis of two exemplary case studies: dietary supplements and nanoscale particles. These argumentation maps will be developed by an interdisciplinary research team of sociologists, natural scientists, computer scientists as well as partners and advisors from industry, poltics and academia. The research project is funded by the Federal Ministry for Education and Research (BMBF) within the social ecological research (SÖF) programme "Strategies to Cope with Systemic Risks". Since 2008 the Risk-Cartography is part of the far reaching EU-Project MACOSPOL - Mapping Controversies on Science for Politics .
Math algorithm tracks crime, rumours, epidemics to source (Phys.org) -- A team of EPFL scientists has developed an algorithm that can identify the source of an epidemic or information circulating within a network, a method that could also be used to help with criminal investigations. Investigators are well aware of how difficult it is to trace an unlawful act to its source. The job was arguably easier with old, Mafia-style criminal organizations, as their hierarchical structures more or less resembled predictable family trees. In the Internet age, however, the networks used by organized criminals have changed. Innumerable nodes and connections escalate the complexity of these networks, making it ever more difficult to root out the guilty party. EPFL researcher Pedro Pinto of the Audiovisual Communications Laboratory and his colleagues have developed an algorithm that could become a valuable ally for investigators, criminal or otherwise, as long as a network is involved. The validity of this method thus has been proven a posteriori.
Panorama d'outils de recherche d'informations gratuits et en ligne Jeudi 23 avril 2009 4 23 /04 /Avr /2009 15:30 Télécharger le livre blanc : Panorama d'outils de recherche d'informations gratuits et en ligne [PDF de 6,6 Mo] On pense qu’il n’a jamais été aussi facile de rechercher de l’information sur internet. En réalité, comme le dit Christophe Deschamps dans la préface de ce livre blanc « il n’a jamais été plus difficile de trouver la bonne information sur internet… Celle qui permet de mieux comprendre le présent, d’éclairer l’avenir, de valider une idée innovante ». Ce livre blanc a pour ambition de vous présenter un certain nombre d’outils qui vous permettrons de mieux rechercher sur internet, c'est-à-dire : - de trouver plus facilement, - et de trouver plus vite. Ne sont présentés que des outils gratuits et en ligne. L’objectif de ce document est de populariser les outils utiles et efficaces et donc de faire gagner en productivité les entreprises, sans entrainer de charges.
New research to uncover nuances of networks Feb. 20, 2013 9:01 a.m. When a species disappears from a region, the rest of the ecosystem may flourish or collapse, depending on the role that species played. When a storm rolls across the coast, the power grid might reconfigure itself quickly or leave cities dark for days. A snowstorm might mean business as usual in a hardy city and a severe food shortage in another, depending on the distribution strategies of residents. Each of these systems is a kind of network, with thousands of members and relationships linking them. With current network theory, scientists can predict a few simple trends, such as which web pages are likely to get more hits over time. A new four-year, $2.9 million grant from the Defense Advanced Research Projects Agency is supporting SFI research that will, the researchers hope, propel their understanding of networks to the next level. Nodes and links in real networks are cloaked in details, he says. They have already made progress.
Dabble DB - Online Database - Collect, report, and share your data US Military Scientists Solve the Fundamental Problem of Viral Marketing Viral messages begin life by infecting a few individuals and then start to spread across a network. The most infectious end up contaminating more or less everybody. Just how and why this happens is the subject of much study and debate. Network scientists know that key factors are the rate at which people become infected, the “connectedness” of the network and how the seed group of individuals, who first become infected, are linked to the rest. It is this seed group that fascinates everybody from marketers wanting to sell Viagra to epidemiologists wanting to study the spread of HIV. So a way of finding seed groups in a given social network would surely be a useful trick, not to mention a valuable one. These guys have found a way to identify a seed group that, when infected, can spread a message across an entire network. Their method is relatively straightforward. This process finishes when there is nobody left in the network who has more friends than the threshold. Expect to hear more!
Graphviz