Search results for "abstract"

showing 10 items of 1959 documents

On the WGSC Property in Some Classes of Groups

2009

The property of quasi-simple filtration (or qsf) for groups has been introduced in literature more than 10 years ago by S. Brick. This is equivalent, for groups, to the weak geometric simple connectivity (or wgsc). The main interest of these notions is that there is still not known whether all finitely presented groups are wgsc (qsf) or not. The present note deals with the wgsc property for solvable groups and generalized FC-groups. Moreover, a relation between the almost-convexity condition and the Tucker property, which is related to the wgsc property, has been considered for 3-manifold groups.

Combinatoricsalmost-convex groupsProperty (philosophy)Tucker propertySimple (abstract algebra)Solvable groupGeneral MathematicsFiltration (mathematics)FC-groups and nilpotent groupSettore MAT/03 - Geometriaweak geometric simple connectivityMathematicsMediterranean Journal of Mathematics
researchProduct

Error Bounds for the Numerical Evaluation of Integrals with Weights

1988

This paper is concerned with a procedure of obtaining error bounds for numerically evaluated integrals with weights. If \( - \infty \mathop < \limits_ = a < b\mathop < \limits_ = \infty \), w integrable over [a,b] and positive almost everywhere, then an approximation of \({I_W}f: = \int\limits_a^b {w\left( t \right)f\left( t \right)dt} \) by a quadrature rule \({Q_n}f: = \sum\limits_{i = 0}^n {{\alpha _i}f\left( {{t_i}} \right)} \) is leading to the error Enf ≔ Iwf ‒ Qnf. An algorithm is derived for the computation of bounds for |Enf| depending on the smoothness of the integrand f and on the degree of exactness of Q. As initial values this algorithm needs moments of the weighting function w…

Combinatoricssymbols.namesakeSmoothness (probability theory)Degree (graph theory)Simple (abstract algebra)StatisticssymbolsGaussian quadratureAlmost everywhereFunction (mathematics)Mathematics
researchProduct

Do happy faces really modulate liking for Jackson Pollock art and statistical fractal noise images?

2017

Flexas et al. (2013) demonstrated that happy faces increase preference for abstract art if seen in short succession. We could not replicate their findings. In our first experiment, we tested whether valence, saliency or arousal of facial primes can modulate liking of Jackson Pollock art crops. In the second experiment, the emphasis was on testing another type of abstract visual stimuli which possess similar low-level image features: statistical fractal noise images. Pollock crops were rated significantly higher when primed with happy faces in contrast to neutral faces, but not differently to the no-prime condition. Findings of our study suggest that affective priming with happy faces may be…

CommunicationVisual materialVisual perceptionbiologybusiness.industrylcsh:BF1-990Abstract artAffective primingbiology.organism_classificationPollockArousalFractallcsh:Psychologyhappy facesJackson Pollockaffective primingValence (psychology)businessPsychologyabstract artGeneral Psychologypink noiseCognitive psychologyPsihologija
researchProduct

Nonlinear Nonhomogeneous Robin Problems with Almost Critical and Partially Concave Reaction

2020

We consider a nonlinear Robin problem driven by a nonhomogeneous differential operator, with reaction which exhibits the competition of two Caratheodory terms. One is parametric, $$(p-1)$$-sublinear with a partially concave nonlinearity near zero. The other is $$(p-1)$$-superlinear and has almost critical growth. Exploiting the special geometry of the problem, we prove a bifurcation-type result, describing the changes in the set of positive solutions as the parameter $$\lambda >0$$ varies.

Competition phenomenacompetition phenomenanonlinear maximum principleAlmost critical growthLambda01 natural sciencesSet (abstract data type)symbols.namesakeMathematics - Analysis of PDEsSettore MAT/05 - Analisi Matematica0103 physical sciencesFOS: Mathematics0101 mathematicsbifurcation-type resultMathematicsParametric statisticsNonlinear regularity35J20 35J60010102 general mathematicsMathematical analysisZero (complex analysis)udc:517.956.2Differential operatorBifurcation-type resultalmost critical growthNonlinear systemDifferential geometryFourier analysissymbolsnonlinear regularity010307 mathematical physicsGeometry and TopologyNonlinear maximum principleStrong comparison principlestrong comparison principleAnalysis of PDEs (math.AP)
researchProduct

Voxel-based General Voronoi Diagram for Complex Data with Application on Motion Planning

2020

One major challenge in Assembly Sequence Planning (ASP) for complex real-world CAD-scenarios is to find appropriate disassembly paths for all assembled parts. Such a path places demands on its length and clearance. In the past, it became apparent that planning the disassembly path based on the (approximate) General Voronoi Diagram (GVD) is a good approach to achieve these requirements. But for complex real-world data, every known solution for computing the GVD is either too slow or very memory consuming, even if only approximating the GVD.We present a new approach for computing the approximate GVD and demonstrate its practicability using a representative vehicle data set. We can calculate a…

Complex data typeComputer sciencePath (graph theory)0202 electrical engineering electronic engineering information engineeringGraph (abstract data type)Approximation algorithm020207 software engineering020201 artificial intelligence & image processing02 engineering and technologyMotion planningVoronoi diagramAlgorithm2020 IEEE International Conference on Robotics and Automation (ICRA)
researchProduct

Day-ahead forecasting for photovoltaic power using artificial neural networks ensembles

2016

Solar photovoltaic plants power output forecasting using machine learning techniques can be of a great advantage to energy producers when they are implemented with day-ahead energy market data. In this work a model was developed using a supervised learning algorithm of multilayer perceptron feedforward artificial neural network to predict the next twenty-four hours (day-ahead) power of a solar facility using fetched weather forecast of the following day. Each set of tested network configuration was trained by the historical power output of the plant as a target. For each configuration, one hundred networks ensembles was averaged to give the ability to generalize a better forecast. The train…

ComponentComputer science020209 energyEnergy Engineering and Power Technologyforecasting02 engineering and technologyMachine learningcomputer.software_genrephotovoltaicSet (abstract data type)0202 electrical engineering electronic engineering information engineeringEnergy marketRenewable EnergyStyleStylingSustainability and the EnvironmentArtificial neural networkbusiness.industryFormattingPhotovoltaic systemFeed forwardComponent; Formatting; Insert (key words); Style; Styling; Energy Engineering and Power Technology; Renewable Energy Sustainability and the EnvironmentInsert (key words)Power (physics)Settore ING-IND/31 - ElettrotecnicaMultilayer perceptronArtificial intelligencebusinessartificial neural networkscomputerEnergy (signal processing)2016 IEEE International Conference on Renewable Energy Research and Applications (ICRERA)
researchProduct

A note on Fréchet and approximate subdifferentials of composite functions

1994

The aim of this note is to present in the reflexive Banach space setting a natural and simple proof of the formula of the approximate subdifferential of a composite function.

Composite functionMathematics::Functional AnalysisPure mathematicsSimple (abstract algebra)General MathematicsComposite numberBanach spaceSubderivativeMathematicsBulletin of the Australian Mathematical Society
researchProduct

A Guaranteed performance of a green data center based on the contribution of vital nodes

2016

International audience; In order to satisfy the need for the critical computing resources, many data center architectures proposed to house a huge number of network devices. These devices are used to achieve the highest performance in case of full utilization of the network. However, the peak capacity of the network is rarely reached. Consequently, many devices are set into idle state and cause a huge energy waste leading to a non-proportionality between the network load and the energy consumed. In this paper, we propose a power-aware routing algorithm that saves energy consumption with a negligible trade-off on the performance of the network. The idea is to keep active only the source and …

Computation timeComputer science[ INFO.INFO-NI ] Computer Science [cs]/Networking and Internet Architecture [cs.NI]Network02 engineering and technology01 natural sciences7. Clean energySet (abstract data type)Idle[INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI][ SPI.NRJ ] Engineering Sciences [physics]/Electric powerenergy savingEnergy saving0103 physical sciences0202 electrical engineering electronic engineering information engineeringTime complexity010302 applied physicsEnergy[INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI]business.industryvital nodes[SPI.NRJ]Engineering Sciences [physics]/Electric powercomputation timeVital nodes020206 networking & telecommunicationsEnergy consumptionData center networkNetworking hardwareState (computer science)businessEnergy (signal processing)[SPI.NRJ] Engineering Sciences [physics]/Electric powerComputer network
researchProduct

On the preparation of simple and universal buffers including polynuclear species

1986

A simple generalized procedure for the calculation of electrolyte concentrations in pH-buffers is proposed. Mixtures of acid-base systems and formation of polynuclear species at high ionic strengths are considered, and a diagram useful for the study and preparation of the buffers is shown.

Computational chemistryChemistrySimple (abstract algebra)Inorganic chemistryNanochemistryIonic bondingElectrolyteAnalytical ChemistryMikrochimica Acta
researchProduct

Computational Modelling of Public Policy: Reflections on Practice

2018

Computational models are increasingly being used to assist in developing, implementing and evaluating public policy. This paper reports on the experience of the authors in designing and using computational models of public policy (‘policy models’, for short). The paper considers the role of computational models in policy making, and some of the challenges that need to be overcome if policy models are to make an effective contribution. It suggests that policy models can have an important place in the policy process because they could allow policy makers to experiment in a virtual world, and have many advantages compared with randomised control trials and policy pilots. The paper then summari…

Computational modelCalibration and validationProcess (engineering)Computer science05 social sciencesControl (management)050401 social sciences methodsGeneral Social SciencesPublic policy02 engineering and technologyDomain (software engineering)0504 sociologyRisk analysis (engineering)020204 information systemsComponent (UML)0202 electrical engineering electronic engineering information engineeringComputer Science (miscellaneous)Abstraction (linguistics)
researchProduct