Filters








10,334 Hits in 3.6 sec

Op zoek naar een vader in het 16de eeuwse Vlaanderen. De zaak Betkin Heene tegen Jan Van den Brande (1532-1533)

J. Monballyu
1994 Handelingen van het Genootschap voor Geschiedenis  
o o r d e t ijd e n h een is h et o n d e r z o e k n aar h et v a d e r sc h a p één van d e m o e ilijk st e p r o c e sse n .  ...  V o o r h et v a st st e lle n van h et v a d e r sc h a p m o e t h et r e ch t zich sin d s e e u w e n m et a a n w ijz in ge n o f v e r m o e d e n s b e h e lp e n .  ...  U it e in d e lijk b e slist d e o ffic ia a l d at o o k Ja n van den Br an d e p er so on lijk ach t er ge slo t e n deu r en d oor een c o m m issar is m o e t w o r d e n o n d e r v r a a gd .  ... 
doi:10.21825/hvgg.v131i1-3.4595 fatcat:iqbflopierbgticwpxy2eejrtq

E-zines silence the brand detractors

Barbara Briers, Siegfried Dewitte, Jan Van den Bergh
2006 Social Science Research Network  
Using Reichheld's (2001) recommendation index, respondents were categorized as brand detractors, passively satisfied customers, or brand promoters.  ...  Passively satisfied customers receiving enewsletters might be more likely to turn into brand promoters (2), or less likely to turn into brand detractors (3).  ...  This means that the e-zines could equally well reach brand detractors, passively satisfied customers, and brand promoters.  ... 
doi:10.2139/ssrn.870258 fatcat:xhtz63dj65acdg7oocgh6s7h6e

ASReview Software Documentation

Jonathan De Bruin, Gerbrich Ferdinands, Albert Harkema, Jan De Boer, Sofie Van den Brand, Yongchao Ma, Rens Van de Schoot
2021 Zenodo  
Rens van de Schoot. Contribute If you discover issues please let us know via Github. If you have ideas to solve your own or other issues, it is highly appreciate to contribute to the development.  ...  Featured Datasets Some featured datasets are: • The PTSD Trajectories data by Van de Schoot et al. (2017 stems from a review of longitudinal studies that applied unsupervised machine learning techniques  ... 
doi:10.5281/zenodo.5094372 fatcat:2lqduie3bjgkxe2b7bphpgt7ma

ASReview Software Documentation

Jonathan De Bruin, Gerbrich Ferdinands, Albert Harkema, Jan De Boer, Sofie Van den Brand, Yongchao Ma, Rens Van de Schoot
2021 Zenodo  
Moreover, many others contribute to the project, like researchers Gerbrich Ferdinands and Laura Hofstee, as well as many students like Yongchao Terry Ma, Sofie van den Brand, Sybren Hindriks, and Albert  ...  Rens van de Schoot. 5.4 Contribute If you discover issues please let us know via Github.  ... 
doi:10.5281/zenodo.5565351 fatcat:awj57sibpndzzfjnkjbjr2f66y

ASReview Software Documentation

Jonathan De Bruin, Gerbrich Ferdinands, Albert Harkema, Jan De Boer, Sofie Van den Brand, Yongchao Ma, Rens Van de Schoot
2021 Zenodo  
Rens van de Schoot. Contribute If you discover issues please let us know via Github. If you have ideas to solve your own or other issues, it is highly appreciate to contribute to the development.  ...  Featured Datasets Some featured datasets are: • The PTSD Trajectories data by Van de Schoot et al. (2017 stems from a review of longitudinal studies that applied unsupervised machine learning techniques  ... 
doi:10.5281/zenodo.4446785 fatcat:kux5f6yzh5cirevp6ovqhwcsrm

E-zines Silence the Brand Detractors

Barbara Briers, Siegfried Dewitte, Jan Van den Bergh
2006 Journal of Advertising Research  
Using Reichheld's (2001) recommendation index, respondents were categorized as brand detractors, passively satisfied customers, or brand promoters.  ...  Passively satisfied customers receiving enewsletters might be more likely to turn into brand promoters (2), or less likely to turn into brand detractors (3).  ...  This means that the e-zines could equally well reach brand detractors, passively satisfied customers, and brand promoters.  ... 
doi:10.2501/s0021849906060211 fatcat:z6x7ln7nlbcfbfbsxthuzwwbem

ASReview Software Documentation 0.14

Jonathan De Bruin, Gerbrich Ferdinands, Albert Harkema, Jan De Boer, Sofie Van den Brand, Yongchao Ma, Rens Van de Schoot
2020 Zenodo  
Van de Schoot (PTSD) A dataset on 5782 papers on posttraumatic stress disorder. Of these papers, 38 were included in the systematic review.  ...  Schram and Parisa Zahedi ˓→and Jan de Boer and Felix Weijdema and Bianca Kramer and Martijn Huijts and Maarten ˓→Hoogerwerf and Gerbrich Ferdinands and Albert Harkema and Joukje Willemsen and ˓→Yongchao  ... 
doi:10.5281/zenodo.4287120 fatcat:end4ulfq4nbblne3m3zyln47qy

Unifying Matrix Data Structures: Simplifying and Speeding up Iterative Algorithms [article]

Jan van den Brand
2020 arXiv   pre-print
Many algorithms use data structures that maintain properties of matrices undergoing some changes. The applications are wide-ranging and include for example matchings, shortest paths, linear programming, semi-definite programming, convex hull and volume computation. Given the wide range of applications, the exact property these data structures must maintain varies from one application to another, forcing algorithm designers to invent them from scratch or modify existing ones. Thus it is not
more » ... ising that these data structures and their proofs are usually tailor-made for their specific application and that maintaining more complicated properties results in more complicated proofs. In this paper we present a unifying framework that captures a wide range of these data structures. The simplicity of this framework allows us to give short proofs for many existing data structures regardless of how complicated the to be maintained property is. We also show how the framework can be used to speed up existing iterative algorithms, such as the simplex algorithm. More formally, consider any rational function f(A_1,...,A_d) with input matrices A_1,...,A_d. We show that the task of maintaining f(A_1,...,A_d) under updates to A_1,...,A_d can be reduced to the much simpler problem of maintaining some matrix inverse M^-1 under updates to M. The latter is a well studied problem called dynamic matrix inverse. By applying our reduction and using known algorithms for dynamic matrix inverse we can obtain fast data structures and iterative algorithms for much more general problems.
arXiv:2010.13888v1 fatcat:v7fp56yah5cjbprrkwkfnow6jm

The Mutual information of LDGM codes [article]

Jan van den Brand, Nor Jaafari
2017 arXiv   pre-print
We provide matching upper and lower bounds on the mutual information in noisy reconstruction of parity check codes and thereby prove a long-standing conjecture by Montanari [IEEE Transactions on Information Theory 2005]. Besides extending a prior concentration result of Abbe and Montanari [Theory of Computing 2015] to the case of odd check degrees, we precisely determine the conjectured formula for code ensembles of arbitrary degree distribution, thus capturing a broad class of capacity approaching codes.
arXiv:1707.04413v2 fatcat:4utmot2r3rhsphjmucu4m7ujxy

Fast Deterministic Fully Dynamic Distance Approximation [article]

Jan van den Brand, Sebastian Forster, Yasamin Nazari
2022 arXiv   pre-print
Acknowledgement Jan van den Brand is funded by ONR BRC grant N00014-18-1-2562 and by the Simons Institute for the Theory of Computing through a Simons-Berkeley Postdoctoral Fellowship.  ... 
arXiv:2111.03361v2 fatcat:qzxfmf2znzcjhlsfckrxispe5i

Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds [article]

Jan van den Brand, Danupon Nanongkai, Thatchaphol Saranurak
2019 arXiv   pre-print
The dynamic matrix inverse problem is to maintain the inverse of a matrix undergoing element and column updates. It is the main subroutine behind the best algorithms for many dynamic problems whose complexity is not yet well-understood, such as maintaining the largest eigenvalue, rank and determinant of a matrix and maintaining reachability, distances, maximum matching size, and k-paths/cycles in a graph. Understanding the complexity of dynamic matrix inverse is a key to understand these
more » ... s. In this paper, we present (i) improved algorithms for dynamic matrix inverse and their extensions to some incremental/look-ahead variants, and (ii) variants of the Online Matrix-Vector conjecture [Henzinger et al. STOC'15] that, if true, imply that these algorithms are tight. Our algorithms automatically lead to faster dynamic algorithms for the aforementioned problems, some of which are also tight under our conjectures, e.g. reachability and maximum matching size (closing the gaps for these two problems was in fact asked by Abboud and V. Williams [FOCS'14]). Prior best bounds for most of these problems date back to more than a decade ago [Sankowski FOCS'04, COCOON'05, SODA'07; Kavitha FSTTCS'08; Mucha and Sankowski Algorithmica'10; Bosek et al. FOCS'14]. Our improvements stem mostly from the ability to use fast matrix multiplication "one more time", to maintain a certain transformation matrix which could be maintained only combinatorially previously (i.e. without fast matrix multiplication). Oddly, unlike other dynamic problems where this approach, once successful, could be repeated several times ("bootstrapping"), our conjectures imply that this is not the case for dynamic matrix inverse and some related problems. However, when a small additional "look-ahead" information is provided we can perform such repetition to drive the bounds down further.
arXiv:1905.05067v1 fatcat:2jtnqgchnndirmi7wcpcl2cpcm

Software engineering: Redundancy is key

Mark van den Brand, Jan Friso Groote
2015 Science of Computer Programming  
Software engineers are humans and so they make lots of mistakes. Typically 1 out of 10 to 100 tasks go wrong. The only way to avoid these mistakes is to introduce redundancy in the software engineering process. This article is a plea to consciously introduce several levels of redundancy for each programming task. Depending on the required level of correctness, expressed in a residual error probability (typically 10 3 to 10 10 ), each programming task must be carried out redundantly 4 to 8
more » ... This number is hardly influenced by the size of a programming endeavour. Training software engineers does have some e↵ect as non trained software engineers require a double amount of redundant tasks to deliver software of a desired quality. More compact programming, for instance by using domain specific languages, only reduces the number of redundant tasks by a small constant.
doi:10.1016/j.scico.2013.11.020 fatcat:rc5qrgfdz5gd3jn6xwqjymwmhy

Liefde als zijnsgebeuren. Over de intieme briefwisseling tussen Hannah Arendt en Martin Heidegger

Jan Van Den Brande
2006 De Uil van Minerva  
Over de intieme briefwisseling tussen Hannah Arendt en Martin Heidegger Jan Van den Brande Hannah Arendt-Martin Heidegger, Brieven en andere getuigenissen 1925 tot 1975, Amsterdam/Antwerpen, Atlas, 2004  ...  De intimiteit van dergelijke briefwisseling grenst aan die van het bijhouden van een intiem dagboek.  ...  Inkeer van de blik(sem) van de waarheid van het zijn, noemen wij In-blik. ( ... ) In-blikseming is Gebeuren in het Zijn zelf.  ... 
doi:10.21825/uvm.v21i1.1944 fatcat:xdjra7tanffjviyvnvu5cnfw2i

Rainwater Harvesting for Drinking Water Production: A Sustainable and Cost-Effective Solution in The Netherlands?

Roberta Hofman-Caris, Cheryl Bertelkamp, Luuk de Waal, Tessa van den Brand, Jan Hofman, René van der Aa, Jan van der Hoek
2019 Water  
; grid (4) Roof surface area 140 m 2 ; grid (4) Roof surface area 140 m 2 ; grid (4) 2 Open pond, 14 × 10 3 m 3 concrete (1) Open pond, 14 × 10 3 m 3 concrete (1) Closed HDPE (5) (6) (van  ... 
doi:10.3390/w11030511 fatcat:apsekie2gne6ddkmmcvqxue54e

Th2-high asthma: a heterogeneous asthma population?

Seys Sven, Hans Scheers, Gudrun Marijsse, Ellen Dilissen, Annelies Van Den Bergh, Pieter Goeminne, Paul Van den Brande, Jan Ceuppens, Lieven Dupont, Dominique Bullens
2015 Clinical and Translational Allergy  
doi:10.1186/2045-7022-5-s2-o1 pmcid:PMC4407146 fatcat:zhj23iwyxbefrhfxv2locizxny
« Previous Showing results 1 — 15 out of 10,334 results