陪护机器人口语对话系统设计与实现

针对陪护机器人口语对话系统的难点给出了相应的解决方案：以话题为单位的聊天机器人知识库构建规则、简单有效的句子相似度计算方法、准确高效的答案检索模块。通过对78个回合的实际聊天结果的统计分析,验证了解决方案的有效性;同时分析了方案的局限性。     

浅谈无障碍色彩设计

无障碍色彩设计是一个面向所有公众的设计系统,该系统的最终目标为创建无障碍可视环境,使信息尽可能准确地传达给更多的公众。本文通过提出我国在视觉信息无障碍建设方面的不足,从视觉障碍人群的类别和色彩认知特点进行归类分析,提出用无障碍色彩设计来创建视觉信息的无障碍环境。     

广义指定多个验证者有序多重签名方案

广义指定多个验证者签名允许签名持有者指定多个签名验证者,有序多重签名则可满足多个签名者以严格的次序进行签名的要求。根据上述特性,提出一种基于身份的广义指定多个验证者有序多重签名方案,采用类短签名的形式构造签名,并在随机预言模型下证明方案的安全性。分析结果表明,该方案具有较高的效率,可抵抗适应性选择消息和身份攻击。     

On properties not inherited by monoids from their Schützenberger groups

We give an example of a monoid with finitely many left and right ideals, all of whose Schützenberger groups are presentable by finite complete rewriting systems, and so each have finite derivation type, but such that the monoid itself does not have finite derivation type, and therefore does not admit a presentation by a finite complete rewriting system. The example also serves as a counterexample to several other natural questions regarding complete rewriting systems and finite derivation type. Specifically it allows us to construct two finitely generated monoids M and N with isometric Cayley graphs, where N has finite derivation type (respectively, admits a presentation by a finite complete rewriting system) but M does not. This contrasts with the case of finitely generated groups for which finite derivation type is known to be a quasi-isometry invariant. The same example is also used to show that neither of these two properties is preserved under finite Green index extensions.     

Some algebraic methods for solving multiobjective polynomial integer programs

Multiobjective discrete programming is a well-known family of optimization problems with a large spectrum of applications. The linear case has been tackled by many authors during the past few years. However, the polynomial case has not been studied in detail due to its theoretical and computational difficulties. This paper presents an algebraic approach for solving these problems. We propose a methodology based on transforming the polynomial optimization problem to the problem of solving one or more systems of polynomial equations and we use certain Gröbner bases to solve these systems. Different transformations give different methodologies that are theoretically stated and compared by some computational tests via the algorithms that they induce.     

人工膝关节置换术中压力平衡测量装置

提出了在人工膝关节置换手术中测量膝关节假体与垫片之间压力的系统,帮助医生定量地了解软组织各部分张力的情况,保证膝关节内外侧软组织张力的平衡.采用触力传感器采集压力信息,用微处理器对系统进行控制和数据处理,通过无线方式进行数据传输,在显示终端以图形化的方式直观实时地显示压力分布.从理论上分析了系统的误差,并给出了测试方案...     

一体化承载网络体系架构研究

传统信息网络因面向业务支撑设计而造成体系架构的刚性,无法满足业务发展多样性和网络异构的需求,因此无法适应下一代网络融合、可扩展等特点.面向服务提供的技术体系可以解决这一问题.文中以网络承载服务为核心,以可重构路由交换平台为关键支撑技术,设计出一种面向服务提供的网络体系架构--一体化承载网络(UCN)模型,以及基于UCN模型设计出的逻辑承载网的资源均衡构建算法(RBCA)并进行了网络仿真及结果分析,为下一代网络的研究和设计提供了新的思路.     

Image universal steganalysis based on best wavelet packet decomposition

Based on the best wavelet packet decomposition of images, a new universal steganalysis method with high detection correct ratio is proposed. First, the best wavelet packet decomposition of image based on the Shannon entropy information cost function is made. Second, high order absolute characteristic function moments of histogram extracted from the coefficient subbands obtained by best wavelet packet decomposition are regarded as features. Finally, these features are processed and a back-propagation (BP) ne...     

On the decoding of binary cyclic codes with the Newton identities

We revisit in this paper the concept of decoding binary cyclic codes with Gröbner bases. These ideas were first introduced by Cooper, then Chen, Reed, Helleseth and Truong, and eventually by Orsini and Sala. We discuss here another way of putting the decoding problem into equations: the Newton identities. Although these identities have been extensively used for decoding, the work was done manually, to provide formulas for the coefficients of the locator polynomial. This was achieved by Reed, Chen, Truong and others in a long series of papers, for decoding quadratic residue codes, on a case-by-case basis. It is tempting to automate these computations, using elimination theory and Gröbner bases.Thus, we study in this paper the properties of the system defined by the Newton identities, for decoding binary cyclic codes. This is done in two steps, first we prove some facts about the variety associated with this system, then we prove that the ideal itself contains relevant equations for decoding, which lead to formulas.Then we consider the so-called online Gröbner basis decoding, where the work of computing a Gröbner basis is done for each received word. It is much more efficient for practical purposes than preprocessing and substituting into the formulas. Finally, we conclude with some computational results, for codes of interesting length (about one hundred).     

基于SIPN的PLC通用编程器

针对PLC编程器的缺陷,建立PLC通用编程器抽象模型,采用中间格式代码和配置文件链接生成可下载的PLC程序。利用信号解释Petri网对控制系统模型进行规格并将其转换成中间格式代码。抽象出不同机型PLC系统的特性信息,生成统一模式的XML类型配置文件。根据机型选择,通过PLC通用处理器提取相应配置文件,与中间格式代码链接,重组代码并生成与机型适配的可执行程序。