Room-temperature transverse-electric polarized intersubband electroluminescence from InAs/AlInAs quantum dashes

We report the observation of transverse electric polarized electroluminescence from InAs/AlInAs quantum dash quantum cascade structures up to room temperature. The emission is attributed to the electric field confined along the shortest lateral dimension of the dashes, as confirmed by its dependence on crystallographic orientation both in absorption measurements on a dedicated sample and from electroluminescence itself. From the absorption we estimate a dipole moment for the observed transition of =1.7 nm. The electroluminescence is peaked at around 110 meV and increases with applied bias. Its temperature dependence shows a decrease at higher temperatures limited by optical phonon emission.Comment: 15 pages, 4 figures, submitted to Applied Physics Letter

On the String Consensus Problem and the Manhattan Sequence Consensus Problem

In the Manhattan Sequence Consensus problem (MSC problem) we are given $k$ integer sequences, each of length $l$, and we are to find an integer sequence $x$ of length $l$ (called a consensus sequence), such that the maximum Manhattan distance of $x$ from each of the input sequences is minimized. For binary sequences Manhattan distance coincides with Hamming distance, hence in this case the string consensus problem (also called string center problem or closest string problem) is a special case of MSC. Our main result is a practically efficient $O(l)$-time algorithm solving MSC for $k\le 5$ sequences. Practicality of our algorithms has been verified experimentally. It improves upon the quadratic algorithm by Amir et al.\ (SPIRE 2012) for string consensus problem for $k=5$ binary strings. Similarly as in Amir's algorithm we use a column-based framework. We replace the implied general integer linear programming by its easy special cases, due to combinatorial properties of the MSC for $k\le 5$. We also show that for a general parameter $k$ any instance can be reduced in linear time to a kernel of size $k!$, so the problem is fixed-parameter tractable. Nevertheless, for $k\ge 4$ this is still too large for any naive solution to be feasible in practice.Comment: accepted to SPIRE 201

Parameterizing by the Number of Numbers

The usefulness of parameterized algorithmics has often depended on what Niedermeier has called, "the art of problem parameterization". In this paper we introduce and explore a novel but general form of parameterization: the number of numbers. Several classic numerical problems, such as Subset Sum, Partition, 3-Partition, Numerical 3-Dimensional Matching, and Numerical Matching with Target Sums, have multisets of integers as input. We initiate the study of parameterizing these problems by the number of distinct integers in the input. We rely on an FPT result for ILPF to show that all the above-mentioned problems are fixed-parameter tractable when parameterized in this way. In various applied settings, problem inputs often consist in part of multisets of integers or multisets of weighted objects (such as edges in a graph, or jobs to be scheduled). Such number-of-numbers parameterized problems often reduce to subproblems about transition systems of various kinds, parameterized by the size of the system description. We consider several core problems of this kind relevant to number-of-numbers parameterization. Our main hardness result considers the problem: given a non-deterministic Mealy machine M (a finite state automaton outputting a letter on each transition), an input word x, and a census requirement c for the output word specifying how many times each letter of the output alphabet should be written, decide whether there exists a computation of M reading x that outputs a word y that meets the requirement c. We show that this problem is hard for W[1]. If the question is whether there exists an input word x such that a computation of M on x outputs a word that meets c, the problem becomes fixed-parameter tractable

Polynomial kernels for 3-leaf power graph modification problems

A graph G=(V,E) is a 3-leaf power iff there exists a tree T whose leaves are V and such that (u,v) is an edge iff u and v are at distance at most 3 in T. The 3-leaf power graph edge modification problems, i.e. edition (also known as the closest 3-leaf power), completion and edge-deletion, are FTP when parameterized by the size of the edge set modification. However polynomial kernel was known for none of these three problems. For each of them, we provide cubic kernels that can be computed in linear time for each of these problems. We thereby answer an open problem first mentioned by Dom, Guo, Huffner and Niedermeier (2005).Comment: Submitte

Tunable few electron quantum dots in InAs nanowires

Quantum dots realized in InAs are versatile systems to study the effect of spin-orbit interaction on the spin coherence, as well as the possibility to manipulate single spins using an electric field. We present transport measurements on quantum dots realized in InAs nanowires. Lithographically defined top-gates are used to locally deplete the nanowire and to form tunneling barriers. By using three gates, we can form either single quantum dots, or two quantum dots in series along the nanowire. Measurements of the stability diagrams for both cases show that this method is suitable for producing high quality quantum dots in InAs.Comment: 8 pages, 4 figure

Neues aus dem Versuchswesen im ökologischen Obst- und Weinbau

Der Sachbereich Ökologischer Anbau des Versuchszentrums Laimburg und die Unità Sperimentazione Agraria e Agricoltura Sostenibile des Agrarinstituts in San Michele all’Adige, Fondazione Edmund Mach, organisierten im August 2012 eine öffentliche Versuchsvorstellung. Dadurch boten wir einmal mehr die Möglichkeit, einem breiten Publikum Einblicke in die aktuellsten Versuchsaktivitäten und -ergebnisse zu geben

Cluster Editing: Kernelization based on Edge Cuts

Kernelization algorithms for the {\sc cluster editing} problem have been a popular topic in the recent research in parameterized computation. Thus far most kernelization algorithms for this problem are based on the concept of {\it critical cliques}. In this paper, we present new observations and new techniques for the study of kernelization algorithms for the {\sc cluster editing} problem. Our techniques are based on the study of the relationship between {\sc cluster editing} and graph edge-cuts. As an application, we present an ${\cal O}(n^2)$-time algorithm that constructs a $2k$ kernel for the {\it weighted} version of the {\sc cluster editing} problem. Our result meets the best kernel size for the unweighted version for the {\sc cluster editing} problem, and significantly improves the previous best kernel of quadratic size for the weighted version of the problem

Bounded Search Tree Algorithms for Parameterized Cograph Deletion: Efficient Branching Rules by Exploiting Structures of Special Graph Classes

Many fixed-parameter tractable algorithms using a bounded search tree have been repeatedly improved, often by describing a larger number of branching rules involving an increasingly complex case analysis. We introduce a novel and general search strategy that branches on the forbidden subgraphs of a graph class relaxation. By using the class of $P_4$-sparse graphs as the relaxed graph class, we obtain efficient bounded search tree algorithms for several parameterized deletion problems. We give the first non-trivial bounded search tree algorithms for the cograph edge-deletion problem and the trivially perfect edge-deletion problems. For the cograph vertex deletion problem, a refined analysis of the runtime of our simple bounded search algorithm gives a faster exponential factor than those algorithms designed with the help of complicated case distinctions and non-trivial running time analysis [21] and computer-aided branching rules [11].Comment: 23 pages. Accepted in Discrete Mathematics, Algorithms and Applications (DMAA

Closest string with outliers

Background: Given n strings s1, …, sn each of length ℓ and a nonnegative integer d, the CLOSEST STRING problem asks to find a center string s such that none of the input strings has Hamming distance greater than d from s. Finding a common pattern in many – but not necessarily all – input strings is an important task that plays a role in many applications in bioinformatics. Results: Although the closest string model is robust to the oversampling of strings in the input, it is severely affected by the existence of outliers. We propose a refined model, the CLOSEST STRING WITH OUTLIERS (CSWO) problem, to overcome this limitation. This new model asks for a center string s that is within Hamming distance d to at least n – k of the n input strings, where k is a parameter describing the maximum number of outliers. A CSWO solution not only provides the center string as a representative for the set of strings but also reveals the outliers of the set. We provide fixed parameter algorithms for CSWO when d and k are parameters, for both bounded and unbounded alphabets. We also show that when the alphabet is unbounded the problem is W[1]-hard with respect to n – k, ℓ, and d. Conclusions: Our refined model abstractly models finding common patterns in several but not all input strings

Polygenic risk heterogeneity among focal epilepsies

Focal epilepsy (FE) is clinically highly heterogeneous. It has been shown recently that not only rare but also a subset of common genetic variants confer risk for FE. The relatively modest power of genetic studies in FE suggests a high genetic heterogeneity of FE when grouped as one disorder. We hypothesize that the clinical heterogeneity of FE is correlated with genetic heterogeneity on a common risk variant level. To test the hypothesis, we used an FE polygenic risk score "FE-PRS" that combines small effect sizes of thousands of common variants from the largest FE-GWAS (genome-wide association study) into a single measure. We grouped 414 individuals with FE according to common clinical features into subgroups, either by one feature at a time or by all features combined in a cluster analysis. We examined their association with FE-PRS compared to 20 435 matched population controls and observed heterogeneous FE-PRS burden among the subgroups. The highest phenotypic variance explained by FE-PRS was identified in a cluster analysis-defined FE subgroup where all individuals had unknown etiologies and psychiatric comorbidities, and the majority had early onset seizures. Our results indicate that genetic factors associated with FE have differential burden among FE subtypes. Future studies using better-powered FE-PRS might have clinical utility.Peer reviewe