基于RSA的电子商务信息加密技术研究

21世纪是网络信息时代,电子商务的迅猛发展和普及打破了人们传统的经营和消费理念,网上消费已成为一种新的消费形式,但随之而来的便是电子商务赖以生存和发展的安全问题。文章主要通过对电子商务安全隐患的分析,论证了数据加密技术在电子商务安全中的作用,重点探讨了RSA公钥加密算法,并通过实例对其加密原理、计算复杂性等安全性问题作了详尽的分析和阐述。     

改进离散人工蜂群算法规划异形满版服饰图案切割路径

服饰图案切割路径规划是服饰图案自动切割技术的关键部分之一。文中用改进的离散人工蜂群算法实现了激 光切割系统对异形满版服饰图案的切割工艺路径规划优化。首先,把满版服饰图案激光切割路径规划转化为广义旅行 商问题求解,证明了路径规划转化成普通TSP问题比转化成第一类广义TSP问题更为有效,并给出了路径规划中“图案 始切割点”的优化选择方法。然后结合部分匹配交叉和启发式变异搜索方法的人工蜂群算法求解TSP问题,证明了与 A*算法及遗传算法相比,该方法更为优越。并且该方法已应用于激光切割机切割异形满版服饰图案路径规划的生产实 践,运行可靠,比未规划时的工艺路线平均提高效率33.7%。该方法提供了一种解决TSP问题的新方法,具有一定的理 论意义和价值     

Cu-Ce(La)OX变换催化剂的制备和性能考察

本文对采用共沉淀法制备的Cu-Ce(La)Ox高温变换催化剂进行了研究．首先研究了中和pH值、中和温度、焙烧温度和方式对催化剂性能的影响，其次研究了CuO、CeO2和LaOx含量对催化剂性能的影响．5％CuO-CeO2-La(10％)Ox高温变换催化剂的最佳制备工艺条件为pH=11，中和温度为54℃，400C焙烧4h．催化剂的最佳配比组成为：CuO为20％、CeO2 70％、LaOx 10％．XRD晶相分析表明，5％Cu-Ce-La(10％)Ox催化剂中除了主相CeO2以外，还出现了Cu与La形成的钙钛矿型复合氧化物CuLaO2，且CuLaO2高度均匀地分散在主相CeOx中．还原态中除了CeO2、CuLaO2外，还出现了Cu单质，因此这类催化剂的活性中心不可能是简单的CuLaO2或Cu，从而使催化剂无论氧化态还是还原态都具有基本相同的活性，其活性位形态结构需要进一步研究．     

行政中心区位、迁移与城市商圈空间分布——基于动态模糊算法仿真和经验数据的研究

我国城市发展的实践揭示,绝大多数城市的行政中心所在区域不仅是政治中心,也是商业中心;行政中心迁移往往带来迁入地零售商业的爆发式增长,行政中心 区位和迁移与城市商圈空间分布之间有着显著关联.文章通过动态模糊算法仿真分析发现:行政中心对其空间所在区域的商圈发展有积极的正向影响;行政中心空间区位迁移与城市商圈空间结构演化存在显著的空间耦合互动,即迁入区域的商圈发展将显著加速,特别是区域内新商圈成形将明显加速,对迁出区域商圈的影响则相对不明显;城市商圈空间分布发展显著变化.最后,以长沙市的经验数据验证了仿真模型的可靠性.     

Proof of Toft's Conjecture: Every Graph Containing No Fully Odd K4 is 3-Colorable

A fully odd K₄ is a subdivision of K₄ such that each of the six edges of the K₄ is subdivided into a path of odd length. In 1974, Toft conjectured that every graph containing no fully odd K₄ can be vertex-colored with three colors. The purpose of this paper is to prove Toft's conjecture.     

周作人的“纯文学”观与中国文化传统

深邃、悠远、繁复的儒、道、释合力构筑的中国文化传统成为周作人“纯文学”观复杂、深厚的文化渊源。而且,正是以之为基础而形成的这一脉非主流文论的涌现,从一个特定的层面形成了中国现当代文艺理论富有张力的全景画卷。虽然我们无法支离、抽取中国文化传统中的任何单一的成分,但是儒与道、释在周作人“纯文学”观不同层面所发生的影响成为显在的事实。具体体现在:周作人“纯文学”观中“载道”和“言志”的并蓄拓延着儒家折中调和的思维方式;求乐与求美的统一内蕴着道家的生命情调;苦涩与平和的融会体现着释家人生价值观。     

Inference and optimal design of multiple constant-stress testing for generalized half-normal distribution under type-II progressive censoring

The generalized half-normal (GHN) distribution and progressive type-II censoring are considered in this article for studying some statistical inferences of constant-stress accelerated life testing. The EM algorithm is considered to calculate the maximum likelihood estimates. Fisher information matrix is formed depending on the missing information law and it is utilized for structuring the asymptomatic confidence intervals. Further, interval estimation is discussed through bootstrap intervals. The Tierney and Kadane method, importance sampling procedure and Metropolis-Hastings algorithm are utilized to compute Bayesian estimates. Furthermore, predictive estimates for censored data and the related prediction intervals are obtained. We consider three optimality criteria to find out the optimal stress level. A real data set is used to illustrate the importance of GHN distribution as an alternative lifetime model for well-known distributions. Finally, a simulation study is provided with discussion.     

有顾客时间窗和发货量变化的车辆调度干扰管理研究

为解决由顾客需求变化引发的物流配送干扰问题,提出基于干扰管理思想构建扰动恢复策略和方案.应用虚拟多车场实现车辆调度扰动恢复问题转化.提出车辆调度扰动恢复策略和扰动度量方法,以作为车辆调度干扰管理建模的基础;分析顾客时间窗和发货量变化造成的扰动并进行辨识.建立相应的干扰管理模型,提出归一化处理办法对VRPTW、MD-VRPTW和MDVRPTW干扰管理问题进行有效兼容;结合干扰管理模型的特点,改进基于顾客的编码表示方法,可以反映出车辆调度扰动恢复策略;根据干扰管理思想,设计遗传算法对干扰管理模型进行求解.给出了一个具有代表性的算例试验结果,算例结果及其分析表明干扰管理模型和遗传算法的有效性.     

Online scheduling on parallel machines with two GoS levels

This paper investigates the online scheduling problem on parallel and identical machines with a new feature that service requests from various customers are entitled to many different grade of service (GoS) levels. Hence each job and machine are labeled with the GoS levels, and each job can be processed by a particular machine only when the GoS level of the job is not less than that of the machine. The goal is to minimize the makespan. In this paper, we consider the problem with two GoS levels. It assumes that the GoS levels of the first k machines and the last m−k machines are 1 and 2, respectively. And every job has a GoS level of 1 alternatively or 2. We first prove the lower bound of the problem under consideration is at least 2. Then we discuss the performance of algorithm AW presented in Azar et al. (J. Algorithms 18:221–237, 1995) for the problem and show it has a tight bound of 4−1/m. Finally, we present an approximation algorithm with competitive ratio . Research supported by Natural Science Foundation of Zhejiang Province (Y605316) and its preliminary version appeared in Proceedings of AAIM2006, LNCS, 4041, 11-21.     

Sublinear time width-bounded separators and their application to the protein side-chain packing problem

Given d>2 and a set of n grid points Q in ℜ ^d , we design a randomized algorithm that finds a w-wide separator, which is determined by a hyper-plane, in sublinear time such that Q has at most points on either side of the hyper-plane, and at most points within distance to the hyper-plane, where c _d is a constant for fixed d. In particular, c ₃=1.209. To our best knowledge, this is the first sublinear time algorithm for finding geometric separators. Our 3D separator is applied to derive an algorithm for the protein side-chain packing problem, which improves and simplifies the previous algorithm of Xu (Research in computational molecular biology, 9th annual international conference, pp. 408–422, 2005). This research is supported by Louisiana Board of Regents fund under contract number LEQSF(2004-07)-RD-A-35. The part of this research was done while Bin Fu was associated with the Department of Computer Science, University of New Orleans, LA 70148, USA and the Research Institute for Children, 200 Henry Clay Avenue, New Orleans, LA 70118, USA.