Designing Least-Cost Survivable Wireless Backhaul Networks

This paper presents a new heuristic algorithm for designing least-cost telecommunications networks to carry cell site traffic to wireless switches while meeting survivability, capacity, and technical compatibility constraints. This requires solving the following combinatorial optimization problems simultaneously: (1) Select a least-cost subset of locations (network nodes) as hubs where traffic is to be aggregated and switched, and choose the type of hub (high-capacity DS3 vs. lower-capacity DS1 hub) for each location; (2) Optimally assign traffic from other nodes to these hubs, so that the traffic entering the network at these nodes is routed to the assigned hubs while respecting capacity constraints on the links and routing-diversity constraints on the hubs to assure survivability; and (3) Optimally choose the types of links to be used in interconnecting the nodes and hubs based on the capacities and costs associated with each link type. Each of these optimization problems must be solved while accounting for its impacts on the other two. This paper introduces a short term Tabu Search (STTS) meta-heuristic, with embedded knapsack and network flow sub-problems, that has proved highly effective in designing such backhaul networks for carrying personal communications services (PCS) traffic. It solves problems that are challenging for conventional branch-and-bound solvers in minutes instead of hours and finds lower-cost solutions. Applied to real-world network design problems, the heuristic has successfully identified designs that save over 20% compared to the best previously known designs.     

Large Scale Linear Programs and Heuristics for the Design of Survivable Telecommunication Networks

We consider the problem of providing a minimum cost multi-service network subject to one link failure scenarios. We assume our network is fully meshed and demand is satisfied by using direct or two hop-paths. We provide a large scale linear programming formulation and propose and test two effective heuristics.     

Stochastic Survivable Network Design Problems

In this paper we introduce survivable network design problems under a two-stage stochastic model with fixed recourse and finitely many scenarios. We propose a new cut-based formulation based on orientation properties which is stronger than the undirected cut-based model. We use a two-stage branch&cut algorithm for solving the decomposed model to provable optimality. In order to accelerate the computations, we suggest a new cut strengthening technique for the decomposed L-shaped optimality cuts that is computationally fast and easy to implement.     

交通网络连通性表达法的研究

通过对增设虚拟边网络连通性表达法和对偶图网络连通性表达法的描述和它们所面临问题的分析研究,说明这两种方法在交通网络连通性表达上,尤其是在引进交通转弯限制时所显示出来的需要大量处理工作的问题,提出了一种新的网络连通性表达法,作者称为“边标号法”,此法避免了对交通网络增设虚拟边或进行点边转化所带来的大量工作量问题,在对交通网络图不作任何修改的情况下,清楚而有效地表达出网络的连通特性。并用一个具体实例通过程序实现该方法,体现出了边标号法的优越性     

Analysis of Topological Structure in Transiently Chaotic Neural Networks

Under the condition that the damping factor is between zero and one, chaotic dynamics is proved to exist in one-dimensional transiently chaotic neural networks by Li-Misiurewicz theorem. This result extends the previous result which is done under the condition that the damping factor is zero. Because the value of damping factor affects the speed of dynamical process of transiently chaotic neural networks, this result provides more complete theoretical basis for applications. Finally, two examples by numerical simulation are given to reinforce and illustrate this result.     

光传送网的建模与拓扑规划

光传送网是指在光域内实现业务信号的传送、复用、路由选择、监控的传送网络.由于其具有大容量、高可靠性和低能耗的优点,光传送网在全球通信中扮演着至关重要的作用.因此对光传送网的链路进行准确建模,从而制定网络规划至关重要.研究了光传送网的三个重要问题,并对问题进行了数学建模与模型求解.首先依据经典的调制编码格式建立了光传送网的链路传送模型,并对其传输性能进行了度量;然后以网络价值最大化原则,从不同方面为我国城市群制定网络价值最优化的规划方案;最后对经典调制编码格式进行了改进,提出容噪能力更强的新型调制编码方案.对上述模型进行了仿真求解,建模与规划算法取得了较好的实验效果.     

图论在传送网工程设计中的应用探讨

利用运用图论理论这一数学工具,对传送网环网工程设计中光缆路由和业务承载问题进行了分析,通过数学建模,提出了相应的解决方法.在理论总结的基础上,结合工程实例提供了定量分析.     

Topological Properties of the Set of Functions Generated by Neural Networks of Fixed Size

We analyze the topological properties of the set of functions that can be implemented by neural networks of a fixed size. Surprisingly, this set has many undesirable properties. It is highly non-convex, except possibly for a few exotic activation functions. Moreover, the set is not closed with respect to \(L^p\)-norms, \(0< p < \infty \), for all practically used activation functions, and also not closed with respect to the \(L^\infty \)-norm for all practically used activation functions except for the ReLU and the parametric ReLU. Finally, the function that maps a family of weights to the function computed by the associated network is not inverse stable for every practically used activation function. In other words, if \(f_1, f_2\) are two functions realized by neural networks and if \(f_1, f_2\) are close in the sense that \(\Vert f_1 - f_2\Vert _{L^\infty } \le \varepsilon \) for \(\varepsilon > 0\), it is, regardless of the size of \(\varepsilon \), usually not possible to find weights \(w_1, w_2\) close together such that each \(f_i\) is realized by a neural network with weights \(w_i\). Overall, our findings identify potential causes for issues in the training procedure of deep learning such as no guaranteed convergence, explosion of parameters, and slow convergence.

     

Optimal Design of Gas Pipeline Networks

The paper formulates the problem of designing gas pipeline collection networks in a desert environment where there are no physical obstacles, and therefore no constraints on the geometry. It is shown that such networks should be trees. An efficient method is presented for determining the optimal position of the junction points and the diameter of the pipes if the basic configuration is given. To aid in finding the best configuration, several properties of optimal networks are derived.     

衡量网络可靠性的新模型

本文分析了传统的网络可靠性优化设计方法所存在的问题 ,给出了网络的通信通路数的定义 ,并基于网络的通信通路数给出了更能反映网络运行的实际情况的网络可靠性的定量模型 ,从而解决了传统网络可靠性优化设计方法所存在的问题 .     

On the Optimal Design of Wall-to-Wall Heat Transport

We consider the problem of optimizing heat transport through an incompressible fluid layer. Modeling passive scalar transport by advection-diffusion, we maximize the mean rate of total transport by a divergence-free velocity field. Subject to various boundary conditions and intensity constraints, we prove that the maximal rate of transport scales linearly in the r.m.s. kinetic energy and, up to possible logarithmic corrections, as the one-third power of the mean enstrophy in the advective regime. This makes rigorous a previous prediction on the near optimality of convection rolls for energy-constrained transport. On the other hand, optimal designs for enstrophy-constrained transport are significantly more difficult to describe: we introduce a “branching” flow design with an unbounded number of degrees of freedom and prove it achieves nearly optimal transport. The main technical tool behind these results is a variational principle for evaluating the transport of candidate designs. The principle admits dual formulations for bounding transport from above and below. While the upper bound is closely related to the “background method,” the lower bound reveals a connection between the optimal design problems considered herein and other apparently related model problems from mathematical materials science. These connections serve to motivate designs. © 2019 Wiley Periodicals, Inc.     

有限元软件中拓扑功能对空心剪力墙的优化设计

利用ANSYS有限元软件中拓扑功能对空心剪力墙进行模拟分析,在保证结构安全的前提下可以大大降低工程制造成本,进一步验证了拓扑功能对结构优化设计的重要作用.     

The Topological Gradient Method: From Optimal Design to Image Processing

The aim of this article is to review and extend the applications of the topological gradient to major image processing problems. We briefly review the topological gradient, and then present its application to the crack localization problem, which can be solved using the Dirichlet to Neumann approach. A very natural application of this technique in image processing is the inpainting problem, which can be solved by identifying the optimal location of the missing edges. Edge detection is of extreme importance, as edges convey essential information in a picture. A second natural application is then the image reconstruction. A class of image reconstruction problems is considered that includes restoration, demosaicing, segmentation and super-resolution. These problems are studied using a unified theoretical framework which is based on the topological gradient method. This tool is able to find the localization and orientation of the edges for blurred, low sampled, partially masked, noisy images. We review existing algorithms and propose new ones. The performance of our approach is compared with conventional image reconstruction processes.     

随机环境下再制造逆向物流网络选址研究

针对逆向物流网络的多目标性和回收废旧产品数量的不确定性,在再制造产品和新产品可相互替代的情形下,建立了随机多目标规划模型.通过求解该模型,可以确定逆向物流网络中设施的位置、数量以及设施间的流量分配.对模型中的机会约束,将其转化为各自的确定性等价类,采用主目标法对多目标问题加以处理.通过Lingo 11.0对模型算例进行求解,并分析了当置信水平和可回收量波动时网络结构和最小成本的变化,进而验证模型的稳定性.     

Virtual Path Design in Service-Specific ATM Networks

This paper addresses the problem of virtual path management in ATM networks, which is the problem of jointly selecting efficient virtual trunk routes and sizing them to meet end-to-end grade-of-service requirements. The problem is posed over capacitated networks and is formulated as a two-level multi-commodity network flow problem with linear side-constraints (physical layer capacity) and non-linear side constraints (end-to-end/link blocking). Through a variety of examples we show the method (i) generates solutions that agree with engineering judgement, (ii) can solve VP layout management for realistic size networks (of up to 200 nodes) in reasonable time and (iii) provides upper bounds on how far the solution strays from the mathematically optimal design.     

城市公交查询系统的设计与实现

针对含有“公汽、地铁、步行”的复杂公交网络环境,首先对公交问题所提供的数据进行分析,并优化数据的存储结构;其次充分考虑到公交网络客流分配的主要因素一换乘次数、票价、时间,提出了公交网中这三个目标的加权平均最优路径模型及其算法;最后对模型的算法用Matlab软件实现.通过测试,结果显示本系统能快速响应出满足乘客不同需求的公交出行路径。     

Embedding of Countable Topological Semigroups in Simple Countable Connected Topological Semigroups

We prove that any countable Hausdorff topological (inverse) semigroup is topologically isomorphically embedded into a simple countable connected Hausdorff topological (inverse) semigroup with identity.     

A Multiobjective Approach to Design Franchise Outlet Networks

The economic goals and the resulting locational objectives of a franchisor and its individual franchisees are frequently in conflict. For example, one goal of the franchisor is to maximize system-wide market coverage, while the corresponding goal of the franchisee is to maximize his or her individual market share. Consequently, the optimal facility siting scheme from one perspective may be suboptimal from the other. That is, the facility siting scheme which maximizes system-wide coverage will not necessarily maximize the market shares of the individual franchises which make up the system. In this paper we introduce a multiobjective integer programming model to design franchise networks. The model selects franchise locations and identifies individual franchise market areas. Constraints in the formulation guarantee that all franchise locations are assigned at least a minimal threshold market area with sufficient demand to ensure economic survival. An underlying assumption of the model is that a rationing mechanism exists to assign demand to various franchise locations. Consequently, the model is most appropriate for service delivery franchises in which the franchisor can define and enforce exclusive franchise territories for the various franchise outlets. The purpose of this model is to generate alternative siting configurations which demonstrate the inherent trade-offs between the objectives of the franchisor and the individual franchisees. Given these various location alternatives, it is expected that the franchisor will then evaluate them in terms of other criteria such as the likelihood of the individual franchisee's success, pricing strategies for the various sites, total costs, total profit, and the effects of the response of competitors. Consequently, the proposed model should be viewed as an aid for one aspect of the decision process, i.e. the generation of alternative courses of action.