Search results for "Theoretical Computer Science"

showing 10 items of 1151 documents

A Hypergraph Based Framework for Intelligent Tutoring of Algebraic Reasoning

2013

The translation of word problems into equations is one of the major difficulties for students regarding problem solving. This paper describes both a domain-specific knowledge representation and an inference engine based on hypergraphs that permits intelligent student supervision of this stage of the solving process. The framework presented makes it possible to simultaneously: a) represent all potential algebraic solutions to a given word problem; b) keep track of the student’s actions; c) provide automatic remediation; and d) determine the current state of the resolution process univocally. Starting from these ideas, we have designed an intelligent tutoring system (ITS). An experimental eva…

Discrete mathematicsWord problem (mathematics education)HypergraphTheoretical computer scienceKnowledge representation and reasoningComputer sciencePhysics::Physics EducationAlgebraic numberInference engineIntelligent tutoring systemAlgebraic reasoning
researchProduct

Theory of tailor automata

2019

Abstract In the paper, a fragment of the new theory of tailor automata is presented, within which a deterministic finite automaton was defined. The proposed automaton provides a theoretical model of an informally characterized biomolecular automaton. The idea of working of which is founded on the concept of alternating cut of some double-stranded fragments of DNA, with the use of a restriction enzyme and ligations of some double-stranded fragments of DNA, with the use of the ligase enzyme.

Discrete mathematicschemistry.chemical_classificationQuantitative Biology::BiomoleculesDNA ligaseGeneral Computer ScienceComputer scienceQuantitative Biology::Molecular Networks0102 computer and information sciences02 engineering and technologyDNA automatonBiomolecular computerDNA computingNonlinear Sciences::Cellular Automata and Lattice Gases01 natural sciencesTheoretical Computer ScienceAutomatonRestriction enzymeDeterministic finite automatonFragment (logic)chemistry010201 computation theory & mathematics0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingComputer Science::Formal Languages and Automata TheoryTheoretical Computer Science
researchProduct

Timed Sets, Functional Complexity, and Computability

2012

AbstractThe construction of various categories of “timed sets” is described in which the timing of maps is considered modulo a “complexity order”. The properties of these categories are developed: under appropriate conditions they form discrete, distributive restriction categories with an iteration. They provide a categorical basis for modeling functional complexity classes and allow the development of computability within these settings. Indeed, by considering “program objects” and the functions they compute, one can obtain models of computability – i.e. Turing categories – in which the total maps belong to specific complexity classes. Two examples of this are introduced in some detail whi…

Discrete mathematicscomplexity measurescomputabilityTheoretical computer scienceGeneral Computer ScienceBasis (linear algebra)Restriction categoriesComputabilityModuloTuring categoriesfunctional complexityTheoretical Computer ScienceDistributive propertyMathematics::Category TheoryComplexity classCategorical variableTuringcomputerPMathematicscomputer.programming_languageComputer Science(all)Electronic Notes in Theoretical Computer Science
researchProduct

A genetic system based on simulated crossover of sequences of two-bit genes

2006

AbstractWe introduce a genetic model based on simulated crossover of fixed sequences of two-bit genes. Results are(1)a lower bound on population size is exhibited such that a transition takes the stochastic finite population genetic system near the next state of the deterministic infinite population genetic system (provided both begin in the same state);(2)states and dynamics of the deterministic infinite population genetic system are derived for arbitrary (finite) fitness functions (expressed in terms of multivariate polynomials);(3)in the case of quadratic fitness defined by weight matrices with m nonnull entries it is shown that each state transition can be implemented in time O(m+l), wh…

Discrete mathematicseducation.field_of_studyGeneral Computer SciencePopulation sizeCrossoverPopulationState (functional analysis)Upper and lower boundsQuantitative Biology::GenomicsTheoretical Computer ScienceMarginal distribution genetic algorithmsChromosome (genetic algorithm)Genetic modelGenetic algorithmMax-cut problemeducationAlgorithmComputer Science(all)MathematicsTheoretical Computer Science
researchProduct

Robust stabilisation of 2D state-delayed stochastic systems with randomly occurring uncertainties and nonlinearities

2013

This paper is concerned with the state feedback control problem for a class of two-dimensional (2D) discrete-time stochastic systems with time-delays, randomly occurring uncertainties and nonlinearities. Both the sector-like nonlinearities and the norm-bounded uncertainties enter into the system in random ways, and such randomly occurring uncertainties and nonlinearities obey certain mutually uncorrelated Bernoulli random binary distribution laws. Sufficient computationally tractable linear matrix inequality–based conditions are established for the 2D nonlinear stochastic time-delay systems to be asymptotically stable in the mean-square sense, and then the explicit expression of the desired…

Distribution (number theory)Linear matrix inequality (LMI)Linear matrix inequality2D stochastic systems; Linear matrix inequality (LMI); Randomly occurring nonlinearities; Randomly occurring uncertainties; Control and Systems Engineering; Theoretical Computer Science; Computer Science Applications1707 Computer Vision and Pattern RecognitionBinary numberComputer Science Applications1707 Computer Vision and Pattern RecognitionExpression (computer science)Randomly occurring nonlinearitiesComputer Science ApplicationsTheoretical Computer ScienceNonlinear systemBernoulli's principleControl and Systems EngineeringControl theoryStability theory2D stochastic systemsRandomly occurring uncertaintiesMathematicsInternational Journal of Systems Science
researchProduct

An overview on XML similarity: Background, current trends and future directions

2009

In recent years, XML has been established as a major means for information management, and has been broadly utilized for complex data representation (e.g. multimedia objects). Owing to an unparalleled increasing use of the XML standard, developing efficient techniques for comparing XML-based documents becomes essential in the database and information retrieval communities. In this paper, we provide an overview of XML similarity/comparison by presenting existing research related to XML similarity. We also detail the possible applications of XML comparison processes in various fields, ranging over data warehousing, data integration, classification/clustering and XML querying, and discuss some…

Document Structure Description[ INFO.INFO-IR ] Computer Science [cs]/Information Retrieval [cs.IR]General Computer Science[INFO.INFO-WB] Computer Science [cs]/WebComputer sciencecomputer.internet_protocolEfficient XML Interchange[ INFO.INFO-WB ] Computer Science [cs]/Web[SCCO.COMP]Cognitive science/Computer science02 engineering and technologycomputer.software_genreTheoretical Computer ScienceXML Schema Editor[SCCO.COMP] Cognitive science/Computer science020204 information systems0202 electrical engineering electronic engineering information engineering[INFO.INFO-DB] Computer Science [cs]/Databases [cs.DB]ComputingMilieux_MISCELLANEOUS[ INFO.INFO-MM ] Computer Science [cs]/Multimedia [cs.MM][INFO.INFO-MM] Computer Science [cs]/Multimedia [cs.MM]Information retrieval[INFO.INFO-DB]Computer Science [cs]/Databases [cs.DB][INFO.INFO-WB]Computer Science [cs]/Web[INFO.INFO-MM]Computer Science [cs]/Multimedia [cs.MM]XML validationcomputer.file_formatXML frameworkXML database[ INFO.INFO-DB ] Computer Science [cs]/Databases [cs.DB][ SCCO.COMP ] Cognitive science/Computer science[INFO.INFO-IR]Computer Science [cs]/Information Retrieval [cs.IR]ComputingMethodologies_DOCUMENTANDTEXTPROCESSING020201 artificial intelligence & image processing[INFO.INFO-IR] Computer Science [cs]/Information Retrieval [cs.IR]computerXMLXML Catalog
researchProduct

Programming languages for data-Intensive HPC applications: A systematic mapping study

2020

This work is a result of activities from COST Action 10406 High -Performance Modelling and Simulation for Big Data Applications (cHiPSet), funded by the European Cooperation in Science and Technology. FCT, Portugal for grants: NOVA LINCS Research Laboratory Ref. UID/ CEC/ 04516/ 2019); INESC-ID Ref. UID/CEC/50021/2019; BioISI Ref. UID/MULTI/04046/2103; LASIGE Research Unit Ref. UID/CEC/00408/ 2019. A major challenge in modelling and simulation is the need to combine expertise in both software technologies and a given scientific domain. When High-Performance Computing (HPC) is required to solve a scientific problem, software development becomes a problematic issue. Considering the complexity…

Domain-Specific language (DSL)High performance computing (HPC)Computer scienceComputer Networks and CommunicationsBig data; Data-intensive applications; Domain-Specific language (DSL); General-Purpose language (GPL); High performance computing (HPC); Programming languages; Systematic mapping study (SMS)Systematic mapping study (SMS)Big dataData-intensive applicationsContext (language use)computer.software_genreTheoretical Computer ScienceSoftware portabilityBig dataSoftwareArtificial Intelligencebusiness.industryProgramming languageSoftware developmentGeneral-Purpose language (GPL)UsabilityProgramming languagesDigital libraryComputer Graphics and Computer-Aided DesignHardware and ArchitecturebusinesscomputerSoftware
researchProduct

Model Transformation Languages and Their Implementation by Bootstrapping Method

2008

In this paper a sequence of model transformation languages L0, L1, L2 is defined. The first language L0 is very simple, and for this language it is easy to build an efficient compiler to C++. The next language L1 is an extension of L0, and it contains powerful pattern definition facilities. The last language L2 is of sufficiently high level and can be used for implementation of traditional pattern-based high level model transformation languages, as well as for the development of model transformations directly. For languages L1 and L2 efficient compilers have been built using the bootstrapping method: L1 to L0 in L0, and L2 to L1 in L1. The results confirm the efficiency of model transformat…

Domain-specific languageTheoretical computer scienceProgramming languageComputer scienceModel transformationFirst languagecomputer.software_genreTransformation languageThird-generation programming languageTransformation (function)CompilercomputerBootstrapping (compilers)computer.programming_language
researchProduct

Modeling Drug Effects on Personalized 3D Models of the Heart: A Simulation Study

2010

[EN] The use of anti-arrhythmic drugs is common to treat heart rhythm disorders. Computational modeling and simulation are powerful tools that can be used to investigate the effects of specific drugs on cardiac electrophysiology. In this work a patient-specific anatomical heart model is built to study the effects of dofetilide, a drug that affects IKr current in cardiac cells. We study the multi-scale effects of the drug, from cellular to organ level, by simulating electrical propagation on tissue coupled cellular ion kinetics for several heart beats. Different cell populations configurations namely endocardial, midmyocardial and epicardial are used to test the effect of tissue heterogeneit…

Drugtherapy planningCardiac electrophysiologyHeart rhythm disordersComputer sciencemedia_common.quotation_subjectComputer Science (all)Cardiac electrophysiologyDofetilide3d modelmulti-scale modelingsimulationdrug cardio-toxicityTheoretical Computer ScienceTECNOLOGIA ELECTRONICAdrug modelingCardiac electrophysiology; drug cardio-toxicity; drug modeling; multi-scale modeling; simulation; therapy planning; Computer Science (all); Theoretical Computer SciencemedicineHeart beatAction potential durationNeurosciencemedicine.drugmedia_common
researchProduct

The on-line coupled atmospheric chemistry model system MECO(n) – Part 5: Expanding the Multi-Model-Driver (MMD v2.0) for 2-way data exchange includin…

2018

Abstract. As part of the Modular Earth Submodel System (MESSy), the Multi-Model-Driver (MMD v1.0) was developed to couple online the regional Consortium for Small-scale Modeling (COSMO) model into a driving model, which can be either the regional COSMO model or the global European Centre Hamburg general circulation model (ECHAM) (see Part 2 of the model documentation). The coupled system is called MECO(n), i.e., MESSy-fied ECHAM and COSMO models nested n times. In this article, which is part of the model documentation of the MECO(n) system, the second generation of MMD is introduced. MMD comprises the message-passing infrastructure required for the parallel execution (multiple programme mul…

ECHAMatmospheric chemistryTheoretical computer science010504 meteorology & atmospheric sciencesComputer science0208 environmental biotechnology02 engineering and technology01 natural sciencesComputational scienceMESSyMECO(n)Erdsystem-Modellierungddc:550multi-scale modelling0105 earth and related environmental sciencesEMACtwo-way-nestinCOSMObusiness.industrylcsh:QE1-996.5grid transformationModular designGrid020801 environmental engineeringlcsh:GeologyEarth sciencesTransformation (function)Modular Earth Submodel SystemData exchangeLine (geometry)dustGRIDbusinessMulti-Model-DriverremappingInterpolationData transmissionGeoscientific Model Development
researchProduct