25 research outputs found
Recommended from our members
Energy-to-Peak State Estimation With Intermittent Measurement Outliers: The Single-Output Case
National Natural Science Foundation of China (Grant Number: 61703245, 61873148, 61933007 and 61873058); China Postdoctoral Science Foundation (Grant Number: 2018T110702); Postdoctoral Special Innovation Foundation of Shandong province of China (Grant Number: 201701015); Natural Science Foundation of Heilongjiang Province of China (Grant Number: ZD2019F001); European Unions Horizon 2020 Research and Innovation Programme (Grant Number: 820776 (INTEGRADDE)); Royal Society of the U.K.; Alexander von Humboldt Foundation of Germany
Recommended from our members
Probability-Guaranteed Envelope-Constrained Filtering for Nonlinear Systems Subject to Measurement Outliers
10.13039/501100001809-National Natural Science Foundation of China (Grant Number: 61773209, 61873148, 61933007 and 61673141); Australian Research Council Discovery Project (Grant Number: DP160103567);
10.13039/501100004608-Natural Science Foundation of Jiangsu Province (Grant Number: BK20190021);
10.13039/501100010014-Six Talent Peaks Project in Jiangsu Province (Grant Number: XYDXX-033); Alexander von Humboldt Foundation of Germany
Computer Aided Verification
This open access two-volume set LNCS 10980 and 10981 constitutes the refereed proceedings of the 30th International Conference on Computer Aided Verification, CAV 2018, held in Oxford, UK, in July 2018. The 52 full and 13 tool papers presented together with 3 invited papers and 2 tutorials were carefully reviewed and selected from 215 submissions. The papers cover a wide range of topics and techniques, from algorithmic and logical foundations of verification to practical applications in distributed, networked, cyber-physical, and autonomous systems. They are organized in topical sections on model checking, program analysis using polyhedra, synthesis, learning, runtime verification, hybrid and timed systems, tools, probabilistic systems, static analysis, theory and security, SAT, SMT and decisions procedures, concurrency, and CPS, hardware, industrial applications
Computer Aided Verification
This open access two-volume set LNCS 10980 and 10981 constitutes the refereed proceedings of the 30th International Conference on Computer Aided Verification, CAV 2018, held in Oxford, UK, in July 2018. The 52 full and 13 tool papers presented together with 3 invited papers and 2 tutorials were carefully reviewed and selected from 215 submissions. The papers cover a wide range of topics and techniques, from algorithmic and logical foundations of verification to practical applications in distributed, networked, cyber-physical, and autonomous systems. They are organized in topical sections on model checking, program analysis using polyhedra, synthesis, learning, runtime verification, hybrid and timed systems, tools, probabilistic systems, static analysis, theory and security, SAT, SMT and decisions procedures, concurrency, and CPS, hardware, industrial applications
Computer-aided biomimetics : semi-open relation extraction from scientific biological texts
Engineering inspired by biology – recently termed biom* – has led to various ground-breaking technological developments. Example areas of application include aerospace
engineering and robotics. However, biom* is not always successful and only sporadically applied in industry. The reason is that a systematic approach to biom* remains
at large, despite the existence of a plethora of methods and design tools. In recent
years computational tools have been proposed as well, which can potentially support
a systematic integration of relevant biological knowledge during biom*. However,
these so-called Computer-Aided Biom* (CAB) tools have not been able to fill all
the gaps in the biom* process. This thesis investigates why existing CAB tools
fail, proposes a novel approach – based on Information Extraction – and develops a
proof-of-concept for a CAB tool that does enable a systematic approach to biom*.
Key contributions include: 1) a disquisition of existing tools guides the selection of a strategy for systematic CAB, 2) a dataset of 1,500 manually-annotated
sentences, 3) a novel Information Extraction approach that combines the outputs
from a supervised Relation Extraction system and an existing Open Information
Extraction system. The implemented exploratory approach indicates that it is possible to extract a focused selection of relations from scientific texts with reasonable
accuracy, without imposing limitations on the types of information extracted. Furthermore, the tool developed in this thesis is shown to i) speed up a trade-off analysis
by domain-experts, and ii) also improve the access to biology information for non-exper
Computer-Aided Biomimetics : Semi-Open Relation Extraction from scientific biological texts
Engineering inspired by biology – recently termed biom* – has led to various groundbreaking technological developments. Example areas of application include aerospace
engineering and robotics. However, biom* is not always successful and only sporadically applied in industry. The reason is that a systematic approach to biom* remains
at large, despite the existence of a plethora of methods and design tools. In recent
years computational tools have been proposed as well, which can potentially support
a systematic integration of relevant biological knowledge during biom*. However,
these so-called Computer-Aided Biom* (CAB) tools have not been able to fill all
the gaps in the biom* process. This thesis investigates why existing CAB tools
fail, proposes a novel approach – based on Information Extraction – and develops a
proof-of-concept for a CAB tool that does enable a systematic approach to biom*.
Key contributions include: 1) a disquisition of existing tools guides the selection of a strategy for systematic CAB, 2) a dataset of 1,500 manually-annotated
sentences, 3) a novel Information Extraction approach that combines the outputs
from a supervised Relation Extraction system and an existing Open Information
Extraction system. The implemented exploratory approach indicates that it is possible to extract a focused selection of relations from scientific texts with reasonable
accuracy, without imposing limitations on the types of information extracted. Furthermore, the tool developed in this thesis is shown to i) speed up a trade-off analysis
by domain-experts, and ii) also improve the access to biology information for nonexperts
Efficient Automata Techniques and Their Applications
Tato práce se zabývá vývojem efektivních technik pro konečné automaty a jejich aplikace. Zejména se věnujeme konečným automatům použitých pří detekci útoků v síťovém provozu a automatům v rozhodovacích procedurách a verifikaci. V první části práce navrhujeme techniky přibližné redukce nedeterministických automatů, které snižují spotřebu zdrojů v hardwarově akcelerovaném zkoumání obsahu paketů. Druhá část práce je je věnována automatům v rozhodovacích procedurách, zejména slabé monadické logice druhého řádů k následníků (WSkS) a teorie nad řetězci. Navrhujeme novou rozhodovací proceduru pro WS2S založenou na automatových termech, umožňující efektivně prořezávat stavový prostor. Dále studujeme techniky předzpracování WSkS formulí za účelem snížení velikosti konstruovaných automatů. Automaty jsme také aplikovali v rozhodovací proceduře teorie nad řetězci pro efektivní reprezentaci důkazového stromu. V poslední části práce potom navrhujeme optimalizace rank-based komplementace Buchiho automatů, které snižuje počet generovaných stavů během konstrukce komplementu.This thesis develops efficient techniques for finite automata and their applications. In particular, we focus on finite automata in network intrusion detection and automata in decision procedures and verification. In the first part of the thesis, we propose techniques of approximate reduction of nondeterministic automata decreasing consumption of resources of hardware-accelerated deep packet inspection. The second part is devoted to automata in decision procedures, in particular, to weak monadic second-order logic of k successors (WSkS) and the theory of strings. We propose a novel decision procedure for WS2S based on automata terms allowing one to effectively prune the state space. Further, we study techniques of WSkS formulae preprocessing intended to reduce the sizes of constructed intermediate automata. Moreover, we employ automata in a decision procedure of the theory of strings for efficient handling of the proof graph. The last part of the thesis then proposes optimizations in rank-based Buchi automata complementation reducing the number of generated states during the construction.
Elementary approaches to microbial growth rate maximisation
This thesis, called Elementary approaches to microbial growth rate maximisation, reports on a theoretical search for principles underlying single cell growth, in particular for microbial species that are selected for fast growth rates. First, the optimally growing cell is characterised in terms of its elementary modes. We prove an extremum principle: a cell that maximises a metabolic rate uses few Elementary Flux Modes (EFMs, the minimal pathways that support steady-state metabolism). The number of active EFMs is bounded by the number of growth-limiting constraints. Later, this extremum principle is extended in a theory that explicitly accounts for self-fabrication. For this, we had to define the elementary modes that underlie balanced self-fabrication: minimal self-supporting sets of expressed enzymes that we call Elementary Growth Modes (EGMs). It turns out that many of the results for EFMs can be extended to their more general self-fabrication analogue. Where the above extremum principles tell us that few elementary modes are used by a rate-maximising cell, it does not tell us how the cell can find them. Therefore, we also search for an elementary adaptation method. It turns out that stochastic phenotype switching with growth rate dependent switching rates provides an adaptation mechanism that is often competitive with more conventional regulatory-circuitry based mechanisms. The derived theory is applied in two ways. First, the extremum principles are used to review the mathematical fundaments of all optimisation-based explanations of overflow metabolism. Second, a computational tool is presented that enumerates Elementary Conversion Modes. These elementary modes can be computed for larger networks than EFMs and EGMs, and still provide an overview of the metabolic capabilities of an organism