Video Question Answering (VideoQA), aiming to correctly answer a given question based on understanding multimodal video content, is challenging due the richness of content. From perspective understanding, complete VideoQA framework needs understand content at different semantic levels and flexibly integrate diverse distill question-related To this end, we propose Lightweight Visual-Linguistic R...

Java projects are often built on top of various third-party libraries. If multiple versions a library exist the classpath, JVM will only load one version and shadow others, which we refer to as dependency conflicts . This would give rise semantic conflict (SC) issues, if APIs referenced by project have identical method signatures but inconsistent semantics across loaded shadowed S...

this research titeled (semantic change in the quranic words: praise prophet reverence) this study is about how to transform from the meaning to another. in this article we looked lexical and semantic meaning of three words of quran in pre-islamic era until the end of sending quran. we studied the influence of islam in changing word semantically. islam does not bring new words but added them new...

semantic shifting which is one of the most important semantic processes forming the meaning of some linguistic structures was first introduced by safavi (1379). the meaning of different structures such as proverbs, are made by semantic shifting which takes place on the syntagmatic axis, but is shown on the paradigmatic axis. the corpus used in this study consists of 10 persian proverbs which ar...

Knowledge unit (KU) is the smallest integral knowledge object in a given domain. Knowledge unit relation recognition is to discover implicit relations among KUs, which is a crucial problem in information extraction. This paper proposes a knowledge unit relation recognition framework based on Markov Logic Networks, which combines probabilistic graphical models and first-order logic by attaching ...

Both the quality of the results of TEX s formula layout algorithm and the complexity of its description in the TEXbook are hard to beat The algorithm is verbally described as an imperative program with very complex control ow and complicated manipulations of the data structures representing formulae In a forthcoming textbook we describe TEX s formula layout algorithm as a functional program tra...

A recalcitrant problem in approaches to iterated belief revision is that, after first revising by a formula and then by a formula that is inconsistent with the first formula, all information in the original formula is lost. As noted by various researchers, this phenomenon is made explicit in the second postulate (C2) of the well-known Darwiche-Pearl framework, and so this postulate has been a p...

This paper describes a model of the choice of modal verbs and modal particles. The choice mechanism does not require a modality-specific input as, e.g., a modal logical formula. Instead semantic (modal force) and pragmatic constraints (speech act marking) are applied to the available information on the whole and constrain the set of modal candidates to those that are appropriate in the respecti...