Search results for "D algorithm"

showing 7 items of 327 documents

Special Issue on Computational Intelligence and Nature-Inspired Algorithms for Real-World Data Analytics and Pattern Recognition

2018

This special issue of Algorithms is devoted to the study of Computational Intelligence and Nature-Inspired Algorithms for Real-World Data Analytics and Pattern Recognition. The special issue considered both theoretical contributions able to advance the state-of-the-art in this field and practical applications that describe novel approaches for solving real-world problems.

lcsh:T55.4-60.8Computer science020209 energyComputational intelligence02 engineering and technologylcsh:QA75.5-76.95Field (computer science)Theoretical Computer Science0202 electrical engineering electronic engineering information engineeringlcsh:Industrial engineering. Management engineeringNature inspireddata analyticsNumerical Analysisbusiness.industrypattern recognitionComputational mathematicsPattern recognitionnature-inspired algorithmsComputational MathematicsComputational Theory and MathematicsAnalyticsPattern recognition (psychology)Computational IntelligenceData analysislcsh:Electronic computers. Computer scienceArtificial intelligencebusinessReal world dataAlgorithmAlgorithms
researchProduct

Abonder une base EndNote avec un formulaire web et un courriel

2011

National audience; Cet article présente une façon originale d’abonder une base EndNote en limitant le nombre d’erreurs et les doubles saisies. Cette procédure permet d’utiliser un canal unique et d’avoir les informations utiles à leur exploitation. La saisie s’effectue via un formulaire disponible sur l’intranet de l’unité, les données sont intégrées dans un fichier XML et envoyées par courriel à la documentaliste avec éventuellement une pièce attachée pour intégration directe à la base avec la fonction import d’EndNote.

mail[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS][INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS]XMLcourrielEndnotebibliographie
researchProduct

2020

Introduction Adolescents’ physical activity (PA) behavior can be driven by several psychosocial determinants at the same time. Most analyses use a variable-based approach that examines relations between PA-related determinants and PA behavior on the between-person level. Using this approach, possible coexistences of different psychosocial determinants within one person cannot be examined. Therefore, by applying a person-oriented approach, this study examined a) which profiles regarding PA-related psychosocial variables typically occur in female sixth-graders, b) if these profiles deliver a self-consistent picture according to theoretical assumptions, and c) if the profiles contribute to the…

media_common.quotation_subject05 social sciencesPhysical activitySuperordinate goals050105 experimental psychologyDevelopmental psychologyPhysical education03 medical and health sciencesUnsupervised algorithmSocial support0302 clinical medicine0501 psychology and cognitive sciencesPsychologyPsychosocialCompetence (human resources)030217 neurology & neurosurgeryGeneral PsychologyAutonomymedia_commonFrontiers in Psychology
researchProduct

Dynamic, Behavior-Based User Profiling Using Semantic Web Technologies in a Big Data Context

2013

pp. 363-372; International audience; The success of shaping the e-society is crucially dependent on how well technology adapts to the needs of each single user. A thorough understanding of one's personality, interests, and social connections facilitate the integration of ICT solutions into one's everyday life. The MindMinings project aims to build an advanced user profile, based on the automatic processing of a user's navigation traces on the Web. Given the various needs underpinned by our goal (e.g. integration of heterogeneous sources and automatic content extraction), we have selected Semantic Web technologies for their capacity to deliver machine-processable information. Indeed, we have…

medicine.medical_specialtyComputer science[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]02 engineering and technologycomputer.software_genreSocial Semantic Web[INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]World Wide Web020204 information systems0202 electrical engineering electronic engineering information engineeringmedicineWeb navigationSemantic Web Stack[ INFO.INFO-AI ] Computer Science [cs]/Artificial Intelligence [cs.AI]Semantic WebData Web[ INFO.INFO-DS ] Computer Science [cs]/Data Structures and Algorithms [cs.DS][INFO.INFO-DB]Computer Science [cs]/Databases [cs.DB]User profilebusiness.industry[ INFO.INFO-DB ] Computer Science [cs]/Databases [cs.DB]020201 artificial intelligence & image processingWeb servicebusinesscomputerWeb modeling
researchProduct

ON-LINE CONSTRUCTION OF A SMALL AUTOMATON FOR A FINITE SET OF WORDS

2012

In this paper we describe a "light" algorithm for the on-line construction of a small automaton recognising a finite set of words. The algorithm runs in linear time. We carried out good experimental results on real dictionaries, on biological sequences and on the sets of suffixes (resp. factors) of a set of words that shows how our automaton is near to the minimal one. For the suffixes of a text, we propose a modified construction that leads to an even smaller automaton. We moreover construct linear algorithms for the insertion and deletion of a word in a finite set, directly from the constructed automaton.

minimal automata[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]Timed automatondeterministic automataBüchi automaton0102 computer and information sciences02 engineering and technology01 natural sciencesDeterministic automaton0202 electrical engineering electronic engineering information engineeringComputer Science (miscellaneous)Two-way deterministic finite automatonNondeterministic finite automatonMathematicsonline construction.Discrete mathematicsSettore INF/01 - InformaticaPowerset constructionPushdown automatonComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)010201 computation theory & mathematicsProbabilistic automaton020201 artificial intelligence & image processingFinite set of wordAlgorithmComputer Science::Formal Languages and Automata Theory
researchProduct

Computing Subdivision Surface Intersection

2003

Computer surface intersections is fundamental problem in geometric modeling. Any Boolean operation can be seen as an intersection calculation followed by a selection of parts necessary for building the surface of the resulting object. This paper deals with the computing of intersection curveson subdivision surfaces (surfaces generated by the Loop scheme). We present three variants of our algorithm. The first variant calculates this intersection after classification of the object faces into intersecting and non-intersecting pairs of faces. the second variant is based on 1-neighborhood of the intersecting faces. The third variant uses the concept of bipartite graph.

průnik křivekgeometric modellinggeometrické modelovánírežim smyčky[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS][INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS][ INFO.INFO-DM ] Computer Science [cs]/Discrete Mathematics [cs.DM][INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]intersection curvesčlenění povrchu[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]loop shemesubdivison surfacesComputingMilieux_MISCELLANEOUS[ INFO.INFO-DS ] Computer Science [cs]/Data Structures and Algorithms [cs.DS]ComputingMethodologies_COMPUTERGRAPHICS
researchProduct

Shape Sensitivity Analysis and Gradient-Based Optimization of Large Structures Using MLFMA

2014

A fast method for computing the action of shape-differentiated electric field integral equation (EFIE) system matrix to a vector is derived exploiting the multilevel fast multipole algorithm (MLFMA). The proposed method is used in conjunction with the adjoint-variable method (AVM) to compute the shape gradient of arbitrary objective functions depending on shape of a metallic scatterer. The method is demonstrated numerically by optimizing the shape of a parabolic reflector illuminated with a half-wave dipole.

ta113DipoleParabolic reflectorGradient based algorithmMathematical analysisShape gradientSensitivity (control systems)Electrical and Electronic EngineeringElectric-field integral equationMultipole expansionAction (physics)MathematicsIEEE Transactions on Antennas and Propagation
researchProduct