图示评审技术中资金的时间价值的费用探析

在图示评审技术（ＧＥＲＴ）网络模型的基础上,考虑资金的时间价值,探析费用参数求解的两种方法：一是利用信号流图理论的方法,二是利用模拟技术的模拟解法．并用算例求解,另外,对三峡左岸机组安装施工费用进行了研究．     

Mutations in the ligand-binding domain of the kit receptor: an uncommon site in human piebaldism

Heterozygous mutations in the gene for the Kit transmembrane receptor have been identified recently in human piebaldism and mouse "dominant spotting." Interestingly, all of the 14 known missense mutations that cause depigmentation in these species map to the tyrosine kinase domain of the receptor, whereas none have involved the extracellular ligand-binding domain. In an attempt to detect these uncommon mutations, we screened the nine exons encoding the extracellular portion of Kit for single-strand conformation polymorphisms (SSCP) in eight piebald subjects previously reported to be negative for kinase mutations. Four of these eight kindreds proved to carry novel mutations. The first mutation, found in two apparently unrelated probands with mild piebaldism and English ancestry, substitutes an arginine for a highly conserved cysteine at codon 136. This substitution disrupts a putative disulfide bond required for formation of the second Ig-like (D2) loop of the Kit ligand-binding domain. The second mutation, detected in a piebald kindred characterized by unusually limited depigmentation, substitutes a threonine for an alanine at codon 178, a site just proximal to conserved cysteines at codons 183 and 186. The third mutation, occurring in a kindred with more extensive depigmentation, is a novel four-base insertion in exon 2 that results in a proximal frameshift and premature termination. The data strongly suggest that piebaldism can result from missense mutations in the Kit ligand-binding domain, although the resulting phenotype may be milder than that observed for null or kinase mutations. The apparent clustering of these uncommon mutations at or near the conserved cysteines for the D2 Ig-like loop further suggests a critical role for this region in Kit receptor function.     

机械设备虚拟维修样机在虚拟环境中的实时移动

传统虚拟维修训练系统开发平台暴露出实时性差、维修数据与维修效果不同步、调整费时费力等问题;为了弥补开发平台的不足,使其达到“所见即所得”的维修效果,利用Creator和Vega在虚拟环境中引入虚拟维修样机的装配树形图,并建立起维修样机与装配树形图之间的实时响应,解决了维修样机部件的实时移动以及维修数据的动态存储等关键问题,从而实现了虚拟维修样机在虚拟环境中的实时移动,达到了“所见即所得”的维修效果;实践证明,改进后的系统实时性和通用性明显加强,操作流程更加人性化,达到了预期效果.     

联合信源信道算术码研究

介绍联合信源信道算术码添加禁用符号的编码方法,以实例方式引入联合信源信道算术码的检错原理。综述联合信源信道算术码的检错时延分布、几何分布,分析各种解码方法、序列解码方法及其各种改进,研究基于有限状态机的解码方法与其他信道码构成的迭代式联合解码方法,并展望目前联合信源信道算术码研究存在的问题及其前景。     

Multi-view Superpixel Stereo in Urban Environments

Urban environments possess many regularities which can be efficiently exploited for 3D dense reconstruction from multiple widely separated views. We present an approach utilizing properties of piecewise planarity and restricted number of plane orientations to suppress reconstruction and matching ambiguities causing failures of standard dense stereo methods. We formulate the problem of the 3D reconstruction in MRF framework built on an image pre-segmented into superpixels. Using this representation, we propose novel photometric and superpixel boundary consistency terms explicitly derived from superpixels and show that they overcome many difficulties of standard pixel-based formulations and handle favorably problematic scenarios containing many repetitive structures and no or low textured regions. We demonstrate our approach on several wide-baseline scenes demonstrating superior performance compared to previously proposed methods.     

基于局部线性嵌入的最大散度矩阵算法

提出一种基于局部线性嵌入的最大散度矩阵算法——FSLLE。引入线性映射解决局部线性嵌入算法的样本外学习问题,通过自适应动态地确定局部线性空间邻域参数,最大化地融合样本数据的类别信息和局部结构信息矩阵,以获取髙维数据的最佳分类低维子空间。在JAFFE人脸表情库对该算法进行测试,结果表明,FSLLE算法能根据流形结构动态地确定局部邻域的大小,具有较好的表情识别率。     

Is Evolution Algorithmic?

In Darwin’s Dangerous Idea, Daniel Dennett claims that evolution is algorithmic. On Dennett’s analysis, evolutionary processes are trivially algorithmic because he assumes that all natural processes are algorithmic. I will argue that there are more robust ways to understand algorithmic processes that make the claim that evolution is algorithmic empirical and not conceptual. While laws of nature can be seen as compression algorithms of information about the world, it does not follow logically that they are implemented as algorithms by physical processes. For that to be true, the processes have to be part of computational systems. The basic difference between mere simulation and real computing is having proper causal structure. I will show what kind of requirements this poses for natural evolutionary processes if they are to be computational.     

命名数据网络中面向移动用户的内容预取方法*

针对命名数据网络(Named Data Networking, NDN)移动性增强支持不足的问题,基于城区移动场景提出了一种基于移动预测的内容预取方法(Mobility-aware Prediction Approach for Content Prefetching, MAP-CP)及扩展方案(extended MAP-CP, eMAP-CP)。MAP-CP和eMAP-CP通过预测移动用户的下一接入点(Access Point, AP),预取在当前AP下因切换AP不能获取到的Data并缓存到所预测的下一AP相关联的NDN节点中,为切换AP后的移动用户就近服务,达到降低内容获取延迟和提高响应率的目的。eMAP-CP在MAP-CP的基础上,可预取切换AP过程中请求的Data,能够进一步提高性能。基于ndnSIM的仿真实验表明,和NDN本身相比,MAP-CP和eMAP-CP具有更低的平均内容获取延迟和更高的响应率,而且eMAP-CP更优。在移动速度为20m/s,发包速率为200pps时,MAP-CP和eMAP-CP的平均内容获取延迟可分别降低约4.0%和38.7%,响应率可分别提高约1.2%和4.9%。     

推理过程的可视化研究

文章利用可视化技术,选择L系统为规则库的形式描述,实现推理的可视化。在知识表示方面,采用图形化的方法—逻辑演绎图,并将可视化因子加入规则。而在反向推理中,采用了模糊推理路径。最后用面向对象的方法实现。     

基于R树的空管GIS数据模型索引的设计

地理信息系统(GIS,Geographic Information System)是人们时客观世界理解经过一系列处理后在计算机上一种数字化.图像化的实现.对于复杂现实世界,一方面人们希望GIS包含充足的数据.另一方面又期望从中能方便地选择所需要的数据,为尽可能地包含信息,又要能方便快速选取,这就要求人们以一种高效的数据组织方式--GIS数据模型.GIS的一个特性就是海量的空间数据,为达到快速查询目的对其进行空间索引是必然的.而R树于1984年Guttman提出以来被广泛的运用于原型研究和空间数据库系统中.笔者介绍了一种基于R树的空间GIS数据模型索引的设计(基于R树的内存索引).