Refine
Document Type
- Article (4)
- Part of Periodical (1)
Is part of the Bibliography
- yes (5)
Keywords
- Dyslexie (1)
- EBSD (1)
- Lese-Rechtschreib-Schwäche (1)
- Leseerwerb (1)
- Multi-objective optimization (1)
- Patholinguistik (1)
- Runtime analysis (1)
- Sprachtherapie (1)
- Submodular function (1)
- Subset selection (1)
We consider the subset selection problem for function f with constraint bound B that changes over time. Within the area of submodular optimization, various greedy approaches are commonly used. For dynamic environments we observe that the adaptive variants of these greedy approaches are not able to maintain their approximation quality. Investigating the recently introduced POMC Pareto optimization approach, we show that this algorithm efficiently computes a phi=(alpha(f)/2)(1 - 1/e(alpha)f)-approximation, where alpha(f) is the submodularity ratio of f, for each possible constraint bound b <= B. Furthermore, we show that POMC is able to adapt its set of solutions quickly in the case that B increases. Our experimental investigations for the influence maximization in social networks show the advantage of POMC over generalized greedy algorithms. We also consider EAMC, a new evolutionary algorithm with polynomial expected time guarantee to maintain phi approximation ratio, and NSGA-II with two different population sizes as advanced multi-objective optimization algorithm, to demonstrate their challenges in optimizing the maximum coverage problem. Our empirical analysis shows that, within the same number of evaluations, POMC is able to perform as good as NSGA-II under linear constraint, while EAMC performs significantly worse than all considered algorithms in most cases.
Myriapods (e. g., centipedes and millipedes) display a simple homonomous body plan relative to other arthropods. All members of the class are terrestrial, but they attained terrestriality independently of insects. Myriapoda is the only arthropod class not represented by a sequenced genome. We present an analysis of the genome of the centipede Strigamia maritima. It retains a compact genome that has undergone less gene loss and shuffling than previously sequenced arthropods, and many orthologues of genes conserved from the bilaterian ancestor that have been lost in insects. Our analysis locates many genes in conserved macro-synteny contexts, and many small-scale examples of gene clustering. We describe several examples where S. maritima shows different solutions from insects to similar problems. The insect olfactory receptor gene family is absent from S. maritima, and olfaction in air is likely effected by expansion of other receptor gene families. For some genes S. maritima has evolved paralogues to generate coding sequence diversity, where insects use alternate splicing. This is most striking for the Dscam gene, which in Drosophila generates more than 100,000 alternate splice forms, but in S. maritima is encoded by over 100 paralogues. We see an intriguing linkage between the absence of any known photosensory proteins in a blind organism and the additional absence of canonical circadian clock genes. The phylogenetic position of myriapods allows us to identify where in arthropod phylogeny several particular molecular mechanisms and traits emerged. For example, we conclude that juvenile hormone signalling evolved with the emergence of the exoskeleton in the arthropods and that RR-1 containing cuticle proteins evolved in the lineage leading to Mandibulata. We also identify when various gene expansions and losses occurred. The genome of S. maritima offers us a unique glimpse into the ancestral arthropod genome, while also displaying many adaptations to its specific life history.
Am 20. November 2010 fand an der Universität Potsdam das 4. Herbsttreffen Patholinguistik statt. Die Konferenzreihe wird regelmäßig seit 2007 vom Verband für Patholinguistik e.V. (vpl) durchgeführt. Der vorliegende Tagungsband veröffentlicht die Hauptvorträge des Herbsttreffens zum Thema "Lesen lernen: Diagnostik und Therapie bei Störungen des Leseerwerbs". Des Weiteren sind die Beiträge promovierender bzw. promovierter PatholinguistInnen sowie der Posterpräsentationen enthalten.
The effect of two types of scanning strategies on the grain structure and build-up of Residual Stress (RS) has been investigated in an as-built IN718 alloy produced by Laser Powder Bed Fusion (LPBF). The RS state has been investigated by X-ray diffraction techniques. The microstructural characterization was performed principally by Electron Backscatter Diffraction (EBSD), where the application of a post-measurement refinement technique enables small misorientations (< 2 degrees) to be resolved. Kernel average misorientation (KAM) distributions indicate that preferably oriented columnar grains contain higher levels of misorientation, when compared to elongated grains with lower texture. The KAM distributions combined with X-ray diffraction stress maps infer that the increased misorientation is induced via plastic deformation driven by the thermal stresses, acting to self-relieve stress. The possibility of obtaining lower RS states in the build direction as a consequence of the influence of the microstructure should be considered when envisaging scanning strategies aimed at the mitigation of RS.
Rigorous runtime analysis is a major approach towards understanding evolutionary computing techniques, and in this area linear pseudo-Boolean objective functions play a central role. Having an additional linear constraint is then equivalent to the NP-hard Knapsack problem, certain classes thereof have been studied in recent works. In this article, we present a dynamic model of optimizing linear functions under uniform constraints. Starting from an optimal solution with respect to a given constraint bound, we investigate the runtimes that different evolutionary algorithms need to recompute an optimal solution when the constraint bound changes by a certain amount. The classical (1+1) EA and several population-based algorithms are designed for that purpose, and are shown to recompute efficiently. Furthermore, a variant of the (1+(λ,λ))GA for the dynamic optimization problem is studied, whose performance is better when the change of the constraint bound is small.