常绿落叶阔叶混交林的群落特征探讨

本文通过对有关植被调查资料的统计分析得到结果:常绿落叶阔叶混合交林中常绿乔木重要值所占比例范围是8％～75％,落叶乔木重要值所占比例范围是25％～92％。这显然从一个侧面定量给出了常绿落叶阔叶混交林的群落特征。     

Community structure and ethnic preferences in school friendship networks

Recently developed concepts and techniques of analyzing complex systems provide new insight into the structure of social networks. Uncovering recurrent preferences and organizational principles in such networks is a key issue to characterize them. We investigate school friendship networks from the Add Health database. Applying threshold analysis, we find that the friendship networks do not form a single connected component through mutual strong nominations within a school, while under weaker conditions such interconnectedness is present. We extract the networks of overlapping communities at the schools (c-networks) and find that they are scale free and disassortative in contrast to the direct friendship networks, which have an exponential degree distribution and are assortative. Based on the network analysis we study the ethnic preferences in friendship selection. The clique percolation method we use reveals that when in minority, the students tend to build more densely interconnected groups of friends. We also find an asymmetry in the behavior of black minorities in a white majority as compared to that of white minorities in a black majority.     

Identifying the underlying structure and dynamic interactions in a voting network

We analyse the structure and behaviour of a specific voting network using a dynamic structure-based methodology which draws on Q-Analysis and social network theory. Our empirical focus is on the Eurovision Song Contest over a period of 20 years. For a multicultural contest of this kind, one of the key questions is how the quality of a song is judged and how voting groups emerge. We investigate structures that may identify the winner based purely on the topology of the network. This provides a basic framework to identify what the characteristics associated with becoming a winner are, and may help to establish a homogenous criterion for subjective measures such as quality. Further, we measure the importance of voting cliques, and present a dynamic model based on a changing multidimensional measure of connectivity in order to reveal the formation of emerging community structure within the contest. Finally, we study the dynamic behaviour exhibited by the network in order to understand the clustering of voting preferences and the relationship between local and global properties.     

运用社团学习法解决外语学习焦虑

本文重点探讨外语学习焦虑及其对外语学习的影响。文章提出并论证运用社团学习法解决外语学习焦虑。     

关于常州社区成员学习心理的调查分析

目前,常州市社区教育的发展已经取得了显著的成绩,走在全省、乃至全国的前列。常州开放大学是常州市社区教育推展的重要协调、指导机构。为了给常州市民提供更加优质的社区教育服务,常州开放大学对常州社区成员学习心理进行了问卷调查,主要内容包括社区成员对社区教育课程、教学、组织管理等方面的学习心理分析。     

Synchronization of complex community networks with nonidentical nodes and adaptive coupling strength

In this Letter, the complex dynamical networks with community structure and nonidentical nodes are considered. The globally asymptotical synchronization of the time-delayed complex community networks onto any uniformly smooth state is studied. Some simple and useful criteria are derived by constructing an effective control scheme and adjusting automatically the adaptive coupling strength. Finally, the developed techniques are applied to two complex community networks which are respectively synchronized to a chaotic trajectory and a periodic orbit, and numerical simulations are provided to show the feasibility of the developed methods.     

Identifying the community structure of the international-trade multi-network

We study the community structure of the multi-network of commodity-specific trade relations among world countries over the 1992-2003 period. We compare structures across commodities and time by means of the normalized mutual information index (NMI). We also compare them with exogenous community structures induced by geography and regional trade agreements. We find that commodity-specific community structures are very heterogeneous and much more fragmented than that characterizing the aggregate ITN. This shows that the aggregate properties of the ITN may result (and be very different) from the aggregation of very diverse commodity-specific layers of the multi-network. We also show that commodity-specific community structures, especially those related to the chemical sector, are becoming more and more similar to the aggregate one. Finally, our findings suggest that geography-induced partitions of our set of countries are much more correlated with observed community structures than partitions induced by regional-trade agreements. This result strengthens previous findings from the empirical literature on trade.     

Detecting communities in clustered networks based on group action on set

In this paper, we propose a well targeted algorithm (GAS algorithm) for detecting communities in high clustered networks by presenting group action technology on community division. During the processing of this algorithm, the underlying community structure of a clustered network emerges simultaneously as the corresponding partition of orbits by the permutation groups acting on the node set are achieved. As the derivation of the orbit partition, an algebraic structure r-cycle can be considered as the origin of the community. To be a priori estimation for the community structure of the algorithm, the community separability is introduced to indicate whether a network has distinct community structure. By executing the algorithm on several typical networks and the LFR benchmark, it shows that this GAS algorithm can detect communities accurately and effectively in high clustered networks. Furthermore, we compare the GAS algorithm and the clique percolation algorithm on the LFR benchmark. It is shown that the GAS algorithm is more accurate at detecting non-overlapping communities in clustered networks. It is suggested that algebraic techniques can uncover fresh light on detecting communities in complex networks.     

The maximum balanced subgraph of a signed graph: Applications and solution approaches

The Maximum Balanced Subgraph Problem (MBSP) is the problem of finding a subgraph of a signed graph that is balanced and maximizes the cardinality of its vertex set. This paper is the first one to discuss applications of the MBSP arising in three different research areas: the detection of embedded structures, portfolio analysis in risk management and community structure. The efficient solution of the MBSP is also in the focus of this paper. We discuss pre-processing routines and heuristic solution approaches to the problem. a GRASP metaheuristic is developed and improved versions of a greedy heuristic are discussed. Extensive computational experiments are carried out on a set of instances from the applications previously mentioned as well as on a set of random instances.