With the development of big data and social computing,large-scale group decisionmaking(LGDM)is nowmerging with social networks.Using social network analysis(SNA),this study proposes an LGDM consensus model that consid...With the development of big data and social computing,large-scale group decisionmaking(LGDM)is nowmerging with social networks.Using social network analysis(SNA),this study proposes an LGDM consensus model that considers the trust relationship among decisionmakers(DMs).In the process of consensusmeasurement:the social network is constructed according to the social relationship among DMs,and the Louvain method is introduced to classify social networks to form subgroups.In this study,the weights of each decision maker and each subgroup are computed by comprehensive network weights and trust weights.In the process of consensus improvement:A feedback mechanism with four identification and two direction rules is designed to guide the consensus of the improvement process.Based on the trust relationship among DMs,the preferences are modified,and the corresponding social network is updated to accelerate the consensus.Compared with the previous research,the proposedmodel not only allows the subgroups to be reconstructed and updated during the adjustment process,but also improves the accuracy of the adjustment by the feedbackmechanism.Finally,an example analysis is conducted to verify the effectiveness and flexibility of the proposed method.Moreover,compared with previous studies,the superiority of the proposed method in solving the LGDM problem is highlighted.展开更多
Network autoregression and factor model are effective methods for modeling network time series data.In this study,we propose a network autoregression model with a factor structure that incorporates a latent group stru...Network autoregression and factor model are effective methods for modeling network time series data.In this study,we propose a network autoregression model with a factor structure that incorporates a latent group structure to address nodal heterogeneity within the network.An iterative algorithm is employed to minimize a least-squares objective function,allowing for simultaneous estimation of both the parameters and the group structure.To determine the unknown number of groups and factors,a PIC criterion is introduced.Additionally,statistical inference of the estimated parameters is presented.To assess the validity of the proposed estimation and inference procedures,we conduct extensive numerical studies.We also demonstrate the utility of our model using a stock dataset obtained from the Chinese A-Share stock market.展开更多
Due to people’s increasing dependence on social networks,it is essential to develop a consensus model considering not only their own factors but also the interaction between people.Both external trust relationship am...Due to people’s increasing dependence on social networks,it is essential to develop a consensus model considering not only their own factors but also the interaction between people.Both external trust relationship among experts and the internal reliability of experts are important factors in decision-making.This paper focuses on improving the scientificity and effectiveness of decision-making and presents a consensus model combining trust relationship among experts and expert reliability in social network group decision-making(SN-GDM).A concept named matching degree is proposed to measure expert reliability.Meanwhile,linguistic information is applied to manage the imprecise and vague information.Matching degree is expressed by a 2-tuple linguistic model,and experts’preferences are measured by a probabilistic linguistic term set(PLTS).Subsequently,a hybrid weight is explored to weigh experts’importance in a group.Then a consensus measure is introduced and a feedback mechanism is developed to produce some personalized recommendations with higher group consensus.Finally,a comparative example is provided to prove the scientificity and effectiveness of the proposed consensus model.展开更多
There is instability in the distributed energy storage cloud group end region on the power grid side.In order to avoid large-scale fluctuating charging and discharging in the power grid environment and make the capaci...There is instability in the distributed energy storage cloud group end region on the power grid side.In order to avoid large-scale fluctuating charging and discharging in the power grid environment and make the capacitor components showa continuous and stable charging and discharging state,a hierarchical time-sharing configuration algorithm of distributed energy storage cloud group end region on the power grid side based on multi-scale and multi feature convolution neural network is proposed.Firstly,a voltage stability analysis model based onmulti-scale and multi feature convolution neural network is constructed,and the multi-scale and multi feature convolution neural network is optimized based on Self-OrganizingMaps(SOM)algorithm to analyze the voltage stability of the cloud group end region of distributed energy storage on the grid side under the framework of credibility.According to the optimal scheduling objectives and network size,the distributed robust optimal configuration control model is solved under the framework of coordinated optimal scheduling at multiple time scales;Finally,the time series characteristics of regional power grid load and distributed generation are analyzed.According to the regional hierarchical time-sharing configuration model of“cloud”,“group”and“end”layer,the grid side distributed energy storage cloud group end regional hierarchical time-sharing configuration algorithm is realized.The experimental results show that after applying this algorithm,the best grid side distributed energy storage configuration scheme can be determined,and the stability of grid side distributed energy storage cloud group end region layered timesharing configuration can be improved.展开更多
In this paper,a new communication model is built named grouping D2D(GD2D).Different from the traditional D2D coordination,we proposed GD2D communication in licensed and unlicensed spectrum simultaneously.We formulate ...In this paper,a new communication model is built named grouping D2D(GD2D).Different from the traditional D2D coordination,we proposed GD2D communication in licensed and unlicensed spectrum simultaneously.We formulate a resource allocation problem,which aims at maximizing the energy efficiency(EE)of the system while guaranteeing the quality-of-service(Qos)of users.To efficiently solve this problem,the non-convex optimization problem is first transformed into a convex optimization problem.By transforming the fractional-form problem into an equivalent subtractive-form problem,an iterative power allocation algorithm is proposed to maximize the system EE.Moreover,the optimal closedform power allocation expressions are derived by the Lagrangian approach.Simulation results show that our algorithm achieves higher EE performance than the traditional D2D communication scheme.展开更多
With the popularity of wireless networks and the prevalence of personal mobile computing devices, understanding the characteristic of wireless network users is of great significance to the network performance. In this...With the popularity of wireless networks and the prevalence of personal mobile computing devices, understanding the characteristic of wireless network users is of great significance to the network performance. In this study, system logs from two universities, Dartmouth College and Shanghai Jiao Tong University(SJTU), were mined and analyzed. Every user's log was represented by a user profile. A novel weighted social similarity was proposed to quantify the resemblance of users considering influence of location visits. Based on the similarity, an unsupervised learning method was applied to cluster users. Though environment parameters are different, two universities both form many social groups with Pareto distribution of similarity and exponential distribution of group sizes. These findings are very important to the research of wireless network and social network .展开更多
This paper addresses an interesting security problem in wireless ad hoc networks: the dynamic group key agreement key establishment. For secure group communication in an ad hoc network, a group key shared by all group...This paper addresses an interesting security problem in wireless ad hoc networks: the dynamic group key agreement key establishment. For secure group communication in an ad hoc network, a group key shared by all group members is required. This group key should be updated when there are membership changes (when the new member joins or current member leaves) in the group. In this paper, we propose a novel, secure, scalable and efficient region-based group key agreement protocol for ad hoc networks. This is implemented by a two-level structure and a new scheme of group key update. The idea is to divide the group into subgroups, each maintaining its subgroup keys using group elliptic curve diffie-hellman (GECDH) Protocol and links with other subgroups in a tree structure using tree-based group elliptic curve diffie-hellman (TGECDH) protocol. By introducing region-based approach, messages and key updates will be limited within subgroup and outer group;hence computation load is distributed to many hosts. Both theoretical analysis and experimental results show that this Region-based key agreement protocol performs well for the key establishment problem in ad hoc network in terms of memory cost, computation cost and communication cost.展开更多
The flash points of organic compounds were estimated using a hybrid method that includes a simple group contribution method (GCM) implemented in an artificial neural network (ANN) with particle swarm optimization (PSO...The flash points of organic compounds were estimated using a hybrid method that includes a simple group contribution method (GCM) implemented in an artificial neural network (ANN) with particle swarm optimization (PSO). Different topologies of a multilayer neural network were studied and the optimum architecture was determined. Property data of 350 compounds were used for training the network. To discriminate different substances the molecular structures defined by the concept of the classical group contribution method were given as input variables. The capabilities of the network were tested with 155 substances not considered in the training step. The study shows that the proposed GCM+ANN+PSO method represent an excellent alternative for the estimation of flash points of organic compounds with acceptable accuracy (AARD = 1.8%; AAE = 6.2 K).展开更多
A new concept, the generalized inverse group (GIG) of signal, is firstly proposed and its properties, leaking coefficients and implementation with neural networks are presented. Theoretical analysis and computational ...A new concept, the generalized inverse group (GIG) of signal, is firstly proposed and its properties, leaking coefficients and implementation with neural networks are presented. Theoretical analysis and computational simulation have shown that (1) there is a group of finite length of generalized inverse signals for any given finite signal, which forms the GIG; (2) each inverse group has different leaking coefficients, thus different abnormal states; (3) each GIG can be implemented by a grouped and improved single-layer perceptron which appears with fast convergence. When used in deconvolution, the proposed GIG can form a new parallel finite length of filtering deconvolution method. On off-line processing, the computational time is reduced to O(N) from O(N2). And the less the leaking coefficient is, the more reliable the deconvolution will be.展开更多
Aiming at the diversity and nonlinearity of the elevator system control target, an effective group method based on a hybrid algorithm of genetic algorithm and neural network is presented in this paper. The genetic alg...Aiming at the diversity and nonlinearity of the elevator system control target, an effective group method based on a hybrid algorithm of genetic algorithm and neural network is presented in this paper. The genetic algorithm is used to search the weight of the neural network. At the same time, the multi-objective-based evaluation function is adopted, in which there are three main indicators including the passenger waiting time, car passengers number and the number of stops. Different weights are given to meet the actual needs. The optimal values of the evaluation function are obtained, and the optimal dispatch control of the elevator group control system based on neural network is realized. By analyzing the running of the elevator group control system, all the processes and steps are presented. The validity of the hybrid algorithm is verified by the dynamic imitation performance.展开更多
Peer-to-Peer (P2P) networks are highly dynamic systems which are very popular for content distribution in the Internet. A single peer remains in the system for an unpredictable amount of time, and the rate in which pe...Peer-to-Peer (P2P) networks are highly dynamic systems which are very popular for content distribution in the Internet. A single peer remains in the system for an unpredictable amount of time, and the rate in which peers enter and leave the system, i.e. the churn, is often high. A user that is obtaining content from a selected peer is frequently informed that particular peer is not available anymore, and is asked to select another peer, or will have another peer assigned, often without enough checks to confirm that the content provided by the new peer presents the same quality of the previous peer. In this work we present a strategy based on group communication for transparent and robust content access in P2P networks. Instead of accessing a single peer for obtaining the desired content, a user request is received and processed by a group of peers. This group of peers, called PCG (Peer Content Group) provides reliable content access in sense that even as members of the group crash or leave the system, users continue to receive the content if at least one group member remains fault-free. Each PCG member is capable of independently serving the request. A PCG is transparent to the user, as the group interface is identical to the interface provided by a single peer. A group member is elected to serve each request. A fault monitoring component allows the detection of member crashes. If the peer is serving request crashes, another group member is elected to continue providing the service. The PCG and a P2P file sharing applications were implemented in the JXTA platform. Evaluation results are presented showing the latency of group operations and system components.展开更多
The key exposure problem is a practical threat for many security applications. In wireless sensor networks (WSNs), keys could be compromised easily due to its limited hardware protections. A secure group key managemen...The key exposure problem is a practical threat for many security applications. In wireless sensor networks (WSNs), keys could be compromised easily due to its limited hardware protections. A secure group key management scheme is responsible for secure distributing group keys among valid nodes of the group. Based on the key-insulated encryption (KIE), we propose a group key management scheme (KIE-GKMS), which integrates the pair-wise key pre-distribution for WSN. The KIE-GKMS scheme updates group keys dynamically when adding or removing nodes. Moreover, the security analysis proves that the KIE-GKMS scheme not only obtains the semantic security, but also provides the forward and backward security. Finally, the theoretical analysis shows that the KIE-GKMS scheme has constant performance on both communication and storage costs in sensor nodes.展开更多
With the rapid development of modern information technology, Internet technology has become a major driver of social and economic development. It also has a great influence on higher vocational school education, espec...With the rapid development of modern information technology, Internet technology has become a major driver of social and economic development. It also has a great influence on higher vocational school education, especially the ideological and political education of young students. The network has brought new changes to the students' cognition, thoughts and conduct, learning methods, and physical and mental development. At the same time, it has a negative effect on students' own development and student group development. In order to better serve the ideological and political education of higher vocational students and improve the pragmaticality and effectiveness of the ideological and political work, we have actively enriched the network carriers, took the initiative to fight for Internet public opinion, actively built a network response mechanism, and focus on the training of network leaders and other measures to strengthen the online community ideological and political education.展开更多
Based on the perspective of psychology,this paper analyzes the causes and characteristics of college students’network mass incidents,explores the psychological factors of college students’network mass incidents,and ...Based on the perspective of psychology,this paper analyzes the causes and characteristics of college students’network mass incidents,explores the psychological factors of college students’network mass incidents,and puts forward the educational strategies to solve college students’network mass incidents:(1)Adhere to humanism and take appeals as the center;(2)To improve the campus network public opinion guidance mechanism under the guidance of relevant social cognition theories;(3)Strengthen communication and improve communication skills;(4)Promote information disclosure and transparency,and eliminate uncertainty and ambiguity.展开更多
Based on the perspective of psychology,this paper analyzes the causes and characteristics of college students’network mass incidents,explores the psychological factors of college students’network mass incidents,and ...Based on the perspective of psychology,this paper analyzes the causes and characteristics of college students’network mass incidents,explores the psychological factors of college students’network mass incidents,and puts forward the educational strategies to solve college students’network mass incidents:No.1.Adhere to humanism and take appeals as the center;No.2.To improve the campus network public opinion guidance mechanism under the guidance of relevant social cognition theories;No.3.Strengthen communication and improve communication skills;No.4.Promote information disclosure and transparency,and eliminate uncertainty and ambiguity.展开更多
The cascading failure often occurs in real networks. It is significant to analyze the cascading failure in the complex network research. The dependency relation can change over time. Therefore, in this study, we inves...The cascading failure often occurs in real networks. It is significant to analyze the cascading failure in the complex network research. The dependency relation can change over time. Therefore, in this study, we investigate the cascading failure in multilayer networks with dynamic dependency groups. We construct a model considering the recovery mechanism.In our model, two effects between layers are defined. Under Effect 1, the dependent nodes in other layers will be disabled as long as one node does not belong to the largest connected component in one layer. Under Effect 2, the dependent nodes in other layers will recover when one node belongs to the largest connected component. The theoretical solution of the largest component is deduced and the simulation results verify our theoretical solution. In the simulation, we analyze the influence factors of the network robustness, including the fraction of dependent nodes and the group size, in our model. It shows that increasing the fraction of dependent nodes and the group size will enhance the network robustness under Effect 1. On the contrary, these will reduce the network robustness under Effect 2. Meanwhile, we find that the tightness of the network connection will affect the robustness of networks. Furthermore, setting the average degree of network as 8 is enough to keep the network robust.展开更多
As the wireless medium is characterized by its lossy nature, reliable communication cannot be assumed in the key management scheme. Therefore self-healing is a good property for key distribution scheme in wireless app...As the wireless medium is characterized by its lossy nature, reliable communication cannot be assumed in the key management scheme. Therefore self-healing is a good property for key distribution scheme in wireless applications. A new self-healing key distribution scheme was proposed, which is optimal in terms of user memory storage and efficient in terms of communication complexity.展开更多
The evolution of smart mobile devices has significantly impacted the way we generate and share contents and introduced a huge volume of Internet traffic.To address this issue and take advantage of the short-range comm...The evolution of smart mobile devices has significantly impacted the way we generate and share contents and introduced a huge volume of Internet traffic.To address this issue and take advantage of the short-range communication capabilities of smart mobile devices,the decentralized content sharing approach has emerged as a suitable and promising alternative.Decentralized content sharing uses a peer-to-peer network among colocated smart mobile device users to fulfil content requests.Several articles have been published to date to address its different aspects including group management,interest extraction,message forwarding,participation incentive,and content replication.This survey paper summarizes and critically analyzes recent advancements in decentralized content sharing and highlights potential research issues that need further consideration.展开更多
基金The work was supported by Humanities and Social Sciences Fund of the Ministry of Education(No.22YJA630119)the National Natural Science Foundation of China(No.71971051)Natural Science Foundation of Hebei Province(No.G2021501004).
文摘With the development of big data and social computing,large-scale group decisionmaking(LGDM)is nowmerging with social networks.Using social network analysis(SNA),this study proposes an LGDM consensus model that considers the trust relationship among decisionmakers(DMs).In the process of consensusmeasurement:the social network is constructed according to the social relationship among DMs,and the Louvain method is introduced to classify social networks to form subgroups.In this study,the weights of each decision maker and each subgroup are computed by comprehensive network weights and trust weights.In the process of consensus improvement:A feedback mechanism with four identification and two direction rules is designed to guide the consensus of the improvement process.Based on the trust relationship among DMs,the preferences are modified,and the corresponding social network is updated to accelerate the consensus.Compared with the previous research,the proposedmodel not only allows the subgroups to be reconstructed and updated during the adjustment process,but also improves the accuracy of the adjustment by the feedbackmechanism.Finally,an example analysis is conducted to verify the effectiveness and flexibility of the proposed method.Moreover,compared with previous studies,the superiority of the proposed method in solving the LGDM problem is highlighted.
基金Supported by National Natural Science Foundation of China(72222009,71991472)。
文摘Network autoregression and factor model are effective methods for modeling network time series data.In this study,we propose a network autoregression model with a factor structure that incorporates a latent group structure to address nodal heterogeneity within the network.An iterative algorithm is employed to minimize a least-squares objective function,allowing for simultaneous estimation of both the parameters and the group structure.To determine the unknown number of groups and factors,a PIC criterion is introduced.Additionally,statistical inference of the estimated parameters is presented.To assess the validity of the proposed estimation and inference procedures,we conduct extensive numerical studies.We also demonstrate the utility of our model using a stock dataset obtained from the Chinese A-Share stock market.
基金the National Natural Science Foundation of China(71871121).
文摘Due to people’s increasing dependence on social networks,it is essential to develop a consensus model considering not only their own factors but also the interaction between people.Both external trust relationship among experts and the internal reliability of experts are important factors in decision-making.This paper focuses on improving the scientificity and effectiveness of decision-making and presents a consensus model combining trust relationship among experts and expert reliability in social network group decision-making(SN-GDM).A concept named matching degree is proposed to measure expert reliability.Meanwhile,linguistic information is applied to manage the imprecise and vague information.Matching degree is expressed by a 2-tuple linguistic model,and experts’preferences are measured by a probabilistic linguistic term set(PLTS).Subsequently,a hybrid weight is explored to weigh experts’importance in a group.Then a consensus measure is introduced and a feedback mechanism is developed to produce some personalized recommendations with higher group consensus.Finally,a comparative example is provided to prove the scientificity and effectiveness of the proposed consensus model.
基金supported by State Grid Corporation Limited Science and Technology Project Funding(Contract No.SGCQSQ00YJJS2200380).
文摘There is instability in the distributed energy storage cloud group end region on the power grid side.In order to avoid large-scale fluctuating charging and discharging in the power grid environment and make the capacitor components showa continuous and stable charging and discharging state,a hierarchical time-sharing configuration algorithm of distributed energy storage cloud group end region on the power grid side based on multi-scale and multi feature convolution neural network is proposed.Firstly,a voltage stability analysis model based onmulti-scale and multi feature convolution neural network is constructed,and the multi-scale and multi feature convolution neural network is optimized based on Self-OrganizingMaps(SOM)algorithm to analyze the voltage stability of the cloud group end region of distributed energy storage on the grid side under the framework of credibility.According to the optimal scheduling objectives and network size,the distributed robust optimal configuration control model is solved under the framework of coordinated optimal scheduling at multiple time scales;Finally,the time series characteristics of regional power grid load and distributed generation are analyzed.According to the regional hierarchical time-sharing configuration model of“cloud”,“group”and“end”layer,the grid side distributed energy storage cloud group end regional hierarchical time-sharing configuration algorithm is realized.The experimental results show that after applying this algorithm,the best grid side distributed energy storage configuration scheme can be determined,and the stability of grid side distributed energy storage cloud group end region layered timesharing configuration can be improved.
基金supported in part by the National Natural Science Foundation of China under Grant no.61473066 and Grant no.61601109in part by the Fundamental Research Funds for the Central Universities under Grant No.N152305001.
文摘In this paper,a new communication model is built named grouping D2D(GD2D).Different from the traditional D2D coordination,we proposed GD2D communication in licensed and unlicensed spectrum simultaneously.We formulate a resource allocation problem,which aims at maximizing the energy efficiency(EE)of the system while guaranteeing the quality-of-service(Qos)of users.To efficiently solve this problem,the non-convex optimization problem is first transformed into a convex optimization problem.By transforming the fractional-form problem into an equivalent subtractive-form problem,an iterative power allocation algorithm is proposed to maximize the system EE.Moreover,the optimal closedform power allocation expressions are derived by the Lagrangian approach.Simulation results show that our algorithm achieves higher EE performance than the traditional D2D communication scheme.
基金National Natural Science Foundation of China(No. 60970106)National High Technology Research and Development Program of China( No. 2011AA010500)
文摘With the popularity of wireless networks and the prevalence of personal mobile computing devices, understanding the characteristic of wireless network users is of great significance to the network performance. In this study, system logs from two universities, Dartmouth College and Shanghai Jiao Tong University(SJTU), were mined and analyzed. Every user's log was represented by a user profile. A novel weighted social similarity was proposed to quantify the resemblance of users considering influence of location visits. Based on the similarity, an unsupervised learning method was applied to cluster users. Though environment parameters are different, two universities both form many social groups with Pareto distribution of similarity and exponential distribution of group sizes. These findings are very important to the research of wireless network and social network .
文摘This paper addresses an interesting security problem in wireless ad hoc networks: the dynamic group key agreement key establishment. For secure group communication in an ad hoc network, a group key shared by all group members is required. This group key should be updated when there are membership changes (when the new member joins or current member leaves) in the group. In this paper, we propose a novel, secure, scalable and efficient region-based group key agreement protocol for ad hoc networks. This is implemented by a two-level structure and a new scheme of group key update. The idea is to divide the group into subgroups, each maintaining its subgroup keys using group elliptic curve diffie-hellman (GECDH) Protocol and links with other subgroups in a tree structure using tree-based group elliptic curve diffie-hellman (TGECDH) protocol. By introducing region-based approach, messages and key updates will be limited within subgroup and outer group;hence computation load is distributed to many hosts. Both theoretical analysis and experimental results show that this Region-based key agreement protocol performs well for the key establishment problem in ad hoc network in terms of memory cost, computation cost and communication cost.
文摘The flash points of organic compounds were estimated using a hybrid method that includes a simple group contribution method (GCM) implemented in an artificial neural network (ANN) with particle swarm optimization (PSO). Different topologies of a multilayer neural network were studied and the optimum architecture was determined. Property data of 350 compounds were used for training the network. To discriminate different substances the molecular structures defined by the concept of the classical group contribution method were given as input variables. The capabilities of the network were tested with 155 substances not considered in the training step. The study shows that the proposed GCM+ANN+PSO method represent an excellent alternative for the estimation of flash points of organic compounds with acceptable accuracy (AARD = 1.8%; AAE = 6.2 K).
基金Supported partly by Natural Science Foundation of ChinaAviation Science Grant of China
文摘A new concept, the generalized inverse group (GIG) of signal, is firstly proposed and its properties, leaking coefficients and implementation with neural networks are presented. Theoretical analysis and computational simulation have shown that (1) there is a group of finite length of generalized inverse signals for any given finite signal, which forms the GIG; (2) each inverse group has different leaking coefficients, thus different abnormal states; (3) each GIG can be implemented by a grouped and improved single-layer perceptron which appears with fast convergence. When used in deconvolution, the proposed GIG can form a new parallel finite length of filtering deconvolution method. On off-line processing, the computational time is reduced to O(N) from O(N2). And the less the leaking coefficient is, the more reliable the deconvolution will be.
基金Supported by National Natural Science Foundation of China (No60874077) Specialized Research Funds for Doctoral Program of Higher Education of China (No20060056054) Research Funds for Scientific Financing Projects of Quality Control Public Welfare Profession (No2007GYB172)
文摘Aiming at the diversity and nonlinearity of the elevator system control target, an effective group method based on a hybrid algorithm of genetic algorithm and neural network is presented in this paper. The genetic algorithm is used to search the weight of the neural network. At the same time, the multi-objective-based evaluation function is adopted, in which there are three main indicators including the passenger waiting time, car passengers number and the number of stops. Different weights are given to meet the actual needs. The optimal values of the evaluation function are obtained, and the optimal dispatch control of the elevator group control system based on neural network is realized. By analyzing the running of the elevator group control system, all the processes and steps are presented. The validity of the hybrid algorithm is verified by the dynamic imitation performance.
文摘Peer-to-Peer (P2P) networks are highly dynamic systems which are very popular for content distribution in the Internet. A single peer remains in the system for an unpredictable amount of time, and the rate in which peers enter and leave the system, i.e. the churn, is often high. A user that is obtaining content from a selected peer is frequently informed that particular peer is not available anymore, and is asked to select another peer, or will have another peer assigned, often without enough checks to confirm that the content provided by the new peer presents the same quality of the previous peer. In this work we present a strategy based on group communication for transparent and robust content access in P2P networks. Instead of accessing a single peer for obtaining the desired content, a user request is received and processed by a group of peers. This group of peers, called PCG (Peer Content Group) provides reliable content access in sense that even as members of the group crash or leave the system, users continue to receive the content if at least one group member remains fault-free. Each PCG member is capable of independently serving the request. A PCG is transparent to the user, as the group interface is identical to the interface provided by a single peer. A group member is elected to serve each request. A fault monitoring component allows the detection of member crashes. If the peer is serving request crashes, another group member is elected to continue providing the service. The PCG and a P2P file sharing applications were implemented in the JXTA platform. Evaluation results are presented showing the latency of group operations and system components.
基金Project(61100201) supported by National Natural Science Foundation of ChinaProject(12ZZ019) supported by Technology Innovation Research Program,Shang Municipal Education Commission,China+1 种基金Project(LYM11053) supported by the Foundation for Distinguished Young Talents in Higher Education of Guangdong Province,ChinaProject(NCET-12-0358) supported by New Century Excellent Talentsin University,Ministry of Education,China
文摘The key exposure problem is a practical threat for many security applications. In wireless sensor networks (WSNs), keys could be compromised easily due to its limited hardware protections. A secure group key management scheme is responsible for secure distributing group keys among valid nodes of the group. Based on the key-insulated encryption (KIE), we propose a group key management scheme (KIE-GKMS), which integrates the pair-wise key pre-distribution for WSN. The KIE-GKMS scheme updates group keys dynamically when adding or removing nodes. Moreover, the security analysis proves that the KIE-GKMS scheme not only obtains the semantic security, but also provides the forward and backward security. Finally, the theoretical analysis shows that the KIE-GKMS scheme has constant performance on both communication and storage costs in sensor nodes.
文摘With the rapid development of modern information technology, Internet technology has become a major driver of social and economic development. It also has a great influence on higher vocational school education, especially the ideological and political education of young students. The network has brought new changes to the students' cognition, thoughts and conduct, learning methods, and physical and mental development. At the same time, it has a negative effect on students' own development and student group development. In order to better serve the ideological and political education of higher vocational students and improve the pragmaticality and effectiveness of the ideological and political work, we have actively enriched the network carriers, took the initiative to fight for Internet public opinion, actively built a network response mechanism, and focus on the training of network leaders and other measures to strengthen the online community ideological and political education.
文摘Based on the perspective of psychology,this paper analyzes the causes and characteristics of college students’network mass incidents,explores the psychological factors of college students’network mass incidents,and puts forward the educational strategies to solve college students’network mass incidents:(1)Adhere to humanism and take appeals as the center;(2)To improve the campus network public opinion guidance mechanism under the guidance of relevant social cognition theories;(3)Strengthen communication and improve communication skills;(4)Promote information disclosure and transparency,and eliminate uncertainty and ambiguity.
文摘Based on the perspective of psychology,this paper analyzes the causes and characteristics of college students’network mass incidents,explores the psychological factors of college students’network mass incidents,and puts forward the educational strategies to solve college students’network mass incidents:No.1.Adhere to humanism and take appeals as the center;No.2.To improve the campus network public opinion guidance mechanism under the guidance of relevant social cognition theories;No.3.Strengthen communication and improve communication skills;No.4.Promote information disclosure and transparency,and eliminate uncertainty and ambiguity.
基金Project supported by the National Natural Science Foundation of China(Grant No.61601053)
文摘The cascading failure often occurs in real networks. It is significant to analyze the cascading failure in the complex network research. The dependency relation can change over time. Therefore, in this study, we investigate the cascading failure in multilayer networks with dynamic dependency groups. We construct a model considering the recovery mechanism.In our model, two effects between layers are defined. Under Effect 1, the dependent nodes in other layers will be disabled as long as one node does not belong to the largest connected component in one layer. Under Effect 2, the dependent nodes in other layers will recover when one node belongs to the largest connected component. The theoretical solution of the largest component is deduced and the simulation results verify our theoretical solution. In the simulation, we analyze the influence factors of the network robustness, including the fraction of dependent nodes and the group size, in our model. It shows that increasing the fraction of dependent nodes and the group size will enhance the network robustness under Effect 1. On the contrary, these will reduce the network robustness under Effect 2. Meanwhile, we find that the tightness of the network connection will affect the robustness of networks. Furthermore, setting the average degree of network as 8 is enough to keep the network robust.
基金The Specialized Research Fund for the Doctoral Program of Higher Education of China (No. 20050248043)
文摘As the wireless medium is characterized by its lossy nature, reliable communication cannot be assumed in the key management scheme. Therefore self-healing is a good property for key distribution scheme in wireless applications. A new self-healing key distribution scheme was proposed, which is optimal in terms of user memory storage and efficient in terms of communication complexity.
文摘The evolution of smart mobile devices has significantly impacted the way we generate and share contents and introduced a huge volume of Internet traffic.To address this issue and take advantage of the short-range communication capabilities of smart mobile devices,the decentralized content sharing approach has emerged as a suitable and promising alternative.Decentralized content sharing uses a peer-to-peer network among colocated smart mobile device users to fulfil content requests.Several articles have been published to date to address its different aspects including group management,interest extraction,message forwarding,participation incentive,and content replication.This survey paper summarizes and critically analyzes recent advancements in decentralized content sharing and highlights potential research issues that need further consideration.