Search results for " Theoretical Computer Science"

showing 8 items of 28 documents

Input-to-state stability for discrete-time nonlinear switched singular systems

2016

Discrete-time nonlinear switched singular systems (SSSs) are investigated.The input-to-state stability (ISS) problems for discrete-time nonlinear SSSs are concerned.The ISS criteria are obtained via average dwell time approach and iterative algorithm of discrete-time systems.The switching rules are optimized and designed. This paper investigates the input-to-state stability (ISS) problems for a class of discrete-time nonlinear switched singular systems (SSSs). Two novel ISS criteria are proposed based on average dwell time (ADT) approach and iterative algorithm of discrete-time systems (IADS). In particular, the following two cases are considered for the underlying systems: the first case i…

Lyapunov function0209 industrial biotechnologyInformation Systems and ManagementIterative method02 engineering and technologyStability (probability)Theoretical Computer Sciencesymbols.namesake020901 industrial engineering & automationExponential stabilityControl theoryArtificial IntelligenceIterative algorithm0202 electrical engineering electronic engineering information engineeringMathematicsSwitched singular systemInput-to-state stabilityProcess (computing)Computer Science Applications1707 Computer Vision and Pattern RecognitionAverage dwell time; Discrete-time system; Input-to-state stability; Iterative algorithm; Nonlinear system; Switched singular system; Control and Systems Engineering; Theoretical Computer Science; Software; Computer Science Applications1707 Computer Vision and Pattern Recognition; Information Systems and Management; Artificial IntelligenceComputer Science ApplicationsNonlinear systemDwell timeDiscrete time and continuous timeDiscrete-time systemControl and Systems EngineeringsymbolsNonlinear system020201 artificial intelligence & image processingAverage dwell timeSoftware
researchProduct

On integral input-to-state stability for a feedback interconnection of parameterised discrete-time systems

2014

This paper addresses integral input-to-state stability iISS for a feedback interconnection of parameterised discrete-time systems involving two subsystems. Particularly, we give a construction for a smooth iISS Lyapunov function for the whole system from the sum of nonlinearly weighted Lyapunov functions of individual subsystems. Motivations for such a construction are given. We consider two main cases. The first one investigates iISS for the whole system when both subsystems are iISS. The second one gives iISS for the interconnected system when one of subsystems is allowed to be input-to-state stable. The approach is also valid for both discrete-time cascades and a feedback interconnection…

Lyapunov functionsmall-gain conditions0209 industrial biotechnologyInterconnectionStability (learning theory)Computer Science Applications1707 Computer Vision and Pattern Recognition02 engineering and technologyState (functional analysis)Computer Science ApplicationsWhole systems0-global asymptotic stabilityTheoretical Computer Scienceinput-to-state stabilitysymbols.namesakeparameterised discrete-time systems020901 industrial engineering & automationDiscrete time and continuous timeControl theoryControl and Systems Engineering0202 electrical engineering electronic engineering information engineeringsymbols020201 artificial intelligence & image processing0-global asymptotic stability; input-to-state stability; integral input-to-state stability; parameterised discrete-time systems; small-gain conditions; Control and Systems Engineering; Theoretical Computer Science; Computer Science Applications1707 Computer Vision and Pattern Recognitionintegral input-to-state stabilityMathematics
researchProduct

model reduction for continuous-time Markovian jump systems with incomplete statistics of mode information

2013

This paper investigates the problem of model reduction for a class of continuous-time Markovian jump linear systems with incomplete statistics of mode information, which simultaneously considers the exactly known, partially unknown and uncertain transition rates. By fully utilising the properties of transition rate matrices, together with the convexification of uncertain domains, a new sufficient condition for performance analysis is first derived, and then two approaches, namely, the convex linearisation approach and the iterative approach, are developed to solve the model reduction problem. It is shown that the desired reduced-order models can be obtained by solving a set of strict linear…

Mathematical optimizationModel reductionbusiness.industryMarkovian jump systemsRegular polygonLinear matrix inequalityComputer Science Applications1707 Computer Vision and Pattern RecognitionLinear matrixLinear matrix inequalityTransition rate matrixIncomplete statistics of mode informationComputer Science ApplicationsTheoretical Computer ScienceMarkovian jump linear systemsMarkovian jumpSoftwareControl and Systems EngineeringStatisticsIncomplete statistics of mode information; Linear matrix inequality; Markovian jump systems; Model reduction; Control and Systems Engineering; Theoretical Computer Science; Computer Science Applications1707 Computer Vision and Pattern RecognitionDesign methodsbusinessMathematicsInternational Journal of Systems Science
researchProduct

Words with the Maximum Number of Abelian Squares

2015

An abelian square is the concatenation of two words that are anagrams of one another. A word of length n can contain \(\varTheta (n^2)\) distinct factors that are abelian squares. We study infinite words such that the number of abelian square factors of length n grows quadratically with n.

Quadratic growthComputer Science (all)ConcatenationComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Computer Science (all); Theoretical Computer ScienceSquare (algebra)Theoretical Computer ScienceCombinatoricsAnagramsIrrational numberGolden ratioAbelian groupComputer Science::Formal Languages and Automata TheoryWord (group theory)Mathematics
researchProduct

A tool to support the creation of datasets of tampered videos

2015

Digital Video Forensics is getting a growing interest from the Multimedia research community, as the need for methods to validate the authenticity of a video content is increasing with the number of videos freely available to the digital users. Unlike Digital Image Forensics, to our knowledge, there are not standard datasets to test video forgery detection techniques. In this paper we present a new tool to support the users in creating datasets of tampered videos. We furthermore present our own dataset and we discuss some remarks about how to create forgeries difficult to be detected by an observer, to the naked eye.

Settore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniCopy move forgeryCopy move forgeryInformation retrievalVideo forensicComputer scienceForgery detectionComputer Science (all)Digital videoComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONObject trackingCopy move forgery; Object tracking; Video forensics; Computer Science (all); Theoretical Computer ScienceData scienceTheoretical Computer ScienceVideo trackingResearch communityDigital image forensics
researchProduct

Some reflections on Fuzzy Set Theory as an Experimental Science

2014

The aim of this paper is to open a critical discussion on the claim, recently presented in the community and especially heralded by Enric Trillas, that fuzzy logic should be seen as an “experimental science”. The first interesting aspect of such remark is whether and in which way such position has consequences on the real development of the research, or if it is simply a (different) way of looking at the same phenomenon. As a consequence, we investigate the possible connection to Zadeh’s distiction between Fuzzy logic in a restricted sense and in a general sense. We shall argue that Trillas’s claim not only strongly supports the necessity for such a distinction, but provides a path of inves…

Soft computingFuzzy Sets Soft Computing Theoretical Computer ScienceSettore INF/01 - InformaticaConnection (vector bundle)Fuzzy setExperimental scienceSettore M-FIL/02 - Logica E Filosofia Della ScienzaFuzzy logicEpistemologyDevelopment (topology)PhenomenonPath (graph theory)AlgorithmMathematics
researchProduct

An Innovative Similarity Measure for Sentence Plagiarism Detection

2016

We propose and experimentally assess Semantic Word Error Rate (SWER), an innovative similarity measure for sentence plagiarism detection. SWER introduces a complex approach based on latent semantic analysis, which is capable of outperforming the accuracy of competitor methods in plagiarism detection. We provide principles and functionalities of SWER, and we complement our analytical contribution by means of a significant preliminary experimental analysis. Derived results are promising, and confirm to use the goodness of our proposal.

business.industryComputer scienceLatent semantic analysisPlagiarism DetectionComputer Science (all)Sentence similarity measureWord error rate02 engineering and technologySimilarity measurecomputer.software_genreComplement (complexity)Theoretical Computer SciencePlagiarism detection020204 information systems0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingPlagiarism detectionArtificial intelligenceSentence Similarity MeasurebusinesscomputerNatural language processingSentencePlagiarism detection; Sentence similarity measure; Theoretical Computer Science; Computer Science (all)
researchProduct

MUV: A Game to Encourage Sustainable Mobility Habits

2019

This working paper investigates the question of changing people mobility towards more sustainable habits involving them in an engaging gameplay. The work is performed within MUV H2020 research and innovation action. The game design, definition and features have been co-created through the involvement of different citizens and stakeholders in six European neighbourhoods. The paper discusses the game design as resulting from co-creation and co-design experiences with each neighbourhood communities involved in initial phases. The paper argues that the local co-design activities have influenced the game definition, together with the community engagement approach. The MUV gameplay approach resul…

sustainable urban mobilityCo-creation; Community engagement; Gamification; Urban sustainable mobility; Theoretical Computer Science; Computer Science (all)community engagementEconomic JusticeTheoretical Computer ScienceGame design11. Sustainability0502 economics and businessSettore ICAR/13 - Disegno IndustrialeCo-creationgamificationSociologyNeighbourhood (mathematics)060201 languages & linguistics050210 logistics & transportationSettore ICAR/20 - Tecnica E Pianificazione UrbanisticaCommunity engagementbusiness.industryCo-creationCommunity engagementComputer Science (all)05 social sciencesEquity (finance)06 humanities and the artsPublic relationsGamificationWork (electrical)Action (philosophy)0602 languages and literatureUrban sustainable mobilitybusinessco-creation
researchProduct