Semantic analysis in XTRA,an English — Chinese machine translation system

This paper concerns the resolution of lexical ambiguity in a machine translation environment. We describe the integration of principles of selection restrictions. Preference Semantics, and intelligent relaxation of constraints in handling lexical ambiguity. The approach differs from many previous MT systems in that it is more powerful than brute force systems, while more realistic than systems that assume a large degree of coded encyclopedia information for full understanding.     

基于内容的静态语义概念视频检索方法研究

本文针对互联网视频检索技术的发展,阐述了目前主流视频搜索引擎的技术现状,分析了互联网视频检索的关键技术,特别是对于视频特征的提取技术。本文的创新点是提出了一种通用的基于内容的静态语义视频检索方法,该方法可以弥补基于文本视频检索的有关不足,并且在TRECVID的视频概念检索数据的静态语义概念中得到验证,运行稳定。     

A novel design of 8-bit adder/subtractor by quantum-dot cellular automata

Application of quantum-dot is a promising technology for implementing digital systems at nano-scale. QCA supports the new devices with nanotechnology architecture. This technique works based on electron interactions inside quantum-dots leading to emergence of quantum features and decreasing the problem of future integrated circuits in terms of size. In this paper, we will successfully design, implement and simulate a new full adder based on QCA with the minimum delay, area and complexities. Also, new XOR gates will be presented which are used in 8-bit controllable inverter in QCA. Furthermore, a new 8-bit full adder is designed based on the majority gate in the QCA, with the minimum number of cells and area which combines both designs to implement an 8-bit adder/subtractor in the QCA. This 8-bit adder/subtractor circuit has the minimum delay and complexity. Being potentially pipeline, the QCA technology calculates the maximum operating speed.     

公式分层的谓词模态逻辑

由于必然模态词□的引入,谓词模态逻辑的公式在一个可能世界中的真假值可能依赖于其可达的可能世界.在谓词模态逻辑中存在个体跨可能世界相等问题.针对这一问题,Lewis提出了对应物理论,并且在对应物理论中用对应物关系来表示个体跨可能世界相等.但是,当一个对象具有一个以上的对应物时,谓词模态逻辑中的跨可能世界相等关系无法与对应物关系建立一一对应.通过限制谓词模态逻辑中全称量词∀的范围,给出了一种公式分层的谓词模态逻辑.它是谓词模态逻辑的一个子逻辑,并且其语言与谓词模态逻辑的语言是相同的.但其公式是分层定义的,使得∀可以出现在□的范围内,并且□不能出现在∀的范围内.由于任意形如∀x□φ（x）的表达式都不是该逻辑的公式,以量词开头的公式在一个可能世界w中的真假值只依赖于w,该逻辑避免了个体跨可能世界相等问题.给出了该逻辑的语言、语法和语义,并证明了该逻辑是可靠的和完备的.     

Coordination between strategic forest management and tactical logistic and production planning in the forestry supply chain

In this paper, we study the coordination mechanism in the forestry supply chain between strategic forest management and tactical production planning. We first formulate an integrated model to establish a theoretical benchmark for performance of the entire supply chain. It is a mixed integer programming model that involves harvesting, bucking, transportation, production, and sales decisions for both tactical and strategic planning levels. We then present two sequential approaches S‐A and S‐B where the coordination is done through internal pricing. S‐A is the approach currently used in practice where harvesting in the forest is the main driver of the supply chain activities and internal pricing is introduced to control bucking decision in a separate stage. In contrast, S‐B takes downstream demand information into consideration and internal pricing directly influences harvesting decision in the first stage. In order to find the appropriate setting of internal pricing that leads to the system optimum, we suggest two heuristics H‐I and H‐II. The internal pricing in H‐I is based on dual values and in H‐II, it is derived from a Lagrangian decomposition. A real‐life case study in the Chilean forestry industry is used to compare the results of different approaches. It is shown that the new sequential approach S‐B generates as good feasible solution as that obtained from the integrated approach but in much less time. Both heuristics H‐I and H‐II bring about near‐optimal feasible solutions. H‐II also provides optimistic bound of the optimal objective function value, which can be used as a measure of the solution quality.     

Web交互模型的形式化验证研究

Web交互模型的形式化验证是对Web事件属性进行校验的十分可信的方法。通过一系列的系统模型建立、系统行为分析以及对于模型中关心属性的相关验证,能够让交互模型在设计阶段就能使形式化模型暴露出其所存在的缺陷,而不至于让缺陷保留到编码阶段或者更后面才能被真正地暴露出来,这样使系统模型的生存能力更加强大,同时避免了因后期缺陷暴露而出现的大代价修复。通过对Web系统的交互应用服务的过程模型化的体系进行研究,通过模型本身具有的属性进行相关正确性的校验,主要通过使用数学推理实现系统逻辑上的服务交互进程,从而进行过程的推演,并对系统服务的正确性进行过程的形式化验证,从而使系统服务模块的属性正确性可以通过逻辑上的演进来发现服务问题的存在,而不再是系统通过编码实现后才发现。对Web交互模型的形式化验证是基于IMWSC模型语义形成的IMWSC模型的验证机制。     

基于关联与回溯的产品变异设计过程重用方法

为实现在复杂度和数量上急剧增长的产品过程模型和关联知识的重用,提出一种产品变异设计过程的重用方法.对设计系统的模块进行精细化和抽象化,建立具有规范化数据接口的产品结构变异设计的信息模型,用状态空间的带权有序检索树存储变异设计过程;将变异设计语义添加至可移植结构,当发生分割、合并和变换的变异设计行为时,对其抛弃、保持或复制等处理,实现变异设计语义随变异设计行为的继承与变迁;再通过检索变异设计语义不断获得待变异结构,将离散的设计过程关联;深度优先搜索获得把初始状态变换为目标状态的操作序列,执行可行解集,回溯变异设计过程并实现重用.以ACIS为几何造型内核开发自主原型系统,实现涡轮风扇发动机的压气机的转子叶片变异设计过程的重用.结果表明,该方法将设计重用对象由静态的孤立设计结果拓展到动态的连续设计过程,对于准确、快速地实现产品的结构变异设计具有重要意义.     

标签扩展的协同过滤推荐算法

大多数利用标签与用户和项目之间关系的推荐算法,都要面临用户个体不同所导致的标签稀疏问题,不同的用户为项目所标注的标签会有所不同.针对由于用户标注标签的随意性而导致的用户标签和项目标签矩阵稀疏问题,提出了一种标签扩展的协同过滤推荐算法.该算法根据用户标注标签的行为计算基于标签的标签相似度,根据用户标注的标签语义计算基于标签语义的标签相似度,从用户行为和标签语义2个方面评估标签的相似度,并利用标签相似度来扩展每个项目标签,降低由项目与标签的关联关系产生的矩阵稀疏度.在M ovieLens数据集上的实验结果表明,所提算法在精度上有所提高.     

主动式二维码考勤系统研究

提出了一种新型主动式考勤方式,并给出了一种结合二维码的应用方式.该方法大大节省了硬件支出成本,同时加快了考勤速度.综述了现阶段其他研究成果,并研究了主动式二维码考勤和被动式二维码考勤的区别.     

Connectionism,Learning and Meaning

There is an apparent anomaly in the notion that connectionism, which is fundamentally a new technology, has considerable philosophical significance. Nonetheless, connectionism has been widely viewed as having implications for symbol grounding, notions of structured representation and compositionality, as well as the issue of nativism. In this paper, we consider each of these issues in detail and find that the current state of connectionism does not warrant the magnitude of many of the philosophical conclusions drawn from it. We argue that connectionist models are no more 'grounded' than their classical counterparts. In addition, since connectionist representations typically are ascribed content through semantic interpretation based on correlation, connectionism is prone to a number of well known philosophical problems facing any kind of correlational semantics. However, we suggest that philosophy may be ill advised to ignore the development of connectionism, particularly if connectionist systems prove to be able to learn to handle structured representations.