Stable network topologies using the notion of covering

An alternative perspective to evaluate networks and network evolution is introduced, based on the notion of covering. For a particular node in a network covering captures the idea of being outperformed by another node in terms of, for example, visibility and possibility of information gathering. In this paper, we focus on networks where these subdued network positions do not exist. We call these networks stable. Within this set we identify the minimal stable networks, which frequently have a ‘bubble-like’ structure. Severing a link in such a network results in at least one of the nodes being covered. In a minimal stable network therefore all nodes cooperate to avoid that one of the nodes ends up in a subdued position. Our results can be applied to, for example, the design of (covert) communication networks and the dynamics of social and information networks.     

风险厌恶条件下竞争报童问题的二层规划模型

有效应用数学规划方法研究报童类产品的库存管理,能够降低企业的成本和风险,从而提高企业的经济效益.此类问题的研究,目前主要集中在应用Nash博弈研究竞争报童问题以及零售商所持风险态度对供应链库存水平的影响.试图研究序贯决策下的竞争报童问题模型以及零售商所持风险态度对供应链库存水平的影响.由此建立了二层规划模型.算例表明序贯决策的竞争报童问题中,总订购量随风险厌恶程度的提高而降低.     

实际大气中无线光通信的系统差错性能

无线光通信(FSO)系统的性能受大气湍流影响会产生剧烈波动。根据系统和大气参数评估系统差错性能的研究具有现实意义。以大气湍流信道和光电探测模型为基础,使用拟合概率分布替换常用的对数正态分布,建立了FSO系统差错性能的数学仿真模型,改进了湍流条件下系统误码率计算公式,并且进行全天的验证实验。实验结果显示,光强概率分布对系统性能有显著的影响,原有公式在某些情况下的计算结果有较大偏差,而改进公式的计算结果具有更好的适应性和准确性。该改进公式可有效评估湍流条件下FSO系统性能,并为相关理论研究提供参考。     

Integer number sense and notation: A case study of a student with a mathematics learning disability

Although approximately 6% of students have a mathematics learning disability (MLD) also known as dyscalculia, little is known about how MLD impacts students beyond basic arithmetic. In this study we focused on one mathematical topic foundational to algebra – integer operations – and conducted a videotaped design experiment with one student with MLD. Through 14 teaching episodes we explored the ways in which standard mathematical tools (e.g., symbols, representations) were inaccessible and evaluated the design of alternative tools. Our detailed retrospective analysis revealed that the student had an unconventional understanding of integer quantities and symbolic notation, which resulted in issues of accessibility and persistent difficulties. Deliberate attempts to address inaccessibility revealed nuances in the student’s understanding, and suggests that both number sense and notational issues needed to be addressed in tandem. Implications for instruction are discussed.     

Spline R-Function and Applications in FEM

R-function is a widely used tool when considering objects obtained through the Boolean operations start from simple base primitives. However, there is square root operation in the representation. Considering that the use of splines will facilitate the calculations within the CAD system, in this paper, we propose a system of R-functions represented in spline form called Spline R-function (SR). After transforming the function ranges of two base primitives to a new coordinate system, a series of sign constraints following a specific Boolean operation are derived and the spline R-function can be formulated as a piecewise function. Representation of SR in both Bézier form and B-spline form have been given. Among which the Bézier ordinates are determined with the help of the B-net method through setting up a series of relations according to the sign constraints and properties of R-functions. The construction processes for both Boolean intersection and union operations with different smoothness are discussed in detail. Numerical experiments are conducted to show the potential of the proposed spline R-function.     

Permutations,power operations,and the center of the category of racks

Racks and quandles are rich algebraic structures that are strong enough to classify knots. Here we develop several fundamental categorical aspects of the theories of racks and quandles and their relation to the theory of permutations. In particular, we compute the centers of the categories and describe power operations on them, thereby revealing free extra structure that is not apparent from the definitions. This also leads to precise characterizations of these theories in the form of universal properties.     

Combining integer programming and the randomization method to schedule employees

We describe a method to find low cost shift schedules with a time-varying service level that is always above a specified minimum. Most previous approaches used a two-step procedure: (1) determine staffing requirements and (2) find a minimum cost schedule that provides the required staffing in every period. Approximations in the first step sometimes cause the two-step approach to find infeasible or suboptimal solutions. Our method iterates between a schedule evaluator and a schedule generator. The schedule evaluator calculates transient service levels using the randomization method and identifies infeasible intervals, where the service level is lower than desired. The schedule generator solves a series of integer programs to produce improved schedules, by adding constraints for every infeasible interval, in an attempt to eliminate infeasibility without eliminating the optimal solution. We present computational results for several test problems and discuss factors that make our approach more likely to outperform previous approaches.     

一类速度不同的具有m台通用机的n组工件的排序问题

研究的目的在于解决实践中对多组任务的优化排序问题,即在最短的时间内完成所有给定的任务,由于这类问题往往都是NP完全问题,人们通常寻求其近似算法．文中提出了一种改进的LPT算法,利用。首先空闲”准则,讨论了将n组工件安排在n台速度不同的专用机,m台速度小于专用机的通用机上的C‰。。问题,得到了利用该近似算法所得的解T与最优解T＊的—个估计：T/T＊≤2＋（n-2）/（m＋1）     

求解旅行商问题的一种改进粒子群算法

本文研究了求解旅行商问题的粒子群算法。针对标准粒子群算法在求解旅行商问题过程中容易出现早熟和停滞现象的缺点,提出了一种改进的粒子群算法。首先,在初始种群的选取过程中,利用改进的贪婪策略直接获得具有较高性能的初始种群以提高算法的搜索效率。其次,通过引入次优吸引子,使粒子在搜索过程中可以更加充分地利用群体的信息来提高自身的性能,有效抑制收敛过程中的停滞现象,提高算法的搜索能力。最后为了验证所提出的方法的有效性和可行性,对TSPLIB标准库中的多个实例进行了测试,并给出了数值结果。     

A comparative study of recursive methods

Summary Recursive methods represent a well-established and wide-spread technique for generation of dynamical equations of mechanical systems. Their main objective is to obtain computational schemes involving as few operations as possible. In this paper, we show that, besides the consideration of simplification resulting from a careful representation of geometric relationships between contiguous links, only two factors determine the overall efficiency of these methods. These factors are: the choice of an appropriate reference point for the kinematic and kinetic equations, and the frame of decomposition used to represent the involved vectors and tensors. Further, we derive a computational scheme which compares advantageously with existing methods. As only elementary laws of mechanics are applied, the exposition is also suitable for practising engineers seeking to understand the main differences between existing methods. A comparison with one of the reportedly most effective non-recursive method elucidates the advantages and bounds of the present approach.