Computational Geometry_ Algorithms and Applications 2008.pdf
Algorithms and Computational Mathematics - CNR 20091019... · Group’s History Algorithms and...
Transcript of Algorithms and Computational Mathematics - CNR 20091019... · Group’s History Algorithms and...
Group’s History
October 19th, 2009Algorithms and Computational Mathematics, IIT - CNR
2
Permanent / Temporary Staff
AlgorithmicsGraph Theory
Computational Complexity
Research Areas
Established experience in Design and Analysis of Efficient Algorithms, Graph Theory, and Computational Complexity used to solve complex problems from several application domains
October 19th, 2009Algorithms and Computational Mathematics, IIT - CNR
3
Bioinformatics
Computational Game Theory &
Economics
Numerical Linear Algebra
Wireless Networks
World Wide Web
Term Contract Worker
Claudio Felicioli
Associate Researchers
Mauro LeonciniUniv. of Modena & Reggio Emilia, Italy
Giovanni ManziniUniv. of Piemonte Orientale, Italy
Manuela MontangeroUniv. of Modena & Reggio Emilia, Italy
Permanent Staff
People
Temporary Staff
Filippo GeraciResearcher
M. Elena RendaResearcher
October 19th, 2009Algorithms and Computational Mathematics, IIT - CNR
4
Paola FavatiResearch DirectorGroup’s head
Marco PellegriniSenior Researcher
Giovanni RestaSenior Researcher
Bruno CodenottiResearch Director
Paolo SantiSenior Researcher
Ph.D. StudentsMichele BudinichGiovanni Viglietta
Representative Publications P.Brianzi, P. Favati, O. Menchi, F.Romani, A Framework for Studying the Regularizing
Properties of Krylov Subspace Methods. Inverse Problems, Vol. 22, pp.1007-1021, 2006
B.Codenotti, B. McCune, K. Varadarajan, Market Equilibrium via the Excess Demand Function. STOC 2005, pp.74-83.
S.Eidenbenz, G.Resta, P.Santi, The COMMIT Protocol for Truthful and Energy-Efficient Routing in Ad Hoc Networks with Selfish Nodes, IEEE Trans. on Mobile Computing, Vol. 7, n. 1, pp. 19-33, January 2008.
Y. Dourisboure, F.Geraci, M. Pellegrini, Extraction and classification of dense implicit communities in the Web graph. ACM Transactions on the WEB, Vol 3, Num 2, Art 7, April 2009.
F. Geraci, M. Leoncini, M. Montangero, M. Pellegrini and M. Elena Renda
K-boost: A Scalable Algorithm for High Quality Clustering of Microarray Gene Expression Data . Journal of Computational Biology, Vol 16, Num 6, pp. 859-873, June 2009.
October 19th, 2009Algorithms and Computational Mathematics, IIT - CNR
8
Funded Projects ARIANNA Search Engine Improvement. Period: 2002-2003. Budget: 90K Euro.
Partners: IIT – CNR, ItaliaOnLine.
COMBSTRU. Research Training Network (V PQ EU). Budget 125K Euro. Period: 2002-2006. Partners: UPC Barcelona; Freie Univ., Humbodlt Univ. and Tech. Univ. Berlin; Bielefeld Univ.; LABRI - Univ. Bordeaux I; Renyi Institute; Oxford Univ.; CTI – Patras; IIT – CNR; Charles Univ.
VPH. Network of Excellence VII PQ EU. Budget: 40K Euro. Period:06/2008-11/2012. Partners: UCL; University of Oxford; CNRS; Univ. Libre de Bruxelle; INRIA; Univ. Nottingham; Univ. Pompeu Fabra; Univ. Auckland; European Molecular Biology Laboratory; Univ. Sheffield; Karolinska Institutet; Institut Municipal d'Assistència Sanitària; GEIE ERCIM.
IPERMOB: An Heterogeneous Pervasive Real-Time Infrastructure for Mobility Control. Budget: 150K Euro. Period: 11/2009-04/2011. Partners: IIT, ISTI – CNR; Pisa Airport.
MimoNetD: Increasing wireless mesh network capacity through MIMO technology. Budget: 600K Euro on 3 years (funded by the Registry).
Downsized version of the project proposal ERC StG-2009 “MimoNet: Increasing wireless mesh network capacity through MIMO technology”, Budget : 1.6M Euro on 5 years – Final Judgment: Fundable but not funded.
October 19th, 2009Algorithms and Computational Mathematics, IIT - CNR
10
Project Proposals (2009) COGENT: COmputational and GamE-theoretic aspects of uncoordinated NeTworks.
Duration: 2 years. Budget 70K Euro. Partners: IIT – CNR, Univ. L’Aquila (prop.), Univ. Roma La Sapienza, Univ. Roma3, Univ. Salerno. (PRIN)
Data Processing in Discrete non-homogenous Domains for Web Mining and Social Networking. Duration: 3 years. Budget: 375K Euro. Partners: IIT - CNR (prop.), Univ. Siena. (FIRB-Futuro in Ricerca)
MicroCosmos: Establishing the Foundations of Efficient and Secure Mobile Community Networking. Duration: 3 years, Budget 330K Euro. Partners: IIT – CNR, Univ. Catania, Univ. Roma La Sapienza (prop). (FIRB-Futuro in Ricerca)
Nuova Piattaforma di Business Intelligence Basata sulle Reti Sociali. Duration: 2 years. Budget: 160K Euro. Partners: Sistemi Territoriali SRL (prop.), IFC - CNR, IIT - CNR. (POR-RT)
October 19th, 2009Algorithms and Computational Mathematics, IIT - CNR
11
Editorial Activities
Bruno Codenotti
Managing Editor of Journal Calcolo
Member of editorial board of Applied Mathematics Letter
Member of editorial board of ACM Transactions on Computation Theory
Paola Favati
Assistant Editor of Journal Calcolo
Paolo Santi
Associate Editor of IEEE Transactions on Mobile computing
Calcolo, managed by the Algorithms and Computational Mathematics Group,
is the only international journal of CNR (Impact Factor 2008: 0.621 *)
* Journal Citation Reports®, Thomson Reuters
October 19th, 2009Algorithms and Computational Mathematics, IIT - CNR
12
Service
The researchers of Algorithms and Computational Mathematics have been involved in the organization of conferences such as:
SoCG 2005 ACM Symposium on Computational Geometry
ANAW 2006 Algorithmic and Numerical Aspects in Web Search
VANET 2007, VANET 2008 ACM Workshop on Vehicular Ad Hoc Networks
MobiHoc 2006 ACM Symposium on Mobile Ad Hoc Networking and Computing
MASS 2009 IEEE International Conference on Mobile Ad Hoc networks and sensor Systems
Moreover they served on the program committees of several conferences
and as reviewers of European projects
Member of ERCIM Working Group on Social Network Analysis
Member of ERCIM Digital Patient Working Group
October 19th, 2009Algorithms and Computational Mathematics, IIT - CNR
13
Regularization techniques for ill-posed inverse problems. Regularizing preconditioners with application to image reconstruction
In collaboration with Dept. of Computer Science, Univ. of PisaDept. of Mathematics, Univ. of Parma
Numerical Linear Algebra Solution of large linear systems (with and without structure). Applications
in queueing theory
October 19th, 2009Algorithms and Computational Mathematics, IIT - CNR
14
Computational Game Theory & Economics
Efficient algorithms for computing market equilibria with Leontief functions and extensions
Convex programming techniques for computing equilibria in Markets
Nash equilibria in two-persons games and equilibria in exchange markets (characterizations via computational equivalence)
Applications to ad-words markets
In collaboration with:Dept. of Computer Science, Univ. of IowaDept. of Computer Science, Univ. of ChicagoTTI - Chicago
October 19th, 2009Algorithms and Computational Mathematics, IIT - CNR
15
Wireless Networks
Network-level MIMO Exploitation
Broadcast/Data Gathering Capacity Characterization
Peer-to-peer wireless Mesh networks
Non-cooperative behavior in wireless networks
Vehicular networks
Interference-aware algorithms
In collaboration with:
Georgia Tech, ISTI – CNR, Stony Brook Univ., Univ. Arizona, Los Alamos Nat. Labs, Univ. Chicago, Univ. Karlsruhe, Univ. Padernborn, Univ. Roma “La Sapienza”, Univ. Catania
October 19th, 2009Algorithms and Computational Mathematics, IIT - CNR
16
MIMO SystemsMultipleInputMultipleOutput systems are an advanced PHY layer technology for improving performance on a wireless link
October 19th, 2009Algorithms and Computational Mathematics, IIT - CNR
17
ARRAY GAIN
INTERFERENCECANCELLATION
SPATIAL MULTIPLEXING(e.g., 802.11n)
MIMO Nets: Fundamental QuestionsMIMO systems studied by communication engineers with a single-link perspective
What happens if MIMO systems are used in a network?
October 19th, 2009Algorithms and Computational Mathematics, IIT - CNR
18
What happens when several links co-exist?
What network-level throughput benefits can we
expect?
Which is the best way of combining AG, IC, and SM?
Modeling Analysis
Algorithms
Engineering challenge: Implementation of the designed heuristics on Software Defined Radios
MIMO Nets: Tools
October 19th, 2009Algorithms and Computational Mathematics, IIT - CNR
19
Algorithmics: Efficient approximation algorithms based on MIS
Computational Complexity: Solving the problem is NP-Hard(reduction from MIS)
ILP: formulation of the general optimization problem
Web Metasearch
Personalized Web search
Clustering and labeling of web snippets
Automatic generation of digital video summaries
Models for structural properties of the web graph
Detection/Extraction of implicit cyber-communities in the web graph
Tools development for the analysis and visualization of data retrieved from the WWW
(Armil, ComWatch, PISA, Visto)
In collaboration with:
ISTI – CNR
Dept. of Computer Engineering, Univ. of Siena
World Wide Web
October 19th, 2009Algorithms and Computational Mathematics, IIT - CNR
20
WebAlgo
Web Business Intelligence
October 19th, 2009Algorithms and Computational Mathematics, IIT - CNR
21
Science
Technology
Economy
Users
The World Wide Web
Mathematics is the Queen of the Sciences [Carl Friedrich Gauss]
ComWatch
October 19th, 2009Algorithms and Computational Mathematics, IIT - CNR
22
Crawling of the .it
Automatic extraction and classification of communities topics
Web pages Web graph
Cyber-communities extraction
ComWatch Web Interface
3D Map of the World Wide Web (www.vlib.us)
Biological sequences analysis/classification
SNP haplotyping analysis
Microarray gene expression data analysis
Motif and Tandem Repeat identification/extraction
Diseases and gene expression profiling classification
Web tools development for the analysis and visualization of biological sequences (AMIC@, ReHap, TReaDS)
In collaboration with:
IFC - CNR, Pisa
Dept. of Computer Engineering, Univ. of Pisa
Dept. of Computer Engineering , Univ. of Modena & Reggio Emilia
Microarray Lab, Dept. of Experimental Pathology, BMIE, Univ. of Pisa
Bioinformatics
October 19th, 2009Algorithms and Computational Mathematics, IIT - CNR
23
BioAlgo
Amic@: All MIcroarray Clusterings @ once
User friendly interface
Benchmark for innovative clustering algorithms (K-Boost)
A multi-method clustering engine for gene expression microarray data
Suggestion of the number of clusters
Automatic file format detection
Measurements of cluster quality (homogeneity)
Cluster visualization via heat-maps
Off-line clustering wizard
October 19th, 2009Algorithms and Computational Mathematics, IIT - CNR
24