Great circle links and virtually fibered knots

We show that all two-bridge knot and link complements are virtually fibered. We also show that spherical Montesinos knot and link complements are virtually fibered. This is accomplished by showing that such manifolds are finitely covered by great circle link complements.     

Co-authorship model with link strength

We generalize a network formation model for co-authorship introducing the possibility of the connections having different link strengths. Different link strengths represent the fact that authors may put different efforts into different collaborations. To evaluate the model, we consider the notions of efficiency and pairwise stability, which are based on a utility function that measures the benefits for an author to belonging to a certain network structure. We divide the analysis in two cases, considering that link strengths are unbounded or bounded. In the first case, we show that if there are more than two authors in the network, then there is no pairwise stable network. In the second case, we show that the pairwise stable networks consist of completely connected disjoint components where essentially all link strengths are maximal. Regarding efficiency, in both cases, if the number of authors is even, then the unique efficient network structure consists of pairs of connected authors.     

Relative Entropy of Distance Distribution Based Similarity Measure of Nodes in Weighted Graph Data

Many similarity measure algorithms of nodes in weighted graph data have been proposed by employing the degree of nodes in recent years. Despite these algorithms obtaining great results, there may be still some limitations. For instance, the strength of nodes is ignored. Aiming at this issue, the relative entropy of the distance distribution based similarity measure of nodes is proposed in this paper. At first, the structural weights of nodes are given by integrating their degree and strength. Next, the distance between any two nodes is calculated with the help of their structural weights and the Euclidean distance formula to further obtain the distance distribution of each node. After that, the probability distribution of nodes is constructed by normalizing their distance distributions. Thus, the relative entropy can be applied to measure the difference between the probability distributions of the top d important nodes and all nodes in graph data. Finally, the similarity of two nodes can be measured in terms of this above-mentioned difference calculated by relative entropy. Experimental results demonstrate that the algorithm proposed by considering the strength of node in the relative entropy has great advantages in the most similar node mining and link prediction.     

Control of multi-node mobile communications networks with time-varying channels via stability methods

Consider a communications network consisting of mobiles and random external data processes, each destined to a particular destination. Each mobile can serve as a node in the multi-hop path from source to destination. At each mobile the data is queued according to the source destination pair. The quality of the connecting channels are randomly varying. Time is divided into small scheduling intervals. At the beginning of each interval, the channels are estimated and this information is used for the decisions concerning allocation of transmission power and/or time, bandwidth, and perhaps antennas, in a queue and channel-state dependent way. Under a natural (and “almost” necessary) “average flow” condition, stochastic stability methods are used to develop scheduling policies that assure stability. The policies are readily implementable and allow a range of tradeoffs between current rates and queue lengths, under very weak conditions. Because of the non-Markovian nature of the problem, we use the perturbed Stochastic Liapunov function method. The choice of Liapunov function allows a choice of the effective performance criteria. All essential factors are incorporated into a “mean rate” function, so that the results cover many different systems. Extensions concerning acknowledgments, multicasting, non-unique routes, and others are given to illustrate the versatility of the method, and a useful method for getting the a priori routes is discussed.     

以提升创新能力为目标的基础力学实践教学初探

创新型基础力学人才的培养既要注重专业知识的学习,又要重视学生思辨、质疑与应用能力的提升。受限于不断削减的学时,传统基础力学课程仍以讲授为主,难以开展有效的实践教学环节。这种重理论轻实践的模式易导致学生学习兴趣下降、综合能力不足。为弥补实践短板,国内高校正逐步开展各类型大学生实践项目。本文以大学生创新训练项目为例,系统介绍项目实施期间教师有效的引导方式,以期为新时期力学人才培养贡献力量。

     

Excluded Minors and the Ribbon Graphs of Knots

In this article we consider minors of ribbon graphs (or, equivalently, cellularly embedded graphs). The theory of minors of ribbon graphs differs from that of graphs in that contracting loops is necessary and doing this can create additional vertices and components. Thus, the ribbon graph minor relation is incompatible with the graph minor relation. We discuss excluded minor characterizations of minor closed families of ribbon graphs. Our main result is an excluded minor characterization of the family of ribbon graphs that represent knot and link diagrams.     

Computing boundary slopes of 2-bridge links

We describe an algorithm for computing boundary slopes of 2-bridge links. As an example, we work out the slopes of the links obtained by surgery on one component of the Borromean rings. A table of all boundary slopes of all 2-bridge links with 10 or less crossings is also included.