Search results for "type"

showing 10 items of 10618 documents

Killer toxin-secreting double-stranded RNA mycoviruses in the yeasts Hanseniaspora uvarum and Zygosaccharomyces bailii.

1994

Killer toxin-secreting strains of the yeasts Hanseniaspora uvarum and Zygosaccharomyces bailii were shown to contain linear double-stranded RNAs (dsRNAs) that persist within the cytoplasm of the infected host cell as encapsidated virus-like particles. In both yeasts, L- and M-dsRNAs were associated with 85-kDa major capsid protein, whereas the additional Z-dsRNA (2.8 kb), present only in the wild-type Z. bailii killer strain, was capsid protein, whereas the additional Z-dsRNA (2.8 kb), present only in the wild-type Z. bailii killer strain, was shown to be encapsidated by a 35-kDa coat protein. Although Northern (RNA) blot hybridizations indicated that L-dsRNA from Z. bailii is a LA species,…

Zygosaccharomyces bailiivirusesImmunologySaccharomyces cerevisiaeSaccharomyces cerevisiaeBiologyHanseniasporaTransfectionMicrobiologyPeptide MappingMicrobiologyCapsidVirus-like particleVirologyYeastsRNA VirusesRNA Double-StrandedSequence Homology Amino AcidRNAMycotoxinsbiology.organism_classificationBlotting NorthernYeastPhenotypeCapsidInsect ScienceMycovirusRNA ViralResearch ArticleJournal of virology
researchProduct

User and group networks on YouTube: A comparative analysis

2015

International audience; YouTube is the largest video-sharing social network where users (aka channels) can create links to any other users. Moreover, initially, users were allowed to create and join special groups of interest. Therefore, two types of online social networks can be defined. First, a user network where the nodes represent the users and the edges represent the social ties (friendship) between users. Second, a group network where the nodes represent the groups and the edges represent the social ties between groups, due to shared users. As the group network can be apprehended as the ground-truth overlapping community graph (where the nodes are the discovered communities and the l…

[ INFO ] Computer Science [cs]Social networkbusiness.industryComputer scienceCommunity structureComplex networkElectronic mailWorld Wide WebInterpersonal tiesEvolving networksGraph (abstract data type)Weighted network[INFO]Computer Science [cs]business
researchProduct

Cardiac motion tracking using a deformable 2D-mesh modeling

2001

International audience; Abstract: The work reported here deals with movement tracking in sequences of medical images in order to quantify the general movements and deformations of the heart For this purpose, we partition the first image into triangular patches in order that each object of the image corresponds to a set of triangles. Then, the nodes of the mesh are tracked across the image sequence giving a mesh which warps with the images. The method is applied to cardiac image sequences where the study of the deformation of the triangles is applied to the determination of the movement of the ventricles

[ INFO.INFO-IM ] Computer Science [cs]/Medical ImagingMovement (music)business.industryComputer sciencePhysics::Medical Physics[INFO.INFO-IM] Computer Science [cs]/Medical ImagingComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION02 engineering and technologyImage segmentationDeformation (meteorology)Tracking (particle physics)030218 nuclear medicine & medical imagingImage (mathematics)Set (abstract data type)03 medical and health sciences0302 clinical medicineComputer Science::Computer Vision and Pattern Recognition0202 electrical engineering electronic engineering information engineeringMedical imaging[INFO.INFO-IM]Computer Science [cs]/Medical Imaging020201 artificial intelligence & image processingComputer visionArtificial intelligencebusinessComputingMethodologies_COMPUTERGRAPHICS
researchProduct

Semantic-based Merging of RSS Items

2009

Merging XML documents can be of key importance in several applications. For instance, merging the RSS news from same or different sources and providers can be beneficial for end-users in various scenarios. In this paper, we address this issue and explore the relatedness measure between RSS elements. We show here how to define and compute exclusive relations between any two elements and provide several predefined merging operators that can be extended and adapted to human needs. We also provide a set of experiments conducted to validate our approach. © Springer Science+Business Media, LLC 2009.

[ INFO.INFO-IR ] Computer Science [cs]/Information Retrieval [cs.IR][INFO.INFO-WB] Computer Science [cs]/WebComputer Networks and CommunicationsComputer sciencecomputer.internet_protocolRSS[ INFO.INFO-WB ] Computer Science [cs]/Web[SCCO.COMP]Cognitive science/Computer science02 engineering and technologycomputer.software_genreClusteringMergingSet (abstract data type)[SCCO.COMP] Cognitive science/Computer science020204 information systems0202 electrical engineering electronic engineering information engineering[INFO.INFO-DB] Computer Science [cs]/Databases [cs.DB]Cluster analysisComputingMilieux_MISCELLANEOUS[ INFO.INFO-MM ] Computer Science [cs]/Multimedia [cs.MM]Measure (data warehouse)[INFO.INFO-MM] Computer Science [cs]/Multimedia [cs.MM][INFO.INFO-DB]Computer Science [cs]/Databases [cs.DB]Document relatedne[INFO.INFO-WB]Computer Science [cs]/Web[INFO.INFO-MM]Computer Science [cs]/Multimedia [cs.MM]computer.file_formatRSSMerging operator[ INFO.INFO-DB ] Computer Science [cs]/Databases [cs.DB]Hardware and Architecture[ SCCO.COMP ] Cognitive science/Computer science[INFO.INFO-IR]Computer Science [cs]/Information Retrieval [cs.IR]Key (cryptography)020201 artificial intelligence & image processingData mining[INFO.INFO-IR] Computer Science [cs]/Information Retrieval [cs.IR]computerSoftwareXML
researchProduct

Analysis of Low-Altitude Aerial Sequences for Road Traffic Diagnosis using Graph Partitioning and Markov Hierarchical Models

2016

International audience; This article focuses on an original approach aiming the processing of low-altitude aerial sequences taken from an helicopter (or drone) and presenting a road traffic. Proposed system attempts to extract vehicles from acquired sequences. Our approach begins with detecting the primitives of sequence images. At the time of this step of segmentation, the system computes dominant motion for each pair of images. This motion is computed using wavelets analysis on optical flow equation and robust techniques. Interesting areas (areas not affected by the dominant motion) are detected thanks to a Markov hierarchical model. Primitives stemming from segmentation and interesting a…

[ INFO.INFO-MO ] Computer Science [cs]/Modeling and SimulationComputer scienceOptical flowTraffic-MonitoringHierarchical database model[ SPI.GCIV.IT ] Engineering Sciences [physics]/Civil Engineering/Infrastructures de transport[SPI.GCIV.IT]Engineering Sciences [physics]/Civil Engineering/Infrastructures de transportWavelet0502 economics and businessSegmentationComputer vision050210 logistics & transportationImage segmentationMarkov chainPerceptual Organizationbusiness.industry05 social sciencesGraph partition[SPI.GCIV.IT] Engineering Sciences [physics]/Civil Engineering/Infrastructures de transportPattern recognitionImage segmentationScene Analysis[INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation[SPI.TRON] Engineering Sciences [physics]/Electronics[ SPI.TRON ] Engineering Sciences [physics]/Electronics[SPI.TRON]Engineering Sciences [physics]/ElectronicsGraph PartitioningGraph (abstract data type)Artificial intelligenceMarkov Hierarchical Models[INFO.INFO-MO] Computer Science [cs]/Modeling and Simulationbusiness
researchProduct

Reaction-Diffusion Network For Geometric Multiscale High Speed Image Processing

2010

International audience; In the framework of heavy mid-level processing for high speed imaging, a nonlinear bi-dimensional network is proposed, allowing the implementation of active curve algorithms. Usually this efficient type of algorithm is prohibitive for real-time image processing due to its calculus charge and the inadequate structure for the use of serial or parallel architectures. Another kind of implementation philosophy is proposed here, by considering the active curve generated by a propagation phenomenon inspired from biological modeling. A programmable nonlinear reaction-diffusion system is proposed under front control and technological constraints. Geometric multiscale processin…

[ INFO.INFO-TS ] Computer Science [cs]/Signal and Image ProcessingComputer scienceNonlinear signal processingImage processing02 engineering and technology[ SPI.SIGNAL ] Engineering Sciences [physics]/Signal and Image processingType (model theory)Multiscale geometryComputational scienceImage analysisNonlinear signal processing[INFO.INFO-TS]Computer Science [cs]/Signal and Image ProcessingReaction–diffusion systemDigital image processing0202 electrical engineering electronic engineering information engineeringComputer visionStructure (mathematical logic)Biological modelingbusiness.industry020208 electrical & electronic engineeringNonlinear systemSignal Processing020201 artificial intelligence & image processingComputer Vision and Pattern RecognitionArtificial intelligencebusiness[SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing
researchProduct

A new minimum trees-based approach for shape matching with improved time computing : application to graphical symbols recognition

2010

Recently we have developed a model for shape description and matching. Based on minimum spanning trees construction and specifics stages like the mixture, it seems to have many desirable properties. Recognition invariance in front shift, rotated and noisy shape was checked through median scale tests related to GREC symbol reference database. Even if extracting the topology of a shape by mapping the shortest path connecting all the pixels seems to be powerful, the construction of graph induces an expensive algorithmic cost. In this article we discuss on the ways to reduce time computing. An alternative solution based on image compression concepts is provided and evaluated. The model no longe…

[ INFO.INFO-TS ] Computer Science [cs]/Signal and Image ProcessingMatching (graph theory)[INFO.INFO-TS] Computer Science [cs]/Signal and Image ProcessingComputer scienceFeature extractionComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION02 engineering and technology[ SPI.SIGNAL ] Engineering Sciences [physics]/Signal and Image processingMinimum spanning tree[INFO.INFO-TS]Computer Science [cs]/Signal and Image ProcessingActive shape model0202 electrical engineering electronic engineering information engineeringDiscrete cosine transformComputingMilieux_MISCELLANEOUS[SPI.SIGNAL] Engineering Sciences [physics]/Signal and Image processingSpanning treebusiness.industry020206 networking & telecommunicationsPattern recognitionGraphShortest path problemGraph (abstract data type)020201 artificial intelligence & image processingArtificial intelligencebusiness[SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processingImage compression
researchProduct

Convergence and applications of vector rational approximations

1992

The Padé approximants and their generalizations are for many years the matter of intense researchs .Yet , many theoritical problems stay in suspense : problems of exitence and unicity , problems of convergence and acceleration of convergence .The purpose of the present work vas to give answers to such questions .In the first section we take an in terest in vector Padé approximants of matrix series .Conditions of existence and unicity ,results of convergence are given ,as also the link with the theory of Lanczos method for the resolution of linear Systems . We utilize also the vector Padé approximants to provide a simultaneous approximation of a function and its derivative .In the second sec…

[ MATH ] Mathematics [math]Biorthogonal polynomialsAcceleration of convergenceEpsilon algorithme vectorielApproximants de Padé vectorielsBiorthogonalitéPadé type approximantsEpsilon algorithme topologique[MATH] Mathematics [math]Topological epsilon algorithmAccélération de la convergencePolynômes biorthogonauxVector Padé approximants[MATH]Mathematics [math]Vector epsilon algorithmApproximants de type Padé
researchProduct

Building Anosov flows on $3$–manifolds

2014

We prove a result allowing to build (transitive or non-transitive) Anosov flows on 3-manifolds by gluing together filtrating neighborhoods of hyperbolic sets. We give several applications; for example: 1. we build a 3-manifold supporting both of a transitive Anosov vector field and a non-transitive Anosov vector field; 2. for any n, we build a 3-manifold M supporting at least n pairwise different Anosov vector fields; 3. we build transitive attractors with prescribed entrance foliation; in particular, we construct some incoherent transitive attractors; 4. we build a transitive Anosov vector field admitting infinitely many pairwise non-isotopic trans- verse tori.

[ MATH ] Mathematics [math]Pure mathematicsAnosov flowMathematics::Dynamical Systems3–manifolds[ MATH.MATH-DS ] Mathematics [math]/Dynamical Systems [math.DS][MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS]Dynamical Systems (math.DS)$3$–manifolds01 natural sciencesFoliationsSet (abstract data type)MSC: Primary: 37D20 Secondary: 57M9957M99Diffeomorphisms0103 physical sciencesAttractorFOS: Mathematics0101 mathematics[MATH]Mathematics [math]Mathematics - Dynamical SystemsManifoldsMathematics::Symplectic Geometry3-manifold37D20 57MMathematicsTransitive relation37D20010308 nuclear & particles physics010102 general mathematicsTorusMathematics::Geometric TopologyFlow (mathematics)Anosov flowsFoliation (geology)Vector fieldhyperbolic plugsGeometry and Topologyhyperbolic basic set3-manifold
researchProduct

Surfaces of minimal degree of tame representation type and mutations of Cohen–Macaulay modules

2017

We provide two examples of smooth projective surfaces of tame CM type, by showing that any parameter space of isomorphism classes of indecomposable ACM bundles with fixed rank and determinant on a rational quartic scroll in projective 5-space is either a single point or a projective line. For surfaces of minimal degree and wild CM type, we classify rigid Ulrich bundles as Fibonacci extensions. For the rational normal scrolls S(2,3) and S(3,3), a complete classification of rigid ACM bundles is given in terms of the action of the braid group in three strands.

[ MATH ] Mathematics [math]Pure mathematicsFibonacci numberGeneral MathematicsType (model theory)Rank (differential topology)Commutative Algebra (math.AC)01 natural sciencesMathematics - Algebraic GeometryACM bundlesVarieties of minimal degreeMathematics::Algebraic Geometry0103 physical sciencesFOS: MathematicsMathematics (all)Rings0101 mathematics[MATH]Mathematics [math]Algebraic Geometry (math.AG)MathematicsDiscrete mathematics14F05 13C14 14J60 16G60010102 general mathematicsVarietiesMCM modulesACM bundles; MCM modules; Tame CM type; Ulrich bundles; Varieties of minimal degree; Mathematics (all)Ulrich bundlesMathematics - Commutative AlgebraQuintic functionElliptic curveTame CM typeProjective lineBundles010307 mathematical physicsIsomorphismIndecomposable moduleMSC: 14F05; 13C14; 14J60; 16G60
researchProduct