ὅδε οἶκος, ὦ ἑταῖρε, μνημεῖον ἐστιν ζῴων τῶν σοφῶν ἀνδρῶν, καὶ τῶν ἔργων αὐτῶν

Seminar on Computer Science and Applied Mathematics

 

PROGRAM


Matematički Institut SANU, Beograd
Knez Mihajlova 36
Fakultet organizacionih nauka, Univerzitet u Beogradu,
Jove Ilica 154
IEEE Chapter Computer Science (CO-16) Belgrade, Republic of Serbia

SEMINAR ZA RAČUNARSTVO I PRIMENJENU MATEMATIKU

MI SANU, Knez Mihailova 36, sala 301f

Upravni odbor Matematickog instituta SANU je na nedavnoj sednici doneo odluku da se dosadasnji Seminar za primenjenu matematiku, sada nazove Seminar za racunarstvo i primenjenu matematiku, a u cilju potenciranja znacaja racunarstva kao jedne od oblasti delatnosti Instituta. Istovremeno, Upravni odbor doneo je odluku o osnivanju Odeljenja za racunarstvo i primenjenu matematiku i vezao rad novog odeljenja za rad Seminara za racunarstvo i primenjenu matematiku.

PLAN RADA SEMINARA ZA FEBRUAR 2016. GODINE

Utorak, 9.02.2016. u 14:15h, sala 301f, MI SANU
Raka Jovanovic, Institut za fiziku, Zemun i Qatar Environment and Energy Research Institute (QEERI) Hamad bin Khalifa University
DIFFERENT APPROACHES FOR SOLVING THE PROBLEM OF MAXIMAL PARTITIONING OF GRAPHS WITH SUPPLY AND DEMAND

Abstract: In recent years there has been a growing interest for the problem of the maximal partitioning of graphs with supply and demand (MPGSD), due to its close connection to electrical distribution systems, especially in the context of smartgrids. To be more precise, the MPGSD can be effectively used for the optimization of self-adequacy of interconnected microgrids. The focus of this talk is on several approaches for solving the MPGSD, and its variations. The first one focuses on finding good quality approximate solutions, in reasonable time, for very large graphs through a multiheuristic approach. Secondly, the ant colony optimization (ACO) metaheuristic is applied to MPGSD, and its version with limited capacity. This approach manages to find near optimal solutions for medium size graphs. With the goal of being able to find confirmed optimal solutions for arbitrary graphs a mixed integer programming (MIP) model is defined. The developed MIP formulation can generally be applied only for small problem instances, but proves to be very suitable for highly sparse graphs where it even manages to outperform ACO.

Utorak, 23.02.2015. u 14:15h, Sala 301f, MI SANU:
Ilija Antovic, Fakultet organizacionih nauka
AUTOMATIC USER INTERFACE GENERATION BASED ON USE CASES - THE SILABUI APPROACH

Abstract: The design and implementation of user interfaces are two of the most effort and time consuming activities of the software development process. The lecture will address the automation of the process of designing and implementing user interfaces. The automation is based on the identified connections between software requirements, particularly use cases, and the resulting user interface of the application, taking into account the characteristics of the targeted implementation technologies and application types. We will also discuss the principles and characteristics which should be an integral part of the tool for automation of user interfaces development, that are all implemented in SilabUI approach.

Keywords: user interface, requirements engineering, use case, code generator, meta-model, user interface template, business applications, user interface generator

RUKOVODIOCI SEMINARA

MI SANU
Vera Kovačević-Vujčić
Milan Dražić

FON
Zorica Bogdanovic
Marijana Despotovic-Zrakic

IEEE
Bozidar Radenkovic