Search results for "Indexing"

showing 10 items of 94 documents

The 100 most-cited articles in orthodontics: A bibliometric study

2018

ABSTRACT Objectives: To identify and analyze the 100 most-cited articles in orthodontics indexed in the Web of Science Category of “Dental, Oral Surgery and Medicine” from 1946 to 2016. Materials and Methods: On hundred articles were identified in a search of the database of the ISI Web of Science and Journal Citation Reports, applying the truncated search term “orthodon*.” Records were manually refined and normalized to unify terms and to remove typographical, transcription, and/or indexing errors. Results: The 100 most-cited articles were published between 1946 and 2012, with numbers of citations ranging from 115 to 881. Of the 251 authors participating, 87.65% published a single work, wh…

OrthodonticsIsi web of scienceOral surgerySearch engine indexingOrthodonticsOriginal Articles030206 dentistryBibliometrics03 medical and health sciences0302 clinical medicineBibliometricsCitation analysisHumans030212 general & internal medicinePeriodicals as TopicCitationPsychologyThe Angle Orthodontist
researchProduct

On Approximate Jumbled Pattern Matching in Strings

2011

Given a string s, the Parikh vector of s, denoted p(s), counts the multiplicity of each character in s. Searching for a match of a Parikh vector q in the text s requires finding a substring t of s with p(t) = q. This can be viewed as the task of finding a jumbled (permuted) version of a query pattern, hence the term Jumbled Pattern Matching. We present several algorithms for the approximate version of the problem: Given a string s and two Parikh vectors u, v (the query bounds), find all maximal occurrences in s of some Parikh vector q such that u <= q <= v. This definition encompasses several natural versions of approximate Parikh vector search. We present an algorithm solving this problem …

Parikh vectors: Average case analysiApproximate searchString algorithmsDiscrete mathematicsWeight functionanalysisSearch engine indexingParikh vectorsAverage case analysisApproximate string matchingSubstringString algorithmTheoretical Computer ScienceCombinatoricsComputational Theory and MathematicsString algorithms Pattern matching Parikh vectors Average case analysis Approximate search Permuted stringsPermuted stringsAverage caseTheory of computationWavelet TreePreprocessorPattern matchingPattern matchingMathematicsTheory of Computing Systems
researchProduct

r-Indexing the eBWT

2021

The extended Burrows Wheeler Transform (\(\mathrm {eBWT}\)) was introduced by Mantaci et al. [TCS 2007] to extend the definition of the \(\mathrm {BWT}\) to a collection of strings. In our prior work [SPIRE 2021], we give a linear-time algorithm for the \(\mathrm {eBWT}\) that preserves the fundamental property of the original definition (i.e., the independence from the input order). The algorithm combines a modification of the Suffix Array Induced Sorting (SAIS) algorithm [IEEE Trans Comput 2011] with Prefix Free Parsing [AMB 2019; JCB 2020]. In this paper, we show how this construction algorithm leads to r-indexing the \(\mathrm {eBWT}\), i.e., run-length encoded \(\mathrm {eBWT}\) and \(…

Physicsstring compressionBurrows–Wheeler transformSettore INF/01 - InformaticaSearch engine indexingSuffix arrayOrder (ring theory)Burrows-Wheeler-Transform r-index string compression extended BWT compressed indexingBurrows-Wheeler-Transformlaw.inventionCombinatoricsr-indexcompressed indexinglawIndexingextended BWT
researchProduct

Scientific Publications and Research Groups on Alcohol Consumption and Related Problems Worldwide: Authorship Analysis of Papers Indexed in PubMed an…

2011

BACKGROUND: The research of alcohol consumption-related problems is a multidisciplinary field. The aim of this study is to analyze the worldwide scientific production in the area of alcohol-drinking and alcohol-related problems from 2005 to 2009. METHODS: A MEDLINE and Scopus search on alcohol (alcohol-drinking and alcohol-related problems) published from 2005 to 2009 was carried out. Using bibliometric indicators, the distribution of the publications was determined within the journals that publish said articles, specialty of the journal (broad subject terms), article type, language of the publication, and country where the journal is published. Also, authorship characteristics were assesse…

PubMedBiomedical ResearchAlcohol DrinkingDatabases FactualAbstracting and IndexingMEDLINEeducationSpecialtyScopusMEDLINEMedicine (miscellaneous)Poison controlBibliometricsGlobal HealthToxicologycomputer.software_genreInjury preventionHumansMedicineDatabasebusiness.industrySubject (documents)AuthorshipPsychiatry and Mental healthIndex (publishing)Periodicals as TopicbusinesscomputerAlcoholism: Clinical and Experimental Research
researchProduct

Scientific abstracts and plain language summaries in psychology: A comparison based on readability indices.

2020

Findings from psychological research are usually difficult to interpret for non-experts. Yet, non-experts resort to psychological findings to inform their decisions (e.g., whether to seek a psychotherapeutic treatment or not). Thus, the communication of psychological research to non-expert audiences has received increasing attention over the last years. Plain language summaries (PLS) are abstracts of peer-reviewed journal articles that aim to explain the rationale, methods, findings, and interpretation of a scientific study to non-expert audiences using non-technical language. Unlike media articles or other forms of accessible research summaries, PLS are usually written by the authors of th…

Research FacilitiesApplied psychologyInformation Storage and RetrievalSocial Sciences050109 social psychologyInformation Centers0302 clinical medicineMathematical and Statistical TechniquesReading (process)Science communicationPsychologyPlain languagemedia_commonLanguageGrammarMultidisciplinaryArchives05 social sciencesStatisticsQRSyllablesResearch AssessmentSystematic reviewPhysical SciencesMedicinePsychologyResearch ArticleSystematic ReviewsAbstracting and Indexingmedia_common.quotation_subjectPeer ReviewScienceMEDLINEResearch and Analysis MethodsPhonology03 medical and health sciences0501 psychology and cognitive sciencesStatistical MethodsScientific PublishingAnalysis of VariancePsychological researchCognitive PsychologyBiology and Life SciencesLinguisticsReadabilityReading comprehensionReadingCognitive Science030217 neurology & neurosurgeryMathematicsNeurosciencePLoS ONE
researchProduct

Quality assessment of randomized controlled trial abstracts on drug therapy of periodontal disease from the abstracts published in dental Science Cit…

2020

Background Randomized controlled trials (RCTs) provide the highest level of evidence and are likely to influence clinical decision-making. This study evaluated the reporting quality of RCT abstracts on drug therapy of periodontal disease and assessed the associated factors. Material and Methods The Pubmed database was searched for periodontal RCTs published in Science Citation Indexed (SCI) dental journals from 2010/01/01 to 2019/07/17. Information was extracted from the abstracts according to a modified Consolidated Standards of Reporting Trials (CONSORT) guideline checklist. The data was analyzed using descriptive statistical analysis and the statistical associations were examined using t…

Research designmedicine.medical_specialtyAbstracting and IndexingMEDLINElaw.invention03 medical and health sciences0302 clinical medicineRandomized controlled triallawInternal medicineHumansMedicinePeriodontologyGeneral DentistryPeriodontal DiseasesRandomized Controlled Trials as TopicIntention-to-treat analysisbusiness.industryResearchConsolidated Standards of Reporting Trials030206 dentistryGuideline:CIENCIAS MÉDICAS [UNESCO]ChecklistConfidence intervalChecklistOtorhinolaryngologyResearch DesignUNESCO::CIENCIAS MÉDICASSurgeryPeriodicals as Topicbusiness
researchProduct

UCS: Ultimate course search

2016

International audience; In this system prototype demonstration we present, Ultimate Course Search (UCS), a learning tool developed to provide students ways to efficiently search electronic educational materials. UCS integrates slides, lecture videos and textbooks into a single platform. The keywords extracted from the textbooks and the slides are the basis of the indexing scheme. For the videos, UCS relies on slide transitions and metadata to establish the correspondence between slides and video segments. The video segmentation is based on the slides being presented using the meta-data provided by the video recording software and image processing techniques.

Scheme (programming language)Computer scienceComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONImage processing02 engineering and technologycomputer.software_genreCourse (navigation)[SPI]Engineering Sciences [physics]Software[ SPI.NRJ ] Engineering Sciences [physics]/Electric power[ SPI ] Engineering Sciences [physics]ComputingMilieux_COMPUTERSANDEDUCATION0202 electrical engineering electronic engineering information engineeringSegmentationcomputer.programming_languageMultimediabusiness.industry4. Education[SPI.NRJ]Engineering Sciences [physics]/Electric powerSearch engine indexing020207 software engineeringImage segmentation[ SPI.TRON ] Engineering Sciences [physics]/Electronics[SPI.TRON]Engineering Sciences [physics]/ElectronicsMetadata020201 artificial intelligence & image processingbusinesscomputer2016 14th International Workshop on Content-Based Multimedia Indexing (CBMI)
researchProduct

A Fast Anchor Person Searching Scheme in News Sequences

2001

In this paper we address the problem of seeking anchor person shots in news sequences. This can be useful since usually this kind of scenes contain important and reusable information such as interviews. The proposed technique is based on our a priori knowledge of the editing techniques used in news sequences.

Scheme (programming language)Information retrievalComputer sciencebusiness.industrySpeech recognitionPattern recognition (psychology)Search engine indexingImage processingBroadcastingSpeech processingbusinesscomputercomputer.programming_language
researchProduct

Indexing Multimedia Learning Materials in Ultimate Course Search

2016

International audience; Multimedia is the main support for online learning materials and the size of multimedia learning materials is growing with the popularity of online programs offered by Universities. Ultimate Course Search (UCS) is a tool that aims to provide efficient search of course materials. UCS integrates slides, lecture videos and textbook content into a single platform with search capabilities. The keywords extracted from the textbook index and the power-point slides are the basis of the indexing scheme. The slides are indexed on the keywords and the videos are indexed on the slides. The correspondence between the slides and video segments is established using the meta-data pr…

Scheme (programming language)Information retrievalMultimediaComputer sciencebusiness.industrySearch engine indexing[SPI.NRJ]Engineering Sciences [physics]/Electric powerImage processing02 engineering and technologyImage segmentationcomputer.software_genreRanking (information retrieval)[ SPI.TRON ] Engineering Sciences [physics]/Electronics[SPI.TRON]Engineering Sciences [physics]/ElectronicsMetadata[SPI]Engineering Sciences [physics]SoftwareIndex (publishing)[ SPI.NRJ ] Engineering Sciences [physics]/Electric power020204 information systems0202 electrical engineering electronic engineering information engineering[ SPI ] Engineering Sciences [physics]businesscomputercomputer.programming_language
researchProduct

Lightweight BWT Construction for Very Large String Collections

2011

A modern DNA sequencing machine can generate a billion or more sequence fragments in a matter of days. The many uses of the BWT in compression and indexing are well known, but the computational demands of creating the BWT of datasets this large have prevented its applications from being widely explored in this context. We address this obstacle by presenting two algorithms capable of computing the BWT of very large string collections. The algorithms are lightweight in that the first needs O(m log m) bits of memory to process m strings and the memory requirements of the second are constant with respect to m. We evaluate our algorithms on collections of up to 1 billion strings and compare thei…

SequenceTheoretical computer scienceConstant (computer programming)BWTtext indexesComputer scienceString (computer science)Search engine indexingProcess (computing)Context (language use)next-generation sequencingAlphabetBWT; text indexes; next-generation sequencing
researchProduct