Networked noncooperative games are investigated,where each player(or agent) plays with all other players in its neighborhood. Assume the evolution is based on the fact that each player uses its neighbors current infor...Networked noncooperative games are investigated,where each player(or agent) plays with all other players in its neighborhood. Assume the evolution is based on the fact that each player uses its neighbors current information to decide its next strategy. By using sub-neighborhood, the dynamics of the evolution is obtained. Then a method for calculating Nash equilibriums from mixed strategies of multi-players is proposed.The relationship between local Nash equilibriums based on individual neighborhoods and global Nash equilibriums of overall network is revealed. Then a technique is proposed to construct Nash equilibriums of an evolutionary game from its one step static Nash equilibriums. The basic tool of this approach is the semi-tensor product of matrices, which converts strategies into logical matrices and payoffs into pseudo-Boolean functions, then networked evolutionary games become discrete time dynamic systems.展开更多
The privacy protection of resource description framework （schema） （RDF（S） ） repository is an emerging topic in database security area. In this paper, entailment rules are investigated based on RDF（S） repositor...The privacy protection of resource description framework （schema） （RDF（S） ） repository is an emerging topic in database security area. In this paper, entailment rules are investigated based on RDF（S） repository firstly. Then, an idea that uses reasoning closure to judge whether the privacy disclosure caused by inference is existed is proposed. Furthermore, the definitions of impli- cation conditions and information measure of triple statements which gains data hiding algorithm with combining proposition logic reasoning theory are introduced. Meanwhile, a conversion method from conjunctive normal form to disjunctive normal form based minimal hitting sets of set cluster is aiso proposed. Finally, the experimental results show that our algorithm can prevent privacy disclosure of RDF（S） repository effectively.展开更多
文摘Networked noncooperative games are investigated,where each player(or agent) plays with all other players in its neighborhood. Assume the evolution is based on the fact that each player uses its neighbors current information to decide its next strategy. By using sub-neighborhood, the dynamics of the evolution is obtained. Then a method for calculating Nash equilibriums from mixed strategies of multi-players is proposed.The relationship between local Nash equilibriums based on individual neighborhoods and global Nash equilibriums of overall network is revealed. Then a technique is proposed to construct Nash equilibriums of an evolutionary game from its one step static Nash equilibriums. The basic tool of this approach is the semi-tensor product of matrices, which converts strategies into logical matrices and payoffs into pseudo-Boolean functions, then networked evolutionary games become discrete time dynamic systems.
基金Supported by the National Natural Science Foundation of China(61272511)
文摘The privacy protection of resource description framework （schema） （RDF（S） ） repository is an emerging topic in database security area. In this paper, entailment rules are investigated based on RDF（S） repository firstly. Then, an idea that uses reasoning closure to judge whether the privacy disclosure caused by inference is existed is proposed. Furthermore, the definitions of impli- cation conditions and information measure of triple statements which gains data hiding algorithm with combining proposition logic reasoning theory are introduced. Meanwhile, a conversion method from conjunctive normal form to disjunctive normal form based minimal hitting sets of set cluster is aiso proposed. Finally, the experimental results show that our algorithm can prevent privacy disclosure of RDF（S） repository effectively.
