Search results for "Matrix"

showing 10 items of 3205 documents

On utilizing dependence-based information to enhance micro-aggregation for secure statistical databases

2011

Published version of an article in the journal: Pattern Analysis and Applications. Also available from the publisher at: http://dx.doi.org/10.1007/s10044-011-0199-9 We consider the micro-aggregation problem which involves partitioning a set of individual records in a micro-data file into a number of mutually exclusive and exhaustive groups. This problem, which seeks for the best partition of the micro-data file, is known to be NP-hard, and has been tackled using many heuristic solutions. In this paper, we would like to demonstrate that in the process of developing micro-aggregation techniques (MATs), it is expedient to incorporate information about the dependence between the random variable…

ConjectureTheoretical computer scienceVariablesComputer scienceCovariance matrixmedia_common.quotation_subjectmicro-aggregation techniqueVDP::Technology: 500::Information and communication technology: 550Mutually exclusive eventscomputer.software_genrePartition (database)CorrelationVDP::Mathematics and natural science: 400::Information and communication science: 420::Knowledge based systems: 425Artificial IntelligenceJoint probability distributionprojected variablesComputer Vision and Pattern RecognitionData miningmaximun spanning treeRandom variablecomputermedia_common
researchProduct

From Wigner-Yanase-Dyson conjecture to Carlen-Frank-Lieb conjecture

2020

Abstract In this paper we study the joint convexity/concavity of the trace functions Ψ p , q , s ( A , B ) = Tr ( B q 2 K ⁎ A p K B q 2 ) s , p , q , s ∈ R , where A and B are positive definite matrices and K is any fixed invertible matrix. We will give full range of ( p , q , s ) ∈ R 3 for Ψ p , q , s to be jointly convex/concave for all K. As a consequence, we confirm a conjecture of Carlen, Frank and Lieb. In particular, we confirm a weaker conjecture of Audenaert and Datta and obtain the full range of ( α , z ) for α-z Renyi relative entropies to be monotone under completely positive trace preserving maps. We also give simpler proofs of many known results, including the concavity of Ψ p…

ConjectureTrace (linear algebra)General Mathematics010102 general mathematicsRegular polygonPositive-definite matrix01 natural sciencesConvexitylaw.inventionCombinatoricsMonotone polygonInvertible matrixDyson conjecturelaw0103 physical sciences010307 mathematical physics0101 mathematicsMathematicsAdvances in Mathematics
researchProduct

2014

This paper investigates the finite-time distributedL2–L∞consensus control problem of multiagent systems with parameter uncertainties. The relative states of neighboring agents are used to construct the control law and some agents know their own states. By substituting the control input into multiagent systems, an augmented closed-loop system is obtained. Then, we analyze its finite-time boundedness (FTB) and finite-timeL2–L∞performance. A sufficient condition for the existence of the designed controller is given with the form of linear matrix inequalities (LMIs). Finally, simulation results are described.

ConsensusControl theorybusiness.industryApplied MathematicsDistributed generationMulti-agent systemControl (management)Construct (python library)Linear matrixFinite timebusinessAnalysisMathematicsAbstract and Applied Analysis
researchProduct

Spectral WENO schemes with Adaptive Mesh Refinement for models of polydisperse sedimentation

2012

The sedimentation of a polydisperse suspension with particles belonging to N size classes (species) can be described by a system of N nonlinear, strongly coupled scalar first-order conservation laws. Its solutions usually exhibit kinematic shocks separating areas of different composition. Based on the so-called secular equation [J. Anderson, Lin. Alg. Appl. 246, 49–70 (1996)], which provides access to the spectral decomposition of the Jacobian of the flux vector for this class of models, Burger et al. [J. Comput. Phys. 230, 2322–2344 (2011)] proposed a spectral weighted essentially non-oscillatory (WENO) scheme for the numerical solution of the model. It is demonstrated that the efficiency …

Conservation lawAdaptive mesh refinementApplied MathematicsComputational MechanicsScalar (physics)KinematicsSuspension (topology)Matrix decompositionNonlinear systemsymbols.namesakeClassical mechanicsJacobian matrix and determinantsymbolsApplied mathematicsMathematicsZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik
researchProduct

On the hyperbolicity of certain models of polydisperse sedimentation

2012

The sedimentation of a polydisperse suspension of small spherical particles dispersed in a viscous fluid, where particles belong to N species differing in size, can be described by a strongly coupled system of N scalar, nonlinear first-order conservation laws for the evolution of the volume fractions. The hyperbolicity of this system is a property of theoretical importance because it limits the range of validity of the model and is of practical interest for the implementation of numerical methods. The present work, which extends the results of R. Burger, R. Donat, P. Mulet, and C.A. Vega (SIAM Journal on Applied Mathematics 2010; 70:2186–2213), is focused on the fluxes corresponding to the …

Conservation lawGeneral MathematicsNumerical analysisMathematical analysisGeneral EngineeringRational functionNonlinear systemsymbols.namesakeLinear algebraDiagonal matrixJacobian matrix and determinantsymbolsEigenvalues and eigenvectorsMathematics
researchProduct

Flux-gradient and source-term balancing for certain high resolution shock-capturing schemes

2009

Abstract We present an extension of Marquina’s flux formula, as introduced in Fedkiw et al. [Fedkiw RP, Merriman B, Donat R, Osher S. The penultimate scheme for systems of conservation laws: finite difference ENO with Marquina’s flux splitting. In: Hafez M, editor. Progress in numerical solutions of partial differential equations, Arcachon, France; July 1998], for the shallow water system. We show that the use of two different Jacobians at cell interfaces prevents the scheme from satisfying the exact C -property [Bermudez A, Vazquez ME. Upwind methods for hyperbolic conservation laws with source terms. Comput Fluids 1994;23(8):1049–71] while the approximate C -property is satisfied for high…

Conservation lawPartial differential equationGeneral Computer ScienceGeneral EngineeringFinite differenceFluxGeometryTerm (logic)symbols.namesakeScheme (mathematics)Jacobian matrix and determinantsymbolsOrder (group theory)Applied mathematicsMathematicsComputers & Fluids
researchProduct

Stress-Strain Law for Confined Concrete with Hardening or Softening Behavior

2013

This paper provides a new general stress-strain law for concrete confined by steel, fiber reinforced polymer (FRP), or fiber reinforced cementitious matrix (FRCM), obtained by a suitable modification of the well-known Sargin’s curve for steel confined concrete. The proposed law is able to reproduce stress-strain curve of any shape, having both hardening or softening behavior, by using a single closed-form simple algebraic expression with constant coefficients. The coefficients are defined on the basis of the stress and the tangent modulus of the confined concrete in three characteristic points of the curve, thus being related to physical meaningful parameters. It will be shown that if the v…

Constant coefficientsMaterials scienceFiber reinforced polymers (FRP)Article SubjectStress–strain curvefiber reinforced cementitiuos matrix (FRCM)Fibre-reinforced plasticConfined concretefiber reinforced cementitiuos matrix (FRCM); Confined concrete; Fiber reinforced polymers (FRP); modelsmodelsSettore ICAR/09 - Tecnica Delle Costruzionilcsh:TA1-2040LawTangent modulusHardening (metallurgy)Algebraic expressionComposite materialConfinement of concrete general stress-strain law transverse reinforcement FRP FRCMCementitious matrixlcsh:Engineering (General). Civil engineering (General)SofteningCivil and Structural EngineeringAdvances in Civil Engineering
researchProduct

A new mathematical tool for an exact treatment of open quantum system dynamics

2005

A new method to obtain an operatorial exact solution of a wide class of Markovian master equations is presented. Its key point is the existence of a constant of motion partitioning the Hilbert space into finite-dimensional subspaces. The consequent possibility of representing the reduced density operator as a block diagonal matrix is shown. Each “block operator” evolves under the action of a non-unitary operator explicitly derived. Our mathematical approach is illustrated applying it to simple physical systems.

Constant of motionOperator (physics)Hilbert spaceBlock matrixCondensed Matter Physicssymbols.namesakeOpen quantum systemMultiplication operatorQuantum mechanicsequationsMaster equationsymbolsApplied mathematicsUnitary operatormathematical toolMathematics
researchProduct

Unitary Space–Time Constellation Design Based on the Chernoff Bound of the Pairwise Error Probability

2008

Unitary space-time constellation design is considered for noncoherent multiple-antenna communications, where neither the transmitter nor the receiver knows the fading coefficients of the channel. By employing the Clarke's subdifferential theorem of the sum of the kappa largest singular values of a unitary matrix, we present a numerical optimization procedure for finding unitary space-time signal constellations of any dimension. The Chernoff bound of the pairwise error probability is used directly as a design criterion. The constellations are found by performing gradient descent search on a family ldquosurrogaterdquo functions that converge to the maximum pairwise error probability. The comp…

Constellation diagramUnitary matrixLibrary and Information SciencesComputer Science ApplicationsCombinatoricsChannel capacityChernoff boundGradient descentAlgorithmRandom variableDecoding methodsPairwise error probabilityComputer Science::Information TheoryInformation SystemsMathematicsIEEE Transactions on Information Theory
researchProduct

Numerical decomposition of geometric constraints

2005

Geometric constraint solving is a key issue in CAD/CAM. Since Owen's seminal paper, solvers typically use graph based decomposition methods. However, these methods become difficult to implement in 3D and are misled by geometric theorems. We extend the Numerical Probabilistic Method (NPM), well known in rigidity theory, to more general kinds of constraints and show that NPM can also decompose a system into rigid subsystems. Classical NPM studies the structure of the Jacobian at a random (or generic) configuration. The variant we are proposing does not consider a random configuration, but a configuration similar to the unknown one. Similar means the configuration fulfills the same set of inci…

Constraint (information theory)AlgebraSet (abstract data type)symbols.namesakeMathematical optimizationProbabilistic methodJacobian matrix and determinantsymbolsStructure (category theory)CADGas meter proverMathematicsIncidence (geometry)Proceedings of the 2005 ACM symposium on Solid and physical modeling
researchProduct