101,853 research outputs found
Further evidence of the synonymy between Branchipus schaefferi Fisher, 1834 and B. visnyai Kertés, 1956 (Crustacea, Anostraca)
A RAPD, AFLP and SSR linkage map, and QTL analysis in European beech (Fagus sylvatica L.)
The genetic linkage map of European beech
(Fagus sylvatica L.) that we report here is the first to our
knowledge. Based on a total of 312 markers (28 RAPDs,
274 AFLPs, 10 SSRs) scored in 143 individuals from a F1
full-sib family. Two maps (one for each parent) were
constructed according to a “two-way pseudo-testcross”
mapping strategy. In the male map 119 markers could be
clustered in 11 major groups (971 cM), while in the
female map 132 markers were distributed in 12 major
linkage groups (844 cM). In addition, four and one minor
linkage groups (doublets and triplets) were obtained for
the male and female map respectively. The two maps
cover about 82% and 78% of the genome. Based on the
position of 15 AFLP and 2 SSR loci segregating in both
parents, seven homologous linkage groups could be
identified. In the same pedigree we investigated the
association with genetic markers of several quantitative
traits: leaf area, leaf number and shape in 2 different
years, specific leaf area, leaf carbon-isotope discrimination
and tree height. A composite interval-mapping
approach was used to estimate the number of QTLs, the
amount of variation explained by each of them, and their
position on the genetic linkage maps. Eight QTLs
associated with leaf traits were found that explained
between 15% and 35% of the trait variation, five on the
female map and three on the male map
Erratum: A RAPD, AFLP and SSR linkage map, and QTL analysis in European beech (Fagus sylvatica L.) (Theoretical and Applied Genetics (2003) DOI:10.1007/S00122-003-1461-3)
COLONISATION, GENE FREQUENCIES AND ENZYME ACTIVITY AT GPI LOCUS OF BALANUS AMPHITRITE (CIRRIPEDIA: THORACICA) IN THE LAGOON OF VENICE
Bibliographie Hilarion G. Petzold 1958 – 2009 mit Anhang als Einführung
Dieses Archiv enthält die Gesamtbibliographie der Werke des Autors nebst einiger Texte „Über H. G. Petzold“ im Schlussteil der Bibliographie sowie einen Anhang mit einer Einführung in die Architektur des Werkes in seinem wissenslogischen Aufbau als Ausarbeitung seines „Tree of Science Modells“ (2007).This archive contains the complete bibliography of the author and some texts about H. G. Petzold, moreover an epilogue with an introduction to the architecture of the works in its epistemological structure and composition and as an elaborations of Petzold’s „Tree of Science Modell (2007).https://www.fpi-publikation.de/polyloge/01-2009-petzold-h-g-gesamtbibliographie-h-g-petzold-1958-2009-updating-november2009/peerReviewedpublishedVersio
Dispelling the Myths Behind First-author Citation Counts
We conducted a full-scale evaluative citation analysis study of scholars in the XML research field to explore just how different from each other author rankings resulting from different citation counting methods actually are, and to demonstrate the capability of emerging data and tools on the Web in supporting more realistic citation counting methods. Our results contest some common arguments for the continued
use of first-author citation counts in the evaluation of scholars, such as high correlations between author rankings by first-author citation counts and other citation
counting methods, and high costs of using more realistic citation counting methods that are not well-supported by the ISI databases. It is argued that increasingly available digital full text research papers make it possible for citation analysis studies to go beyond what the ISI databases have directly supported and to employ more
sophisticated methods
Recommended from our members
3346: Samuel G. Freedman, author, 2013
Photograph of author Samuel G. Freedman, at NT Daily Slash meeting in the Mayborn School of Journalism at UNT
The Right to Strike under the United States Constitution: Theory, Practice, and Possible Implications for Canada
Answering critics of the Canadian Supreme Court's judgment in B.C. Health, the author argues that the Court laid the foundation for a principled and durable doctrine protecting constitutional labour rights, one that goes directly to the heart of the matter — the inequality of workers’ power in the employment relation. In the author’s view, two paths could lead from B.C. Health to the recognition of Charter protec- tion for a right to strike: one that treats the right as an accessory to col- lective bargaining, and one that upholds the right directly on the basis of the Charter values of equality and participation. The author supports the latter approach, contending that constitutional rights should be defined in relation to fundamental values, in a way that is not contingent on time-bound or fact-sensitive assessments about the role of strikes within a particular collective bargaining regime. Although a Charter right to strike may involve the courts in difficult choices about when to defer to legislative policy decisions, and courts may lack the institutional capac- ity to deal effectively with labour law issues, the author points out that judges can look to ILO standards for expert guidance. Noting that the U.S. experience in this area might be of considerable use to Canadians, the author concludes by providing an overview of American case law concerning a constitutional right to strike.Peer reviewe
G-Rank: Unsupervised Continuous Learn-to-Rank for Edge Devices in a P2P Network
Ranking algorithms in traditional search engines are powered by enormous training data sets that are meticulously engineered and curated by a centralized entity. Decentralized peer-to-peer (p2p) networks such as torrenting applications and Web3 protocols deliberately eschew centralized databases and computational architectures when designing services and features. As such, robust search-and-rank algorithms designed for such domains must be engineered specifically for decentralized networks, and must be lightweight enough to operate on consumer-grade personal devices such as a smartphone or laptop computer. We introduce G-Rank, an unsupervised ranking algorithm designed exclusively for decentralized networks. We demonstrate that accurate, relevant ranking results can be achieved in fully decentralized networks without any centralized data aggregation, feature engineering, or model training. Furthermore, we show that such results are obtainable with minimal data preprocessing and computational overhead, and can still return highly relevant results even when a user’s device is disconnected from the network. G-Rank is highly modular in design, is not limited to categorical data, and can be implemented in a variety of domains with minimal modification. The results herein show that unsupervised ranking models designed for decentralized p2p networks are not only viable, but worthy of further research.https://github.com/awrgold/G-RankComputer Scienc
- …
