| CIDEC ÜIK |
Estonian Winter Schools in Computer Science Eesti arvutiteaduse talvekoolid |
EWSCS 2002 EATTK 2002 |
<> <>
<>, <>
<>
aboxfull aboxfull
aboxfull, USA
Abramovich Abramovich
Abramovich, USA
Ahmed Ahmed
None, Norway
None
airline ticket airline ticket
, Hungary
Alexandr Alexandr
Alexandr, USA
Alexandr Alexandr
Alexandr, USA
Ali Ali
Ali, USA
Ali Ali
Ali, USA
Alisa Alisa
Alisa, USA
Alize Alize
Alize, USA
Alize Alize
Alize, USA
AlizeF AlizeF
AlizeF, USA
AlizeF AlizeF
AlizeF, USA
aluminum aluminum
, Hungary
Anabolic Anabolic
, Hungary
Anabolic Anabolic
, Hungary
Andrey Andrey
Andrey, USA
Andrey Andrey
Andrey, USA
Angela Angela
Angela, USA
automati automati
automati, USA
balkanbe balkanbe
balkanbe, USA
Barbara Barbara
Barbara, USA
Barbara Barbara
Barbara, USA
Falk Bartels
CWI (Amsterdam), The Netherlands
Software Engineering
As stressed in the course of H-P Gumm, coalgebras of a (behaviour-) functor B are suited to model state based dynamical systems mathematically. But above that one often wants to construct such systems from constants and composition oper ators, a typical situation for algebras of a (signature-) functor S. This leads to the notion of a bialgebra, which consist of a state space with an S-algebra and a B-coalgebra operation on it.
One is now interested in bialgebras where these two operations interact in a specified way. As an example in the world of labelled transition systems, a constant "null" contained in the algebra should denote a process which cannot make transitions and the sequential composition "p . q" of two states p and q should describe a state which starts behaving like p but whenever p would terminate, it should continue by acting as q.
For transition systems it became popular to denote such specifications as rules in Plotkin's SOS style. Later people studied restricted rule formats which guaranteed desirable properties for the resulting models, like the famous GSOS rules. For their models it can be shown e.g. that the bisimilarity induced by the transition relation is a congruence for the operators.
Turi and Plotkin [1] gave a categorical description of GSOS rules as natural transformations called distributive laws. Their models are those bialgebras for which the algebra and coalgebra operations commute via these transformations.
For this abstract formulation one can prove a number of results elegantly like the existence of initial and final models, the mentioned result about bisimilarity being a congruence (both in [1]), the unique solvability of guarded recursive equations or the validity of the up-to-context proof principle for bisimilarity (both in [2]). Furthermore, it has recently been shown that a notion of a translation between specifications along with corresponding well-behavedness proofs can be given in this setting, which captures e.g. conservative extensions [3].
Apart from its elegance and unlike the standard formulation of GSOS rules, the categorical approach has the advantage of being parametric in the type of system behaviour under consideration. This makes it possible to transfer the results to other types of systems, like probabilistic transition systems.
The talk will present a simplified variant of the framework of Turi and Plotkin along with examples and sketch the proofs of some basic statements about its models.
References:
basketball lakers rumor basketball lakers rumor
basketball lakers rumor, basketball lakers ru
basketball lakers rumor
bathroom bathroom
, Hungary
beachbox beachbox
, Hungary
Benjamin Benjamin
Benjamin, USA
Benjamin Benjamin
Benjamin, USA
Bernik Bernik
Bernik, USA
Bernik Bernik
Bernik, USA
Bill Bill
, mexico
Bill Bill
Bill, USA
Bill Bill
Bill, USA
Bill Bill
Bill, USA
Bill Bill
, mexico
Bill Bill
Bill, USA
Bill Bill
Bill, USA
Bill Bill
, mexico
Bill Bill
, mexico
Bill Bill
Bill, USA
Bill Bill
Bill, USA
blackbox blackbox
, Hungary
Bob Bob
Bob, USA
bobby bobby
, Germany
Bobi Bobi
Bobi, USA
Bobi Bobi
Bobi, USA
Bobi Bobi
Bobi, USA
Bobi Bobi
Bobi, USA
Bobi Bobi
Bobi, USA
boxelder boxelder
boxelder, USA
boxoffic boxoffic
boxoffic, USA
boxtopsf boxtopsf
boxtopsf, USA
boxwine boxwine
boxwine, USA
Bra Bra
, Hungary
Bra Bra
, Hungary
Branler Branler
Branler, USA
Branler Branler
Branler, USA
Brenden Brenden
Brenden, USA
Brenden Brenden
Brenden, USA
Brighton Brighton
, Hungary
Britney Britney
Britney, USA
Britney Britney
Britney, USA
Britney Britney
, mexico
Britney Britney
, mexico
Britney Britney
Britney, USA
Britney Britney
Britney, USA
Britney Britney
, mexico
Britney Britney
, mexico
Brungilda Brungilda
Brungilda, USA
Bush Bush
Bush, USA
Bush Bush
Bush, USA
Bush Bush
, mexico
Bush Bush
Bush, USA
Bush Bush
, mexico
Bush Bush
Bush, USA
Bush Bush
, mexico
Bush Bush
, mexico
Bush Bush
, mexico
Bush Bush
, mexico
Bush Bush
Bush, USA
Bush Bush
Bush, USA
Bush Bush
Bush, USA
Bush Bush
Bush, USA
Bush Bush
Bush, USA
Bush Bush
Bush, USA
Bush Bush
Bush, USA
buy cialis buy cialis
buy cialis, USA
buy cialis buy cialis
buy cialis buy cialis cialis online generic cialis buy cialis online v, mexico
buy cialis buy cialis cialis online generic cialis
buy viagra buy viagra
buy viagra, USA
buy viagra buy viagra
, Hungary
buy viagra online buy viagra online
buy viagra online, USA
buy viagra online buy viagra online
buy viagra online, USA
buy viagra online buy viagra online
buy viagra online, USA
candlebo candlebo
, Hungary
cardboar cardboar
, Hungary
cardboar cardboar
cardboar, USA
cargobox cargobox
, Hungary
Caroline Caroline
Caroline, USA
Caroline Caroline
Caroline, USA
Chak Chak
Chak, USA
Chak Chak
Chak, USA
Chak Chak
Chak, USA
Chan Chan
, Hungary
Chanel Chanel
, Hungary
Chanel Chanel
, Hungary
Chanel Chanel
, Hungary
Chanel Chanel
, Hungary
Chanel Chanel
, Hungary
chanel chanel
, Hungary
chanel chanel
, Hungary
Chanel Chanel
, Hungary
Chanel Chanel
, Hungary
Cheap Cheap
Cheap, USA
Cheap Cheap
Cheap, USA
cialis cialis
, mexico
cialis cialis
cialis, USA
cialis cialis
, mexico
cialis online cialis online
cialis online, USA
Coach Coach
, Hungary
Coach Coach
, Hungary
Coach Coach
, Hungary
Coach Coach
, Hungary
Coach Coach
, Hungary
Coach Coach
, Hungary
consultancy in india market re consultancy in india market re
consultancy in india market research, consultancy in india
Cross Cross
, Hungary
Cross Cross
, Hungary
Danatello Danatello
Danatello, USA
Den Den
Den, USA
Den Den
Den, USA
Den Den
Den, USA
Den Den
Den, USA
Denis Denis
Denis, USA
Denis Denis
Denis, USA
Denis Denis
Denis, USA
Devid Devid
Devid, USA
Diegos Diegos
Diegos, USA
Diegos Diegos
Diegos, USA
Diegos Diegos
Diegos, USA
Diegos Diegos
Diegos, USA
Dima Dima
Dima, USA
Dima Dima
Dima, USA
Disney Disney
, Hungary
Dmitriy Dmitriy
Dmitriy, USA
Dmitriy Dmitriy
Dmitriy, USA
Doc Doc
Doc, USA
Doc Doc
Doc, USA
dogbox dogbox
dogbox, USA
earthbox earthbox
earthbox, USA
Eden Eden
, Hungary
Electric Electric
, Hungary
Electric Electric
, Hungary
Juhan Ernits
Institute of Cybernetics at TTU,
Control Systems
The aim of the presentation is to put forth an example of model checking the properties of the designs of embedded control systems that are specified in terms of block diagrams of Control Components (CC). This is an elaboration of the Control Component (proto-)Pattern described in [2]. The concept of CC is an abstraction of components similar to those typically used in tools such as e.g. SimuLink and LabView.
The presentation includes formal definition of CC-s and analysis of their char-acter. Next, a short overview of abstraction methods typically used in model check-ing is given and the transformation from the domain of CC to the domain of Uppaal [1] automata network is shown.
The talk is illustrated by an example of an embedded system in terms of CC.
References
evistabo evistabo
evistabo, USA
f f
fff, Hungary
fff
fake rolex fake rolex
, Hungary
Fedor Fedor
Fedor, USA
Felex Felex
Felex, USA
Felics Felics
Felics, USA
Feliks Feliks
Feliks, USA
Feliks Feliks
Feliks, USA
Felix Felix
Felix, USA
Felix Felix
Felix, USA
Fernando Fernando
Fernando, USA
Fernando Fernando
Fernando, USA
Fernando Fernando
Fernando, USA
Fernando Fernando
Fernando, USA
Fernando Fernando
Fernando, USA
Fernando Fernando
Fernando, USA
Filip Filip
Filip, USA
Fillip Fillip
, Hungary
Fillip Fillip
, Hungary
Fillip Fillip
Fillip, USA
Fiona Fiona
Fiona, USA
Fiona Fiona
Fiona, USA
Fiona Fiona
Fiona, USA
Fiona Fiona
Fiona, USA
Fiona Fiona
Fiona, USA
Fiona Fiona
Fiona, USA
Fiona Fiona
Fiona, USA
Firero Firero
Firero, USA
Firero Firero
Firero, USA
Franko Franko
Franko, USA
Franko Franko
Franko, USA
Fransis Fransis
Fransis, USA
Fransis Fransis
Fransis, USA
Fred Fred
Fred, USA
Fred Fred
Fred, USA
Fred Fred
Fred, USA
Fred Fred
Fred, USA
Fred Fred
Fred, USA
Fred Fred
Fred, USA
Fred Fred
Fred, USA
Freddi Freddi
Freddi, USA
Freddi Freddi
Freddi, USA
free nokia ringtones free nokia ringtones
free nokia ringtones, USA
free nokia ringtones free nokia ringtones
, Hungary
free ringtones free ringtones
free ringtones, USA
free ringtones free ringtones
free ringtones, USA
free ringtones free ringtones
, Hungary
Frencis Frencis
Frencis, USA
Frencis Frencis
Frencis, USA
Frenk Frenk
Frenk, USA
Frenk Frenk
Frenk, USA
Frenk Frenk
Frenk, USA
Frenk Frenk
Frenk, USA
Frenk Frenk
Frenk, USA
Frenk Frenk
Frenk, USA
Frenk Frenk
Frenk, USA
Frenk Frenk
Frenk, USA
Frenki Frenki
Frenki, USA
Frensis Frensis
Frensis, USA
Frensis Frensis
Frensis, USA
Frensis Frensis
Frensis, USA
Frensis Frensis
Frensis, USA
Frensis Frensis
Frensis, USA
Gans Gans
Gans, USA
Gans Gans
Gans, USA
Garcia Garcia
Garcia, USA
Garcia Garcia
Garcia, USA
Garcia Garcia
Garcia, USA
Garcia Garcia
Garcia, USA
Garsia Garsia
Garsia, USA
gearbox gearbox
, Hungary
Genri Genri
Genri, USA
Genri Genri
Genri, USA
Genri Genri
Genri, USA
Genri Genri
Genri, USA
Georg Georg
Georg, USA
Georg Georg
Georg, USA
Georgi Georgi
Georgi, USA
Gerbert Gerbert
Gerbert, USA
Gerbert Gerbert
Gerbert, USA
German German
German, USA
Giant Giant
, Hungary
giftboxe giftboxe
giftboxe, USA
Goofi Goofi
Goofi, USA
Great Great
, Hungary
Great Great
, Hungary
Gregorios Gregorios
None, Laos
None
gucci gucci
, Hungary
gucci gucci
, Hungary
Gucci Gucci
, Hungary
Gucci Gucci
, Hungary
Gucci Gucci
, Hungary
Gucci Gucci
, Hungary
Gucci Gucci
Gucci, USA
Gucci Gucci
Gucci, USA
halloween costumes halloween costumes
halloween costumes, USA
Hand Hand
, Hungary
handmade handmade
handmade, USA
Harison Harison
Harison, USA
Harrisson Harrisson
Harrisson, USA
hatbox hatbox
hatbox, USA
heart-sh heart-sh
, Hungary
Helga Helga
Helga, USA
Helga Helga
Helga, USA
Helga Helga
Helga, USA
Helga Helga
, mexico
Helga Helga
Helga, USA
Helga Helga
, mexico
Helga Helga
Helga, USA
Helga Helga
Helga, USA
Helga Helga
Helga, USA
Helga Helga
Helga, USA
Helga Helga
Helga, USA
Helga Helga
, mexico
Helga Helga
Helga, USA
Henris Henris
Henris, USA
Henry Henry
Henry, USA
Herbert Herbert
Herbert, USA
Hillary Hillary
, mexico
Hillary Hillary
Hillary, USA
Hillary Hillary
Hillary, USA
Hillary Hillary
, mexico
Hillary Hillary
, mexico
Hillary Hillary
Hillary, USA
Hillary Hillary
Hillary, USA
Hillary Hillary
Hillary, USA
Hillary Hillary
, mexico
Hillary Hillary
Hillary, USA
Hillary Hillary
Hillary, USA
Hillary Hillary
, mexico
Hillary Hillary
Hillary, USA
Hollister Hollister
, Hungary
hotbox hotbox
hotbox, USA
howdoima howdoima
howdoima, USA
howtobox howtobox
, Hungary
icebox icebox
, Hungary
icebox-o icebox-o
icebox-o, USA
iceboxly iceboxly
iceboxly, USA
iceboxre iceboxre
iceboxre, USA
imitation rolex imitation rolex
, Hungary
Ines Ines
, Hungary
Ivan Ivan
Ivan, USA
Ivan Ivan
Ivan, USA
Izabella Izabella
Izabella, USA
Jenifer Jenifer
Jenifer, USA
Jenifer Jenifer
Jenifer, USA
Jeremi Jeremi
Jeremi, USA
Jesika Jesika
Jesika, USA
jewelryt jewelryt
jewelryt, USA
Jozeff Jozeff
Jozeff, USA
Jozeff Jozeff
Jozeff, USA
jozefina jozefina
jozefina, USA
jozefina jozefina
jozefina, USA
Julia Julia
Julia, USA
Julia Julia
Julia, USA
jumbo buffett jumbo buffett
jumbo buffett, jumbo buffett
jumbo buffett
Karolina Karolina
Karolina, USA
Kelvin Kelvin
Kelvin, USA
Vahur Kotkas
Institute of Cybernetics at TTU, ESTONIA
Computer Science
In the current talk an extension to the Java classes is presented, that enables automated program synthesis out of given specifications. Java classes are extended with high level specifications that can be automatically handled by a synthesizer program which performs the actual program construction. The structure of the synthesizer and its working principle is also discussed.
Kris Kris
Kris, USA
Kriss Kriss
Kriss, USA
Kriss Kriss
Kriss, USA
Kriss Kriss
Kriss, USA
Kristi Kristi
Kristi, USA
Kristi Kristi
Kristi, USA
Kristian Kristian
Kristian, USA
Kristian Kristian
Kristian, USA
Kristofer Kristofer
Kristofer, USA
Kristofer Kristofer
Kristofer, USA
Kristofer Kristofer
Kristofer, USA
kumbia kumbia
, Hungary
Kumbia Kumbia
, Hungary
Sven Laur
University of Tartu, Estonia
informatics
Most common drawbacks of asymetric cryptograpy are low efficiency and a difficult key generation. In recent years several efficient encryption and signing schemes were proposed. Some of them are related with convolution rings such as an encryption scheme NTRU which was followed by signing schemes NSS and NTRUSIGN.
Conditional reliability is common for all these schemes. Their completeness is strongly linked with coefficient distributions of polynomial multiples. The presentation is dedicated to the probability distributions. We give a method how to calculate and approximate those distributions and some practical results which are direct conclusions.
Leny Leny
Leny, USA
Leny Leny
Leny, USA
Leonardo Leonardo
Leonardo, USA
Lika Lika
Lika, USA
Lika Lika
Lika, USA
limogesb limogesb
, Hungary
Linda Linda
Linda, USA
Linda Linda
Linda, USA
Linda Linda
Linda, USA
Lion Lion
Lion, USA
Lolita Lolita
Lolita, USA
Lolita Lolita
Lolita, USA
Lolita Lolita
Lolita, USA
lunchbox lunchbox
, Hungary
lunchbox lunchbox
lunchbox, USA
mailboxe mailboxe
, Hungary
mailboxp mailboxp
, Hungary
maninabo maninabo
, Hungary
Margarita Margarita
Margarita, USA
Margarita Margarita
Margarita, USA
Margarita Margarita
Margarita, USA
Margarita Margarita
Margarita, USA
Margarita Margarita
Margarita, USA
Margarita Margarita
Margarita, USA
Mariana Mariana
Mariana, USA
Mariana Mariana
Mariana, USA
Marina Marina
Marina, USA
Marina Marina
Marina, USA
Marina Marina
Marina, USA
Marina Marina
Marina, USA
Marina Marina
Marina, USA
Marisobel Marisobel
Marisobel, USA
Martin Martin
Martin, USA
Martin Martin
Martin, USA
Martin Martin
Martin, USA
Martin Martin
Martin, USA
Martin Martin
Martin, USA
Merlin Merlin
Merlin, USA
Merlin Merlin
Merlin, USA
Miki Miki
Miki, USA
Miki Miki
Miki, USA
Mikki Mikki
Mikki, USA
Milisa Milisa
Milisa, USA
Miranda Miranda
Miranda, USA
Miranda Miranda
Miranda, USA
Miranda Miranda
Miranda, USA
Miranda Miranda
Miranda, USA
Miranda Miranda
Miranda, USA
Miranda Miranda
Miranda, USA
Miranda Miranda
Miranda, USA
Miranda Miranda
Miranda, USA
Miranda Miranda
Miranda, USA
Miranda Miranda
Miranda, USA
Miranda Miranda
Miranda, USA
Miranda Miranda
Miranda, USA
Miranda Miranda
Miranda, USA
Mishel Mishel
Mishel, USA
Mishel Mishel
Mishel, USA
Misterio Misterio
Misterio, USA
Misterio Misterio
Misterio, USA
mold mold
, Hungary
moneybox moneybox
, Hungary
Monika Monika
Monika, USA
Monika Monika
Monika, USA
Monika Monika
Monika, USA
Monika Monika
Monika, USA
motorola ringtones motorola ringtones
motorola ringtones, USA
motorola ringtones motorola ringtones
motorola ringtones, USA
Oleg Mürk
University of Tartu, Estonia
Institute of Computer Science
Until recently the constructions of time-stamping had design that consisted of one principal issuing timestamps. For this reason unresponsiveness or failure of one principal would lead to unresponsiveness or failure of the whole service. At best, failures could be detected later after some period of time (accountability). First attempt to improve the situation by using multiple distributed instances of time-stamping servers was made in [ABSW01].
The aim of our research is to construct robust and available time-stamping service (TSS) out of N simple autonomous distributed principals in such manner that the service remains functional as long as less than T principals fail arbitrarily. We have identified different environments, in which time-stamping service could operate: a world, where communication is asynchronous, but principals have access to a synchronized clock (absolute time-stamping) and a world, where principals do not have access to the clock (relative time-stamping).
We have constructed simple, available, robust, and efficient constructions for both absolute and relative time-stamping. Our construction of absolute time-stamping fails only if at least (N+1)/2 principals fail arbitrarily. Our construction of relative time-stamping fails only if at least (N+2)/3 principals fail arbitrarily.
Bibliography
myspacec myspacec
myspacec, USA
Natali Natali
Natali, USA
Natasha Natasha
Natasha, USA
Natasha Natasha
Natasha, USA
Natasha Natasha
Natasha, USA
Ñhanel Ñhanel
, Hungary
Nica Nica
Nica, USA
Nica Nica
Nica, USA
Nika Nika
Nika, USA
Nika Nika
Nika, USA
Nikalai Nikalai
Nikalai, USA
Nikalai Nikalai
Nikalai, USA
Niki Niki
Niki, USA
Nikita Nikita
Nikita, USA
Nikita Nikita
Nikita, USA
Nikita Nikita
Nikita, USA
Nikita Nikita
Nikita, USA
Nina Nina
Nina, USA
Nina Nina
Nina, USA
Ninaska Ninaska
Ninaska, USA
Ninaska Ninaska
Ninaska, USA
Nokia Nokia
, Hungary
Nokia Nokia
, Hungary
Nolik Nolik
Nolik, USA
Nolik Nolik
Nolik, USA
Nolik Nolik
Nolik, USA
nsantiquerolex nsantiquerolex
, Hungary
nsantiquerolex nsantiquerolex
, Hungary
nscarspeakertuor nscarspeakertuor
, Hungary
nsiamoncarspeaker nsiamoncarspeaker
, Hungary
nsiamoncarspeaker nsiamoncarspeaker
, Hungary
nsjapanrolex nsjapanrolex
, Hungary
nsrolexcellini nsrolexcellini
, Hungary
nsrolexcellini nsrolexcellini
, Hungary
nsrolexgmt nsrolexgmt
, Hungary
nsrolexlogo nsrolexlogo
, Hungary
nsrolexlogo nsrolexlogo
, Hungary
nsrolextuor nsrolextuor
, Hungary
nsrolexwatch nsrolexwatch
, Hungary
nsswissrolex nsswissrolex
, Hungary
olli olli
, Hungary
Omega Omega
, Hungary
openbra openbra
, Hungary
oyfwwi oyfwwi
PZgdxKHskyFYXe, uFuVVhyWr
pJtbVoSVRingytokZ
Paper Paper
, Hungary
Paper Paper
, Hungary
Patrik Patrik
Patrik, USA
Patrik Patrik
Patrik, USA
Pedro Pedro
Pedro, USA
Pedro Pedro
Pedro, USA
Penny Penny
Penny, USA
Penny Penny
Penny, USA
Pent Pent
, Hungary
Pent Pent
, Hungary
Phet Phet
Phet, USA
Phet Phet
Phet, USA
phetermine phetermine
, Hungary
phetermine phetermine
, Hungary
Phetermine Phetermine
, Hungary
Phetermine Phetermine
, Hungary
Pinho Pinho
Pinho, USA
Piter Piter
Piter, USA
Piter Piter
Piter, USA
Piter Piter
Piter, USA
Piter Piter
Piter, USA
Piter Piter
Piter, USA
Piter Piter
Piter, USA
Piterman Piterman
Piterman, USA
planotac planotac
planotac, USA
plasticb plasticb
plasticb, USA
Pol Pol
Pol, USA
Pol Pol
Pol, USA
Pol Pol
Pol, USA
Pol Pol
Pol, USA
Pol Pol
Pol, USA
Pol Pol
Pol, USA
Poll Poll
Poll, USA
Poll Poll
Poll, USA
prada prada
, Hungary
Prada Prada
, Hungary
pringleb pringleb
pringleb, USA
Prom Prom
, Hungary
Prom Prom
, Hungary
Pumpkin Pumpkin
, Hungary
Pumpkin Pumpkin
, Hungary
pussy pussy
, mexico
pussy pussy
, mexico
Radrigez Radrigez
Radrigez, USA
Radrigez Radrigez
Radrigez, USA
Raf Raf
, Hungary
Raf Raf
, Hungary
Recardo Recardo
Recardo, USA
Rekardo Rekardo
Rekardo, USA
replica replica
, Hungary
Replica Replica
, Hungary
replica handbags replica handbags
replica handbags, USA
replica handbags replica handbags
replica handbags, USA
replica handbags replica handbags
replica handbags, USA
replica handbags replica handbags
replica handbags, USA
replica handbags replica handbags
replica handbags, USA
replica rolex replica rolex
replica rolex, USA
replica rolex replica rolex
replica rolex, USA
replica rolex replica rolex
replica rolex, USA
replica rolex replica rolex
replica rolex, USA
replica rolex replica rolex
replica rolex rolex replica replica rolex watches rolex watch swiss ro, mexico
replica rolex rolex replica replica rolex watches
replica rolex watches replica rolex watches
, Hungary
replica watches replica watches
replica watches, USA
replica watches replica watches
, mexico
replica watches replica watches
, mexico
replica watches replica watches
replica watches, USA
replica watches replica watches
replica watches, USA
replica watches replica watches
replica watches, USA
replica watches replica watches
replica watches, USA
replica watches replica watches
replica watches, USA
replica watches replica watches
replica watches, USA
replica watches replica watches
replica watches, USA
replica watches replica watches
replica watches, USA
Replica watches Replica watches
Replica watches, USA
Replica watches Replica watches
Replica watches, USA
Replica watches Replica watches
Replica watches, USA
Replica watches Replica watches
, Hungary
Replica watches Replica watches
Replica watches, USA
Replica watches Replica watches
, mexico
Replica watches Replica watches
Replica watches, USA
Replica watches Replica watches
, mexico
Replica watches Replica watches
Replica watches, USA
Replica watches Replica watches
Replica watches, USA
Ricardo Ricardo
Ricardo, USA
Ricardo Ricardo
Ricardo, USA
Richard Richard
Richard, USA
Richard Richard
Richard, USA
Richard Richard
Richard, USA
Richard Richard
Richard, USA
Richard Richard
Richard, USA
Richard Richard
Richard, USA
Richard Richard
Richard, USA
Richard Richard
Richard, USA
Richard Richard
Richard, USA
Richard Richard
Richard, USA
Richard Richard
Richard, USA
Richard Richard
Richard, USA
Richard Richard
Richard, USA
Richi Richi
Richi, USA
Richi Richi
Richi, USA
Rick Rick
Rick, USA
riddlebo riddlebo
riddlebo, USA
Rima Rima
Rima, USA
Rima Rima
Rima, USA
Rington Rington
, Hungary
Rington Rington
, Hungary
Robert Robert
Robert, USA
Robert Robert
Robert, USA
Robert Robert
Robert, USA
Robert Robert
Robert, USA
Robert Robert
Robert, USA
Robert Robert
Robert, USA
Robert Robert
Robert, USA
Roi Roi
, Hungary
rolex replica rolex replica
, mexico
Rozmari Rozmari
Rozmari, USA
Rozmari Rozmari
Rozmari, USA
Rozmari Rozmari
Rozmari, USA
Rozmari Rozmari
Rozmari, USA
Rudenko Rudenko
Rudenko, USA
Rudenko Rudenko
Rudenko, USA
Ruslan Ruslan
Ruslan, USA
Saimon Saimon
Saimon, USA
Saimon Saimon
Saimon, USA
Samsung Samsung
, Hungary
Sandra Sandra
Sandra, USA
sanfranc sanfranc
sanfranc, USA
Saveli Saveli
Saveli, USA
Saveli Saveli
Saveli, USA
Raul Savimaa
Tallinn Technical University, Eesti
Computer Control Dept.
Modelling of Organisations using agents
Abstract. This paper briefly describes a methodology for modelling multifunctional non-profit organisations. Methodology stresses the importance of modelling both work processes and the structure of organisation, and suggests agent technologies as the basis for modelling the behaviour of work processes and the organisation. Methodology also supports quantitative assessment of organisation's performance in comparison with its goals and may assist in drawing up suggestions how to improve organisation's efficiency.
Problem description
Many organisations work in a dynamically changing environment. This means that their work processes and goals are to be modified often to meet the changing requirements and operating conditions. For example, the efficiency of organisation's performance becomes not satisfactory and the organisation may need to modify its sub-goals and inner structure. Also, the overall functioning goal of an organisation may change due to changes in the requirements of the society. In a large organisation there always is some ongoing adjustment for ways to achieve the goals, or for goals themselves. These modifications are often done intuitively, thus the results depend heavily on subjective capabilities of leaders. Organisations covered by this methodology are different multi-functional agencies from non-manufacturing domain, and non-profit organisations.
A tool that enables to forecast the effect of modifications would reduce the potentially harmful side effect of modifications, and to compare objectively the alternative re-organisation strategies. Such a tool is even more important since the restructuring is to be carried out “on-line”, i.e. without suspending the everyday activities. Quite often the modifications should be carried out without increasing day-to-day operating costs, only limited additional resources can be used for exceptional cases. It is suggested that simulation, combined with some theoretical analysis on a sufficiently powerful and regularly updated model of the organisation could form the basis of such a tool. This presentation will outline the main features of a process that leads to such a model.
2 Some preconditions for resultant modelling
There are three critical aspects that are to be appreciated when modelling an organisation.
First. Organisation's goals and capabilities (that result from resources and the way they are used) usually do not match. When giving tasks to organisation, normally the details of work processes are not specified. Also, in real life very seldom an analysis is made of whether the goals, capabilities and constraints are contradictory – i.e. are the tasks achievable. Quite often time constraints are not considered in models whereas the tasks leading to achieving goals are time-dependant. Therefore models should handle sufficiently sophisticated time category – not just for ordering activities.
Second. Resulting from the previous aspect, many lower level decisions during the execution of a task are left to structural units of the organisation. Each structural unit in an organisation has its own goal. The employees are personalities with their own wishes, opinions, and goals. It is important to match the goals of the organisation, its structural units and its employees, at least to certain extent. Any organisation is in principle non-deterministic since the actual behaviour on an employee is affected by many different reasons (for example – different interpretations of real situations, religious, ethical or moral beliefs, but also by personal interests, comfort requirements, and expected personal benefit).
Third. Organisations have to function continuously. To guarantee persistent support from models, the latter should be regularly updated.
3 Modelling of organisation and personnel behaviour using agents
Since the performance of organisations depends heavily on employees, one also needs a generic model for analysing their behaviour. This cannot be done using conventional algorithmic approach since the behaviour of employees, as well as that of a whole organisation is ongoing, determined by interactions, goals, existing knowledge and the ability to acquire new knowledge.
Models of interactive computing, and agent technology in particular seems the most suitable for this application. Agents are already used in many application domains, including teamwork modelling and collaborative man-machine decision-making. Principles of agent behaviour are quite similar to human ones. A suitable agent type seems to be BDI (belief-desire-intention)-agents.
Organisation, as well as its structural units should therefore be handled as multi-agent systems. Moreover, it is useful to handle each organisational unit (which consists of employees) itself as a multi-agent system.
4 Description of methodology
A model of an organisation is developed in four stages. The first stage (i.e. description of tasks faced by, and the existing inner structure of organisation) and last stage (implementation of organisational modifications, monitoring and evaluation of results) do not substantially differ from the standard approach. UML (Unified Modelling Language) is suggested to be used for describing the inner structure of the organisation and its tasks.
The second stage departs from the UML description and transforms it into multi-agent presentation. The Q-model is used for modelling of work processes and agents are used for modelling structural units and some individual employees. Special attention should be paid to analysis of timing bottlenecks and potential conflicts of interests inside of the organisation. The third stage provides support for formulation of proposals and for developing modification plans and. This stage uses various decision-making methods and applies the model resulting from the second stage for simulational studies.
Currently for analytical study and simulation of the Q-model LIMITS CASE tool is used, for study of agents' behaviour JADE tool is planned. Some examples are provided to illustrate some aspects of this methodology.
Sebastyn Sebastyn
Sebastyn, USA
Sem Sem
Sem, USA
Sem Sem
Sem, USA
Sem Sem
Sem, USA
Sem Sem
Sem, USA
Semen Semen
Semen, USA
Sergei Sergei
Sergei, USA
Sergei Sergei
Sergei, USA
Sergio Sergio
Sergio, USA
Sergio Sergio
Sergio, USA
Sevastyn Sevastyn
Sevastyn, USA
Sevastyn Sevastyn
Sevastyn, USA
Silver Silver
, Hungary
Silver Silver
, Hungary
Sofia Sofia
Sofia, USA
Sofia Sofia
Sofia, USA
Sofia Sofia
Sofia, USA
Sofia Sofia
Sofia, USA
Sofia Sofia
Sofia, USA
Sofia Sofia
Sofia, USA
Sofia Sofia
Sofia, USA
Sony Sony
Sony, USA
Sonya Sonya
Sonya, USA
sonymusi sonymusi
, Hungary
speakerb speakerb
, Hungary
Sprint Sprint
, Hungary
Sprint Sprint
, Hungary
Stan Stan
Stan, USA
String String
, Hungary
String String
, Hungary
Sumot Sumot
MBBrJohBAI, wflwKpvOXNdcKm
jUNBGFYMZyWGwPXyE
Suzana Suzana
Suzana, USA
Sven Sven
, Hungary
Sven Sven
Sven, USA
Sven Sven
Sven, USA
tacklebo tacklebo
tacklebo, USA
tacklebo tacklebo
tacklebo, USA
Tany Tany
Tany, USA
Teodor Teodor
Teodor, USA
Teodor Teodor
Teodor, USA
Tervas Tervas
, Hungary
Tervas Tervas
, Hungary
thecarspeaker thecarspeaker
, Hungary
thecarspeaker thecarspeaker
, Hungary
thecarspeakerealer thecarspeakerealer
, Hungary
thecarspeakergmtii thecarspeakergmtii
, Hungary
thecarspeakerlogo thecarspeakerlogo
, Hungary
thecarspeakerlogo thecarspeakerlogo
, Hungary
thecarspeakeroyster thecarspeakeroyster
, Hungary
thecarspeakeroyster thecarspeakeroyster
, Hungary
thecarspeakerprices thecarspeakerprices
, Hungary
thecarspeakerwatch thecarspeakerwatch
, Hungary
thecarspeakerwatch thecarspeakerwatch
, Hungary
thefakecarspeaker thefakecarspeaker
, Hungary
theiamoncarspeaker theiamoncarspeaker
, Hungary
thejapancarspeaker thejapancarspeaker
, Hungary
theswisscarspeaker theswisscarspeaker
, Hungary
Tifani Tifani
Tifani, USA
Timi Timi
Timi, USA
Timi Timi
Timi, USA
Tina Tina
, Hungary
Tina Tina
Tina, USA
Tina Tina
Tina, USA
Tiny Tiny
, Hungary
Titova Titova
Titova, USA
Titova Titova
Titova, USA
Titova Titova
Titova, USA
Titova Titova
Titova, USA
Titova Titova
Titova, USA
Titova Titova
Titova, USA
Titova Titova
Titova, USA
Titova Titova
Titova, USA
Tixier Tixier
Tixier, USA
Tixier Tixier
Tixier, USA
Tixier Tixier
Tixier, USA
Tixier Tixier
Tixier, USA
Tixier Tixier
Tixier, USA
Tixier Tixier
Tixier, USA
Tixier Tixier
Tixier, USA
Tixier Tixier
Tixier, USA
Tixier Tixier
Tixier, USA
Tomko Tomko
Tomko, USA
Tomko Tomko
Tomko, USA
Tomko Tomko
Tomko, USA
Tomko Tomko
, Hungary
Tomko Tomko
Tomko, USA
Tori Tori
Tori, USA
Tori Tori
Tori, USA
Trahktengerts Trahktengerts
Trahktengerts, USA
Trahktengerts Trahktengerts
Trahktengerts, USA
Trahktengerts Trahktengerts
Trahktengerts, USA
Trahktengerts Trahktengerts
Trahktengerts, USA
Trahktengerts Trahktengerts
Trahktengerts, USA
Trahktengerts Trahktengerts
, Hungary
Trahktengerts Trahktengerts
Trahktengerts, USA
Trahktengerts Trahktengerts
Trahktengerts, USA
Trahktengerts Trahktengerts
Trahktengerts, USA
Tramodol Tramodol
, Hungary
Tramodol Tramodol
, Hungary
Transparent Transparent
, Hungary
Transparent Transparent
, Hungary
Trecci Trecci
Trecci, USA
Trevis Trevis
Trevis, USA
Trevis Trevis
Trevis, USA
Trevis Trevis
Trevis, USA
Trevis Trevis
Trevis, USA
Triska Triska
Triska, USA
Triska Triska
Triska, USA
Triska Triska
Triska, USA
Triska Triska
Triska, USA
Troshichev Troshichev
Troshichev, USA
Troshichev Troshichev
Troshichev, USA
Troshichev Troshichev
Troshichev, USA
Troshichev Troshichev
Troshichev, USA
Troshichev Troshichev
Troshichev, USA
Troshichev Troshichev
Troshichev, USA
Tsuruda Tsuruda
Tsuruda, USA
Tsuruda Tsuruda
Tsuruda, USA
Tsuruda Tsuruda
Tsuruda, USA
Tsuruda Tsuruda
Tsuruda, USA
Turunen Turunen
Turunen, USA
Turunen Turunen
Turunen, USA
Turunen Turunen
Turunen, USA
Turunen Turunen
Turunen, USA
Turunen Turunen
Turunen, USA
Turunen Turunen
Turunen, USA
Turunen Turunen
Turunen, USA
Turunen Turunen
Turunen, USA
Turunen Turunen
Turunen, USA
Turunen Turunen
Turunen, USA
Turunen Turunen
Turunen, USA
Turunen Turunen
Turunen, USA
Turunen Turunen
Turunen, USA
utahboxe utahboxe
utahboxe, USA
Valentin Valentin
Valentin, USA
Valentin Valentin
Valentin, USA
Valentin Valentin
Valentin, USA
Valentin Valentin
Valentin, USA
Van Prooyen Van Prooyen
Van Prooyen, USA
Van Prooyen Van Prooyen
Van Prooyen, USA
Van Prooyen Van Prooyen
Van Prooyen, USA
Van Prooyen Van Prooyen
Van Prooyen, USA
Vanitie Vanitie
, Hungary
Vanities Vanities
, Hungary
Vanities Vanities
, Hungary
Vera Vera
Vera, USA
Vera Vera
Vera, USA
Veronika Veronika
Veronika, USA
viagra viagra
viagra, USA
viagra viagra
viagra, USA
viagra viagra
viagra, USA
viagra viagra
viagra, USA
Matteo Viale
Torino University (Italy), Italy
Mathematics
Looking for a suitable logic for the subtype relation between the types of the intersection types lambda calculus we developed a modal logic with a two-places modality.
We present here its main syntactical and semantical properties, that is, the completeness theorem, the finite model property, the cut-elimination theorem and a decision procedure for theoremhood and its relations with the intersection types.
It is interesting to note that the binary modality is a sort of implication for which the deduction theorem does not hold.
Vica Vica
, Hungary
Vica Vica
, Hungary
Victor Victor
Victor, USA
Victor Victor
Victor, USA
Victoria Victoria
Victoria, USA
Victoria Victoria
Victoria, USA
Victoria Victoria
Victoria, USA
Victoriya Victoriya
Victoriya, USA
Victoriya Victoriya
Victoriya, USA
Viki Viki
Viki, USA
Violetta Violetta
Violetta, USA
Violetta Violetta
Violetta, USA
Vito Vito
, Hungary
Vito Vito
, Hungary
Vova Vova
Vova, USA
Walker Walker
Walker, USA
Walker Walker
Walker, USA
Walker Walker
Walker, USA
Walker Walker
Walker, USA
Walker Walker
Walker, USA
Walker Walker
Walker, USA
Wall Wall
Wall, USA
Wall Wall
Wall, USA
Walt Walt
Walt, USA
Walt Walt
Walt, USA
Walt Walt
Walt, USA
Walt Walt
Walt, USA
Walt Walt
Walt, USA
Watch Watch
, Hungary
Watch Watch
, Hungary
wholesale wholesale
, Hungary
Jan Willemson
Tartu University, Estonia
Institute of Computer Science
As the result of several years of research in the field of time-stamping, a new class of time-stamping schemes was lately proposed by Buldas and Willemson, providing the smallest currently known linked time stamps for digital signatures. Although being efficient in the sense of time stamp size, their schemes are defined quite inconveniently for practcal implementation. Namely, the construction of the graphs in the family is recursive and hence the direct implementation algorithm should be recursive as well.
On the other hand, the ideology of time-stamping is step-by-step: the server waits for the request in some internal state, then changes the state by some computations, outputs the time stamp and waits for the next request. In order to guarantee the ability to continue the time-stamping history after server's crash, it must be easy to restore the internal state of the server, but this is rather complicated if the server works by a recursive algorithm.
Hence one needs to develop an equivalent non-recursive algorithm and this is the topic of the presentation.
Work Work
, Hungary
Xana Xana
, Hungary
Xana Xana
, Hungary
xboxchea xboxchea
xboxchea, USA
Yair Yair
Yair, USA
Yair Yair
Yair, USA
Yair Yair
Yair, USA
Yair Yair
Yair, USA
Yair Yair
Yair, USA
Yair Yair
Yair, USA
Yair Yair
Yair, USA
Yair Yair
Yair, USA
Yair Yair
Yair, USA
Yair Yair
Yair, USA
Yamagishi Yamagishi
Yamagishi, USA
Yamagishi Yamagishi
Yamagishi, USA
Yamagishi Yamagishi
Yamagishi, USA
Yamagishi Yamagishi
Yamagishi, USA
Yamagishi Yamagishi
Yamagishi, USA
Yearby Yearby
Yearby, USA
Yearby Yearby
Yearby, USA
Yearby Yearby
Yearby, USA
Yearby Yearby
Yearby, USA
Yearby Yearby
Yearby, USA
Yearby Yearby
Yearby, USA
Yearby Yearby
Yearby, USA
yellowbo yellowbo
yellowbo, USA
Zigman Zigman
Zigman, USA
Zigman Zigman
Zigman, USA
Zigman Zigman
Zigman, USA
Zigman Zigman
Zigman, USA
Zigman Zigman
Zigman, USA
Zigman Zigman
Zigman, USA
Zigman Zigman
Zigman, USA
http://www.cs.ioc.ee/yik/schools/win2002/
Modified Tuesday, Jun 14, 2011 at 13:48 EEST+0300 by monika@cs.ioc.ee