Search results for "python"

showing 10 items of 160 documents

Avoiding strange attractors in efficient parametric families of iterative methods for solving nonlinear problems

2019

[EN] Searching zeros of nonlinear functions often employs iterative procedures. In this paper, we construct several families of iterative methods with memory from one without memory, that is, we have increased the order of convergence without adding new functional evaluations. The main aim of this manuscript yields in the advantage that the use of real multidimensional dynamics gives us to decide among the different classes designed and, afterwards, to select its most stable members. Moreover, we have found some elements of the family whose behavior includes strange attractors of different kinds that must be avoided in practice. In this sense, Feigenbaum diagrams have resulted an extremely …

Feigenbaum diagramsNumerical AnalysisMathematical optimizationRelation (database)Iterative methodApplied MathematicsNonlinear problems010103 numerical & computational mathematicsConstruct (python library)01 natural sciencesComputational efficiency010101 applied mathematicsComputational MathematicsNonlinear systemRate of convergenceAttractorIterative methods with and without memoryNumerical tests0101 mathematicsMATEMATICA APLICADAQualitative analysisMathematicsParametric statisticsApplied Numerical Mathematics
researchProduct

Many-Body Quantum Dynamics from the Density

2013

We present a local control scheme to construct the external potential v that, for a given initial state, produces a prescribed time-dependent density in an interacting quantum many-body system. This numerical method is efficient and stable even for large and rapid density variations irrespective of the initial state and the interactions. It can at the same time be used to answer fundamental v-representability questions in density functional theory. In particular, in the absence of interactions, it allows us to construct the exact time-dependent Kohn-Sham potential for arbitrary initial states. We illustrate the method in a correlated one-dimensional two-electron system with different intera…

Physics010304 chemical physicsQuantum dynamicsNumerical analysisGeneral Physics and AstronomyConstruct (python library)State (functional analysis)01 natural sciencesAdiabatic theoremScheme (mathematics)0103 physical sciencesDensity functional theoryStatistical physics010306 general physicsQuantum
researchProduct

Restorāna mājas lapa

2015

Kvalifikācijas darba mērķis ir izstrādāt tīmekļa vietni reāli eksistējošam restorānam ar tai piesaistītu administrācijas paneli un datu bāzi, kuras nolūks ir optimizēt uzņēmuma darbību, veicinot klientu piesaisti, kā arī efektīvi pārvaldot elektroniski uzglabāto informāciju. Sistēmas administrācijas panelis paredzēts restorāna darbinieku un īpašnieku iekšējai lietošanai, lai ērti varētu rediģēt mājas lapā publicēto informāciju, kā arī uzglabāt vēl nepublicētus datus, pievienotu vai rediģētu sistēmas lietotājus, piešķirot vai atņemot tiem piekļuves tiesības dažādām lapas sadaļām. Sistēma izstrādāta uz Python/Django ietvara bāzes, izmantojot MySQL datu bāzu pārvaldības rīku.

DatorzinātneMājas lapaPython/DjangoMySQLAdministrācijas panelis
researchProduct

Simulation-based estimation of branching models for LTR retrotransposons

2017

Abstract Motivation LTR retrotransposons are mobile elements that are able, like retroviruses, to copy and move inside eukaryotic genomes. In the present work, we propose a branching model for studying the propagation of LTR retrotransposons in these genomes. This model allows us to take into account both the positions and the degradation level of LTR retrotransposons copies. In our model, the duplication rate is also allowed to vary with the degradation level. Results Various functions have been implemented in order to simulate their spread and visualization tools are proposed. Based on these simulation tools, we have developed a first method to evaluate the parameters of this propagation …

0301 basic medicineStatistics and ProbabilitySource codeTheoretical computer scienceRetroelementsmedia_common.quotation_subjectRetrotransposon[INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE]BiologyBiochemistryGenomeChromosomesBranching (linguistics)[INFO.INFO-IU]Computer Science [cs]/Ubiquitous Computing03 medical and health sciences[INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]SoftwareAnimalsComputer SimulationMolecular BiologyComputingMilieux_MISCELLANEOUSmedia_commoncomputer.programming_languageGeneticsGenomeModels Geneticbusiness.industry[SDV.BID.EVO]Life Sciences [q-bio]/Biodiversity/Populations and Evolution [q-bio.PE]Python (programming language)[SDV.BIBS]Life Sciences [q-bio]/Quantitative Methods [q-bio.QM][INFO.INFO-MO]Computer Science [cs]/Modeling and SimulationComputer Science ApplicationsVisualizationComputational Mathematics030104 developmental biologyDrosophila melanogasterComputational Theory and Mathematics[INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA]Programming Languages[INFO.INFO-ET]Computer Science [cs]/Emerging Technologies [cs.ET]Mobile genetic elements[INFO.INFO-DC]Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC]businesscomputerSoftware
researchProduct

Biomolecular computers with multiple restriction enzymes

2017

Abstract The development of conventional, silicon-based computers has several limitations, including some related to the Heisenberg uncertainty principle and the von Neumann “bottleneck”. Biomolecular computers based on DNA and proteins are largely free of these disadvantages and, along with quantum computers, are reasonable alternatives to their conventional counterparts in some applications. The idea of a DNA computer proposed by Ehud Shapiro’s group at the Weizmann Institute of Science was developed using one restriction enzyme as hardware and DNA fragments (the transition molecules) as software and input/output signals. This computer represented a two-state two-symbol finite automaton t…

0301 basic medicineTheoretical computer scienceDNA computerlcsh:QH426-4700102 computer and information sciencesBiology01 natural scienceslaw.inventionrestriction enzymesGenomics and Bioinformatics03 medical and health sciencessymbols.namesakeSoftwareDNA computinglawGeneticsNondeterministic finite automatonMolecular BiologyQuantum computerFinite-state machinebusiness.industryConstruct (python library)bioinformaticsDNARestriction enzymelcsh:Genetics030104 developmental biology010201 computation theory & mathematicssymbolsbusinessVon Neumann architectureGenetics and Molecular Biology
researchProduct

Telestratora modulis profesionālajam sportam

2016

“Telestrātora modulis profesionālajam sportam” izstrādāts “SIA Playgineering Systems” uzņēmuma vajadzībām, tas lietotnes gala versijā ļaus lietotājam izveidot un atskaņot specifiska veida prezentācijas profesionālajam sportam . Lai izveidotu video “prezentāciju” lietotājam būs iespējams atvērt populārāko formātu video failu, un pauzes laikā ar piedāvātajiem rīkiem veidot informatīvu zīmējumu, kā arī pēc prezentācijas izveides saglabāt projektu, lai to varētu atskaņot un prezentēt vēlāk. Lietotne tika veidota programmēšanas valodā Python, projekti tika saglabāti ar JSON datu struktūras palīdzību, video kontrolēšana un atskaņošana tika realizēta ar Gstreamer palīdzību, kā arī dizains veidots …

GStreamerDatorzinātneJSONTelestratorQt frameworkPython
researchProduct

Seju un logo aptazīšanas tīmekļa sistēma

2017

Šajā dokumentā ir aprakstīta seju un logo atpazīšanas tīmekļa sistēma, kas paredzēta attēlos attēlotu seju atrašanai un no šīm sejām sistēmāievietoto seju atpazīšanai, kā arī attēlos redzamo logotipu, kas ievietoti sistēmā, atpazīšanai. Sistēmai tika aprakstīta veidota tikai aizmugures daļa, jo lietotāju saskarni implementēs pasūtītājs. Sistēma realizēta, izmantojot ārējus moduļus, Docker platformā. Tā implementēta Python valodā, izmantojot Flask ietvaru.

MašīnmācīšanāsFlaskDockerDatorzinātneSeju atpazīšanaPython
researchProduct

Study of the urban dynamics by a new computer application, OH-FET

2014

International audience; The study of the urban fabric and the spatial dynamics of urban space is based on an understanding of the city as a complex system composed of individual historical objects. The OH_FET model which we developed since 2004, is based on this approach of urban space. It describes the historical urban object as the Cartesian product of three basic dimensions: function (social use), space and time from the works of Donna Peuquet in geomatics and James Allen in artificial intelligence. Although the heuristic potential of the model have already been proven to work on the cities of Tours and , more recently, Vendome in France, the integration constraints, the designing and da…

[SHS.GEO] Humanities and Social Sciences/Geography[ SHS ] Humanities and Social Sciences[SHS.GEO]Humanities and Social Sciences/Geographytemporal dimensionchronographie[SHS] Humanities and Social SciencesPython languageUrban transformation[ SHS.GEO ] Humanities and Social Sciences/Geography[SHS]Humanities and Social Sciences
researchProduct

Movie Script Similarity Using Multilayer Network Portrait Divergence

2020

International audience; This paper addresses the question of movie similarity through multilayer graph similarity measures. Recent work has shown how to construct multilayer networks using movie scripts, and how they capture different aspects of the stories. Based on this modeling, we propose to rely on the multilayer structure and compute different similarities, so we may compare movies, not from their visual content, summary, or actors, but actually from their own storyboard. We propose to do so using “portrait divergence”, which has been recently introduced to compute graph distances from summarizing graph characteristics. We illustrate our approach on the series of six Star Wars movies.

Theoretical computer scienceComputer science02 engineering and technologyStar (graph theory)[INFO.INFO-NE]Computer Science [cs]/Neural and Evolutionary Computing [cs.NE]computer.software_genre01 natural sciences010305 fluids & plasmas[INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]Similarity (network science)[INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG]0103 physical sciences0202 electrical engineering electronic engineering information engineering[INFO]Computer Science [cs]StoryboardDivergence (statistics)Structure (mathematical logic)Network portraitMoviesMultilayer networksNetwork similarity[INFO.INFO-MM]Computer Science [cs]/Multimedia [cs.MM]Construct (python library)Scripting languageGraph (abstract data type)020201 artificial intelligence & image processingcomputer[SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing
researchProduct

A fixed point theorem for G-monotone multivalued mapping with application to nonlinear integral equations

2017

We extend notion and theorem of [21] to the case of a multivalued mapping defined on a metric space endowed with a finite number of graphs. We also construct an example to show the generality of our result over existing results. Finally, we give an application to nonlinear integral equations

GeneralityGeneral Mathematics010102 general mathematicsFixed-point theoremFixed pointConstruct (python library)Nonlinear integral equation01 natural sciencesGraph010101 applied mathematicsAlgebraMetric spaceMonotone polygonSettore MAT/05 - Analisi Matematica0101 mathematicsG-monotone multivalued mappingFinite setMathematicsFilomat
researchProduct