TEEDA: An Interactive Platform for Matching Data Providers and Users in the Data Marketplace
Improvements in Web platforms for data exchange and trading are creating more opportunities for users to obtain data from data providers of different domains.
Teruaki Hayashi, Yukio Ohsawa
doaj +1 more source
The ecological connectivity of whale shark aggregations in the Indian Ocean: a photo-identification approach [PDF]
Genetic and modelling studies suggest that seasonal aggregations of whale sharks (Rhincodon typus) at coastal sites in the tropics may be linked by migration.
Samantha Andrzejaczek +6 more
doaj +1 more source
A Large Scale Dataset for the Evaluation of Ontology Matching Systems [PDF]
Recently, the number of ontology matching techniques and systems has increased significantly. This makes the issue of their evaluation and comparison more severe.
Avesani, Paolo +3 more
core
Efficient Online Timed Pattern Matching by Automata-Based Skipping
The timed pattern matching problem is an actively studied topic because of its relevance in monitoring of real-time systems. There one is given a log $w$ and a specification $\mathcal{A}$ (given by a timed word and a timed automaton in this paper), and ...
A Kane +22 more
core +1 more source
Sickle Cell Disease Is an Inherent Risk for Asthma in a Sibling Comparison Study
ABSTRACT Introduction Sickle cell disease (SCD) and asthma share a complex relationship. Although estimates vary, asthma prevalence in children with SCD is believed to be comparable to or higher than the general population. Determining whether SCD confers an increased risk for asthma remains challenging due to overlapping symptoms and the ...
Suhei C. Zuleta De Bernardis +9 more
wiley +1 more source
A Distributed and Context-Aware Task Assignment Mechanism for Collaborative Mobile Edge Computing
Mobile edge computing (MEC) is an emerging technology that leverages computing, storage, and network resources deployed at the proximity of users to offload their delay-sensitive tasks.
Bo Gu +4 more
doaj +1 more source
Algoritma matching bobot maskimum dalam graph bipartit komplit berboto [PDF]
ABSTRAK Suatu matching dalam graph G adalah subgraph 1-regular pada G yang disebabkan oleh kumpulan dart pasangan garis yang tidak adjacent. Suatu matching merupakan matching maksimum bila matching tersebut mempunyai harga pokok maksimum. Matching dalam
Astuti , Yani Parti
core
Counting Popular Matchings in House Allocation Problems
We study the problem of counting the number of popular matchings in a given instance. A popular matching instance consists of agents A and houses H, where each agent ranks a subset of houses according to their preferences.
C.T.S. Sng +8 more
core +1 more source
A Decomposition Theorem for Maximum Weight Bipartite Matchings [PDF]
Let G be a bipartite graph with positive integer weights on the edges and without isolated nodes. Let n, N and W be the node count, the largest edge weight and the total weight of G. Let k(x,y) be log(x)/log(x^2/y). We present a new decomposition theorem
Kao, Ming-Yang +3 more
core +3 more sources
Psychosocial Outcomes in Patients With Endocrine Tumor Syndromes: A Systematic Review
ABSTRACT Introduction The combination of disease manifestations, the familial burden, and varying penetrance of endocrine tumor syndromes (ETSs) is unique. This review aimed to portray and summarize available data on psychosocial outcomes in patients with ETSs and explore gaps and opportunities for future research and care.
Daniël Zwerus +6 more
wiley +1 more source

