Counting maximal independent sets in directed path graphs

The problem of counting maximal independent sets is #P-complete for chordal graphs but solvable in polynomial time for its subclass of interval graphs. This work improves upon both of these results by showing that the problem remains #P-complete when restricted to directed path graphs but that a further restriction to rooted directed path graphs admits a polynomial time solution.     

Betweenness estimation in OLSR-based multi-hop networks for distributed filtering

In traditional networks special efforts are put to secure the perimeter with firewalls: particular routers that analyze and filter the traffic to separate zones with different levels of trust. In wireless multi-hop networks the perimeter is a concept extremely hard to identify, thus, it is much more effective to enforce control on the nodes that will route more traffic. But traffic filtering and traffic analysis are costly activities for the limited resources of mesh nodes, so a trade-off must be reached limiting the number of nodes that enforce them. This work shows how, using the OLSR protocol, the centrality of groups of nodes with reference to traffic can be estimated with high accuracy independently of the network topology or size. We also show how this approach greatly limits the impact of an attack to the network using a number of firewalls that is only a fraction of the available nodes.     

Tool path generation framework for accurate manufacture of complex 3D sheet metal parts using single point incremental forming

The prototyping of complex sheet metal parts using single point incremental forming (SPIF) requires the generation of optimal tool paths and/or tool path sequences that ensure that the formed part is within geometric design specifications. The presence of a multitude of features on complex parts leads to multiple inaccuracy inducing phenomena occurring simultaneously due to interactions between the features. This paper proposes a network analysis methodology using topological conceptual graphs to capture the effects of different phenomena on the final accuracy of a sheet metal part manufactured by SPIF. Using this framework optimized tool paths can be generated that compensate for the inaccuracy inducing behavior. Tool path generation algorithms to create partial tool paths that account for the accuracy of specific features in the part based on the proposed framework are also presented. Finally, the creation of integrated tool paths maintaining complementarity between tool paths and desired continuity behavior using non-uniform cubic B-splines is illustrated. A number of case studies demonstrating the applicability of the integrated framework are discussed, where the maximum deviations in the part are significantly reduced and the average absolute deviations for the complete part are brought down to less than 0.5 mm.     

杭州市城西地区洪水出路研究

杭州市城西地区地势低洼,上承山水,下受杭嘉湖平原河流水位顶托,为易受洪涝灾害地区。以抵挡2007年"罗莎"台风洪水为目标,根据城西地区水系分布、城市布局,初步提出了洪水外排、湿地调蓄、建圩挡水的排涝布局及10种洪水出路方案。对10个方案从水位、水量、工程投资、对周边地区影响、政策处理等方面进行比较,最终提出以建设西溪湿地至钱塘江的地下排水通道、西溪湿地内部调蓄、分区建圩的组合方案为推荐方案。经分析认为,推荐方案可有效减轻杭州市城西地区的洪涝问题。     

Adaptive tracking control of an autonomous underwater vehicle

This paper presents the trajectory tracking control of an autonomous underwater vehicle(AUV). To cope with parametric uncertainties owing to the hydrodynamic effect, an adaptive control law is developed for the AUV to track the desired trajectory. This desired state-dependent regressor matrix-based controller provides consistent results under hydrodynamic parametric uncertainties.Stability of the developed controller is verified using the Lyapunov s direct method. Numerical simulations are carried out to study the efficacy of the proposed adaptive controller.     

降低电石生产能耗的途径

介绍了新疆天业股份有限公司的下属子公司的25万t/a电石生产系统投运情况,对降低能耗、减轻操作人员的劳动强度、保证安全生产、提高产品质量与产量等,以及对原材料、工艺操作、设备等,都进行了分析。     

最短路径算法在校园导游系统中的应用

用无向网表示学校的平面图,设计了该平面图的存储结构,并应用最短路径算法实现了查询图中各景点的相关信息,以及查询图中任意两个景点间的最短路径的功能;应用克鲁斯卡尔算法构造该平面图的最小生成树,求出可以连通所有景点的最短路径。该系统为新生熟悉校园环境提供了方便。     

基于QPSO 算法移动机器人轨迹规划与实验

针对移动机器人路径规划问题,提出一种基于QPSO算法的路径规划方法,并用概率论的方法分析了移动机器人路径规划的收敛性,阐明了该方法随均匀分布和正态分布的参数关系和收敛区间;然后根据移动机器人的运动特征提出一种改进的轨迹规划方法。移动机器人平台的实验结果表明了该方法在移动机器人路径规划中的有效性和可行性。     

经孔板形成旋转流的管壳式换热器壳程传热及流阻的研究

对螺旋折流孔板管壳式换热器壳程的传热与流体阻力做了研究 ,给出换热器壳程传热与流阻的计算关联式 ,并采用实验模型对换热器壳程流体旋转流的阻力系数与传热管的局部传热系数做了测试 ,且对光滑和菱形翅片两种管型作了对比     

基于RDC-Q学习算法的移动机器人路径规划

传统Q算法对于机器人回报函数的定义较为宽泛,导致机器人的学习效率不高。为解决该问题,给出一种回报详细分类Q(RDC-Q)学习算法。综合机器人各个传感器的返回值,依据机器人距离障碍物的远近把机器人的状态划分为20个奖励状态和15个惩罚状态,对机器人每个时刻所获得的回报值按其状态的安全等级分类,使机器人趋向于安全等级更高的状态,从而帮助机器人更快更好地学习。通过在一个障碍物密集的环境中进行仿真实验,证明该算法收敛速度相对传统回报Q算法有明显提高。