We investigate the computational hardness of approximating the longest path and the longest cycle in undirected and directed graphs on n vertices. We show that * in any expander graph, we can find (n) long paths in polynomial time. * there is an algorithm that finds a path of length (log2 L/ log log L) in any undirected graph having a path of length L, in polynomial time. * there is an algorithm t

A new algorithm for clustering is presented --- the Distributed Clustering Algorithm (DCA). It is designed to be incremental and to work in a real-time situation, thus making it suitable for robotics and in models of concept formation. The DCA starts with one cluster (or rather prototype at the center of the cluster), successively adding prototypes and distributing them according to data density u

[abstract missing]

'The unbalanced hierarchy' addresses equal opportunities in academia. One of the key issues we face is that women are not being absorbed into the research community. Birgitta Odén, emeritus professor of history at the University of Lund, laid out the problems in her study 'Ju högre, desto färre' ['The higher you go, the fewer there are'] (Odén 1996). The phenomenon has also been described as 'a le

Popular Abstract in Swedish Mycket få människor omkring oss vet innebörden av ordet kavitation, förutom de som såg filmen "The Hunt for Red October" och kan relatera kavitation till Sean Connery i en ubåt. Kavitation motsvarar bildandet av bubblor, som kan likna kokande vatten i en kastrull. Men den uppstår inte på grund av en hög temperatur utan på grund av ett lågt tryck. Den finns i de flesta tVery few people around us know the meaning of the word cavitation, except from those who saw the movie "The Hunt for Red October" and can relate cavitation to Sean Connery in a submarine. Some of them know that it corresponds to the formation of bubbles, due to a pressure drop, and causes erosion and noise. However, cavitation is much more complex. A large amount of research work has been done ove

A reassessment of the discussion about the actual meaning of the Gates of Sleeep passage in Vergil's Aeneid VI.

Dynamical flow networks with heterogeneous routing are analyzed in terms of stability and resilience to perturbations. Particles flow through the network and, at each junction, decide which downstream link to take on the basis of the local state of the network. Differently from single-commodity scenarios, particles belong to different classes, or commodities, with different origins and destination