CONSTRUCTION OF SUBSETS OF BENT FUNCTIONS SATISFYING RESTRICTIONS IN THE REED-MULLER DOMAIN

Bent functionsare Booleanfunctionswith highestnonlinearitywhich makes them interesting for cryptography. Determination of bent functions is an importantbut hard problem, since the general structure of bent functions is still unknown. Various constructions methods for bent functions are based on certain deterministic procedures, which might result in some regularitythat is a feature undesired for applications in cryptography. Random generation of bent functions is an alternative, however, the search space is very large and the related procedures are time consuming. A solution is to restrict the search space by imposing some conditions that should be satisfied by the produced bent functions. In this paper, we propose three ways of imposing such restrictions to construct subsets of Boolean functions within which the bent functions are searched. We estimate experimentally the number of bent functions in the corresponding subsets of Boolean functions

Behavior finding: Morphogenetic Designs Shaped by Function

Evolution has shaped an incredible diversity of multicellular living organisms, whose complex forms are self-made through a robust developmental process. This fundamental combination of biological evolution and development has served as an inspiration for novel engineering design methodologies, with the goal to overcome the scalability problems suffered by classical top-down approaches. Top-down methodologies are based on the manual decomposition of the design into modular, independent subunits. In contrast, recent computational morphogenetic techniques have shown that they were able to automatically generate truly complex innovative designs. Algorithms based on evolutionary computation and artificial development have been proposed to automatically design both the structures, within certain constraints, and the controllers that optimize their function. However, the driving force of biological evolution does not resemble an enumeration of design requirements, but much rather relies on the interaction of organisms within the environment. Similarly, controllers do not evolve nor develop separately, but are woven into the organism’s morphology. In this chapter, we discuss evolutionary morphogenetic algorithms inspired by these important aspects of biological evolution. The proposed methodologies could contribute to the automation of processes that design “organic” structures, whose morphologies and controllers are intended to solve a functional problem. The performance of the algorithms is tested on a class of optimization problems that we call behavior-finding. These challenges are not explicitly based on morphology or controller constraints, but only on the solving abilities and efficacy of the design. Our results show that morphogenetic algorithms are well suited to behavior-finding

On the design of multi-platform parallel mechanisms

Parallel mechanisms have been examined in more and more detail over the past two decades. Parallel mechanisms are essentially the same design layout, a base, multiple legs/limbs, and a moving platform with a single end-effector to allow the mechanism to complete its desired function. Recently, several research groups have begun looking into multiple-platform parallel mechanisms and/or multiple end-effectors for parallel mechanisms. The reason for the research in this new form of parallel mechanism stems from multiple sources, such as applications that would require multiple handling points being accessed simultaneously, a more controlled gripper motion by having the jaws of the gripper being attached at different platforms, or to increasing the workload of the mechanism. The aim of the thesis is to modify the design process of parallel mechanisms so that it will support the development of a new parallel mechanism with multiple platforms capable of moving relative to each other in at least 1-DOF and to analyse the improvements made on the traditional single platform mechanism through a comparison of the power requirements for each mechanism. Throughout the thesis, a modified approach to the type synthesis of a parallel mechanism with multiple moving platforms is proposed and used to create several case study mechanisms. Additionally, this thesis presents a new series of methods for determining the workspace, inverse kinematic and dynamic models, and the integration of these systems into the design of a control system. All methods are vetted through case studies where they are judged based on the results gained from existing published data. Lastly, the concepts in this thesis are combined to produce a physical multi-platform parallel mechanism case study with the process being developed at each stage. Finally, a series of proposed topics of future research are listed along with the limitations and contributions of this work

Reversible Computation: Extending Horizons of Computing

This open access State-of-the-Art Survey presents the main recent scientific outcomes in the area of reversible computation, focusing on those that have emerged during COST Action IC1405 "Reversible Computation - Extending Horizons of Computing", a European research network that operated from May 2015 to April 2019. Reversible computation is a new paradigm that extends the traditional forwards-only mode of computation with the ability to execute in reverse, so that computation can run backwards as easily and naturally as forwards. It aims to deliver novel computing devices and software, and to enhance existing systems by equipping them with reversibility. There are many potential applications of reversible computation, including languages and software tools for reliable and recovery-oriented distributed systems and revolutionary reversible logic gates and circuits, but they can only be realized and have lasting effect if conceptual and firm theoretical foundations are established first

Reversible Computation: Extending Horizons of Computing

This open access State-of-the-Art Survey presents the main recent scientific outcomes in the area of reversible computation, focusing on those that have emerged during COST Action IC1405 "Reversible Computation - Extending Horizons of Computing", a European research network that operated from May 2015 to April 2019. Reversible computation is a new paradigm that extends the traditional forwards-only mode of computation with the ability to execute in reverse, so that computation can run backwards as easily and naturally as forwards. It aims to deliver novel computing devices and software, and to enhance existing systems by equipping them with reversibility. There are many potential applications of reversible computation, including languages and software tools for reliable and recovery-oriented distributed systems and revolutionary reversible logic gates and circuits, but they can only be realized and have lasting effect if conceptual and firm theoretical foundations are established first

Algorithms for Geometric Optimization and Enrichment in Industrialized Building Construction

The burgeoning use of industrialized building construction, coupled with advances in digital technologies, is unlocking new opportunities to improve the status quo of construction projects being over-budget, delayed and having undesirable quality. Yet there are still several objective barriers that need to be overcome in order to fully realize the full potential of these innovations. Analysis of literature and examples from industry reveal the following notable barriers: (1) geometric optimization methods need to be developed for the stricter dimensional requirements in industrialized construction, (2) methods are needed to preserve model semantics during the process of generating an updated as-built model, (3) semantic enrichment methods are required for the end-of-life stage of industrialized buildings, and (4) there is a need to develop pragmatic approaches for algorithms to ensure they achieve required computational efficiency. The common thread across these examples is the need for developing algorithms to optimize and enrich geometric models. To date, a comprehensive approach paired with pragmatic solutions remains elusive. This research fills this gap by presenting a new approach for algorithm development along with pragmatic implementations for the industrialized building construction sector. Computational algorithms are effective for driving the design, analysis, and optimization of geometric models. As such, this thesis develops new computational algorithms for design, fabrication and assembly, onsite construction, and end-of-life stages of industrialized buildings. A common theme throughout this work is the development and comparison of varied algorithmic approaches (i.e., exact vs. approximate solutions) to see which is optimal for a given process. This is implemented in the following ways. First, a probabilistic method is used to simulate the accumulation of dimensional tolerances in order to optimize geometric models during design. Second, a series of exact and approximate algorithms are used to optimize the topology of 2D panelized assemblies to minimize material use during fabrication and assembly. Third, a new approach to automatically update geometric models is developed whereby initial model semantics are preserved during the process of generating an as-built model. Finally, a series of algorithms are developed to semantically enrich geometric models to enable industrialized buildings to be disassembled and reused. The developments made in this research form a rational and pragmatic approach to addressing the existing challenges faced in industrialized building construction. Such developments are shown not only to be effective in improving the status quo in the industry (i.e., improving cost, reducing project duration, and improving quality), but also for facilitating continuous innovation in construction. By way of assessing the potential impact of this work, the proposed algorithms can reduce rework risk during fabrication and assembly (65% rework reduction in the case study for the new tolerance simulation algorithm), reduce waste during manufacturing (11% waste reduction in the case study for the new panel unfolding and nesting algorithms), improve accuracy and automation of as-built model generation (model error reduction from 50.4 mm to 5.7 mm in the case study for the new parametric BIM updating algorithms), reduce lifecycle cost for adapting industrialized buildings (15% reduction in capital costs in the computational building configurator) and reducing lifecycle impacts for reusing structural systems from industrialized buildings (between 54% to 95% reduction in average lifecycle impacts for the approach illustrated in Appendix B). From a computational standpoint, the novelty of the algorithms developed in this research can be described as follows. Complex geometric processes can be codified solely on the innate properties of geometry – that is, by parameterizing geometry and using methods such as combinatorial optimization, topology can be optimized and semantics can be automatically enriched for building assemblies. Employing the use of functional discretization (whereby continuous variable domains are converted into discrete variable domains) is shown to be highly effective for complex geometric optimization approaches. Finally, the algorithms encapsulate and balance the benefits posed by both parametric and non-parametric schemas, resulting in the ability to achieve both high representational accuracy and semantically rich information (which has previously not been achieved or demonstrated). In summary, this thesis makes several key improvements to industrialized building construction. One of the key findings is that rather than pre-emptively determining the best suited algorithm for a given process or problem, it is often more pragmatic to derive both an exact and approximate solution and then decide which is optimal to use for a given process. Generally, most tasks related to optimizing or enriching geometric models is best solved using approximate methods. To this end, this research presents a series of key techniques that can be followed to improve the temporal performance of algorithms. The new approach for developing computational algorithms and the pragmatic demonstrations for geometric optimization and enrichment are expected to bring the industry forward and solve many of the current barriers it faces