Search results for "Application"

showing 10 items of 5559 documents

Discrete Derivatives for Atom-Pairs as a Novel Graph-Theoretical Invariant for Generating New Molecular Descriptors: Orthogonality, Interpretation an…

2013

This report presents a new mathematical method based on the concept of the derivative of a molecular graph (G) with respect to a given event (S) to codify chemical structure information. The derivate over each pair of atoms in the molecule is defined as ∂G/∂S(vi  , vj )=(fi -2fij +fj )/fij , where fi (or fj ) and fij are the individual frequency of atom i (or j) and the reciprocal frequency of the atoms i and j, respectively. These frequencies characterize the participation intensity of atom pairs in S. Here, the event space is composed of molecular sub-graphs which participate in the formation of the G skeleton that could be complete (representing all possible connected sub-graphs) or comp…

Discrete mathematicsSteric effectsQuantitative structure–activity relationshipOrganic ChemistryComputer Science Applicationschemistry.chemical_compoundchemistryStructural BiologyComputational chemistryMolecular descriptorDrug DiscoveryPrincipal component analysisMolecular MedicineMolecular graphLinear independenceInvariant (mathematics)Linear combinationMolecular informatics
researchProduct

On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications

1996

AbstractWe provide a uniform framework for the study of index data structures for a two-dimensional matrixTEXT[1:n, 1:n] whose entries are drawn from an ordered alphabetΣ. An index forTEXTcan be informally seen as the two-dimensional analog of the suffix tree for a string. It allows on-line searches and statistics to be performed onTEXTby representing compactly theΘ(n3) square submatrices ofTEXTin optimalO(n2) space. We identify 4n−1families of indices forTEXT, each containing ∏ni=1(2i−1)! isomorphic data structures. We also develop techniques leading to a single algorithm that efficiently builds any index in any family inO(n2logn) time andO(n2) space. Such an algorithm improves in various …

Discrete mathematicsSuffix treeString (computer science)Generalized suffix treeBlock matrixData structureSquare matrixComputer Science ApplicationsTheoretical Computer Sciencelaw.inventionCombinatoricsComputational Theory and MathematicslawTree (set theory)SuffixInformation SystemsMathematics
researchProduct

Ranking fuzzy interval numbers in the setting of random sets – further results

1999

Abstract We present some new properties of several fuzzy order relations, defined on the set of fuzzy numbers, from among those introduced in [S. Chanas, M. Delgado, J.L. Verdegay, M.A. Vila, Information Sciences 69 (1993) 201–217]. The main result is proving that four from among the relations considered in [S. Chanas, M. Delgado, J.L. Verdegay, M.A. Vila, Information Sciences 69 (1993) 201–217] are strongly transitive (s-transitive).

Discrete mathematicsTransitive relationInformation Systems and ManagementFuzzy classificationFuzzy setInterval (mathematics)Type-2 fuzzy sets and systemsFuzzy logicComputer Science ApplicationsTheoretical Computer ScienceArtificial IntelligenceControl and Systems EngineeringFuzzy mathematicsFuzzy numberSoftwareMathematicsInformation Sciences
researchProduct

Uncountable classical and quantum complexity classes

2018

It is known that poly-time constant-space quantum Turing machines (QTMs) and logarithmic-space probabilistic Turing machines (PTMs) recognize uncountably many languages with bounded error (A.C. Cem Say and A. Yakaryılmaz, Magic coins are useful for small-space quantum machines. Quant. Inf. Comput. 17 (2017) 1027–1043). In this paper, we investigate more restricted cases for both models to recognize uncountably many languages with bounded error. We show that double logarithmic space is enough for PTMs on unary languages in sweeping reading mode or logarithmic space for one-way head. On unary languages, for quantum models, we obtain middle logarithmic space for counter machines. For binary la…

Discrete mathematicsUnary operationComputer scienceGeneral MathematicsLinear spaceMagic (programming)Binary number0102 computer and information sciences02 engineering and technology01 natural sciencesComputer Science ApplicationsTuring machinesymbols.namesake010201 computation theory & mathematics0202 electrical engineering electronic engineering information engineeringComplexity classsymbols020201 artificial intelligence & image processingUncountable setTime complexitySoftwareRAIRO - Theoretical Informatics and Applications
researchProduct

Uncountable Realtime Probabilistic Classes

2018

We investigate the minimal cases for realtime probabilistic machines that can define uncountably many languages with bounded error. We show that logarithmic space is enough for realtime PTMs on unary languages. On non-unary case, we obtain the same result for double logarithmic space, which is also tight. When replacing the work tape with a few counters, we can still achieve similar results for unary linear-space two-counter automata, unary sublinear-space three-counter automata, and non-unary sublinear-space two-counter automata. We also show how to slightly improve the sublinear-space constructions by using more counters.

Discrete mathematicsUnary operationComputer scienceProbabilistic logic020206 networking & telecommunicationsComputerApplications_COMPUTERSINOTHERSYSTEMS0102 computer and information sciences02 engineering and technology01 natural sciencesLogarithmic spaceBounded error010201 computation theory & mathematics0202 electrical engineering electronic engineering information engineeringComputer Science (miscellaneous)020201 artificial intelligence & image processingUncountable setBinary caseInternational Journal of Foundations of Computer Science
researchProduct

Common fixed point theorems for families of occasionally weakly compatible mappings

2011

We prove some common fixed point theorems in probabilistic semi-metric spaces for families of occasionally weakly compatible mappings. We also give a common fixed point theorem for mappings satisfying an integral-type implicit relation.

Discrete mathematicsWeakly compatibleRelation (database)010102 general mathematicsProbabilistic logicOccasionally weakly compatible mappingProbabilistic metric spaceCommon fixed point01 natural sciencesProbabilistic metric spaceComputer Science Applications010101 applied mathematicsLeast fixed pointSettore MAT/05 - Analisi MatematicaModelling and SimulationModeling and SimulationCommon fixed point0101 mathematicsCoincidence pointCommon fixed point theoremMathematicsMathematical and Computer Modelling
researchProduct

Automated detection and localization system of myocardial infarction in single-beat ECG using Dual-Q TQWT and wavelet packet tensor decomposition.

2019

Abstract Background and objective It is challenging to conduct real-time identification of myocardial infarction (MI) due to artifact corruption and high dimensionality of multi-lead electrocardiogram (ECG). In the present study, we proposed an automated single-beat MI detection and localization system using dual-Q tunable Q-factor wavelet transformation (Dual-Q TQWT) denoising algorithm. Methods After denoising and segmentation of ECG, a fourth-order wavelet tensor (leads × subbands × samples × beats) was constructed based on the discrete wavelet packet transform (DWPT), to represent the features considering the information of inter-beat, intra-beat, inter-frequency, and inter-lead. To red…

Discrete wavelet transformComputer scienceNoise reductionMyocardial InfarctionWavelet AnalysisHealth InformaticsHilbert–Huang transform030218 nuclear medicine & medical imaging03 medical and health sciencesAutomationElectrocardiography0302 clinical medicineWaveletHumansSegmentationPrincipal Component Analysisbusiness.industryReproducibility of ResultsPattern recognitionSignal Processing Computer-AssistedMultilinear principal component analysisComputer Science ApplicationsCase-Control StudiesArtificial intelligencebusinessClassifier (UML)030217 neurology & neurosurgerySoftwareAlgorithmsComputer methods and programs in biomedicine
researchProduct

Application of principal component analysis and wavelet transform to fatigue crack detection in waveguides

2010

Ultrasonic Guided Waves (UGWs) are a useful tool in structural health monitoring (SHM) applications that can benefit from built-in transduction, moderately large inspection ranges and high sensitivity to small flaws. This paper describes a SHM method based on UGWs, discrete wavelet transform (DWT), and principal component analysis (PCA) able to detect and quantify the onset and propagation of fatigue cracks in structural waveguides. The method combines the advantages of guided wave signals processed through the DWT with the outcomes of selecting defect-sensitive features to perform a multivariate diagnosis of damage. This diagnosis is based on the PCA. The framework presented in this paper …

Discrete wavelet transformstructural healthEngineeringGuided wave testingSettore ICAR/07 - Geotecnicabusiness.industryWavelet transformTransduction (psychology)principal component analysiultrasonic guided waveComputer Science ApplicationsControl and Systems EngineeringPrincipal component analysisElectronic engineeringUltrasonic sensorSensitivity (control systems)Structural health monitoringElectrical and Electronic Engineeringbusinessfatigue crack detection
researchProduct

The symmetric boundary element method for unilateral contact problems

2008

Abstract On the basis of the boundary integral equation method, in its symmetric formulation, the frictionless unilateral contact between two elastic bodies has been studied. A boundary discretization by boundary elements leads to an algebraic formulation in the form of a linear complementarity problem. In this paper the process of contact or detachment is obtained through a step by step analysis by using generalized (weighted) quantities as the check elements: the detachment or the contact phenomenon may happen when the weighted traction or the weighted displacement is greater than the weighted cohesion or weighted minimum reference gap, respectively. The applications are performed by usin…

DiscretizationIterative methodMechanical EngineeringTraction (engineering)Mathematical analysisComputational MechanicsGeneral Physics and AstronomyUnilateral contactBoundary (topology)Frictionless contactSymmetric BEMStep by step analysis.Linear complementarity problemDisplacement (vector)Computer Science ApplicationsMacro-elementMechanics of MaterialsSymmetric BEM Frictionless contact Iterative technique Macro-elements Step by step analysis.Iterative techniqueSettore ICAR/08 - Scienza Delle CostruzioniBoundary element methodMathematicsComputer Methods in Applied Mechanics and Engineering
researchProduct

The indirect force method

1990

Abstract It is known that the matrix force method shows some advantages over the displacement method for certain classes of problems, particularly in optimization and in the stress concentration analysis. Notwithstanding this, few efforts have been made to employ this method in engineering problems. In this paper, within the elastic analysis of frames and trusses, the indirect force method, utilizing beam-node type finite elements, is proposed. This method is based on the kinematical and mechanical study of nodes and of beams, the latter connected with the nodes by their first extremes according to a preliminary arrangement. In this formulation kinematical singularities are included, in the…

DiscretizationMechanical EngineeringMathematical analysisFrame (networking)Structure (category theory)TrussGeometryFinite element methodComputer Science ApplicationsMatrix (mathematics)Modeling and SimulationGeneral Materials ScienceGravitational singularityCivil and Structural EngineeringEquation solvingMathematicsComputers & Structures
researchProduct