Search results for "Data type"

showing 10 items of 1183 documents

The linearized Calderón problem on complex manifolds

2019

International audience; In this note we show that on any compact subdomain of a Kähler manifold that admits sufficiently many global holomorphic functions , the products of harmonic functions form a complete set. This gives a positive answer to the linearized anisotropic Calderón problem on a class of complex manifolds that includes compact subdomains of Stein manifolds and sufficiently small subdomains of Kähler manifolds. Some of these manifolds do not admit limiting Carleman weights, and thus cannot by treated by standard methods for the Calderón problem in higher dimensions. The argument is based on constructing Morse holo-morphic functions with approximately prescribed critical points.…

Class (set theory)Pure mathematicsGeneral MathematicsHolomorphic function01 natural sciencesinversio-ongelmatSet (abstract data type)symbols.namesake[MATH.MATH-AP]Mathematics [math]/Analysis of PDEs [math.AP]0101 mathematics[MATH]Mathematics [math]complex manifoldMathematics::Symplectic GeometryMathematicsosittaisdifferentiaaliyhtälötCalderón problemMathematics::Complex VariablesApplied MathematicsRiemann surface010102 general mathematicsLimitingStandard methodsManifold010101 applied mathematicsHarmonic function[MATH.MATH-DG]Mathematics [math]/Differential Geometry [math.DG]symbolsinverse problemMathematics::Differential Geometrymonistot
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

Comparative analysis of architectures for monitoring cloud computing infrastructures

2015

The lack of control over the cloud resources is one of the main disadvantages associated to cloud computing. The design of efficient architectures for monitoring such resources can help to overcome this problem. This contribution describes a complete set of architectures for monitoring cloud computing infrastructures, and provides a taxonomy of them. The architectures are described in detail, compared among them, and analysed in terms of performance, scalability, usage of resources, and security capabilities. The architectures have been implemented in real world settings and empirically validated against a real cloud computing infrastructure based on OpenStack. More than 1000 virtual machin…

Cloud computing securityComputer Networks and Communicationsbusiness.industryComputer scienceDistributed computingCloud computingcomputer.software_genreSet (abstract data type)Utility computingHardware and ArchitectureVirtual machineScalabilitybusinesscomputerSoftwareFuture Generation Computer Systems
researchProduct

Scaling Up a Metric Learning Algorithm for Image Recognition and Representation

2008

Maximally Collapsing Metric Learning is a recently proposed algorithm to estimate a metric matrix from labelled data. The purpose of this work is to extend this approach by considering a set of landmark points which can in principle reduce the cost per iteration in one order of magnitude. The proposal is in fact a generalized version of the original algorithm that can be applied to larger amounts of higher dimensional data. Exhaustive experimentation shows that very similar behavior at a lower cost is obtained for a wide range of the number of landmark points used.

Clustering high-dimensional dataSet (abstract data type)Range (mathematics)LandmarkMetric (mathematics)Landmark pointRepresentation (mathematics)AlgorithmFacial recognition systemMathematics
researchProduct

Regularized Regression Incorporating Network Information: Simultaneous Estimation of Covariate Coefficients and Connection Signs

2014

We develop an algorithm that incorporates network information into regression settings. It simultaneously estimates the covariate coefficients and the signs of the network connections (i.e. whether the connections are of an activating or of a repressing type). For the coefficient estimation steps an additional penalty is set on top of the lasso penalty, similarly to Li and Li (2008). We develop a fast implementation for the new method based on coordinate descent. Furthermore, we show how the new methods can be applied to time-to-event data. The new method yields good results in simulation studies concerning sensitivity and specificity of non-zero covariate coefficients, estimation of networ…

Clustering high-dimensional databusiness.industryjel:C41jel:C13Machine learningcomputer.software_genreRegressionhigh-dimensional data gene expression data pathway information penalized regressionConnection (mathematics)Set (abstract data type)Lasso (statistics)CovariateArtificial intelligenceSensitivity (control systems)businessCoordinate descentAlgorithmcomputerMathematics
researchProduct

Modelling swarm-intelligent systems for medical applications

2017

Modeling swarm intelligent systems has attracted attention of researchers over the last decade, as the attributes such as self-organization, self-regulation or collective behavior exhibited by the system entities while following a certain set of rules, can be implemented with the aim at investigating complexity of the problems that an individual would be unable to tackle in real world. In this keynote paper, meta-heuristics and paradigms of modeling swarm-intelligent systems will be discussed with respect to their application areas for medical purposes.

Collective behaviorswarm intelligenceComputer sciencebusiness.industryIntelligent decision support systemCollective intelligenceSwarm behaviourcollective intelligencebioinformaticsSwarm intelligenceSet (abstract data type)modeling medical systemsApplication areasArtificial intelligencebusiness2017 Twelfth International Conference on Digital Information Management (ICDIM)
researchProduct

Construction and stability of a close-packed structure observed in thin colloidal crystals

2007

We have characterized a close-packed structure of confined charged colloidal spheres, which has been recently discovered. Using different microscopy experiments, the vertically arranged hexagonal planes of n - hcp perpendicular are found to continuously evolve from the horizontally oriented stacks of n hexagonal planes (nDelta) following the maximum packing criterion, but discontinuously transform to a stack of n+1 square planes [(n+1)[SHAPE OF A SQUARE]]. Large mechanically stable domains with threefold twin structures are regularly observed in the suspended state at packing fractions between 0.4 and 0.58.

ColloidMaterials sciencegenetic structuresStack (abstract data type)MicroscopyPerpendicularSPHERESNanotechnologyColloidal crystalMolecular physicsStability (probability)Square (algebra)Physical Review E
researchProduct

Languages with mismatches

2007

AbstractIn this paper we study some combinatorial properties of a class of languages that represent sets of words occurring in a text S up to some errors. More precisely, we consider sets of words that occur in a text S with k mismatches in any window of size r. The study of this class of languages mainly focuses both on a parameter, called repetition index, and on the set of the minimal forbidden words of the language of factors of S with errors. The repetition index of a string S is defined as the smallest integer such that all strings of this length occur at most in a unique position of the text S up to errors. We prove that there is a strong relation between the repetition index of S an…

Combinatorics on wordsApproximate string matchingGeneral Computer ScienceRepetition (rhetorical device)String (computer science)Search engine indexingComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Approximate string matchingData structureTheoretical Computer ScienceCombinatoricsSet (abstract data type)Formal languagesCombinatorics on words Formal languages Approximate string matching IndexingIndexingWord (group theory)MathematicsInteger (computer science)Computer Science(all)Theoretical Computer Science
researchProduct

General Set-Up

2017

CombinatoricsAdditive categorySet (abstract data type)Abelian categoryMathematics
researchProduct

An algorithm to find all paths between two nodes in a graph

1990

CombinatoricsComputational MathematicsNumerical AnalysisPhysics and Astronomy (miscellaneous)Applied MathematicsModeling and SimulationGraph (abstract data type)Adjacency matrixAlgorithmComputer Science ApplicationsMathematicsJournal of Computational Physics
researchProduct