Search results for "Modula"

showing 10 items of 1481 documents

Team Theory and Person-by-Person Optimization with Binary Decisions

2012

In this paper, we extend the notion of person-by-person (pbp) optimization to binary decision spaces. The novelty of our approach is the adaptation to a dynamic team context of notions borrowed from the pseudo-boolean optimization field as completely local-global or unimodal functions and submodularity. We also generalize the concept of pbp optimization to the case where groups of $m$ decisions makers make joint decisions sequentially, which we refer to as $m$b$m$ optimization. The main contribution is a description of sufficient conditions, verifiable in polynomial time, under which a pbp or an $m$b$m$ optimization algorithm converges to the team-optimum. As a second contribution, we prese…

Mathematical optimizationControl and Optimizationcontrol optimizationBinary decision diagramApplied MathematicsTeam Theory; Person-by-Person Optimization; Pseudo-Boolean OptimizationApproximation algorithmState vectorTeam TheoryPerson-by-Person OptimizationSubmodular set functionVector optimizationPseudo-Boolean OptimizationComplete informationSettore MAT/09 - Ricerca OperativaGreedy algorithmTime complexityMathematicsSIAM Journal on Control and Optimization
researchProduct

Optimal Switches in Multi–inventory Systems

2007

Given a switched multi-inventory system we wish to find the optimal schedule of the resets to maintain the system in a safe operating interval, while minimizing a function related to the cost of the resets. We discuss a family of instances that can be solved in polynomial time by linear programming. We do this by introducing a set-covering formulation with a totally unimodular constraint matrix.

Mathematical optimizationScheduleUnimodular matrixLinear programmingInterval (mathematics)Function (mathematics)Constraint matrixTime complexityMathematics
researchProduct

Incremental bipartite drawing problem

2001

Abstract Layout strategies that strive to preserve perspective from earlier drawings are called incremental. In this paper we study the incremental arc crossing minimization problem for bipartite graphs. We develop a greedy randomized adaptive search procedure (GRASP) for this problem. We have also developed a branch-and-bound algorithm in order to compute the relative gap to the optimal solution of the GRASP approach. Computational experiments are performed with 450 graph instances to first study the effect of changes in grasp search parameters and then to test the efficiency of the proposed procedure. Scope and purpose Many information systems require graphs to be drawn so that these syst…

Mathematical optimizationTheoretical computer scienceGeneral Computer ScienceManagement Science and Operations ResearchModular decompositionGraph drawingModeling and SimulationIndependent setClique-widthBipartite graphForce-directed graph drawingGraph productGreedy randomized adaptive search procedureMathematicsofComputing_DISCRETEMATHEMATICSMathematicsComputers & Operations Research
researchProduct

Homogeneous Weyl connections of non-positive curvature

2015

We study homogenous Weyl connections with non-positive sectional curvatures. The Cartesian product $\mathbb S^1 \times M$ carries canonical families of Weyl connections with such a property, for any Riemmanian manifold $M$. We prove that if a homogenous Weyl connection on a manifold, modeled on a unimodular Lie group, is non-positive in a stronger sense (streched non-positive), then it must be locally of the product type.

Mathematics - Differential GeometryPure mathematics01 natural sciencesGaussian thermostatssymbols.namesake0103 physical sciencesFOS: MathematicsNon-positive curvatureNon-positive curvature0101 mathematicsConnection (algebraic framework)53C24 53C21Mathematics010102 general mathematicsMathematical analysisLie groupWeyl connectionsCartesian productManifoldUnimodular matrixDifferential Geometry (math.DG)Differential geometrysymbolsWeyl transformationMathematics::Differential Geometry010307 mathematical physicsGeometry and TopologyAnalysisAnnals of Global Analysis and Geometry
researchProduct

Complex group algebras of finite groups: Brauer's Problem 1

2007

Abstract Brauer's Problem 1 asks the following: What are the possible complex group algebras of finite groups? It seems that with the present knowledge of representation theory it is not possible to settle this question. The goal of this paper is to present a partial solution to this problem. We conjecture that if the complex group algebra of a finite group does not have more than a fixed number m of isomorphic summands, then its dimension is bounded in terms of m . We prove that this is true for every finite group if it is true for the symmetric groups. The problem for symmetric groups reduces to an explicitly stated question in number theory or combinatorics.

Mathematics(all)Modular representation theoryPure mathematicsFinite groupBrauer's Problem 1Group (mathematics)General MathematicsCharacter degreesCombinatoricsRepresentation theory of the symmetric groupGroup of Lie typeSymmetric groupSimple groupGroup algebraFinite groupRepresentation theory of finite groupsMathematicsAdvances in Mathematics
researchProduct

Annihilating sets for the short time Fourier transform

2010

Abstract We obtain a class of subsets of R 2 d such that the support of the short time Fourier transform (STFT) of a signal f ∈ L 2 ( R d ) with respect to a window g ∈ L 2 ( R d ) cannot belong to this class unless f or g is identically zero. Moreover we prove that the L 2 -norm of the STFT is essentially concentrated in the complement of such a set. A generalization to other Hilbert spaces of functions or distributions is also provided. To this aim we obtain some results on compactness of localization operators acting on weighted modulation Hilbert spaces.

Mathematics(all)Modulation spacePure mathematicsLocalization operatorsUncertainty principleGeneral MathematicsMathematical analysisShort-time Fourier transformHilbert spaceHilbert spectral analysissymbols.namesakeModulation spacesCompact spaceNorm (mathematics)Uncertainty principlesymbolsAnnihilating setsShort time Fourier transformMathematicsAdvances in Mathematics
researchProduct

Mapping properties for the Bargmann transform on modulation spaces

2010

We investigate mapping properties for the Bargmann transform and prove that this transform is isometric and bijective from modulation spaces to convenient Banach spaces of analytic functions.

Mathematics::Functional AnalysisPure mathematicsModulation spaceFunctional analysisMathematics - Complex Variablesbijectivity propertiesApplied MathematicsSpectrum (functional analysis)Banach spaceOperator theoryComputer Science::Digital LibrariesVDP::Mathematics and natural science: 400::Mathematics: 410Algebraharmonic oscillatorhermite functionsBerezin–Toeplitz operatorsFOS: MathematicsInterpolation spaceBirnbaum–Orlicz spaceComplex Variables (math.CV)Lp spaceAnalysisMathematicsJournal of Pseudo-Differential Operators and Applications
researchProduct

Maximum Power Point Tracker for Standalone PV System Using Neural Networks

2019

In this work, designing and implementation of a maximum power point tracker (MPPT) based on an artificial neural network is proposed. The output voltage of the selected photovoltaic array is controlled by a DC to DC boost converter in a way that the PV array generates the available possible maximum power correspond to the available solar irradiance and temperature. The neural network (NN) is capable of forecasting the required terminal voltage of the PV array in order to generate the possible maximum power. The pulse width modulation (PWM) signal, which drives the boost converter, is generated through a raspberry pi according to the forecasted terminal voltage. The terminal voltage of the P…

Maximum power principleDuty cyclebusiness.industryComputer scienceBoost converterPhotovoltaic systemElectrical engineeringResponse timebusinessPulse-width modulationMaximum power point trackingVoltage
researchProduct

Parameter optimization for amplify-and-forward relaying with imperfect channel estimation

2009

Cooperative diversity is a promising technology for future wireless networks. In this paper, we consider a cooperative communication system operating in an amplify-and-forward (AF) mode with an imperfectly-known relay fading channel. It is assumed that a pilot symbol assisted modulation (PSAM) scheme with linear minimum mean square estimator (LMMSE) is used for the channel estimation. A simple and easy-to-evaluate asymptotical upper bound (AUB) of the symbol-error-rate (SER) is derived for uncoded AF cooperative systems with quadrature amplitude modulation (QAM) constellations. Based on the AUB, we propose a criterion for the choice of parameters in the PSAM scheme, i.e., the pilot spacing …

Mean squared errorChannel state informationControl theoryVDP::Technology: 500::Information and communication technology: 550::Telecommunication: 552EstimatorFadingUpper and lower boundsAlgorithmQuadrature amplitude modulationComplex normal distributionCooperative diversityMathematics
researchProduct

Field Measurements and Parameter Calibrations of Propagation Model for Digital Audio Broadcasting in Norway

2018

During 2017, digital audio broadcasting (DAB) replaces frequency modulation (FM) broadcasting and becomes the only technology for national terrestrial audio broadcasting services in Norway. As Norway is the first country that replaces FM completely with DAB, it is of great importance to measure the signal strength of such a technology in massive deployments and to tune a simulation model as a reference for future studies. Therefore, field measurements of received signal strength are carried out in a typical Norwegian area in this work. Based on the data obtained from the measurements, a simulator with a recent empirical propagation model, namely, ITU-R P.1546-5, has been calibrated. The fin…

Measure (data warehouse)Field (physics)business.industryComputer scienceAttenuation020208 electrical & electronic engineering020206 networking & telecommunications02 engineering and technologyBroadcastingBroadcasting (networking)Digital audio broadcastingSignal strength0202 electrical engineering electronic engineering information engineeringElectronic engineeringbusinessFrequency modulation
researchProduct