The SandS Ecosystem, a True Instance of WEB4.0

We introduce a peculiar ecosystem aimed at ruling in remote the household appliances of the members of a special social network. The keen feature of the social network is a networked intelligence, equipped with cognitive tools that enable it to provide services fully compliant with the members\u2019 needs. The scheme is the following: The appliances are internet-connected through the home Wi-Fi router. The user asks the social network for a task to be executed by his appliance (for instance, washing three kilos of woollen coloured laundry), the network, in the role of an electronic super-mom, sends directly to the washing machine an optimal sequence of commands the recipes (such as: warm the water at 34\ub0, soak for 57 minutes, etc.) to execute the task in a way that matches the user preferences, possibly green goals included. Feedbacks are sent by user and appliances themselves to the network intelligence to close the permanent recipe optimization loop, with offline advice on the part of appliance manufacturers. A properly devised user interface allows a friendly and accurate management of all interactions between the user and the social network, constituting the user-centric support of the cognitive driven services representing a genuine instance of WEB 4.0

Undefinability in Inquisitive Logic with Tensor

Logics based on team semantics, such as inquisitive logic and dependence logic, are not closed under uniform substitution. This leads to an interesting separation between expressive power and definability: it may be that an operator O can be added to a language without a gain in expressive power, yet O is not definable in that language. For instance, even though propositional inquisitive logic and propositional dependence logic have the same expressive power, inquisitive disjunction and implication are not definable in propositional dependence logic. A question that has been open for some time in this area is whether the tensor disjunction used in propositional dependence logic is definable in inquisitive logic. We settle this question in the negative. In fact, we show that extending the logical repertoire of inquisitive logic by means of tensor disjunction leads to an independent set of connectives; that is, no connective in the resulting logic is definable in terms of the others.Peer reviewe

Parametrised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic

In this paper, we initiate a systematic study of the parametrised complexity in the field of Dependence Logics which finds its origin in the Dependence Logic of V\"a\"an\"anen from 2007. We study a propositional variant of this logic (PDL) and investigate a variety of parametrisations with respect to the central decision problems. The model checking problem (MC) of PDL is NP-complete. The subject of this research is to identify a list of parametrisations (formula-size, treewidth, treedepth, team-size, number of variables) under which MC becomes fixed-parameter tractable. Furthermore, we show that the number of disjunctions or the arity of dependence atoms (dep-arity) as a parameter both yield a paraNP-completeness result. Then, we consider the satisfiability problem (SAT) showing a different picture: under team-size, or dep-arity SAT is paraNP-complete whereas under all other mentioned parameters the problem is in FPT. Finally, we introduce a variant of the satisfiability problem, asking for teams of a given size, and show for this problem an almost complete picture.Comment: Update includes refined result

Unitary 4-point correlators from classical geometries

SCOAP

Holographic 4-point correlators with heavy states

SCOAP

Correlators at large c without information loss

SCOAP

The genetic architecture of membranous nephropathy and its potential to improve non-invasive diagnosis

Membranous Nephropathy (MN) is a rare autoimmune cause of kidney failure. Here we report a genome-wide association study (GWAS) for primary MN in 3,782 cases and 9,038 controls of East Asian and European ancestries. We discover two previously unreported loci, NFKB1 (rs230540, OR = 1.25, P = 3.4 × 10-12) and IRF4 (rs9405192, OR = 1.29, P = 1.4 × 10-14), fine-map the PLA2R1 locus (rs17831251, OR = 2.25, P = 4.7 × 10-103) and report ancestry-specific effects of three classical HLA alleles: DRB1*1501 in East Asians (OR = 3.81, P = 2.0 × 10-49), DQA1*0501 in Europeans (OR = 2.88, P = 5.7 × 10-93), and DRB1*0301 in both ethnicities (OR = 3.50, P = 9.2 × 10-23 and OR = 3.39, P = 5.2 × 10-82, respectively). GWAS loci explain 32% of disease risk in East Asians and 25% in Europeans, and correctly re-classify 20-37% of the cases in validation cohorts that are antibody-negative by the serum anti-PLA2R ELISA diagnostic test. Our findings highlight an unusual genetic architecture of MN, with four loci and their interactions accounting for nearly one-third of the disease risk