方锥形件成形模设计

介绍了一种方锥形件的成形工艺,模具利用零件本身的特点,没有采用导向装置,而是通过巧妙的设计,简化了模具结构,将切边、冲孔设计成复合模,通过2次切边、1次冲孔满足了产品质量要求。     

板件拼装焊接线底层控制系统快速再设计研究

以板件拼装焊接线底层控制系统为研究对象,对如何实现焊接线底层控制系统随着焊接线的重构而快速再设计进行了研究。提出了模块化选择与裁剪的快速再设计策略,同时结合焊接线底层控制系统的特点以及PROFIBUS-DP多主站的特点与优势,设计了基于模块化选择与裁剪策略的多主站底层控制系统快速再设计方案,然后分别从工作站级与系统级的角度对底层控制系统的硬件与软件进行了快速再设计研究,最终实现了板件拼装焊接线底层控制系统的快速再设计。     

A destination-based approach for cut detection in wireless sensor networks

Wireless sensor networks often suffer from disrupted connectivity caused by its numerous aspects such as limited battery power of a node and unattended operation vulnerable to hostile tampering. The disruption of connectivity, often referred to as network cut, leads to ill-informed routing decisions, data loss and waste of energy. A number of protocols have been proposed to efficiently detect network cuts; they focus solely on a cut that disconnects nodes from the base station. However, a cut detection scheme is truly useful when a cut is defined with respect to multiple destinations (i.e. target nodes), rather than a single base station. Thus, we extend the existing notion of cut detection, and propose an algorithm that enables sensor nodes to autonomously monitor the connectivity to multiple target nodes. We introduce a novel reactive cut detection solution, the point-to-point cut detection, where given any pair of source and destination, a source is able to locally determine whether the destination is reachable or not. Furthermore, we propose a lightweight proactive cut detection algorithm specifically designed for a network scenario with a small set of target destinations. We prove the effectiveness of the proposed algorithms through extensive simulations; specifically, in our network configurations, proposed cut detection algorithms achieve more than an order of magnitude improvement in energy consumption, when coupled with an underlying routing protocol.     

网络可靠性分析方法研究

总结了进行网络可靠性分析的一般步骤,比较了传统的网络分析方法的优缺点,重点论述了一种基于有序二叉决策图的方法,在考虑失效节点的网络可靠性分析中的应用。     

Accurate evaluation of Green’s functions in a layered medium by SDP-FLAM

Based on local Taylor expansions on the complex plane, a method for fast locating all modes (FLAM) of spectral-domain Green’s Functions in a planar layered medium is developed in this paper. SDP-FLAM, a combination of FLAM with the steepest descent path algorithm (SDP), is employed to accurately evaluate the spatial-domain Green’s functions in a layered medium. According to the theory of complex analysis, the relationship among the poles, branch points and Riemann sheets is also analyzed rigorously. To inverse the Green’s functions from spectral to spatial domain, SDP-FLAM method and discrete complex image method (DCIM) are applied to the non-near field region and the near filed region, respectively. The significant advantage of SDP-FLAM lies in its capability of calculating Green’s functions in a layered medium of moderate thickness with loss or without loss. Some numerical examples are presented to validate SDP-FLAM method. Supported by the National Natural Science Foundation of China (Grant No. 60621002), and the State Key Development Program for Basic Research of China (Grant No. 2009CB320200)     

面向数据分析的中文问句句法研究

本文以面向数据分析为基本思想,同时结合相似度概率评估技术,实现中文问句句法分析。对于输入问句,首先需要经过词汇层与词性层以及句型和疑问词初选得到片段;然后,基于已构建的数据库,对词汇词性序列的子序列搜索片段,进行片段组合;最后,对输入语句与初选结果进行相似性评估,完成输入语句的组合分析过程。为论证方法有效性,基于200句山西旅游问句做实验。实验结果表明,句法分析的准确率达到96%。     

计算机图形学的基本算法实现研究

该文对计算机图形学中多边形剪裁和逐点生成的基础算法进行比较和研究,对于提高计算机图形系统的性能具有很大的帮助,具有很强的理论和现实意义。     

基于保特征调和场的交互式网格分片

网格模型分片在计算机图形学应用中具有重要意义,本文提出了一种基于网格上的调和场和图割技术的网格模型分片算法.用户可以通过划线的方式来指定网格上感兴趣的区域;算法自动构建反映该区域细节特征的调和场,进而采用图割技术,得到满足用户要求的分片结果;通过对网格分割边界的光滑处理,可有效改善锯齿型分割边界.实验结果表明,我们的算法对于特征单一或复杂的网格模型都能得到符合用户意图的分割结果.     

A new scaling algorithm for the maximum mean cut problem

We present a new scaling algorithm for the maximum mean cut problem. The mean of a cut is defined by the cut capacity divided by the number of arcs crossing the cut. The algorithm uses an approximate binary search and solves the circulation feasibility problem with relaxed capacity bounds. The maximum mean cut problem has recently been studied as a dual analogue of the minimum mean cycle problem in the framework of the minimum cost flow problem by Ervolina and McCormick. A networkN=(G, lower, upper) with lower and upper arc capacities is said to be -feasible ifN has a feasible circulation when we relax the capacity bounds by ; that is, we use (lower(a)- , upper(a)+) bounds instead of (lower(a), upper(a)) bounds for each arca A. During an approximate binary search we maintain two bounds,LB andUB, such thatN is LB-infeasible andUB-feasible, and we reduce the interval size (LB, UB) by at least one-third at each iteration. For a graph withn vertices, m arcs, and integer capacities bounded byU, the running time of this algorithm is O(mn log(nU). This time bound is better than the time achieved by McCormick and Ervolina under thesimilarity condition (that is,U=O(n^o(1))). Our algorithm can be naturally used for the circulation feasibility problem, and thus provides a new scaling algorithm for the minimum cut problem.Research supported by a grant-in-aid of the Ministry of Education, Science and Culture of Japan.