Agility in Project Management – What does it really mean?
U-residence, green room
Speaker: Luc Peirlinckx, Capgemini Belgium - Diegem
Luc graduated from the VUB , Faculty of Engineering in 1988. He has gained R&D experience as a post-doctoral researcher and lecturer at the Free University of Brussels (VUB, dept. ELEC) and as R&D coordinator at Tele Atlas.
He is experienced in managing projects & programs (PMBOK) in the In-Car Navigation & Location Based Services (Tele Atlas, TomTom), utility and supply chain markets, and in the public sector. He also has business development & customer support expertise (support of bids & contracts) for these markets.
Luc also gained experience in Best Practices for requirements management, release and sprint planning and implementation, and product delivery based on principles of Agile Framework.
Luc has been part of the Tele Atlas – TomTom organisation for about 13 years and was assigned in 4 key roles: Team Manager, Product Line Manager, Program Manager and Manager Engineering Quality Management System and processes.
Luc has started at Capgemini in May 2012. He focused to bid and engagement management. During this period, he was managing bids in various market segments and technologies, and was responsible for several engagements. Examples: Coca Cola - Risk management business process, Janssen Pharmaceutical companies of J&J - Mobile & Cloud technology, FOD Social Security - IBM Curam, bpost - Drupal web platform, Johnson Controls International – Salesforce, ServiceMax EUR rollout.
In this session, Luc Peirlinckx will share the key activities, insights and trends about the role and responsibilities of an project/program manager.
It’s obvious both the complexity of (IT)-technology and business-requirements has increased. Hence, project and program managers are facing higher expectations on the level of the key project dimensions especially budget, scope and timing flexibility. But what does this really mean?
Luc will share with you what a typical week looks like for him.
Several topics will be highlighted:
- The project manager role on delivery projects;
- Risk, Change and Stakeholder management;
- Trends and expectations;
- International mobility and impact on delivery processes;
System identification with input and output uncertainties using kernel-based methods
Building K, 7th floor
Speaker: Giulio Bottegal, KUL
Recent developments in system identification have brought attention to regularized kernel-based methods. Using the Bayesian interpretation of kernel-based methods, in this talk I will discuss several ways to extend this paradigm to system identification problems with input or output uncertainties. Examples of this type of problems include blind system identification, Hammerstein systems, errors-in-variables, quantized output data, and identification with outliers. An application to dynamic network identification is also discussed.
Target/Source Localization by an Imperfect Network of Binary
Dept. ELEC, Building K, 7th floor
Speaker: ErWei Bai, University of Iowa
Target/source localization is a parameter (location) estimation problem. In this talk, target/source localization and tracking by a network of imperfect and primitive binary sensors will be discussed. Binary sensors are inexpensive and can be employed in a large numbers.However, cheap binary sensors are imperfect and subject to various uncertainties. In this talk, detailed analysis, mathematical modeling of imperfect binary sensors and convergence results will be presented. Numerical algorithms for source localization and tracking are proposed along with convergence and asymptotic normality results. Further a distributive way to calculate the globally optimal estimate by using only local information provided by binary sensors is derived.
Sparse interpolation, exponential analysis, Padé approximation and tensor decomposition
7th floor, building K
Speaker: Annie Cuyt (Universiteit Antwerpen)
A mathematical model is called t-sparse if it is a combination of only t generating elements. In sparse interpolation, the aim is to determine both the support of the sparse linear combination and the scalar coefficients in the representation, from a small or minimal amount of data samples. Sparse techniques solve the problem statement from a number of samples proportional to the number t of terms in the representation rather than the number of available data points or available generating elements. Sparse representations reduce the complexity in several ways: data collection, algorithmic complexity, model complexity.
We indicate the connections between sparse interpolation, generalized eigenvalue computation, exponential analysis, rational approximation, orthogonal polynomials and tensor decomposition. In the past few years, insight gained from the computer algebra community combined with methods developed by the numerical analysis community, has lead to significant progress in several very practical and real-life signal processing applications. We make use of tools such as the singular value decomposition and various convergence results for Padé approximants to regularize an otherwise inverse problem. Classical resolution limitations in signal processing with respect to frequency and decay rates, are overcome.
In the illustrations we particularly focus on multi-exponential models
representing signals which fall exponentially with time. These models appear, for instance, in transient detection, motor fault diagnosis, electrophysiology, magnetic resonance and infrared spectroscopy, vibration analysis, fluorescence lifetime imaging, music signal processing, dynamic spectrum management such as in cognitive radio, nuclear science, and so on. Through the connection with tensor decomposition we can even have an impact on big data analytics.
Pdf version: annie_cuyt_2016_seminar.pdf