If perceptually relevant multimedia methods with guaranteed performance are not developed soon, there is no hope that the problem of multimedia information overload is effectively solved. Research is needed to handle ...
详细信息
If perceptually relevant multimedia methods with guaranteed performance are not developed soon, there is no hope that the problem of multimedia information overload is effectively solved. Research is needed to handle images, music, video, and 3D models, with methods that guarantee robustness, invariance, efficiency, etc., and are also perceptually and cognitively relevant. The invention of algorithms that provably satisfy such properties is a new field of research: multimedia algorithmics.
The contribution of programming in the learning of school mathematics has been demonstrated in numerous project and research settings. However, it would appear that this activity has failed to permeate the system on a...
详细信息
algorithmics for Hard Problems [electronic Resource] : Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics by Hromkovič, Juraj; published by Berlin, Heidelberg : Springer Berlin H...
详细信息
algorithmics for Hard Problems [electronic Resource] : Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics by Hromkovič, Juraj; published by Berlin, Heidelberg : Springer Berlin Heidelberg
In this book, Dan Gusfield examines combinatorial algorithms to construct genealogical and exact phylogenetic networks, particularly ancestral recombination graphs (ARGs). The algorithms produce networks (or informati...
详细信息
ISBN:
(纸本)0262027526;9780262027526
In this book, Dan Gusfield examines combinatorial algorithms to construct genealogical and exact phylogenetic networks, particularly ancestral recombination graphs (ARGs). The algorithms produce networks (or information about networks) that serve as hypotheses about the true genealogical history of observed biological sequences and can be applied to practical biological problems. Phylogenetic trees have been the traditional means to represent evolutionary history, but there is a growing realization that networks rather than trees are often needed, most notably for recent human history. This has led to the development of ARGs in population genetics and, more broadly, to phylogenetic networks. ReCombinatorics offers an in-depth, rigorous examination of current research on the combinatorial, graph-theoretic structure of ARGs and explicit phylogenetic networks, and algorithms to reconstruct or deduce information about those networks. ReCombinatorics, a groundbreaking contribution to the emerging field of phylogenetic networks, connects and unifies topics in population genetics and phylogenetics that have traditionally been discussed separately and considered to be unrelated. It covers the necessary combinatorial and algorithmic background material; the various biological phenomena; the mathematical, population genetic, and phylogenetic models that capture the essential elements of these phenomena; the combinatorial and algorithmic problems that derive from these models; the theoretical results that have been obtained; related software that has been developed; and some empirical testing of the software on simulated and real biological data.
In many countries, the demands are getting louder to bring computer science education into primary schools. Curricula and teaching approaches are evolving and educators have to work their way into new topics. Many pri...
详细信息
ISBN:
(纸本)9781450365888
In many countries, the demands are getting louder to bring computer science education into primary schools. Curricula and teaching approaches are evolving and educators have to work their way into new topics. Many primary school teachers feel overstrained by these developments and the need for appropriate teacher training is rising. In this paper, we describe the structure and contents of an in-service professional development workshop for primary school teachers without any previous knowledge in computer science ( CS) as well as first results of the pilot run with 40 teachers. Throughout the three-day workshop, the teachers get the chance to follow the students' path of learning by taking a primary school programming course themselves, engage intensively with the underlying algorithmic concepts through in-depth exercises and work on their own ideas for implementations in the classroom.
In the late 1990s, researchers analyzed what distinguishes great companies from simply good ones. They found several features that are typical for great companies. Interestingly, most of these features seem counter-in...
详细信息
In this paper, we study the problem of sorting unichromosomal linear genomes by prefix double- cut-and-joins (or DCJs) in both the signed and the unsigned settings. Prefix DCJs cut the leftmost segment of a genome and...
详细信息
In this paper, we study the problem of sorting unichromosomal linear genomes by prefix double- cut-and-joins (or DCJs) in both the signed and the unsigned settings. Prefix DCJs cut the leftmost segment of a genome and any other segment, and recombine the severed endpoints in one of two possible ways: one of these options corresponds to a prefix reversal, which reverses the order of elements between the two cuts (as well as their signs in the signed case). Our main results are: (1) new structural lower bounds based on the breakpoint graph for sorting by unsigned prefix reversals, unsigned prefix DCJs, and signed prefix DCJs;(2) two polynomial-time algorithms for sorting by prefix DCJs, both in the signed case (which answers an open question of Labarre [1]) and in the unsigned case;(3) a 1-absolute approximation algorithm for sorting by unsigned prefix reversals for a specific class of permutations.
Information is everywhere, especially in the digital, artificial intelligence, and big data worlds we live in. In fact, information has always played a pivotal role;however, that role is, as the years of history accum...
详细信息
Information is everywhere, especially in the digital, artificial intelligence, and big data worlds we live in. In fact, information has always played a pivotal role;however, that role is, as the years of history accumulate, becoming even more significant. It is, therefore, a pursuit of scientific inquiry to quantify the functionality and semantics of information-this is also the goal of the article one reads. We have constructively and critically reviewed state-of-the-art approaches, presented challenges, and suggested a new approach that deals with the issues of information quantification. The developed approach represents a method for general quantification of functional information, including the total functional information of a system and the semantics revealed by functionality. Such a general method can potentially have significance far beyond the shores of information quantification, especially considering the importance of information in computer and information science, quantum physics, and chemistry. We have also made first steps of placing functional information in a computational complexity framework, which will potentially foster algorithmics around it, especially in terms of optimality or degeneracy, and possibly even in terms of work around classes of computational complexity.
In this article, we focus on the use of mental tools of computational thinking (CT) to solve selected problems in school mathematics. We suggest how to expand and enrich some of the traditional school mathematics topi...
详细信息
暂无评论