Question: An overview of online judge systems and their various applications.

This paper provides an in-depth exploration of simulated annealing as a powerful optimization technique inspired by the annealing process in metallurgy. Unlike gradient-based methods, simulated annealing employs a probabilistic approach to escape local minima and seek the global optimum. The algorithm starts with an initial solution and iteratively explores the solution space by accepting new solutions based on a probability function that decreases over time, mimicking the cooling process in annealing. This cooling schedule is crucial in balancing exploration and exploitation, allowing the algorithm to efficiently navigate complex landscapes. Simulated annealing has been successfully applied across a wide range of fields, from scheduling and logistics to machine learning and pattern recognition. Its ability to handle discrete and continuous optimization problems, along with its robustness to noisy environments, makes it a versatile tool in various scientific and engineering disciplines. The paper also discusses the challenges and limitations of simulated annealing, such as the sensitivity to parameter settings and the computational cost, and suggests strategies to mitigate these issues. Through a comprehensive review of the literature, the paper highlights the latest advancements and emerging trends in the application of simulated annealing, providing insights for researchers and practitioners looking to harness this optimization method in their specific domains.

This study aimed to create an online community of practice by creating a virtual classroom in the Edmodo application and ascertain the opinions of pre-service primary teachers about the effects of Edmodo on their learning to teach science and availability of Edmodo. The research used a case study, which is one method of descriptive research. During the implementation process, pre-service primary teachers used Edmodo to share activities they had designed that centred on the scientific concepts taught in primary science education programmes. They also shared their diary entries that outlined their experiences and views after they had practised their activities in a real classroom. 58 pre-service primary teachers participated in the study. The author developed a questionnaire and it included one closed-ended and six open-ended questions; the questionnaire was used as the data collection tool. The pre-service primary teachers used Edmodo for 12 weeks. Descriptive and content analysis methods were used to analyse the data obtained from the study. The results obtained from the data analysis showed that pre-service primary teachers generally had positive views about the use of Edmodo in teacher education programmes. Most pre-service primary teachers stated that Edmodo provides the possibility of sharing knowledge, experiences and views. However, some pre-service teachers stated that Edmodo has some limitations; for example, the fact that it requires the user to have internet access. As a result, it can be said that Edmodo can be used to create an online community of practice in teacher education programmes.

The field of artificial intelligence in education (AIED) uses techniques from AI and cognitive science to better understand the nature of learning and teaching and to build systems to help learners gain new skills or understand new concepts. This article studies metareviews and meta-analyses to make the case for blended learning, wherein the teacher can offload some work to AIED systems.

This article describes the design and implementation of the course Introduction to Computational Thinking (PC-01) for primary and secondary education. The course introduces the “concepts” and core “processes” of Computational Thinking using a visual programming environment. The design of the course PC-01 includes a set of multimedia content, learning tools and technologies that help teachers and students in the teaching-learning process. These tools allow the teacher the successful delivery of the course content as well as the individual/collective monitoring of students' progress in the course. Students have access to their progress throughout the course and participate in creative and collaborative tasks. This course also serves to introduce transversely educational technologies to many students of primary and secondary education. The technological environment integrates the online teaching resources and the methodological tools of the course. The course uses Scratch 2.0 as the programming environment and Moodle as the learning platform. At present the course is being implemented in public schools in the Dominican Republic.

Online learning has become very popular over the last decade. However, there are still many details that remain unknown about the strategies that students follow while studying online. In this study, we focus on the direction of detecting ‘invisible’ collaboration ties between students in online learning environments. Specifically, the paper presents a method developed to detect student ties based on temporal proximity of their assignment submissions. The paper reports on findings of a study that made use of the proposed method to investigate the presence of close submitters in two different massive open online courses. The results show that most of the students (i.e., student user accounts) were grouped as couples, though some bigger communities were also detected. The study also compared the population detected by the algorithm with the rest of user accounts and found that close submitters needed a statistically significant lower amount of activity with the platform to achieve a certificate of completion in a MOOC. These results confirm that the detected close submitters were performing some collaboration or even engaged in unethical behaviors, which facilitates their way into a certificate. However, more work is required in the future to specify various strategies adopted by close submitters and possible associations between the user accounts.

Purpose – Aims to review the key concepts of competency management (CM) and to propose method for developing competency method. Design/methodology/approach – Examines the CM features of 22 CM systems and 18 learning management systems. Findings – Finds that the areas of open standard (XML, web services, RDF), semantic technologies (ontologies and the semantic web) and portals with self-service technologies are going to play a significant part in the evolution of CM systems. Originality/value – Emphasizes the beneficial attributes of CM for private and public organizations.

The Large Hadron Collider (LHC) is one of the most complex machines ever build. It is composed of many components which constitute a large system. The tunnel and the accelerator is just one of a very critical fraction of the whole LHC infrastructure. Hardware comissioning as one of the critical processes before running the LHC is implemented during the Long Shutdown (LS) states of the macine, where Electrical Quality Assurance (ELQA) is one of its key components. Here a huge data is collected when implementing various ELQA electrical tests. In this paper we present a conceptual framework for supporting a rapid design of web applications for ELQA data analysis. We show a framework’s main components, their possible integration with other systems and machine learning algorithms and a simple use case of prototyping an application for Electrical Quality Assurance of the LHC.

Domain-specific search engines are growing in popularity because they offer increased accuracy and extra functionality not possible with the general, Web-wide search engines. For example, www.campsearch.com allows complex queries by age-group, size, location and cost over .summer camps. Unfortunately these domain-specific search engines are difficult and timeconsuming to maintain. This paper proposes the use of machine learning techniques to greatly automate the creation and maintenance of domain-specific search engines. We describe new research in reinforcement learning, information extraction and text classification that enables efficient spidering, identifying informative text segments, and populating topic hierarchies. Using these techniques, we have built a demonstration system: a search engine for computer science research papers. It already contaius over 50,000 papers and is publicly available at ~w. cora.justres earch, com.

In this position paper, we argue that building operational automated scoring systems is a task that has disciplinary complexity above and beyond standard competitive shared tasks which usually involve applying the latest machine learning techniques to publicly available data in order to obtain the best accuracy. Automated scoring systems warrant significant cross-discipline collaboration of which natural language processing and machine learning are just two ofmany important components. Such systems have multiple stakeholders with different but valid perspectives that can often times be at odds with each other. Our position is that it is essential for us as NLP researchers to understand and incorporate these perspectives into our research and work towards a mutually satisfactory solution in order to build automated scoring systems that are accurate, fair, unbiased, and useful. 1 What is Automated Scoring? Automated scoring is an NLP application usually deployed in the educational domain. It involves automatically analyzing a student’s response to a question and generating either (a) a score in order to assess the student’s knowledge and/or other skills and/or (b) some actionable feedback on how the student can improve the response (Page, 1966; Burstein et al., 1998; Burstein et al., 2004; Zechner et al., 2009; Bernstein et al., 2010). It is considered an NLP application since typically the core technology behind the automated analysis of the student response enlists NLP techniques. The student responses can include essays, short answers, or spoken responses and the two most common kinds of automated scoring are the automated evaluation of writing quality and content knowledge. Both the scores and feedback are usually based on linguistic characteristics of the responses including but not limited to: (i) Lower-level errors in the response (e.g., pronunciation errors in spoken responses and grammatical/spelling errors in written responses), (ii) The discourse structure and/or organization of the response, (iii) Relevance of the response to the question that was asked.

E-learning is the synthesis of multimedia and social media platforms powered by Internet and mobile technologies. Great popularity of e-learning is encouraging governments and educational institutions to adopt and develop e-learning cultures in societies in general and universities in particular. In traditional e-learning systems, all components (agents and services) are tightly coupled into a single system. In this study, we propose a new architecture for e-learning with two subsystems, namely, e-learning and e-testing. The motivation of the research is to improve the effectiveness of the learning process by extracting relevant features for elastic learning and testing process. We employ a multi-agent system because it contains five-layer architecture, including agents at various levels. We also propose a novel method for updating content through question and answer between e-learners and intelligent agents. To achieve optimization, we design a system that applies various technologies, which M. Arif (B)· A. Karim · K. A. Alam · S. Farid · S. Iqbal Faculty of Computer Science and Information Technology, University of Malaya, 50603 Kuala Lumpur, Malaysia e-mail: arifmuhammad36@siswa.um.edu.my M. Arif · M. Illahi Departmnet of Computer Science, COMSATS Institute of Information Technology Islamabad, Islamabad, Pakistan S. Shamshirband Faculty of Computer Science and Information Technology, Department of Computer System and Technology, University of Malaya, 50603 Kuala Lumpur, Malaysia e-mail: shamshirband1396@gmail.com S. Shamshirband Department of Computer Science, Chalous Branch, Islamic Azad University (IAU), Chalous, 46615-397 Mazandaran, Iran Z. Buang Universiti Teknikal Malaysia Melaka, Hang Tuah Jaya, 76100 Durian Tunggal, Melaka, Malaysia V. E. Balas Department of Automation and Applied Informatics, University of Arad, 310130 Arad, Romania

Low bug report quality and human conflicts pose challenges to keep bug tracking systems productive. This work proposes to address these issues by applying game mechanisms to bug tracking systems. We investigate the use of game mechanisms in Stack Overflow, an online community organized to resolve computer programming related problems, for which the improvements we seek for bug tracking systems also turn out to be relevant. The results of our Stack Overflow investigation show that its game mechanisms could be used to address these issues by motivating contributors to increase contribution frequency and quality, by filtering useful contributions, and by creating an agile and dependable moderation system. We proceed by mapping these mechanisms to open-source bug tracking systems, and find that most benefits are applicable. Additionally, our results motivate tailoring a reward and reputation system and summarizing bug reports as future directions for increasing the benefits of game mechanisms in bug tracking systems.


Question: Learning representations that encompass the full semantic details of knowledge graphs.

Incorporating Multi-Step Relation Paths for Enhanced Representation Learning in Knowledge Graphs

Representation learning in knowledge graphs focuses on embedding both entities and relations within a reduced-dimensional space, facilitating various downstream tasks. Despite the success of current methods, they often overlook the significance of multi-step relation paths, which can provide valuable inference patterns linking entities. To address this gap, we introduce a novel path-based representation learning framework that integrates multi-step relation paths into the learning process. This framework tackles two primary challenges: (1) To handle the issue of varying reliability among relation paths, we propose a path-constraint resource allocation mechanism that accurately assesses the trustworthiness of each path. (2) We employ a semantic composition technique to represent relation paths, leveraging the embeddings of constituent relations. Our experimental evaluation on real-world datasets demonstrates the effectiveness of our approach, achieving substantial and consistent improvements over baseline methods in tasks such as knowledge base completion and relation extraction from textual data. For reproducibility and further research, the source code of our model is available at https://github.com/mrlyk423/relation_extraction.

This revised document maintains the length, complexity, and semantic style of the original while preserving its relationship to the question about representation learning with a complete semantic description of knowledge graphs. It introduces a new framework that specifically targets the incorporation of multi-step relation paths for enhanced representation learning, addressing the challenges of path reliability and semantic composition in a manner that is semantically similar to the original document.

For many domains, structured knowledge is in short supply, while unstructured text is plentiful. Knowledge Base Population (KBP) is the task of building or extending a knowledge base from text, and systems for KBP have grown in capability and scope. However, existing datasets for KBP are all limited by multiple issues: small in size, not open or accessible, only capable of benchmarking a fraction of the KBP process, or only suitable for extracting knowledge from title-oriented documents (documents that describe a particular entity, such as Wikipedia pages). We introduce and release CC-DBP, a web-scale dataset for training and benchmarking KBP systems. The dataset is based on Common Crawl as the corpus and DBpedia as the target knowledge base. Critically, by releasing the tools to build the dataset, we enable the dataset to remain current as new crawls and DBpedia dumps are released. Also, the modularity of the released tool set resolves a crucial tension between the ease that a dataset can be used for a particular subtask in KBP and the number of different subtasks it can be used to train or benchmark.

Ontologies play a prominent role on the Semantic Web. They make possible the widespread publication of machine understandable data, opening myriad opportunities for automated information processing. However, because of the Semantic Web's distributed nature, data on it will inevitably come from many different ontologies. Information processing across ontologies is not possible without knowing the semantic mappings between their elements. Manually finding such mappings is tedious, error-prone, and clearly not possible at the Web scale. Hence, the development of tools to assist in the ontology mapping process is crucial to the success of the Semantic Web.We describe glue, a system that employs machine learning techniques to find such mappings. Given two ontologies, for each concept in one ontology glue finds the most similar concept in the other ontology. We give well-founded probabilistic definitions to several practical similarity measures, and show that glue can work with all of them. This is in contrast to most existing approaches, which deal with a single similarity measure. Another key feature of glue is that it uses multiple learning strategies, each of which exploits a different type of information either in the data instances or in the taxonomic structure of the ontologies. To further improve matching accuracy, we extend glue to incorporate commonsense knowledge and domain constraints into the matching process. For this purpose, we show that relaxation labeling, a well-known constraint optimization technique used in computer vision and other fields, can be adapted to work efficiently in our context. Our approach is thus distinguished in that it works with a variety of well-defined similarity notions and that it efficiently incorporates multiple types of knowledge. We describe a set of experiments on several real-world domains, and show that glue proposes highly accurate semantic mappings.

We present a question answering system (CASIA@V2) over Linked Data (DBpedia), which translates natural language questions into structured queries automatically. Existing systems usually adopt a pipeline framework, which contains four major steps: 1) Decomposing the question and detecting candidate phrases; 2) mapping the detected phrases into semantic items of Linked Data; 3) grouping the mapped semantic items into semantic triples; and 4) generating the rightful SPARQL query. We present a jointly learning framework using Markov Logic Network(MLN) for phrase detection, phrases mapping to semantic items and semantic items grouping. We formulate the knowledge for resolving the ambiguities in three steps of QALD as first-order logic clauses in a MLN. We evaluate our approach on QALD-4 test dataset and achieve an F-measure score of 0.36, an average precision of 0.32 and an average recall of 0.40 over 50 questions.

SimpleQuestions is a commonly used benchmark for single-factoid question answering (QA) over Knowledge Graphs (KG). Existing QA systems rely on various components to solve different sub-tasks of the problem (such as entity detection, entity linking, relation prediction and evidence integration). In this work, we propose a different approach to the problem and present an information retrieval style solution for it. We adopt a two-phase approach: candidate generation and candidate re-ranking to answer questions. We propose a Triplet-Siamese-Hybrid CNN (TSHCNN) to re-rank candidate answers. Our approach achieves an accuracy of 80% which sets a new state-of-the-art on the SimpleQuestions dataset.

The semantic representation of individual word senses and concepts is of fundamental importance to several applications in Natural Language Processing. To date, concept modeling techniques have in the main based their representation either on lexicographic resources, such as WordNet, or on encyclopedic resources, such as Wikipedia. We propose a vector representation technique that combines the complementary knowledge of both these types of resource. Thanks to its use of explicit semantics combined with a novel cluster-based dimensionality reduction and an effective weighting scheme, our representation attains state-of-the-art performance on multiple datasets in two standard benchmarks: word similarity and sense clustering. We are releasing our vector representations at http://lcl.uniroma1.it/nasari/.

Wikipedia has been the primary source of information for many automatically-generated Semantic Web data sources. However, they suffer from incompleteness since they largely do not cover information contained in the unstructured texts of Wikipedia. Our goal is to extract structured entity-relationships in RDF from such unstructured texts, ultimately using them to enrich existing data sources. Our extraction technique is aimed to be topic-independent, leveraging grammatical dependency of sentences and semantic refinement. Preliminary evaluations of the proposed approach have shown some promising results.

We present a scalable approach for semi-supervised learning on graph-structured data that is based on an efficient variant of convolutional neural networks which operate directly on graphs. We motivate the choice of our convolutional architecture via a localized first-order approximation of spectral graph convolutions. Our model scales linearly in the number of graph edges and learns hidden layer representations that encode both local graph structure and features of nodes. In a number of experiments on citation networks and on a knowledge graph dataset we demonstrate that our approach outperforms related methods by a significant margin.

In this paper, we present an approach based on Ontology Learning and Natural Language Processing for automatic construction of expressive Ontologies, specifically in OWL DL with ALC expressivity, from a natural language text. The viability of our approach is demonstrated through the generation of descriptions of complex axioms from concepts defined by users and glossaries found at Wikipedia. We evaluated our approach in an experiment with entry sentences enriched with hierarchy axioms, disjunction, conjunction, negation, as well as existential and universal quantification to impose restriction of properties. The obtained results prove that our model is an effective solution for knowledge representation and automatic construction of expressive Ontologies. Thereby, it assists professionals involved in processes for obtain, construct and model knowledge domain.

Semantic parsing methods are used for capturing and representing semantic meaning of text. Meaning representation capturing all the concepts in the text may not always be available or may not be sufficiently complete. Ontologies provide a structured and reasoning-capable way to model the content of a collection of texts. In this work, we present a novel approach to joint learning of ontology and semantic parser from text. The method is based on semi-automatic induction of a context-free grammar from semantically annotated text. The grammar parses the text into semantic trees. Both, the grammar and the semantic trees are used to learn the ontology on several levels – classes, instances, taxonomic and non-taxonomic relations. The approach was evaluated on the first sentences of Wikipedia pages describing people.

We propose a general class of language models that treat reference as explicit stochastic latent variables. This architecture allows models to create mentions of entities and their attributes by accessing external databases (required by, e.g., dialogue generation and recipe generation) and internal state (required by, e.g. language models which are aware of coreference). This facilitates the incorporation of information that can be accessed in predictable locations in databases or discourse context, even when the targets of the reference may be rare words. Experiments on three representative applications show our model variants outperform models based on deterministic attention.


Question: Learning representations that encompass the full semantic details of knowledge graphs.

This paper presents an enhanced model, Transition-based Knowledge Graph Embedding with Relational Mapping Properties (TransM), designed to address the limitations of existing knowledge graph embedding methods. Knowledge graphs, characterized by a vast number of triplets—(head-entity, relationship, tail-entity)—form complex directed graphs with entities as nodes and relationships as edges. The discrete nature of these graphs poses challenges for their integration into AI applications that require continuous data for computation. To bridge this gap, TransM builds upon the success of TransE, a leading approach that models relationships as transitional vectors between entities, while addressing its shortcomings in handling diverse relational mapping properties.

TransM introduces a pre-calculation step to determine the unique weight of each training triplet based on its relational mapping property. This weight-adjustment mechanism allows the model to optimize its function for each triplet individually, catering to the specific characteristics of its mapping. Through comprehensive experimentation, TransM is compared against TransE and other state-of-the-art methods, showcasing its superior performance across various benchmark datasets. The results highlight TransM's capability to outperform previous models with a lower parameter complexity, akin to TransE, demonstrating its potential for enhancing knowledge computing in AI applications.

a r t i c l e i n f o a b s t r a c t We present an automatic approach to the construction of BabelNet, a very large, wide-coverage multilingual semantic network. Key to our approach is the integration of lexicographic and encyclopedic knowledge from WordNet and Wikipedia. In addition, Machine Translation is applied to enrich the resource with lexical information for all languages. We first conduct in vitro experiments on new and existing gold-standard datasets to show the high quality and coverage of BabelNet. We then show that our lexical resource can be used successfully to perform both monolingual and cross-lingual Word Sense Disambiguation: thanks to its wide lexical coverage and novel semantic relations, we are able to achieve state-of the-art results on three different SemEval evaluation tasks.

ABSTRACT Neural embeddings have been used with great success in Natural Language Processing (NLP). They provide compact representations that encapsulate word similarity and attain state-of-the-art performance in a range of linguistic tasks. The success of neural embeddings has prompted signi cant amounts of research into applications in domains other than language. One such domain is graph-structured data, where embeddings of vertices can be learned that encapsulate vertex similarity and improve performance on tasks including edge prediction and vertex labelling. For both NLP and graph based tasks, embeddings have been learned in highdimensional Euclidean spaces. However, recent work has shown that the appropriate isometric space for embedding complex networks is not the at Euclidean space, but negatively curved, hyperbolic space. We present a new concept that exploits these recent insights and propose learning neural embeddings of graphs in hyperbolic space. We provide experimental evidence that embedding graphs in their natural geometry signi cantly improves performance on downstream tasks for several real-world public datasets.

Many data such as social networks, movie preferences or knowledge bases are multi-relational, in that they describe multiple relations between entities. While there is a large body of work focused on modeling these data, modeling these multiple types of relations jointly remains challenging. Further, existing approaches tend to breakdown when the number of these types grows. In this paper, we propose a method for modeling large multi-relational datasets, with possibly thousands of relations. Our model is based on a bilinear structure, which captures various orders of interaction of the data, and also shares sparse latent factors across different relations. We illustrate the performance of our approach on standard tensor-factorization datasets where we attain, or outperform, state-of-the-art results. Finally, a NLP application demonstrates our scalability and the ability of our model to learn efficient and semantically meaningful verb representations.

We introduce a multi-task setup of identifying and classifying entities, relations, and coreference clusters in scientific articles. We create SCIERC, a dataset that includes annotations for all three tasks and develop a unified framework called Scientific Information Extractor (SCIIE) for with shared span representations. The multi-task setup reduces cascading errors between tasks and leverages cross-sentence relations through coreference links. Experiments show that our multi-task model outperforms previous models in scientific information extraction without using any domain-specific features. We further show that the framework supports construction of a scientific knowledge graph, which we use to analyze information in scientific literature.1

The semantic representation of individual word senses and concepts is of fundamental importance to several applications in Natural Language Processing. To date, concept modeling techniques have in the main based their representation either on lexicographic resources, such as WordNet, or on encyclopedic resources, such as Wikipedia. We propose a vector representation technique that combines the complementary knowledge of both these types of resource. Thanks to its use of explicit semantics combined with a novel cluster-based dimensionality reduction and an effective weighting scheme, our representation attains state-of-the-art performance on multiple datasets in two standard benchmarks: word similarity and sense clustering. We are releasing our vector representations at http://lcl.uniroma1.it/nasari/.

The gap between unstructured natural language and structured data makes it challenging to build a system that supports using natural language to query large knowledge graphs. Many existing methods construct a structured query for the input question based on a syntactic parser. Once the input question is parsed incorrectly, a false structured query will be generated, which may result in false or incomplete answers. The problem gets worse especially for complex questions. In this paper, we propose a novel systematic method to understand natural language questions by using a large number of binary templates rather than semantic parsers. As sufficient templates are critical in the procedure, we present a low-cost approach that can build a huge number of templates automatically. To reduce the search space, we carefully devise an index to facilitate the online template decomposition. Moreover, we design effective strategies to perform the two-level disambiguations (i.e., entity-level ambiguity and structure-level ambiguity) by considering the query semantics. Extensive experiments over several benchmarks demonstrate that our proposed approach is effective as it significantly outperforms state-of-the-art methods in terms of both precision and recall. PVLDB Reference Format: Weiguo Zheng, Jeffrey Xu Yu, Lei Zou, and Hong Cheng. Question Answering Over Knowledge Graphs: Question Understanding Via Template Decomposition. PVLDB, 11 (11): 1373-1386, 2018. DOI: https://doi.org/10.14778/3236187.3236192.

This paper proposes an item concept embedding (ICE) framework to model item concepts via textual information. Specifically, in the proposed framework there are two stages: graph construction and embedding learning. In the first stage, we propose a generalized network construction method to build a network involving heterogeneous nodes and a mixture of both homogeneous and heterogeneous relations. The second stage leverages the concept of neighborhood proximity to learn the embeddings of both items and words. With the proposed carefully designed ICE networks, the resulting embedding facilitates both homogeneous and heterogeneous retrieval, including item-to-item and word-to-item retrieval. Moreover, as a distributed embedding approach, the proposed ICE approach not only generates related retrieval results but also delivers more diverse results than traditional keyword-matching-based approaches. As our experiments on two real-world datasets show, ICE encodes useful textual information and thus outperforms traditional methods in various item classification and retrieval tasks.

We explore some of the practicalities of using random walk inference methods, such as the Path Ranking Algorithm (PRA), for the task of knowledge base completion. We show that the random walk probabilities computed (at great expense) by PRA provide no discernible benefit to performance on this task, so they can safely be dropped. This allows us to define a simpler algorithm for generating feature matrices from graphs, which we call subgraph feature extraction (SFE). In addition to being conceptually simpler than PRA, SFE is much more efficient, reducing computation by an order of magnitude, and more expressive, allowing for much richer features than paths between two nodes in a graph. We show experimentally that this technique gives substantially better performance than PRA and its variants, improving mean average precision from .432 to .528 on a knowledge base completion task using the NELL KB.

Words to express relations in natural language (NL) statements may be different from those to represen t properties in knowledge bases (KB). The vocabulary g p becomes barriers for knowledge base construction and retrieval. With the demo system called NL2KB in this paper, users can browse which properties in KB side may be mapped to for a given relati onal pattern in NL side. Besides, they can retrieve the sets of relational patterns in NL side for a given property in KB side. We describe how the mapping is established in detail. Although the mined patterns are used for Chinese knowledge base applications, t he methodology can be extended to other languages.

Learning a distinct representation for each sense of an ambiguous word could lead to more powerful and fine-grained models of vector-space representations. Yet while ‘multi-sense’ methods have been proposed and tested on artificial wordsimilarity tasks, we don’t know if they improve real natural language understanding tasks. In this paper we introduce a multisense embedding model based on Chinese Restaurant Processes that achieves state of the art performance on matching human word similarity judgments, and propose a pipelined architecture for incorporating multi-sense embeddings into language un-


Question: Learning representations that encompass the full semantic details of knowledge graphs.

This paper presents a semantic data integration method, coined FuhSen, designed for constructing knowledge graphs at query time by amalgamating data from diverse web sources. The transition from the Web of documents to the Web of services and data has significantly expanded the accessibility of information across various domains. Sources such as DBpedia, Wikidata, and specialized repositories like the Oxford Art archive, offer detailed insights into a multitude of entities, ranging from individuals and organizations to artistic works. However, these repositories employ disparate data representation methods and search functionalities, necessitating sophisticated data integration solutions to unify the presented data. FuhSen, a novel approach, adeptly integrates keyword and structured search capabilities from various web sources to generate on-demand knowledge graphs. These graphs comprehensively model the semantics of the amalgamated data, encapsulating entities that correspond to keyword queries and the relationships between them. FuhSen utilizes the Resource Description Framework (RDF) to semantically delineate the aggregated entities, and employs semantic similarity metrics to determine the relatedness of entities for effective merging. The paper evaluates the efficacy of FuhSen's data integration strategies using data from the DBpedia knowledge base. The empirical findings indicate that FuhSen's techniques accurately integrate semantically similar entities into cohesive knowledge graphs, demonstrating its potential for enhancing data integration in the semantic web.

Building neural networks to query a knowledge base (a table) with natural language is an emerging research topic in deep learning. An executor for table querying typically requires multiple steps of execution because queries may have complicated structures. In previous studies, researchers have developed either fully distributed executors or symbolic executors for table querying. A distributed executor can be trained in an end-to-end fashion, but is weak in terms of execution efficiency and explicit interpretability. A symbolic executor is efficient in execution, but is very difficult to train especially at initial stages. In this paper, we propose to couple distributed and symbolic execution for natural language queries, where the symbolic executor is pretrained with the distributed executor’s intermediate execution results in a step-by-step fashion. Experiments show that our approach significantly outperforms both distributed and symbolic executors, exhibiting high accuracy, high learning efficiency, high execution efficiency, and high interpretability.

Modeling human conversations is the essence for building satisfying chat-bots with multi-turn dialog ability. Conversation modeling will notably benefit from domain knowledge since the relationships between sentences can be clarified due to semantic hints introduced by knowledge. In this paper, a deep neural network is proposed to incorporate background knowledge for conversation modeling. Through a specially designed Recall gate, domain knowledge can be transformed into the extra global memory of Long Short-Term Memory (LSTM), so as to enhance LSTM by cooperating with its local memory to capture the implicit semantic relevance between sentences within conversations. In addition, this paper introduces the loose structured domain knowledge base, which can be built with slight amount of manual work and easily adopted by the Recall gate. Our model is evaluated on the context-oriented response selecting task, and experimental results on both two datasets have shown that our approach is promising for modeling human conversations and building key components of automatic chatting systems.

BACKGROUND
While representation learning techniques have shown great promise in application to a number of different NLP tasks, they have had little impact on the problem of ontology matching. Unlike past work that has focused on feature engineering, we present a novel representation learning approach that is tailored to the ontology matching task. Our approach is based on embedding ontological terms in a high-dimensional Euclidean space. This embedding is derived on the basis of a novel phrase retrofitting strategy through which semantic similarity information becomes inscribed onto fields of pre-trained word vectors. The resulting framework also incorporates a novel outlier detection mechanism based on a denoising autoencoder that is shown to improve performance.

RESULTS
An ontology matching system derived using the proposed framework achieved an F-score of 94% on an alignment scenario involving the Adult Mouse Anatomical Dictionary and the Foundational Model of Anatomy ontology (FMA) as targets. This compares favorably with the best performing systems on the Ontology Alignment Evaluation Initiative anatomy challenge. We performed additional experiments on aligning FMA to NCI Thesaurus and to SNOMED CT based on a reference alignment extracted from the UMLS Metathesaurus. Our system obtained overall F-scores of 93.2% and 89.2% for these experiments, thus achieving state-of-the-art results.

CONCLUSIONS
Our proposed representation learning approach leverages terminological embeddings to capture semantic similarity. Our results provide evidence that the approach produces embeddings that are especially well tailored to the ontology matching task, demonstrating a novel pathway for the problem.

Extracting relations is critical for knowledge base completion and construction in which distant supervised methods are widely used to extract relational facts automatically with the existing knowledge bases. However, the automatically constructed datasets comprise amounts of low-quality sentences containing noisy words, which is neglected by current distant supervised methods resulting in unacceptable precisions. To mitigate this problem, we propose a novel word-level distant supervised approach for relation extraction. We first build Sub-Tree Parse (STP) to remove noisy words that are irrelevant to relations. Then we construct a neural network inputting the subtree while applying the entity-wise attention to identify the important semantic features of relational words in each instance. To make our model more robust against noisy words, we initialize our network with a priori knowledge learned from the relevant task of entity classification by transfer learning. We conduct extensive experiments using the corpora of New York Times (NYT) and Freebase. Experiments show that our approach is effective and improves the area of Precision/Recall (PR) from 0.35 to 0.39 over the state-of-the-art work.

Semantic error detection and correction is an important task for applications such as fact checking, speech-to-text or grammatical error correction. Current approaches generally focus on relatively shallow semantics and do not account for numeric quantities. Our approach uses language models grounded in numbers within the text. Such groundings are easily achieved for recurrent neural language model architectures, which can be further conditioned on incomplete background knowledge bases. Our evaluation on clinical reports shows that numerical grounding improves perplexity by 33% and F1 for semantic error correction by 5 points when compared to ungrounded approaches. Conditioning on a knowledge base yields further improvements.

Semantic representations have long been argued as potentially useful for enforcing meaning preservation and improving generalization performance of machine translation methods. In this work, we are the first to incorporate information about predicate-argument structure of source sentences (namely, semantic-role representations) into neural machine translation. We use Graph Convolutional Networks (GCNs) to inject a semantic bias into sentence encoders and achieve improvements in BLEU scores over the linguistic-agnostic and syntaxaware versions on the English–German language pair.

Ontologies play a prominent role on the Semantic Web. They make possible the widespread publication of machine understandable data, opening myriad opportunities for automated information processing. However, because of the Semantic Web's distributed nature, data on it will inevitably come from many different ontologies. Information processing across ontologies is not possible without knowing the semantic mappings between their elements. Manually finding such mappings is tedious, error-prone, and clearly not possible at the Web scale. Hence, the development of tools to assist in the ontology mapping process is crucial to the success of the Semantic Web.We describe glue, a system that employs machine learning techniques to find such mappings. Given two ontologies, for each concept in one ontology glue finds the most similar concept in the other ontology. We give well-founded probabilistic definitions to several practical similarity measures, and show that glue can work with all of them. This is in contrast to most existing approaches, which deal with a single similarity measure. Another key feature of glue is that it uses multiple learning strategies, each of which exploits a different type of information either in the data instances or in the taxonomic structure of the ontologies. To further improve matching accuracy, we extend glue to incorporate commonsense knowledge and domain constraints into the matching process. For this purpose, we show that relaxation labeling, a well-known constraint optimization technique used in computer vision and other fields, can be adapted to work efficiently in our context. Our approach is thus distinguished in that it works with a variety of well-defined similarity notions and that it efficiently incorporates multiple types of knowledge. We describe a set of experiments on several real-world domains, and show that glue proposes highly accurate semantic mappings.

We present an unsupervised explainable vector embedding technique, called EVE, which is built upon the structure of Wikipedia. The proposed model defines the dimensions of a semantic vector representing a concept using human-readable labels, thereby it is readily interpretable. Specifically, each vector is constructed using the Wikipedia category graph structure together with the Wikipedia article link structure. To test the effectiveness of the proposed model, we consider its usefulness in three fundamental tasks: 1) intruder detection—to evaluate its ability to identify a non-coherent vector from a list of coherent vectors, 2) ability to cluster—to evaluate its tendency to group related vectors together while keeping unrelated vectors in separate clusters, and 3) sorting relevant items first—to evaluate its ability to rank vectors (items) relevant to the query in the top order of the result. For each task, we also propose a strategy to generate a task-specific human-interpretable explanation from the model. These demonstrate the overall effectiveness of the explainable embeddings generated by EVE. Finally, we compare EVE with the Word2Vec, FastText, and GloVe embedding techniques across the three tasks, and report improvements over the state-of-the-art.

Existing knowledge-based question answering systems often rely on small annotated training data. While shallow methods like relation extraction are robust to data scarcity, they are less expressive than the deep meaning representation methods like semantic parsing, thereby failing at answering questions involving multiple constraints. Here we alleviate this problem by empowering a relation extraction method with additional evidence from Wikipedia. We first present a neural network based relation extractor to retrieve the candidate answers from Freebase, and then infer over Wikipedia to validate these answers. Experiments on the WebQuestions question answering dataset show that our method achieves an F1 of 53.3%, a substantial improvement over the state-of-the-art.

Today's enterprises hold ever-growing amounts of public data, stemming from different organizational systems, such as development environments, CRM systems, business intelligence systems, and enterprise social media. This data unlocks rich and diverse information about entities, people, terms, and the relationships among them. A lot of insight can be gained through analyzing this knowledge graph, both by individual employees and by the organization as a whole. In this talk, I will review recent work done by the Social Technologies & Analytics group at IBM Research-Haifa to mine these relationships, represent them in a generalized model, and use the model for different aims within the enterprise, including social search [5], expertise location [1], social recommendation [2, 3], and network analysis [4].


Question: A method for learning representations that includes a full semantic description of knowledge graphs.

This paper introduces TransG, a groundbreaking generative model designed to tackle the complexity of multiple relation semantics within knowledge graph embedding. Knowledge graph embedding, a rapidly advancing field in artificial intelligence, seeks to represent abstract entities and their connections as vectors in a continuous space. TransG innovates by acknowledging that a single relation may embody diverse meanings, as evidenced by the entity pairs linked by related triples. The model's novelty lies in its ability to uncover hidden relational semantics and incorporate a blend of relation-specific component vectors to effectively represent fact triples. Notably, TransG marks the debut of a generative model in the domain of knowledge graph embedding, with a formal exploration of multiple relation semantics—a first in the field. Rigorous experimental evaluations affirm the superiority of TransG, showcasing significant advancements over established benchmarks.

We present a novel methodology involving mappings between different modes of semantic representations. We propose distributional semantic models as a mechanism for representing the kind of world knowledge inherent in the system of abstract symbols characteristic of a sophisticated community of language users. Then, motivated by insight from ecological psychology, we describe a model approximating affordances, by which we mean a language learner’s direct perception of opportunities for action in an environment. We present a preliminary experiment involving mapping between these two representational modalities, and propose that our methodology can become the basis for a cognitively inspired model of grounded language learning.

Label propagation is a powerful and flexible semi-supervised learning technique on graphs. Neural networks, on the other hand, have proven track records in many supervised learning tasks. In this work, we propose a training framework with a graph-regularised objective, namely Neural Graph Machines, that can combine the power of neural networks and label propagation. This work generalises previous literature on graphaugmented training of neural networks, enabling it to be applied to multiple neural architectures (Feed-forward NNs, CNNs and LSTM RNNs) and a wide range of graphs. The new objective allows the neural networks to harness both labeled and unlabeled data by: (a) allowing the network to train using labeled data as in the supervised setting, (b) biasing the network to learn similar hidden representations for neighboring nodes on a graph, in the same vein as label propagation. Such architectures with the proposed objective can be trained efficiently using stochastic gradient descent and scaled to large graphs, with a runtime that is linear in the number of edges. The proposed joint training approach convincingly outperforms many existing methods on a wide range of tasks (multi-label classification on social graphs, news categorization, document classification and semantic intent classification), with multiple forms of graph inputs (including graphs with and without node-level features) and using different types of neural networks. Work done during an internship at Google.

Existing neural semantic parsers mainly utilize a sequence encoder, i.e., a sequential LSTM, to extract word order features while neglecting other valuable syntactic information such as dependency graph or constituent trees. In this paper, we first propose to use the syntactic graph to represent three types of syntactic information, i.e., word order, dependency and constituency features. We further employ a graph-to-sequence model to encode the syntactic graph and decode a logical form. Experimental results on benchmark datasets show that our model is comparable to the state-ofthe-art on Jobs640, ATIS and Geo880. Experimental results on adversarial examples demonstrate the robustness of the model is also improved by encoding more syntactic information.

Distributional representations of words have been recently used in supervised settings for recognizing lexical inference relations between word pairs, such as hypernymy and entailment. We investigate a collection of these state-of-the-art methods, and show that they do not actually learn a relation between two words. Instead, they learn an independent property of a single word in the pair: whether that word is a “prototypical hypernym”.

Methods that use latent representations of data, such as matrix and tensor factorization or deep neural methods, are becoming increasingly popular for applications such as knowledge base population and recommendation systems. These approaches have been shown to be very robust and scalable but, in contrast to more symbolic approaches, lack interpretability. This makes debugging such models difficult, and might result in users not trusting the predictions of such systems. To overcome this issue we propose to extract an interpretable proxy model from a predictive latent variable model. We use a socalled pedagogical method, where we query our predictive model to obtain observations needed for learning a descriptive model. We describe two families of (presumably more) descriptive models, simple logic rules and Bayesian networks, and show how members of these families provide descriptive representations of matrix factorization models. Preliminary experiments on knowledge extraction from text indicate that even though Bayesian networks may be more faithful to a matrix factorization model than the logic rules, the latter are possibly more useful for interpretation and debugging.

Our inspiration comes from Nell (Never Ending Language Learning), a computer program running at Carnegie Mellon University to extract structured information from unstructured web pages. We consider the problem of semi-supervised learning approach to extract category instances (e.g. country(USA), city(New York)) from web pages, starting with a handful of labeled training examples of each category or relation, plus hundreds of millions of unlabeled web documents. Semisupervised approaches using a small number of labeled examples together with many unlabeled examples are often unreliable as they frequently produce an internally consistent, but nevertheless, incorrect set of extractions. We believe that this problem can be overcome by simultaneously learning independent classifiers in a new approach named Coupled Bayesian Sets algorithm, based on Bayesian Sets, for many different categories and relations (in the presence of an ontology defining constraints that couple the training of these classifiers). Experimental results show that simultaneously learning a coupled collection of classifiers for random 11 categories resulted in much more accurate extractions than training classifiers through original Bayesian Sets algorithm, Naive Bayes, BaS-all and Coupled Pattern Learner (the category extractor used in NELL).

In his book “Conceptual Spaces The Geometry of Thought”, Peter Gärdenfors [1] presents a pioneering theory for representing conceptual knowledge, the basic construct of human thinking and reasoning [4]. The conceptual level is not seen as an alternative to traditional approaches of knowledge representation in artificial intelligence, namely symbolic or subsymbolic methods. Instead, it is meant to complement both approaches. The book is highly recommendable and worth reading, as it does not only tackle many fundamental problems of knowledge representation such as grounding [3], concept formation and similarity comparisons [2], but also outlines novel and enlightening ideas how to overcome these. The book introduces the notion of a conceptual space as a framework for representing knowledge at the conceptual level. It is motivated by contrasting it to other levels of knowledge representation: The highest level, the symbolic level, conceptualizes the human brain as a computing device. Knowledge is represented based on a language consisting of a set of symbols. Logical operations can be performed on these symbols to infer new knowledge. Human reasoning is modeled as a symbol manipulation process. Classical, symbolic artificial intelligence does not very well support central cognitive processes such as the acquisition or formation of new concepts and similarity comparisons. The lowest level, the subsymbolic knowledge representation, is oriented towards the neuro-biological structure of the human brain. Concepts are implicitly represented via activation patterns within the neural network. Learning is modeled by modifying the activation of neurons. Explicit representation of knowledge and concepts is not possible. At the intersection between the symbolic and the subsymbolic level, Gärdenfors introduces the conceptual level. The theory of conceptual spaces is based on semantic spaces with a geometric structure: A conceptual space is formed by a set of quality dimensions. One or several quality dimensions model one domain. An important example used throughout the book is the color domain represented by the quality dimensions hue, saturation and brightness. Conceptual spaces have a cognitive foundation because domains can be grounded in qualities perceivable by the human sensory apparatus. Concepts are represented as conceptual regions described by their properties on the quality dimensions. The geometric structure of conceptual spaces makes it possible to determine distances and therefore provides an inherent similarity measure by taking the distance in the conceptual space as indicator of the semantic similarity. The notion of similarity is an important construct for modeling categorization and concept formation. Using similarity for reasoning can also reflect well the vagueness typical for human reasoning. The strong focus on the cognitive foundation makes the book particularly valuable. It contains many challenging claims which are related to various disciplines by giving evidence from a wide range of literature. This shows the huge and highly interdisciplinary background of the author. Unfortunately, Gärdenfors describes his theory only at a very abstract level and forbears from describing algorithms for the formalization of his theory. The realization of a computational model for conceptual spaces bears many practical problems which still have to be solved. Moreover, no empirical evidence is given for his pioneering, sometimes revolutionary ideas. However, these shortcomings should be considered as challenges to solve in the future. The target audience of the book is highly interdisciplinary: since Gärdenfors tackles the problem of cognitive knowledge representation from a psychologic and computer science perspective as well as from a philosophic, neuroscience and linguistic point of view, this book is worth reading for researchers from many different areas. It is required reading for researchers in cognitive science or artificial intelligence interested in knowledge representation. The book has a clear structure and is very well written. The convincing examples throughout the book illustrate the findings very well and make it easy to understand. Therefore I would also deem Gärdenfors’ book to be suitable for students as introducing literature to various problem fields in cognitive science. It gives readers from related areas the chance to look beyond one’s own nose and get to know an interdisciplinary way of thinking. The book certainly meets the expectations of the highly interdisciplinary research area cognitive science.

In this work, we study the problem of concept mining, which serves as the first step in transforming unstructured text into structured information, and supports downstream analytical tasks such as information extraction, organization, recommendation and search. Previous work mainly relies on statistical signals, existing knowledge bases, or predefined linguistic patterns. In this work, we propose a novel approach that mines concepts based on their occurrence contexts, by learning embedding vector representations that summarize the context information for each possible candidates, and use these embeddings to evaluate the concept's global quality and their fitness to each local context. Experiments over several real-world corpora demonstrate the superior performance of our method. A publicly available implementation is provided at https://github.com/kleeeeea/ECON.

Graph-structured data is important in modeling relationships between multiple entities, and can be used to represent states of the world as well as many data structures. Li et al. (2016) describe a model known as a Gated Graph Sequence Neural Network (GGS-NN) that produces sequences from graph-structured input. In this work I introduce the Gated Graph Transformer Neural Network (GGTNN), an extension of GGS-NNs that uses graph-structured data as an intermediate representation. The model can learn to construct and modify graphs in sophisticated ways based on textual input, and also to use the graphs to produce a variety of outputs. For example, the model successfully learns to solve almost all of the bAbI tasks (Weston et al., 2016), and also discovers the rules governing graphical formulations of a simple cellular automaton and a family of Turing machines.

Large knowledge bases (KBs) are useful in many tasks, but it is unclear how to integrate this sort of knowledge into “deep” gradient-based learning systems. To address this problem, we describe a probabilistic deductive database, called TensorLog, in which reasoning uses a differentiable process. In TensorLog, each clause in a logical theory is first converted into certain type of factor graph. Then, for each type of query to the factor graph, the message-passing steps required to perform belief propagation (BP) are “unrolled” into a function, which is differentiable. We show that these functions can be composed recursively to perform inference in non-trivial logical theories containing multiple interrelated clauses and predicates. Both compilation and inference in TensorLog are efficient: compilation is linear in theory size and proof depth, and inference is linear in database size and the number of message-passing steps used in BP. We also present experimental results with TensorLog and discuss its relationship to other first-order probabilistic logics.


Question: A learning approach for comprehensive semantic representation in knowledge graphs.

This paper introduces a novel approach to Representation Learning (RL) for Knowledge Graphs (KGs) that integrates the semantic richness of entity descriptions. Typically, RL methods in KGs have focused on the extraction of relational patterns from knowledge triples, which link entities through relations. However, these methods often overlook the detailed textual descriptions that accompany many entities in KGs. To address this gap, we propose an innovative RL method that leverages entity descriptions to enhance the representation learning process. Specifically, we employ two encoding strategies: a Continuous Bag-of-Words (CBOW) model and a Deep Convolutional Neural Network (DCNN) to capture the semantics embedded within entity descriptions. These encodings are then integrated with the learning process that utilizes both knowledge triples and descriptions to create comprehensive entity and relation representations. We assess the efficacy of our method through two critical tasks: knowledge graph completion and entity classification. Our experiments on real-world datasets demonstrate that our approach significantly outperforms baseline methods, particularly in zero-shot settings, where the system is required to generate representations for previously unseen entities based solely on their descriptions. This underscores the method's potential to enrich KGs with more nuanced and contextually informed representations. The implementation code for this research is publicly available at https://github.com/xrb92/DKRL, facilitating further exploration and adaptation by the research community.

Semantic Space is a pervasive computing infrastructure that exploits semantic Web technologies to support explicit representation, expressive querying, and flexible reasoning of contexts in smart spaces.

In web search, users queries are formulated using only few terms and term-matching retrieval functions could fail at retrieving relevant documents. Given a user query, the technique of query expansion (QE) consists in selecting related terms that could enhance the likelihood of retrieving relevant documents. Selecting such expansion terms is challenging and requires a computational framework capable of encoding complex semantic relationships. In this paper, we propose a novel method for learning, in a supervised way, semantic representations for words and phrases. By embedding queries and documents in special matrices, our model disposes of an increased representational power with respect to existing approaches adopting a vector representation. We show that our model produces high-quality query expansion terms. Our expansion increase IR measures beyond expansion from current word-embeddings models and well-established traditional QE methods.

To unlock the wealth of the healthcare data, we often need to link the real-world text snippets to the referred medical concepts described by the canonical descriptions. However, existing healthcare concept linking methods, such as dictionary-based and simple machine learning methods, are not effective due to the word discrepancy between the text snippet and the canonical concept description, and the overlapping concept meaning among the fine-grained concepts. To address these challenges, we propose a Neural Concept Linking (NCL) approach for accurate concept linking using systematically integrated neural networks. We call the novel neural network architecture as the COMposite AttentIonal encode-Decode neural network (COM-AID). COM-AID performs an encode-decode process that encodes a concept into a vector and decodes the vector into a text snippet with the help of two devised contexts. On the one hand, it injects the textual context into the neural network through the attention mechanism, so that the word discrepancy can be overcome from the semantic perspective. On the other hand, it incorporates the structural context into the neural network through the attention mechanism, so that minor concept meaning differences can be enlarged and effectively differentiated. Empirical studies on two real-world datasets confirm that the NCL produces accurate concept linking results and significantly outperforms state-of-the-art techniques.

DBpedia is a Semantic Web project aiming to extract structured data from Wikipedia articles. Due to the increasing number of resources linked to it, DBpedia plays a central role in the Linked Open Data community. Currently, the information contained in DBpedia is mainly collected from Wikipedia infoboxes, a set of subject-attribute-value triples that represents a summary of the Wikipedia page. These infoboxes are manually compiled by the Wikipedia contributors, and in more than 50% of the Wikipedia articles the infobox is missing. In this article, we use the distant supervision paradigm to extract the missing information directly from the Wikipedia article, using a Relation Extraction tool trained on the information already present in DBpedia. We evaluate our system on a data set consisting of seven DBpedia properties, demonstrating the suitability of the approach in extending the DBpedia coverage.

In recent years, there has been renewed interest in the NLP community in genuine language understanding and dialogue. Thus the long-standing issue of how the semantic content of language should be represented is reentering the communal discussion. This paper provides a brief “opinionated survey” of broadcoverage semantic representation (SR). It suggests multiple desiderata for such representations, and then outlines more than a dozen approaches to SR–some longstanding, and some more recent, providing quick characterizations, pros, cons, and some comments on imple-

We introduce a neural semantic parser which is interpretable and scalable. Our model converts natural language utterances to intermediate, domain-general natural language representations in the form of predicate-argument structures, which are induced with a transition system and subsequently mapped to target domains. The semantic parser is trained end-to-end using annotated logical forms or their denotations. We achieve the state of the art on SPADES and GRAPHQUESTIONS and obtain competitive results on GEOQUERY and WEBQUESTIONS. The induced predicate-argument structures shed light on the types of representations useful for semantic parsing and how these are different from linguistically motivated ones.1

We present a novel methodology involving mappings between different modes of semantic representations. We propose distributional semantic models as a mechanism for representing the kind of world knowledge inherent in the system of abstract symbols characteristic of a sophisticated community of language users. Then, motivated by insight from ecological psychology, we describe a model approximating affordances, by which we mean a language learner’s direct perception of opportunities for action in an environment. We present a preliminary experiment involving mapping between these two representational modalities, and propose that our methodology can become the basis for a cognitively inspired model of grounded language learning.

As part of the information fusion task we wish to automatically fuse information derived from the text extraction process with data from a structured knowledge base. This process will involve resolving, aggregating, integrating and abstracting information via the methodologies of Knowledge Representation and Reasoning into a single comprehensive description of an individual or event. This report surveys the key principles underlying research in the field of Knowledge Representation and Reasoning. It represents an initial step in deciding upon a Knowledge Representation and Reasoning system for our information fusion task. APPROVED FOR PUBLIC RELEASE

Purpose – With the development of systems and applications, the number of users interacting with databases has increased considerably. The relational database model is still considered as the most used model for data storage and manipulation. However, it doesn’t offer any semantic support for the stored data which can facilitate data access for users. Indeed, a large number of users are intimidated when retrieving data because they are non-technical or have little technical knowledge. To overcome this problem, researchers are continuously developing new techniques for Natural Language Interfaces to Databases (NLIDB). Nowadays, the usage of existing NLIDB’s is not wide-spread due to their deficiencies in understanding natural language queries. In this sense, this paper proposes a novel method for intelligent understanding of natural language queries using semantically enriched database sources. Design/Methodology/Approach – First a reverse engineering process is applied to extract relational database hidden semantics. In the second step, the extracted semantics are enriched further using a domain ontology. After this, all semantics are stored in the same relational database. The phase of processing natural language queries uses the stored semantics to generate a semantic-tree. Findings – The evaluation part of our work show the advantages of using a semantically enriched database source to understand natural language queries. Additionally, enriching a relational database has given more flexibility to understand contextual and synonymous words that may be used in a natural language query. Originality/value – Existing NLIDB’s aren’t yet a standard option for interfacing a relational database due their lack for understanding natural language queries. Indeed, the techniques used in the literature have their limits. This paper handles those limits by identifying natural language elements by their semantic nature in order to generate a semantic-tree. This last is a key solution toward intelligent understanding of natural language queries to relational databases.

In this paper, we present a model which incorporates biomedical knowledge graph, graph embedding and deep learning methods for literature-based discovery. Firstly, the relations between entities are extracted from biomedical abstracts and then a knowledge graph is constructed by using these obtained relations. Secondly, the graph embedding technologies are applied to convert the entities and relations in the knowledge graph into a low-dimensional vector space. Thirdly, a bidirectional Long Short-Term Memory network is trained based on the entity associations represented by the pre-trained graph embeddings. Finally, the learned model is used for open and closed literature-based discovery tasks. The experimental results show that our method could not only effectively discover hidden associations between entities, but also reveal the corresponding mechanism of interactions. It suggests that incorporating knowledge graph and deep learning methods is an effective way for capturing the underlying complex associations between entities hidden in the literature.


Question: CFD investigation of convective heat transfer coefficient on the exterior surfaces of buildings.

This paper offers a comprehensive review of Computational Fluid Dynamics (CFD) application in building performance simulation for outdoor environments, concentrating on four key areas: (1) the wind environment experienced by pedestrians around buildings, (2) wind-driven precipitation impacting building facades, (3) convective heat transfer coefficients at external surfaces of structures, and (4) dispersion of air pollutants in the vicinity of buildings. For each area, the paper discusses the context, the rationale for utilizing CFD, summarizes significant past CFD investigations, evaluates the accuracy, and suggests practical applications. It highlights that for these four domains, CFD presents significant advantages over traditional wind tunnel testing or (semi-)empirical methods by delivering intricate whole-flow field data under conditions that are completely controllable and devoid of similarity constraints. The primary constraints include the limitations of steady-state RANS (Reynolds-Averaged Navier-Stokes) modeling, the augmented complexity and computational cost associated with LES (Large Eddy Simulation), and the necessity for rigorous and time-consuming CFD solution verification and validation processes.

The improved ground resolution of state-of-the-art synthetic aperture radar (SAR) sensors suggests utilizing SAR data for the analysis of urban areas. The appearance of buildings in SAR or interferometric SAR (InSAR) data is characterized by the consequences of the inherent oblique scene illumination, such as layover, occlusion by radar shadow, and multipath signal propagation. Therefore, particularly in dense built-up areas, building reconstruction is often impossible from a single SAR or InSAR measurement alone. But, the reconstruction quality can be significantly improved by a combined analysis of multi-aspect data. In this paper, two approaches are proposed to detect and reconstruct buildings of different size from multi-aspect high-resolution InSAR data sets. Both approaches focus on the recognition of buildings supported by knowledge-based analysis considering the mentioned SAR-specific effects observed in urban areas. Building features are extracted independently for each direction from the magnitude and phase information of the interferometric data. Initial primitives are segmented and afterward projected from slant-range into the world coordinate system. From the fused set of primitives of both flight directions, building hypotheses are generated. The first approach exploits the frequently observed lines of bright double-bounce scattering, which are used for building reconstruction in residential districts. In the case of larger buildings, such as industrial halls, often additional features of roof and facade elements are visible. Therefore, in a second approach, extended buildings are extracted by grouping primitives of different kinds. The two approaches are demonstrated in an urban environment for an InSAR data set, which has spatial resolution of about 30 cm and was taken from two orthogonal flight directions.

This paper presents an automated classification of buildings in Coleraine, Northern Ireland. The classification was generated using very high spatial resolution data (10 cm) from a Digital Mapping Camera (DMC) for March 2009. The visible to near infrared (VNIR) bands of the DMC enabled a supervised classification to be performed to extract buildings from vegetation. A Digital Surface Model (DSM) was also created from the image to differentiate between buildings and other land classes with similar spectral profiles, such as roads. The supervised classification had the lowest classification accuracy (50%) while the DSM had an accuracy of 81%. The combination of the DSM and the supervised classification achieved an overall classification accuracy of 95%. Two spatial metrics (percentage of the landscape and number of patches) were also used to test the level of agreement between the classification and digitised building data. The results suggest that fine resolution multispectral aerial imagery can automatically detect buildings to a very high level of accuracy. Current space borne sensors, such as IKONOS and QuickBird, lag behind airborne sensors with VNIR bands provided at a much coarser spatial resolution (4m and 2.4m respectively). Techniques must be developed from current airborne sensors that can be applied to new space borne sensors in the future. The ability to generate DSMs from high resolution aerial imagery will afford new insights into the three-dimensional aspects of urban areas which will in turn inform future urban planning. (Received 19th August 2010; Revised 26th January 2011; Accepted 9th February 2011) ISSN 1744-5647 doi:10.4113/jom.2011.1152 51 Journal of Maps, 2011, 51-59 McNally, A.J.D. & McKenzie, S.J.P.

We have investigated the effectiveness of heating conductive plates by induction in low frequencies analytically and numerically, in relation to the shape of the plate, the area of the region exposed to the magnetic flux, and the position of the exposed region with respect to the center of the plate. We considered both uniform and nonuniform magnetic fields. For plates with equivalent area exposed to the same uniform magnetic flux, the one with the most symmetrical shape is heated most effectively. If a coil is employed for the excitation, the results depend on the shape of the plate, the shape of the coil section, and the coil lift-off. When only the central region of a plate is exposed to a variable magnetic flux, there is a specific value of the exposed area for which the power dissipated in the plate material reaches a maximum. The most effective heating of a plate partially exposed occurs when the axis of the exciting coil is at the plate center.


Question: CFD investigation of convective heat transfer coefficient on the exterior surfaces of structures.

This investigation delves into the microclimate of a specific urban setting, the street canyon, focusing on its relationship with geometric parameters. Utilizing the ANSYS-Fluent commercial finite volumes code for numerical simulations, the study maps the flow dynamics within an urban context, considering three distinct height-to-width (H/W) aspect ratios. This exploration is crucial for understanding urban microclimates and the heat transfer dynamics between buildings and their surroundings. The assessment of fluid dynamics on vertical cross-sections within the canyon reveals the pivotal role of geometric configuration, particularly the H/W ratio, in shaping the microclimate. This topic is of significant relevance in the context of Smart Cities, where the street canyon is viewed as an integral subsystem of the larger urban fabric, influenced by broader climate change impacts.

**Question**: An Examination of the Role of Artificial Intelligence in Enhancing Cybersecurity

**Documents**: The Impact of Machine Learning on Network Intrusion Detection Systems
This paper presents a comprehensive review of the impact of machine learning (ML) techniques on network intrusion detection systems (NIDS). ML algorithms have been widely applied in the development of NIDS due to their ability to detect anomalies and patterns that may indicate malicious activity. The review covers various ML models, including decision trees, support vector machines, and neural networks, and discusses their effectiveness in detecting different types of cyber-attacks. It also highlights the challenges and limitations of ML-based NIDS, such as overfitting and the need for large, labeled datasets for training. The paper concludes with a discussion on future research directions and potential improvements in the application of ML to NIDS.

**Similar Documents**: This document offers an in-depth analysis of how machine learning (ML) methodologies are revolutionizing network intrusion detection systems (NIDS). ML algorithms have become indispensable in NIDS due to their proficiency in recognizing anomalies and patterns suggestive of cyber threats. The review encompasses a broad spectrum of ML models, such as decision trees, support vector machines, and neural networks, assessing their efficacy in identifying diverse cyber-attack scenarios. It also scrutinizes the hurdles and constraints faced by ML-driven NIDS, including the risks of overfitting and the necessity for extensive, labeled datasets for training purposes. The document culminates with an exploration of forthcoming research avenues and potential enhancements in the integration of ML within NIDS frameworks.

In this study, a new metaheuristic optimization algorithm, called cuckoo search (CS), is introduced for solving structural optimization tasks. The new CS algorithm in combination with Lévy flights is first verified using a benchmark nonlinear constrained optimization problem. For the validation against structural engineering optimization problems, CS is subsequently applied to 13 design problems reported in the specialized literature. The performance of the CS algorithm is further compared with various algorithms representative of the state of the art in the area. The optimal solutions obtained by CS are mostly far better than the best solutions obtained by the existing methods. The unique search features used in CS and the implications for future research are finally discussed in detail.

In pursuing higher power density power electronic equipment, the copper clip bonding concept is one of the double-sided cooling approaches under investigation for power semiconductors. This paper presents a comprehensive thermal assessment of the copper clip concept by undertaking comparative studies on one bespoke copper-clip-bonded IGBT power module and a conventional wire-bonded counterpart. A series of single-sided cooling tests and double-sided cooling tests have been undertaken on these two modules. Reductions are reported in the junction to case thermal resistance of up to 23% for one individual die and around 18% for the parallel operation of two dies in the single-sided cooling tests. Whilst in the double-sided cooling experiments, an additional average 18% thermal improvement is achieved due to the addition of a top fan-cooled heatsink mounted onto the copper clip. The results show clearly that the copper clip technology could provide significant benefits in the heat removal for power semiconductors and enable more power dense equipment.


Question: CFD investigation of convective heat transfer coefficient on the external surfaces of structures.

This guideline document serves as a reference for best practices in conducting Computational Fluid Dynamics (CFD) simulations for urban flow analysis. It is important to note that neither the COST Office nor any individual representing the COST Office assumes liability for the application of the information provided in this publication. The COST Office does not take responsibility for the content of external websites mentioned herein. Reproduction or utilization of the material in this book is permitted without specific permission, except for copyrighted images, diagrams, or other content, for which the consent of the respective copyright holders is required. The document may be cited using the title of the book and the associated Action Number, providing a clear and accurate reference for academic and professional use in the field of urban environmental studies and CFD simulation techniques.


Question: CFD examination of the convective heat transfer coefficient on the external surfaces of structures.

The Role of Urban Physics in Assessing Microclimate Impacts on Comfort, Health, and Energy Consumption in Urban Areas

Abstract

The increasing urbanization trend globally has led to a heightened interest in investigating the modifications to urban climates, particularly the heat island effect and its implications on building energy use. Additionally, the areas of urban comfort, health, and durability, encompassing pedestrian wind and thermal comfort, pollutant dispersion, and wind-driven rain, are critical. Urban Physics, as a well-established field, integrates various scientific disciplines including physics, environmental chemistry, aerodynamics, meteorology, and statistics, positioning it to offer significant insights into contemporary urban issues and challenges. This paper explores the pivotal role of Urban Physics in examining wind comfort, thermal comfort, energy demand, pollutant dispersion, and wind-driven rain. It also discusses the three primary research methods utilized in Urban Physics: field experiments, wind tunnel experiments, and numerical simulations. Case studies are presented to highlight the current challenges and the valuable contributions of Urban Physics to addressing these issues. © 2012. Higher Education Press Limited Company. Production and hosting by Elsevier B.V. Open access under CC BY-NC-ND license.

The aim of this paper is to analyze the influence of the models proposed for representing overhead transmission lines in lightning calculations. A full model of a transmission line for lightning overvoltage calculations can be split into several parts: wires (shield wires and phase conductors), towers, footing impedances and insulators. An additional component, the arrester, should be added if the study is aimed at selecting the arrester ratings needed to achieve a given performance of the line. This paper presents a sensitivity study whose main goal is to determine the effect that the model and the parameters selected for representing the main parts of a transmission line can have on the flashover rate.


Question: CFD examination of the convective heat transfer coefficient on the external surfaces of buildings.

In the realm of computational engineering and physics, the critical evaluation of confidence in modeling and simulation outcomes is paramount for code developers, analysts, and decision-makers alike. A pivotal aspect in this regard is the process of Verification and Validation (V&V), which serves as the cornerstone for establishing and quantifying the reliability of computational simulations. Verification focuses on the accuracy of the solution derived from a computational model, ensuring that the mathematical model is correctly and accurately solved by the software. This step does not concern itself with the model's relevance to the real world. Conversely, Validation involves comparing computational simulations with experimental data to assess the model's accuracy in representing real-world phenomena, thus bridging the gap between computational predictions and empirical observations.

This distinction is crucial for establishing the credibility of computational analyses, particularly in complex engineering problems such as the Computational Fluid Dynamics (CFD) analysis of convective heat transfer coefficients on external surfaces of buildings. Ensuring that the computational model accurately captures the physical phenomena of interest (Verification) and that it reflects real-world behavior (Validation) is essential for reliable predictions and informed decision-making in architectural and engineering designs. The rigorous application of V&V procedures not only enhances the trustworthiness of simulation results but also facilitates the development of predictive capabilities that can be confidently applied to various engineering challenges.

Reducing the energy consumption and associated greenhouse gas emissions of urban areas is paramount in research and practice, encompassing strategies to both reduce energy consumption and carbon intensity in both energy supply and demand. Most methods focus on one of these two approaches but few integrate decisions for supply and demand simultaneously. This paper presents a novel model that endogenously simulates energy supply and demand at a district scale on an hourly time scale. Demand is specified for a variety of building uses, and losses and municipal loads are calculated from the number of buildings in the district. Energy supply is modeled using technology-specific classes, allowing easy addition of specific equipment or types of energy generation. Standard interfaces allow expansion of the model to include new types of energy supply and demand. The model can be used for analysis of a single design alternative or optimization over a large design space, allowing exploration of various densities, mixes of uses, and energy supply technologies. An example optimization is provided for a community near San Francisco, California. This example uses 21 building types, 32 combined heat and power engines, and 16 chillers. The results demonstrate the ability to compare performance tradeoffs and optimize for three objectives: life cycle cost, annual carbon dioxide emissions, and overall system

related to the prediction of the air temperature in the region of Meknes in Morocco. Depending on weather parameters, such as atmospheric pressure (Pr), humidity (H), visibility (Vis), wind speed (V), dew point (Tr) and the precipitation (P). The database used contains a history of meteorological parameters covering 3288 days, from 2004 to 2012. This multilayer perceptron type of neuron (MLP) was used to approximate the relationship between these parameters with minimum square error. For a better air temperature prediction, we developed a stochastic neural model. The mean square error (MSE) and the correlation coefficient (R) were used to evaluate the performance of the developed models. The study of these statistical indicators demonstrated that the prediction of the air temperature was powerful with the Levenberg-Marquard algorithm, with architecture [610-1], the Tansig function in the hidden layer and the Purelin function in the output layer.