概念格的分层及逐层建格法

给出了分层概念格重要性质:同层概念不可比和每个概念至少被1个上层的概念覆盖.得到了概念格上的对象映射和属性映射的一般计算公式和在对象化简过程中格结构不变的定理.由上述性质和定理,给出建格算法.此方法以概念格分层为基础,逐层建格.因为在建每层格的节点的过程中同时进行筛选,所以不会生成冗余重复的格节点.     

The RSA Cryptoprocessor Hardware Implementation Based on Modified Montgomery Algorithm

RSA (Rivest-Shamir-Adleman)public-key cryptosystem is widely used in the information security area such as encryption and digital signature. Based on the modified Montgomery modular multiplication algorithm, a new architecture using CSA(carry save adder)was presented to implement modular multiplication. Compared with the popular modular multiplication algorithms using two CSA, the presented algorithm uses only one CSA, so it can improve the time efficiency of RSA eryptoproeessor and save about half of hardware resources for modular multiplication. With the increase of encryption data size n, the clock cycles for the encryption procedure reduce in T(n^2), compared with the modular multiplication algorithms using two CSA.     

EFFECTS OF ANTISENSE OLIGODEOXYNUCLEOTIDES ON EXPRESSION OF CASPASE-3 IN Γ-RADIATION INDUCED APOPTOTIC HL-60 CELLS

Objective To study the inhibitory effects of caspase-3 mRNA antisense oligodeoxynucleotides (ASODN) on expressions of caspase-3 and it's mRNA in γ-radiation induced apoptotic HL-60 cells, and screen the effective ASODN. Methods ASODN-1 and ASODN-2 targeting 5′-noncoding region and initial translation region of caspase-3 mRNA were respectively designed, synthesized and introduced into HL-60 cells by means of liposome-mediated transfection followed by 10Gy γ-radiation exposures. TUNEL assay was conducted to investigate the morphologic change and apoptotic percentage of HL-60 cells 18 h later. Immunocytochemical staining and one step RT-PCR were respectively performed to detect the expressions of caspase-3 and it's mRNA. Mismatched oligodeoxynucleotide (MODN) transfected and un-transfected HL-60 cells were taken as control. Results TUNEL assay found that the apoptotic percentages in ASODN-1 and ASODN-2 groups were significantly reduced compared with the control groups (P<0.01) when the final concentration of both ASODNs was ≥3μmol/L. Immunocytochemistry showed that caspase-3 positive cell percentages were reduced but the average gray values increased significantly compared with the control groups (P<0.01). RT-PCR showed expressions of caspase-3 mRNA was decreased after ASODN transfection. Furthermore, ASODN-1 proved more effective in inhibiting HL-60 cell apoptosis than ASODN-2 (P<0.01). Conclusion Caspase-3 mRNA ASODNs can prevent HL-60 cells from apoptosis induced by γ-radiation and reduce expression of caspase-3 and its mRNA. These effects are dose dependent in a certain range.     

社区儿童接送服务车辆的线路优化

以社区儿童接送服务车辆的路线优化问题为研究对象,建立了多目标非线性整数规划模型,其中目标函数包括车辆数最少、车辆行驶的时间最短、所有乘客总旅行时间最短、各辆车的负荷均衡、各辆车的运行时间均衡5个目标.这5个目标分为4个优先级.提出了解决这类问题的新的启发式优化算法.该算法从构造最小生成树开始,找出基本线路;然后通过选择可调单元调整线路得到优化的线路.提出了线路确定后,乘客要求调整线路时应遵循的原则.     

区段管内车流组织研究

根据区段管内列车的运行过程和车流产生情况,分析列车的各种车小时消耗,在着重考虑集结完成的车流在站等待挂车车小时消耗的前提下,推导出相应的计算公式。建立以总车小时消耗最少为目标的优化模型,并利用分层求解算法对模型进行求解,进而求得总车小时消耗最少的运输组织方案。     

遗传算法在车辆路径问题中的优化

关于遗传算法的车辆路径优化问题,已经提出过多种思想方法,虽然有些也有实验结果,但仍大有改进余地。针对具体的车辆路径优化问题,对传统遗传算法作了多处关键性改进。针对多客户点基本均布于物流中心的特点,作初始群优化,降低交叉率,提高变异率,简化繁琐的染色体修正计算,极大地提高了寻优速度,减少了遗传操作的数量,为多计算点的遗传操作提供有力的支持。     

基于代沟信息的可变种群规模遗传算法

针对遗传算法种群规模难以估计的问题,提出了一种基于代沟信息的可变种群规模遗传算法。利用相邻几代群体间的极优解差异信息,在遗传算法发生早熟现象时根据逻辑斯蒂模型来改变种群规模,能以较小的计算代价获得与其它遗传算法性能相近的解。实验结果证明了算法的有效性。     

A Note on Shor’s Quantum Algorithm

Introduction Factoring integers is generally thought to behard on a classical computer. But it is now heldthat prime factorization can be accomplished inpolynomial time on a quantum computer. This re-markable work is due to Shor[1]. For a given num-ber n, he gave a quantum computer algorithm forfinding the order r of an element x (mod n) insteadof giving a quantum computer algorithm for factor-ing n directly. The indirect algorithm is feasiblebecause factorization can be reduced to finding th…     

Stability Study of Cable-Suspended Stewart Platform

The control stability of the end manipulator of a cable-suspended Stewart platform in disturbance was studied by combination of the multi-body system dynamics and control theory and the eigensystem realization algorithm (ERA). The corresponding closed-loop vibration control strategies were suggested based on position prediction with PD (proportional plus derivative) control.Numerical simulation was made on a scale model to study the vibration control effects of the stewart platform with flexible suspension, including system response to step load, system response to cyclic load, and instability. Then, experiments for Stewart platform with cable suspension were designed to study the actual control effects and validate the validity of numerical simulation. The results show that the experimental results agree with the simulation results well, and the the system has a fairly good control effect to the end manipulator. Therefore, a preliminary conclusion can be made that it is feasible using the Stewart platform as the vibration control platform of the flexible support system, by position prediction of the base platform and PD feedback control law.     

Network Decomposition and Maximum Independent Set Part Ⅱ：Application Research

According to the researches on theoretic basis in part I of the paper，the spanning tree algorithms solving the maximum independent set both in even network and in odd network have been developed in this part，part Ⅱ of the paper．The algorithms trans form first the general network into the pair sets network，and then decompose the pair sets network into a series of pair subsets by use of the characteristic of maximum flow passing through the pair sets network．As for the even network，the algorithm requires only one time of trans formation and decomposition，the maximum independent set can be gained without any iteration processes，and the time complexity of the algorithm is within the bound of O(｜V｜^3)．However，as for the odd network，the algorithm consists of two stages．In the first stage，the general odd network is transformed and decomposed into the pseudo-negative envelope graphs and generalized reverse pseudo-negative envelope graphs alternately distributed at first；then the algorithm turns to the second stage，searching for the negative envelope graphs within the pseudo-negative envelope graphs only．Each time as a negative envelope graphhas been found．renew the pair sets network by iteration at once．and then tum back to the first stage．So both stages form a circulation process up to the optimum．Two available methods，the adjusting search and the picking-off search are specially developed to deal with the problems resulted from the odd network．Both of them link up with each other harmoniously and are embedded together in the algorithm．Analysis and study indicate that the time complexity of this algorithm is within the bound of O(｜V｜^5)．