Evolutionary design assistants for architecture

In its parallel pursuit of an increased competitivity for design offices and more pleasurable and easier workflows for designers, artificial design intelligence is a technical, intellectual, and political challenge. While human-machine cooperation has become commonplace through Computer Aided Design (CAD) tools, a more improved collaboration and better support appear possible only through an endeavor into a kind of artificial design intelligence, which is more sensitive to the human perception of affairs. Considered as part of the broader Computational Design studies, the research program of this quest can be called Artificial / Autonomous / Automated Design (AD). The current available level of Artificial Intelligence (AI) for design is limited and a viable aim for current AD would be to develop design assistants that are capable of producing drafts for various design tasks. Thus, the overall aim of this thesis is the development of approaches, techniques, and tools towards artificial design assistants that offer a capability for generating drafts for sub-tasks within design processes. The main technology explored for this aim is Evolutionary Computation (EC), and the target design domain is architecture. The two connected research questions of the study concern, first, the investigation of the ways to develop an architectural design assistant, and secondly, the utilization of EC for the development of such assistants. While developing approaches, techniques, and computational tools for such an assistant, the study also carries out a broad theoretical investigation into the main problems, challenges, and requirements towards such assistants on a rather overall level. Therefore, the research is shaped as a parallel investigation of three main threads interwoven along several levels, moving from a more general level to specific applications. The three research threads comprise, first, theoretical discussions and speculations with regard to both existing literature and the proposals and applications of the thesis; secondly, proposals for descriptive and prescriptive models, mappings, summary illustrations, task structures, decomposition schemes, and integratory frameworks; and finally, experimental applications of these proposals. This tripartite progression allows an evaluation of each proposal both conceptually and practically; thereby, enabling a progressive improvement of the understanding regarding the research question, while producing concrete outputs on the way. Besides theoretical and interpretative examinations, the thesis investigates its subject through a set of practical and speculative proposals, which function as both research instruments and the outputs of the study. The first main output of the study is the “design_proxy” approach (d_p), which is an integrated approach for draft making design assistants. It is an outcome of both theoretical examinations and experimental applications, and proposes an integration of, (1) flexible and relaxed task definitions and representations (instead of strict formalisms), (2) intuitive interfaces that make use of usual design media, (3) evaluation of solution proposals through their similarity to given examples, and (4) a dynamic evolutionary approach for solution generation. The design_proxy approach may be useful for AD researchers that aim at developing practical design assistants, as has been examined and demonstrated with the two applications, i.e., design_proxy.graphics and design_proxy.layout. The second main output, the “Interleaved Evolutionary Algorithm” (IEA, or Interleaved EA) is a novel evolutionary algorithm proposed and used as the underlying generative mechanism of design_proxybased design assistants. The Interleaved EA is a dynamic, adaptive, and multi-objective EA, in which one of the objectives leads the evolution until its fitness progression stagnates; in the sense that the settings and fitness values of this objective is used for most evolutionary decisions. In this way, the Interleaved EA enables the use of different settings and operators for each of the objectives within an overall task, which would be the same for all objectives in a regular multi-objective EA. This property gives the algorithm a modular structure, which offers an improvable method for the utilization of domain-specific knowledge for each sub-task, i.e., objective. The Interleaved EA can be used by Evolutionary Computation (EC) researchers and by practitioners who employ EC for their tasks. As a third main output, the “Architectural Stem Cells Framework” is a conceptual framework for architectural design assistants. It proposes a dynamic and multi-layered method for combining a set of design assistants for larger tasks in architectural design. The first component of the framework is a layer-based, parallel task decomposition approach, which aims at obtaining a dynamic parallelization of sub-tasks within a more complicated problem. The second component of the framework is a conception for the development mechanisms for building drafts, i.e., Architectural Stem Cells (ASC). An ASC can be conceived as a semantically marked geometric structure, which contains the information that specifies the possibilities and constraints for how an abstract building may develop from an undetailed stage to a fully developed building draft. ASCs are required for re-integrating the separated task layers of an architectural problem through solution-based development. The ASC Framework brings together many of the ideas of this thesis for a practical research agenda and it is presented to the AD researchers in architecture. Finally, the “design_proxy.layout” (d_p.layout) is an architectural layout design assistant based on the design_proxy approach and the IEA. The system uses a relaxed problem definition (producing draft layouts) and a flexible layout representation that permits the overlapping of design units and boundaries. User interaction with the system is carried out through intuitive 2D graphics and the functional evaluations are performed by measuring the similarity of a proposal to existing layouts. Functioning in an integrated manner, these properties make the system a practicable and enjoying design assistant, which was demonstrated through two workshop cases. The d_p.layout is a versatile and robust layout design assistant that can be used by architects in their design processes

Strong Stein neighborhood bases

Let D be a smooth bounded pseudoconvex domain in C^n. We give several characterizations for the closure of D to have a strong Stein neighborhood basis in the sense that D has a defining function r such that {z\in C^n:r(z)<a} is pseudoconvex for sufficiently small a>0. We also show that this condition is invariant under proper holomorphic maps that extend smoothly to the boundary.Comment: 14 pages, fixed same references, to appear in Complex Var. Elliptic Eq

Evidence from the first Shared Medical Appointments (SMAs) randomised controlled trial in India: SMAs increase the satisfaction, knowledge, and medication compliance of patients with glaucoma

In Shared Medical Appointments (SMAs), patients with similar conditions meet the physician together and each receives one-on-one attention. SMAs can improve outcomes and physician productivity. Yet privacy concerns have stymied adoption. In physician-deprived nations, patients’ utility from improved access may outweigh their disutility from loss of privacy. Ours is to our knowledge the first SMA trial for any disease, in India, where doctors are scarce. In a 1,000-patient, single-site, randomized controlled trial at Aravind Eye Hospital, Pondicherry, we compared SMAs and one-on-one appointments, over four successive visits, for patients with glaucoma. We examined patients’ satisfaction, knowledge, intention-to-follow-up, follow-up rates, and medication compliance rates (primary outcomes) using intention-to-treat analysis. Of 1,034 patients invited between July 12, 2016 –July 19, 2018, 1,000 (96.7%) consented to participate, and were randomly assigned to either SMAs (NSMA = 500) or one-on-one appointments (N1-1 = 500). Patients who received SMAs showed higher satisfaction (MeanSMA = 4.955 (SD 0.241), Mean1-1 = 4.920 (SD 0.326); difference in means 0.035; 95% CI, 0.017–0.054, p = 0.0002) and knowledge (MeanSMA = 3.416 (SD 1.340), Mean1-1 = 3.267 (SD 1.492); difference in means 0.149; 95% CI, 0.057–0.241, p = 0.002) than patients who received one-on-one appointments. Across conditions, there was no difference in patients’ intention-to-follow-up (MeanSMA = 4.989 (SD 0.118), Mean1-1 = 4.986 (SD 0.149); difference in means 0.003; 95% CI, -0.006–0.012, p = 0.481) and actual follow-up rates (MeanSMA = 87.5% (SD 0.372), Mean1-1 = 88.7% (SD 0.338); difference in means -0.012; 95% CI, -0.039–0.015, p = 0.377). Patients who received SMAs exhibited higher medication compliance rates (MeanSMA = 97.0% (SD 0.180), Mean1-1 = 94.9% (SD 0.238); difference in means 0.020; 95% CI, 0.004–0.036, p = 0.013). SMAs improved satisfaction, learning, and medication compliance, without compromising follow-up rates or measured clinical outcomes. Peer interruptions were negatively correlated with patient satisfaction in early-trial SMAs and positively correlated with patient satisfaction in later-trial SMAs. Trial registration: The trial was registered with Clinical Trials Registry of India (https://ctri.nic.in/) with reference no. REF/2016/11/012659 and registration no. CTRI/2018/02/011998

Upper Bounds on the Multiplicative Complexity of Symmetric Boolean Functions

A special metric of interest about Boolean functions is multiplicative complexity (MC): the minimum number of AND gates sufficient to implement a function with a Boolean circuit over the basis {XOR, AND, NOT}. In this paper we study the MC of symmetric Boolean functions, whose output is invariant upon reordering of the input variables. Based on the Hamming weight method from Muller and Preparata (1975), we introduce new techniques that yield circuits with fewer AND gates than upper bounded by Boyar et al. in 2000 and by Boyar and Peralta in 2008. We generate circuits for all such functions with up to 25 variables. As a special focus, we report concrete upper bounds for the MC of elementary symmetric functions $\Sigma^n_k$ and counting functions $E^n_k$ with up to n = 25 input variables. In particular, this allows us to answer two questions posed in 2008: both the elementary symmetric $\Sigma^8_4$ and the counting $E^8_4$ functions have MC 6. Furthermore, we show upper bounds for the maximum MC in the class of n-variable symmetric Boolean functions, for each n up to 132

Once-monthly paliperidone palmitate in recently diagnosed and chronic non-acute patients with schizophrenia

OBJECTIVE: To explore the treatment response, tolerability and safety of once-monthly paliperidone palmitate (PP1M) in non-acute patients switched to oral antipsychotics stratified by time since diagnosis as recently diagnosed (3 years). RESEARCH DESIGN AND METHODS: Post-hoc analysis of a prospective, interventional, single-arm, multicentre, open-label, 6-month study performed in 233 recently diagnosed and 360 chronic patients. MAIN OUTCOME MEASURES: The proportion achieving treatment response (defined as >/=20% improvement in Positive and Negative Syndrome Scale [PANSS] total score from baseline to endpoint) and maintained efficacy (defined as non-inferiority in the change in PANSS total score at endpoint [Schuirmann's test]). RESULTS: 71.4% of recently diagnosed and 59.2% of chronic patients showed a >/=20% decrease in PANSS total score (p=0.0028 between groups). Changes in PANSS Marder factors, PANSS subscales, and the proportion of patients with a Personal and Social Performance scale (PSP) total score of 71-100 were significantly greater in recently diagnosed compared with chronic patients. PP1M was well tolerated, presenting no new safety signals. CONCLUSION: These data show that recently diagnosed patients treated with PP1M had a significantly higher treatment response and improved functioning, as assessed by the PSP total score, than chronic patients

The EU’s stability-democracy dilemma in the context of the problematic accession of the Western Balkan states

The accession of the remaining six Western Balkan states into the EU is shrouded in much uncertainty. Despite Croatia finally traversing the difficult path to eventual membership in 2013, not one of the remaining Western Balkan countries can claim to be on a definite pathway to membership today. An increasingly prevalent argument is that the EU’s engagement with its neighbourhoods has faltered because its strategies have been undermined by an inherent stability-democracy dilemma. This article examines the EU’s engagement with the Western Balkans and finds that although the EU tried to transcend this dilemma, in reality, a tension between stability and democracy was present with the former generally receiving more attention in policymaking. This led to not only a lack of tangible democratization amongst the Western Balkan states, but further uncertainty about their accession prospects. By 2018, it was clear that the EU’s engagement with the Western Balkans needed a rethink, resulting in a new approach: the ‘Six Flagship Initiatives’. However, given the apprehensiveness of some member states (especially France) coupled with the presence of outsiders such as Russia and China in the area, the accession prospects of the six non-EU Western Balkan states remains blurred

A novel approach for rapid screening of mitochondrial D310 polymorphism

BACKGROUND: Mutations in the mitochondrial DNA (mtDNA) have been reported in a wide variety of human neoplasms. A polynucleotide tract extending from 303 to 315 nucleotide positions (D310) within the non-coding region of mtDNA has been identified as a mutational hotspot of primary tumors. This region consists of two polycytosine stretches interrupted by a thymidine nucleotide. The number of cytosines at the first and second stretches are 7 and 5 respectively, according to the GeneBank sequence. The first stretch exhibits a polymorphic length variation (6-C to 9-C) among individuals and has been investigated in many cancer types. Large-scale studies are needed to clarify the relationship between cytosine number and cancer development/progression. However, time and money consuming methods such as radioactivity-based gel electrophoresis and sequencing, are not appropriate for the determination of this polymorphism for large case-control studies. In this study, we conducted a rapid RFLP analysis using a restriction enzyme, BsaXI, for the single step simple determination of 7-C carriers at the first stretch in D310 region. METHODS: 25 colorectal cancer patients, 25 breast cancer patients and 41 healthy individuals were enrolled into the study. PCR amplification followed by restriction enzyme digestion of D310 region was performed for RFLP analysis. Digestion products were analysed by agarose gel electrophoresis. Sequencing was also applied to samples in order to confirm the RFLP data. RESULTS: Samples containing 7-C at first stretch of D310 region were successfully determined by the BsaXI RFLP method. Heteroplasmy and homoplasmy for 7-C content was also determined as evidenced by direct sequencing. Forty-one percent of the studied samples were found to be BsaXI positive. Furthermore, BsaXI status of colorectal cancer samples were significantly different from that of healthy individuals. CONCLUSION: In conclusion, BsaXI RFLP analysis is a simple and rapid approach for the single step determination of D310 polymorphism of mitochondrial DNA. This method allows the evaluation of a significant proportion of samples without the need for sequencing- and/or radioactivity-based techniques

On the Study of Hyperbolic Triangles and Circles by Hyperbolic Barycentric Coordinates in Relativistic Hyperbolic Geometry

Barycentric coordinates are commonly used in Euclidean geometry. Following the adaptation of barycentric coordinates for use in hyperbolic geometry in recently published books on analytic hyperbolic geometry, known and novel results concerning triangles and circles in the hyperbolic geometry of Lobachevsky and Bolyai are discovered. Among the novel results are the hyperbolic counterparts of important theorems in Euclidean geometry. These are: (1) the Inscribed Gyroangle Theorem, (ii) the Gyrotangent-Gyrosecant Theorem, (iii) the Intersecting Gyrosecants Theorem, and (iv) the Intersecting Gyrochord Theorem. Here in gyrolanguage, the language of analytic hyperbolic geometry, we prefix a gyro to any term that describes a concept in Euclidean geometry and in associative algebra to mean the analogous concept in hyperbolic geometry and nonassociative algebra. Outstanding examples are {\it gyrogroups} and {\it gyrovector spaces}, and Einstein addition being both {\it gyrocommutative} and {\it gyroassociative}. The prefix "gyro" stems from "gyration", which is the mathematical abstraction of the special relativistic effect known as "Thomas precession".Comment: 78 pages, 26 figure

Reducing the Multiplicative Complexity in Logic Networks for Cryptography and Security Applications

Reducing the number of AND gates plays a central role in many cryptography and security applications. We propose a logic synthesis algorithm and tool to minimize the number of AND gates in a logic network composed of AND, XOR, and inverter gates. Our approach is fully automatic and exploits cut enumeration algorithms to explore optimization potentials in local subcircuits. The experimental results show that our approach can reduce the number of AND gates by 34% on average compared to generic size optimization algorithms. Further, we are able to reduce the number of AND gates up to 76% in best-known benchmarks from the cryptography community