LinkingPark: An automatic semantic table interpretation system

In this paper, we present LinkingPark, an automatic semantic annotation system for tabular data to knowledge graph matching. LinkingPark is designed as a modular framework which can handle Cell-Entity Annotation (CEA), Column-Type Annotation (CTA), and Columns-Property Annotation (CPA) altogether. It is built upon our previous SemTab 2020 system, which won the 2nd prize among 28 different teams after four rounds of evaluations. Moreover, the system is unsupervised, stand-alone, and flexible for multilingual support. Its backend offers an efficient RESTful API for programmatic access, as well as an Excel Add-in for ease of use. Users can interact with LinkingPark in near real-time, further demonstrating its efficiency.     

Morphological study of thin films: Simulation and experimental insights using horizontal visibility graph

We studied the morphological nature of various thin films such as silicon carbide (SiC), diamond (C), germanium (Ge), and gallium nitride (GaN) on silicon substrate Si(100) using the pulsed laser deposition (PLD) method and Monte Carlo simulation. We, for the first time, systematically employed the visibility algorithm graph to meticulously study the morphological features of various PLD grown thin films. These thin-film morphologies are investigated using random distribution, Gaussian distribution, patterned heights, etc. The nature of the interfacial height of individual surfaces is examined by a horizontal visibility graph (HVG). It demonstrates that the continuous interfacial height of the silicon carbide, diamond, germanium, and gallium nitride films are attributed to random distribution and Gaussian distribution in thin films. However, discrete peaks are obtained in the brush and step-like morphology of germanium thin films. Further, we have experimentally verified the morphological nature of simulated silicon carbide, diamond, germanium, and gallium nitride thin films were grown on Si(100) substrate by pulsed laser deposition (PLD) at elevated temperature. Various characterization techniques have been used to study the morphological, and electrical properties which confirmed the different nature of the deposited films on the Silicon substrate. Decent hysteresis behavior has been confirmed by current-voltage (IV) measurement in all the four deposited films. The highest current has been measured for GaN at ～60 nA and the lowest current in SiC at ～30 nA level which is quite low comparing with the expected signal level (μA). The HVG technique is suitable to understand surface features of thin films which are substantially advantageous for the energy devices, detectors, optoelectronic devices operating at high temperatures.     

Mathematical representation of radiality constraint in distribution system reconfiguration problem

Distribution systems are most commonly operated in a radial configuration for a number of reasons. In order to impose radiality constraint in the optimal network reconfiguration problem, an efficient algorithm is introduced in this paper based on graph theory. The paper shows that the normally followed methods of imposing radiality constraint within a mixed-integer programming formulation of the reconfiguration problem may not be sufficient. The minimum-loss network reconfiguration problem is formulated using different ways to impose radiality constraint. It is shown, through simulations, that the formulated problem using the proposed method for representing radiality constraint can be solved more efficiently, as opposed to the previously proposed formulations. This results in up to 30% reduction in CPU time for the test systems used in this study.     

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

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

Bond graph modeling,design and experimental validation of a photovoltaic/fuel cell/ electrolyzer/battery hybrid power system

This work presents a complete bond graph modeling of a hybrid photovoltaic-fuel cell-electrolyzer-battery system. These are multi-physics models that will take into account the influence of temperature on the electrochemical parameters. A bond graph modeling of the electrical dynamics of each source will be introduced. The bond graph models were developed to highlight the multi-physics aspect describing the interaction between hydraulic, thermal, electrochemical, thermodynamic, and electrical fields. This will involve using the most generic modeling approach possible for managing the energy flows of the system while taking into account the viability of the system. Another point treated in this work is to propose. In this work, a new strategy for the power flow management of the studied system has been proposed. This strategy aims to improve the overall efficiency of the studied system by optimizing the decisions made when starting and stopping the fuel cell and the electrolyzer. It was verified that the simulation results of the proposed system, when compared to simulation results presented in the literature, that the hydrogen demand is increased by an average of 8%. The developed management algorithm allows reducing the fuel cell degradation by 87% and the electrolyzer degradation by 65%. As for the operating time of the electrolyzer, an increment of 65% was achieved, thus improving the quality of the produced hydrogen. The Fuel Cell's running time has been decreased by 59%. With the ambition to validate the models proposed and the associated commands, the development of this study gave rise to the creation of an experimental platform. Using this high-performance experimental platform, experimental tests were carried out and the results obtained are compared with those obtained by simulation under the same metrological conditions.     

基于服务器端会话追踪的Web查询服务的研究

在探讨了Web查询服务的典型模型后,论文阐述了服务器端会话追踪机制的实现方式,设计了基于服务器端会话追踪的Web查询服务的典型解决方案。该设计方案可以较为安全地保存和维护客户的上下文信息,可靠地跟踪用户查询所处的状态,有效地实现有状态的Web查询服务。     

大坝监测自动化中的人工比测研究

阐述了人工比测的概念、方式和数据分析方法,对人工比测及数据分析中应注意的问题也进行了深入研究。     

A Multilayer Optical Packet Switching Network Based on the Kautz Graph and Optical Passive Star Couplers

The multihop optical network is the most appropriate solution to satisfy the increasing applications of Internet services. This paper extends the regular Kautz graph to one with multiple layers in order to produce more architectural variations. The connectivity between adjacent layers utilizes the systematic connection patterns of a regular Kautz graph. A routing algorithm based on its property is presented. Optical passive star (OPS) couplers are adopted to implement our new topologies. Three scheduling criteria that can solve the contention problem in the intermediate nodes are evaluated and compared in terms of their capability to improve the accessibility.     

Topology optimization of trusses using genetic algorithm,force method and graph theory

In this article size/topology optimization of trusses is performed using a genetic algorithm (GA), the force method and some concepts of graph theory. One of the main difficulties with optimization with a GA is that the parameters involved are not completely known and the number of operations needed is often quite high. Application of some concepts of the force method, together with theory of graphs, make the generation of a suitable initial population well‐matched with critical paths for the transformation of internal forces feasible. In the process of optimization generated topologically unstable trusses are identified without any matrix manipulation and highly penalized. Identifying a suitable range for the cross‐section of each member for the ground structure in the list of profiles, the length of the substrings representing the cross‐sectional design variables are reduced. Using a contraction algorithm, the length of the strings is further reduced and a GA is performed in a smaller domain of design space. The above process is accompanied by efficient methods for selection, and by using a suitable penalty function in order to reduce the number of numerical operations and to increase the speed of the optimization toward a global optimum. The efficiency of the present method is illustrated using some examples, and compared to those of previous studies. Copyright © 2003 John Wiley & Sons, Ltd.     

A survey of parallel execution strategies for transitive closure and logic programs

An important feature of database technology of the nineties is the use of parallelism for speeding up the execution of complex queries. This technology is being tested in several experimental database architectures and a few commercial systems for conventional select-project-join queries. In particular, hash-based fragmentation is used to distribute data to disks under the control of different processors in order to perform selections and joins in parallel. With the development of new query languages, and in particular with the definition of transitive closure queries and of more general logic programming queries, the new dimension of recursion has been added to query processing. Recursive queries are complex; at the same time, their regular structure is particularly suited for parallel execution, and parallelism may give a high efficiency gain. We survey the approaches to parallel execution of recursive queries that have been presented in the recent literature. We observe that research on parallel execution of recursive queries is separated into two distinct subareas, one focused on the transitive closure of Relational Algebra expressions, the other one focused on optimization of more general Datalog queries. Though the subareas seem radically different because of the approach and formalism used, they have many common features. This is not surprising, because most typical Datalog queries can be solved by means of the transitive closure of simple algebraic expressions. We first analyze the relationship between the transitive closure of expressions in Relational Algebra and Datalog programs. We then review sequential methods for evaluating transitive closure, distinguishing iterative and direct methods. We address the parallelization of these methods, by discussing various forms of parallelization. Data fragmentation plays an important role in obtaining parallel execution; we describe hash-based and semantic fragmentation. Finally, we consider Datalog queries, and present general methods for parallel rule execution; we recognize the similarities between these methods and the methods reviewed previously, when the former are applied to linear Datalog queries. We also provide a quantitative analysis that shows the impact of the initial data distribution on the performance of methods. Recommended by: Patrick Valduriez