Search results for "Number"

showing 10 items of 3939 documents

Distributed Pseudo-Gossip Algorithm and Finite-Length Computational Codes for Efficient In-Network Subspace Projection

2013

In this paper, we design a practical power-efficient algorithm for Wireless Sensor Networks (WSN) in order to obtain, in a distributed manner, the projection of an observed sampled spatial field on a subspace of lower dimension. This is an important problem that is motivated in various applications where there are well defined subspaces of interest (e.g., spectral maps in cognitive radios). As opposed to traditional Gossip Algorithms used for subspace projection, where separation of channel coding and computation is assumed, our algorithm combines binary finite-length Computational Coding and a novel gossip-like protocol with certain communication rules, achieving important savings in conve…

Cognitive radioTheoretical computer scienceComputationSignal ProcessingBinary numberEnergy consumptionElectrical and Electronic EngineeringLinear subspaceWireless sensor networkAlgorithmSubspace topologyMathematicsCoding (social sciences)IEEE Journal of Selected Topics in Signal Processing
researchProduct

Transcendental Apperception: Consciousness or Self-Consciousness? Comments on Chapter 9 of Patricia Kitcher'sKant's Thinker

2014

AbstractA core thesis of Kitcher's is that thinking about objects requires awareness of necessary connections between one's object-directed representations ‘as such’ and that this is what Kant means by the transcendental unity of apperception. I argue that Kant's main point is the spontaneity or ‘self-made-ness’ of combination rather than the requirement of reflexive awareness of combination, that Kitcher provides no plausible account of how recognition of representations ‘as such’ should be constituted and that in fact Kant himself appears to lack the theoretical resources to clearly distinguish between (first-level) consciousness and self-consciousness or apperception properly so-called.

Cognitive sciencemedia_common.quotation_subjectRepresentation (arts)EpistemologyReflexive pronounPhilosophyReflexivitySelf-consciousnessTranscendental numberConsciousnessFunction (engineering)PsychologyApperceptionmedia_commonKantian Review
researchProduct

Evolution Characteristics of Delamination Damage in CFRP Composites Under Transverse Loading

2012

The initiation and subsequent progression of delamination in CFRP composite laminates is examined using finite element method. A 12-ply CFRP composite, with a total thickness of 2.4 mm and anti-symmetric ply sequence is simulated under three-point bend test setup. Each unidirectional composite lamina is treated as an equivalent elastic and orthotropic panel. Interface behavior is defined using cohesive damage model. Complementary three-point bend test on the specimen is performed at crosshead speed of 2 mm/min. The measured load–deflection response at mid-span location compares well with predicted values. Interface delamination accounts for up to 46.7% reduction in flexural stiffness from t…

Cohesive zone modelMaterials scienceFlexural strengthComposite numberUltimate tensile strengthDelaminationFlexural rigidityComposite laminatesComposite materialOrthotropic material
researchProduct

Discrete and Conservative Factorizations in Fib(B)

2021

AbstractWe focus on the transfer of some known orthogonal factorization systems from$$\mathsf {Cat}$$Catto the 2-category$${\mathsf {Fib}}(B)$$Fib(B)of fibrations over a fixed base categoryB: the internal version of thecomprehensive factorization, and the factorization systems given by (sequence of coidentifiers, discrete morphism) and (sequence of coinverters, conservative morphism) respectively. For the class of fibrewise opfibrations in$${\mathsf {Fib}}(B)$$Fib(B), the construction of the latter two simplify to a single coidentifier (respectively coinverter) followed by an internal discrete opfibration (resp. fibrewise opfibration in groupoids). We show how these results follow from thei…

Coidentifier; Coinverter; Factorization system; Internal fibrationPhysicsSequenceAlgebra and Number TheoryOrthogonal factorizationGeneral Computer ScienceInternal versionFactorization systemTheoretical Computer ScienceCombinatoricsSettore MAT/02 - AlgebraCoinverterTransfer (group theory)MorphismFactorizationInternal fibrationCoidentifierFixed baseApplied Categorical Structures
researchProduct

Varieties of algebras with pseudoinvolution: Codimensions, cocharacters and colengths

2022

Abstract Let A be a finitely generated superalgebra with pseudoinvolution ⁎ over an algebraically closed field F of characteristic zero. In this paper we develop a theory of polynomial identities for this kind of algebras . In particular, we shall consider three sequences that can be attached to Id ⁎ ( A ) , the T 2 ⁎ -ideal of identities of A: the sequence of ⁎-codimensions c n ⁎ ( A ) , the sequence of ⁎-cocharacter χ 〈 n 〉 ⁎ ( A ) and the ⁎-colength sequence l n ⁎ ( A ) . Our purpose is threefold. First we shall prove that the ⁎-codimension sequence is eventually non-decreasing, i.e., c n ⁎ ( A ) ≤ c n + 1 ⁎ ( A ) , for n large enough. Secondly, we study superalgebras with pseudoinvoluti…

ColengthsPolynomialSequencePure mathematicsMultiplicitiesAlgebra and Number TheoryMathematics::Commutative AlgebraPseudoinvolutionsZero (complex analysis)Cocharacters; Colengths; Multiplicities; Polynomial identities; PseudoinvolutionsCocharactersSuperalgebraPolynomial identitiesSettore MAT/02 - AlgebraSection (category theory)Bounded functionIdeal (ring theory)Algebraically closed fieldMathematics
researchProduct

A numerical study of attraction/repulsion collective behavior models: 3D particle analyses and 1D kinetic simulations

2013

39p; International audience; We study at particle and kinetic level a collective behavior model based on three phenomena: self-propulsion, friction (Rayleigh effect) and an attractive/repulsive (Morse) potential rescaled so that the total mass of the system remains constant independently of the number of particles N . In the first part of the paper, we introduce the particle model: the agents are numbered and described by their position and velocity. We iden- tify five parameters that govern the possible asymptotic states for this system (clumps, spheres, dispersion, mills, rigid-body rotation, flocks) and perform a numerical analysis on the 3D setting. Then, in the second part of the paper…

Collective behaviorParticle numberKinetic energy01 natural sciencesMSC 92B05 70F99 65P40 35L50symbols.namesakecollective behavior0103 physical sciences[MATH.MATH-AP]Mathematics [math]/Analysis of PDEs [math.AP]Statistical physics0101 mathematicsRayleigh scattering010306 general physicsParticle systemSelf-organizationPhysicsNumerical analysisStatistical and Nonlinear Physicsattractive/repulsive potentialCondensed Matter Physicsself-organizationswarming010101 applied mathematicsClassical mechanicssymbolsSPHERES[MATH.MATH-NA]Mathematics [math]/Numerical Analysis [math.NA]
researchProduct

Multiplicative loops of 2-dimensional topological quasifields

2015

We determine the algebraic structure of the multiplicative loops for locally compact $2$-dimensional topological connected quasifields. In particular, our attention turns to multiplicative loops which have either a normal subloop of positive dimension or which contain a $1$-dimensional compact subgroup. In the last section we determine explicitly the quasifields which coordinatize locally compact translation planes of dimension $4$ admitting an at least $7$-dimensional Lie group as collineation group.

CollineationAlgebraic structureDimension (graph theory)Topology01 natural sciencesSection (fiber bundle)TermészettudományokFOS: MathematicsCollineation groupLocally compact space0101 mathematicsMatematika- és számítástudományokMathematicsAlgebra and Number TheoryGroup (mathematics)010102 general mathematicsMultiplicative function20N05 22A30 12K99 51A40 57M60Lie groupMathematics - Rings and AlgebrasSections in Lie group010101 applied mathematicsTranslation planes and speadsMultiplicative loops of locally compact quasifieldRings and Algebras (math.RA)Settore MAT/03 - Geometria
researchProduct

Tangential Hilbert problem for perturbations of hyperelliptic Hamiltonian systems

1999

The tangential Hilbert 16th problem is to place an upper bound for the number of isolated ovals of algebraic level curves { H ( x , y ) = const } \{H(x,y)=\operatorname {const}\} over which the integral of a polynomial 1-form P ( x , y ) d x + Q ( x , y ) d y P(x,y)\,dx+Q(x,y)\,dy (the Abelian integral) may vanish, the answer to be given in terms of the degrees n = deg ⁡ H n=\deg H and d = max ( deg ⁡ P , deg ⁡ Q ) d=\max (\deg P,\deg Q) . We describe an algorithm producing this upper bound in the form of a primitive recursive (in fact, elementary) function of n n and d d for the particular case of hyperelliptic polynomials H ( x , y ) = y 2 + U ( x ) H(x,y)=y^2+U(x) under the additional as…

CombinatoricsAbelian integralPolynomialGeneral MathematicsLimit cycleSuperintegrable Hamiltonian systemAlgebraic curveAbelian groupAlgebraic numberMathematicsHamiltonian systemElectronic Research Announcements of the American Mathematical Society
researchProduct

A counterexample to Feit's Problem VIII on decomposition numbers

2016

We find a counterexample to Feit's Problem VIII on the bound of decomposition numbers. This also answers a question raised by T. Holm and W. Willems.

CombinatoricsAlgebra and Number Theory010102 general mathematics0103 physical sciencesDecomposition (computer science)FOS: Mathematics010307 mathematical physics0101 mathematicsRepresentation Theory (math.RT)01 natural sciencesMathematics - Representation TheoryMathematicsCounterexample
researchProduct

Induction and Character Correspondences in Groups of Odd Order

2002

Abstract Let P be a Sylow p -subgroup of G . By Irr p ′ ( G ), we denote the set of irreducible characters of G which have degree not divisible by p . When G is a solvable group of odd order, M. Isaacs constructed a natural one-to-one correspondence *:Irr p ′ ( G ) → Irr p ′ ( N G ( P )) which depends only on G and P . In this paper, we show that if ξ G  = χ ∈ Irr p ′ ( G ), then (ξ*) N G ( P )  = χ*.

CombinatoricsAlgebra and Number TheoryCharacter (mathematics)Degree (graph theory)Solvable groupSylow theoremsOrder (group theory)MathematicsJournal of Algebra
researchProduct