An efficient approach for the S‐shaped penalty function

Interval goal programming (IGP) with a marginal penalty function (PF) was first proposed by Charnes and Collomb in 1972, and further improved by Kvanli and other researchers. Recently, Lu and Chen proposed an efficient logarithmic method to formulate IGP with an S‐shaped PF. However, their method requires adding many binary variables when the problem size becomes large, which increases the computational burden in the solution process. This study proposes an efficient approach for the S‐shaped PF. The arbitrary PF frequently appears in the fields of business and industry. However, none of the previous approaches have addressed arbitrary PFs without adding binary variables. The proposed approach can be easily extended to formulate an arbitrary PF in which binary variables are no longer required, regardless of the number of break points. The proposed method can improve the efficiency of IGP for solving large size management and decision problems in considering PFs. In order to demonstrate the correctness, usefulness of the proposed model, illustrative examples are provided.     

A Dynamic Memory Allocation Optimization Mechanism Based on Spark

Spark is a distributed data processing framework based on memory. Memory allocation is a focus question of Spark research. A good memory allocation scheme can effectively improve the efficiency of task execution and memory resource utilization of the Spark. Aiming at the memory allocation problem in the Spark2.x version, this paper optimizes the memory allocation strategy by analyzing the Spark memory model, the existing cache replacement algorithms and the memory allocation methods, which is on the basis of minimizing the storage area and allocating the execution area according to the demand. It mainly including two parts: cache replacement optimization and memory allocation optimization. Firstly, in the storage area, the cache replacement algorithm is optimized according to the characteristics of RDD Partition, which is combined with PCA dimension. In this section, the four features of RDD Partition are selected. When the RDD cache is replaced, only two most important features are selected by PCA dimension reduction method each time, thereby ensuring the generalization of the cache replacement strategy. Secondly, the memory allocation strategy of the execution area is optimized according to the memory requirement of Task and the memory space of storage area. In this paper, a series of experiments in Spark on Yarn mode are carried out to verify the effectiveness of the optimization algorithm and improve the cluster performance.     

基于NB分类器重访概率预测的Web缓存替换策略

Web缓存是用来解决网络访问延迟和网络拥塞问题，缓存替换策略直接影响缓存的命中率。为此，提出一种朴素贝叶斯（NB）分类器重访概率预测的Web缓存替换策略；根据用户之前访问日志，通过分区操作提取多项特征来表示每次访问的对象，并构建特征数据集；训练NB分类器，用来确定缓存中对象被再次访问的概率，为对象分配权重；结合LRU策略来合理删除一些对象。仿真结果表明，提出的策略在保证较高命中率的同时有效降低了执行时间。     

Ant colony approaches for multiobjective structural optimization problems with a cardinality constraint

Two Ant Colony Optimization algorithms are proposed to tackle multiobjective structural optimization problems with an additional constraint. A cardinality constraint is introduced in order to limit the number of distinct values of the design variables appearing in any candidate solution. Such constraint is directly enforced when an ant builds a candidate solution, while the other mechanical constraints are handled by means of an adaptive penalty method (APM). The test-problems are composed by structural optimization problems with discrete design variables, and the objectives are to minimize both the structure’s weight and its maximum nodal displacement. The Pareto sets generated in the computational experiments are evaluated by means of performance metrics, and the obtained designs are also compared with solutions available from single-objective studies in the literature.     

Optimised memory allocation for less false abortion and better performance in hardware transactional memory

ABSTRACT

This paper introduces and tackles a special performance hazard in Hardware Transactional Memory (HTM): false abortion. False abortion causes many unnecessary transaction abortions in HTM and can greatly impact the performance, making HTM not that useful when it is adopted as a fast path for Software Transactional Memory. By introducing a new memory allocator design, we are able to put objects that are likely to be accessed together from different threads into different cache lines and thus avoid conflicts of hardware transactions in different threads. Experiments show that our method can reduce 47% of transaction abortion and achieve a speedup of up to 1.67× (averagely 22%), yet only consume 14% more memory, showing great potential to enhance current HTM technology.     

带延迟索赔和随机收入的离散风险模型的Gerber-Shiu分析（英）

破产理论是保险数学中的重要问题，它可以为保险公司决策者提供一个非常有用的早期风险预警手段．本文研究了一个带潜在延迟索赔和随机保费收入的复合二项风险模型．利用矩母函数的技巧，得到了 Gerber-Shiu 期望折罚函数的递推公式．特别地，还得到了贴现因子为 1 的特殊情形下的 Gerber-Shiu 期望折罚函数的解析表达式．最后还得到了实际应用中的一些重要的破产特征量，包括破产概率，破产时赤字的密度函数，破产前盈余与破产时赤字的联合密度函数，以及导致破产的索赔密度函数等．     

正确行使煤矿安全监察行政处罚权

本文论述了煤矿安全监察机构在行使行政处罚权时应遵循的原则、程序以及行政处罚的种类、适用范围.     

一种增广拉格朗日优化方案及其非连续变形分析实现

接触力计算精度是关乎非连续变形分析结果有效性的关键因素之一。经典非连续变形分析法(DDA)采用罚法施加块体间的接触约束,实现简单,但合理的罚值选取困难。因此,提出了一种增广拉格朗日优化算法,改进DDA中接触约束的处理。通过结合开闭迭代算法和自适应罚值更新方案等,提出并实现了多面体DDA增广拉格朗日算法及其优化方案。最后,设计了2个经典数值算例,计算结果表明:改进后的三维DDA提高了计算精度且保证了计算效率,可用于复杂多面体块体系统的非连续力学行为分析,如大型节理岩体工程稳定性分析。