Search results for " code"

showing 10 items of 636 documents

Recursive modeling for completed code generation

2009

Model-Driven Development is promising to software development because it can reduce the complexity and cost of developing large software systems. The basic idea is the use of different kinds of models during the software development process, transformations between them, and automatic code generation at the end of the development. But unlike the structural parts, fully-automated code generation from the behavior parts is still hard, if it works at all, restricted to specific application areas using a domain specific language, DSL.This paper proposes an approach to model the behavior parts of a system and to embed them into the structural models. The underlying idea is recursive refinements …

Theoretical computer scienceSource codeCode reviewbusiness.industryComputer scienceProgramming languagemedia_common.quotation_subjectSoftware developmentStatic program analysiscomputer.software_genreLinear code sequence and jumpSoftware constructionKPI-driven code analysisCode generationbusinesscomputermedia_commonProceedings of the 1st Workshop on Behaviour Modelling in Model-Driven Architecture
researchProduct

GPU-accelerated exhaustive search for third-order epistatic interactions in case–control studies

2015

This is a post-peer-review, pre-copyedit version of an article published in Journal of Computational Science. The final authenticated version is available online at: https://doi.org/10.1016/j.jocs.2015.04.001 [Abstract] Interest in discovering combinations of genetic markers from case–control studies, such as Genome Wide Association Studies (GWAS), that are strongly associated to diseases has increased in recent years. Detecting epistasis, i.e. interactions among k markers (k ≥ 2), is an important but time consuming operation since statistical computations have to be performed for each k-tuple of measured markers. Efficient exhaustive methods have been proposed for k = 2, but exhaustive thi…

Theoretical computer scienceSource codeGeneral Computer ScienceComputer scienceComputationmedia_common.quotation_subjectGPUBrute-force searchCUDAMutual informationcomputer.software_genreTheoretical Computer ScienceMutual informationCUDAModeling and SimulationEpistasisGWASNode (circuits)Data miningTupleHeuristicscomputermedia_commonJournal of Computational Science
researchProduct

Challenges of Program Synthesis with Grammatical Evolution

2020

Program synthesis is an emerging research topic in the field of EC with the potential to improve real-world software development. Grammar-guided approaches like GE are suitable for program synthesis as they can express common programming languages with their required properties. This work uses common software metrics (lines of code, McCabe metric, size and depth of the abstract syntax tree) for an analysis of GE’s search behavior and the resulting problem structure. We find that GE is not able to solve program synthesis problems, where correct solutions have higher values of the McCabe metric (which means they require conditions or loops). Since small mutations of high-quality solutions str…

Theoretical computer scienceSource lines of codebusiness.industryComputer scienceSoftware developmentGenetic programming0102 computer and information sciences02 engineering and technology01 natural sciencesSoftware metric010201 computation theory & mathematicsGrammatical evolutionMetric (mathematics)0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingbusinessAbstract syntax treeProgram synthesis
researchProduct

Minimal forbidden words and factor automata

1998

International audience; Let L(M) be the (factorial) language avoiding a given antifactorial language M. We design an automaton accepting L(M) and built from the language M. The construction is eff ective if M is finite. If M is the set of minimal forbidden words of a single word v, the automaton turns out to be the factor automaton of v (the minimal automaton accepting the set of factors of v). We also give an algorithm that builds the trie of M from the factor automaton of a single word. It yields a non-trivial upper bound on the number of minimal forbidden words of a word.

TheoryofComputation_COMPUTATIONBYABSTRACTDEVICESfailure functionfactor code[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]Büchi automatonComputerApplications_COMPUTERSINOTHERSYSTEMS[INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS]0102 computer and information sciencesavoiding a wordω-automaton01 natural sciencesfactorial languageReversible cellular automatonCombinatoricsDeterministic automatonanti-factorial languageNondeterministic finite automaton0101 mathematicsMathematicsfactor automatonPowerset constructionLevenshtein automaton010102 general mathematicsforbidden wordComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)16. Peace & justiceNonlinear Sciences::Cellular Automata and Lattice GasesTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES010201 computation theory & mathematicsProbabilistic automatonPhysics::Accelerator PhysicsComputer Science::Programming LanguagesHigh Energy Physics::ExperimentComputer Science::Formal Languages and Automata Theory
researchProduct

Nucleosome-specific, Time-dependent Changes in Histone Modifications during Activation of the Early Growth Response 1 (Egr1) Gene

2014

Histone post-translational modifications and nucleosome remodeling are coordinate events involved in eukaryotic transcriptional regulation. There are relatively few data on the time course with which these events occur in individual nucleosomes. As a contribution to fill this gap, we first describe the nature and time course of structural changes in the nucleosomes -2, -1, and +1 of the murine Egr1 gene upon induction. To initiate the transient activation of the gene, we used the stimulation of MLP29 cells with phorbol esters and the in vivo activation after partial hepatectomy. In both models, nucleosomes -1 and +1 are partially evicted, whereas nucleosomes +1 and -2 slide downstream durin…

Time FactorsTranscription GeneticBiologyBiochemistryChromatin remodelingCell LineHistonesMiceHistone H1Histone methylationAnimalsHepatectomyHistone codeNucleosomeGene RegulationPromoter Regions GeneticMolecular BiologyEarly Growth Response Protein 1Mice KnockoutCell BiologyMolecular biologySWI/SNFLiver RegenerationNucleosomesCell biologyHistoneLiverChromatosomeHepatocytesbiology.proteinTetradecanoylphorbol AcetateProtein Processing Post-TranslationalJournal of Biological Chemistry
researchProduct

Development of helium coolant DEMO first wall model for SYCOMORE system code based on HCLL concept

2018

Abstract The conceptual design of the demonstration fusion power reactor, known as DEMO, is ongoing and several reactor configurations have to be investigated by exploring different design parameters. For these reasons, within the European framework, systems codes like SYCOMORE (SYstem COde for MOdelling tokamak REactor) have been developed. SYCOMORE includes several specific modules, one of which is aimed to define a suitable design of the helium breeding blanket. The research activity has been devoted to improve the method to define automatically the First Wall design starting from thermal-hydraulic and thermo-mechanical considerations, using analytical design formulae and, also, taking i…

TokamakComputer scienceNuclear engineeringBlanket7. Clean energy01 natural sciences010305 fluids & plasmaslaw.invention[SPI]Engineering Sciences [physics]Development (topology)Conceptual designlawSystem code0103 physical sciencesThermalGeneral Materials Science010306 general physicsDEMOCivil and Structural EngineeringFW HCLLMechanical EngineeringFusion powerFinite element methodNuclear Energy and EngineeringBreeding blanketGeometric modelingSYCOMORE
researchProduct

A Lightweight Network Discovery Algorithm for Resource-constrained IoT Devices

2019

Although quite simple, existing protocols for the IoT suffer from the inflexibility of centralized infrastructures and require several configuration stages. The implementation of these protocols is often prohibitive on resource-constrained devices. In this work, we propose a distributed lightweight implementation of network discovery for simple IoT devices. Our approach is based on the exchange of symbolic executable code among nodes. Based on this abstraction, we propose an algorithm that makes even IoT resource-constrained nodes able to construct the network topology graph incrementally and without any a priori information about device positioning and presence. The minimal set of executab…

Topology constructionSIMPLE (military communications protocol)Computer scienceExecutable code exchangeResource-constrained devicecomputer.file_formatConstruct (python library)Network topologyDistributed processingSet (abstract data type)Computer Networks and CommunicationHardware and ArchitectureA priori and a posterioriGraph (abstract data type)Symbolic processingExecutableInternet of ThingAlgorithmcomputerSoftwareAbstraction (linguistics)2019 International Conference on Computing, Networking and Communications (ICNC)
researchProduct

The Tortricidae described by J. C. Fabricius (Lepidoptera)

2011

The identity and nomenclature of the 88 species of Tortricidae (Lepidoptera) described by J. C. Fabricius are reviewed. Type material deposited in the Natural History Museum Denmark is illustrated. Lectotypes for Tinea compositella (Fabricius, 1775), Pyralis rivellana (Fabricius, 1775) and P. strigana (Fabricius, 1775) are designated. Two new synonymies are proposed: Pyralis marmorana (Fabricius, 1798), syn. n., of Ancylis achatana (Denis and Schiffermuller, 1775), and P. rusticana (Fabricius, 1794), syn. n., of Epinotia solandriana (Linnaeus, 1758). In an appendix, the identity and nomenclature of the 49 species of non-Tortricidae described by Fabricius in the genus Pyralis Linnaeus, 1758 …

TortricidaeInsectaArthropodaEucosma aspidiscanaZoologyClepsis spectranaDryophthoridaeTortricidaeAnimaliaPyralidaeNomenclatureEcology Evolution Behavior and SystematicsTaxonomyPyralisbiologyTineidaeInternational Code of Zoological NomenclatureBiodiversitybiology.organism_classificationAncylis achatanaLepidopteraColeopteraArctiidaeNoctuidaeAnimal Science and ZoologyTaxonomy (biology)
researchProduct

Dynamic remodeling of histone modifications in response to osmotic stress in Saccharomyces cerevisiae.

2014

Abstract Background Specific histone modifications play important roles in chromatin functions; i.e., activation or repression of gene transcription. This participation must occur as a dynamic process. Nevertheless, most of the histone modification maps reported to date provide only static pictures that link certain modifications with active or silenced states. This study, however, focuses on the global histone modification variation that occurs in response to the transcriptional reprogramming produced by a physiological perturbation in yeast. Results We did a genome-wide chromatin immunoprecipitation analysis for eight specific histone modifications before and after saline stress. The most…

Transcriptional ActivationOsmotic stressTranscription GeneticSaccharomyces cerevisiaeBiologyMethylationChromatin remodelingHistonesOsmotic PressureStress PhysiologicalGene Expression Regulation FungalHistone methylationGeneticsHistone codeRNA MessengerGenome-wideChIP-ChipRegulation of gene expressionAcetylationChromatin Assembly and DisassemblyMolecular biologyChromatinChromatinCell biologyGene regulationHistoneAcetylationMultigene Familybiology.proteinEpigeneticsRNA Polymerase IIGenome FungalHistone modificationChromatin immunoprecipitationTranscriptionBiotechnologyResearch ArticleBMC genomics
researchProduct

Carving Out Other Narratives : Textual Treatment in Jonathan Safran Foer's Tree of Codes

2017

Tree of Codesbook-objectskirjallisuusnarratiivisuusdemediaatiokokeellisuuskirjallisuuskritiikkidemediationFoer Jonathan Safranesineetkerrontakirjatkirjallisuudentutkimus
researchProduct