In this paper a, I denote sets and S denotes a non empty non void many sorted signature. The scheme MSSExD deals with a non empty set A and a binary predicate P , and states that: There exists a many sorted set f indexed by A such that for every element i of A holds P [i, f (i)] provided the following condition is met: • For every element i of A there exists a set j such that P [i, j]. Let I be...

In a learning theorem prover, formulas can be veriied by reusing proofs of previously veriied conjectures. Reuse proceeds by transforming a successful proof into a valid schematic formula which can be instantiated subsequently. In this paper, we show how this reuse approach is extended to many-sorted logic: We rst present the logical foundations for reasoning w.r.t. diierent sortings. Then thei...

External merge sort belongs to the most efficient and widely used algorithms to sort big data: As much data as fits inside is sorted in main memory and afterwards swapped to external storage as so called initial run. After sorting all the data in this way block-wise, the initial runs are merged in a merging phase in order to retrieve the final sorted run containing the completely sorted origina...

Following earlier work, a modal logic for T -coalgebras is a functor L on a suitable variety. Syntax and proof system of the logic are given by presentations of the functor. This paper makes two contributions. First, a previous result characterizing those functors that have presentations is generalized from endofunctors on one-sorted varieties to functors between many-sorted varieties. This yie...

Recent progress with tailored growth and post-process sorting enables carbon nanotube (CNT) assemblies with predominantly metallic or semi-conducting concentrations. Cryogenic and microwave measurements performed here show transport dimensionality and overall order increasing with increasing metallic concentration, even in atmospheric doping conditions. By 120 GHz, the conductivity of predomina...

The German Barcoding initiatives BFB and GBOL have generated a reference library of more than 16,000 metazoan species, which is now ready for applications concerning next generation molecular biodiversity assessments. To streamline the barcoding process, we have developed a meta-barcoding pipeline: We pre-sorted a single malaise trap sample (obtained during one week in August 2014, southern Ger...

s of the Talks Sorted in alphabetical order of the first author’s last name Titles of poster presentations are marked with ∗ Attainability of Optimal Solutions of Lexicographical Maximization Problem with Convex Criterion Functions on their Weighed Sum∗

objective: recent evidences suggest that tumors arise from a small subpopulation of cells, the cancer stem cells (cscs) or tumor initiating cells. cscs are able to resist the conventional methods of cancer therapy due to existence of abc transporters on their surface. this leads to csc resistance and maintenance resulting in post-treatment relapse and metastasis. therefore, precise identificati...

We consider a new family of regularizers, termed weighted sorted `1 norms (WSL1), which generalizes the recently introduced octagonal shrinkage and clustering algorithm for regression (OSCAR) and also contains the `1 and `∞ norms as particular instances. We focus on a special case of the WSL1, the decreasing WSL1 (DWSL1), where the elements of the argument vector are sorted in non-increasing or...

We investigate the possibility of developing a decidable logic which allows expressing a large variety of real world specifications. The idea is to define a decidable subset of many-sorted (typed) firstorder logic. The motivation is that types simplify the complexity of mixed quantifiers when they quantify over different types. We noticed that many real world verification problems can be formal...