Search results for "DISTANCE"
showing 10 items of 1009 documents
Online Density Estimation of Heterogeneous Data Streams in Higher Dimensions
2016
The joint density of a data stream is suitable for performing data mining tasks without having access to the original data. However, the methods proposed so far only target a small to medium number of variables, since their estimates rely on representing all the interdependencies between the variables of the data. High-dimensional data streams, which are becoming more and more frequent due to increasing numbers of interconnected devices, are, therefore, pushing these methods to their limits. To mitigate these limitations, we present an approach that projects the original data stream into a vector space and uses a set of representatives to provide an estimate. Due to the structure of the est…
Convolutional Neural Network With Shape Prior Applied to Cardiac MRI Segmentation.
2019
In this paper, we present a novel convolutional neural network architecture to segment images from a series of short-axis cardiac magnetic resonance slices (CMRI). The proposed model is an extension of the U-net that embeds a cardiac shape prior and involves a loss function tailored to the cardiac anatomy. Since the shape prior is computed offline only once, the execution of our model is not limited by its calculation. Our system takes as input raw magnetic resonance images, requires no manual preprocessing or image cropping and is trained to segment the endocardium and epicardium of the left ventricle, the endocardium of the right ventricle, as well as the center of the left ventricle. Wit…
User-Centred Design with a Remote Approach: Experiences from the Chronic Pain Project
2020
User-centred design involves end-users or user groups during all the parts of the development process. The research project Chronic Pain aims to develop a shared decision making application for patients and physicians, addressing individually adapted pain treatment. The project employs a user-centred design process, and in middle of it, Covid-19 pandemic social distancing restrictions were imposed. This paper presents how the user-centred design process together with a patient organisation was transformed to a digital approach and the experiences from performing a remote co-creation user workshop. The digital approximation had a satisfactory result and the main contribution lies in the shar…
Key Drivers of Mobile Commerce Adoption. An Exploratory Study of Spanish Mobile Users
2007
Despite dramatic differences between non-store shoppers were discovered, very limited research has been conducted to examine them. This paper analyses the background of M-commerce and key drivers of future Mcommerce decision among Spanish mobile users. Our objective is two-fold: (1) to determine the influence of relations with the Mobile (frequency of Mobile use, length of Mobile use and Mobile affinity), demographics, non-store shopping previous experience (mail, catalogue, Television and Internet) and attitude to M-commerce and its influence on the M-commerce decision and (2) to identify key drivers of future M-commerce intention. We examined data from 606 personal interviews given to Spa…
Buone pratiche organizzative e didattiche in tempo di COVID-19
2021
Le scuole paritarie cattoliche o cristianamente ispirate, tra marzo 2020 e febbraio 2021, hanno riorganizzato l’attività didattica in forme tali da prevenire i contagi da Covid-19. .E’ stata avvertita da tutti la mancanza delle relazioni interpersonali in presenza. Complessivamente la sfida della didattica a distanza ha sollecitato la creatività educativa degli insegnanti e dei dirigenti scolastici. Sono presentate 9 buone pratiche di dirigenza scolastica durante la pandemia e 17 buone pratiche didattiche, distribuite fra tutti i livelli scolastici. Le famiglie sono state contente di come i propri figli sono stati seguiti dalla scuola durante la fase dell’insegnamento svolto obbligatoriamen…
New lower bounds for the minimum distance of generalized algebraic geometry codes
2013
Abstract In this paper, we give a new lower bound for generalized algebraic geometry codes with which we are able to construct some new linear codes having better parameters compared with the ones known in the literature. Moreover, we give a relationship between a family of generalized algebraic geometry codes and algebraic geometry codes. Finally, we propose a decoding algorithm for such a family.
Partially Square Graphs, Hamiltonicity and Circumference II
2000
Abstract Given a graph G, its partially square graph G∗ is a graph obtained by adding an edge uv for each pair u, v of vertices of G at distance 2 whenever the vertices u and v have a common neighbor x satisfying the condition NG(x) ⊆ NG[u] ∪ NG[v], where NG[x]= NG(x) ∪ {x}. In case G is a claw-free graph, G∗ is equal to G2, We define σ ∗ t = min{ ∑ x∈ d ∗ G (x): S is an independent set in G ∗ and ∣S∣ = t} , where d ∗ G (x) = ∣{y ∈ V∣ xy ∈ E(G∗)}∣ . We give for hamiltonicity and circumference new sufficient conditions depending on and we improve some known results.
Two graphs with a common edge
2014
Let G = G1 ∪ G2 be the sum of two simple graphs G1,G2 having a common edge or G = G1 ∪ e1 ∪ e2 ∪ G2 be the sum of two simple disjoint graphs G1,G2 connected by two edges e1 and e2 which form a cycle C4 inside G. We give a method of computing the determinant det A(G) of the adjacency matrix of G by reducing the calculation of the determinant to certain subgraphs of G1 and G2. To show the scope and effectiveness of our method we give some examples
On the Soluble Graph of a Finite Simple Group
2013
The maximal independent sets of the soluble graph of a finite simple group G are studied and their independence number is determined. In particular, it is shown that this graph in many cases has an independent set with three vertices.
MMD codes in a more general sense
2002
Summary form only given. The author deals with the characterisation of maximum minimum distance (MMD) codes in a more general sense, which has been completed in a joint work with Olsson. As in the m=1 case the weight distribution of an MMD code /spl Cscr/ is uniquely determined by its parameters [n,k,d]/sub q/.