Search results for " Match"
showing 10 items of 345 documents
Views selection for SIFT based object modeling and recognition
2016
In this paper we focus on automatically learning object models in the framework of keypoint based object recognition. The proposed method uses a collection of views of the objects to build the model. For each object the collection is composed of N×M views obtained rotating the object around its vertical and horizontal axis. As keypoint based object recognition using a complete set of views is computationally expensive, we focused on the definition of a selection method that creates, for each object, a subset of the initial views that visually summarize the characteristics of the object and should be suited for recognition. We select the views by determining maxima and minima of a function, …
Identifying the k Best Targets for an Advertisement Campaign via Online Social Networks
2020
We propose a novel approach for the recommendation of possible customers (users) to advertisers (e.g., brands) based on two main aspects: (i) the comparison between On-line Social Network profiles, and (ii) neighborhood analysis on the On-line Social Network. Profile matching between users and brands is considered based on bag-of-words representation of textual contents coming from the social media, and measures such as the Term Frequency-Inverse Document Frequency are used in order to characterize the importance of words in the comparison. The approach has been implemented relying on Big Data Technologies, allowing this way the efficient analysis of very large Online Social Networks. Resul…
Learning temporal patterns for anomaly intrusion detection
2002
For the last decade an explosive spread of computer systems and computer networks has resulted in a society that is increasingly dependent on information stored on these systems. A computer system connected to the network is accessible from another computer in this network regardless of its geographical position. Along with providing many benefits for legitimate users this technology creates almost unlimited opportunities for malicious persons, which using software vulnerabilities may successfully penetrate the networked computer systems. In order to eliminate potential devastating consequences caused by breaches in computer systems, more and more attention is drawn to the information secur…
Curative therapies are superior to standard of care (transarterial chemoembolization) for intermediate stage hepatocellular carcinoma.
2017
Background and aims the Barcelona Clinic Liver Cancer intermediate stage (BCLC-B) of hepatocellular carcinoma (HCC) includes extremely heterogeneous patients in terms of tumor burden and liver function. Transarterial-chemoembolization (TACE) is the first-line treatment for these patients although it may be risky/useless for someone, while others could undergo curative treatments. This study assesses the treatment type performed in a large cohort of BCLC-B patients and its outcome. Methods retrospective analysis of 485 consecutive BCLC-B patients from the ITA.LI.CA database diagnosed with naive HCC after 1999. Patients were stratified by treatment. Results 29 patients (6%) were lost to follo…
Treatment with metformin is associated with a prolonged survival in patients with hepatocellular carcinoma
2019
BACKGROUND Hepatocellular carcinoma (HCC) is one of the most lethal cancers. Nutrition- and life style-associated risk factors are increasingly prevalent. Metformin, the mainstay of type 2 diabetes mellitus (T2DM)-treatment, reduces the risk of hepatocarcinogenesis. However, its influence on the prognosis of patients with HCC has not been investigated on a large scale, yet. METHODS Five thousand and ninety-three patients treated for HCC between 2000 and 2016 at three referral centres were included in this retrospective multicentre study. The aim of this study was to assess whether treatment with metformin for T2DM is associated with a prolonged overall survival (OS) in patients diagnosed wi…
Alignment-Free Sequence Comparison over Hadoop for Computational Biology
2015
Sequence comparison i.e., The assessment of how similar two biological sequences are to each other, is a fundamental and routine task in Computational Biology and Bioinformatics. Classically, alignment methods are the de facto standard for such an assessment. In fact, considerable research efforts for the development of efficient algorithms, both on classic and parallel architectures, has been carried out in the past 50 years. Due to the growing amount of sequence data being produced, a new class of methods has emerged: Alignment-free methods. Research in this ares has become very intense in the past few years, stimulated by the advent of Next Generation Sequencing technologies, since those…
Automatic variable selection for exposure-driven propensity score matching with unmeasured confounders.
2020
Multivariable model building for propensity score modeling approaches is challenging. A common propensity score approach is exposure-driven propensity score matching, where the best model selection strategy is still unclear. In particular, the situation may require variable selection, while it is still unclear if variables included in the propensity score should be associated with the exposure and the outcome, with either the exposure or the outcome, with at least the exposure or with at least the outcome. Unmeasured confounders, complex correlation structures, and non-normal covariate distributions further complicate matters. We consider the performance of different modeling strategies in …
Parallel Construction and Query of Index Data Structures for Pattern Matching on Square Matrices
1999
AbstractWe describe fast parallel algorithms for building index data structures that can be used to gather various statistics on square matrices. The main data structure is the Lsuffix tree, which is a generalization of the classical suffix tree for strings. Given ann×ntext matrixA, we build our data structures inO(logn) time withn2processors on a CRCW PRAM, so that we can quickly processAin parallel as follows: (i) report some statistical information aboutA, e.g., find the largest repeated square submatrices that appear at least twice inAor determine, for each position inA, the smallest submatrix that occurs only there; (ii) given, on-line, anm×mpattern matrixPAT, check whether it occurs i…
Long read alignment based on maximal exact match seeds
2012
Abstract Motivation: The explosive growth of next-generation sequencing datasets poses a challenge to the mapping of reads to reference genomes in terms of alignment quality and execution speed. With the continuing progress of high-throughput sequencing technologies, read length is constantly increasing and many existing aligners are becoming inefficient as generated reads grow larger. Results: We present CUSHAW2, a parallelized, accurate, and memory-efficient long read aligner. Our aligner is based on the seed-and-extend approach and uses maximal exact matches as seeds to find gapped alignments. We have evaluated and compared CUSHAW2 to the three other long read aligners BWA-SW, Bowtie2 an…
Balanced difficulty task finder: an adaptive recommendation method for learning tasks based on the concept of state of flow
2020
An adaptive task difficulty assignment method which we reckon as balanced difficulty task finder (BDTF) is proposed in this paper. The aim is to recommend tasks to a learner using a trade-off between skills of the learner and difficulty of the tasks such that the learner experiences a state of flow during the learning. Flow is a mental state that psychologists refer to when someone is completely immersed in an activity. Flow state is a multidisciplinary field of research and has been studied not only in psychology, but also neuroscience, education, sport, and games. The idea behind this paper is to try to achieve a flow state in a similar way as Elo’s chess skill rating (Glickman in Am Ches…