Search results for "IPA"

showing 10 items of 5795 documents

Modalità orientata sul partecipante in siciliano contemporaneo: i dati dell'Atlante linguistico della Sicilia (ALS)

2021

Il contributo descrive lo spazio semantico-funzionale codificato dalle costruzioni del siciliano contemporaneo che coinvolgono aviri a, putiri, sapiri e vuliri: (a) aviri a (avere da/dovere) + infinito; (b) putiri/sapiri (potere/sapere) + infinito; (c) vuliri (volere) + infinito; (d) vuliri + participio passato. In particolare, si farà riferimento a due domini funzionali intimamente connessi: la modalità orientata sul partecipante e la direttività. Il corpus di analisi è costituito dagli etnotesti e dalle produzioni a codice bloccato siciliano della sezione sociovariazionale dell’Atlante Linguistico della Sicilia (ALS), nonché dalle risposte ai quesiti traduttivi (italiano/siciliano, sicili…

DirectivitySettore L-FIL-LET/12 - Linguistica ItalianaParticipant-oriented ModalitySicilianModalitySettore L-LIN/01 - Glottologia E Linguistica
researchProduct

Existence and asymptotic properties for quasilinear elliptic equations with gradient dependence

2016

Abstract The paper focuses on a Dirichlet problem driven by the ( p , q ) -Laplacian containing a parameter μ > 0 in the principal part of the elliptic equation and a (convection) term fully depending on the solution and its gradient. Existence of solutions, uniqueness, a priori estimates, and asymptotic properties as μ → 0 and μ → ∞ are established under suitable conditions.

Dirichlet problemConvectionApplied Mathematics010102 general mathematicsMathematical analysis01 natural sciences(pq)-LaplacianTerm (time)010101 applied mathematicsElliptic curveQuasilinear elliptic equationSettore MAT/05 - Analisi Matematicagradient dependenceasymptotic propertiesPrincipal partA priori and a posterioriUniqueness0101 mathematicsLaplace operatorMathematics
researchProduct

On Noncoercive (p, q)-Equations

2021

We consider a nonlinear Dirichlet problem driven by a (p, q)-Laplace differential operator (1 < q < p). The reaction is (p - 1)-linear near +/-infinity and the problem is noncoercive. Using variational tools and truncation and comparison techniques together with critical groups, we produce five nontrivial smooth solutions all with sign information and ordered. In the particular case when q = 2, we produce a second nodal solution for a total of six nontrivial smooth solutions all with sign information.

Dirichlet problemTruncationGeneral MathematicsMathematical analysisGeneral Physics and AstronomyDifferential operator(pq)-LaplacianNonlinear systemextremal solutionsprincipal eigenvalueSettore MAT/05 - Analisi Matematicanonlinear regularityconstant sign and nodal solutionsSign (mathematics)Mathematics
researchProduct

Un diritto di agire in modo penalmente illecito?

2005

Analisi critica della idea che possa esistere un diritto di agire in modo penalmente illecito, e che tale diritto possa, in particolare, localizzarsi nella categoria delle cosiddette cause di giustificazione.

Diritti Diritto di fare cio' che e' illecito Cause di giustificazione Bipartizione e tripartizione del reato
researchProduct

Sistemi elettorali, electoral integrity e diritti umani. Il diritto alla partecipazione elettorale ed alla rappresentanza politica delle popolazioni …

2014

Diritti umani diritti indigeni partecipazione elettorale rappresentanza politica sistemi elettorali Colombia Bolivia VenezuelaSettore IUS/21 - Diritto Pubblico Comparato
researchProduct

Hybrid Engagement: Discourses and Scenarios of Entrepreneurial Journalism

2018

Although the challenge posed by social media and the participatory turn concerns culture and values at the very heart of journalism, journalists have been reluctant to adopt participatory values and practices. To encourage audience participation and to offer journalism that is both trustworthy and engaging, journalists of the future may embrace a hybrid practice of journalistic objectivity and audience-centred dialogue. As innovative and experimental actors, entrepreneurial journalism outlets can perform as forerunners of such a culture. By analysing discourses in the “About Us” pages of 41 entrepreneurial journalism outlets, the article examines the emerging journalistic ethos of entrepren…

Discourse analysishybrid journalismparticipatory journalismddc:070lcsh:Communication. Mass mediaEthosaffect; entrepreneurial journalism; future of journalism; participatory journalism0508 media and communicationsHybriditySoziale MedienfuturologyvaikuttaminenparticipationSociologyentrepreneurial journalismta518Objectivity (science)dialogueCommunication05 social sciencesscenariosKommunikatorforschung Journalismuslcsh:P87-96Objektivitätdiskurssianalyysiobjectivitysocial media050801 communication & media studiesDiskursanalysejournalismDigital mediatulevaisuudentutkimusInteractive electronic MediaCommunicator Research JournalismJournalismus0502 economics and businessSocial mediahybridityPartizipationZukunftsforschungdiscourse analysisinteraktive elektronische MedienNews media journalism publishingOnline-MedienInternetfutures researchfuture of journalismbusiness.industryMedia studiesDialogCitizen journalismonline mediaskenaariothybridimediaHybriditätaffect050211 marketingJournalismPublizistische Medien JournalismusVerlagswesenbusinessMedia and Communication
researchProduct

Adjacent vertices can be hard to find by quantum walks

2018

Quantum walks have been useful for designing quantum algorithms that outperform their classical versions for a variety of search problems. Most of the papers, however, consider a search space containing a single marked element. We show that if the search space contains more than one marked element, their placement may drastically affect the performance of the search. More specifically, we study search by quantum walks on general graphs and show a wide class of configurations of marked vertices, for which search by quantum walk needs Ω(N) steps, that is, it has no speed-up over the classical exhaustive search. The demonstrated configurations occur for certain placements of two or more adjace…

Discrete mathematics0209 industrial biotechnologyControl and OptimizationComputer science010102 general mathematicsBrute-force search02 engineering and technologyGrid01 natural sciencesGraphHuman-Computer InteractionComputational Mathematics020901 industrial engineering & automationBipartite graphQuantum algorithmQuantum walkHypercube0101 mathematicsVariety (universal algebra)Element (category theory)Block (data storage)Discrete Models in Control Systems Theory
researchProduct

Span-Program-Based Quantum Algorithms for Graph Bipartiteness and Connectivity

2016

Span program is a linear-algebraic model of computation which can be used to design quantum algorithms. For any Boolean function there exists a span program that leads to a quantum algorithm with optimal quantum query complexity. In general, finding such span programs is not an easy task. In this work, given a query access to the adjacency matrix of a simple graph G with n vertices, we provide two new span-program-based quantum algorithms:an algorithm for testing if the graph is bipartite that uses $$On\sqrt{n}$$ quantum queries;an algorithm for testing if the graph is connected that uses $$On\sqrt{n}$$ quantum queries.

Discrete mathematicsComputer scienceExistential quantificationModel of computationTheoryofComputation_GENERALComputerSystemsOrganization_MISCELLANEOUSBipartite graphGraph (abstract data type)Quantum algorithmAdjacency matrixBoolean functionQuantumComputer Science::DatabasesMathematicsofComputing_DISCRETEMATHEMATICS
researchProduct

Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem

2014

The bipartite unconstrained 0-1 quadratic programming problem (BQP) is a difficult combinatorial problem defined on a complete graph that consists of selecting a subgraph that maximizes the sum of the weights associated with the chosen vertices and the edges that connect them. The problem has appeared under several different names in the literature, including maximum weight induced subgraph, maximum weight biclique, matrix factorization and maximum cut on bipartite graphs. There are only two unpublished works (technical reports) where heuristic approaches are tested on BQP instances. Our goal is to combine straightforward search elements to balance diversification and intensification in bot…

Discrete mathematicsGeneral Computer ScienceIterated local searchMaximum cutInduced subgraphManagement Science and Operations ResearchComplete bipartite graphCombinatoricsBQPModeling and SimulationBipartite graphBeam searchQuadratic programmingMathematicsofComputing_DISCRETEMATHEMATICSMathematicsComputers & Operations Research
researchProduct

Existence of fixed points for the sum of two operators

2010

The purpose of this paper is to study the existence of fixed points for the sum of two nonlinear operators in the framework of real Banach spaces. Later on, we give some examples of applications of this type of results (© 2010 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)

Discrete mathematicsGeneral MathematicsMicrolocal analysisBanach spaceDissipative operatorFixed pointOperator theoryType (model theory)Integral equationFourier integral operatorMathematicsMathematische Nachrichten
researchProduct