Search results for "assignment"
showing 10 items of 101 documents
A cardiovascular educational intervention for primary care professionals in Spain: positive impact in a quasi-experimental study
2015
Background Routine general practice data collection can help identify patients at risk of cardiovascular disease. Aim To determine whether a training programme for primary care professionals improves the recording of cardiovascular disease risk factors in electronic health records. Design and setting A quasi-experimental study without random assignment of professionals. This was an educational intervention study, consisting of an online-classroom 1-year training programme, and carried out in the Valencian community in Spain. Method The prevalence rates of recording of cardiovascular factors (recorded every 6 months over a 4-year period) were compared between intervention and control group. …
Treating cockroach phobia using a serious game on a mobile phone and augmented reality exposure: A single case study
2011
In vivo exposure has proved its efficacy in the treatment of specific phobias; however, not all patients benefit from it. Communication and information technologies such as Virtual Reality (VR) and Augmented Reality (AR) have improved exposure treatment adherence and acceptance. Serious games (SG) could also be used in order to facilitate exposure treatment. A line of research on SG is emerging which focuses on health issues. We have developed a SG for the treatment of cockroach phobia that uses a mobile phone as the application device. This work examines results of an N = 1 study about whether the use of this mobile game can facilitate treatment of this specific phobia preparing her for th…
Identification of breed informative single nucleotide polymorphisms for assigning individual in Sicilian dairy sheep
2015
Assignment tests using genetic information to establish population membership of individuals, provide the most direct methods to determine the population of origin of unknown individuals. The identification of the breed or population of origin of individuals potentially offers unbiased tools in livestock and is useful in a variety of biological contexts. The aim of this study was to identify the minimum number of informative SNPs from highthroughput genotyping data in Sicilian dairy sheep breeds, and to investigate their usefulness for breed assignment purposes. Individuals of Valle del Belice (48), Comisana (48) and Pinzirita (53) sheep breeds were genotyped using Illumina OvineSNP50K Geno…
e-Fair: Aggregation in e-Commerce for Exploiting Economies of Scale
2017
In recent years, many new and interesting models of successful online business have been developed, including competitive models such as auctions, where the product price tends to rise, and group-buying, where users cooperate obtaining a dynamic price that tends to go down. We propose the e-fair as a business model for social commerce, where both sellers and buyers are grouped to maximize benefits. e-Fairs extend the group-buying model aggregating demand and supply for price optimization as well as consolidating shipments and optimize withdrawals for guaranteeing additional savings. e-Fairs work upon multiple dimensions: time to aggregate buyers, their geographical distribution, price/quant…
Radio k-Labelings for Cartesian Products of Graphs
2005
International audience; Frequency planning consists in allocating frequencies to the transmitters of a cellular network so as to ensure that no pair of transmitters interfere. We study the problem of reducing interference by modeling this by a radio k-labeling problem on graphs: For a graph G and an integer k ≥ 1, a radio k-labeling of G is an assignment f of non negative integers to the vertices of G such that |f(x)−f(y)| ≥ k+1−dG(x,y), for any two vertices x and y, where dG(x,y) is the distance between x and y in G. The radio k-chromatic number is the minimum of max{f(x)−f(y):x,y ∈ V(G)} over all radio k-labelings f of G. In this paper we present the radio k-labeling for the Cartesian pro…
Cotas inferiores para el QAP-Arbol
1985
The Tree-QAP is a special case of the Quadratic Assignment Problem where the flows not equal zero form a tree. No condition is required for the distance matrix. In this paper we present an integer programming formulation for the Tree-QAP. We use this formulation to construct four Lagrangean relaxations that produce several lower bounds for this problem. To solve one of the relaxed problems we present a Dynamic Programming algorithm which is a generalization of the algorithm of this type that gives a lower bound for the Travelling Salesman Problem. A comparison is given between the lower bounds obtained by each ralaxation for examples with size from 12 to 25.
Clerodane diterpenoids from Salvia splendens.
2006
Four new clerodane diterpenoids, salvisplendins A-D (1-4), have been isolated from an acetone extract of the flowers of SalVia splendens, together with an artifact (5), arising from salvisplendin D (4) by addition of diazomethane, and the already known clerodane olearin (6). The structures of the new compounds (1-5) were established mainly by 1D and 2D NMR spectroscopic studies and, in the case of salvisplendin A (1), by chemical correlation with splenolide B (7). Complete 1H and 13C NMR assignments for olearin (6), not published hitherto, are also reported.
On enhancing the object migration automaton using the Pursuit paradigm
2017
Abstract One of the most difficult problems that is all-pervasive in computing is that of partitioning. It has applications in the partitioning of databases into relations, the realization of the relations themselves into sub-relations based on the partitioning of the attributes, the assignment of processes to processors, graph partitioning, and the task assignment problem, etc. The problem is known to be NP-hard. The benchmark solution for this for the Equi-Partitioning Problem (EPP) has involved the classic field of Learning Automata (LA), and the corresponding algorithm, the Object Migrating Automata (OMA) has been used in all of these application domains. While the OMA is a fixed struct…
Solving Graph Coloring Problems Using Learning Automata
2008
The graph coloring problem (GCP) is a widely studied combinatorial optimization problem with numerous applications, including time tabling, frequency assignment, and register allocation. The growing need for more efficient algorithms has led to the development of several GCP solvers. In this paper, we introduce the first GCP solver that is based on Learning Automata (LA). We enhance traditional Random Walk with LA-based learning capability, encoding the GCP as a Boolean satisfiability problem (SAT). Extensive experiments demonstrate that the LA significantly improve the performance of RW, thus laying the foundation for novel LA-based solutions to the GCP.
Syllabic composition and use frequency: how do they affect stress assignment? A comparison between slow readers and fluent readers
2013
Italian words can be stressed either on penultimate or antepenultimate syllables. In both cases, stress assignment is not predictable by rules, but requires a lexical check. Italian words with stress on the penultimate syllable are defined as regular because the proportion of these words is much larger than words with stress on the antepenultimate syllable, defined as irregular. We propose to investigate the influence (in terms of correct stress positioning) of different syllabic and stress structures during "decoding” by both slow readers and fluent readers. Forty-eight children, twenty-four slow and twenty-four fluent readers, decoded “target words” selected on the basis of frequency (hig…