Search results for "REEs"

showing 10 items of 921 documents

Completely independent spanning trees in some regular graphs

2014

International audience; Let k >= 2 be an integer and T-1,..., T-k be spanning trees of a graph G. If for any pair of vertices {u, v} of V(G), the paths between u and v in every T-i, 1 <= i <= k, do not contain common edges and common vertices, except the vertices u and v, then T1,... Tk are completely independent spanning trees in G. For 2k-regular graphs which are 2k-connected, such as the Cartesian product of a complete graph of order 2k-1 and a cycle, and some Cartesian products of three cycles (for k = 3), the maximum number of completely independent spanning trees contained in these graphs is determined and it turns out that this maximum is not always k. (C) 2016 Elsevier B.V. All righ…

FOS: Computer and information sciences[ MATH ] Mathematics [math]Discrete Mathematics (cs.DM)Small Depths0102 computer and information sciences02 engineering and technology[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]01 natural sciencesCombinatoricssymbols.namesakeCompletely independent spanning treeFOS: Mathematics0202 electrical engineering electronic engineering information engineeringCartesian productDiscrete Mathematics and CombinatoricsMathematics - Combinatorics[MATH]Mathematics [math]MathematicsConstructionSpanning treeSpanning treeApplied MathematicsComplete graph020206 networking & telecommunications[ INFO.INFO-DM ] Computer Science [cs]/Discrete Mathematics [cs.DM]Cartesian productIndependent spanning treesGraphPlanar graphPlanar Graphs010201 computation theory & mathematicssymbolsCompletely independent spanning tree.Combinatorics (math.CO)Computer Science - Discrete Mathematics
researchProduct

Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees

2017

International audience; The search of spanning trees with interesting disjunction properties has led to the introduction of edge-disjoint spanning trees, independent spanning trees and more recently completely independent spanning trees. We group together these notions by dening (i, j)-disjoint spanning trees, where i (j, respectively) is the number of vertices (edges, respectively) that are shared by more than one tree. We illustrate how (i, j)-disjoint spanning trees provide some nuances between the existence of disjoint connected dominating sets and completely independent spanning trees. We prove that determining if there exist two (i, j)-disjoint spanning trees in a graph G is NP-comple…

FOS: Computer and information sciences[INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]Discrete Mathematics (cs.DM)Spanning trees[ INFO.INFO-NI ] Computer Science [cs]/Networking and Internet Architecture [cs.NI]0102 computer and information sciences02 engineering and technologyMinimum spanning tree[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]01 natural sciencesConnected dominating setCombinatorics[INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI]0202 electrical engineering electronic engineering information engineeringDiscrete Mathematics and CombinatoricsGridMathematicsMinimum degree spanning treeDiscrete mathematics020203 distributed computingTrémaux treeSpanning treeApplied MathematicsShortest-path treeWeight-balanced tree[ INFO.INFO-DM ] Computer Science [cs]/Discrete Mathematics [cs.DM]Disjoint connected dominating setsIndependent spanning trees[ INFO.INFO-CC ] Computer Science [cs]/Computational Complexity [cs.CC]010201 computation theory & mathematicsReverse-delete algorithmCompletely independent spanning treesComputer Science - Discrete MathematicsMathematicsofComputing_DISCRETEMATHEMATICS
researchProduct

Lieb polariton topological insulators

2018

We predict that the interplay between the spin-orbit coupling, stemming from the TE-TM energy splitting, and the Zeeman effect in semiconductor microcavities supporting exci- ton-polariton quasi-particles results in the appearance of unidirectional linear topological edge states when the top microcavity mirror is patterned to form a truncated dislocated Lieb lattice of cylindrical pillars. Periodic nonlinear edge states are found to emerge from the linear ones. They are strongly localized across the interface and they are remarkably robust in comparison to their counterparts in hexagonal lattices. Such robustness makes possible the existence of nested unidirectional dark solitons that move …

FOS: Physical sciences02 engineering and technologyPattern Formation and Solitons (nlin.PS)01 natural sciencesSolitonssymbols.namesakeLattice (order)0103 physical sciencesMesoscale and Nanoscale Physics (cond-mat.mes-hall)Polariton:Física::Electromagnetisme [Àrees temàtiques de la UPC]010306 general physicsPhysicsCondensed Matter::Quantum GasesZeeman effectCondensed Matter - Mesoscale and Nanoscale PhysicsCondensed matter physicsMagnetic energybusiness.industry021001 nanoscience & nanotechnologyNonlinear Sciences - Pattern Formation and SolitonsNonlinear systemSemiconductorTopological insulatorsymbolsQuasiparticle0210 nano-technologybusinessPhysics - OpticsOptics (physics.optics)
researchProduct

Plaid model for microarray data: an enhancement of the pruning step

2010

Microarrays have become a standard tool for studying gene functions. For example, we can investigate if a subset of genes shows a coherent expression pattern under different conditions. The plaid model, a model-based biclustering method, can be used to incorporate the addiction structure used for the microarray experiment. In this paper we describe an enhancement for the plaid model algorithm based on the theory of the false discovery rate.

False discovery rateStructure (mathematical logic)MicroarrayMicroarray Plaid model pruning step.Microarray analysis techniquesComputer sciencefood and beveragescomputer.software_genreBiclusteringDNA microarray experimentPruning (decision trees)Data miningDNA microarraySettore SECS-S/01 - Statisticacomputer
researchProduct

GekkoFS - A Temporary Distributed File System for HPC Applications

2018

We present GekkoFS, a temporary, highly-scalable burst buffer file system which has been specifically optimized for new access patterns of data-intensive High-Performance Computing (HPC) applications. The file system provides relaxed POSIX semantics, only offering features which are actually required by most (not all) applications. It is able to provide scalable I/O performance and reaches millions of metadata operations already for a small number of nodes, significantly outperforming the capabilities of general-purpose parallel file systems. The work has been funded by the German Research Foundation (DFG) through the ADA-FS project as part of the Priority Programme 1648. It is also support…

File system020203 distributed computingBurst buffersParallel processing (Electronic computers)Computer scienceProcessament en paral·lel (Ordinadors)020207 software engineering02 engineering and technologyBuffer storage (Computer science)computer.software_genreData structureDistributed file systemsMetadataParallel processing (DSP implementation)POSIXServerScalabilityHPC0202 electrical engineering electronic engineering information engineeringOperating systemHigh performance computingDistributed File System:Informàtica::Arquitectura de computadors::Arquitectures paral·leles [Àrees temàtiques de la UPC]computerCàlcul intensiu (Informàtica)2018 IEEE International Conference on Cluster Computing (CLUSTER)
researchProduct

Direct lookup and hash-based metadata placement for local file systems

2013

New challenges to file systems' metadata performance are imposed by the continuously growing number of files existing in file systems. The total amount of metadata can become too big to be cached, potentially leading to multiple storage device accesses for a single metadata lookup operation. This paper takes a look at the limitations of traditional file system designs and discusses an alternative metadata handling approach, using hash-based concepts already established for metadata and data placement in distributed storage systems. Furthermore, a POSIX compliant prototype implementation based on these concepts is introduced and benchmarked. A variety of file system metadata and data operati…

File systemData elementDatabaseComputer scienceFitxers informàtics -- OganitzacióComputer fileFile organization (Computer science)Meta Data Servicescomputer.file_formatMetadata placementRandomizationcomputer.software_genreMetadata repositoryTorrent fileMetadataFile system designDirect lookupHashingOperating systemData_FILESVersioning file systemMetadata performancecomputer:Informàtica::Sistemes operatius [Àrees temàtiques de la UPC]
researchProduct

De Ciuilitate Morum puerilium per Desyd. Erasmum Roterodamum, libellus.

1570

A-C8 Caplletres

Filosofia Obres anteriors a 1800Ensenyament preescolar Obres anteriors a 1800DIG-BHEnsenyament preescolar Obres anteriors al 1800Filosofia Obres anteriors al 1800
researchProduct

Characterizing normal Sylow p-subgroups by character degrees

2012

Abstract Suppose that G is a finite group, let p be a prime and let P ∈ Syl p ( G ) . We prove that P is normal in G if and only if all the irreducible constituents of the permutation character ( 1 P ) G have degree not divisible by p.

Finite groupAlgebra and Number TheoryDegree (graph theory)010102 general mathematicsSylow theoremsPrimitive permutation group01 natural sciencesPrime (order theory)Characters of finite groupsCharacter degrees010101 applied mathematicsCombinatoricsPermutationCharacter (mathematics)0101 mathematicsMathematicsJournal of Algebra
researchProduct

Finite groups with real-valued irreducible characters of prime degree

2008

Abstract In this paper we describe the structure of finite groups whose real-valued nonlinear irreducible characters have all prime degree. The more general situation in which the real-valued irreducible characters of a finite group have all squarefree degree is also considered.

Finite groupReal charactersBrauer's theorem on induced charactersAlgebra and Number TheoryDegree (graph theory)Mathematics::Number TheoryStructure (category theory)Prime elementSquare-free integerCharacter degreesCombinatoricsCharacter tableMathematics::Representation TheoryCharacter groupMathematicsJournal of Algebra
researchProduct

Measurement of the heaviest Beta-delayed 2-neutron emitter: 136Sb

2017

The Beta-delayed neutron emission probability, Pn , of very exotic nuclei is crucial for the understanding of nuclear structure properties of many isotopes and astrophysical processes such as the rapid neutron capture process (r-process). In addition Beta-delayed neutrons are important in a nuclear power reactor operated in a prompt sub-critical, delayed critical condition, as they contribute to the decay heat inducing fission reactions after a shut down. The study of neutron-rich isotopes and the measurement of Beta-delayed one-neutron emitters (Beta1n) is possible thanks to the Rare Isotope Beam (RIB) facilities, where radioactive beams allow the production of exotic nuclei of interest, w…

FissionNeutron emissionQC1-999Astrophysics::High Energy Astrophysical PhenomenaNuclear TheoryNuclear physicsNeutronAstrophysics7. Clean energy01 natural sciencesNuclear physicsEmission0103 physical sciencesNeutronDecay heat010306 general physicsNuclear Experimentastro nuclear physicsPhysics:Energies::Energia nuclear [Àrees temàtiques de la UPC]NeutronsPnIsotopeta114:Física [Àrees temàtiques de la UPC]010308 nuclear & particles physicsBranching fractionPhysicsNeutron capture13. Climate actionr-processPhysics::Accelerator PhysicsFísica nuclearAtomic physics
researchProduct