水库移民长期补偿方式中经济性的若干影响因素分析

长期补偿方式是水库移民安置的一项重要创新,并正在一些地方水利水电建设工程中进行尝试。本文通过对比长期补偿方式与一次性补偿方式之间费用的差别,分析了补偿费用计算方法中各参数取值对长期补偿方式的总静态补偿费用和总补偿费用折现值的影响,并进一步讨论了敏感因子折现率和增长率的取值依据及其存在的问题,提出应尽快建立和完善长期补偿的相关政策,明确补偿标准和依据,以发挥这一创新机制的优越性,实现良性的、可持续的移民长期补偿。     

基于模拟植物生长算法作业车间调度问题研究

为了有效且简单的实现车间作业调度问题,提出了采用模拟植物生长算法的求解方法。针对车间作业流程,确定评价作业分配效率的指标,在此基础上建立车间作业分配的数学模型。然后通过对实例的计算及与其他优化算法的比较分析,验证了模拟植物生长算法不仅可获得最优解,求解效率也较其他算法得到了提高,是一种可行有效的方法。     

Kernel shapes of fuzzy sets in fuzzy systems for function approximation

The shapes of if-part fuzzy sets affect the approximating capability of fuzzy systems. In this paper, the fuzzy systems with the kernel-shaped if-part fuzzy sets are built directly from the training data. It is proved that these fuzzy systems are universal approximators and their uniform approximation rates can be estimated in the single-input-single-output (SISO) case. On the basis of these rates, the relationships between the approximating capability and the shapes of if-part fuzzy sets are developed for the fuzzy systems. Furthermore, the sinc functions that serve as input membership functions are proved to have the almost best approximation property in a particular class of membership functions. The theoretical results are confirmed from the simulation data. In addition, the estimations of the uniform approximation rates are extended to the multi-input-single-output (MISO) case.     

Quantifying requirements volatility effects

In an organization operating in the bancassurance sector we identified a low-risk IT subportfolio of 84 IT projects comprising together 16,500 function points, each project varying in size and duration, for which we were able to quantify its requirements volatility. This representative portfolio stems from a much larger portfolio of IT projects. We calculated the volatility from the function point countings that were available to us. These figures were aggregated into a requirements volatility benchmark. We found that maximum requirements volatility rates depend on size and duration, which refutes currently known industrial averages. For instance, a monthly growth rate of 5% is considered a critical failure factor, but in our low-risk portfolio we found more than 21% of successful projects with a volatility larger than 5%. We proposed a mathematical model taking size and duration into account that provides a maximum healthy volatility rate that is more in line with the reality of low-risk IT portfolios. Based on the model, we proposed a tolerance factor expressing the maximal volatility tolerance for a project or portfolio. For a low-risk portfolio its empirically found tolerance is apparently acceptable, and values exceeding this tolerance are used to trigger IT decision makers. We derived two volatility ratios from this model, the π-ratio and the ρ-ratio. These ratios express how close the volatility of a project has approached the danger zone when requirements volatility reaches a critical failure rate. The volatility data of a governmental IT portfolio were juxtaposed to our bancassurance benchmark, immediately exposing a problematic project, which was corroborated by its actual failure. When function points are less common, e.g. in the embedded industry, we used daily source code size measures and illustrated how to govern the volatility of a software product line of a hardware manufacturer. With the three real-world portfolios we illustrated that our results serve the purpose of an early warning system for projects that are bound to fail due to excessive volatility. Moreover, we developed essential requirements volatility metrics that belong on an IT governance dashboard and presented such a volatility dashboard.     

Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times

We consider a single machine scheduling problem with simple linear deterioration. Job processing times are assumed to be a simple linear function of a job-dependent growth rate and the job's starting time. We seek an optimal schedule, so as to minimize the total absolute deviation of completion times (TADC). We prove several interesting properties of an optimal schedule, and introduce two efficient heuristics which are tested against a lower bound.     

随机非线性系统的输出反馈控制

针对满足线性增长条件的一类随机非线性系统, 本文研究了输出反馈镇定问题. 然而不同于现有的所有文献, 由于线性增长条件中含有不可量测的状态, 引入了一个待定的高增益观测器. 利用反推设计技术, 构造性地给出了一个输出反馈控制器的设计, 通过适当地选取高增益参数, 保证了闭环系统的零解是概率意义下全局渐近稳定的, 输出几乎处处调节于零.     

Smooth Scheduling under Variable Rates or the Analog-Digital Confinement Game

This work considers non-terminating scheduling problems in which a system of multiple resources serves clients having variable needs. The system has m identical resources and n clients; in each time slot each resource may serve at most one client; in each such slot t each client γ has a rate, a real number ρ _γ (t), that specifies his needs in this slot. The rates satisfy the restriction ∑ _γ ρ _γ (t)≤m for any slot t. Except of this restriction, the rates can vary in arbitrary fashion. (This contrasts most prior works in this area in which the rates of the clients are constant.) The schedule is required to be smooth as follows: a schedule is Δ -smooth if for all time intervals I the absolute difference between the amount of service received by each client γ to his nominal needs of ∑ _t∈I ρ _γ (t) is less than Δ. Our objective are online schedulers that produce Δ-smooth schedules where Δ is a small constant which is independent of m and n. Our paper constructs such schedulers; these are the first online Δ-smooth schedulers, with a constant Δ, for clients with arbitrarily variable rates in a single or multiple resource system. Furthermore, the paper also considers a non-concurrent environment in which there is an additional restriction that each client is served at most once in each time slot; it presents the first online smooth schedulers for variable rates under this restriction. The above non-concurrent restriction is crucial in some applications (e.g., CPU scheduling). It has been pointed out that this restriction “adds a surprising amount of difficulty” to the scheduling problem. However, this observation was never formalized and, of course, was never proved. Our paper formalizes and proves some aspects of this observation. Another contribution of this paper is the introduction of a complete information, two player game called the analog-digital confinement game. In such a game pebbles are located on the real line; the two players, the analog player and the digital player, take alternating turns and each one, in his turn, moves some of the pebbles; the digital player moves the pebbles backwards by discrete distances while the analog player moves the pebbles forward by analog distances; the aim of the analog player is to cause one pebble (or more) to escape a pre-defined real interval while the aim of the digital player is to confine the pebbles into the interval. We demonstrate that this game is a convenient framework to study the general question of how to approximate an analog process by a digital one. All the above scheduling results are established via this game. In this derivation, the pebbles represent the clients, the analog player generates the needs of the clients and the digital player generates the schedule. Dedicated to the memory of Professor Shimon Even for his inspiration and encouragement     

一种分布式序列模式挖掘算法

针对分布式环境下的序列模式挖掘问题,提出了一种分布式序列模式挖掘(DSPM)算法。DSPM以PrefixSpan算法为基础,使用抽样检测技术平衡了任务负载,将挖掘任务分解后分配到多台计算机上以多进程、多线程并行执行。另外采用了伪投影技术来降低生成投影数据库的开销。实验结果表明,DSPM算法能够快速有效地挖掘分布式环境下的全局序列模式。     

Surface Growth of Boron Nitride Nanotubes through Boron Source Design

Boron nitride nanotubes (BNNTs) are promising materials due to their unique physical and chemical properties. Fabrication technologies based on gas-phase reactions reduce the control and collection efficiency of BNNTs due to reactant and product dispersion within the reaction vessel. A surface growth method that allows for controllable growth of BNNTs in certain regions using a preburied boron source is introduced. This work leverages the high solubility of boron in metals to create a boronized layer on the surface which serves as the boron source to confine the growth of BNNTs. Dense and uniform BNNTs are obtained after loading catalysts onto the boronized substrate and annealing under ammonia. Confirmatory experiments demonstrate that the boride layer provides boron for BNNTs growth. Furthermore, the patterned growth of BNNTs is realized by patterning the boronizing region, demonstrating the controllability of this method. In addition, the Ni substrate with BNNTs growth exhibits better performance in corrosion resistance and thermal conductivity than pure Ni. This study introduces an alternative strategy for the surface growth of BNNTs based on boron source design, which offers new possibilities for the controllable preparation of BNNTs for various applications.     

Intercalative Motifs-Induced Space Confinement and Bonding Covalency Enhancement Enable Ultrafast and Large Sodium Storage

Alloying-type metal sulfides with high theoretical capacities are promising anodes for sodium-ion batteries, but suffer from sluggish sodiation kinetics and huge volume expansion. Introducing intercalative motifs into alloying-type metal sulfides is an efficient strategy to solve the above issues. Herein, robust intercalative In S motifs are grafted to high-capacity layered Bi₂S₃ to form a cation-disordered (BiIn)₂S₃, synergistically realizing high-rate and large-capacity sodium storage. The In S motif with strong bonding serves as a space-confinement unit to buffer the volume expansion, maintaining superior structural stability. Moreover, the grafted high-metallicity Indium increases the bonding covalency of Bi S, realizing controllable reconstruction of Bi S bond during cycling to effectively prevent the migration and aggregation of atomic Bi. The novel (BiIn)₂S₃ anode delivers a high capacity of 537 mAh g⁻¹ at 0.4 C and a superior high-rate stability of 247 mAh g⁻¹ at 40 C over 10000 cycles. Further in situ and ex situ characterizations reveal the in-depth reaction mechanism and the breakage and formation of reversible Bi S bonds. The proposed space confinement and bonding covalency enhancement strategy via grafting intercalative motifs can be conducive to developing novel high-rate and large-capacity anodes.