Search results for "sfi"
showing 10 items of 221 documents
CrossFit Suomen jälkimodernissa liikuntakulttuurissa : CrossFitin rantautuminen, organisoituminen ja laji liikuntamuotona
2016
Kauppinen, A. 2016. CrossFit Suomen jälkimodernissa liikuntakulttuurissa. CrossFitin rantautuminen, organisoituminen ja laji liikuntamuotona. Liikuntakasvatuksen laitos, Jyväskylän yliopisto. Liikunnan yhteiskuntatieteiden pro gradu -tutkielma, s.85, 2 liitettä. Suomalainen liikuntakulttuuri elää jatkuvassa muutoksen tilassa. Uusi sukupolvi muokkaa perinteisiä liikuntalajeja uudelleen vastaamaan paremmin nykyisiä tarpeitaan. Samalla virtuaalimaailman kehitys tuo kaukaisemmatkin liikuntavaikutteet lähelle. Liikunnalle asetetaan yhä kokonaisvaltaisempia merkityksiä ihmisten arjessa ja yhteiskunnassa. Uusia liikuntalajeja tutkimalla saadaan yhteiskunnallisesti arvokasta tietoa liikunnan muuttu…
Death and Transfiguration : The Late Kim Jong-il Aesthetic in North Korean Cultural Production
2016
This article assesses the official music scene in Pyongyang over a span of five dramatic years, surveying how changes in the field of music from 2009 to 2014 mirrored and in some cases presaged North Korean dynastic succession and political consolidation. The article draws upon a new abundance of performance data on North Korean musical groups, data which we argue is important but has largely been ignored or mischaracterized heretofore. The central crisis dealt with in the article is the decline and demise of Kim Jong-il, the architect of North Korea’s musical culture. In his final years, Kim Jong-il assented to the creation of a new leading musical group known as the Unhasu Orchestra, prom…
Attention Check Items and Instructions in Online Surveys: Boon or Bane for Data Quality?
2019
In this paper, we examine rates of careless responding and reactions to detection methods (i.e., attention check items and instructions) in an experimental setting based on two different samples. First, we use a quota sample (with monetary incentive), a central data source for internet-based surveys in sociological and political research. Second, we include a voluntary opt-in panel (without monetary incentive) well suited for conducting survey experiments (e.g., factorial surveys). Respondents’ reactions to the detection items are analyzed by objective, nonreactive indicators (i.e., break-off, item non-response, and measurement quality), and two self-report scales. Our reaction analyses rev…
The complexity of finite model reasoning in description logics
2005
AbstractWe analyse the complexity of finite model reasoning in the description logic ALCQI, i.e., ALC augmented with qualifying number restrictions, inverse roles, and general TBoxes. It turns out that all relevant reasoning tasks such as concept satisfiability and ABox consistency are ExpTime-complete, regardless of whether the numbers in number restrictions are coded unarily or binarily. Thus, finite model reasoning with ALCQI is not harder than standard reasoning with ALCQI.
Presenting signs and patient co-variables in Gaucher disease: outcome of the Gaucher Earlier Diagnosis Consensus (GED-C) Delphi initiative.
2019
Background: Gaucher disease (GD) presents with a range of signs and symptoms. Physicians can fail to recognise the early stages of GD owing to a lack of disease awareness, which can lead to significant diagnostic delays and sometimes irreversible but avoidable morbidities. Aim: The Gaucher Earlier Diagnosis Consensus (GED-C) initiative aimed to identify signs and co-variables considered most indicative of early type 1 and type 3 GD, to help non-specialists identify ‘at-risk’ patients who may benefit from diagnostic testing. Methods: An anonymous, three-round Delphi consensus process was deployed among a global panel of 22 specialists in GD (median experience 17.5 years, collectively managin…
John Dewey’s notion of social intelligence
2019
This chapter focuses on Deweyan understanding of intelligence as fundamentally social. This understanding differs from the common conceptions of intelligence as a feature of an isolated individual and/or as a possession of an elite. Starting with a look at the relevance of reconceptualizing intelligence, the chapter continues by describing how, according to Dewey’s theory, intelligence forms, manifests and cumulates in interactions. It then discusses the presumable implications of Dewey’s theory in terms of the contextuality of intelligent action, the importance of taking relevant experience-based information into account, the use of a particular method of inquiry, and modification of educa…
Two-Variable First-Order Logic with Equivalence Closure
2012
We consider the satisfiability and finite satisfiability problems for extensions of the two-variable fragment of first-order logic in which an equivalence closure operator can be applied to a fixed number of binary predicates. We show that the satisfiability problem for two-variable, first-order logic with equivalence closure applied to two binary predicates is in 2-NExpTime, and we obtain a matching lower bound by showing that the satisfiability problem for two-variable first-order logic in the presence of two equivalence relations is 2-NExpTime-hard. The logics in question lack the finite model property; however, we show that the same complexity bounds hold for the corresponding finite sa…
Spatial reasoning withRCC8and connectedness constraints in Euclidean spaces
2014
The language RCC 8 is a widely-studied formalism for describing topological arrangements of spatial regions. The variables of this language range over the collection of non-empty, regular closed sets of n-dimensional Euclidean space, here denoted RC + ( R n ) , and its non-logical primitives allow us to specify how the interiors, exteriors and boundaries of these sets intersect. The key question is the satisfiability problem: given a finite set of atomic RCC 8 -constraints in m variables, determine whether there exists an m-tuple of elements of RC + ( R n ) satisfying them. These problems are known to coincide for all n � 1 , so that RCC 8 -satisfiability is independent of dimension. This c…
Logics with counting and equivalence
2014
We consider the two-variable fragment of first-order logic with counting, subject to the stipulation that a single distinguished binary predicate be interpreted as an equivalence. We show that the satisfiability and finite satisfiability problems for this logic are both NEXPTIME-complete. We further show that the corresponding problems for two-variable first-order logic with counting and two equivalences are both undecidable.
Efficient CNF Encoding of Boolean Cardinality Constraints
2003
In this paper, we address the encoding into CNF clauses of Boolean cardinality constraints that arise in many practical applications. The proposed encoding is efficient with respect to unit propagation, which is implemented in almost all complete CNF satisfiability solvers. We prove the practical efficiency of this encoding on some problems arising in discrete tomography that involve many cardinality constraints. This encoding is also used together with a trivial variable elimination in order to re-encode parity learning benchmarks so that a simple Davis and Putnam procedure can solve them.