This paper presents a game theory-based method for predicting the outcomes of negotiation and group decision-making problems. We propose an extension to the BDM model to address problems where actors’ positions are d...This paper presents a game theory-based method for predicting the outcomes of negotiation and group decision-making problems. We propose an extension to the BDM model to address problems where actors’ positions are distributed over a position spectrum. We generalize the concept of position in the model to incorporate continuous positions for the actors, enabling them to have more flexibility in defining their targets. We explore different possible functions to study the role of the position function and discuss appropriate distance measures for computing the distance between the positions of actors. To validate the proposed extension, we demonstrate the trustworthiness of our model’s performance and interpretation by replicating the results based on data used in earlier studies.展开更多
Given a graph g=( V,A ) , we define a space of subgraphs M with the binary operation of union and the unique decomposition property into blocks. This space allows us to discuss a notion of minimal subgraphs (minimal c...Given a graph g=( V,A ) , we define a space of subgraphs M with the binary operation of union and the unique decomposition property into blocks. This space allows us to discuss a notion of minimal subgraphs (minimal coalitions) that are of interest for the game. Additionally, a partition of the game is defined in terms of the gain of each block, and subsequently, a solution to the game is defined based on distributing to each player (node and edge) present in each block a payment proportional to their contribution to the coalition.展开更多
To address the issues that middleboxes as a fundamental part of today's networks are facing, Network Function Virtualization(NFV)has been recently proposed, which in essence asserts to migrate hardware-based middl...To address the issues that middleboxes as a fundamental part of today's networks are facing, Network Function Virtualization(NFV)has been recently proposed, which in essence asserts to migrate hardware-based middleboxes into software-based virtualized function entities.Due to the demands of virtual services placement in NFV network environment, this paper models the service amount placement problem involving with the resources allocation as a cooperative game and proposes the placement policy by Nash Bargaining Solution(NBS). Specifically,we first introduce the system overview and apply the rigorous cooperative game-theoretic guide to build the mathematical model, which can give consideration to both the responding efficiency of service requirements and the allocation fairness.Then a distributed algorithm corresponding to NBS is designed to achieve predictable network performance for virtual instances placement.Finally, with simulations under various scenarios,the results show that our placement approach can achieve high utilization of network through the analysis of evaluation metrics namely the satisfaction degree and fairness index. With the suitable demand amount of services, the average values of two metrics can reach above 90%. And by tuning the base placement, our solution can enable operators to flexibly balance the tradeoff between satisfaction and fairness of resourcessharing in service platforms.展开更多
<span><b><span style="font-family:"">Objective</span></b></span><span><span><span style="font-family:"">: To study the status of onli...<span><b><span style="font-family:"">Objective</span></b></span><span><span><span style="font-family:"">: To study the status of online game addiction, self-control ability and family function, analyze the influence factors and the relationship between them. <b>Methods</b>: The questionnaire of online game addiction, family function and self-control ability was used to investigate some college students. <b>Results</b>: 1) The detection rate of college students’ online game addiction is 40%. There are significant differences in sex, grade and only child in online game addiction. 2) There are significant differences in self-control ability and family function between online game addicts and non-addicts. 3) Self-control ability and family function have a significant predictive effect on online game addiction. <b>Conclusion</b>: College students’ online game addiction is affected by their self-control ability and family function, and it can be alleviated by improving their self-control ability and family function.</span></span></span><span style="font-family:""></span> </p>展开更多
Chaos game representation (CGR) of DNA sequences and linked protein sequences from genomes was proposed by Jeffrey (1990) and Yu et al. (2004), respectively. In this paper, we consider the CGR of three kinds of sequen...Chaos game representation (CGR) of DNA sequences and linked protein sequences from genomes was proposed by Jeffrey (1990) and Yu et al. (2004), respectively. In this paper, we consider the CGR of three kinds of sequences from complete genomes: whole genome DNA sequences, linked coding DNA sequences and linked protein sequences. Some fractal patterns are found in these CGRs. A recurrent iterated function systems (RIFS) model is proposed to simulate the CGRs of these sequences from genomes and their induced measures. Numerical results on 50 genomes show that the RIFS model can simulate very well the CGRs and their induced measures. The parameters estimated in the RIFS model reflect information on species classification.展开更多
Investigating the biological function of proteins is a key aspect of protein studies. Bioinformatic methods become important for studying the biological function of proteins. In this paper, we first give the chaos gam...Investigating the biological function of proteins is a key aspect of protein studies. Bioinformatic methods become important for studying the biological function of proteins. In this paper, we first give the chaos game representation (CGR) of randomly-linked functional protein sequences, then propose the use of the recurrent iterated function systems (RIFS) in fractal theory to simulate the measure based on their chaos game representations. This method helps to extract some features of functional protein sequences, and furthermore the biological functions of these proteins. Then multifractal analysis of the measures based on the CGRs of randomly-linked functional protein sequences are performed. We find that the CGRs have clear fractal patterns. The numerical results show that the RIFS can simulate the measure based on the CGR very well. The relative standard error and the estimated probability matrix in the RIFS do not depend on the order to link the functional protein sequences. The estimated probability matrices in the RIFS with different biological functions are evidently different. Hence the estimated probability matrices in the RIFS can be used to characterise the difference among linked functional protein sequences with different biological functions. From the values of the Dq curves, one sees that these functional protein sequences are not completely random. The Dq of all linked functional proteins studied are multifractal-like and sufficiently smooth for the Cq (analogous to specific heat) curves to be meaningful. Furthermore, the Dq curves of the measure μ based on their CCRs for different orders to link the functional protein sequences are almost identical if q 〉 0. Finally, the Ca curves of all linked functional proteins resemble a classical phase transition at a critical point.展开更多
Using score function in a matrix game is very rare. In the proposed paper we have considered a matrix game with pay-off as triangular intuitionistic fuzzy number and a new ranking order has been proposed using value j...Using score function in a matrix game is very rare. In the proposed paper we have considered a matrix game with pay-off as triangular intuitionistic fuzzy number and a new ranking order has been proposed using value judgement index, available definitions and operations. A new concept of score function has been developed to defuzzify the pay-off matrix and solution of the matrix game has been obtained. A numerical example has been given in support of the proposed method.展开更多
文摘This paper presents a game theory-based method for predicting the outcomes of negotiation and group decision-making problems. We propose an extension to the BDM model to address problems where actors’ positions are distributed over a position spectrum. We generalize the concept of position in the model to incorporate continuous positions for the actors, enabling them to have more flexibility in defining their targets. We explore different possible functions to study the role of the position function and discuss appropriate distance measures for computing the distance between the positions of actors. To validate the proposed extension, we demonstrate the trustworthiness of our model’s performance and interpretation by replicating the results based on data used in earlier studies.
文摘Given a graph g=( V,A ) , we define a space of subgraphs M with the binary operation of union and the unique decomposition property into blocks. This space allows us to discuss a notion of minimal subgraphs (minimal coalitions) that are of interest for the game. Additionally, a partition of the game is defined in terms of the gain of each block, and subsequently, a solution to the game is defined based on distributing to each player (node and edge) present in each block a payment proportional to their contribution to the coalition.
基金supported by The National Basic Research Program of China (973) (Grant No. 2012CB315901, 2013CB329104)The National Natural Science Foundation of China (Grant No. 61521003, 61372121, 61309019, 61572519, 61502530)The National High Technology Research and Development Program of China (863) (Grant No. 2015AA016102)
文摘To address the issues that middleboxes as a fundamental part of today's networks are facing, Network Function Virtualization(NFV)has been recently proposed, which in essence asserts to migrate hardware-based middleboxes into software-based virtualized function entities.Due to the demands of virtual services placement in NFV network environment, this paper models the service amount placement problem involving with the resources allocation as a cooperative game and proposes the placement policy by Nash Bargaining Solution(NBS). Specifically,we first introduce the system overview and apply the rigorous cooperative game-theoretic guide to build the mathematical model, which can give consideration to both the responding efficiency of service requirements and the allocation fairness.Then a distributed algorithm corresponding to NBS is designed to achieve predictable network performance for virtual instances placement.Finally, with simulations under various scenarios,the results show that our placement approach can achieve high utilization of network through the analysis of evaluation metrics namely the satisfaction degree and fairness index. With the suitable demand amount of services, the average values of two metrics can reach above 90%. And by tuning the base placement, our solution can enable operators to flexibly balance the tradeoff between satisfaction and fairness of resourcessharing in service platforms.
文摘<span><b><span style="font-family:"">Objective</span></b></span><span><span><span style="font-family:"">: To study the status of online game addiction, self-control ability and family function, analyze the influence factors and the relationship between them. <b>Methods</b>: The questionnaire of online game addiction, family function and self-control ability was used to investigate some college students. <b>Results</b>: 1) The detection rate of college students’ online game addiction is 40%. There are significant differences in sex, grade and only child in online game addiction. 2) There are significant differences in self-control ability and family function between online game addicts and non-addicts. 3) Self-control ability and family function have a significant predictive effect on online game addiction. <b>Conclusion</b>: College students’ online game addiction is affected by their self-control ability and family function, and it can be alleviated by improving their self-control ability and family function.</span></span></span><span style="font-family:""></span> </p>
文摘Chaos game representation (CGR) of DNA sequences and linked protein sequences from genomes was proposed by Jeffrey (1990) and Yu et al. (2004), respectively. In this paper, we consider the CGR of three kinds of sequences from complete genomes: whole genome DNA sequences, linked coding DNA sequences and linked protein sequences. Some fractal patterns are found in these CGRs. A recurrent iterated function systems (RIFS) model is proposed to simulate the CGRs of these sequences from genomes and their induced measures. Numerical results on 50 genomes show that the RIFS model can simulate very well the CGRs and their induced measures. The parameters estimated in the RIFS model reflect information on species classification.
基金Project partially supported by the National Natural Science Foundation of China (Grant No.30570426)the Chinese Program for New Century Excellent Talents in University (Grant No.NCET-08-06867)+1 种基金Fok Ying Tung Education Foundation (Grant No.101004)Australian Research Council (Grant No.DP0559807)
文摘Investigating the biological function of proteins is a key aspect of protein studies. Bioinformatic methods become important for studying the biological function of proteins. In this paper, we first give the chaos game representation (CGR) of randomly-linked functional protein sequences, then propose the use of the recurrent iterated function systems (RIFS) in fractal theory to simulate the measure based on their chaos game representations. This method helps to extract some features of functional protein sequences, and furthermore the biological functions of these proteins. Then multifractal analysis of the measures based on the CGRs of randomly-linked functional protein sequences are performed. We find that the CGRs have clear fractal patterns. The numerical results show that the RIFS can simulate the measure based on the CGR very well. The relative standard error and the estimated probability matrix in the RIFS do not depend on the order to link the functional protein sequences. The estimated probability matrices in the RIFS with different biological functions are evidently different. Hence the estimated probability matrices in the RIFS can be used to characterise the difference among linked functional protein sequences with different biological functions. From the values of the Dq curves, one sees that these functional protein sequences are not completely random. The Dq of all linked functional proteins studied are multifractal-like and sufficiently smooth for the Cq (analogous to specific heat) curves to be meaningful. Furthermore, the Dq curves of the measure μ based on their CCRs for different orders to link the functional protein sequences are almost identical if q 〉 0. Finally, the Ca curves of all linked functional proteins resemble a classical phase transition at a critical point.
文摘Using score function in a matrix game is very rare. In the proposed paper we have considered a matrix game with pay-off as triangular intuitionistic fuzzy number and a new ranking order has been proposed using value judgement index, available definitions and operations. A new concept of score function has been developed to defuzzify the pay-off matrix and solution of the matrix game has been obtained. A numerical example has been given in support of the proposed method.