A Hybrid Parallel Strategy for Isogeometric Topology Optimization via CPU/GPU Heterogeneous Computing

This paper aims to solve large-scale and complex isogeometric topology optimization problems that consumesignificant computational resources. A novel isogeometric topology optimization method with a hybrid parallelstrategy of CPU/GPU is proposed, while the hybrid parallel strategies for stiffness matrix assembly, equationsolving, sensitivity analysis, and design variable update are discussed in detail. To ensure the high efficiency ofCPU/GPU computing, a workload balancing strategy is presented for optimally distributing the workload betweenCPU and GPU. To illustrate the advantages of the proposedmethod, three benchmark examples are tested to verifythe hybrid parallel strategy in this paper. The results show that the efficiency of the hybrid method is faster thanserial CPU and parallel GPU, while the speedups can be up to two orders of magnitude.

Remarks on computation of topological degree

ＲｅｍａｒｋｓｏｎｃｏｍｐｕｔａｔｉｏｎｏｆｔｏｐｏｌｏｇｉｃａｌｄｅｇｒｅＷｕＸｉｎｇｐｉｎｇ１，ＤｅｎｇＸｕｅｑｉｎｇ２１ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＳｏｕｔｈｗｅｓｔＣｈｉｎａＮｏｒｍａｌＵｎｉｖｅｒｓｉｔｙ，Ｃｈｏｎｇｑｉ...

Simulation of Projective Non-Abelian Anyons for Quantum Computation

Fundamental particles in nature can be classified as bosons or fermions,which satisfy their correspondent statistics.However,quasiparticles of condensed matter physics may be neither bosons nor fermions,but can be named as anyons satisfying a generalized statistics.These anyons can be related with topological phases of matter.Interestingly,anyons can be used to encode qubits to perform quantum computations with specific advantages in which the corresponding qubits are naturally fault tolerant due to topological protection.[1,2]This approach is called topological quantum computation.However,its implementation based on natural systems still seems far from realization.

Link-Vertex Topology Aggregation for Multi-domain Path Computation with Hierarchical PCE Architecture

Inter-domain path computing is one big issue in multi-domain networks. The Hierarchical Path Computing Element (H-PCE) is a semi-central architecture for computing inter-domain path. To facilitate H-PCE in inter-domain path computing, this paper proposed a topology aggregation scheme to abstract the edge nodes and their connected inter-domain link as one vertex to achieve more optimal paths and confidentiality guarantee. The effectiveness of the scheme has been demonstrated on solving wavelength routing in multi-domain Wavelength Division Multiplexing (WDM) network via simulation. Simulation results show that this scheme reduces at least 10% inter-domain blocking probability, compared with the traditional Domain-to-the-Node (DtN) scheme.

Dynamic Routing Protocol for Computer Networkswith Clustering Topology

This paper presents a hierarchical dynamic routing protocol (HDRP) based on the discrete dynamic programming principle. The proposed protocol can adapt to the dynamic and large computer networks (DLCN) with clustering topology. The procedures for realizing routing update and decision are presented in this paper. The proof of correctness and complexity analysis of the protocol are also made. The performance measures of the HDRP including throughput and average message delay are evaluated by using of simulation. The study shows that the HDRP provides a new available approach to the routing decision for DLCN or high speed networks with clustering topology.

E-Infinity Dualities, Discontinuous Spacetimes, Xonic Quantum Physics and the Decisive Experiment

Using powerful concepts and tools borrowed from the seminal arsenal connecting physics fundamentals with esoteric set theoretical operations developed in recent years by Alexandria E-infinity theoretician M. S. El Naschie, this paper explores the deep implications of some of the dualities Dr El Naschie has identified and analyzed in his exposes, connecting them with our own Xonic Quantum Physics (XQP) which places dynamical action rather than spacetime and energy at the core of the System of the World.

Cosmic Dark Energy from ‘t Hooft’s Dimensional Regularization and Witten’s Topological Quantum Field Pure Gravity

We utilize two different theories to prove that cosmic dark energy density is the complimentary Legendre transformation of ordinary energy and vice versa as given by E(dark) = mc2 (21/22) and E(ordinary) = mc2/22. The first theory used is based on G ‘t Hooft’s remarkably simple renormalization procedure in which a neat mathematical maneuver is introduced via the dimensionality of our four dimensional spacetime. Thus, ‘t Hooft used instead of D = 4 and then took at the end of an intricate and subtle computation the limit to obtain the result while avoiding various problems including the pole singularity at D = 4. Here and in contradistinction to the classical form of dimensional and renormalization we set and do not take the limit where and is the theoretically and experimentally well established Hardy’s generic quantum entanglement. At the end we see that the dark energy density is simply the ratio of and the smooth disentangled D = 4, i.e. (dark) = (4 -k)/4 = 3.8196011/4 = 0.9549150275. Consequently where we have ignored the fine structure details by rounding 21 + k to 21 and 22 + k to 22 in a manner not that much different from of the original form of dimensional regularization theory. The result is subsequently validated by another equally ingenious approach due mainly to E. Witten and his school of topological quantum field theory. We notice that in that theory the local degrees of freedom are zero. Therefore, we are dealing essentially with pure gravity where are the degrees of freedom and is the corresponding dimension. The results and the conclusion of the paper are summarized in Figure 1-3, Table 1 and Flow Chart 1.

Solid-state quantum computation station

Solid-state quantum computation station belongs to the group 2 of manipulation of quantum state in the Synergetic Extreme Condition User Facility. Here we will first outline the research background, aspects, and objectives of the station, followed by a discussion of the recent scientific as well as technological progress in this field based on similar experimental facilities to be constructed in the station. Finally, a brief summary and research perspective will be presented.

Anomalous Josephson Effect in Topological Insulator-Based Josephson Trijunction

We studied anomalous Josephson effect(AJE) in Josephson trijunctions fabricated on Bi_(2)Se_(3), and found that the AJE in T-shaped trijunctions significantly alters the Majorana phase diagram of the trijunctions, when an in-plane magnetic field is applied parallel to two of the three single junctions. Such a phenomenon in topological insulator-based Josephson trijunction provides unambiguous evidence for the existence of AJE in the system, and may provide an additional knob for controlling the Majorana bound states in the Fu–Kane scheme of topological quantum computation.

Computing the topology of an arrangement of implicitly defined real algebraic plane curves~§

We introduce a new algebraic approach dealing with the problem of computing the topology of an arrangement of a finite set of real algebraic plane curves presented implicitly. The main achievement of the presented method is a complete avoidance of irrational numbers that appear when using the sweeping method in the classical way for solving the problem at hand. Therefore, it is worth mentioning that the efficiency of the proposed method is only assured for low-degree curves.

Simulating the Hadamard gate in the Fibonacci disk code for universal topological quantum computation

The 21st century is widely believed to be a century of information processing.In particular,of quantum information processing,including quantum communi-cation and quantum computation.It is well known that quantum states are generally fragile,in the sense that quantum coher ence and entanglement needed for information processing cannot be kept for a sufficiently long time due to un-avoidable noises and environmental disturbances.Fortunately,this problem may be overcome by exploring the so-called topological states of matter,whose physical properties,at least some of the main ones to be used,are robust against disorders and variations in interactions.Thus emerged the research field of topological,or fault tolerant,quantum computation.

计算机网络拓扑结构对虚拟现实传输效果的影响分析

阐述星形、环形、总线型和网状不同网络拓扑结构对虚拟现实数据传输速度、延迟、带宽利用率及稳定性的影响。采用理论分析与实验模拟的方法,为虚拟现实系统的网络设计提供优化方案。

荒漠草原人工柠条引入后土壤大孔隙拓扑结构演变特征

[目的]认识人工柠条种植对土壤生态过程的影响,从而为人工植被的管理提供科学依据。[方法]以宁夏盐池县典型荒漠草原区风沙土生境的草地(0 a)及9,14,24,35 a生人工柠条林为对象,分别进行原状土柱采集、CT扫描及图像处理分析,获取土壤大孔隙几何分布特征,量化大孔隙表面积、等效直径和连接度等拓扑结构参数,研究了柠条生长过程中土壤大孔隙演变特征。[结果]通过三维图像可以看出,和0 a样地相比,随着林龄增加,各样地在0—200 mm土层大孔隙数量明显增多且结构更加复杂。定量分析表明,和0 a样地相比,不同林龄柠条林地在同一土层,大孔隙数量密度、长度密度、等效直径、连接度之间差异显著(p<0.05),而表面积密度、体积密度无显著差异(p>0.05)。具体表现为在0—100 mm和100—200 mm土层大孔隙数量密度、长度密度均显著增加(p<0.05),且随着林龄增加,表层土壤(0—100 mm)增幅要大于深层土壤(100—200 mm);等效直径在0—100 mm土层显著减小,在100—200 mm土层显著增加(p<0.05),而连接度变化规律恰好相反。进一步分析发现,林龄与大孔隙数量密度、长度密度、表面积密度呈显著正相关(p<0.05),与大孔隙等效直径呈显著负相关(p<0.01),与大孔隙体积密度差异不显著(p>0.05)。[结论]人工柠条林的引入会促进土壤大孔隙致密网络状结构形成,改善大孔隙表面积、连接度等拓扑结构,且随着林龄增加,对土壤改良效果越明显。

Majorana noise model and its influence on the power spectrum

Majorana quantum computation offers a potential approach to securely manipulating and storing quantum data in a topological manner that may effectively resist the decoherence induced by local noise. However, actual Majorana qubit setups are susceptible to noise. In this study, from a quantum dynamics perspective, we develop a noise model for Majorana qubits that accounts for quasi-particle poisoning and Majorana overlapping with fluctuation. Furthermore, we focus on Majorana parity readout methodologies, specifically those leveraging an ancillary quantum dot, and carry out an indepth exploration of continuous measurement techniques founded on the quantum jump model of a quantum point contact.Utilizing these methodologies, we proceed to analyze the influence of noise on the afore-mentioned noise model, employing numerical computation to evaluate the power spectrum and frequency curve. In the culmination of our study, we put forward a strategy to benchmark the presence and detailed properties of noise in Majorana qubits.

基于GPU加速的等几何拓扑优化高效多重网格求解方法

针对大规模等几何拓扑优化(ITO)计算量巨大、传统求解方法效率低的问题,提出了一种基于样条h细化的高效多重网格方程求解方法。该方法利用h细化插值得到粗细网格之间的权重信息,然后构造多重网格方法的插值矩阵,获得更准确的粗细网格映射信息,从而提高求解速度。此外,对多重网格求解过程进行分析,构建其高效GPU并行算法。数值算例表明,所提出的求解方法与线性插值的多重网格共轭梯度法、代数多重网格共轭梯度法和预处理共轭梯度法相比分别取得了最高1.47、11.12和17.02的加速比。GPU并行求解相对于CPU串行求解的加速比高达33.86,显著提高了大规模线性方程组的求解效率。

Granular Computing on Partitions, Coverings and Neighborhood Systems

Granular Computing on partitions(RST),coverings(GrCC) and neighborhood systems(LNS) are examined: (1) The order of generality is RST, GrCC, and then LNS. (2) The quotient structure: In RST, it is called quotient set. In GrCC, it is a simplical complex, called the nerve of the covering in combinatorial topology. For LNS, the structure has no known description. (3) The approximation space of RST is a topological space generated by a partition, called a clopen space. For LNS, it is a generalized/pretopological space which is more general than topological space. For GrCC,there are two possibilities. One is a special case of LNS,which is the topological space generated by the covering. There is another topological space, the topology generated by the finite intersections of the members of a covering The first one treats covering as a base, the second one as a subbase. (4) Knowledge representations in RST are symbol-valued systems. In GrCC, they are expression-valued systems. In LNS, they are multivalued system; reported in 1998 . (5) RST and GRCC representation theories are complete in the sense that granular models can be recaptured fully from the knowledge representations.

A topology optimization method based on element independent nodal density

A methodology for topology optimization based on element independent nodal density(EIND) is developed.Nodal densities are implemented as the design variables and interpolated onto element space to determine the density of any point with Shepard interpolation function.The influence of the diameter of interpolation is discussed which shows good robustness.The new approach is demonstrated on the minimum volume problem subjected to a displacement constraint.The rational approximation for material properties(RAMP) method and a dual programming optimization algorithm are used to penalize the intermediate density point to achieve nearly 0-1 solutions.Solutions are shown to meet stability,mesh dependence or non-checkerboard patterns of topology optimization without additional constraints.Finally,the computational efficiency is greatly improved by multithread parallel computing with OpenMP.

Efficient Partially Asynchronous Parallel Simulation on Multicomputer Systems: Research and Practice

This paper presents partially asynchronous parallel simulation of continuous-system (PAPSoCS) and some approaches to the issues of its implementation on a multicomputer system. To guarantee the simulation results correct and speedup the simulation, the scheme for efficient PAPSoCS is proposed and the virtual topology star is constructed to match the path of message passing for solving algorithm-architecture adequation problem. Under the circumstances that messages frequently passed inter-processor are much shorter, typically within several 4 bytes, asynchronous communication mode is employed to reduce the communication ratio. Experiment results show that asynchronous parallel simulation has much higher efficiency than its synchronous counterpart.

云计算环境下配电网调度决策模型诱骗式隐私保护方法

随着“新基建”“东数西算”等国家重大工程快速推进,云计算成为新型电力系统调度决策的重要依托手段。针对云计算过程潜藏的信息安全风险,基于主动诱骗理念提出了适配配电网调度决策模型的隐私保护方法。该方法通过构建与真实配电网伴生的随机化虚拟配电网,在防止隐私信息泄露的前提下保持了调度决策模型的稀疏性,进而整体提升云计算效率。首先,结合仿射变换原理,探讨了现有调度决策模型隐私保护方法面临的求解效率低下问题。其次,根据无标度网络模型,设计了伴生虚拟配电网生成方法,并推导了不同配电网结构之间的转换原理,提出了虚拟调度决策模型构建方法。然后,设计了基于双重校验机制的云计算框架,通过不同服务商云计算结果的相互验证,进一步保证结果的正确性和可信度。最后,基于6节点、IEEE 906节点系统进行数值实验,验证了所提方法的有效性和实用性。

选区外延生长的PbTe-超导杂化纳米线:一个可能实现拓扑量子计算的新体系

半导体-超导体杂化纳米线是用于研究马约拉纳零能模和拓扑量子计算的主要平台之一,而基于Ⅲ-Ⅴ族半导体InAs和InSb的纳米线则是当前此方向研究的主流材料体系.尽管经过多年制备技术的改进和优化,样品中过多的缺陷和杂质仍是阻碍此方向进一步发展的核心问题.近年来,一个新的马约拉纳纳米线候选体系——Ⅳ-Ⅵ族半导体PbTe-超导杂化纳米线吸引了很大关注并获得了快速的研究进展.PbTe的介电常数巨大,且具有晶格匹配的衬底,这些优势使其有潜力突破纳米线样品质量提升的瓶颈,成为马约拉纳零能模的研究和拓扑量子计算实现的理想平台.本文将简单介绍最近几年在PbTe纳米线和PbTe-超导杂化纳米线器件的选区分子束外延生长、输运性质研究方面取得的重要进展,并对这种新的马约拉纳纳米线候选体系的优势、问题及基于其实现拓扑量子计算的前景进行讨论.