Search results for "programming."

showing 10 items of 3035 documents

Robotic-assisted minimally invasive esophagectomy (RAMIE) for esophageal cancer training curriculum—a worldwide Delphi consensus study

2021

Summary Background Structured training protocols can safely improve skills prior initiating complex surgical procedures such as robotic-assisted minimally invasive esophagectomy (RAMIE). As no consensus on a training curriculum for RAMIE has been established so far it is our aim to define a protocol for RAMIE with the Delphi consensus methodology. Methods Fourteen worldwide RAMIE experts were defined and were enrolled in this Delphi consensus project. An expert panel was created and three Delphi rounds were performed starting December 2019. Items required for RAMIE included, but were not limited to, virtual reality simulation, wet-lab training, proctoring, and continued monitoring and educa…

Training curriculumProtocol (science)medicine.medical_specialtyDelphi TechniqueEsophageal Neoplasmsbusiness.industryGastroenterologyDelphi methodGeneral MedicineBoehmeriaRamieEsophagectomyRobotic Surgical ProceduresCronbach's alphaInvasive esophagectomyHumansMinimally Invasive Surgical ProceduresMedicineMedical physicsCurriculumbusinessCurriculumcomputerDelphicomputer.programming_languageDiseases of the Esophagus
researchProduct

Transcriptional Mechanisms of Proneural Factors and REST in Regulating Neuronal Reprogramming of Astrocytes

2015

Summary Direct lineage reprogramming induces dramatic shifts in cellular identity, employing poorly understood mechanisms. Recently, we demonstrated that expression of Neurog2 or Ascl1 in postnatal mouse astrocytes generates glutamatergic or GABAergic neurons. Here, we take advantage of this model to study dynamics of neuronal cell fate acquisition at the transcriptional level. We found that Neurog2 and Ascl1 rapidly elicited distinct neurogenic programs with only a small subset of shared target genes. Within this subset, only NeuroD4 could by itself induce neuronal reprogramming in both mouse and human astrocytes, while co-expression with Insm1 was required for glutamatergic maturation. Cu…

Transcription GeneticRepressorNerve Tissue ProteinsCell fate determinationBiologyDNA-binding proteinArticleMiceGlutamatergicBasic Helix-Loop-Helix Transcription FactorsGeneticsAnimalsHumansPromoter Regions GeneticTranscription factorCells CulturedNeuronsCell BiologyCellular ReprogrammingMolecular biologyCell biologyDNA-Binding ProteinsRepressor ProteinsASCL1Astrocytesembryonic structuresMolecular MedicineGABAergicReprogrammingTranscription FactorsCell Stem Cell
researchProduct

Single Cell RT-PCR on Mouse Embryos: A General Approach for Developmental Biology

2010

Preimplantation development is a complicated process, which involves many genes. We have investigated the expression patterns of 17 developmentally important genes and isoforms in early mouse embryos as well as in single cells of the mouse embryo. The comparison is an excellent example for showing the importance of studying heterogeneity among cell populations on the RNA level, which is being increasingly addressed in basic research and medical sciences, particularly with a link to diagnostics (e.g. the analysis of circulating tumor cells and their progenitors). The ubiquitously expressed histone variant H3f3a and the transcription factor Pou5f1 generated mRNA-derived products in all analyz…

TranscriptomeGene expressionEmbryoEpigeneticsReprogrammingGenomeGeneDevelopmental biologyCell biology
researchProduct

DSL Tool Development with Transformations and Static Mappings

2009

A tool development framework for domain-specific languages combining mapping and transformation based approaches is proposed in this research project. The combination of both approaches permits to use advantages and eliminate disadvantages as far as possible. First results are described including draft architecture for the framework implementing proposed ideas. A sketch of mapping definition facilities is presented. Initial implementation proposals are described as well. A template based graphical generation language Template MOLA for implementation algorithm description is introduced.

Transformation (function)Development (topology)Digital subscriber lineGeneration languageComputer scienceProgramming languageModel transformationArchitecturecomputer.software_genrecomputerSketchTransformation languagecomputer.programming_language
researchProduct

Transformation of the Software Testing Glossary into a Browsable Concept Map

2014

Authors propose a transformation method of the glossary “Standard glossary of terms used in Software Testing” created by ISTQB document into a basic concept map. By applying natural language processing techniques and analyzing the discovered relations between concepts the most essential aspects of the software testing domain are elicited and integrated. As the result a browsable concept map is created. Browsable concept map can be used as a learning support tool.

Transformation (function)GlossarySoftware testingComputer scienceProgramming languagebusiness.industryConcept mapLearning supportArtificial intelligencecomputer.software_genrebusinesscomputerDomain (software engineering)
researchProduct

On the coupling between agent internal and agent/ environmental dynamics: Development of spatial representations in evolving autonomous robots

2008

In this article we describe how a population of evolving robots can autonomously develop forms of spatial representation which allow them to self-localize and to discriminate different locations of their environment by integrating sensory-motor information over time. The evolving robots also display a remarkable ability to generalize their skill in new environmental conditions that they have never experienced before. The analysis of the obtained results indicates that the evolved robots come up with simple and robust solutions that exploit quasi-periodic limit cycle dynamics emerging from the coupling between the robot/environmental dynamics and a robot's internal dynamics. More specifical…

Transient dynamiceducation.field_of_studyExploitComputer scienceEvolutionDistributed computingPopulationExperimental and Cognitive Psychologydynamical systemsComputer Science::RoboticsBehavioral Neurosciencerobot navigationCoupling (computer programming)Simple (abstract algebra)Limit cycleAttractorRobotTransient (computer programming)educationadaptive behaviorSimulationSpatial representation
researchProduct

On C1 robust singular transitive sets for three-dimensional flows

1998

Abstract The main goal of this paper is to study robust invariant transitive sets containing singularities for C 1 flows on three-dimensional compact boundaryless manifolds: they are partially hyperbolic with volume expanding central direction. Moreover, they are either attractors or repellers. Robust here means that this property cannot be destroyed by small C 1 -perturbations of the flow.

Transitive relationMathematics::Dynamical SystemsFlow (mathematics)Property (programming)Mathematical analysisAttractorGravitational singularityGeneral MedicineInvariant (mathematics)MathematicsComptes Rendus de l'Académie des Sciences - Series I - Mathematics
researchProduct

Pairwise Learning to Rank by Neural Networks Revisited: Reconstruction, Theoretical Analysis and Practical Performance

2020

We present a pairwise learning to rank approach based on a neural net, called DirectRanker, that generalizes the RankNet architecture. We show mathematically that our model is reflexive, antisymmetric, and transitive allowing for simplified training and improved performance. Experimental results on the LETOR MSLR-WEB10K, MQ2007 and MQ2008 datasets show that our model outperforms numerous state-of-the-art methods, while being inherently simpler in structure and using a pairwise approach only.

Transitive relationPairwise learningTheoretical computer scienceArtificial neural networkAntisymmetric relationComputer scienceRank (computer programming)Structure (category theory)Pairwise comparisonLearning to rank
researchProduct

A generalized transitive closure for relational queries

1988

We augment relational algebra with a generalized transitive closure operator that allows for the efficient evaluation of a subclass of recursive queries. The operator is based on a composition operator which is as general as possible when the operator is required to be associative and when only relational algebra operators are used in its definition. The closure of such a composition can be computed using the well-known efficient algorithms designed for the computation of the usual transitive closure. Besides the case in which complete materialization of recursive relations are required, our strategy also yields an efficient solution in the case in which a selection is applied to the closur…

Transitive relationSelection (relational algebra)Closure (topology)Transitive closure020207 software engineering02 engineering and technologyTransitive setRelational algebraTransitive reductionAlgebraTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESOperator (computer programming)TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS020204 information systems0202 electrical engineering electronic engineering information engineeringMathematicsProceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS '88
researchProduct

Rate of growth of frequently hypercyclic functions

2010

AbstractWe study the rate of growth of entire functions that are frequently hypercyclic for the differentiation operator or the translation operator. Moreover, we prove the existence of frequently hypercyclic harmonic functions for the translation operator and we study the rate of growth of harmonic functions that are frequently hypercyclic for partial differentiation operators.

Translation operatorPure mathematicsOperator (computer programming)Harmonic functionGeneral MathematicsEntire functionMathematical analysisRate of growthMathematicsProceedings of the Edinburgh Mathematical Society
researchProduct