Results 31 to 40 of about 837,747 (262)
Natural Neighborhood-Based Classification Algorithm Without Parameter k
Big Data Mining and Analytics, 2018 Various kinds of k-Nearest Neighbor (KNN) based classification methods are the bases of many well-established and high-performance pattern recognition techniques. However, such methods are vulnerable to parameter choice.
Ji Feng, Yan Wei, Qingsheng Zhu
doaj +1 more source
Weak omega-categories from intensional type theory [PDF]
Logical Methods in Computer Science, 2010 We show that for any type in Martin-L\"of Intensional Type Theory, the terms of that type and its higher identity types form a weak omega-category in the sense of Leinster.
Peter LeFanu Lumsdaine
doaj +1 more source
Extending Nunchaku to Dependent Type Theory [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 Nunchaku is a new higher-order counterexample generator based on a sequence of transformations from polymorphic higher-order logic to first-order logic. Unlike its predecessor Nitpick for Isabelle, it is designed as a stand-alone tool, with frontends for
Simon Cruanes +1 more
doaj +1 more source
A Formal Verification Approach for Linux Kernel Designing
TechnologiesAlthough the Linux kernel is widely used, its complexity makes errors common and potentially serious. Traditional formal verification methods often have high overhead and rely heavily on manual coding.
Zi Wang +3 more
doaj +1 more source
Occurrence typing modulo theories [PDF]
Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2016 We present a new type system combining occurrence typing---a technique previously used to type check programs in dynamically-typed languages such as Racket, Clojure, and JavaScript---with dependent refinement types. We demonstrate that the addition of refinement types allows the integration of arbitrary solver-backed reasoning about logical ...
Kent, Andrew M. +2 more
openaire +2 more sources
НЕПОЛНЫЙ АЛГОРИТМ В КОНСТРУКТИВНОЙ МАТЕМАТИКЕ (ЧАСТЬ 1)
Cifra: Информационные технологии и телекоммуникацииПредставлены результаты исследования проблемы неполноты алгоритмов. Введено новаторское определение «неполный алгоритм», отличающееся от известной в науке неполноты по Тьюрингу.
Коновалов В.А.
doaj +1 more source
LanguagesThis paper explores the integration of constructive type theory in the tradition of Martin Löf into Dynamic Syntax.
Stergios Chatzikyriakidis
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Introduction Adolescent siblings of children with cancer are at elevated risk for psychosocial problems. Unfortunately, various barriers such as limited family time and resources, conflicting schedules, and psychosocial staffing constraints at cancer centers hinder sibling access to support.
Christina M. Amaro +10 more
wiley +1 more source
Type II double field theory in superspace
Journal of High Energy Physics, 2023 We explore type II supersymmetric double field theory in superspace. The double supervielbein is an element of the orthosymplectic group OSp(10, 10|64), which also governs the structure of generalized superdiffeomorphisms.
Daniel Butter
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Pediatric gastroenteropancreatic neuroendocrine neoplasms (GEP‐NENs) are extremely rare and clinically heterogeneous. Management has largely been extrapolated from adult practice. This European Standard Clinical Practice Guideline (ESCP), developed by the EXPeRT network in collaboration with adult NEN experts, provides (adult) evidence ...
Michaela Kuhlen +23 more
wiley +1 more source