关键词： 双倍余额递减法   折旧   折余价值  

摘要： 固定资产双倍余额递减法的传统计算方法在实际应用中显得非常繁琐且计算过程容易出错。本文主要分析了利用数学公式来推导计算固定资产各年折旧额、累计折旧额、各年初折余价值的数学模型,从而简化计算过程,有利于审计抽查验算。

关键词： 图解分割   数学形态学   粘连图像  

摘要： 为了保障我国的粮食安全,需要特别重视提高粮食生产能力,并为商品粮食的收购以及市场流通提供快速、准确的外观品质检测手段。为此,针对粘连籽粒图像分割时易产生过分割与欠分割的问题,在凌云设计的粮食图像分割算法的基础上,提出了一种改进的数学形态学方法,并对原算法与改进算法进行对比实验。实验结果表明,改进算法能够较好地解决粘连籽粒的分割问题,特别是籽粒接触面积较小、碎米率较大的图像的分割问题。

关键词： Musci   Mathematical Model   Scattering   test problem   Emissions trading   Manufacturing Facilities   algorithms   emissions trading scheme   SEARCHING ALGORITHM   Second Hand Smoke   Vehicle routing  

摘要： The location of manufacturing facilities is one of the most important strategic decisions considered in the design of logistic systems. Another important strategic decision is the structure and management of the fleets. Most often, even if two types of problem (i.e., location of facilities and vehicle routing) have occurred in a given scenario, they have been studied and solved separately. This paper presents a new integrated mathematical model for a bi-objective multi-depot location-routing problem where the total demand served is to be maximized and the total cost, consisting of start-up of the facility, fixed and variable depots and variable delivery cost, is to be minimized. Since this type of the problem is NP-hard, a new multi-objective scatter search (MOSS) algorithm is proposed to obtain the Pareto frontier for the given problem. To validate the performance of the proposed MOSS algorithm in terms of the solution quality and diversity level, various test problems are carried out and the efficiency of this algorithm based on some comparison metrics is compared with the elite tabu search (ETS). The computational results show that the proposed MOSS outperforms the ETS, especially in large-sized problems. (c) 2010 The Society of Manufacturing Engineers. Published by Elsevier Ltd. All rights reserved.

关键词： Mathematical modeling   Cutting and packing   Optimization   Phi-function   No-Fit Polygon  

摘要： The article is devoted to mathematical models and practical algorithms for solving the cutting and packing (C&P) problem. We review and further enhance the main tool of our studies - phi-functions. Those are constructed here for 2D and 3D objects (unlike other standard tools, such as No-Fit Polygons, which are restricted to the 2D geometry). We also demonstrate that in many realistic cases the Phi-functions can be described by quite simple formulas without radicals and other complications. Lastly, a general Solution strategy using the phi-functions is Outlined and illustrated by several 2D and 3D examples. (C) 2010 Elsevier B.V. All rights reserved.

关键词： Traveling salesman problem  

摘要： In the paper there is introduced the newly developed optimization method the Stochastic Optimization Algorithm with Probability Vector (PSV). It is related to Stochastic Learning Algorithm with Probability Vector for artificial neural networks. Both algorithms are inspired by stochastic iterated function system SIFS for generating the statistically self similar fractals. The PSV is gradient method where the direction of individual future movement from the population is based stochastically. PSV was tested on mathematical function minimization and on the travelling sales man problem. The influence of the quantity of individuals upon the best achieved fitness function was also tested on the mathematical functions minimization.

关键词： Texture modeling   Color image decomposition   Projected gradient algorithm   Color texture modeling  

摘要： In this paper, we are interested in texture modeling with functional analysis spaces. We focus on the case of color image processing, and in particular color image decomposition. The problem of image decomposition consists in splitting an original image f into two components u and v. u should contain the geometric information of the original image, while v should be made of the oscillating patterns of f, such as textures. We propose here a scheme based on a projected gradient algorithm to compute the solution of various decomposition models for color images or vector-valued images. We provide a direct convergence proof of the scheme, and we give some analysis on color texture modeling.

关键词： Mathematical foundations of cryptography   Secret sharing protocols   Strategic information management   Mathematical linguistics   Design of cryptographic algorithms  

摘要： This publication discusses new opportunities for creating threshold schemes for secret sharing arising from the use of mathematical linguistic formalisms. Such methods are based on known threshold schemes of information splitting extended by adding an extra stage at which bit blocks of the shared information are coded using suitably defined context-free grammars, hi practice, this will help with developing new algorithms, which besides allowing information sharing will also make it possible to obtain protocols for the confidential exchange of this information with or without involving a trusted instance. Such protocols will contribute to the development of modern cryptographic techniques and future computer science. (C) 2010 Elsevier Ltd. All rights reserved.

关键词： algorithmic algebras   program design   program synthesis   algorithm optimization   heuristics   artificial intelligence  

摘要： The paper proposes a new approach and a system to develop parallel algorithms based on the joint use of the algebraic-algorithmic methodology of specification and development of programs and non-algorithmic (heuristic) techniques for code generation. The algebraic part of the methodology provides the formalized process of parallel program design through high-level algebraic-algorithmic specifications and automating transformations up to program code in a standard programming language. The heuristic part of the system is the dynamic adjustment of program code to a target platform and its optimization using self-learning code generation and heuristic technologies.

关键词： 欧拉算符   高阶微商余项   三次插值函数   准拉格朗日法   欧拉法   时间积分方案   CFL判据  

摘要： 从预报方程组通式和欧拉算符出发,用泰勒级数展开,推导出时空间微商余项为二阶、四阶完全预报方程组。可以证明,同阶时空间微商余项的准拉格朗日法和向前差分欧拉法时间积分方案,具有相同的物理意义和数学一致性,相比之下,传统中央差欧拉法时间积分方案是"简单格式"与"增大不可预测计算误差"并存。进而讨论用"三次插值函数"实现二阶时空间微商余项准拉格朗日法、或同阶向前差分欧拉法(可"二选一"),它们应该分别替代"双线性插值"准拉格朗日法和传统时空间中央差欧拉法,因前二者时空间微商余项及计算精度高于后二者。所以,三次插值函数算法可将准拉格朗日法和欧拉法时间积分方案、以及CFL判据统一起来。由于三次插值函数具有对原函数"变量场"的数学定律"收敛性"和二阶可导"最优性",且一次"三次插值函数"运算,即具对网格变量场二阶可导拟合"等价性":不仅拟合变量场斜率、还拟合其曲率和挠率。并因周期"三次插值函数",可作全球变量场"三次插值函数"二阶可导拟合,实现全球"三次"数值模式,并且可按变量场曲率判断,作变量场局域或单点平滑,保持"三次"模式时间积分的稳定性。

关键词： 数学证明方法   算法实现   程序设计  

摘要： 从数学证明和程序设计的角度,分析比较了数学命题定理证明中常用的数学归纳法、递推算法、递归算法、反证法等数学方法.讨论了它们在理论证明、算法实现方面的联系和优缺点,提出教学中的一些建议.