Search results for "Application"

showing 10 items of 5559 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

THE TOPOLOGY OF BASIN BOUNDARIES IN A CLASS OF THREE-DIMENSIONAL DYNAMICAL SYSTEMS

1996

We will develop new methods to determine the topology of the basin boundary in a class of three-dimensional dynamical systems. One approach is to approximate the basin boundary by backward integration. Unfortunately, there are dynamical systems where it is hard to approximate the basin boundary by a numerical backward integration algorithm. We will introduce topological methods which will provide new information about the structure of the basin boundary. The topological invariants which we will use can be numerically computed.

Class (set theory)Dynamical systems theoryComputingMethodologies_SIMULATIONANDMODELINGApplied MathematicsStructure (category theory)Boundary (topology)ComputerApplications_COMPUTERSINOTHERSYSTEMSStructural basinTopologyModeling and SimulationTopological invariantsIntegration algorithmEngineering (miscellaneous)Physics::Atmospheric and Oceanic PhysicsTopology (chemistry)MathematicsInternational Journal of Bifurcation and Chaos
researchProduct

Stochastic Stability Analysis for Markovian Jump Neutral Nonlinear Systems

2012

In this paper, the stability problem is studied for a class of Markovian jump neutral nonlinear systems with time-varying delay. By Lyapunov-Krasovskii function approach, a novel mean-square exponential stability criterion is derived for the situations that the system's transition rates are completely accessible, partially accessible and non-accessible, respectively. Moreover, the developed stability criterion is extended to the systems with different bounded sector nonlinear constraints. Finally, some numerical examples are provided to illustrate the effectiveness of the proposed methods.

Class (set theory)Engineeringbusiness.industryStability criterionStochastic stability; Markovian jump systemFunction (mathematics)nonlinear systemStability (probability)lcsh:QA75.5-76.95Computer Science ApplicationsNonlinear systemMarkovian jumpExponential stabilityControl and Systems EngineeringControl theoryModeling and SimulationBounded functionApplied mathematicslcsh:Electronic computers. Computer sciencebusinessSoftwareModeling, Identification and Control
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

Stability of genetic regulatory networks with time-varying delay: Delta operator method

2015

This paper investigates the stability problem for a class of uncertain genetic regulatory networks (GRNs) with time-varying delay via delta operator approach. Both the parameter uncertainty and the generalized activations are considered in the model under study. By constructing an appropriate Lyapunov-Krasovskii functional, the stability and robust stability conditions of GRNs are presented under the delta operator frame. These conditions can be expressed in terms of linear matrix inequalities (LMIs). Finally, a numerical example is employed to illustrate the effectiveness of the proposed results.

Class (set theory)Stability conditionsComputer Science::Systems and ControlArtificial IntelligenceControl theoryCognitive NeuroscienceFrame (networking)Stability (learning theory)Delta operatorLinear matrixComputer Science ApplicationsMathematicsNeurocomputing
researchProduct

Robust Finite-Time Control of Switched Linear Systems and Application to a Class of Servomechanism Systems

2015

This paper investigates finite-time (FT) stability and stabilization problems for a class of switched linear systems with polytopic uncertainties. Both stable and unstable subsystems are considered to coexist in the system, and a new concept of extended FT stability is proposed as the first attempt. A stability criterion is first established, where the admissible maximum switching number is obtained while ensuring extended FT stability of switched linear systems with time-varying delays under a given maximum ratio between the running time of unstable subsystems and the running time of stable subsystems. Sufficient conditions on the existence of desired memory state-feedback controllers are …

Class (set theory)Stability criterionLinear systemServomechanismStability (probability)Computer Science Applicationslaw.inventionExponential stabilityControl and Systems EngineeringlawControl theoryCircle criterionElectrical and Electronic EngineeringNumerical stabilityMathematicsIEEE/ASME Transactions on Mechatronics
researchProduct

Pattern classification using a new border identification paradigm: The nearest border technique

2015

Abstract There are many paradigms for pattern classification such as the optimal Bayesian, kernel-based methods, inter-class border identification schemes, nearest neighbor methods, nearest centroid methods, among others. As opposed to these, this paper pioneers a new paradigm, which we shall refer to as the nearest border (NB) paradigm. The philosophy for developing such a NB strategy is as follows: given the training data set for each class, we shall attempt to create borders for each individual class. However, unlike the traditional border identification (BI) methods, we do not undertake this by using inter-class criteria; rather, we attempt to obtain the border for a specific class in t…

Class (set theory)Theoretical computer scienceComputer sciencebusiness.industryCognitive NeuroscienceCentroidComputer Science Applicationsk-nearest neighbors algorithmSet (abstract data type)Kernel (linear algebra)Identification (information)Artificial IntelligenceKernel (statistics)OutlierArtificial intelligencebusiness
researchProduct

A delay time bound for distributed parameter circuits with bipolar transistors

1990

We prove here a stability theorem concerning a parabolic system of equations with non-linear boundary conditions that governs the behaviour of a class of networks in which the bipolar transistors operating under large-signal conditions are interconnected with reg-lines modelled by telegraph equations

Class (set theory)business.industryComputer scienceApplied MathematicsBipolar junction transistorElectrical engineeringTopologyComputer Science ApplicationsElectronic Optical and Magnetic MaterialsParabolic systemBoundary value problemElectrical and Electronic EngineeringbusinessStability theoremDelay timeElectronic circuitInternational Journal of Circuit Theory and Applications
researchProduct