关键词： 底层技术   区块   应用   金融领域   链   人民银行   数据库技术   数学算法  

摘要： 作为比特币的底层技术,区块链技术是以去中心化的方式,借助数学算法生成一种有序账本,并由所有参与用户共同维护的可靠数据库技术。近年来,区块链技术受到了风投基金的竞相追捧,各国金融机构也相继助力研究开拓新技术的应用市场。今年初,由人民银行推动的基于区块链技术的数字票据交易平台测试成功,标志着人民银行率先启动了对区块链技术在货币发行中实际应用的探索。

关键词： factorization   Algebra   decomposition   Associative   algorithms   cryptography   SOS Calls  

摘要： We analyze algorithms for open construction of a key on some noncommutative group. Algorithms of factorization and decomposition for associative algebras (of small dimension) are considered. A survey of applications (in particular, in cryptography) of so-called “hidden matrices” is given. © 2017, Springer Science+Business Media New York.

关键词： 小学数学   算法多样化   教学策略  

摘要： 算法多样化是计算教学的价值体现,是尊重学生个性的价值体现,但当前教学中还存在许多误区。为此,教师在教学中要恰当掌握算法多样化教学策略,既要充分预设算法多样化,也要充分调动学生学习的积极性,引导他们自主探究和合作交流,还要把握节奏,在体验中提升优化,提高教学效率。

关键词： 数学算法   计算机编程方式   优化  

摘要： 在现阶段科学技术迅速发展的背景之下,计算机编程方式也在不断得到创新和优化,如何更好地对计算机编程方式进行优化改良,已经成为信息技术行业中的热点问题,受到了越来越多人的关注。数学算法可以对数学中的诸多问题进行深入的归纳和总结,并能对归纳总结出的结果展开统一的计算。数学算法作为计算机技术的最基本的应用,对计算机编程有着深刻的影响。因此,我们必须加快优化计算机编程的方式。本文就是在分析了目前计算机编程方式的一些基本情况,并得出了一系列对计算机编程方式进行优化的方法 ,希望能有利于相关技术人员进行专业的改进优化工作。

关键词： Premature beats   Mapping   Catheter ablation   Focal arrhythmia   Mathematical optimization  

摘要： BACKGROUND Premature beats (PBs) are a common finding in patients suffering from structural heart disease, but they can also be present in healthy individuals. Catheter ablation represents a suitable therapeutic approach. However, the exact localization of the origin can be challenging, especially in cases of low PB burden during the procedure. OBJECTIVE The aim of this study was to develop an automated mapping algorithm on the basis of the hypothesis that mathematical optimization would significantly accelerate the localization of earliest activation. METHODS The algorithm is based on iterative regression analyses. When acquiring local activation times (LATs) within a 3-dimensional anatomic map of the corresponding heart chamber, this algorithm is able to identify that exact position where a next LAT measurement adds maximum information about the predicted site of origin. Furthermore, on the basis of the acquired LAT measurements, the algorithm is able to predict earliest activation with high accuracy. RESULTS A systematic retrospective analysis of the mapping performance comparing the operator with simulated search processes by the algorithm within 17 electroanatomic maps of focal spreading arrhythmias revealed a highly significant reduction of necessary LAT measurements from 55 +/- 8.8 to 10 +/- 0.51 ( n = 17;P < .0001). CONCLUSION On the basis of mathematical optimization, we developed an algorithm that is able to reduce the number of LAT measurements necessary to locate the site of earliest activation. This algorithm might significantly accelerate the mapping procedure by guiding the operator to the optimal position for the next LAT measurement. Furthermore, the algorithm would be able to predict the site of origin with high accuracy early during the mapping procedure.

关键词： 物流运输   路径优化   目标函数   最优解   适应度   可行解  

摘要： 针对带时间窗物流运输最优化路径选择问题,基于概率分布算理的共同机制,将遗传算法全局搜索优势与模拟退火算法局部搜索优势有机整合,有效规避二者算法寻优性能的不足,使构建的改进算法兼顾优越的全局搜优能力和计算效率。针对9个目标点物流运输路径优化问题的可行解,展开算法应用的试验验证。结果显示,若目标点数量较少能够求得最优解,若目标点数量较多则能够求得满意解。

关键词： 滤波   计算机   数学算法  

摘要： 计算机双音多频信号的仿真技术是通过对信号进行数学算法测算,通过卷积法和相关的代谢发完成信号解码。双音多频是实现电话通信、电话邮件以及银行信号中的相关构成的重要方法。用户通过电话发出的DTMF信号完成菜单系统的操作和设置,DTMF信号可以很容易的广泛应用与软件相关系统完成系统的解码过程。

关键词： routing algorithms   plane graph   cutting plan   resource-conscious ICP and ECP technologies  

摘要： Resource-conscious technologies for cutting sheet material include the ICP and ECP technologies that allow for aligning fragments of the contours of cutouts. In this work, we show the mathematical model for the problem of cutting out parts with these technologies and algorithms for finding cutting tool routes that satisfy technological constraints. We give a solution for the problem of representing a cutting plan as a plane graph G = (V,F,E), which is a homeomorphic image of the cutting plan. This has let us formalize technological constraints on the trajectory of cutting the parts according to the cutting plan and propose a series of algorithms for constructing a route in the graph G = (V,F,E), which is an image of an admissible trajectory. Using known coordinates of the preimages of vertices of graph G = (V,F,E) and the locations of fragments of the cutting plan that are preimages of edges of graph G = (V,F,E), the resulting route in the graph G = (V,E) can be interpreted as the cutting tool's trajectory. The proposed algorithms for finding routes in a connected graph G have polynomial computational complexity. To find the optimal route in an unconnected graph G, we need to solve, for every dividing face f of graph G, a travelling salesman problem on the set of faces incident to f.