Results 51 to 60 of about 1,150 (221)

Divisible Codes

open access: yesCoRR, 2021
118 pages; typos corrected, remarks added, and references updated; comments more than ...
openaire   +2 more sources

Analogies and differences between the logic behind statistical hypothesis testing and proofs by contradiction: What can we learn from them?

open access: yesTeaching Statistics, EarlyView.
Abstract Statistical hypothesis testing (SHT) is widely employed across numerous scientific disciplines, and a clear understanding of its underlying logic is essential for the broader scientific community. Here, drawing upon both epistemological and statistical perspectives, we aim to clarify—primarily for educational purposes—the logical relationship ...
Maria Cristina Amoretti   +1 more
wiley   +1 more source

Data privacy model using blockchain reinforcement federated learning approach for scalable internet of medical things

open access: yesCAAI Transactions on Intelligence Technology, EarlyView.
Abstract Internet of Medical Things (IoMT) has typical advancements in the healthcare sector with rapid potential proof for decentralised communication systems that have been applied for collecting and monitoring COVID‐19 patient data. Machine Learning algorithms typically use the risk score of each patient based on risk factors, which could help ...
Chandramohan Dhasaratha   +9 more
wiley   +1 more source

From Nouns and Adjectives to Verbs: Base Effects on the Grammatical Behaviour of Denominal Verbs in Ancient Greek1

open access: yesTransactions of the Philological Society, EarlyView.
Abstract This paper investigates the role of semantic features of noun and adjective bases in determining the grammatical behaviour of Ancient Greek denominal and deadjectival verbs in *‐ye/o‐. The paper adopts a lexicalist framework (Rappaport Hovav & Levin 1998) and examines how the event schema, actionality, telicity and voice of derived verbs are ...
Carolina Marescotti
wiley   +1 more source

Division by zero [PDF]

open access: yesArchive for Mathematical Logic, 2016
For any sufficiently strong theory of arithmetic, the set of Diophantine equations provably unsolvable in the theory is algorithmically undecidable, as a consequence of the MRDP theorem. In contrast, we show decidability of Diophantine equations provably unsolvable in Robinson's arithmetic Q.
openaire   +3 more sources

The Normative Turn: Back to Hobhouse?

open access: yesThe British Journal of Sociology, EarlyView.
ABSTRACT Supporters of a recently announced normative turn in sociology acknowledge that what they recommend is by no means entirely new. However, they have given little attention to an early precursor: the British sociologist Leonard Hobhouse. He focussed on the role of the normative in social life and insisted that sociology could, and must, play an ...
Martyn Hammersley
wiley   +1 more source

DIVISION IN ARITHMETIC [PDF]

open access: yesSchool Science and Mathematics, 1909
n ...
openaire   +1 more source

Reflections on Adoption of New Agricultural Practices

open access: yesJournal of Agricultural Economics, EarlyView.
ABSTRACT Research on adoption of new practices, technologies and systems in agriculture has generated thousands of publications over the past 70 years, covering uptake of agricultural practices spanning more than 100 years. This paper contains selected key lessons from the results of this enormous research effort, drawn from numerous reviews of the ...
David J. Pannell
wiley   +1 more source

Difference and the Liberation of Sufficient Reason

open access: yesEuropean Journal of Philosophy, EarlyView.
Abstract The Principle of Sufficient Reason (PSR) holds that every event and entity can be explained by a sufficient reason or cause. Philosophers have long struggled with the question of the PSR's compatibility with freedom, for if what occurs or exists follows necessarily from its sufficient reason then it seems it could not have been otherwise ...
Louis Matheou
wiley   +1 more source

Home - About - Disclaimer - Privacy