Search results for " set"

showing 10 items of 2095 documents

El management de las conductas socioemocionales. Una aproximación teórica y empírica desde el caso de los agentes de "contact centers"

2020

How is a specific type of emotion-related work conducts formed today? What principles guide these conducts and what effects do they have on those who work? The study of Contact Center agents allows us to understand how a set of personal qualities such as patience and good treatment of others, certain desires and personal impulses or even intimate sensations such as anguish or individual expectations have become managerialized emotions that end up modifying the inner attitudes of these agents. Within this framework, we propose a theoretical approach that integrates the work of Weber, Foucault and Elias, which invites us to reflect on a socio-emotional manner of leading one?s life (Lebensfu?h…

Ericemotional managementcertain desires and personal impulses or even intimate sensations such as anguish or individual expectations have become managerialized emotions that end up modifying the inner attitudes of these agents. Within this frameworkFoucault and EliasCompetencias SocioemocionalesSubjetividad.:SOCIOLOGÍA [UNESCO]Conducción de Vida (lebensfu?hrung)Osvaldo Javier How is a specific type of emotion-related work conducts formed today? What principles guide these conducts and what effects do they have on those who work? The study of Contact Center agents allows us to understand how a set of personal qualities such as patience and good treatment of othersContact Centers-agentesLópez Ruizwhich invites us to reflect on a socio-emotional manner of leading one?s life (Lebensfu?hrung) that is emblematic of our timeon how a dominant managerial rhetoric is experienced as true and on what the possibilities of other subjectivities are Management Emocionalmanner of leading one?s life (Lebensfu?hrung)UNESCO::SOCIOLOGÍAsubjectivity 33 471137-7038 8537 Arxius de sociologia 562372 2020 42 7674030 El management de las conductas socioemocionales. Una aproximación teórica y empírica desde el caso de los agentes de "contact centers" Moenchwe propose a theoretical approach that integrates the work of Webercontact center-agentssocioemotional competences
researchProduct

Il caso Du Bos e il paradigma dell'estetica

2005

Il contributo evidenzia non solo il ruolo fondamentale di Jean-Bapiste Du Bos nel Settecento europeo, il secolo della “nascita dell’esteica”, ma ne sottolinea anche la sua virtuale incidenza nel dibattito contemporaneo. Il “caso Du Bos” è tale perché le sue Riflessioni hanno subito nella storiografia estetica una sorta di rimozione e considerato di conseguenza come un autore di “fini osservazioni” che tuttavia “non costituiscono un insieme sistematico” ma al massimo raggiungono una “sistematicità precaria”. Tale paradigma storiografico (basti ripensare le storie dell’estetica di Zimmerman, Menéndez y Pelayo, Bosanquet e Croce) ha dunque infelicemente marginalizzato le riflessioni di Du Bos:…

Estetica Settecento Dubos
researchProduct

Notte di luce. Il Settecento e la nascita dell'Estetia

2008

Il lavoro presenta le complesse dinamiche attraverso cui nel Settecento avviene la nascita dell’estetica, utilizzando il modello ideologico della “luce che vince le tenebre”. Questo topos, il cui vessillo iconografico è il frontespizio della Metafisica tedesca (1719) di Christian Wolf, pervade tutto il Settecento, il “secolo dei lumi”, da Baumgarten sino al suo ultimo grande interprete, Immanuel Kant e costituisce lievito vitale non solo entro i recinti accademici, ma nell’intero mondo della cultura (si pensi al Flauto magico di Mozart). Tale modello epistemologico si presenta ancora oggi prolifico di suggestioni; pertanto ritornare all’estetica del secolo dei lumi e al suo straordinario la…

Estetica Settecento Nascita
researchProduct

Experimental IR study and ab initio modelling of ethylene adsorption in a MFI - type host zeolite.

2009

International audience; Different ab initio methods and experimental results are used to investigate the effect of the adsorption of one ethylene molecule on silicalite-1, a MFI type zeolite. We used simplified models to simulate a portion of a straight or sinusoidal channel of silicalite-1 at a quantum level. The calculated absorption spectra of the models are qualitatively in good agreement with the experimental FTIR spectrum of silicalite-1. Additionally we simulate the FTIR spectrum of the isolated ethylene molecule and that of an ethylene molecule in interaction with the above-mentioned zeolite models. Results are discussed depending on the method and specific basis set and compared wi…

Ethylene010304 chemical physicsAbsorption spectroscopyChemistryBiophysicsAb initio010402 general chemistryCondensed Matter Physics01 natural sciences0104 chemical sciencesMolecular dynamicschemistry.chemical_compound[ PHYS.PHYS.PHYS-CHEM-PH ] Physics [physics]/Physics [physics]/Chemical Physics [physics.chem-ph]AdsorptionComputational chemistry0103 physical sciencesPhysical SciencesPhysical chemistryMolecule[PHYS.PHYS.PHYS-CHEM-PH]Physics [physics]/Physics [physics]/Chemical Physics [physics.chem-ph]Physical and Theoretical ChemistryZeoliteMolecular BiologyBasis setComputingMilieux_MISCELLANEOUS
researchProduct

Hârat al gadîdah. Luoghi della memoria e della cura

2001

Etnopsicoanalisi Migrazione setting
researchProduct

A New Time Dependent Model Based on Level Set Motion for Nonlinear Deblurring and Noise Removal

1999

In this paper we summarize the main features of a new time dependent model to approximate the solution to the nonlinear total variation optimization problem for deblurring and noise removal introduced by Rudin, Osher and Fatemi. Our model is based on level set motion whose steady state is quickly reached by means of an explicit procedure based on an ENO Hamilton-Jacobi version of Roe's scheme. We show numerical evidence of the speed, resolution and stability of this simple explicit procedure in two representative 1D and 2D numerical examples.

Euler–Lagrange equationDeblurringMathematical optimizationLevel set (data structures)Nonlinear systemSteady state (electronics)Optimization problemSimple (abstract algebra)Applied mathematicsStability (probability)Mathematics
researchProduct

Extrapolation of water and formaldehyde harmonic and anharmonic frequencies to the B3LYP/CBS limit using polarization consistent basis sets

2010

The harmonic and anharmonic frequencies of fundamental vibrations in formaldehyde and water were successfully estimated using the B3LYP Kohn-Sham limit. The results obtained with polarization- and correlation-consistent basis sets were fitted with a two-parameter formula. Anharmonic corrections were obtained by a second order perturbation treatment (PT2). We compared the performance of the PT2 scheme on the two title molecules using SCF, MP2 and DFT (BLYP, B3LYP, PBE and B3PW91 functionals) methods combined with polarization consistent pc-n (n = 0, 1, 2, 3, 4) basis sets, Dunning’s basis sets (aug)-cc-pVXZ where X = D, T, Q, 5, 6 and Pople’s basis sets up to 6-311++G(3df,2pd). The influence…

ExtrapolationPerturbation (astronomy)Sensitivity and SpecificityVibrationMolecular physicsCatalysisInorganic ChemistryRoot mean squareFormaldehydeQuantum mechanicsWavenumberIR and Raman theoretical spectraPhysics::Chemical PhysicsPhysical and Theoretical ChemistryBasis setOriginal PaperChemistrySpectrum AnalysisOrganic ChemistryAnharmonicityHarmonicReproducibility of ResultsWaterComplete basis set limitModels TheoreticalPolarization (waves)Computer Science ApplicationsVibrationComputational Theory and MathematicsAnharmonicJournal of Molecular Modeling
researchProduct

Search for relativistic magnetic monopoles with the ANTARES neutrino telescope

2012

Magnetic monopoles are predicted in various unified gauge models and could be produced at intermediate mass scales. Their detection in a neutrino telescope is facilitated by the large amount of light emitted compared to that from muons. This paper reports on a search for upgoing relativistic magnetic monopoles with the ANTARES neutrino telescope using a data set of 116 days of live time taken from December 2007 to December 2008. The one observed event is consistent with the expected atmospheric neutrino and muon background, leading to a 90% C.L. upper limit on the monopole flux between 1.3 ¿ 10¿17 and 8.9 ¿ 10¿17 cm¿2 s¿1 sr¿1 for monopoles with velocity ß ¿ 0.625.

FLUXMuon backgroundParticle physicsGauge modelMagnetic monopolesAstrophysics::High Energy Astrophysical PhenomenaMagnetic monopoleneutrino telescopes; antares; magnetic monopoleFOS: Physical sciencesCosmic ray01 natural sciencesNuclear physics0103 physical sciencesNeutronFIELD010306 general physicsDETECTORCherenkov radiationZenithHigh Energy Astrophysical Phenomena (astro-ph.HE)NeutronsPhysicsSPECTRUMAtmospheric neutrinosMagnetic monopoleANTARES:Física::Acústica [Àrees temàtiques de la UPC]MuonCharged particles010308 nuclear & particles physicsAstronomy and AstrophysicsMonopols magnèticsUpper limitsNeutrino detectorMass scaleFISICA APLICADA[PHYS.HPHE]Physics [physics]/High Energy Physics - Phenomenology [hep-ph]Física nuclearData setsNeutrino telescopes[PHYS.ASTR]Physics [physics]/Astrophysics [astro-ph]Astrophysics - High Energy Astrophysical PhenomenaEvent (particle physics)TelescopesAstroparticle Physics
researchProduct

On the Greedy Algorithm for the Shortest Common Superstring Problem with Reversals

2015

We study a variation of the classical Shortest Common Superstring (SCS) problem in which a shortest superstring of a finite set of strings $S$ is sought containing as a factor every string of $S$ or its reversal. We call this problem Shortest Common Superstring with Reversals (SCS-R). This problem has been introduced by Jiang et al., who designed a greedy-like algorithm with length approximation ratio $4$. In this paper, we show that a natural adaptation of the classical greedy algorithm for SCS has (optimal) compression ratio $\frac12$, i.e., the sum of the overlaps in the output string is at least half the sum of the overlaps in an optimal solution. We also provide a linear-time implement…

FOS: Computer and information sciences0102 computer and information sciences02 engineering and technologyInformation System01 natural sciencesString (physics)Theoretical Computer ScienceCombinatoricsHigh Energy Physics::TheoryAnalysis of algorithmGreedy algorithmComputer Science - Data Structures and Algorithms0202 electrical engineering electronic engineering information engineeringData Structures and Algorithms (cs.DS)Greedy algorithmFinite setAnalysis of algorithmsMathematicsSuperstring theoryShortest Common SuperstringComputer Science Applications1707 Computer Vision and Pattern RecognitionComputer Science ApplicationsReversalShortest Path Faster Algorithm010201 computation theory & mathematicsCompression ratioSignal Processing020201 artificial intelligence & image processingK shortest path routingInformation Systems
researchProduct

Topological Logics with Connectedness over Euclidean Spaces

2013

We consider the quantifier-free languages, Bc and Bc °, obtained by augmenting the signature of Boolean algebras with a unary predicate representing, respectively, the property of being connected, and the property of having a connected interior. These languages are interpreted over the regular closed sets of R n ( n ≥ 2) and, additionally, over the regular closed semilinear sets of R n . The resulting logics are examples of formalisms that have recently been proposed in the Artificial Intelligence literature under the rubric Qualitative Spatial Reasoning. We prove that the satisfiability problem for Bc is undecidable over the regular closed semilinear sets in all dimensions greater than 1,…

FOS: Computer and information sciencesComputer Science - Logic in Computer ScienceGeneral Computer ScienceUnary operationClosed setLogicSocial connectedness0102 computer and information sciencesTopological space68T30 (Primary) 03D15 68Q17 (Secondary)Topology01 natural sciencesTheoretical Computer ScienceMathematics - Geometric TopologyEuclidean geometryFOS: Mathematics0101 mathematicsMathematicsI.2.4; F.4.3; F.2.2Discrete mathematicsI.2.4010102 general mathematicsGeometric Topology (math.GT)Predicate (mathematical logic)Undecidable problemLogic in Computer Science (cs.LO)Computational Mathematics010201 computation theory & mathematicsF.4.3F.2.2Boolean satisfiability problemACM Transactions of Computational Logic
researchProduct