并行计算模型及其算法设计

并行计算模型及其算法设计李晓梅，窦勇（国防科技大学计算机系）ＰＡＲＡＬＬＥＬＣＯＭＰＵＴＡＴＩＯＮＭＯＤＥＬＳＡＮＤＬＧＯＲＩＴＨＭＤＥＳＩＧＮ￥ＬｉＸｉａｏｍｅｉ；ＤｏｎＹｏｎｇ（ＤｅｐａｒｔｍｅｎｔｏｆＣｏｍｐｕｔｅｒＳｃｉｅｎｃｅＣｈａｎｇｓｈ...     

广义ω─凸语言

广义ω─凸语言庄雷（郑州大学计算机系郑州４５００５２）ＧＥＮＥＲＡＬＩＺＥＤω－ＣＯＮＶＥＸＬＡＮＧＵＡＧＥＳ￥ＺｈｕａｎｇＬｅｉ（Ｄｅｐａｒｔｍｅｎｔ．ｏｆＣｏｍｐｕｔｅｒＳｃｉｅｎｃｅ，ＺｈｅｎｇｚｈｏｕＵｎｉｖｅｒｓｉｔｙ，Ｚｈｅｎｇｚｈｏｕ４...     

CPU术语

ＣＭＯＳ：Ｃｏｍｐｌｅｍｅｎｔａｒｙ　Ｍｅｔａｌ　Ｏｘｉｄｅ　Ｓｅｍｉｃｏｎｄｕｃｔｏｒ,互补金属氧化物半导体。ＣＩＳＣ：Ｃｏｍｐｌｅｘ　Ｉｎｓｔｒｕｃｔｉｏｎ　Ｓｅｔ　Ｃｏｍｐｕｔｉｎｇ　,复杂指令集计算机。ＣＰＧＡ：Ｃｅｒａｍｉｃ　Ｐｉｎ　Ｇｒｉｄ　Ａｒｒａｙ,陶瓷针型栅格阵列。ＣＰＵ：Ｃｅｎｔｅｒ　Ｐｒｏｃｅｓｓｉｎｇ　Ｕｎｉｔ,中央处理器。ＦＰＵ：Ｆｌｏａｔ　Ｐｏｉｎｔ　Ｕｎｉｔ,浮点运算单元。ＨＬ－ＰＢＧＡ：表面黏著,高而热、轻薄型塑胶球状矩阵封装。ＩＡ：Ｉｎｔｅｌ　Ａｒｃｈｉｔｅｃｔ…     

怎样防止他人使用你的计算机

假设某某在你的机器上,利用ＣＭＯＳ密码破译软件或口令计算软件（从网上下载：／／ｗｗｗ．．ｎｅｗｈｕａ．ｃｏｍ．ｃｎ或ｗｗｗ．ｌｏｓｔｐａｓｓｗａｒｄ．ｃｏｍ／）,或通过重写软件Ａｗｄｆｌａｓｈ．ｅｘｅ,或用ＤＥＢＵＧ命令的一Ｏ ７０ １０;－Ｏ７１００。利用ＣＭＯＳＲＡＭ在加电自检时发现奇偶校验错而进入ＣＭＯＳ,从而更改其相关选项：例如更改了 Ｂｏｏｔ Ｓｑｕｅｎｃｅ： Ｃ：, Ａ：（驱动器启动顺序,有的机器是Ｆｉｒｓｔ Ｓｑｕｅｎｃｅ项）,而使系统从软驱进行引导。并在ＭＳＤＯＳ． ＳＹＳ或ＣＯＮＦＩＧ…     

一种求解二次规划的简便方法

一种求解二次规划的简便方法刘萍，凌晓东（北京科技大学计算机系）（中信公司国际研究所）ＡＮＥＷＭＥＴＨＯＤＦＯＲＱＵＡＤＲＡＴＩＣＰＲＯＧＲＡＭＭＩＮＧ￥ＬｉｕＰｉｎｇ（ＤｅｐａｒｔｍｅｎｔｏｆＣｐｍｐｕｔｅｒＳｃｉｅｎｃｅ，ＵｎｉｖｅｒｓｉｔｙｏｆＳ...     

反求糙率的一种数值方法

反求糙率的一种数值方法杨世孝，肖子良（中山大学计算机科学系）ＡＮＵＭＥＲＩＣＡＬＭＥＴＨＯＤＦＯＲＦＩＮＤＩＮＧＲＯＵＧＨＮＥＳＳＲＡＴＥ￥ＹａｎｇＳｈｉ－ｘｉａｏ；ＸｉａｏＺｉ－ｌｉａｎｇ（ＤｅｐａｒｔｍｅｎｔｏｆＣｏｍｐｕｔｅｒＳｃｉｅｎｃｅ，Ｚ...     

A MULTIPLE STRUCTURE RECONSTRUCTION ALGORITHM BASED ON WIRE FRAME MODEL

ＡＭＵＬＴＩＰＬＥＳＴＲＵＣＴＵＲＥＲＥＣＯＮＳＴＲＵＣＴＩＯＮＡＬＧＯＲＩＴＨＭＢＡＳＥＤＯＮＷＩＲＥＦＲＡＭＥＭＯＤＥＬＤｕＪｉａｎｇｃｈｕａｎＰａｕｌＷ．Ｆ．ＰｏｏｎＡｂｓｔｒａｃｔＡ“ＬＡＧ＆ＲＬＣ”ｖｉｓｕａｌｉｚａｔｉｏｎａｌｇｏｒｉｔｈ...     

INTERFERENCE CHECKING IN COMPUTER-AIDED PLANT DESIGN SYSTEM

ＩＮＴＥＲＦＥＲＥＮＣＥＣＨＥＣＫＩＮＧＩＮＣＯＭＰＵＴＥＲ－ＡＩＤＥＤＰＬＡＮＴＤＥＳＩＧＮＳＹＳＴＥＭＷａｎｇＦｅｎｇＺｈａｏＨｏｎｇＮｉｕＪｕｎｙｕＡｂｓｔｒａｃｔＩｎｔｈｉｓｐａｐｅｒ，ｔｈｅｉｎｔｅｒｆｅｒｅｎｃｅｃｈｅｃｋｉｎｇｏｆｔｈｒ...     

COMPUTER GRAPHIC ASSEMBLY TECHNOLOGY FOR COMPOUND-BODY

ＣＯＭＰＵＴＥＲＧＲＡＰＨＩＣＡＳＳＥＭＢＬＹＴＥＣＨＮＯＬＯＧＹＦＯＲＣＯＭＰＯＵＮＤ－ＢＯＤＹ￥ＳｈａｎｇＪｉａｎｚｈｏｎｇ；ＰａｎＣｕｎｙｕｎ（ＤｅｐａｒｔｍｅｎｔｏｆＰｒｅｃｉｓｉｏｎＭａｃｈｉｎａｒｙａｎｄｉｎｓｔｒｕｍｅｎｔＮａｔｉｏｎａ...     

JOHN A.GREGORY AND HIS PUBLICATIONS

ＪＯＨＮＡ．ＧＲＥＧＯＲＹＡＮＤＨＩＳＰＵＢＬＩＣＡＴＩＯＮＳ￥ＱｕＲｕｉｂｉｎ（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｌｉｃｓＮａｔｉｏｎａｌＵｎｉｖｅｒｓｉｔｙｏｆＳｉｎｇａｐｏｒｅ１０ＫｅｎｔＲｉｄｇｅＣｒｅｓｃｅｎｔＳｉｎｇａｐｏｒｅ．１１９...     

Generalized resolution and NC-resolution

The relation between generalized resolution and NC-resolution is discussed.The proof of the completeness of NC linear resolution is then given.The incompleteness of NC lock resolution is also presented,thus the conclusion in [3] of “a simple completeness-preserving restriction” is shown to be wrong.     

Linguistic Theory Based Contextual Evidence Mining for Statistical Chinese Co-Reference Resolution

Under statistical learning framework, the paper focuses on how to use traditional linguistic findings on anaphora resolution as a guide for mining and organizing contextual features for Chinese co-reference resolution. The main achievements are as follows. （1） In order to simulate ＂syntactic and semantic parallelism factor＂, we extract ＂bags of word form and POS＂ feature and ＂bag of seines＂ feature from the contexts of the entity mentions and incorporate them into the baseline feature set. （2） Because it is too coarse to use the feature of bags of word form, POS tag and seme to determine the syntactic and semantic parallelism between two entity mentions, we propose a method for contextual feature reconstruction based on semantic similarity computation, in order that the reconstructed contextual features could better approximate the anaphora resolution factor of ＂Syntactic and Semantic Parallelism Preferences＂. （3） We use an entity-mention-based contextual feature representation instead of isolated word-based contextual feature representation, and expand the size of the contextual windows in addition, in order to approximately simulate ＂the selectional restriction factor＂ for anaphora resolution. The experiments show that the multi-level contextual features are useful for co-reference resolution, and the statistical system incorporated with these features performs well on the standard ACE datasets.     

Automated Proof Construction in Type Theory Using Resolution

We provide techniques to integrate resolution logic with equality in type theory. The results may be rendered as follows. A clausification procedure in type theory, equipped with a correctness proof, all encoded using higher-order primitive recursion. A novel representation of clauses in minimal logic such that the -representation of resolution steps is linear in the size of the premisses. A translation of resolution proofs into lambda terms, yielding a verification procedure for those proofs. Availability of the power of resolution theorem provers in interactive proof construction systems based on type theory.     

基于树核函数的“it”待消解项识别研究

该文在基于特征的英文代词指代消解平台上,使用复合核函数,研究指代消解中待消解项“it”的识别问题。围绕“it”是否是待消解项,该文采取有效策略获得“it”句法结构信息与平面特征信息,并将它们结合起来生成“it”待消解项分类器。在测试分类器性能的同时,将其运用到代词指代消解中以检验它对指代消解的作用。最后在ACE2003基准语料上实验表明采用复合核生成的分类器具有较高的准确率,并能显著提高代词指代消解性能。     

删除策略的相容性

本文给出关于删除策略相容性的几个结果，对相同谓词符号配用锁的子句集，锁归结和删除策略联用完备，对正文字锁大于负文字锁的Ｈｏｒｎ集，正单元锁归和删降策略联用完备，输入锁结与删除策略联用完备，配锁Ｈｏｒｎ集上输入半锁归结和删除联用完备的，标准Ｈｏｒｎ集上正单元强有序归结和删除策略联用完备，强有序输入归结和删除策略联用完备。     

Using WinWin Quality Requirements Management Tools: A Case Study

Negotiating stakeholder WinWin relationships among software quality requirements is a technique that emerged during the 1990's in order to overcome the difficulties arising from contract-oriented specification compliance (popular in the 1970's) and service-oriented customer satisfaction (popular in the 1980's). Obstacles to adoption of negotiated win-win relationships include coordination of multiple stakeholder interests and priorities, reasoning of complicated dependencies, and scalability of an exponentially increasing resolution option space. Conflict identification and resolution techniques are key success factors to overcome the obstacles. This paper describes two exploratory knowledge-based tools (called QARCC and S-COST)^* for conflict identification and resolution and how they were used in the digital library projects of a USC Software Engineering class during the 1996/97 school year. A comparative analysis with the artifacts surfaced by stakeholders and the artifacts generated and analyzed by QARCC and S-COST focused on the conflict resolution process, stakeholders' roles and their relationships to quality artifacts, and tool effectiveness. We conclude that the tools helped stakeholders: (1) surface and negotiate conflicts; (2) identify conflicts among functional and quality requirements; and (3) generate, visualize, and negotiate potential resolution options for the conflicts.     

NC－RUE－NRF归结

本提出了ＮＣ－ＲＵＥ－ＮＲＦ归结方法，并证明了它在含有等词广义子句集上的完备性。     

NC－RUE－NRF归结

本文提出了ＮＣ－ＲＵＥ－ＮＲＦ归结方法，并证明了它在含有等词广义子句集上的完备性．     

电学层析成像中软场效应的度量与应用

“软场效应”的存在导致电学层析(ET)成像技术重建图像分辨率低,为了度量“软场效应”并降低其影响,提出了一个基于灵敏度系数的“软场效应”度量指标,据此实施ET测量数据的重构.实验结果表明:软场效应指标能够有效地反映“软场效应”对ET成像空间分辨率的影响,重构的数据能够提高已有ET算法的空间分辨率.     

一种改进的OL归结——SOL归结

1973年,Chang和Lee将线性归结与有序归结相结合,提出了有序线性归结,即OL归结,极大地提高了线性归结的效率和机械性。然而,OL归结并不是一种完备的归结方法。在OL归结的约化条件的基础上提出了强约化的概念。强约化条件对中心有信息有序子句的约化做了进一步的限制,且该强约化条件是约化条件的一种特例。在强约化条件的基础上,还提出了一种改进的OL归结——SOL归结,并证明了其完备性。