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 JUN 2010. GODINE

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

Snezana Popovic, Racunarski fakultet, Beograd
MODELIRANJE POSLOVNIH PROCESA U RAZVOJU APLIKACIJA ELEKTRONSKOG POSLOVANJA

Sadrzaj: Predmet predavanja je analiza postojecih koncepata, dizajna, arhitekture i specifikacija standarda za modelovanje poslovnih procesa u B2B aplikacijama elektronskog poslovanja, sa posebnim naglaskom na analizu mogucnosti automatizacije pri opisivanju izvrsavanja poslovnih procesa. U ovom momentu, tehnoloski razvoj u oblasti informacionih tehnologija ne prate uvek i neophodni standardi. Konstatacija vazi i za Web servise, tako da postojeci standardi, kao sto su SOAP, WSDL i UDDI, nisu dovoljni da daju potpunu podrsku izgradnji poslovnih procesa. Dobro resenje za modeliranje poslovnih procesa postize se izborom najboljih standarda. BPMN i BPEL su jezici, koji se koriste za opis izvrsavanja poslovnog procesa u okviru sistema. U praksi se pokazalo da se njihovim prihvatanjem i koriscenjem kreiraju dobra resenja.

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

Ana Savic, Visoka skola elektrotehnike i racunarstva, Beograd
SISTEM ZA DALJINSKO UCENJE MATEMATIKE "INTERNETUCENJE"

Sazetak: U ovom radu data je analiza postignutog u oblasti primene savremenih metoda i tehnologija u nastavi matematike u svetu i kod nas. Kao primer, opisana je realizacija nastave matematike na Visokoj skoli elektrotehnike i racunarstva u Beogradu, koriscenjem softvera "InternetUcenje" kreiranog za te potrebe. Prikazani su rezultati uspeha studenata koji su koristili softver za daljinsko ucenje matematike u odnosu na studente koji su ucili na tradicionalan nacin.

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

Dusan Ramljak, Beograd
BEE COLONY OPTIMIZATION FOR THE p-CENTER PROBLEM

Abstract: We consider the p-Center Problem in the case of deterministic travel time (distances), with symmetric distance matrix. We apply the new heuristic based on the Bee Colony Optimization for solving this problem. The proposed algorithm is inspired by bees' behavior in the nature. We compared two variants of the Bee Colony Optimization algorithm, constructive and improvement one. The performed numerical experiments show that the improvement version of the algorithm outperforms the existing approaches from the literature. (Joint work with Dusan Teodorovic, Milica Selmic, University of Belgrade Faculty of Transport and Traffic Engineering, Tatjana Davidovic, Mathematical Institute)

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

Aleksandar Jurisic, Faculty of Computer and Information Science, University of Ljubljana
USE OF ORTHOGONAL POLYNOMIALS IN DISCRETE MATHEMATICS

Abstract: Orthogonal polynomials were developed in the late 19th century from a study of continued fractions by Chebyshev and were pursued by Markov, Stieltjes and by a few other mathematicians. Since then, applications have been developed in many areas of mathematics and physics. In our talk we will concentrate on their applications in discrete mathematics. For example, we show how to use them to improve efficient implementations of cryptosystems based on finite fields and in particular on elliptic curves. Most finite objects of sufficient regularity are closely related to certain distance-regular graphs, which can be in turn treated as combinatorial interpretations of certain orthogonal polynomials. We will exploit these connections and finally, we show that the determinant of a T\"oplitz matrix can be written as a product of two determinants of approximately half the size of the original one.



RUKOVODIOCI SEMINARA

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