一种使用多跳事实的端到端知识库实体描述生成方法

自动化实体描述生成有助于进一步提升知识图谱的应用价值,而流畅度高是实体描述文本的重要质量指标之一。该文提出使用知识库上多跳的事实来进行实体描述生成,从而贴近人工编撰的实体描述的行文风格,提升实体描述的流畅度。该文使用编码器—解码器框架,提出了一个端到端的神经网络模型,可以编码多跳的事实,并在解码器中使用关注机制对多跳事实进行表示。该文的实验结果表明,与基线模型相比,引入多跳事实后模型的BLEU-2和ROUGE-L等自动化指标分别提升约8.9个百分点和7.3个百分点。     

Quantum computation based bundling optimization for combinatorial auction in freight service procurements

Combinatorial auction is a useful trade manner for transportation service procurements in e-marketplaces. To enhance the competition of combinatorial auction, a novel auction mechanism of two-round bidding with bundling optimization is proposed. As the recommended the auction mechanism, the shipper/auctioneer integrates the objects into several bundles based on the bidding results of first round auction. Then, carriers/bidders bid for the object bundles in second round. The bundling optimization is described as a multi-objective model with two criteria on price complementation and combination consistency. A Quantum Evolutionary Algorithm (QEA) with β-based rotation gate and the encoding scheme based on non-zero elements in complementary coefficient matrix is developed for the model solution. Comparing with a Contrast Genetic Algorithm, QEA can achieve better computational performances for small and middle size problems.     

Efficient Spreadsheet Algorithm for First-Order Reliability Method

A new spreadsheet-cell-object-oriented algorithm for the first-order reliability method is proposed and illustrated for cases with correlated nonnormals and explicit and implicit performance functions. The new approach differs from the writers earlier algorithm by obviating the need for computations of equivalent normal means and equivalent normal standard deviations. It obtains the solution faster and is more efficient, robust, and succinct. Other advantages include ease of initialization prior to constrained optimization, ease of randomization of initial values for checking robustness, and fewer required optimization constraints during spreadsheet-automated search for the design point. Two cases with implicit performance functions, namely an asymmetrically loaded beam on Winkler medium and a strut with complex supports are analyzed using the new approach and discussed. Comparisons are also made between the proposed approach and that based on Rosenblatt transformation.     

Approach for Overcoming Numerical Inaccuracy Caused by Load Discontinuity

It was found that the discontinuity at the end of an impulse will lead to numerical inaccuracy as this discontinuity will result in an extra impulse and thus an extra displacement in the time history analysis. In addition, this extra impulse is proportional to the discontinuity value at the end of the impulse and the size of integration time step. To overcome this difficulty, an effective approach is proposed to reduce the extra impulse and hence the extra displacement. In fact, the novel approach proposed in this paper is to perform a single small time step immediately upon the termination of applied impulse, whereas other time steps can be conducted by using the step size determined from accuracy consideration in period. The feasibility of this approach is analytically explored. Further, analytical results are confirmed by numerical examples. Numerical studies also show that this approach can be applied to other step-by-step integration methods. It seems that to slightly complicate the programming of dynamic analysis codes is the only disadvantage of this approach.     

O—O数据模型中实体联系的表达方法

具有对实体和实体间联系的描述能力，是数据库的基本，吼是对数据库进逻辑设计的基本出发点。Ｏ－Ｏ数据模型不具备显式描术这实体联系的手段。且优于关系模型。     

有限元法应用于微波和光波器件的问题和发展

本文就有限元法应用于微波和光波器件的原理、问题和最新进展作了综合评述。文中讨论了适用于不同问题的变分公式的意义；着重讨论了避免和消除虚模的方法和处理开放边界的技术；还对代表该领域发展趋势的三个方面，即边棱元法。非线性结构及有限元程序的前后处理问题进行了评论和展望。     

外购粗铅检验准确性测试

通过对外购粗铅的整体熔化，测试出外购粗铅中金、银的含量，以验证外购粗铅检验的准确性，确保铅冶炼金银平衡。     

Computation of Bearing Capacity Factor Nγ?Terzaghi’s Mechanism

A procedure based on K?tter’s equation is developed for the evaluation of bearing capacity factor Nγ with Terzaghi’s mechanism. Application of K?tter’s equation makes the analysis statically determinate, in which the unique failure surface is identified using force equilibrium conditions. The computed Nγ values are found to be higher than Terzaghi’s value in the range 0.25–20%, with a diverging trend for higher values of angle of soil internal friction. A fairly good agreement is observed with other solutions which are based on finite difference coupled with associated flow rule, limit analysis, and limit equilibrium. Finally, the comparison with available experimental results vis-à-vis other solutions shows that, computed Nγ values are capable of making a reasonably good prediction.     

CoGCN: Combining co‐attention with graph convolutional network for entity linking with knowledge graphs

Entity linking is a fundamental task in natural language processing. The task of entity linking with knowledge graphs aims at linking mentions in text to their correct entities in a knowledge graph like DBpedia or YAGO2. Most of existing methods rely on hand‐designed features to model the contexts of mentions and entities, which are sparse and hard to calibrate. In this paper, we present a neural model that first combines co‐attention mechanism with graph convolutional network for entity linking with knowledge graphs, which extracts features of mentions and entities from their contexts automatically. Specifically, given the context of a mention and one of its candidate entities' context, we introduce the co‐attention mechanism to learn the relatedness between the mention context and the candidate entity context, and build the mention representation in consideration of such relatedness. Moreover, we propose a context‐aware graph convolutional network for entity representation, which takes both the graph structure of the candidate entity and its relatedness with the mention context into consideration. Experimental results show that our model consistently outperforms the baseline methods on five widely used datasets.     

The interprocedural analysis and automatic parallelization of Scheme programs

Lisp and its descendants are among the most important and widely used of programming languages. At the same time, parallelism in the architecture of computer systems is becoming commonplace. There is a pressing need to extend the technology of automatic parallelization that has become available to Fortran programmers of parallel machines, to the realm of Lisp programs and symbolic computing. In this paper we present a comprehensive approach to the compilation of Scheme programs for shared-memory multiprocessors. Our strategy has two principal components:interprocedural analysis andprogram restructuring. We introduceprocedure strings andstack configurations as a framework in which to reason about interprocedural side-effects and object lifetimes, and develop a system of interprocedural analysis, using abstract interpretation, that is used in the dependence analysis and memory management of Scheme programs. We introduce the transformations ofexit-loop translation andrecursion splitting to treat the control structures of iteration and recursion that arise commonly in Scheme programs. We propose an alternative representation for s-expressions that facilitates the parallel creation and access of lists. We have implemented these ideas in a parallelizing Scheme compiler and run-time system, and we complement the theory of our work with snapshots of programs during the restructuring process, and some preliminary performance results of the execution of object codes produced by the compiler.This work was supported in part by the National Science Foundation under Grant No. NSF MIP-8410110, the U.S. Department of Energy under Grant No. DE-FG02-85ER25001, the Office of Naval Research under Grant No. ONR N00014-88-K-0686, the U.S. Air Force Office of Scientific Research under Grant No. AFOSR-F49620-86-C-0136, and by a donation from the IBM Corportation.