Inferring User Goals from Sets of Independent Queries in a Multidatabase Environment

2010-01-01

Suggestions

Enriching ebXML registries with OWL ontologies for efficient service discovery
Doğaç, Asuman; Kabak, Y; Laleci, GB (2004-03-29)
Web services, like their real life counterparts have several properties and thus truly useful semantic information can only be defined through standard ontology languages. Semantic Web is an important initiative in this respect. However although service registries are the major mechanisms to discover services, the semantic support provided by service registries is completely detached from the Semantic Web effort.
Large scale prediction of protein domain functions using shared annotations
Ulusoy, Erva; Doğan, Tunca (Orta Doğu Teknik Üniversitesi Enformatik Enstitüsü; 2022-10)
Discovering the unknown functions of proteins is a major step toward understanding how biological processes work. The expensive and time-consuming nature of wet-lab experimental approaches prompted researchers to develop computational strategies for biomolecular function identification. The main idea behind these approaches, let it be network analysis- or machine learning-based, is that annotations can be transferred among proteins sharing similar characteristics (e.g., sequence, structure, protein-protein ...
Simulating probabilistic sampling on particle populations to assess the threshold sample sizes for particle size distributions
Camalan, Mahmut (Informa UK Limited, 2020-07-01)
The primary objective in sampling is to acquire the smallest sample as a reliable estimate of a particle population. This study aims to assess the threshold (minimum) sample sizes for reliable estimation of particle size distributions. For that purpose, samples were simulated from particle populations artificially generated from the Gates-Gaudin-Schumann model. Then, two-sample Kolmogorov-Smirnov and Chi-Square Goodness-of-Fit tests were implemented between the number-weighted size distributions of samples ...
Probabilistic programming models for traffic incident management operations planning
Ozbay, Kaan; İyigün, Cem; Baykal-Gursoy, Melike; XİAO, Weihua (2013-03-01)
This paper proposes mathematical programming models with probabilistic constraints in order to address incident response and resource allocation problems for the planning of traffic incident management operations. For the incident response planning, we use the concept of quality of service during a potential incident to give the decision-maker the flexibility to determine the optimal policy in response to various possible situations. An integer programming model with probabilistic constraints is also propos...
A DYNAMIC NETWORK REPRESENTATION OF FMRI FOR MODELING AND ANALYZING THE PROBLEM SOLVING TASK
Alchihabi, Abdullah; Kivilicim, Baran B.; Newman, Sharlene D.; Yarman Vural, Fatoş Tunay (2018-04-07)
Tower of London (TOL) is a classic problem solving task to study high-level cognitive processes. In this paper, using the TOL experiment, we aim to investigate the activation and relations of anatomic regions during the planning and execution phases of the problem solving task. We propose a dynamic sparse network representation estimated from the fMRI brain volumes at all time instances. This representation, called Dynamic Mesh Network, enables us to analyze the network properties of the brain under plannin...
Citation Formats
A. C. Acar, Inferring User Goals from Sets of Independent Queries in a Multidatabase Environment. 2010, p. 243.