Search results for "information systems"

showing 10 items of 1926 documents

The expressive power of the shuffle product

2010

International audience; There is an increasing interest in the shuffle product on formal languages, mainly because it is a standard tool for modeling process algebras. It still remains a mysterious operation on regular languages.Antonio Restivo proposed as a challenge to characterize the smallest class of languages containing the singletons and closed under Boolean operations, product and shuffle. This problem is still widely open, but we present some partial results on it. We also study some other smaller classes, including the smallest class containing the languages composed of a single word of length 2 which is closed under Boolean operations and shuffle by a letter (resp. shuffle by a l…

Class (set theory)Computer science[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]0102 computer and information sciences02 engineering and technologyStar (graph theory)01 natural sciencesExpressive powerTheoretical Computer ScienceRegular languageFormal language0202 electrical engineering electronic engineering information engineeringArithmeticAlgebraic numberComputingMilieux_MISCELLANEOUSDiscrete mathematicsComputer Science Applicationsshuffle operatorComputational Theory and Mathematics010201 computation theory & mathematicsProduct (mathematics)Formal language020201 artificial intelligence & image processingBoolean operations in computer-aided designWord (computer architecture)Information Systems
researchProduct

Filtering design for two-dimensional Markovian jump systems with state-delays and deficient mode information

2014

This paper is concerned with the problem of H"~ filtering for a class of two-dimensional Markovian jump linear systems described by the Fornasini-Marchesini local state-space model. The systems under consideration are subject to state-delays and deficient mode information in the Markov chain. The description of deficient mode information is comprehensive that simultaneously includes the exactly known, partially unknown and uncertain transition probabilities. By invoking the properties of the transition probability matrix, together with the convexification of uncertain domains, a new H"~ performance analysis criterion for the filtering error system is firstly derived. Then, via some matrix i…

Class (set theory)Information Systems and ManagementMarkov chainMode (statistics)H filteringComputer Science Applications1707 Computer Vision and Pattern RecognitionState (functional analysis)Filter (signal processing)Deficient mode informationComputer Science ApplicationsTheoretical Computer ScienceSet (abstract data type)Deficient mode information; H filtering; Markovian jump system; State-delay; Two-dimensional system; Artificial Intelligence; Software; Control and Systems Engineering; Theoretical Computer Science; Computer Science Applications1707 Computer Vision and Pattern Recognition; Information Systems and ManagementMatrix (mathematics)Control theoryState-delayArtificial IntelligenceControl and Systems EngineeringMarkovian jump systemApplied mathematicsTwo-dimensional systemDesign methodsSoftwareMathematics
researchProduct

Impact of chaotic dynamics on the performance of metaheuristic optimization algorithms : An experimental analysis

2022

Random mechanisms including mutations are an internal part of evolutionary algorithms, which are based on the fundamental ideas of Darwin's theory of evolution as well as Mendel's theory of genetic heritage. In this paper, we debate whether pseudo-random processes are needed for evolutionary algorithms or whether deterministic chaos, which is not a random process, can be suitably used instead. Specifically, we compare the performance of 10 evolutionary algorithms driven by chaotic dynamics and pseudo-random number generators using chaotic processes as a comparative study. In this study, the logistic equation is employed for generating periodical sequences of different lengths, which are use…

Class (set theory)Information Systems and ManagementTheoretical computer scienceComputer scienceEvolutionary algorithmChaoticalgoritmiikkaevoluutiolaskentaparviälyTheoretical Computer ScienceArtificial IntelligencealgoritmitLogistic functionevolutionary algorithmsRandomnessdeterministic chaoskaaosteoriaStochastic processswarm intelligencealgorithm performanceComputer Science Applicationsalgorithm dynamicsCHAOS (operating system)Control and Systems EngineeringDarwin (ADL)Software
researchProduct

Model approximation for two-dimensional Markovian jump systems with state-delays and imperfect mode information

2014

Published version of an article in the journal: Multidimensional Systems and Signal Processing. Also available from the publisher at: http://dx.doi.org/10.1007/s11045-013-0276-x This paper is concerned with the problem of {Mathematical expression} model approximation for a class of two-dimensional (2-D) discrete-time Markovian jump linear systems with state-delays and imperfect mode information. The 2-D system is described by the well-known Fornasini-Marchesini local state-space model, and the imperfect mode information in the Markov chain simultaneously involves the exactly known, partially unknown and uncertain transition probabilities. By using the characteristics of the transition proba…

Class (set theory)Mathematical optimizationMarkov chainmodel approximationApplied Mathematicstwo-dimensional systemsMarkovian jump systemsRegular polygonMode (statistics)imperfect mode informationState (functional analysis)VDP::Mathematics and natural science: 400::Mathematics: 410::Analysis: 411Computer Science ApplicationsMarkovian jumpMarkovian jump linear systemsArtificial IntelligenceHardware and ArchitectureSignal ProcessingApplied mathematicsstate-delaysImperfectSoftwareInformation SystemsMathematics
researchProduct

Factors affecting Nigerian teacher educators’ technology integration : Considering characteristics, knowledge constructs, ICT practices and beliefs

2020

To provide a diverse comprehension of teachers' TPACK (Technological, Pedagogical, and Content Knowledge) and how TPACK is reflected in practice, this study examined teacher educators' (TEs') conceptions of technology integration. Specifically, the main objective of the study was to investigate the factors influencing Nigerian teacher educators' technology integration using a self-completion survey administered to Nigerian teacher educators from three schools in the southern region of Nigeria. We utilized the partial least squares structural equation modeling (PLS-SEM) approach for the data analysis. Two frameworks—TPACK and Second Information Technology in Education Study (SITES)— guided t…

Class sizeGeneral Computer Sciencekoulutusteknologiapartial least square – sequential equation modeling (PLS-SEM)tieto- ja viestintätekniikka02 engineering and technologyStructural equation modelingEducation020204 information systems0202 electrical engineering electronic engineering information engineeringTechnology integrationMathematics educationComputingMilieux_COMPUTERSANDEDUCATIONopettajankoulutuskäyttöönottoICT in educationbusiness.industry05 social sciencesProfessional development050301 educationInformation technologytechnology integrationopettajatComprehensionInformation and Communications Technologyteacher educatorsPsychologybusinessContent knowledge0503 education
researchProduct

Producer's spatial equilibrium with a fuzzy constraint

1980

The classical theory of the producer’s equilibrium rests on two sets of particularly restrictive hypotheses. First it is implicitely assumed that all inputs and outputs are located in a single place where the producer is also implanted and where the production is carried out. Next it is assumed that the producer follows a precise behaviour pattern, by this we mean that the producer has complete information concerning the conditions of hisproductive activity and he has perfect command over both the set of inputs and the set of outputs; he realises the maximum profit allowed by the technological constraint which limits his possible actions and by the given price system. The aim of this study …

Classical theoryMathematical optimizationInformation Systems and ManagementGeneral Computer ScienceBehaviour patternAgent BehaviorManagement Science and Operations ResearchPrice system[SHS.ECO]Humanities and Social Sciences/Economics and FinanceIndustrial and Manufacturing EngineeringFuzzy constraintSpatial equilibriumProfit (economics)Economic spaceEconomic spaceComplete informationModeling and Simulation[ SHS.ECO ] Humanities and Social Sciences/Economies and finances[SHS.ECO] Humanities and Social Sciences/Economics and FinanceMathematics
researchProduct

On the chromatic number of disk graphs

1998

Colorings of disk graphs arise in the study of the frequency-assignment problem in broadcast networks. Motivated by the observations that the chromatic number of graphs modeling real networks hardly exceeds their clique number, we examine the related properties of the unit disk (UD) graphs and their different generalizations. For all these graphs including the most general class of the double disk (DD) graphs, it is shown that X(G) ≤ c.ω(G) for a constant c. Several coloring algorithms are analyzed for disk graphs, aiming to improve the bounds on X(G). We find that their worst-case performance expressed in the number of used colors is indeed reached in some instances.

Clique-sumComputer Networks and CommunicationsTrapezoid graph1-planar graphMetric dimensionCombinatoricsIndifference graphPathwidthHardware and ArchitectureChordal graphMaximal independent setSoftwareMathematicsofComputing_DISCRETEMATHEMATICSInformation SystemsMathematicsNetworks
researchProduct

An Investigation of Security and Privacy for Human Bond Communications

2017

Cloud computing securityPrivacy softwarebusiness.industry020204 information systemsBondInternet privacy0202 electrical engineering electronic engineering information engineering020206 networking & telecommunications02 engineering and technologyBusinessComputer securitycomputer.software_genrecomputerHuman Bond Communication
researchProduct

Querytogether : Enabling entity-centric exploration in multi-device collaborative search

2018

Collaborative and co-located information access is becoming increasingly common. However, fairly little attention has been devoted to the design of ubiquitous computing approaches for spontaneous exploration of large information spaces enabling co-located collaboration. We investigate whether an entity-based user interface provides a solution to support co-located search on heterogeneous devices. We present the design and implementation of QueryTogether, a multi-device collaborative search tool through which entities such as people, documents, and keywords can be used to compose queries that can be shared to a public screen or specific users with easy touch enabled interaction. We conducted…

Co-located searchUbiquitous computingComputer scienceExploratory searchmedia_common.quotation_subjectInformation access02 engineering and technologyLibrary and Information SciencesManagement Science and Operations ResearchMulti-deviceHuman–computer interaction020204 information systemsMulti device0202 electrical engineering electronic engineering information engineeringMedia TechnologyConversationBaseline (configuration management)media_commonSettore ING-INF/05 - Sistemi Di Elaborazione Delle Informazionita113Settore INF/01 - InformaticaCommon groundFlexibility (personality)020207 software engineering113 Computer and information sciencesComputer Science ApplicationsUser interfaceCollaborative searchInformation Systems
researchProduct

The dual equivalence of equations and coequations for automata

2015

The transition structure α : X ? X A of a deterministic automaton with state set X and with inputs from an alphabet A can be viewed both as an algebra and as a coalgebra. We use this algebra-coalgebra duality as a common perspective for the study of equations and coequations. For every automaton ( X , α ) , we define two new automata: free ( X , α ) and cofree ( X , α ) representing, respectively, the greatest set of equations and the smallest set of coequations satisfied by ( X , α ) . Both constructions are shown to be functorial. Our main result is that the restrictions of free and cofree to, respectively, preformations of languages and to quotients A * / C of A * with respect to a congr…

CoalgebraData ScienceCongruence relationComputer Science ApplicationsTheoretical Computer ScienceAutomatonCombinatoricsComputational Theory and MathematicsDeterministic automatonComputingMethodologies_DOCUMENTANDTEXTPROCESSINGAlphabetEquivalence (formal languages)QuotientInformation SystemsMathematics
researchProduct