Context-free grammars to detect straight segments and a novel polygonal approximation method

A new method for the polygonal approximation is presented. The method is based on the search for break points through a context-free grammar, that accepts digital straight segments with loss of information, as well as the decrease in the error committed employing the comparison of a tolerable error. We present an application of our method to different sets of objects widely used, as well as a comparison of our results with the best results reported in the literature, proving that our method achieves better values of error criteria. Besides, a new way to find polygonal approximations, with context-free grammars to recognize digital straight segments without loss of pixels, it is also addressed.     

黄河黑山峡河段大柳树水库比小观音水库原始库容多40亿m3的作用

一级开发大柳树高坝原始库容比二级开发小观音高坝多 4 0亿m3 ,库容大带来的好处体现在 5～ 7月可多向下游增供水量 ,缓解下游河道断流 ;延长泄放清水时间 ;增加发电效益 ;满足宁蒙河段防凌要求 ;增加汛期集中泄水 ,减缓下游河道淤积萎缩 ;满足南水北调西线工程水量调节要求等。为了更好优化配置黄河水资源 ,从全局和长远利益考虑 ,应采用一级开发方案 ,修建大柳树高坝大库     

Synthesis and characterization of zeolite NaY from rice husk silica

Rice husk silica (RHS) in amorphous phase with 98% purity was prepared from a waste rice husk from rice milling by leaching with hydrochloric acid and calcination. The RHS was used effectively as a silica source for the synthesis of zeolite Y in sodium form (NaY). The zeolite in pure phase was obtained from a two-step synthetic route in which the starting gels were mixed, aged for 24 h at room temperature and crystallized for 24 h at 90 °C. The diameter of single crystal particles from a scanning electron microscope was approximately 1.0 μm, whereas the average particle diameter from laser diffraction particle size analyzer was approximately 10 μm because of the agglomeration of small crystals. Longer crystallization time in this route resulted in a mixed phase containing NaY and zeolite P in sodium form (NaP). In addition, a one-step synthetic route (no aging) was studied and the product was also a mixed phase zeolite.     

Sub-optimal solutions to track detection problem using graph theoretic concepts

This paper demonstrates how the problem of tracking targets, which appear as either straight or curved lines in two-dimensional display images (or data images) can be formulated in terms of a directed weighted graph model and how dynamic programming techniques can be efficiently applied to reach an optimal or sub-optimal solution. In general, track detection algorithms providing optimal solutions have good detective ability, but most of them suffer from the inability to detect discontinuous lines or to resolve efficiently pairs of crossing lines. A sub-optimal solution is provided that efficiently overcomes these weaknesses. We focus on modeling the track detection problem in terms of a graph, formulating fast sequential/parallel sub-optimal track detection algorithms and testing them on simulated data in order to show their detective ability. Moreover, we specify the conditions under which sub-optimal algorithms can perform at least as well as their corresponding optimal algorithms. This is significant for the track detection problem where fast, accurate and real-time detection is considered a necessity.     

南水北调中线总干渠水头优化分配

南水北调中线总干渠渠道线路长,建筑物数量大、类型多,进行水头优化分配对于节省工程投资,合理的进行总干渠工程布置有着重要的意义.通过优化计算,提出了总干渠水头优化分配方案,确定了3个渠段之间的水头分配值以及各段内分段渠道和各个建筑物的水头分配值,并对方案进行了验证.     

一种无人机生成平滑航迹方法的研究与实现

无人机在未来战场中占有重要地位,航迹规划直接影响其作战能力。针对无人机航迹规划算法中存在的问题,提出一种生成平滑航迹的方法。该方法解决了直角拐弯、航迹不平滑、规划航迹与实际航迹不一致的问题。最后,通过VC++6.0+mapX5.0编程实现,结果表明了该方法的优势。     

南水北调中线总干渠水质变化趋势及污染源分析

为了解和掌握南水北调中线总干渠水质状况,依据总干渠26个常规水质断面监测数据,分析了总干渠沿程水质变化趋势。结果表明,主要污染指标(CODMn、氨氮、总氮和总磷)呈现出沿程增加趋势。根据影响总干渠水质的潜在影响因素,分析了7类污染源(直接水污染、大气粉尘沉降、桥面雨水污染、底泥污染、周边垃圾场淋溶液污染、雨洪污染、受污染地下水)及其可能对干渠水质产生的影响程度,并针对不同污染源提出了防控对策,供管理部门决策参考。     

北京市南水北调中线工程供水效益评估

采用分摊系数法、开采损失法、影子价格法以及替代工程法,计算了南水北调中线工程向北京供水的效益。计算结果表明:南水北调中线工程通水后所产生的供水效益为311.76亿元,其中经济效益为295.75亿元,生态环境效益为16.01亿元;同时,该工程投入运行以后,还发挥了显著的社会效益。计算研究结果可为相关部门制定调水方案以及实施水资源优化管理提供有益的参考。     

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.     

基于量子克隆的二面体群隐含子群问题量子算法的研究

基于最短向量问题的格公钥密码体制是典型的抗量子计算密码体制。格的唯一最短向量问题可转化为二面体群的隐含子群问题。有效地求解二面体群的隐含子群问题可攻破基于格的唯一最短向量问题的公钥密码体制。Kuperberg提出了二面体群隐含子群问题的半指数级量子算法。通过研究Kuperberg量子算法,利用概率量子克隆,文中提出了二面体群隐含子群问题的多项式时间量子算法。