A-Z Index | Phone Book | Careers

InTheLoop | 04.09.2012

April 9, 2012

Research Opportunities in Europe to Be Presented on April 18

Jean-Pierre Banâtre, Head of European Affairs for Inria, the only public research body fully dedicated to computational sciences, will present “Destination Europe for Researchers: Marie Curie Initiative, European Research Council and All That!” on Wednesday, April 18, 11:00 am–12:30 pm in Room 254, Sutardja Dai Hall, on the UC Berkeley campus. The targeted audience is any PhD student, post-doc, faculty or staff scientists who may be interested in doing research in Europe. Here is the abstract:

In this talk, we will present two major European initiatives addressed to researchers of any nationality at all stages of their careers and also introduce some facilities set up by Inria in order to attract the best ones in its research groups.

The first initiative called the “Marie Curie Actions for worldwide researchers and institutions’ concerns all domains of Science and is mainly devoted to Mobility (international, intersectoral and interdisciplinary). It encompasses 4 main objectives: Initial Training of Researchers, Life-long training and career development, Industry dimension and International dimension with "World fellowship". We will present the major characteristics of these objectives.

The second major initiative is the European Research Council (ERC), which aims at promoting Europe as a prime location for top scientists in frontier research. This initiative is part of the 7th EU Research Framework Programme and has been allotted a significant budget of $10 billions for the period 2007-2013. Excellence is the only criterion and ERC is opened to researchers from anywhere in the world wishing to do research in Europe. We will go into the details of this program, which is already funding more than 2000 researchers (starting and advanced) in major research centers and Universities in Europe.

Finally, we will give some insight on the way Inria uses these instruments in order to promote excellence in its research groups. For example, Inria is the Institution that hosts the highest number of ERC laureates in Computer Science. Independently, Inria is also setting up its own schemes in order to attract promising researchers in its fields of excellence; of course, these schemes have been designed in strong synergy with ERC instruments.

“From Data to Knowledge” Conference May 7–11 at UC Berkeley

The Center for Time-Domain Informatics at UC Berkeley and the National Science Foundation are presenting a week-long workshop, “From Data to Knowledge: Machine-Learning with Real-Time and Streaming Applications,” May 7–11, 2012 at UC Berkeley. Registration is open until space is filled. Preference will be given to those actively working in fields covered by the workshop, those presenting posters/talks, and those that apply early.

This workshop will bring together researchers from applied mathematics and several diverse scientific fields to discuss the current state of the art and open research questions in streaming data and real-time machine learning. The workshop will be domain driven, with talks focusing on well-defined areas of application and describing the techniques and algorithms necessary to address the current and future challenges in the field. Sessions will be accessible to a broad audience. Program sessions include:

  • Time-Series Clustering and Classification
  • Real-Time Machine Learning in Astrophysics
  • Streaming Networks & Streaming Algorithms
  • Classification of Sensor Network Data Streams
  • Randomized and Approximation Algorithms
  • Stochastic & Online Algorithms
  • Time-Series & Streaming Classification in Medical & Bio-Sciences
  • Streaming Analytics Frameworks
  • Data Mining of Data Streams

NERSC Analytics Group Lead Peter Nugent is on the local organizing committee for the workshop.

Registration Is Open for MMDS 2012, July 10–13

Online registration for the 2012 Workshop on Algorithms for Modern Massive Data Sets (MMDS 2012) is now available. April 15 is the deadline for early registration. The goals of this series of workshops are to explore novel techniques for modeling and analyzing massive, high-dimensional, and nonlinearly structured scientific and internet data sets; and to bring together computer scientists, statisticians, mathematicians, and data analysis practitioners to promote the cross-fertilization of ideas.

This Week’s Computing Sciences Seminars

Object Oriented Programming in Fortran 2003
Tuesday, April 10, through Thursday, April 12, 9:00 am–5:00 pm, OSF-238 and webcast
Damian Rouson and Karla Morris, Sandia National Laboratories

Fortran 2003 explicitly supports object-oriented programming (OOP). OOP aims to increase a program’s maintainability, in part by reducing cross-module data dependencies, and to increase a program’s reusability, in part by providing for extensible derived types. Emerging compiler support for Fortran 2003 inspires a more modern program design and implementation style. This course provides the requisite skills.

Day 1 introduces OOP in Fortran 2003. Day 2 introduces patterns of best practice in program organization. Day 3 explores several paths toward parallel OOP. Examples will utilize introductory-level numerical algorithms from linear algebra and differential equations inspired by multiphysics modeling, that is, coupled field problems common to many interdisciplinary, engineering, and physical science simulations. (This is a repeat of the March 26–28 course held at UC Berkeley.)

Conditioning Analysis of Incomplete Cholesky Factorizations with Orthogonal Dropping: LAPACK Seminar
Wednesday, April 11, 12:10–1:00 pm, 380 Soda Hall, UC Berkeley
Artem Napov, LBNL/CRD

We consider incomplete Cholesky factorizations based on orthogonal dropping for the iterative solution of symmetric positive definite linear systems. These methods become increasingly popular tools for computing an approximate factorization of large dense matrices, including update matrices and Schur complements that arise in spares solvers. For the system preconditioned with this incomplete factorization, we present an upper bound on the condition number which only depends on the accuracy of the individual approximation (dropping) steps. The analysis is illustrated with some existing factorizations in the context of discretized elliptic partial differential equations.

Funding Opportunity: Mathematical Multifaceted Integrated Capability Centers
Wednesday, April 11, 3:30 pm, 50A-5132
Esmond Ng, LBNL/CRD

The DOE/ASCR Base Math Program announced a call for proposals last week to establish two or three Mathematical Multifaceted Integrated Capability Centers (MMICCs). The announcement can be found at http://www.science.doe.gov/grants/pdf/LAB_12-698.pdf. The goal of the MMICCs is to address the long-term mathematical challenges for one or more DOE grand challenges of increasing complexity. The purpose of this informational meeting is provide some background and clarifications on the call, as well as to answer questions.

TRUST Security Seminar: How to Retrieve Messages from Your Encrypted “Sent” Folder
Thursday, April 12, 1:00–2:00 pm, Soda Hall, Wozniak Lounge, UC Berkeley
Yuliang Zheng, University of North Carolina at Charlotte

Alice has an important message to be sent to Bob. She can accomplish this by employing Bob's public key to encrypt the message into a ciphertext, followed by emailing Bob the ciphertext. After sending the encrypted message to Bob, Alice's email system dutifully keeps an identical copy of the ciphertext in her “Sent” folder. Some time later Alice finds herself in a position where she needs to recover the message from the ciphertext, without access to Bob's decryption key. In this talk I will explain how the problem above can be solved by the use of public key encryption that allows backward recovery by the sender. I will also discuss techniques that convert traditional public key encryption to include backward recovery so that the security of resultant mechanisms can be formally proven.

About Computing Sciences at Berkeley Lab

The Lawrence Berkeley National Laboratory (Berkeley Lab) Computing Sciences organization provides the computing and networking resources and expertise critical to advancing the Department of Energy's research missions: developing new energy sources, improving energy efficiency, developing new materials and increasing our understanding of ourselves, our world and our universe.

ESnet, the Energy Sciences Network, provides the high-bandwidth, reliable connections that link scientists at 40 DOE research sites to each other and to experimental facilities and supercomputing centers around the country. The National Energy Research Scientific Computing Center (NERSC) powers the discoveries of 7,000-plus scientists at national laboratories and universities, including those at Berkeley Lab's Computational Research Division (CRD). CRD conducts research and development in mathematical modeling and simulation, algorithm design, data storage, management and analysis, computer system architecture and high-performance software implementation. NERSC and ESnet are Department of Energy Office of Science User Facilities.

Lawrence Berkeley National Laboratory addresses the world's most urgent scientific challenges by advancing sustainable energy, protecting human health, creating new materials, and revealing the origin and fate of the universe. Founded in 1931, Berkeley Lab's scientific expertise has been recognized with 13 Nobel prizes. The University of California manages Berkeley Lab for the DOE’s Office of Science.

DOE’s Office of Science is the single largest supporter of basic research in the physical sciences in the United States, and is working to address some of the most pressing challenges of our time. For more information, please visit science.energy.gov.