探索变动成本法与现行财务会计相结合的模式

变动成本法虽是西方资本主义国家的产物,但它在成本控制、短期决策、业绩评价等方面有其独特的优点。随着企业管理的不断深化,现行财务会计采用的全部成本法在某些方面已不能适应企业内部管理的需要。为了兼顾企业内部管理和国家统一规定的要求,只有将变动成本法和全部成本法合为一体,结合运用。本文试图探索一套以变动成本法为基础,同时求得全部成本法资料的成本核算模式。     

Improvement of borrowing channel assignment for patterned traffic load by online cellular probabilistic self-organizing map

This paper describes an improvement of borrowing channel assignment (BCA) for patterned traffic load by using the short-term traffic prediction ability of cellular probabilistic self-organizing map (CPSOM). The fast growing cellular mobile systems demand more efficient and faster channel allocation techniques today. In case of patterned traffic load, the traditional BCA methods are not efficient to further enhance the performance because heavy-traffic cells cannot borrow channels from their neighboring cells with light or medium traffic that may have unused nominal channels. The performance can be increased if the short-term traffic load can be predicted. The predicted results can then be used for channel re-assignment. Therefore, the unused nominal channels of the light-or-medium-traffic cells can be transferred to the heavy-traffic cells that need more nominal channels. In this paper, CPSOM is used online for traffic prediction. In this sense, the proposed CPSOM-based BCA method is able to enhance the performance for patterned traffic load compared with the traditional BCA methods. Simulation results corroborate that the proposed method enables the system to work with better performance for patterned traffic load than the traditional BCA methods.     

Classifier combination based on confidence transformation

This paper investigates the effects of confidence transformation in combining multiple classifiers using various combination rules. The combination methods were tested in handwritten digit recognition by combining varying classifier sets. The classifier outputs are transformed to confidence measures by combining three scaling functions (global normalization, Gaussian density modeling, and logistic regression) and three confidence types (linear, sigmoid, and evidence). The combination rules include fixed rules (sum-rule, product-rule, median-rule, etc.) and trained rules (linear discriminants and weighted combination with various parameter estimation techniques). The experimental results justify that confidence transformation benefits the combination performance of either fixed rules or trained rules. Trained rules mostly outperform fixed rules, especially when the classifier set contains weak classifiers. Among the trained rules, the support vector machine with linear kernel (linear SVM) performs best while the weighted combination with optimized weights performs comparably well. I have also attempted the joint optimization of confidence parameters and combination weights but its performance was inferior to that of cascaded confidence transformation-combination. This justifies that the cascaded strategy is a right way of multiple classifier combination.     

形状记忆合金在固定翼飞机上的应用探索

针对固定翼飞机存在的问题，科研人员将集传感器、驱动器和致动器于一身的形状记忆合金（Shape memory alloy，简称SMA）驱动器应用到飞机中，以改善飞行性能，抑制喷射噪音等。综述了SMA驱动的变形机翼、涡轮发动机进气道、喷口以及喷射噪音抑制装置的原理、结构和控制方法，并讨论了SMA在飞机上的应用。随着研究的不断深入，SMA必将在飞机上获得更为广泛的应用。     

自由能微扰法计算酶和抑制剂的相对结合自由能

用自由能微扰方法（FEP）计算了2种hydroxamate类的抑制剂和MMP－2的相对结合自由能，自由能计算采用了慢增长（Slow Growth)和固定窗口增长（Fixed Width Window Growth) 2种方法，并且在每次计算中都采用了双向采样（double-wide sampling)的策略，2种方法计算得到的相对结合自由能都能和实验值得很好地符合。     

Josephus问题分析与探讨

Josephus问题是一个经典的递归问题。本文从问题的编程解决入手，提出静态数组、环链表、递归等3种解题方案。本文还对问题作进一步分析，考虑解的稳定点,最后提出一个优化方案，将问题的解决归约到一个较小的规模。     

整数标号的Brouwer不动点的构造性算法

本文提出计算标准单纯形上连续自映射不动点的一种整数标号的变维数单纯重复开始算法，该算法给出了Ｂｒｏｕｗｅｒ不动点定理一个新的构造性证明。数值结果表明新的算法是行之有效的。     

一类高阶非线性时滞系统的周期解

研究了一类高阶非线性时滞系统的周期解问题，利用不动点定理给出了系统存在唯一一个周期解的几个充分条件及周期解所在的范围，推广和加强了文献［１］的结果。     

智能式松香定量灌装仪

“智能式松香定量灌装仪”除了能显示松香的重外,还可自动切换拖动装置,完成松香的自动定量灌装。这样,既可减轻工人的劳动强度,又可满足灌装精度。     

On the uniformity of distribution of the decryption exponent in fixed encryption exponent RSA

Let us fix a security parameter n and a sufficiently large encryption exponent e. We show that for a random choice of the RSA modulus m=pq, where p and q are n-bit primes, the decryption exponent d, defined by is uniformly distributed modulo φ(m). It is known, due to recent work of Boneh, Durfee and Frankel, that additional information about some bits of d may turn out to be dramatic for the security of the whole cryptosystem. Our uniformity of distribution result implies that sufficiently long strings of the most and the least significant bits of d, which are vulnerable to such attacks, behave as random binary vectors.