Search results for "vector"

showing 10 items of 2660 documents

Normed vector spaces consisting of classes of convex sets

1965

CombinatoricsStrictly convex spaceConvex analysisGeneral MathematicsLocally convex topological vector spaceUniformly convex spaceAbsolutely convex setReflexive spaceTopologyMathematicsDual pairNormed vector spaceMathematische Zeitschrift
researchProduct

The index of stable critical points

2002

Abstract In this paper we show that in dimension greater or equal than 3 the index of a stable critical point can be any integer. More concretely, given any k∈ Z and n⩾3 we construct a C ∞ vector field on R n with a unique critical point which is stable (in positive and negative time) and has index equal to k. This result extends previous ones on the index of stable critical points.

CombinatoricsVector fieldPlug constructionIsolated critical pointVector fieldGeometry and TopologyTopologyStabilityCritical point (mathematics)MathematicsIndexTopology and its Applications
researchProduct

Weak commutation relations of unbounded operators and applications

2011

Four possible definitions of the commutation relation $[S,T]=\Id$ of two closable unbounded operators $S,T$ are compared. The {\em weak} sense of this commutator is given in terms of the inner product of the Hilbert space $\H$ where the operators act. Some consequences on the existence of eigenvectors of two number-like operators are derived and the partial O*-algebra generated by $S,T$ is studied. Some applications are also considered.

CommutatorPure mathematicsunbounded operatorsCommutation relationHilbert spaceMathematics - Operator AlgebrasFOS: Physical sciencesStatistical and Nonlinear PhysicsMathematical Physics (math-ph)symbols.namesakeSettore MAT/05 - Analisi MatematicaProduct (mathematics)Linear algebraFOS: MathematicssymbolsCommutationOperator Algebras (math.OA)Settore MAT/07 - Fisica MatematicaEigenvalues and eigenvectorsMathematical PhysicsMathematics
researchProduct

Exploring parallel capabilities of an innovative numerical method for recovering image velocity vectors field

2010

In this paper an efficient method devoted to estimate the velocity vectors field is investigated. The method is based on a quasi-interpolant operator and involves a large amount of computation. The operations characterizing the computational scheme are ideal for parallel processing because they are local, regular and repetitive. Therefore, the spatial parallelism of the process is studied to rapidly proceed in the computation on distributed multiprocessor systems. The process has shown to be synchronous, with good task balancing and requiring a small amount of data transfer.

ComputationNumerical analysisProcess (computing)MultiprocessingField (computer science)Computational scienceComputer Science ApplicationsSettore MAT/08 - Analisi NumericaOperator (computer programming)Parallel processing (DSP implementation)Modeling and SimulationModelling and SimulationImage velocity vectors field Quasi-interpolant operator B-spline functions Distributed multiprocessor systemsAlgorithmMathematicsData transmissionMathematical and Computer Modelling
researchProduct

Comparison of electron density properties in frozen and relaxed electronic distributions.

2003

Two kinds of electron densities for several small molecules (H(2), FH, CH(3)CH(3), CH(3)NH(2), CH(3)OH, and CH(3)F) have been generated for a wide range of bond distances. The first one, as the sum of the electron density of the isolated fragments, and the second one by optimizing the electron density at each given geometrical disposition. A number of properties of this two electronic distributions have been compared (position of the bond critical points, electron density, Laplacian, curvatures, and local energies). The differences, associated to the bond formation, are found to be very important for most of the cases.

Computational MathematicsRange (particle radiation)Electron densityChemistryPosition (vector)Atoms in moleculesGeneral ChemistryElectronBond formationAtomic physicsLaplace operatorElectron localization functionJournal of computational chemistry
researchProduct

New dimension indices for the characterization of the solvent-accessible surface

2001

Computational MathematicsTheoretical physicssymbols.namesakeDimension (vector space)ChemistryQuantum mechanicssymbolsVan der Waals radiusGeneral ChemistryFractal dimensionAccessible surface areaCharacterization (materials science)Journal of Computational Chemistry
researchProduct

Superior Performances of the Neural Network on the Masses Lesions Classification through Morphological Lesion Differences

2007

Purpose of this work is to develop an automatic classification system that could be useful for radiologists in the breast cancer investigation. The software has been designed in the framework of the MAGIC-5 collaboration. In an automatic classification system the suspicious regions with high probability to include a lesion are extracted from the image as regions of interest (ROIs). Each ROI is characterized by some features based generally on morphological lesion differences. A study in the space features representation is made and some classifiers are tested to distinguish the pathological regions from the healthy ones. The results provided in terms of sensitivity and specificity will be p…

Computer Aided DetectionSupport Vector MachineNeural NetworksK-Nearest Neighbours
researchProduct

Perceptual adaptive insensitivity for support vector machine image coding.

2005

Support vector machine (SVM) learning has been recently proposed for image compression in the frequency domain using a constant epsilon-insensitivity zone by Robinson and Kecman. However, according to the statistical properties of natural images and the properties of human perception, a constant insensitivity makes sense in the spatial domain but it is certainly not a good option in a frequency domain. In fact, in their approach, they made a fixed low-pass assumption as the number of discrete cosine transform (DCT) coefficients to be used in the training was limited. This paper extends the work of Robinson and Kecman by proposing the use of adaptive insensitivity SVMs [2] for image coding u…

Computer Networks and CommunicationsImage processingPattern Recognition AutomatedArtificial IntelligenceDistortionImage Interpretation Computer-AssistedDiscrete cosine transformComputer SimulationMathematicsModels StatisticalArtificial neural networkbusiness.industryPattern recognitionSignal Processing Computer-AssistedGeneral MedicineData CompressionComputer Science ApplicationsSupport vector machineFrequency domainVisual PerceptionA priori and a posterioriArtificial intelligencebusinessSoftwareAlgorithmsImage compressionIEEE transactions on neural networks
researchProduct

An optimized mass storage FFT for vector computers

1995

Abstract The performance of a segmented FFT algorithm which allows the out-of-core computation of the Fourier transform of a very large mass storage data array is presented. The code is particularly optimized for vector computers. Tests performed mainly on a CONVEX C210 vector computer showed that, for very long transforms, tuning of the main parameters involved leads to computation speed and global efficiency better than for FFTs performed in-core. The use of tunable parameters allows optimization of the algorithm on machines with different configurations.

Computer Networks and Communicationsbusiness.industryComputer scienceComputationFast Fourier transformPrime-factor FFT algorithmArray data typeComputer Graphics and Computer-Aided DesignTheoretical Computer ScienceVector processorsymbols.namesakeFourier transformSplit-radix FFT algorithmArtificial IntelligenceHardware and ArchitectureComputer data storagesymbolsbusinessAlgorithmSoftwareParallel Computing
researchProduct

An efficient distributed algorithm for generating and updating multicast trees

2006

As group applications are becoming widespread, efficient network utilization becomes a growing concern. Multicast transmission represents a necessary lower network service for the wide diffusion of new multimedia network applications. Multicast transmission may use network resources more efficiently than multiple point-to-point messages; however, creating optimal multicast trees (Steiner Tree Problem in networks) is prohibitively expensive. This paper proposes a distributed algorithm for the heuristic solution of the Steiner Tree Problem, allowing the construction of effective distribution trees using a coordination protocol among the network nodes. Furthermore, we propose a novel distribut…

Computer Networks and Communicationscomputer.internet_protocolComputer scienceDistributed computingNetwork ontology.Distance Vector Multicast Routing ProtocolMultimedia Broadcast Multicast ServiceSteiner tree problemTheoretical Computer Sciencesymbols.namesakeArtificial IntelligenceConvergence (routing)Multicast addressXcastCommunication complexityPragmatic General MulticastIntelligent systemSettore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniMulticast transmissionProtocol Independent MulticastMulticastInter-domainbusiness.industryNode (networking)Programmable networkComputer Graphics and Computer-Aided DesignSource-specific multicastHardware and ArchitectureDistributed algorithmNetwork serviceReliable multicastsymbolsSituation calculuIP multicastbusinesscomputerSoftwareComputer networkParallel Computing
researchProduct