Chatbot-Based Natural Language Interfaces for Data Visualisation: A Scoping Review

Rapid growth in the generation of data from various sources has made data visualisation a valuable tool for analysing data. However, visual analysis can be a challenging task, not only due to intricate dashboards but also when dealing with complex and multidimensional data. In this context, advances in Natural Language Processing technologies have led to the development of Visualisation-oriented Natural Language Interfaces (V-NLIs). In this paper, we carry out a scoping review that analyses synergies between the fields of Data Visualisation and Natural Language Interaction. Specifically, we focus on chatbot-based V-NLI approaches and explore and discuss three research questions. The first two research questions focus on studying how chatbot-based V-NLIs contribute to interactions with the Data and Visual Spaces of the visualisation pipeline, while the third seeks to know how chatbot-based V-NLIs enhance users' interaction with visualisations. Our findings show that the works in the literature put a strong focus on exploring tabular data with basic visualisations, with visual mapping primarily reliant on fixed layouts. Moreover, V-NLIs provide users with restricted guidance strategies, and few of them support high-level and follow-up queries. We identify challenges and possible research opportunities for the V-NLI community such as supporting high-level queries with complex data, integrating V-NLIs with more advanced systems such as Augmented Reality (AR) or Virtual Reality (VR), particularly for advanced visualisations, expanding guidance strategies beyond current limitations, adopting intelligent visual mapping techniques, and incorporating more sophisticated interaction methods

Boomerang Uniformity of Popular S-box Constructions

In order to study the resistance of a block cipher against boomerang attacks, a tool called the Boomerang Connectivity Table (BCT) for S-boxes was recently introduced. Very little is known today about the properties of this table especially for bijective S-boxes defined for $n$ variables with $n\equiv 0 \mod{4}$. In this work we study the boomerang uniformity of some popular constructions used for building large S-boxes, e.g. for 8 variables, from smaller ones. We show that the BCTs of all the studied constructions have abnormally high values in some positions. This remark permits us in some cases to link the boomerang properties of an S-box with other well-known cryptanalytic techniques on such constructions while in other cases it leads to the discovery of new ones. A surprising outcome concerns notably the Feistel and MISTY networks. While these two structures are very similar, their boomerang uniformity can be very different. In a second time, we investigate the boomerang uniformity under EA-equivalence for Gold and the inverse function (as used respectively in MPC-friendly ciphers and the AES) and we prove that the boomerang uniformity is EA-invariant in these cases. Finally, we present an algorithm for inverting a given BCT and provide experimental results on the size of the BCT-equivalence classes for some $4$ and $8$-bit S-boxes

Planck pre-launch status: HFI beam expectations from the optical optimisation of the focal plane

Planck is a European Space Agency (ESA) satellite, launched in May 2009, which will map the cosmic microwave background anisotropies in intensity and polarisation with unprecedented detail and sensitivity. It will also provide full-sky maps of astrophysical foregrounds. An accurate knowledge of the telescope beam patterns is an essential element for a correct analysis of the acquired astrophysical data. We present a detailed description of the optical design of the High Frequency Instrument (HFI) together with some of the optical performances measured during the calibration campaigns. We report on the evolution of the knowledge of the pre-launch HFI beam patterns when coupled to ideal telescope elements, and on their significance for the HFI data analysis procedure

Selected Topics in Cryptanalysis of Symmetric Ciphers

It is well established that a symmetric cipher may be described as a system of Boolean polynomials, and that the security of the cipher cannot be better than the difficulty of solving said system. Compressed Right-Hand Side (CRHS) Equations is but one way of describing a symmetric cipher in terms of Boolean polynomials. The first paper of this thesis provides a comprehensive treatment firstly of the relationship between Boolean functions in algebraic normal form, Binary Decision Diagrams and CRHS equations. Secondly, of how CRHS equations may be used to describe certain kinds of symmetric ciphers and how this model may be used to attempt a key-recovery attack. This technique is not left as a theoretical exercise, as the process have been implemented as an open-source project named CryptaPath. To ensure accessibility for researchers unfamiliar with algebraic cryptanalysis, CryptaPath can convert a reference implementation of the target cipher, as specified by a Rust trait, into the CRHS equations model automatically. CRHS equations are not limited to key-recovery attacks, and Paper II explores one such avenue of CRHS equations flexibility. Linear and differential cryptanalysis have long since established their position as two of the most important cryptanalytical attacks, and every new design since must show resistance to both. For some ciphers, like the AES, this resistance can be mathematically proven, but many others are left to heuristic arguments and computer aided proofs. This work is tedious, and most of the tools require good background knowledge of a tool/technique to transform a design to the right input format, with a notable exception in CryptaGraph. CryptaGraph is written in Rust and transforms a reference implementation into CryptaGraphs underlying data structure automatically. Paper II introduces a new way to use CRHS equations to model a symmetric cipher, this time in such a way that linear and differential trail searches are possible. In addition, a new set of operations allowing us to count the number of active S-boxes in a path is presented. Due to CRHS equations effective initial data compression, all possible trails are captured in the initial system description. As is the case with CRHS equations, the crux is the memory consumption. However, this approach also enables the graph of a CRHS equation to be pruned, allowing the memory consumption to be kept at manageable levels. Unfortunately, pruning nodes also means that we will lose valid, incomplete paths, meaning that the hulls found are probably incomplete. On the flip side, all paths, and their corresponding probabilities, found by the tool are guaranteed to be valid trails for the cipher. This theory is also implemented in an extension of CryptaPath, and the name is PathFinder. PathFinder is also able to automatically turn a reference implementation of a cipher into its CRHS equations-based model. As an additional bonus, PathFinder supports the reference implementation specifications specified by CryptaGraph, meaning that the same reference implementation can be used for both CryptaGraph and PathFinder. Paper III shifts focus onto symmetric ciphers designed to be used in conjunction with FHE schemes. Symmetric ciphers designed for this purpose are relatively new and have naturally had a strong focus on reducing the number of multiplications performed. A multiplication is considered expensive on the noise budget of the FHE scheme, while linear operations are viewed as cheap. These ciphers are all assuming that it is possible to find parameters in the various FHE schemes which allow these ciphers to work well in symbiosis with the FHE scheme. Unfortunately, this is not always possible, with the consequence that the decryption process becomes more costly than necessary. Paper III therefore proposes Fasta, a stream cipher which has its parameters and linear layer especially chosen to allow efficient implementation over the BGV scheme, particularly as implemented in the HElib library. The linear layers are drawn from a family of rotation-based linear transformations, as cyclic rotations are cheap to do in FHE schemes that allow packing of multiple plaintext elements in one FHE ciphertext. Fasta follows the same design philosophy as Rasta, and will never use the same linear layer twice under the same key. The result is a stream cipher tailor-made for fast evaluation in HElib. Fasta shows an improvement in throughput of a factor more than 7 when compared to the most efficient implementation of Rasta.Doktorgradsavhandlin

Teacher Narratives and Student Engagement Testing Narrative Engagement Theory in Drug Prevention Education

Testing narrative engagement theory, this study examines student engagement and teachers’ spontaneous narratives told in a narrative-based drug prevention curriculum. The study describes the extent to which teachers share their own narratives in a narrative-based curriculum, identifies dominant narrative elements, forms and functions, and assesses the relationships among teacher narratives, overall lesson narrative quality, and student engagement. One-hundred videotaped lessons of the keepin’ it REAL drug prevention curriculum were coded and the results supported the claim that increased narrative quality of a prevention lesson would be associated with increased student engagement. The quality of narrativity, however, varied widely. Implications of these results for narrative-based prevention interventions and narrative pedagogy are discussed

A Bird’s-Eye View of the Past: Digital History, Distant Reading and Sport History

Advances in computer technologies have made it easier than ever before for historians to access a wealth of sources made available in the digital era. This article investigates one way that historians have engaged with the challenges and opportunities of this ‘infinite archive’: distant reading. We define distant reading as an umbrella term that embraces many practices, including data mining, aggregation, text analysis, and the visual representations of these practices. This paper investigates the utility of distant reading as a research tool via three newspaper case studies concerning Muhammad Ali, women’s surfing in Australia, and homophobic language and Australian sport. The research reveals that the usefulness, effectiveness, and success of distant reading is dependent on numerous factors. While valuable in many instances, distant reading is rarely an end in itself and can be most powerful when paired with the traditional historical skills of close reading

A Rotating Aperture Mask for Small Telescopes

Observing the dynamic interaction between stars and their close stellar neighbors is key to establishing the stars’ orbits, masses, and other properties. Our ability to visually discriminate nearby stars is limited by the power of our telescopes, posing a challenge to astronomers at small observatories that contribute to binary star surveys. Masks placed at the telescope aperture promise to augment the resolving power of telescopes of all sizes, but many of these masks must be manually and repetitively reoriented about the optical axis to achieve their full benefits. This paper introduces a design concept for a mask rotation mechanism that can be adapted to telescopes of different types and proportions, focusing on an implementation for a Celestron C11 Schmidt–Cassegrain optical tube assembly. Mask concepts were first evaluated using diffraction simulation programs, later manufactured, and finally tested on close double stars using a C11. An electronic rotation mechanism was designed, produced, and evaluated. Results show that applying a properly shaped and oriented mask to a C11 enhances contrast in images of double star systems relative to images captured with the unmasked telescope, and they show that the rotation mechanism accurately and repeatably places masks at target orientations with minimal manual effort. Detail drawings of the mask rotation mechanism and code for the software interface are included