基于微段插补模型的数控刀具运动优化控制

针对直线段与圆弧连接处的过渡,采用微小线段插补进行处理;通过前瞻分析的方法,控制直线段与圆弧段过渡处的进给速度提前减速,有效地减少了直线与圆弧过渡处的加工误差,建立混合S型双向加减速曲线模型,实现了圆弧段拐角处速度的控制.为了更好地优化数控刀具的加工时间,改进S型加速曲线原来加速缓慢耗时的前半部分,建立非零启动S型曲线加减速模型,从而减少启动时间,这种改进极大地优化刀具在走圆弧时的时间及平稳性.     

车床管理优化模型

本文讨论了自动化车床连续加工零件工序定期检查和刀具更换的最优策略 .针对问题一 ,应用管理成本理论结合概率统计方法 ,建立定期检查调节零件的平均管理成本的优化设计模型 ,通过计算机求解、模拟 ,得到工序设计效益最好的检查间隔和刀具更换间隔 .针对问题二 ,在问题一的基础上 ,利用概率知识调整了检查间隔中的不合格品数带来的平均损失 ,同时加上了因工序正常而误认为有故障停机产生的平均损失 ,然后建立起目标函数 ,得到工序设计效益最好的检查间隔和刀具更换策略 .对于工序故障采用自动检查装置 ,设计出了自动检查调节系统 ,并给出了算法框图 ,有效地避免工序正常而误认为有故障停机损失 ,提高工序效益     

模拟时滞化学反应系统的自适应τ-Leap算法

本文发展了一种模拟时滞化学反应系统的自适应τ-Leap算法（DAr—Leap）．该算法将后验τ-Leap算法应用到时滞化学反应系统，能够自动调节τ使得在时间区间[t，t＋τ）内发生多次反应事件并且精确地满足Leap条件，从而避免了负分子数目的产生，较大地提高了模拟速度．     

基于S型曲线加减速的数控加工刀具运动优化控制

数控机床加工折线时,存在因进给系统反复骤停而加工效率低、加工冲击大等问题.提出折线光滑转接加工优化控制算法,在指定加工误差的条件下,通过引入转接段降低实际转接点附近轨迹精度,从而实现了转接时的速度连续,并给出了转接速度的约束控制条件,对锐角、钝角转接进行了误差分析,验证了控制算法的有效性.针对由直线段和圆弧段组成的连续曲线整体加工控制问题,建立基于S型曲线加减速的加工控制模型,分析了圆弧半径对算法效率的影响.最后针对S型曲线加减速算法中加加速度存在阶跃变化的缺陷,提出了一种加加速度连续的改进算法,从而提高了加工质量.     

多级制造系统的最优化模型及其应用

多级制造系统是现代制造业的主要加工方式，系统的每一级的加工速度和加工周期是系统设计的主要决策变量，正确确定这两个变量是系统得到优化的主要目标。本文导出了系统优化的基本模型，它包括系统各级的生产时间、等待时间、生产速度、生产成本以及系统的循环时间、总成本、产品利润和利润率等，并给出了一个应用实例。     

协方差改进法及其应用

协方差改进法是构造更好估计的一个有力工具，本文在系统讨论了这个方法及其重要性质基础上，综述了它在许多模型的参数估计中的应用。这包括半相依回归模型，线性回归模型和生长曲线模型。本文还提出了几个未解决的问题。     

数控加工刀具运动的优化控制

数控加工的精准性与高速性主要体现在加工路径的插补与加工过程中刀具的速度控制.首先针对数控加工过程中常见的折线轨迹进行分析,提出了折线加工转角处的速度平滑过渡方案,保证加工精度的同时提高加工效率.进一步,得出了转角处的最大加工速度与加工误差关系.针对圆弧类曲线插补问题,在折线模型的基础上拓展了内接和外切两种插补方案.计算结果表明,采用折线平滑过渡时,外切插补方案可以保证更高的精度.     

高维同宿分支问题

本文通过应用指数二分性和将关于周期系统的Floquet方法推广到非周期系统，来构造适当的局部坐标系以建立Poincare映射，并用以解决各类余维为1和2的同宿分支问题．文中还给出了分支图和分支曲线．     

Pythagorean Bézier速端曲线及其等距线

１．引言 工业领域里的许多ＣＡＤ／ＣＡＭ系统,往往需要建立有关几何模型的连续、自动的数控刀具轨迹．例如,数控加工机床的刀具中心轨迹的计算,在纺织和制鞋业中,缝纫机械和自动化工业中铣床的数据控制,以及汽车外形设计,机器人的运动轨迹等都涉及到等距线和等距面的有效设计和计算［１,３,４,１０］ 一般地,具有给定函数类形式的曲线（面）的等距线（面）,常常不能被精确地表示为同类函数形式．例如,有理函数形式的参数曲线（面）的等距线（面）通常不再是有理的曲线（面）,而是参数 ｔ的无理向量函数形式［３,４,１０］…     

两类新的广义Ball曲线曲面的求值算法及其应用

本文研究两类新的广义Ball曲线曲面的求值算法及其应用.其一是把Bezier曲线曲面的求值转换到这两类曲线曲面的求值,大大加快了计算速度.其二是给出Bezier曲线与这两类广义Ball曲线的统一表示,并利用这种表示给出它们之间相互转换的递归算法.     

Development of the visual image in electrophotography

The development of the visual image in an electrophotographic copying machine is studied on basis of a mathematical model proposed by Spence. The resulting moving boundary problem is solved in time steps. An electrostatic problem, which has to be treated at each step, is formulated as an integral equation, which is solved numerically. The solution is found for various values of the parameters involved and the dependence of the solution on them is discussed.     

An efficient algorithm for finding all solutions of separable systems of nonlinear equations

An efficient algorithm is proposed for finding all solutions of systems of nonlinear equations with separable mappings. This algorithm is based on interval analysis, the dual simplex method, the contraction method, and a special technique which makes the algorithm not require large memory space and not require copying tableaus. By numerical examples, it is shown that the proposed algorithm could find all solutions of a system of 2000 nonlinear equations in acceptable computation time. AMS subject classification (2000)  65H10, 65G10     

Bentley’s conjecture on popularity toplist turnover under random copying

Bentley et al. studied the turnover rate in popularity toplists in a ‘random copying’ model of cultural evolution. Based on simulations of a model with population size N, list length ? and invention rate μ, they conjectured a remarkably simple formula for the turnover rate: $\ell \sqrt{\mu}$ . Here we study an overlapping generations version of the random copying model, which can be interpreted as a random walk on the integer partitions of the population size. In this model we show that the conjectured formula, after a slight correction, holds asymptotically.     

Parallel lightweight wavelet tree,suffix array and FM-index construction

We present parallel lightweight algorithms to construct wavelet trees, rank and select structures, and suffix arrays in a shared-memory setting. The work and depth of our first parallel wavelet tree algorithm match those of the best existing parallel algorithm while requiring asymptotically less memory and our second algorithm achieves the same asymptotic bounds for small alphabet sizes. Our experiments show that they are both faster and more memory-efficient than existing parallel algorithms. We also present an experimental evaluation of the parallel construction of rank and select structures, which are used in wavelet trees. Next, we design the first parallel suffix array algorithm based on induced copying. Our induced copying requires linear work and polylogarithmic depth for constant alphabets sizes. When combined with a parallel prefix doubling algorithm, it is more efficient in practice both in terms of running time and memory usage compared to existing parallel implementations. As an application, we combine our algorithms to build the FM-index in parallel.     

Walsh函数的一种新定义及快速算法设计

传统的Walsh函数是以Rademacher函数为基函数生成 .本文运用对称复制的观点 ,定义了一种新函数 G函数 ,并以G函数为基础 ,定义了四种序的Walsh函数 ,同时 ,运用序码分析方法 ,实现了两种序Walsh变换的快速算法设计 .     

"Whitney引理的推广及应用"一文中的错误

本文用一个十分简单的例子说明[1]对整体的Borel定理的证明是错误的.为此, 还须介绍函数芽和函数芽序列一致收敛的概念,并给出一个判定引理.     

A list-based compact representation for large decision tables management

Due to the huge size of the tables we manage when dealing with real decision-making problems under uncertainty, we propose turning them into minimum storage space multidimensional matrices. The process involves searching for the best order of the matrix dimensions, which is a NP-hard problem. Moreover, during the search, the computation of the new storage space that each order requires and copying the table with respect to the new order may be too time consuming or even intractable if we want a process to work in a reasonable time on an ordinary PC. In this paper, we provide efficient heuristics to solve all these problems. The optimal table includes the same knowledge as the original table, but it is compacted, which is very valuable for knowledge retrieval, learning and expert reasoning explanation purposes.     

Central difference limit for derivatives of ill-posed functions: Best approach in supercomputing era

A polynomial-time algorithm based on a revised method of iterative central difference limit is presented for computing the numerical value of the derivative of a given analytic function. Through numerical experiments, we establish that this algorithm is a best one. This can be used to obtain the derivative to a desired accuracy subject to the precision of the computer for violently fluctuating or rapidly oscillatory functions. The concerned time/computational complexity is so small in practice that in the non-main-frame supercomputing era when over estimated 95% of computing resources is unutilized and hence a waste, the complexity here is not an issue. We have, for the purpose of a comparison, also included Matlab symbolic-cum-numerical computation to obtain the derivative of the foregoing functions numerically. Matlab programs in both Matlab standard precision as well as Matlab variable precision are also included for the central difference limit along with the symbolic-cum-numerical computation. The reader concerned with computing the derivative of an ill-conditioned function - large or small - can use these programs by copying, pasting, and executing and can readily check the quality of the derivative.     

On Holographic Structures

We introduce and study the class of holographic models which can be defined by copying of some of its finite parts by means of automorphisms. We prove this class to differ from the class of countably categorical models. Characterizations of the classes of holographic Boolean algebras, abelian groups, linear orderings, fields, and equivalences are given.

     

Types of reasoning required in university exams in mathematics

Empirical research shows that students often use reasoning founded on copying algorithms or recalling facts (imitative reasoning) when solving mathematical tasks. Research also indicate that a focus on this type of reasoning might weaken the students’ understanding of the underlying mathematical concepts. It is therefore important to study the types of reasoning students have to perform in order to solve exam tasks and pass exams. The purpose of this study is to examine what types of reasoning students taking introductory calculus courses are required to perform. Tasks from 16 exams produced at four different Swedish universities were analyzed and sorted into task classes. The analysis resulted in several examples of tasks demanding different types of mathematical reasoning. The results also show that about 70% of the tasks were solvable by imitative reasoning and that 15 of the exams could be passed using only imitative reasoning.