面向异步机制的自动重构方法研究

为了解决并行处理中同步阻塞会浪费系统资源和影响程序性能的问题,提出了一种基于CompletableFuture异步机制的自动重构方法。首先,使用WALA静态程序分析工具进行访问者模式分析、逃逸分析、别名分析以及数据流分析等静态程序分析技术,确定共享变量数据的操作方式;然后,基于CompletableFuture机制设置4种异步重构模式;最后,根据不同模式实现异步机制的自动重构。基于此方法,在Eclipse平台下开发了自动重构工具AsynRef,并对HSQLDB,Jenkins, JGroups和SPECjbb2005等4个大型实际应用程序进行自动重构,从重构个数、改变的代码行数、准确性和重构后程序性能等方面对AsynRef进行评估,对4个程序所包含的919个同步方法共完成387个异步机制转换。结果显示,使用AsynRef进行异步机制重构后,程序执行性能有8%到39%的不同程度的提升。AsynRef可以有效完成代码异步化自动重构,与传统手动重构相比,有效提升了异步化的重构效率。     

一种数据立方高效索引机制 --CuboidTree

提出了一种高效的数据立方高效索引机制CuboidTree，利用Z-Order编码以保持同一数据小方内立方元组之间的多维空间邻近性，将数据立方查询归结构为针为其中某个特定数据小方的查询，从而将同一数据小方中的立方元组聚簇在一起以加速响应数据立方查询，对模拟数据和真实数据进行的实验表明，CuboidTree不仅可以明显地提高数据立方范围查询的性能，而且节省了存储空间，更重要的是它对数据立方查询性能的改进效果随着数据立方维数的增加而愈加明显。     

一种改进的Linux内存分配机制

在对Linux2.4.0中一种新型的内存分配机制－zone分配器进行分析的基础上，针对其中存在的碎片问题提出了一种改进的分配算法和碎片解决方案，即在区中定义一系列子区，每一个子区只用来处理一个类对象的分配，改进后的zone分配器简单、快速、明显减少了内存碎片，提高了分配性能。     

铁矿球团中有机复合膨润土的强化机理

在球团生产中配加有机复合膨润土可明显提高生球强度、改善生球热稳定性、降低膨润土配比和提高球团矿铁品位.研究结果表明:在保证球团质量的前提下,有机复合膨润土配比为1.2 %时即可达到常规膨润土加入量为2.2 %时的生球强度,且爆裂温度均大于620℃,球团焙烧性能较好,成品球团矿的铁品位约提高了1.10个百分点.通过现代微观检测手段对有机复合膨润土亮作用机理的进行分析,发现有机小分子插入膨润土晶层间,其表面阴离子基团可与铁矿表面产生化学吸附,使其表面负电位增强和表面亲水性得到改善,有利于改善铁精矿成球性;另外,有机复合膨润土同时具有有机物和无机层状硅酸盐的特点,其热稳定性和高温粘结力均优于常规膨润土,改善了球团焙烧性能.     

An Index mechanism for multi-scale view in spatial databases

There are numerous geometric objects stored in the spatial databases. An importance function in a spatial database is that users can browse the geometric objects as a map efficiently. Thus the spatial database should display te geometric objects users concern about swiftly onto the display window. This process includes two operations：retrieve data from database and then draw them onto screen. Accordingly,to improve the efficiency,we should try to reduce time of both retrieving object and displaying them. The former can be achieved with the aid of spatial index such as R-tree,the latter require to simplify the objects. Simplification means that objects are shown with sufficient but not with unnecessary detail which depend on the scale of browse. So the major problem is how to retrieve data at different detail level efficiently. This paper intrrduces the implementation of a multi-scale index in the spatial database SISP (Spatial Information Shared Platform ) which is generalized from R-tree. The difference between the generalization and the R-tree lies on two facets ： One is that every node and geometric object in the generalization is assigne+ with a importance value which +enote the importance of them,and every vertex in the objects are assigned with a importance value,too. The importance value can be use to decide which data should be retrieve from disk in a query. The other difference is that geometric objects in the generalization are divided into one or more sub-blocks,and vertexes are total ortiered by their importance value. With the help of the generalized R-tree,one can easily rtrieve data at differnt detail levels. Some experiments are performed on real-life data to evaluate the performance of solutions that separately use normal spatial index and multi-scale spatial index. The results show that the solution using multi-scale index in SISP is satisfying.     

An Index mechanism for multi-scale view in spatial databases

There are numerous geometric objects stored in the spatial databases. An importance function in a spatial database is that users can browse the geometric objects as a map efficiently. Thus the spatial database should display the geometric objects users concern about swiftly onto the display window. This process includes two operations: retrieve data from database and then draw them onto screen. Accordingly, to improve the efficiency, we should try to reduce time of both retrieving object and displaying them. The former can be achieved with the aid of spatial index such as R-tree, the latter require to simplify the objects. Simplification means that objects are shown with sufficient but not with unnecessary detail which depend on the scale of browse. So the major problem is how to retrieve data at different detail level efficiently. This paper introduces the implementation of a multi-scale index in the spatial database SISP (Spatial Information Shared Platform) which is generalized from R-tree. The difference between the generalization and the R-tree lies on two facets: One is that every node and geometric object in the generalization is assigned with a importance value which denote the importance of them, and every vertex in the objects are assigned with a importance value, too. The importance value can be use to decide which data should be retrieve from disk in a query. The other difference is that geometric objects in the generalization are divided into one or more sub-blocks, and vertexes are total ordered by their importance value. With the help of the generalized R-tree, one can easily retrieve data at different detail levels. Some experiments are performed on real-life data to evaluate the performance of solutions that separately use normal spatial index and multi-scale spatial index. The results show that the solution using multi-scale index in SISP is satisfying.     

An Index mechanism for multi-scale view in spatial databases

There are numerous geometric objects stored in the spatial databases. An importance function in a spatial database is that users can browse the geometric objects as a map efficiently. Thus the spatial database should display the geometric objects users concern about swiftly onto the display window. This process includes two operations:retrieve data from database and then draw them onto screen. Accordingly, to improve the efficiency, we should try to reduce time of both retrieving object and displaying them. The former can be achieved with the aid of spatial index such as R-tree, the latter require to simplify the objects. Simplification means that objects are shown with sufficient but not with unnecessary detail which depend on the scale of browse. So the major problem is how to retrieve data at different detail level efficiently. This paper introduces the implementation of a multi-scale index in the spatial database SISP (Spatial Information Shared Platform) which is generalized from R-tree. The difference between the generalization and the R-tree lies on two facets: One is that every node and geometric object in the generalization is assigned with a importance value which denote the importance of them, and every vertex in the objects are assigned with a importance value,too. The importance value can be use to decide which data should be retrieve from disk in a query. The other difference is that geometric objects in the generalization are divided into one or more sub-blocks, and vertexes are total ordered by their importance value. With the help of the generalized R-tree, one can easily retrieve data at different detail levels.Some experiments are performed on real-life data to evaluate the performance of solutions that separately use normal spatial index and multi-scale spatial index. The results show that the solution using multi-scale index in SISP is satisfying.     

国企财务运行机制设计的因素分析

摘要：现行国有企业的财务运行机制已不适应新形势下企业发展的需要。因此，必须结合企业生存的内外环境构建新型的财务运行机制。本文从体制、法制、市场等因素入手分析了构建新型财务运行机制的外部环境，并提出应从构建有效的资金管理机制、设置新型财务管理机构、提高财务人员专业及综合素质等方面完善财务运行机制的内部环境。     

基于本体的电力系统异构数据查询机制

随着电力企业信息化进程的不断推进,大量信息管理系统被应用于各种业务中,造成这些系统间存在异构数据,难以共享,甚至还存在各种语义冲突,影响数据的挖掘和分析.为此,提出了一种利用本体技术对电力企业内部的异构数据源进行融合的综合查询机制,可以有效解决电力企业内部数据源的语法和语义异构问题,把来自于各部门的多个数据源进行整合,为数据分析系统提供统一的数据查询接口.实验表明,该机制能够有效消解异构数据源之间的语义冲突,为数据集成提供基础.     

An Useful Communication Mechanism for Distributed Agents-Based Intrusion Detection System

The communication mechanism plays an important role in an intrusion detection system, while it has not been paid enough attention. Based on analyzing the actual facts and expatiating upon the requirements a communication mechanism needs to meet, a message driven communication mechanism is proposed in this paper. The protocol presented here is divided into three layers： entity level, host level, and network level. The communication processes are also designed in detail. Experiments illustrate that cooperative entities can detect distributed sophisticated attacks accurately. Furthermore, this mechanism has the advantages like high reliability, low time delay and expenses.     

An application of insurance mechanism in risk management for energy internet

As a completely new residential distribution infrastructure,energy internet facilitates transactions of equipment,energy and services. However,there is security risk under all the facilities.This paper proposes an electricity pricing model based on insurance from the perspective of maximizing the benefits of Energy Internet service providers by using the principal-agent theory. The consumer prepays the provider insurance premiums and signs a contract. The provider sets electricity price according to the premiums and therefore provides differentiated electric services for the consumer. Loss suffered by the consumer due to the power failure is compensated by the provider according to the contract. The equivalent model is presented and a necessary condition of the optimal strategy is obtained on the basis of Pontryagin's maximum principle. At last,a numerical example is presented,which illustrates the effectiveness of the proposed model.     

基于果蝇优化算法数据中心网络节能路由机制

提出一种面向通用拓扑、基于果蝇优化算法的动态路由机制来提高数据中心网络的能效.首先,推导出数据中心网络能效模型;然后,设计基于果蝇优化算法的节能路由机制,该机制通过模拟果蝇觅食过程中不断调整优化方向和位置来进行寻路策略,提出决定下一条节点的启发式,最终获得最佳节能路由;在此基础上,提出基于果蝇优化的节能路由算法实现该路由机制;最后,通过仿真实验验证算法的有效性,实验证明本文算法在提高能效的同时,网络性能优于现有算法.     

An unprecedented nucleic acid capture mechanism for excision of DNA damage

DNA glycosylases that remove alkylated and deaminated purine nucleobases are essential DNA repair enzymes that protect the genome, and at the same time confound cancer alkylation therapy, by excising cytotoxic N3-methyladenine bases formed by DNA-targeting anticancer compounds. The basis for glycosylase specificity towards N3- and N7-alkylpurines is believed to result from intrinsic instability of the modified bases and not from direct enzyme functional group chemistry. Here we present crystal structures of the recently discovered Bacillus cereus AlkD glycosylase in complex with DNAs containing alkylated, mismatched and abasic nucleotides. Unlike other glycosylases, AlkD captures the extrahelical lesion in a solvent-exposed orientation, providing an illustration for how hydrolysis of N3- and N7-alkylated bases may be facilitated by increased lifetime out of the DNA helix. The structures and supporting biochemical analysis of base flipping and catalysis reveal how the HEAT repeats of AlkD distort the DNA backbone to detect non-Watson-Crick base pairs without duplex intercalation.     

一种改进的WSN拥塞检测和控制机制

提出了WSN中基于多路径转发的拥塞检测和控制算法.拥塞检测算法是在原有算法的基础上进行了改进,并根据队列长度来判断是否出现了拥塞,拥塞控制是由每个源节点维持的预期数据包加载速率进行控制.仿真实验结果表明,本文给出的拥塞检测和控制算法在队列、吞吐量、数据包转发率等方面具有较好的网络性能.     

Effect: An operational view mechanism for decentralized information flow control

Flume, which implements decentralized information flow control (DIFC), allows a high security level process to "pre-create" secret files in a low security level directory. However, the pre-create mechanism makes some normal system calls unavailable, and moreover, it needs priori knowledge to create a large quantity of objects, which is difficult to estimate in practical operating systems. In this paper, we present an extended Flume file access control mechanism, named Effect, to substitute the mechanism of pre-create, which permits write operations (create, delete, and rename a file) on directories and creates a file access virtual layer that allocates operational views for each process with noninterference properties. In the end, we further present an analysis on the security of Effect. Our work makes it easier for multi-user to share confidential information in decentralized information flow control systems.     

一种铝棒自动卸料装置的设计

设计了一种铝棒自动卸料装置,该装置由夹紧部分、升降部分、走位部分、支撑部分和控制部分组成.机构采用液压驱动,螺旋传动移位,螺母位移与活塞微动相配合夹紧,可以同时夹持多根铝棒.工作过程全部由计算机自动控制,具有工作平稳,夹紧可靠,生产率高等优点,适应于圆棒卸料装箱.     

一种改进的GPGP协调机制

以TAEMS为描述框架,通过引入角色关系分析和激励/惩罚机制对GPGP(Generalizing the Partial Global Planning)进行改进．改进后的GPGP协调机制不仅适用于合作团队的活动规划,还可以处理自私Agent之间的协调关系,从而扩展了GPGP协调机制的适用范围,使得Agent处理任务请求的方法更加灵活．     

铁磁钢材应力致磁各向异性定量检测特性研究

为研究铁磁材料的应力致磁各向异性的物理表现及其对应力的定量检测特性,搭建了交流磁化/检测实验装置.在单向加载条件下,对铁磁Q195平板试件施加了不同程度的弹性应力.并在保持每个弹性应力方向及大小不变前提下,施加了不同方向的不饱和交流外磁场,检测了其交流磁化曲线.通过对实验数据的频谱分析、磁滞回线的获取及磁特征参数的提取,分析和讨论了铁磁材料应力致磁各向异性定量特性、磁各向异性特征参数与应力的定量关系.研究结果表明:应力导致了铁磁Q195钢材表现出了磁各向异性特性;应力致磁各向异性磁特征参数随着应力增大而近似于线性增大,可以通过提取对应的参数进而求取对应的应力.研究结果对系统探究铁磁材料的应力致磁各向异性定量特性具有一定参考价值.     

氯诺昔康在神经外科术后静脉自控镇痛中的应用

目的:观察经额部、颞部入路的神经外科病人术后的疼痛情况以及氯诺昔康用于此类神经外科病人术后静脉自控镇痛的临床效果.方法:36例择期经额部、颞部入路的神经外科手术病人,随机分为二组:氯诺昔康组(L组)镇痛药物为氯诺昔康每mL0.8 mg;对照组(N组)术后当病人主诉疼痛明显,难以忍受时予口服颅痛定30mg.记录各组病人术前及术后4、16、24、48 h的心率、平均动脉压、呼吸频率、脉搏氧饱和度及瞳孔变化.记录各组病人术后4、16、24及48 h的疼痛模拟评分(VAS)、Ramsay镇静评分及术后的凝血指标和术后发生恶心呕吐的情况.结果:L组病人的心率、平均动脉压术前与术后各时段点比较无显著差异(P＞0.05);N组病人术后4 h的心率、平均动脉压较术前显著增加,差异有统计学意义(P＜0.05).两组病人均未出现明显的呼吸抑制,Ramsay镇静评分均不超过3分,在术后各时段点差异均无统计学意义(P＞0.05).术后4、16 h L组VAS评分均显著低于N组(P＜0.05),术后24、48 h二组VAS评分差异无显著性(P＞0.05).未镇痛组的病人在术后24 h内有10例需要使用颅痛定.两组病人术前术后血浆凝血酶原时间(PT)、活化部分凝血活酶时间(APTT)均在正常值范围内.L组和N组病人均有不同程度的恶心呕吐情况出现,各组的呕吐发生率均为33.33%.结论:经额、颞部入路的神经外科病人手术后存在术后疼痛,且大多发生在术后第1 d.氯诺昔康能为其提供良好的术后镇痛疗效,术后镇痛中无明显的呼吸抑制、镇静及凝血指标异常等不良反应.     

一种天线同步自动折展装置设计与分析

针对硬对数周期天线的自动折展问题,提出一种天线同步自动折展装置,并进行相关设计与分析。该装置主要通过转轴、转盘、拉绳的传动,使旋转架带动天线振子转动,以实现各天线振子的收拢或展开;考虑到各天线阵子的同步收展,增设保护装置。通过对装置的受力和误差分析,结果表明在模拟风载作用下不会影响硬对数周期天线的精度。研究内容为实现天线收展过程的自动化,各天线振子的同步收拢,且高效、准确的收展提供了可行性方案。