Computational Mechanics

Software Engineering for Service-Oriented Systems and Autonomic Systems

Service-Oriented Computing is an emerging paradigm where services are understood as autonomous, platform-independent computational entities that can be described, published, categorised, discovered, and dynamically assembled for developing massively distributed, interoperable, evolvable systems and applications. In this course a model-driven approach to the development of service-oriented software systems is presented where foundational theories and techniques are integrated in a pragmatic software engineering approach.

Principles of Concurrent and Distributed Programming

The course objective is to introduce the basics of concurrent programming problems through an illustration of the concepts and techniques related to modeling systems in which there are more components that are simultaneously active and need to coordinate and compete for the use of shared resources. At the end of the course the student will have a good understanding of the constructs for concurrent programming and be able to use them to write and analyze concurrent programs.

Extended and Mesh Free Finite Element Methods for Boundary Value Problems with Discontinuities and Multiscale Methods for Fracture (long seminar without exam)

Over the past decades, finite element methods have been developed into one of the most general
and powerful class of techniques to solve boundary value problems governed by partial differential
equations in order to study, predict and model the behavior of structures, materials, processes and
fluids. Within this course, extended finite element and mesh free methods will be presented to handle
problems with arbitrary strong and weak discontinuities. In these methods, the approximation

Computational Contact and Fracture Mechanics

This course provides a general overview on the theories of contact and fracture mechanics, relevant for a wide range of disciplines ranging from materials science to engineering and geophysics. Introducing their theoretical foundations, the physical aspects of the resulting nonlinearities induced by such phenomena are emphasized. Numerical methods for their approximate solution are also presented, together with a series of applications to real case studies. The course covers the following topics: I. Contact mechanics A. The Hertzian contact between smooth spheres B.

Advanced Topics of Control Systems

In this course we will venture to go through some of the most advanced control schemes whose development has been motivated by problems in process control and economics. The course's main objective will be to bring students in touch with the state of the art in MPC theory and explore various research opportunities that emerge. We will see how the mature concept of model predictive control (MPC) can be combined with process economics to yield a unifying framework -- known as economic model predictive control (EMPC) -- for simultaneous control and process optimization.

Advanced Topics of Computer Science

This course will be organized as series of reading groups or specialized seminars by members or collaborators of the research unit on System Modelling and Analisys (SysMA).

Large Scale Image Analysis for Natural and Life Sciences

Principles of imaging modalities (optical microscopy, spectroscopy, CT, MRI, PET, SPECT) and their applications in natural and life sciences (Dharmakumar); Basics of image analysis (filtering, segmentation, detection) and basics of statistical mining; Designing robust image analysis methods; Large-scale analysis; Integration with databases and knowledge sharing platforms; Error testing and precision bound repetition studies for longitudonal and group studies (phenotyping); High performance computing for imaging (computer vision); Scientific and data visualization; Prerequisites: Probability an

Convex Optimization

The course aims at giving a modern and thorough treatment of algorithms for solving convex, large-scale and nonsmooth optimization problems. Applications of convex optimization. Convex sets, functions and optimization problems. Optimality conditions. Basic algorithms for unconstrained optimization (gradient, fast gradient and Newton methods). Basic algorithms for constrained optimization (Interior point and active set methods). Subdifferential and conjugate of convex functions. Duality. Proximal mappings. Proximal minimization algorithm. Augmented Lagrangian Method.

Network Theory

Course description: Basic of Graph Theory: degree, clustering, connectivity, assortativity, communities. Analysis of Complex Networks, datasets and software. Community Detection, Modularity, Spectral Properties. Fractals, Self-Organised Criticality, Scale Invariance. Random Graph, Barabasi Albert Model, Fitness model, Small world. HITS Algorithm and PageRank. Real instances of Complex Networks in Biology and Social Sciences. Board of Directors, Ownership Networks, measures of Centrality and Control. World Trade Web, Minimal Spanning Trees, Competition and Products spaces.