I/O-efficient dynamic point location in monotone planar subdivisions

We present an efficient external-memory dynamic data structure for point location in monotone planar subdivisions. Our data structure uses O(N/B) disk blocks to store a monotone subdivision of size N, where B is the size of a disk block. It supports queries in O(logi N) I/OS (worst-case) and updates in O(lo& N) I/OS (amortized). We also propose a new variant of B-trees, called leuelbalanced B-trees, which allow insert, delete, merge, and split operations in O((l+ $logM,B f) log, N) I/OS (amortized), 2 5 b 2 B/2, even if each node stores a pointer to its parent. Here M is the size of main memory. Besides being essential to our point-location data structure, we believe that level-balanced B-trees are of significant independent interest. They can, for example, be used to dynamically maintain a planar St-graph using O((1 +$10g~,~ $$) log, N) = O(logi N) I/OS (amortized) per update, so that reachability queries can be answered in O(log, N) I/OS (worst case)

Discordant Supramolecular Fibres Reversibly Depolymerised by Temperature and Light

Synthetic stimuli responsive supramolecular polymers attract increasing interest for their ability to mimic the unique properties of natural assemblies. Here we focus on the well-studied benzene-1,3,5-tricarboxamide (BTA) motif, and substitute it with two (S)-3,7-dimethyloctyl groups and an azobenzene photoswitch. We demonstrate the UV (λ=365 nm) induced depolymerisation of the helical hydrogen-bonded polymers in methylcyclohexane (MCH) through circular dichroism and UV-vis spectroscopy in dilute solution (15 μm), and NMR and iPAINT super-resolution microscopy in concentrated solution (300 μm). The superstructure can be regenerated after thermal depolymerization, whilst repeated depolymerisation can be reversed without degradation by irradiating at λ=455 nm. Molecular dynamics simulations show that the most energetically favourable configuration for these polymers in MCH is a left-handed helical network of hydrogen-bonds between the BTA cores surrounded by two right-handed helices of azobenzenes. The responsiveness to two orthogonal triggers across a broad concentration range holds promise for use in, for example, photo-responsive gelation

Geometric representations for minimalist grammars

We reformulate minimalist grammars as partial functions on term algebras for strings and trees. Using filler/role bindings and tensor product representations, we construct homomorphisms for these data structures into geometric vector spaces. We prove that the structure-building functions as well as simple processors for minimalist languages can be realized by piecewise linear operators in representation space. We also propose harmony, i.e. the distance of an intermediate processing step from the final well-formed state in representation space, as a measure of processing complexity. Finally, we illustrate our findings by means of two particular arithmetic and fractal representations.Comment: 43 pages, 4 figure

SAT-based Explicit LTL Reasoning

We present here a new explicit reasoning framework for linear temporal logic (LTL), which is built on top of propositional satisfiability (SAT) solving. As a proof-of-concept of this framework, we describe a new LTL satisfiability tool, Aalta\_v2.0, which is built on top of the MiniSAT SAT solver. We test the effectiveness of this approach by demonnstrating that Aalta\_v2.0 significantly outperforms all existing LTL satisfiability solvers. Furthermore, we show that the framework can be extended from propositional LTL to assertional LTL (where we allow theory atoms), by replacing MiniSAT with the Z3 SMT solver, and demonstrating that this can yield an exponential improvement in performance

Automated Security Analysis of IoT Software Updates

IoT devices often operate unsupervised in ever-changing environments for several years. Therefore, they need to be updated on a regular basis. Current approaches for software updates on IoT, like the recent SUIT proposal, focus on granting integrity and confidentiality but do not analyze the content of the software update, especially the IoT application which is deployed to IoT devices. To this aim, in this paper, we present IoTAV, an automated software analysis framework for systematically verifying the security of the applications contained in software updates w.r.t. a given security policy. Our proposal can be adopted transparently by current IoT software updates workflows. We prove the viability of IoTAV by testing our methodology on a set of actual RIOT OS applications. Experimental results indicate that the approach is viable in terms of both reliability and performance, leading to the identification of 26 security policy violations in 31 real-world RIOT applications

Intersectin associates with synapsin and regulates its nanoscale localization and function.

Neurotransmission is mediated by the exocytic release of neurotransmitters from readily releasable synaptic vesicles (SVs) at the active zone. To sustain neurotransmission during periods of elevated activity, release-ready vesicles need to be replenished from the reserve pool of SVs. The SV-associated synapsins are crucial for maintaining this reserve pool and regulate the mobilization of reserve pool SVs. How replenishment of release-ready SVs from the reserve pool is regulated and which other factors cooperate with synapsins in this process is unknown. Here we identify the endocytic multidomain scaffold protein intersectin as an important regulator of SV replenishment at hippocampal synapses. We found that intersectin directly associates with synapsin I through its Src-homology 3 A domain, and this association is regulated by an intramolecular switch within intersectin 1. Deletion of intersectin 1/2 in mice alters the presynaptic nanoscale distribution of synapsin I and causes defects in sustained neurotransmission due to defective SV replenishment. These phenotypes were rescued by wild-type intersectin 1 but not by a locked mutant of intersectin 1. Our data reveal intersectin as an autoinhibited scaffold that serves as a molecular linker between the synapsin-dependent reserve pool and the presynaptic endocytosis machinery

DecSerFlow: Towards a Truly Declarative Service Flow Language

The need for process support in the context of web services has triggered the development of many languages, systems, and standards. Industry has been developing software solutions and proposing standards such as BPEL, while researchers have been advocating the use of formal methods such as Petri nets and pi-calculus. The languages developed for service flows, i.e., process specification languages for web services, have adopted many concepts from classical workflow management systems. As a result, these languages are rather procedural and this does not fit well with the autonomous nature of services. Therefore, we propose DecSerFlow as a Declarative Service Flow Language. DecSerFlow can be used to specify, enact, and monitor service flows. The language is extendible (i.e., constructs can be added without changing the engine or semantical basis) and can be used to enforce or to check the conformance of service flows. Although the language has an appealing graphical representation, it is grounded in temporal logic