Database Reference
In-Depth Information
U
ð
T 0 Þ
- accrual of knowledge in the repository in the interval
t ½
0
T 0
:
;
G D
G P
U
ð
T 0 Þ¼
\
;
Within a certain calendar interval
½
0
T 0
, knowledge accrual in the repository
;
has to be maximal:
G D
G P
U
ð
T 0 Þ¼
\
¼
Max
N
;
8.4.5 Formulating the Repository Motivation Model
For the given:
1. Domain D and its ontology graph G D
2. Set of tasks R
¼f
r i g
and task parameters:
P ¼f
Q
ð
r i Þ ;
A
ð
r i Þg
c
c
3. Stochastic creators' arrival pattern
p ð
C
Þ
and arrival process parameters
f w
; l
g
e
e
4. Stochastic editors' arrival pattern
p ð
E
Þ
and arrival process parameters
f w
; l
g
One has to :
E regarding repository filling
(b) Optimize each arriving creator's c z goal function of the task choice r i ð
(a) Form the editor's motivation function
s
c z Þ
C
z
according to his/her motivation function
s
y i Þ¼ as
E
C
þ s
Z ¼
max
Y
;
(c) Choose properly solved tasks among the ones made by creators according to the
grade
G D
\
G
ð
r i ð
c z ÞÞ 6¼; ;
and supplement the repository with chosen tasks
G P
¼
Gr 1 ð
ð
c 1 Þ
Þ [
Gr 2 ð
ð
c 2 Þ
Þ [[
Gr i ð
ð
c z Þ
Þ [ ;
Repository filling criterion:
U
ð
T 0 Þ
- knowledge accrual in the repository within a calendar interval
½
0
T 0
;
G D
G P
U
ð
T 0 Þ¼
\
¼
max
Search WWH ::




Custom Search