Search results for "sfi"

showing 10 items of 221 documents

Koneluettava lapsi? : opetuksen datafikaatio ja automaatio Minä-Se -suhteiden tuotantokoneistona

2022

Tämän artikkelin tavoitteena on laajentaa digitalisaatiosta, datafikaatiosta, automaatiosta ja kasvatuksesta käytävää teoreettista keskustelua. Artikkelissa pohdin sitä, millaisia merkityksiä koulutuksen kiihtyvällä datafikaatiolla ja automaatiolla on opettaja-oppilassuhteille ja ylipäätään käsityksellemme formaalin kasvatuksen olemuksesta. Käsitteellisesti ammennan Martin Buberin dialogisesta filosofiasta, erityisesti Minä–Sinä- ja Minä–Se-käsitepareista, jotka kuvaavat eri tapoja, joilla ihmiset ovat suhteissa toistensa kanssa. Datafikaatio ja automaatio tuovat uusia näkökulmia Buberin ideoihin, erityisesti Minä–Se-suhteeseen. Oppilaan representaatio ei rakennu enää vain yksilön, tässä op…

Buber Martinoppiminenteknologiakritiikkikasvatusteknologinen kehitysopetusdatafikaatiokasvatusteoriatautomaatiokasvatusfilosofiadialogisuusdialoginen filosofiadigitalisaatioopettaja-oppilassuhde
researchProduct

ERP and Organizational Misfits: An ERP Customization Journey

2016

Abstract Enterprise resource planning (ERP) projects are complex and resource demanding. Some ERP projects fail due to what is called ‘misfit’ between the adopting organization's business requirements and the ERP's functionalities. Existing literature has studied how ERP systems match to different organizations and have argued that there always exists a gap between the business rules embedded in the system, and the practices and processes that exist in organizations. Thus, tailoring might be an important procedure during ERP implementations, in which the ERP customization takes place in order to ensure the compliance with the organizations’ critical business processes and requirements. Via …

Business requirementsKnowledge managementTailoringBusiness ruleBusiness processComputer sciencebusiness.industry05 social sciences02 engineering and technologyFitERP SystemsPersonalizationResource (project management)Order (exchange)020204 information systems0502 economics and business0202 electrical engineering electronic engineering information engineeringGeneral Earth and Planetary SciencesMisfitbusinessImplementationEnterprise resource planning050203 business & managementCustomizationGeneral Environmental ScienceProcedia Computer Science
researchProduct

What Can Modularity of Mind Tell Us about the Semantics/Pragmatics Debate?

2010

In this paper I make connections between two domains of information, research on the semantics/pragmatics debate and on modularity of mind, in the hope that establishing connections and parallel structure may be fruitful in deepening knowledge of the interface between semantics and pragmatics. In particular I want to inquire if modularity of mind can help us move towards the resolution of important theoretical problems like Grice's circle, the cancellability of explicatures/implicatures, the analogy between perceptual enrichments and explicatures due to free enrichments, the routing problem for explicatures (do they strictly take input from implicatures?), and satisficing strategies in prag…

Cognitive scienceLinguistics and LanguagebiologyRelevance theoryComputer sciencebusiness.industryInterpretation (philosophy)AnalogyPragmaticsSemanticsLanguage and LinguisticsLinguisticsModularity of mindbiology.animalSatisficingGriceArtificial intelligencebusinessAustralian Journal of Linguistics
researchProduct

On the decision problem for the guarded fragment with transitivity

2002

The guarded fragment with transitive guards, [GF+TG], is an extension of GF in which certain relations are required to be transitive, transitive predicate letters appear only in guards of the quantifiers and the equality symbol may appear everywhere. We prove that the decision problem for [GF+TG] is decidable. This answers the question posed in (Ganzinger et al., 1999). Moreover, we show that the problem is 2EXPTIME-complete. This result is optimal since the satisfiability problem for GF is 2EXPTIME-complete (Gradel, 1999). We also show that the satisfiability problem for two-variable [GF+TG] is NEXPTIME-hard in contrast to GF with bounded number of variables for which the satisfiability pr…

CombinatoricsDiscrete mathematicsTransitive relationComputational complexity theoryComputabilityBounded functionPredicate (mathematical logic)Decision problemBoolean satisfiability problemDecidabilityMathematics
researchProduct

On the Finite Satisfiability Problem for the Guarded Fragment with Transitivity

2005

We study the finite satisfiability problem for the guarded fragment with transitivity. We prove that in case of one transitive predicate the problem is decidable and its complexity is the same as the general satisfiability problem, i.e. 2Exptime-complete. We also show that finite models for sentences of GF with more transitive predicate letters used only in guards have essentially different properties than infinite ones.

CombinatoricsDiscrete mathematicsTransitive relationTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESPhraseComputational complexity theoryComputer Science::Logic in Computer SciencePredicate (mathematical logic)Decision problemBoolean satisfiability problemSentenceDecidabilityMathematics
researchProduct

Boolean Functions with a Low Polynomial Degree and Quantum Query Algorithms

2005

The complexity of quantum query algorithms computing Boolean functions is strongly related to the degree of the algebraic polynomial representing this Boolean function. There are two related difficult open problems. First, Boolean functions are sought for which the complexity of exact quantum query algorithms is essentially less than the complexity of deterministic query algorithms for the same function. Second, Boolean functions are sought for which the degree of the representing polynomial is essentially less than the complexity of deterministic query algorithms. We present in this paper new techniques to solve the second problem.

Complexity indexDiscrete mathematicsProduct termTheoretical computer scienceParity functionKarp–Lipton theoremBoolean circuitMaximum satisfiability problemBoolean expressionBoolean functionAlgorithmComputer Science::DatabasesMathematics
researchProduct

Equivalence closure in the two-variable guarded fragment

2015

We consider the satisfiability and finite satisfiability problems for the extension of the two-variable guarded fragment in which an equivalence closure operator can be applied to two distinguished binary predicates. We show that the satisfiability and finite satisfiability problems for this logic are 2-ExpTime-complete. This contrasts with an earlier result that the corresponding problems for the full two-variable logic with equivalence closures of two binary predicates are 2-NExpTime-complete.

Computational complexity theoryLogiccomputational complexityguarded fragmentsatisfiability problemBinary numberTheoretical Computer ScienceCombinatoricsArts and Humanities (miscellaneous)Computer Science::Logic in Computer ScienceClosure operatorEquivalence (formal languages)MathematicsDiscrete mathematicssatisfiability problemcomputational complexitydecidabilityequivalence closureSatisfiabilityDecidabilityTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESClosure (computer programming)Hardware and ArchitectureTheoryofComputation_LOGICSANDMEANINGSOFPROGRAMSBoolean satisfiability problemSoftwareJournal of Logic and Computation
researchProduct

L'Agenzia Frontex e l'agenda europea sulle migrazioni

2019

Questo intervento intende fornire taluni spunti, che le relazioni dei due giorni di lavori ad Agrigento hanno approfondito, sulla crescente rilevanza delle politiche europee sulle migrazioni e le misure nel tempo adottate sino a quelle più recenti, non prive di contraddizioni e che tanto spazio hanno offerto a polemiche sul ruolo delle istituzioni europee nell'affrontare un'emergenza di crescenti proporzioni a partire dagli accordi di Schengen del 1985 e dalla creazione di uno spazio unico senza frontiere interne che apre il tema del controllo sulle frontiere esterne dell'UE attribuito alla responsabilità degli Stati frontalieri, i quali, in tal guisa, sono chiamati a svolgere la funzione d…

Convegno Agrigento 9/10 giugno 2017 sfida migratoria
researchProduct

Effects of Mediterranean Diet Combined with CrossFit Training on Trained Adults’ Performance and Body Composition

2022

CrossFit is a high-intensity training discipline increasingly practiced in recent years. Specific nutritional approaches are usually recommended to maximize performance and improve body composition in high-intensity training regimens; notwithstanding, to date there are no targeted nutritional recommendations for CrossFit athletes. The Mediterranean Diet (MD) is a diet approach with a well-designed proportion of macronutrients, using only available/seasonal food of the Mediterranean area, whose health benefits are well demonstrated. No studies have evaluated this dietary strategy among CrossFit athletes and practitioners; for this reason, we tested the effects of 8 weeks of MD on CrossFit at…

CrossFitbody compositionSettore M-EDF/02 - Metodi E Didattiche Delle Attivita' SportiveMediterranean dietMedicine (miscellaneous)Mediterranean diet; CrossFit; fitness; body compositionfitnessJournal of Personalized Medicine
researchProduct

Crossfit lajianalyysi ja harjoittelu

2014

Lajin ominaispiirteet. CrossFitissä pyritään kehittämään urheilijan suorituskykyä mahdollisimman monipuolisesti välttäen erikoistumista. Urheilijan tavoitteena on kehittyä kaikissa seuraavista osa-alueista: 1) hengitys- ja verenkiertoelimistön kestävyys, 2) kestovoima, 3) maksimivoima, 4) nopeusvoima, 5) nopeus, 6) liikkuvuus, 7) koordinaatio, 8) ketteryys, 9) tasapaino ja 10) tarkkuus. Kilpailusuoritukset sisältävät monipuolisesti elementtejä eri lajeista, kuten juoksusta, uinnista soudusta, voimistelusta ja painonnostosta. Oleellinen osa CrossFit-harjoittelua ovat erilaiset WOD-harjoituskokonaisuudet (Workout of the Day), joita käytetään myös niin kutsuttuina Benchmark-harjoitteina. Bench…

CrossFitharjoittelun ohjelmointilajianalyysikilpailusäännöt
researchProduct