We study completely decomposable torsion-free abelian groups of the form GS := ⊕n∈SQpn for sets S ⊆ ω. We show that GS has a decidable copy if and only if S is Σ2 and has a computable copy if and only if S is Σ 0 3.

Although previous analyses of higher-order motivational dimensions have suggested at least seven major dynamic traits among adults, corresponding analyses among adolescents have not yet been undertaken in any satisfactory manner. To this end, the present article reports the results of a higher-order factor analysis of the subscale intercorrelations for the School Motivation Analysis Test (SMAT)...

Although a number of different models have been suggested for the process that brings workers and firms together in the labour market, none of these performs well in empirical studies of the aggregate matching function. Empirically, the most successful functional form is Cobb-Douglas, for which there are no microfoundations in the existing literature. I present a new model for the matching proc...

Accurate estimation of the axial position of a molecule using a single lateral image remains a challenge in fluorescent single particle tracking. Here, a principled algorithm for the Bayesian estimation of the axial position of a molecule in three-dimensional astigmatism-based particle tracking is proposed. This technique uses the data from a calibration image set to derive the position without...

This report presents a survey of performance models for parallel al-gorithmic skeletons. First, higher-order functions (HOFs) are presented according to the modelled skeletons. Next, the corresponding parallel implementations (skeletons) for the HOFs are discussed with the performance models that were constructed for the skeletons.

College Education and Wages in the U.K.: Estimating Conditional Average Structural Functions in Nonadditive Models with Binary Endogenous Variables We propose and implement an estimator for identifiable features of correlated random coefficient models with binary endogenous variables and nonadditive errors in the outcome equation. It is suitable, e.g., for estimation of the average returns to c...

The goal of this chapter is to develop a taxonomy of decentralisation measures and how they are related to each other. In addition to introducing a common language for the different strands of literature, this taxonomy is instrumental for studying the outcomes of decentralisation. Using cross-state data from the United States, we show that aggregating distinct dimensions of fiscal decentralisat...

Factorization machines (FMs) are a supervised learning approach that can use second-order feature combinations even when the data is very high-dimensional. Unfortunately, despite increasing interest in FMs, there exists to date no efficient training algorithm for higher-order FMs (HOFMs). In this paper, we present the first generic yet efficient algorithms for training arbitrary-order HOFMs. We...

The majority of real-world networks are dynamic and extremely large (e.g., Internet Traffic, Twitter, Facebook, ...). To understand the structural behavior of nodes in these large dynamic networks, it may be necessary to model the dynamics of behavioral roles representing the main connectivity patterns over time. In this paper, we propose a dynamic behavioral mixed-membership model (DBMM) that ...

In axiomatic way, in fuzzy setting, we introduce the measure of crispness and the measure of conditional clearness. For these measures we propose a functional form. Then, for the last measure, we give some aggregation operators. Keywords— Aggregation operators, functional equations, fuzzy sets, measures of fuzziness, crispness measures, conditional crispness.