253,057 research outputs found
Multimodal Convolutional Neural Networks for Matching Image and Sentence
In this paper, we propose multimodal convolutional neural networks (m-CNNs)
for matching image and sentence. Our m-CNN provides an end-to-end framework
with convolutional architectures to exploit image representation, word
composition, and the matching relations between the two modalities. More
specifically, it consists of one image CNN encoding the image content, and one
matching CNN learning the joint representation of image and sentence. The
matching CNN composes words to different semantic fragments and learns the
inter-modal relations between image and the composed fragments at different
levels, thus fully exploit the matching relations between image and sentence.
Experimental results on benchmark databases of bidirectional image and sentence
retrieval demonstrate that the proposed m-CNNs can effectively capture the
information necessary for image and sentence matching. Specifically, our
proposed m-CNNs for bidirectional image and sentence retrieval on Flickr30K and
Microsoft COCO databases achieve the state-of-the-art performances.Comment: Accepted by ICCV 201
Deep Fragment Embeddings for Bidirectional Image Sentence Mapping
We introduce a model for bidirectional retrieval of images and sentences
through a multi-modal embedding of visual and natural language data. Unlike
previous models that directly map images or sentences into a common embedding
space, our model works on a finer level and embeds fragments of images
(objects) and fragments of sentences (typed dependency tree relations) into a
common space. In addition to a ranking objective seen in previous work, this
allows us to add a new fragment alignment objective that learns to directly
associate these fragments across modalities. Extensive experimental evaluation
shows that reasoning on both the global level of images and sentences and the
finer level of their respective fragments significantly improves performance on
image-sentence retrieval tasks. Additionally, our model provides interpretable
predictions since the inferred inter-modal fragment alignment is explicit
Similarity and bisimilarity notions appropriate for characterizing indistinguishability in fragments of the calculus of relations
Motivated by applications in databases, this paper considers various
fragments of the calculus of binary relations. The fragments are obtained by
leaving out, or keeping in, some of the standard operators, along with some
derived operators such as set difference, projection, coprojection, and
residuation. For each considered fragment, a characterization is obtained for
when two given binary relational structures are indistinguishable by
expressions in that fragment. The characterizations are based on appropriately
adapted notions of simulation and bisimulation.Comment: 36 pages, Journal of Logic and Computation 201
Boolean Dependence Logic and Partially-Ordered Connectives
We introduce a new variant of dependence logic called Boolean dependence
logic. In Boolean dependence logic dependence atoms are of the type
=(x_1,...,x_n,\alpha), where \alpha is a Boolean variable. Intuitively, with
Boolean dependence atoms one can express quantification of relations, while
standard dependence atoms express quantification over functions.
We compare the expressive power of Boolean dependence logic to dependence
logic and first-order logic enriched by partially-ordered connectives. We show
that the expressive power of Boolean dependence logic and dependence logic
coincide. We define natural syntactic fragments of Boolean dependence logic and
show that they coincide with the corresponding fragments of first-order logic
enriched by partially-ordered connectives with respect to expressive power. We
then show that the fragments form a strict hierarchy.Comment: 41 page
Begin, After, and Later: a Maximal Decidable Interval Temporal Logic
Interval temporal logics (ITLs) are logics for reasoning about temporal
statements expressed over intervals, i.e., periods of time. The most famous ITL
studied so far is Halpern and Shoham's HS, which is the logic of the thirteen
Allen's interval relations. Unfortunately, HS and most of its fragments have an
undecidable satisfiability problem. This discouraged the research in this area
until recently, when a number non-trivial decidable ITLs have been discovered.
This paper is a contribution towards the complete classification of all
different fragments of HS. We consider different combinations of the interval
relations Begins, After, Later and their inverses Abar, Bbar, and Lbar. We know
from previous works that the combination ABBbarAbar is decidable only when
finite domains are considered (and undecidable elsewhere), and that ABBbar is
decidable over the natural numbers. We extend these results by showing that
decidability of ABBar can be further extended to capture the language
ABBbarLbar, which lays in between ABBar and ABBbarAbar, and that turns out to
be maximal w.r.t decidability over strongly discrete linear orders (e.g. finite
orders, the naturals, the integers). We also prove that the proposed decision
procedure is optimal with respect to the complexity class
Join Execution Using Fragmented Columnar Indices on GPU and MIC
The paper describes an approach to the parallel natural join execution on computing clusters with GPU and MIC Coprocessors. This approach is based on a decomposition of natural join relational operator using the column indices and domain-interval fragmentation. This decomposition admits parallel executing the resource-intensive relational operators without data transfers. All column index fragments are stored in main memory. To process the join of two relations, each pair of index fragments corresponding to particular domain interval is joined on a separate processor core. Described approach allows efficient parallel query processing for very large databases on modern computing cluster systems with many-core accelerators. A prototype of the DBMS coprocessor system was implemented using this technique. The results of computational experiments for GPU and Xeon Phi are presented. These results confirm the efficiency of proposed approach
How are particle production, nucleon emission and target fragment evaporation processes interrelated in hadron-nucleus collisions?
Relations between particle production, nucleon emission, and fragment evaporation processes were searched for in hadron-nucleus collisions. It was stated that: (1) the nucleon emission and target fragment evaporation proceed independently of the particle production process; and (2) relation between multiplicities of the emitted protons and of the evaporated charged fragments is expressed by simple formula
Thermodynamic interpretation of the uniformity of the phase space probability measure
Uniformity of the probability measure of phase space is considered in the
framework of classical equilibrium thermodynamics. For the canonical and the
grand canonical ensembles, relations are given between the phase space
uniformities and thermodynamic potentials, their fluctuations and correlations.
For the binary system in the vicinity of the critical point the uniformity is
interpreted in terms of temperature dependent rates of phases of well defined
uniformities. Examples of a liquid-gas system and the mass spectrum of nuclear
fragments are presented.Comment: 11 pages, 2 figure
- …