Browse ORBi

- What it is and what it isn't
- Green Road / Gold Road?
- Ready to Publish. Now What?
- How can I support the OA movement?
- Where can I learn more?

ORBi

On Degree-d Zero-Sum Sets of Full Rank Beierle, Christof ; Biryukov, Alex ; Udovenko, Aleksei E-print/Working paper (2018) A set S⊆Fn2 is called degree-d zero-sum if the sum ∑s∈Sf(s) vanishes for all n-bit Boolean functions of algebraic degree at most d. Those sets correspond to the supports of the n-bit Boolean functions of ... [more ▼] A set S⊆Fn2 is called degree-d zero-sum if the sum ∑s∈Sf(s) vanishes for all n-bit Boolean functions of algebraic degree at most d. Those sets correspond to the supports of the n-bit Boolean functions of degree at most n−d−1. We prove some results on the existence of degree-d zero-sum sets of full rank, i.e., those that contain n linearly independent elements, and show relations to degree-1 annihilator spaces of Boolean functions and semi-orthogonal matrices. We are particularly interested in the smallest of such sets and prove bounds on the minimum number of elements in a degree-d zero-sum set of rank n. The motivation for studying those objects comes from the fact that degree-d zero-sum sets of full rank can be used to build linear mappings that preserve special kinds of nonlinear invariants, similar to those obtained from orthogonal matrices and exploited by Todo, Leander and Sasaki for breaking the block ciphers Midori, Scream and iScream. [less ▲] Detailed reference viewed: 28 (1 UL)On degree-d zero-sum sets of full rank Beierle, Christof ; Biryukov, Alex ; Udovenko, Aleksei in Cryptography and Communications (2019) A set 𝑆⊆𝔽𝑛2 is called degree-d zero-sum if the sum ∑𝑠∈𝑆𝑓(𝑠) vanishes for all n-bit Boolean functions of algebraic degree at most d. Those sets correspond to the supports of the n-bit Boolean ... [more ▼] A set 𝑆⊆𝔽𝑛2 is called degree-d zero-sum if the sum ∑𝑠∈𝑆𝑓(𝑠) vanishes for all n-bit Boolean functions of algebraic degree at most d. Those sets correspond to the supports of the n-bit Boolean functions of degree at most n − d − 1. We prove some results on the existence of degree-d zero-sum sets of full rank, i.e., those that contain n linearly independent elements, and show relations to degree-1 annihilator spaces of Boolean functions and semi-orthogonal matrices. We are particularly interested in the smallest of such sets and prove bounds on the minimum number of elements in a degree-d zero-sum set of rank n. The motivation for studying those objects comes from the fact that degree-d zero-sum sets of full rank can be used to build linear mappings that preserve special kinds of nonlinear invariants, similar to those obtained from orthogonal matrices and exploited by Todo, Leander and Sasaki for breaking the block ciphers Midori, Scream and iScream. [less ▲] Detailed reference viewed: 37 (0 UL)On Designing an L-valued Prolog Engine Bisdorff, Raymond Scientific Conference (1998, November 20) This text presents our communication at the 9th Benelux Workshop on Logic Programming in Amsterdam. We discussed some theoretical and practical arguments for designing a multi-truth valued extension of ... [more ▼] This text presents our communication at the 9th Benelux Workshop on Logic Programming in Amsterdam. We discussed some theoretical and practical arguments for designing a multi-truth valued extension of Prolog. [less ▲] Detailed reference viewed: 11 (0 UL)On detecting and enumerating chordless circuits in a digraph Bisdorff, Raymond E-print/Working paper (2010) Detailed reference viewed: 20 (3 UL)On different approaches to compute the Chern classes of a tensor product of two vector bundles Iena, Oleksandr E-print/Working paper (2016) We compare four different approaches to compute the Chern classes of a tensor product of two vector bundles in terms of the Chern classes of the factors. Detailed reference viewed: 60 (4 UL)On different aspects of network analysis in systems biology ; Jurkowski, Wiktor ; et al in Systems Biology (2013), 1 Network analysis is an essential component of systems biology approaches toward understanding the molecular and cellular interactions underlying biological systems functionalities and their perturbations ... [more ▼] Network analysis is an essential component of systems biology approaches toward understanding the molecular and cellular interactions underlying biological systems functionalities and their perturbations in disease. Regulatory and signalling pathways involve DNA, RNA, proteins and metabolites as key elements to coordinate most aspects of cellular functioning. Cellular processes depend on the structure and dynamics of gene regulatory networks and can be studied by employing a network representation of molecular interactions. This chapter describes several types of biological networks, how combination of different analytic approaches can be used to study diseases, and provides a list of selected tools for network visualization and analysis. It also introduces protein-protein interaction networks, gene regulatory networks, signalling networks and metabolic networks to illustrate concepts underlying network representation of cellular processes and molecular interactions. It finally discusses how the level of accuracy in inferring functional relationships influences the choice of methods applied for the analysis of a particular biological network type. © Springer Science+Business Media Dordrecht 2013. All rights are reserved. [less ▲] Detailed reference viewed: 137 (2 UL)On Different Learning Approaches with Echo State Networks for Localization of Small Mobile Robots Antonelo, Eric Aislan ; in Proceedings of the IX Brazilian Conference on Neural Networks (2009) Animals such as rats have innate and robust localization capabilities which allow them to navigate to goals in a maze. The rodent’s hippocampus, with the so called place cells, is responsible for such ... [more ▼] Animals such as rats have innate and robust localization capabilities which allow them to navigate to goals in a maze. The rodent’s hippocampus, with the so called place cells, is responsible for such spatial processing. This work seeks to model these place cells using either supervised or unsupervised learning techniques. More specifically, we use a randomly generated recurrent neural network (the reservoir) as a non-linear temporal kernel to expand the input to a rich dynamic space. The reservoir states are linearly combined (using linear regression) or, in the unsupervised case, are used for extracting slowly-varying features from the input to form place cells (the architectures are organized in hierarchical layers). Experiments show that a small mobile robot with cheap and low-range distance sensors can learn to self-localize in its environment with the proposed systems. [less ▲] Detailed reference viewed: 45 (0 UL)On Digital History Zaagsma, Gerben in BMGN - Low Countries Historical Review (2013), 128(4), 3-29 Digital humanities seem to be omnipresent these days and the discipline of history 3 is no exception. This introduction is concerned with the changing practice of ‘doing’ history in the digital age, seen ... [more ▼] Digital humanities seem to be omnipresent these days and the discipline of history 3 is no exception. This introduction is concerned with the changing practice of ‘doing’ history in the digital age, seen within a broader historical context of developments in the digital humanities and ‘digital history’. It argues that there is too much emphasis on tools and data while too little attention is being paid to how doing history in the digital age is changing as a result of the digital turn. This tendency towards technological determinism needs to be balanced by more attention to methodological and epistemological considerations. The article offers a short survey of history and computing since the 1960s with particular attention given to the situation in the Netherlands, considers various definitions of ‘digital history’ and argues for an integrative view of historical practice in the digital age that underscores hybridity as its main characteristic. It then discusses some of the major changes in historical practice before outlining the three major themes that are explored by the various articles in this thematic issue – digitisation and the archive, digital historical analysis, and historical knowledge (re)presentation and audiences. [less ▲] Detailed reference viewed: 70 (12 UL)On Display: Visual Politics, Material Culture, and Education Priem, Karin ; Book published by Waxmann (2016) Detailed reference viewed: 144 (13 UL)On dual-polarization signalling techniques in satellite communications Arend, Lionel Jean Doctoral thesis (2015) In satellite broadcasting and broadband communications, two orthogonal polarizations can be employed for signalling. Typically, two independent carrier signals are transmitted on the horizontal and ... [more ▼] In satellite broadcasting and broadband communications, two orthogonal polarizations can be employed for signalling. Typically, two independent carrier signals are transmitted on the horizontal and vertical linear polarizations. In this way the available frequency spectrum is used twice. Contrary to this independent use, the present work investigates the combined use of both polarizations for signalling and the possibly associated benefits. Two different modulation techniques are investigated. The first, polarization shift keying, modulates the state of polarization of the electromagnetic wave to convey information. It is based on the phase and amplitude relationship between both carriers and is advantageous for channels strongly impaired by phase noise. The second technique defines a four-dimensional signal space for the combined modulation of amplitude and phase on both carriers. It was initially introduced as 4-quadrature signalling and permits transmission with improved power efficiency. Both techniques come from optical fibre communications, where similar propagation conditions exist. The conducted investigation is based on an analysis, simulations and the experimental verification using a specially developed demonstration transmitter and receiver. The simulations compare the power efficiency of the proposed modulation techniques with that of alternatives currently in use and analyse their behaviour upon disturbance by phase noise or non-linear distortion. The demonstrator is used to validate the findings in experimental measurements and to confirm the feasibility of both proposed techniques through a live satellite transmission. [less ▲] Detailed reference viewed: 220 (23 UL)On dynamic multi-objective optimization - classification and performance measures Tantar, Emilia ; Tantar, Alexandru-Adrian ; Bouvry, Pascal in On dynamic multi-objective optimization - classification and performance measures (2011) In this work we focus on defining how dynamism can be modeled in the context of multi-objective optimization. Based on this, we construct a component oriented classification for dynamic multi-objective ... [more ▼] In this work we focus on defining how dynamism can be modeled in the context of multi-objective optimization. Based on this, we construct a component oriented classification for dynamic multi-objective optimization problems. For each category we provide synthetic examples that depict in a more explicit way the defined model. We do this either by positioning existing synthetic benchmarks with respect to the proposed classification or through new problem formulations. In addition, an online dynamic MNK-landscape formulation is introduced together with a new comparative metric for the online dynamic multi-objective context. [less ▲] Detailed reference viewed: 119 (0 UL)On efficient and reliable stochastic generation of RVEs for analysis of composites within the framework of homogenization Salnikov, Vladimir ; ; in Computational Mechanics (2014) Detailed reference viewed: 48 (0 UL)On enumerating the kernels in a bipolar-valued digraph Bisdorff, Raymond in Annales du Lamsade (2006), 6 In this paper we would like to thoroughly cover the problem of computing all kernels, i.e. minimal outranking and/or outranked independent choices in a bipolar- valued outranking digraph. First we ... [more ▼] In this paper we would like to thoroughly cover the problem of computing all kernels, i.e. minimal outranking and/or outranked independent choices in a bipolar- valued outranking digraph. First we introduce in detail the concept of bipolar-valued characterisation of outranking digraphs, choices and kernels. In a second section we present and discuss several algorithms for enumerating the kernels in a crisp digraph. A third section will be concerned with extending these algorithms to bipolar-valued outranking digraphs. [less ▲] Detailed reference viewed: 14 (2 UL)On equational definability of function classes Couceiro, Miguel ; Lehtonen, Erkko ; Waldhauser, Tamás in 41st IEEE International Symposium on Multiple-Valued Logic (ISMVL 2011) (2011) We propose a notion of functional equation for functions of fixed arity, which is based on a pair of clones. We present necessary conditions for a class of functions to be definable by such equations, and ... [more ▼] We propose a notion of functional equation for functions of fixed arity, which is based on a pair of clones. We present necessary conditions for a class of functions to be definable by such equations, and show that for certain choices of clones these conditions are also sufficient. [less ▲] Detailed reference viewed: 59 (0 UL)On equidistribution of signs and the Sato-Tate conjecture Wiese, Gabor Presentation (2014, January 27) The talk concerns our joint work with Sara Arias-de-Reyna and Ilker Inam about the equidistribution of signs of coefficients of half-integral weight modular forms. The basic idea is to apply the Shimura ... [more ▼] The talk concerns our joint work with Sara Arias-de-Reyna and Ilker Inam about the equidistribution of signs of coefficients of half-integral weight modular forms. The basic idea is to apply the Shimura lift to get into integral weight modular forms, where one can make use of the Sato-Tate theorem. The importance of error terms for the Sato-Tate theorem is stressed in this context. [less ▲] Detailed reference viewed: 53 (0 UL)On equivariant quantization and related problems I Poncin, Norbert Presentation (2004) Detailed reference viewed: 26 (1 UL)On equivariant quantization and related problems II Poncin, Norbert Presentation (2004) Detailed reference viewed: 28 (1 UL)On Evaluation of Location Privacy Preserving Schemes for VANET Safety Applications Emara, Karim Ahmed Awad El-Sayed ; ; in Computer Communications (2015), 63(1), 11--23 Location privacy in vehicular ad hoc networks has gained considerable attention in the past few years. The majority of studies concern changing pseudonyms to prevent linking messages of the same pseudonym ... [more ▼] Location privacy in vehicular ad hoc networks has gained considerable attention in the past few years. The majority of studies concern changing pseudonyms to prevent linking messages of the same pseudonym. However, the precise spatiotemporal information included in beacons (i.e., timestamp, position, speed and heading) makes them vulnerable to tracking even if they are completely anonymous. One of the most important issues in designing location privacy scheme is to preserve the quality of service of the application. This issue is more significant for safety applications, since they require precise and frequent state updates. Thus, it is crucial to consider this trade-off between location privacy and quality of service of the safety application when designing and evaluating privacy schemes. In this paper, we propose a methodology to measure both the protection level of a privacy scheme and its impact on safety applications. We employ an empirical vehicle tracker to measure the effectiveness of a privacy scheme in terms of a number of confusions. We also measure its impact on a safety application by estimating the probability of correctly identifying the fundamental factors of that application using Monte Carlo analysis. Further, we propose an obfuscation privacy scheme which perturbs position and beacon frequency. Finally, we apply our methodology to evaluate the proposed scheme and compare it with the popular privacy scheme, random silent period. [less ▲] Detailed reference viewed: 93 (0 UL)On evaluations of propositional formulas in countable structures ; Doder, Dragan ; et al in Filomat (2016), 30(1), 1--13 Detailed reference viewed: 19 (1 UL)On Fairness Optimization for NOMA-Enabled Multi-Beam Satellite Systems Wang, Anyue ; Lei, Lei ; Lagunas, Eva et al in IEEE International Symposium on Personal, Indoor and Mobile Radio Communications 2019 (2019, September) Detailed reference viewed: 48 (8 UL) |
||