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

Seminar on Applied Mathematics

 

PROGRAM


Matematički Institut
Matematički fakultet
Fakultet organizacionih nauka
JUPIM
IEEE Computer Chapter, Srbija

SEMINAR ZA PRIMENJENU I INDUSTRIJSKU MATEMATIKU

MI SANU, Knez Mihailova 36, sala 301f

PLAN RADA SEMINARA ZA MART 2010. GODINE

Utorak, 02.03.2009. u 14:15, Sala 301f, MI SANU:

Jozef Kratica, Mirjana Cangalovic, Vera Kovacevic-Vujcicć
THE METRIC DIMENSION OF GENERALIZED PETERSEN GRAPHS

Abstract: Generalized Petersen graphs GP(n,k) were first studied by Coxeter in 1950. Various properties of GP(n,k) have been recently widely investigated in areas: isomorphism classes, distance-balanced property, strongly distancebalanced property, domination number, minimum vertex cover, Hamilton connectivity, etc. In this talk we consider the problem of determining the metric dimension of generalized Petersen graphs. For some special cases (k <= 2) the exact solutions are found, while for the other cases the tight lower bounds are given.

Utorak, 09.03.2010. u 14:15, sala 301f, MI:

Antun Balaz, Institut za fiziku, Zemun
PARALLELIZATION AND GRIDIFICATION OF MONTE CARLO CODES

Abstract. Monte Carlo algorithms are usually embarrassingly parallelizable, and therefore represent ideal candidates for deployment on MPI-based clusters, as well as on distributed Grid infrastructures. In this talk we will first briefly introduce Grid computing paradigm and available computing resources within the Academic and Educational Grid Initiative of Serbia (AEGIS). Then we will present SPEEDUP MC application for calculation of quantum mechanical transition amplitudes using the effective action approach, illustrate shortly its parallelization and Gridification strategy, and demonstrate typical usage and results in the parallel and Grid environments.

Utorak, 16.03.2010. u 14:15, sala 301f, MI SANU:

Aleksandar Savic, Matematicki fakultet, Beograd
ON SOLVING THE MAXIMUM BETWEENNESS PROBLEM USING GENETIC ALGORITHMS

Abstract. In this paper a genetic algorithm (GA) is applied on Maximum Betweennes Problem (MBP). The maximum of the objective function is obtained by finding a permutation which satisfies a maximal number of betweenness constraints. Every permutation considered is genetically coded with an integer representation. Standard operators are used in the GA. Instances in the experimental results are randomly generated. For smaller dimensions, optimal solutions of MBP are obtained by total enumeration. For those instances, the GA reached all optimal solutions except one. The GA also obtained results for larger instances of up to 50 elements and 1000 triples. The running time of execution and finding optimal results is quite short.

Utorak, 23.03.2010. u 14:15, sala 301f, MI SANU:

Dragos Cvetkovic, Matematicki institut SANU, Beograd
PRIMENE TEORIJE SPEKTARA GRAFOVA U RACUNARSTVU

Sadrzaj: Teorija spektara grafova je deo algebarske teorije grafova u kojoj se problemi teorije grafova tretiraju uz pomoc sopstvenih vrednosti i sopstvenih vektora matrica koje se pridruzuju grafovima. Najcesce se koriste matrica susedstva i Laplasova matrica ali i mnoge druge grafovske matrice. U poslednjih desetak godina spektri grafova se pojavljuju, sve vise i vise, i u racunarstvu u tretiranju razlicitih problema (modelovanje i pretrazivanje Interneta, obrada slike i prepoznavanje oblika, obrada i grupisanje podataka, multiprocesorske povezujuce mreze, otpornost mreze na sirenje virusa, statisticke baze podataka, socijalne mreze i dr.). Daje se kratak pregled ovakvih problema uz komentare o mogucnostima daljih istrazivanja.

Utorak, 30.03.2010. u 14:15, sala 305, MI SANU:

Dusan Barac, Fakultet organizacionih nauka, Beograd
RAZVOJ MODELA I SERVISA PORTALA ZA ADAPTIVNO ELEKTRONSKO OBRAZOVANJE

Sadrzaj: U ovom saopstenju se opisuje jedan moguci pristup za adaptaciju sistema elektronskog obrazovanja. Predmet istrazivanja je razvoj modela i servisa Web portala za adaptivno elektronsko obrazovanje. Resenje koje ce ovde biti razmatrano se zasniva na integraciji i ugradnji funkcional- nosti servisa adaptacije u sistem za upravljanje ucenjem Moodle LMS. Definisani su osnovni zahtevi i odgovarajuce tehnologije za razvoj portala za adaptivno obrazovanje. Neke od karakteristika portala su: autorizacija i autentifikacija, modularnost, prilagodjavanje i personalizacija, sadrzaj po zahtevu, prosirivost i integracija sa internim i eksternim sistemima. Prikazan je konceptualni model, kao i osnovne komponente portala.



RUKOVODIOCI SEMINARA

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