text:
% This file was created with JabRef 2.3b2.
% Encoding: Cp1252

@ARTICLE{Boffelli03,
  author = {Markus Bauer and Gunnar W Klau and Knut Reinert},
  title = {{Accurate multiple sequence-structure alignment of RNA sequences
    using combinatorial optimization.}},
  journal = {BMC Bioinformatics},
  year = {2007},
  volume = {8},
  pages = {271},
  abstract = {BACKGROUND: The discovery of functional non-coding RNA sequences has
    led to an increasing interest in algorithms related to RNA analysis.
    Traditional sequence alignment algorithms, however, fail at computing
    reliable alignments of low-homology RNA sequences. The spatial conformation
    of RNA sequences largely determines their function, and therefore
    RNA alignment algorithms have to take structural information into
    account. RESULTS: We present a graph-based representation for sequence-structure
    alignments, which we model as an integer linear program (ILP). We
    sketch how we compute an optimal or near-optimal solution to the
    ILP using methods from combinatorial optimization, and present results
    on a recently published benchmark set for RNA alignments. CONCLUSION:
    The implementation of our algorithm yields better alignments in terms
    of two published scores than the other programs that we tested: This
    is especially the case with an increasing number of input sequences.
    Our program LARA is freely available for academic purposes from http://www.planet-lisa.net.},
  doi = {10.1186/1471-2105-8-271},
  institution = {Department of Mathematics and Computer Science, Free University Berlin,
    Berlin, Germany. mbauer@inf.fu-berlin.de},
  keywords = {Algorithms; Computer Simulation; Linear Models; Models, Chemical;
    Models, Genetic; RNA; Sensitivity and Specificity; Sequence Alignment;
    Sequence Analysis, RNA; Sequence Homology, Nucleic Acid},
  owner = {binf007},
  pii = {1471-2105-8-271},
  pmid = {17662141},
  timestamp = {2008.01.21},
  url = {http://dx.doi.org/10.1186/1471-2105-8-271}
}

@ARTICLE{Bag01,
  author = {Joachim Friedrich and Thomas Dandekar and Matthias Wolf and Tobias
    Müller},
  title = {{ProfDist: a tool for the construction of large phylogenetic trees
    based on profile distances.}},
  journal = {Bionformatics},
  year = {2005},
  volume = {21},
  pages = {2108--2109},
  number = {9},
  month = {May},
  abstract = {SUMMARY: ProfDist is a user-friendly software package using the profile-neighbor-joining
    method (PNJ) in inferring phylogenies based on profile distances
    on DNA or RNA sequences. It is a tool for reconstructing and visualizing
    large phylogenetic trees providing new and standard features with
    a special focus on time efficency, robustness and accuracy. AVAILABILITY:
    A Windows version of ProfDist comes with a graphical user interface
    and is freely available at http://profdist.bioapps.biozentrum.uni-wuerzburg.de},
  doi = {10.1093/bioinformatics/bti289},
  institution = {Department of Bioinformatics, Biocenter, University of Würzburg,
    Germany.},
  keywords = {Algorithms; Chromosome Mapping; DNA Mutational Analysis; Gene Expression
    Profiling; Linkage Disequilibrium; Phylogeny; Sequence Alignment;
    Sequence Analysis, DNA; Software; User-Computer Interface},
  owner = {binf007},
  pii = {bti289},
  pmid = {15677706},
  timestamp = {2008.01.21},
  url = {http://dx.doi.org/10.1093/bioinformatics/bti289}
}

@ARTICLE{Gascuel1997,
  author = {O. Gascuel},
  title = {{BIONJ: an improved version of the NJ algorithm based on a simple
    model of sequence data.}},
  journal = {Mol Biol Evol},
  year = {1997},
  volume = {14},
  pages = {685--695},
  number = {7},
  month = {Jul},
  abstract = {We propose an improved version of the neighbor-joining (NJ) algorithm
    of Saitou and Nei. This new algorithm, BIONJ, follows the same agglomerative
    scheme as NJ, which consists of iteratively picking a pair of taxa,
    creating a new mode which represents the cluster of these taxa, and
    reducing the distance matrix by replacing both taxa by this node.
    Moreover, BIONJ uses a simple first-order model of the variances
    and covariances of evolutionary distance estimates. This model is
    well adapted when these estimates are obtained from aligned sequences.
    At each step it permits the selection, from the class of admissible
    reductions, of the reduction which minimizes the variance of the
    new distance matrix. In this way, we obtain better estimates to choose
    the pair of taxa to be agglomerated during the next steps. Moreover,
    in comparison with NJ's estimates, these estimates become better
    and better as the algorithm proceeds. BIONJ retains the good properties
    of NJ--especially its low run time. Computer simulations have been
    performed with 12-taxon model trees to determine BIONJ's efficiency.
    When the substitution rates are low (maximum pairwise divergence
    approximately 0.1 substitutions per site) or when they are constant
    among lineages, BIONJ is only slightly better than NJ. When the substitution
    rates are higher and vary among lineages,BIONJ clearly has better
    topological accuracy. In the latter case, for the model trees and
    the conditions of evolution tested, the topological error reduction
    is on the average around 20\%. With highly-varying-rate trees and
    with high substitution rates (maximum pairwise divergence approximately
    1.0 substitutions per site), the error reduction may even rise above
    50\%, while the probability of finding the correct tree may be augmented
    by as much as 15\%.},
  institution = {GERAD, Ecole des HEC, Montreal, Quebec, Canada. gascuel@lirmm.fr},
  keywords = {Algorithms; Evolution; Models, Biological; Phylogeny; Sequence Analysis;
    Software},
  owner = {binf007},
  pmid = {9254330},
  timestamp = {2008.01.21}
}

@ARTICLE{Gerlach2007,
  author = {Daniel Gerlach and Matthias Wolf and Thomas Dandekar and Tobias Müller
    and Andreas Pokorny and Sven Rahmann},
  title = {{Deep metazoan phylogeny.}},
  journal = {In Silico Biol},
  year = {2007},
  volume = {7},
  pages = {151--154},
  number = {2},
  abstract = {We reconstructed a robust phylogenetic tree of the Metazoa, consisting
    of almost 1,500 taxa, by profile neighbor joining (PNJ), an automated
    computational method that inherits the efficiency of the neighbor
    joining algorithm. This tree supports the one proposed in the latest
    review on metazoan phylogeny. Our main goal is not to discuss aspects
    of the phylogeny itself, but rather to point out that PNJ can be
    a valuable tool when the basal branching pattern of a large phylogenetic
    tree must be estimated, whereas traditional methods would be computationally
    impractical.},
  institution = {Department of Bioinformatics, Biocenter, University of Würzburg,
    Am Hubland, D-97074 Würzburg, Germany.},
  keywords = {Algorithms; Animals; Computational Biology; Models, Genetic; Phylogeny;
    RNA, Ribosomal, 18S},
  owner = {binf007},
  pii = {2007070015},
  pmid = {17688440},
  timestamp = {2008.01.21}
}

@ARTICLE{Grajales2007,
  author = {Alejandro Grajales and Catalina Aguilar and Juan A Sánchez},
  title = {Phylogenetic reconstruction using secondary structures of Internal
    Transcribed Spacer 2 (ITS2, rDNA): finding the molecular and morphological
    gap in Caribbean gorgonian corals.},
  journal = {BMC Evol Biol},
  year = {2007},
  volume = {7},
  pages = {90},
  abstract = {BACKGROUND: Most phylogenetic studies using current methods have focused
    on primary DNA sequence information. However, RNA secondary structures
    are particularly useful in systematics because they include characteristics,
    not found in the primary sequence, that give "morphological" information.
    Despite the number of recent molecular studies on octocorals, there
    is no consensus opinion about a region that carries enough phylogenetic
    resolution to solve intrageneric or close species relationships.
    Moreover, intrageneric morphological information by itself does not
    always produce accurate phylogenies; intra-species comparisons can
    reveal greater differences than intra-generic ones. The search for
    new phylogenetic approaches, such as by RNA secondary structure analysis,
    is therefore a priority in octocoral research. RESULTS: Initially,
    twelve predicted RNA secondary structures were reconstructed to provide
    the basic information for phylogenetic analyses; they accorded with
    the 6 helicoidal ring model, also present in other groups of corals
    and eukaryotes. We obtained three similar topologies for nine species
    of the Caribbean gorgonian genus Eunicea (candelabrum corals) with
    two sister taxa as outgroups (genera Plexaura and Pseudoplexaura)
    on the basis of molecular morphometrics of ITS2 RNA secondary structures
    only, traditional primary sequence analyses and maximum likelihood,
    and a Bayesian analysis of the combined data. The latter approach
    allowed us to include both primary sequence and RNA molecular morphometrics;
    each data partition was allowed to have a different evolution rate.
    In addition, each helix was partitioned as if it had evolved at a
    distinct rate. Plexaura flexuosa was found to group within Eunicea;
    this was best supported by both the molecular morphometrics and combined
    analyses. We suggest Eunicea flexuosa (Lamouroux, 1821) comb. nov.,
    and we present a new species description including Scanning Electron
    Microscopy (SEM) images of morphological characteristics (sclerites).
    Eunicea flexuosa, E. pallida, E. laxispica and E. mammosa formed
    a separate clade in the molecular phylogenies, and were reciprocally
    monophyletic with respect to other Eunicea (Euniceopsis subgenus,
    e.g. E. tourneforti and E. laciniata) in the molecular morphometrics
    tree, with the exception of E. fusca. Moreover, we suggest a new
    diagnostic character for Eunicea, also present in E. flexuosa: middle
    layer sclerites > 1 mm in length. CONCLUSION: ITS2 was a reliable
    sequence for intrageneric studies in gorgonian octocorals because
    of the amount of phylogenetic signal, and was corroborated against
    morphological characters separating Eunicea from Plexaura. The ITS2
    RNA secondary structure approach to phylogeny presented here did
    not rely on alignment methods such as INDELS, but provided clearly
    homologous characters for partition analysis and RNA molecular morphometrics.
    These approaches support the divergence of Eunicea flexuosa comb.
    nov. from the outgroup Plexaura, although it has been considered
    part of this outgroup for nearly two centuries because of morphological
    resemblance.},
  doi = {10.1186/1471-2148-7-90},
  institution = {>},
  keywords = {Animals; Anthozoa; DNA, Ribosomal Spacer; Evolution, Molecular; Genetic
    Speciation; Nucleic Acid Conformation; Phylogeny; RNA, Ribosomal;
    Variation (Genetics)},
  owner = {binf007},
  pii = {1471-2148-7-90},
  pmid = {17562014},
  timestamp = {2008.07.30},
  url = {http://dx.doi.org/10.1186/1471-2148-7-90}
}

@ARTICLE{Hochsmann2004,
  author = {Hochsmann, M. and Hochsmann, M. and Voss, B. and Giegerich, R.},
  title = {{Pure multiple RNA secondary structure alignments: a progressive
    profile approach}},
  journal = {IEEE/ACM Transactions on Computational Biology and Bioinformatics},
  year = {2004},
  volume = {1},
  pages = {53--62},
  number = {1},
  abstract = {In functional, noncoding RNA, structure is often essential to function.
    While the full 3D structure is very difficult to determine, the 2D
    structure of an RNA molecule gives good clues to its 3D structure,
    and for molecules of moderate length, it can be predicted with good
    reliability. Structure comparison is, in analogy to sequence comparison,
    the essential technique to infer related function. We provide a method
    for computing multiple alignments of RNA secondary structures under
    the tree alignment model, which is suitable to cluster RNA molecules
    purely on the structural level, i.e., sequence similarity is not
    required. We give a systematic generalization of the profile alignment
    method from strings to trees and forests. We introduce a tree profile
    representation of RNA secondary structure alignments which allows
    reasonable scoring in structure comparison. Besides the technical
    aspects, an RNA profile is a useful data structure to represent multiple
    structures of RNA sequences. Moreover, we propose a visualization
    of RNA consensus structures that is enriched by the full sequence
    information.},
  booktitle = {IEEE/ACM Transactions on Computational Biology and Bioinformatics},
  doi = {10.1109/TCBB.2004.11},
  editor = {Voss, B.},
  issn = {1545-5963},
  keywords = {biology computing, macromolecules, molecular biophysics, trees (mathematics),
    forest alignment, functional noncoding RNA structure, progressive
    profile approach, pure multiple RNA secondary structure alignments,
    strings, structure comparison, tree alignment model, tree profile
    representation, 65, Index Terms- Alignment of trees, RNA secondary
    structures, noncoding RNAs.},
  owner = {binf007},
  timestamp = {2008.01.23}
}

@ARTICLE{Hudelot2003,
  author = {Cendrine Hudelot and Vivek Gowri-Shankar and Howsun Jow and Magnus
    Rattray and Paul G Higgs},
  title = {{RNA-based phylogenetic methods: application to mammalian mitochondrial
    RNA sequences.}},
  journal = {Mol Phylogenet Evol},
  year = {2003},
  volume = {28},
  pages = {241--252},
  number = {2},
  month = {Aug},
  abstract = {The PHASE software package allows phylogenetic tree construction with
    a number of evolutionary models designed specifically for use with
    RNA sequences that have conserved secondary structure. Evolution
    in the paired regions of RNAs occurs via compensatory substitutions,
    hence changes on either side of a pair are correlated. Accounting
    for this correlation is important for phylogenetic inference because
    it affects the likelihood calculation. In the present study we use
    the complete set of tRNA and rRNA sequences from 69 complete mammalian
    mitochondrial genomes. The likelihood calculation uses two evolutionary
    models simultaneously for different parts of the sequence: a paired-site
    model for the paired sites and a single-site model for the unpaired
    sites. We use Bayesian phylogenetic methods and a Markov chain Monte
    Carlo algorithm is used to obtain the most probable trees and posterior
    probabilities of clades. The results are well resolved for almost
    all the important branches on the mammalian tree. They support the
    arrangement of mammalian orders within the four supra-ordinal clades
    that have been identified by studies of much larger data sets mainly
    comprising nuclear genes. Groups such as the hedgehogs and the murid
    rodents, which have been problematic in previous studies with mitochondrial
    proteins, appear in their expected position with the other members
    of their order. Our choice of genes and evolutionary model appears
    to be more reliable and less subject to biases caused by variation
    in base composition than previous studies with mitochondrial genomes.},
  institution = {School of Biological Sciences, University of Manchester, UK.},
  keywords = {Animals; Bayes Theorem; Mammals; Models, Genetic; Phylogeny; RNA},
  owner = {binf007},
  pii = {S1055790303000617},
  pmid = {12878461},
  timestamp = {2008.01.21}
}

@ARTICLE{Jow2002,
  author = {H. Jow and C. Hudelot and M. Rattray and P. G. Higgs},
  title = {Bayesian phylogenetics using an RNA substitution model applied to
    early mammalian evolution.},
  journal = {Mol Biol Evol},
  year = {2002},
  volume = {19},
  pages = {1591--1601},
  number = {9},
  month = {Sep},
  abstract = {We study the phylogeny of the placental mammals using molecular data
    from all mitochondrial tRNAs and rRNAs of 54 species. We use probabilistic
    substitution models specific to evolution in base paired regions
    of RNA. A number of these models have been implemented in a new phylogenetic
    inference software package for carrying out maximum likelihood and
    Bayesian phylogenetic inferences. We describe our Bayesian phylogenetic
    method which uses a Markov chain Monte Carlo algorithm to provide
    samples from the posterior distribution of tree topologies. Our results
    show support for four primary mammalian clades, in agreement with
    recent studies of much larger data sets mainly comprising nuclear
    DNA. We discuss some issues arising when using Bayesian techniques
    on RNA sequence data.},
  institution = {Department of Computer Science, University of Manchester, UK.},
  keywords = {Animals; Base Sequence; Bayes Theorem; Databases, Genetic; Evolution,
    Molecular; Humans; Mammals; Models, Genetic; Phylogeny; RNA; Species
    Specificity},
  owner = {binf007},
  pmid = {12200486},
  timestamp = {2008.06.06}
}

@INCOLLECTION{Jukes69,
  author = {Jukes, T. and Cantor, C.R.},
  title = {Evolution of protein molecules},
  booktitle = {Mammalian Protein Metabolism},
  publisher = {Academic Press},
  year = {1969},
  editor = {Munro, H},
  pages = {21-132},
  address = {New York, USA}
}

@ARTICLE{Mueller2004,
  author = {Tobias Müller and Sven Rahmann and Thomas Dandekar and Matthias Wolf},
  title = {{Accurate and robust phylogeny estimation based on profile distances:
    a study of the Chlorophyceae (Chlorophyta).}},
  journal = {BMC Evol Biol},
  year = {2004},
  volume = {4},
  pages = {20},
  month = {Jun},
  abstract = {BACKGROUND: In phylogenetic analysis we face the problem that several
    subclade topologies are known or easily inferred and well supported
    by bootstrap analysis, but basal branching patterns cannot be unambiguously
    estimated by the usual methods (maximum parsimony (MP), neighbor-joining
    (NJ), or maximum likelihood (ML)), nor are they well supported. We
    represent each subclade by a sequence profile and estimate evolutionary
    distances between profiles to obtain a matrix of distances between
    subclades. RESULTS: Our estimator of profile distances generalizes
    the maximum likelihood estimator of sequence distances. The basal
    branching pattern can be estimated by any distance-based method,
    such as neighbor-joining. Our method (profile neighbor-joining, PNJ)
    then inherits the accuracy and robustness of profiles and the time
    efficiency of neighbor-joining. CONCLUSIONS: Phylogenetic analysis
    of Chlorophyceae with traditional methods (MP, NJ, ML and MrBayes)
    reveals seven well supported subclades, but the methods disagree
    on the basal branching pattern. The tree reconstructed by our method
    is better supported and can be confirmed by known morphological characters.
    Moreover the accuracy is significantly improved as shown by parametric
    bootstrap.},
  doi = {10.1186/1471-2148-4-20},
  institution = {Department of Bioinformatics, Biocenter, University of Würzburg,
    Am Hubland, D-97074 Würzburg, Germany. tobias.mueller@biozentrum.uni-wuerzburg.de},
  keywords = {Algae, Green; Animals; Computational Biology; Evolution, Molecular;
    Models, Genetic; Phylogeny; RNA, Plant; RNA, Ribosomal; RNA, Ribosomal,
    18S},
  owner = {binf007},
  pii = {1471-2148-4-20},
  pmid = {15222898},
  timestamp = {2008.01.21},
  url = {http://dx.doi.org/10.1186/1471-2148-4-20}
}

@ARTICLE{Mueller2002,
  author = {Tobias Müller and Rainer Spang and Martin Vingron},
  title = {{Estimating amino acid substitution models: a comparison of Dayhoff's
    estimator, the resolvent approach and a maximum likelihood method.}},
  journal = {Mol Biol Evol},
  year = {2002},
  volume = {19},
  pages = {8--13},
  number = {1},
  month = {Jan},
  abstract = {Evolution of proteins is generally modeled as a Markov process acting
    on each site of the sequence. Replacement frequencies need to be
    estimated based on sequence alignments. Here we compare three approaches:
    First, the original method by Dayhoff, Schwartz, and Orcutt (1978)
    Atlas Protein Seq. Struc. 5:345-352, secondly, the resolvent method
    (RV) by Müller and Vingron (2000) J. Comput. Biol. 7(6):761-776,
    and finally a maximum likelihood approach (ML) developed in this
    paper. We evaluate the methods using a highly divergent and inhomogeneous
    set of sequence alignments as an input to the estimation procedure.
    ML is the method of choice for small sets of input data. Although
    the RV method is computationally much less demanding it performs
    only slightly worse than ML. Therefore, it is perfectly appropriate
    for large-scale applications.},
  institution = {Deutsches Krebsforschungszentrum, Theoretische Bioinformatik, Im
    Neuenheimer Feld 280, 69120 Heidelberg, Germany. t.mueller@dkfz.de},
  keywords = {Algorithms; Amino Acid Sequence; Amino Acid Substitution; Computer
    Simulation; Evolution, Molecular; Likelihood Functions; Markov Chains;
    Models, Genetic; Proteins; Sequence Alignment},
  owner = {binf007},
  pmid = {11752185},
  timestamp = {2008.01.25}
}

@ARTICLE{Mueller2000,
  author = {T. Müller and M. Vingron},
  title = {{Modeling amino acid replacement.}},
  journal = {J Comput Biol},
  year = {2000},
  volume = {7},
  pages = {761--776},
  number = {6},
  abstract = {The estimation of amino acid replacement frequencies during molecular
    evolution is crucial for many applications in sequence analysis.
    Score matrices for database search programs or phylogenetic analysis
    rely on such models of protein evolution. Pioneering work was done
    by Dayhoff et al. (1978) who formulated a Markov model of evolution
    and derived the famous PAM score matrices. Her estimation procedure
    for amino acid exchange frequencies is restricted to pairs of proteins
    that have a constant and small degree of divergence. Here we present
    an improved estimator, called the resolvent method, that is not subject
    to these limitations. This extension of Dayhoff's approach enables
    us to estimate an amino acid substitution model from alignments of
    varying degree of divergence. Extensive simulations show the capability
    of the new estimator to recover accurately the exchange frequencies
    among amino acids. Based on the SYSTERS database of aligned protein
    families (Krause and Vingron, 1998) we recompute a series of score
    matrices.},
  doi = {10.1089/10665270050514918},
  institution = {Deutsches Krebsforschungszentrum, Theoretische Bioinformatik, 69120
    Heidelberg, Germany. t.mueller/m.vingron},
  keywords = {Amino Acid Substitution; Computer Simulation; Evolution, Molecular;
    Likelihood Functions; Markov Chains; Models, Biological; Proteins;
    Stochastic Processes; Time Factors},
  owner = {binf007},
  pmid = {11382360},
  timestamp = {2008.01.25},
  url = {http://dx.doi.org/10.1089/10665270050514918}
}

@INCOLLECTION{Buch2006,
  author = {Sven Rahmann and Tobias Muller and Thomas Dandekar and Matthias Wolf},
  title = {{Efficient and robust analysis of large phylogenetic datasets}},
  booktitle = {Advanced Data Mining Technologies in Bioinformatics},
  publisher = {Idea Group, Inc.},
  year = {2006},
  editor = {Hui-Huang Hsu},
  pages = {104-117},
  address = {Hershey, PA, USA},
  abstract = {The goal of phylogenetics is to reconstruct ancestral relationships
    between different taxa, e.g., different species in the tree of life,
    by means of certain characters, such as genomic sequences. We consider
    the prominent problem of reconstructing the basal phylogenetic tree
    topology when several subclades have already been identified or are
    well known by other means, such as morphological characteristics.
    Whereas most available tools attempt to estimate a fully resolved
    tree from scratch, the profile neighbor-joining (PNJ) method focuses
    directly on the mentioned problem and has proven a robust and efficient
    method for large-scale data sets, especially when used in an iterative
    way. We describe an implementation of this idea, the ProfDist software
    package, which is freely available, and apply the method to estimate
    the phylogeny of the eukaryotes. Overall, the PNJ approach provides
    a novel effective way to mine large sequence datasets for relevant
    phylogenetic information.}
}

@ARTICLE{Saitou1987,
  author = {N. Saitou and M. Nei},
  title = {{The neighbor-joining method: a new method for reconstructing phylogenetic
    trees.}},
  journal = {Mol Biol Evol},
  year = {1987},
  volume = {4},
  pages = {406--425},
  number = {4},
  month = {Jul},
  abstract = {A new method called the neighbor-joining method is proposed for reconstructing
    phylogenetic trees from evolutionary distance data. The principle
    of this method is to find pairs of operational taxonomic units (OTUs
    [= neighbors]) that minimize the total branch length at each stage
    of clustering of OTUs starting with a starlike tree. The branch lengths
    as well as the topology of a parsimonious tree can quickly be obtained
    by using this method. Using computer simulation, we studied the efficiency
    of this method in obtaining the correct unrooted tree in comparison
    with that of five other tree-making methods: the unweighted pair
    group method of analysis, Farris's method, Sattath and Tversky's
    method, Li's method, and Tateno et al.'s modified Farris method.
    The new, neighbor-joining method and Sattath and Tversky's method
    are shown to be generally better than the other methods.},
  institution = {Center for Demographic and Population Genetics, University of Texas
    Health Science Center, Houston 77225.},
  keywords = {Animals; Biometry; Evolution; Models, Genetic; Phylogeny; Ranidae},
  owner = {binf007},
  pmid = {3447015},
  timestamp = {2008.01.21}
}

@ARTICLE{Schultz2005,
  author = {Jörg Schultz and Stefanie Maisel and Daniel Gerlach and Tobias Müller
    and Matthias Wolf},
  title = {{A common core of secondary structure of the internal transcribed
    spacer 2 (ITS2) throughout the Eukaryota.}},
  journal = {RNA},
  year = {2005},
  volume = {11},
  pages = {361--364},
  number = {4},
  month = {Apr},
  abstract = {The ongoing characterization of novel species creates the need for
    a molecular marker which can be used for species- and, simultaneously,
    for mega-systematics. Recently, the use of the internal transcribed
    spacer 2 (ITS2) sequence was suggested, as it shows a high divergence
    in sequence with an assumed conservation in structure. This hypothesis
    was mainly based on small-scale analyses, comparing a limited number
    of sequences. Here, we report a large-scale analysis of more than
    54,000 currently known ITS2 sequences with the goal to evaluate the
    hypothesis of a conserved structural core and to assess its use for
    automated large-scale phylogenetics. Structure prediction revealed
    that the previously described core structure can be found for more
    than 5000 sequences in a wide variety of taxa within the eukaryotes,
    indicating that the core secondary structure is indeed conserved.
    This conserved structure allowed an automated alignment of extremely
    divergent sequences as exemplified for the ITS2 sequences of a ctenophorean
    eumetazoon and a volvocalean green alga. All classified sequences,
    together with their structures can be accessed at http://www.biozentrum.uni-wuerzburg.de/bioinformatik/projects/ITS2.html.
    Furthermore, we found that, although sample sequences are known for
    most major taxa, there exists a profound divergence in coverage,
    which might become a hindrance for general usage. In summary, our
    analysis strengthens the potential of ITS2 as a general phylogenetic
    marker and provides a data source for further ITS2-based analyses.},
  doi = {10.1261/rna.7204505},
  institution = {entrum.uni-wuerzburg.de},
  keywords = {Algae; Animals; Base Sequence; Conserved Sequence; DNA, Ribosomal
    Spacer; Fungi; Genetic Markers; Invertebrates; Molecular Sequence
    Data; Nucleic Acid Conformation; Phylogeny; Plants; Sequence Alignment;
    Transcription, Genetic},
  owner = {binf007},
  pii = {11/4/361},
  pmid = {15769870},
  timestamp = {2008.01.21},
  url = {http://dx.doi.org/10.1261/rna.7204505}
}

@ARTICLE{Schultz2006,
  author = {Jörg Schultz and Tobias Müller and Marco Achtziger and Philipp N
    Seibel and Thomas Dandekar and Matthias Wolf},
  title = {{The internal transcribed spacer 2 database--a web server for (not
    only) low level phylogenetic analyses.}},
  journal = {Nucleic Acids Res},
  year = {2006},
  volume = {34},
  pages = {W704--W707},
  number = {Web Server issue},
  month = {Jul},
  abstract = {The internal transcribed spacer 2 (ITS2) is a phylogenetic marker
    which has been of broad use in generic and infrageneric level classifications,
    as its sequence evolves comparably fast. Only recently, it became
    clear, that the ITS2 might be useful even for higher level systematic
    analyses. As the secondary structure is highly conserved within all
    eukaryotes it serves as a valuable template for the construction
    of highly reliable sequence-structure alignments, which build a fundament
    for subsequent analyses. Thus, any phylogenetic study using ITS2
    has to consider both sequence and structure. We have integrated a
    homology based RNA structure prediction algorithm into a web server,
    which allows the detection and secondary structure prediction for
    ITS2 in any given sequence. Furthermore, the resource contains more
    than 25,000 pre-calculated secondary structures for the currently
    known ITS2 sequences. These can be taxonomically searched and browsed.
    Thus, our resource could become a starting point for ITS2-based phylogenetic
    analyses and is therefore complementary to databases of other phylogenetic
    markers, which focus on higher level analyses. The current version
    of the ITS2 database can be accessed via http://its2.bioapps.biozentrum.uni-wuerzburg.de.},
  doi = {10.1093/nar/gkl129},
  institution = {Department of Bioinformatics, Biocenter, University of Würzburg Am
    Hubland, 97074 Würzburg, Germany. Joerg.Schultz@biozentrum.uni-wuerzburg.de},
  keywords = {DNA, Ribosomal Spacer; Databases, Nucleic Acid; Internet; Nucleic
    Acid Conformation; Phylogeny; Sequence Analysis, RNA; Software; User-Computer
    Interface},
  owner = {binf007},
  pii = {34/suppl_2/W704},
  pmid = {16845103},
  timestamp = {2008.01.21},
  url = {http://dx.doi.org/10.1093/nar/gkl129}
}

@ARTICLE{Schoeniger1994,
  author = {M. Schöniger and A. von Haeseler},
  title = {{A stochastic model for the evolution of autocorrelated DNA sequences.}},
  journal = {Mol Phylogenet Evol},
  year = {1994},
  volume = {3},
  pages = {240--247},
  number = {3},
  month = {Sep},
  abstract = {Currently used stochastic models of DNA sequence evolution assume
    independent and identically distributed nucleotide sites. They are
    too simple to account for dependence structures obviously present
    in molecular data. Up to now more realistic stochastic models for
    nucleotide substitutions have been considered intractable. In this
    paper a procedure that accounts for non-overlapping correlations
    among pairs of sites of a DNA sequence is developed. We show that
    currently used models that ignore correlated sites underestimate
    distances inferred from observed sequence dissimilarities. For the
    analyzed mitochondrial sequence data this underestimation is not
    drastic in contrast to paired regions (stems) of bacterial 23S rRNA
    sequences.},
  doi = {10.1006/mpev.1994.1026},
  institution = {Technical University Munich, Germany.},
  keywords = {Animals; DNA; DNA, Mitochondrial; Evolution; Mammals; Markov Chains;
    Mutation; RNA, Bacterial; RNA, Ribosomal, 23S; Species Specificity;
    Stochastic Processes},
  owner = {binf007},
  pii = {S1055-7903(84)71026-8},
  pmid = {7529616},
  timestamp = {2008.01.25},
  url = {http://dx.doi.org/10.1006/mpev.1994.1026}
}

@ARTICLE{Seibel2006,
  author = {Philipp N Seibel and Tobias Müller and Thomas Dandekar and Jörg Schultz
    and Matthias Wolf},
  title = {{4SALE--a tool for synchronous RNA sequence and secondary structure
    alignment and editing.}},
  journal = {BMC Bioinformatics},
  year = {2006},
  volume = {7},
  pages = {498},
  abstract = {BACKGROUND: In sequence analysis the multiple alignment builds the
    fundament of all proceeding analyses. Errors in an alignment could
    strongly influence all succeeding analyses and therefore could lead
    to wrong predictions. Hand-crafted and hand-improved alignments are
    necessary and meanwhile good common practice. For RNA sequences often
    the primary sequence as well as a secondary structure consensus is
    well known, e.g., the cloverleaf structure of the t-RNA. Recently,
    some alignment editors are proposed that are able to include and
    model both kinds of information. However, with the advent of a large
    amount of reliable RNA sequences together with their solved secondary
    structures (available from e.g. the ITS2 Database), we are faced
    with the problem to handle sequences and their associated secondary
    structures synchronously. RESULTS: 4SALE fills this gap. The application
    allows a fast sequence and synchronous secondary structure alignment
    for large data sets and for the first time synchronous manual editing
    of aligned sequences and their secondary structures. This study describes
    an algorithm for the synchronous alignment of sequences and their
    associated secondary structures as well as the main features of 4SALE
    used for further analyses and editing. 4SALE builds an optimal and
    unique starting point for every RNA sequence and structure analysis.
    CONCLUSION: 4SALE, which provides an user-friendly and intuitive
    interface, is a comprehensive toolbox for RNA analysis based on sequence
    and secondary structure information. The program connects sequence
    and structure databases like the ITS2 Database to phylogeny programs
    as for example the CBCAnalyzer. 4SALE is written in JAVA and therefore
    platform independent. The software is freely available and distributed
    from the website at http://4sale.bioapps.biozentrum.uni-wuerzburg.de.},
  doi = {10.1186/1471-2105-7-498},
  institution = {>},
  keywords = {Algorithms; Base Pairing; Computational Biology; Databases, Genetic;
    Nucleic Acid Conformation; RNA; Sequence Alignment; Sequence Analysis,
    RNA; Software Validation; Time Factors; User-Computer Interface},
  owner = {binf007},
  pii = {1471-2105-7-498},
  pmid = {17101042},
  timestamp = {2008.01.21},
  url = {http://dx.doi.org/10.1186/1471-2105-7-498}
}

@ARTICLE{Selig2008,
  author = {Christian Selig and Matthias Wolf and Tobias Müller and Thomas Dandekar
    and Jörg Schultz},
  title = {{The ITS2 Database II: homology modelling RNA structure for molecular
    systematics.}},
  journal = {Nucleic Acids Res},
  year = {2008},
  volume = {36},
  pages = {D377--D380},
  number = {Database issue},
  month = {Jan},
  abstract = {An increasing number of phylogenetic analyses are based on the internal
    transcribed spacer 2 (ITS2). They mainly use the fast evolving sequence
    for low-level analyses. When considering the highly conserved structure,
    the same marker could also be used for higher level phylogenies.
    Furthermore, structural features of the ITS2 allow distinguishing
    different species from each other. Despite its importance, the correct
    structure is only rarely found by standard RNA folding algorithms.
    To overcome this hindrance for a wider application of the ITS2, we
    have developed a homology modelling approach to predict the structure
    of RNA and present the results of modelling the ITS2 in the ITS2
    Database. Here, we describe the database and the underlying algorithms
    which allowed us to predict the structure for 86 784 sequences, which
    is more than 55\% of all GenBank entries concerning the ITS2. These
    are not equally distributed over all genera. There is a substantial
    amount of genera where the structure of nearly all sequences is predicted
    whereas for others no structure at all was found despite high sequence
    coverage. These genera might have evolved an ITS2 structure diverging
    from the standard one. The current version of the ITS2 Database can
    be accessed via http://its2.bioapps.biozentrum.uni-wuerzburg.de.},
  doi = {10.1093/nar/gkm827},
  institution = {Department of Bioinformatics, Biocenter, University of Würzburg,
    Am Hubland 97074 Würzburg, Germany.},
  owner = {binf007},
  pii = {gkm827},
  pmid = {17933769},
  timestamp = {2008.01.21},
  url = {http://dx.doi.org/10.1093/nar/gkm827}
}

@ARTICLE{Siebert2005,
  author = {Sven Siebert and Rolf Backofen},
  title = {{MARNA: multiple alignment and consensus structure prediction of
    RNAs based on sequence structure comparisons.}},
  journal = {Bioinformatics},
  year = {2005},
  volume = {21},
  pages = {3352--3359},
  number = {16},
  month = {Aug},
  abstract = {MOTIVATION: Due to the importance of considering secondary structures
    in aligning functional RNAs, several pairwise sequence-structure
    alignment methods have been developed. They use extended alignment
    scores that evaluate secondary structure information in addition
    to sequence information. However, two problems for the multiple alignment
    step remain. First, how to combine pairwise sequence-structure alignments
    into a multiple alignment and second, how to generate secondary structure
    information for sequences whose explicit structural information is
    missing. RESULTS: We describe a novel approach for multiple alignment
    of RNAs (MARNA) taking into consideration both the primary and the
    secondary structures. It is based on pairwise sequence-structure
    comparisons of RNAs. From these sequence-structure alignments, libraries
    of weighted alignment edges are generated. The weights reflect the
    sequential and structural conservation. For sequences whose secondary
    structures are missing, the libraries are generated by sampling low
    energy conformations. The libraries are then processed by the T-Coffee
    system, which is a consistency based multiple alignment method. Furthermore,
    we are able to extract a consensus-sequence and -structure from a
    multiple alignment. We have successfully tested MARNA on several
    datasets taken from the Rfam database.},
  doi = {10.1093/bioinformatics/bti550},
  institution = {Department of Bioinformatics, Institute of Computer Science, Friedrich-Schiller-University
    Jena, Ernst-Abbe Platz 2, 07743 Jena, Germany.},
  keywords = {Algorithms; Computer Simulation; Consensus Sequence; RNA; Sensitivity
    and Specificity; Sequence Alignment; Sequence Analysis, RNA; Sequence
    Homology, Nucleic Acid; Software; Structure-Activity Relationship},
  owner = {binf007},
  pii = {bti550},
  pmid = {15972285},
  timestamp = {2008.01.21},
  url = {http://dx.doi.org/10.1093/bioinformatics/bti550}
}

@ARTICLE{Smith2004,
  author = {Andrew D Smith and Thomas W H Lui and Elisabeth R M Tillier},
  title = {{Empirical models for substitution in ribosomal RNA.}},
  journal = {Mol Biol Evol},
  year = {2004},
  volume = {21},
  pages = {419--427},
  number = {3},
  month = {Mar},
  abstract = {Empirical models of substitution are often used in protein sequence
    analysis because the large alphabet of amino acids requires that
    many parameters be estimated in all but the simplest parametric models.
    When information about structure is used in the analysis of substitutions
    in structured RNA, a similar situation occurs. The number of parameters
    necessary to adequately describe the substitution process increases
    in order to model the substitution of paired bases. We have developed
    a method to obtain substitution rate matrices empirically from RNA
    alignments that include structural information in the form of base
    pairs. Our data consisted of alignments from the European Ribosomal
    RNA Database of Bacterial and Eukaryotic Small Subunit and Large
    Subunit Ribosomal RNA ( Wuyts et al. 2001. Nucleic Acids Res. 29:175-177;
    Wuyts et al. 2002. Nucleic Acids Res. 30:183-185). Using secondary
    structural information, we converted each sequence in the alignments
    into a sequence over a 20-symbol code: one symbol for each of the
    four individual bases, and one symbol for each of the 16 ordered
    pairs. Substitutions in the coded sequences are defined in the natural
    way, as observed changes between two sequences at any particular
    site. For given ranges (windows) of sequence divergence, we obtained
    substitution frequency matrices for the coded sequences. Using a
    technique originally developed for modeling amino acid substitutions
    ( Veerassamy, Smith, and Tillier. 2003. J. Comput. Biol. 10:997-1010),
    we were able to estimate the actual evolutionary distance for each
    window. The actual evolutionary distances were used to derive instantaneous
    rate matrices, and from these we selected a universal rate matrix.
    The universal rate matrices were incorporated into the Phylip Software
    package ( Felsenstein 2002. http://evolution.genetics.washington.edu/phylip.html),
    and we analyzed the ribosomal RNA alignments using both distance
    and maximum likelihood methods. The empirical substitution models
    performed well on simulated data, and produced reasonable evolutionary
    trees for 16S ribosomal RNA sequences from sequenced Bacterial genomes.
    Empirical models have the advantage of being easily implemented,
    and the fact that the code consists of 20 symbols makes the models
    easily incorporated into existing programs for protein sequence analysis.
    In addition, the models are useful for simulating the evolution of
    RNA sequence and structure simultaneously.},
  doi = {10.1093/molbev/msh029},
  institution = {Department of Medical Biophysics, University of Toronto, and Ontario
    Cancer Institute, University Health Network, Toronto, Ontario, Canada.},
  keywords = {Amino Acid Substitution; Animals; Computer Simulation; Databases,
    Nucleic Acid; Evolution, Molecular; Likelihood Functions; Models,
    Genetic; Phylogeny; RNA, Ribosomal; Sequence Alignment},
  owner = {binf007},
  pii = {msh029},
  pmid = {14660689},
  timestamp = {2008.01.21},
  url = {http://dx.doi.org/10.1093/molbev/msh029}
}

@MISC{QT,
  author = {Trolltech},
  title = {http://trolltech.com/products/qt/},
  year = {2008},
  owner = {binf007},
  timestamp = {2008.07.19},
  url = {http://trolltech.com/products/qt/}
}

@ARTICLE{Vanormelingen2007,
  author = {P Vanormelingen and E Hegewald and A Braband and M Kitschke and T
    Friedl and K Sabbe and W Vyverman},
  title = {{The systematics of a small spineless Desmodesmus species, D-costato-granulatus
    (Sphaeropleales, Chlorophyceae), based on ITS2 rDNA sequence analyses
    and cell wall morphology}},
  journal = {Journal of Phyclology},
  year = {2007},
  volume = {43},
  pages = {378-396},
  number = {2},
  month = {APR}
}

@ARTICLE{Wheeler2000,
  author = {D. L. Wheeler and C. Chappey and A. E. Lash and D. D. Leipe and T.
    L. Madden and G. D. Schuler and T. A. Tatusova and B. A. Rapp},
  title = {{Database resources of the National Center for Biotechnology Information.}},
  journal = {Nucleic Acids Res},
  year = {2000},
  volume = {28},
  pages = {10--14},
  number = {1},
  month = {Jan},
  abstract = {In addition to maintaining the GenBank(R) nucleic acid sequence database,
    the National Center for Biotechnology Information (NCBI) provides
    data analysis and retrieval and resources that operate on the data
    in GenBank and a variety of other biological data made available
    through NCBI's Web site. NCBI data retrieval resources include Entrez,
    PubMed, LocusLink and the Taxonomy Browser. Data analysis resources
    include BLAST, Electronic PCR, OrfFinder, RefSeq, UniGene, Database
    of Single Nucleotide Polymorphisms (dbSNP), Human Genome Sequencing
    pages, GeneMap'99, Davis Human-Mouse Homology Map, Cancer Chromosome
    Aberration Project (CCAP) pages, Entrez Genomes, Clusters of Orthologous
    Groups (COGs) database, Retroviral Genotyping Tools, Cancer Genome
    Anatomy Project (CGAP) pages, SAGEmap, Online Mendelian Inheritance
    in Man (OMIM) and the Molecular Modeling Database (MMDB). Augmenting
    many of the Web applications are custom implementations of the BLAST
    program optimized to search specialized data sets. All of the resources
    can be accessed through the NCBI home page at: http://www.ncbi.nlm.nih.
    gov},
  institution = {National Center for Biotechnology Information, National Library of
    Medicine, National Institutes of Health, Building 38A, 8600 Rockville
    Pike, Bethesda, MD 20894, USA.},
  keywords = {Animals; Biology; Databases, Factual; Gene Expression; Genome, Human;
    Humans; Information Storage and Retrieval; Mice; Models, Molecular;
    National Library of Medicine (U.S.); Neoplasms; Phenotype; United
    States},
  owner = {binf007},
  pii = {gkd055},
  pmid = {10592169},
  timestamp = {2008.01.21}
}

@ARTICLE{Wolf2005,
  author = {Matthias Wolf and Marco Achtziger and Jörg Schultz and Thomas Dandekar
    and Tobias Müller},
  title = {{Homology modeling revealed more than 20,000 rRNA internal transcribed
    spacer 2 (ITS2) secondary structures.}},
  journal = {RNA},
  year = {2005},
  volume = {11},
  pages = {1616--1623},
  number = {11},
  month = {Nov},
  abstract = {Structural genomics meets phylogenetics and vice versa: Knowing rRNA
    secondary structures is a prerequisite for constructing rRNA alignments
    for inferring phylogenies, and inferring phylogenies is a precondition
    to understand the evolution of such rRNA secondary structures. Here,
    both scientific worlds go together. The rRNA internal transcribed
    spacer 2 (ITS2) region is a widely used phylogenetic marker. Because
    of its high variability at the sequence level, correct alignments
    have to take into account structural information. In this study,
    we examine the extent of the conservation in structure. We present
    (1) the homology modeled secondary structure of more than 20,000
    ITS2 covering about 14,000 species; (2) a computational approach
    for homology modeling of rRNA structures, which additionally can
    be applied to other RNA families; and (3) a database providing about
    25,000 ITS2 sequences with their associated secondary structures,
    a refined ITS2 specific general time reversible (GTR) substitution
    model, and a scoring matrix, available at http://its2.bioapps.biozentrum.uni-wuerzburg.de.},
  doi = {10.1261/rna.2144205},
  institution = {Department of Bioinformatics, University of Würzburg, Biocenter,
    Am Hubland, Germany. matthias.wolf@biozentrum.uni-wuerzburg.de},
  keywords = {Algae; Animals; Base Sequence; DNA, Ribosomal Spacer; Evolution, Molecular;
    Fungi; Models, Molecular; Molecular Sequence Data; Nucleic Acid Conformation;
    RNA, Ribosomal; Sequence Alignment},
  owner = {binf007},
  pii = {11/11/1616},
  pmid = {16244129},
  timestamp = {2008.01.21},
  url = {http://dx.doi.org/10.1261/rna.2144205}
}

@comment{jabref-meta: selector_publisher:}

@comment{jabref-meta: selector_author:}

@comment{jabref-meta: selector_journal:}

@comment{jabref-meta: selector_keywords:}

repository: uibcdf/MolSysMT

repo_name: uibcdf/MolSysMT

branch_name: refs/heads/main

gha_license_id: MIT

gha_language: Python


text:
require u-boot_${PV}.inc

PR = "${INC_PR}.0"

COMPATIBLE_MACHINE = "ti811x"

UBOOT_MACHINE_ti811x = "ti811x_evm_config_sd"
UBOOT_MACHINE_ti814x = "ti8148_evm_config"
UBOOT_MACHINE_ti816x = "ti8168_evm_config"

# This is the NAND binary which is signed to be booted by the boot ROM
TI_UBOOT_BINARY_ti811x = "u-boot.bin"
TI_UBOOT_BINARY_ti814x = "u-boot.bin"
TI_UBOOT_BINARY_ti816x = "u-boot.noxip.bin"

# Append the install and deploy functions so that we ship the
# u-boot.bin file, which is used in the case of SD card boot,
# and u-boot.noxip.bin, which is used in the case of NAND boot.
# We want both files installed in the image as well as put in
# the deploy directory.
# NOTE: Should we try to cleanup the links/rename them to make this
#       more clear?
do_install_append () {
    install ${S}/${TI_UBOOT_BINARY} ${D}/boot/${TI_UBOOT_BINARY}
}

do_deploy_append () {
    install ${S}/${TI_UBOOT_BINARY} ${DEPLOY_DIR_IMAGE}/${TI_UBOOT_BINARY}
    package_stagefile_shell ${DEPLOY_DIR_IMAGE}/${TI_UBOOT_BINARY}

    cd ${DEPLOY_DIR_IMAGE}
    rm -f ${UBOOT_SYMLINK}
    ln -sf ${TI_UBOOT_BINARY} ${UBOOT_SYMLINK}
}

license: MIT

license_type: permissive

branch_name: refs/heads/master

extension: bb


text:
@book{vasin_kef,
    title     = { Компьютерный эксперимент в физике },
    author    = { Васин, А.С. },
    publisher = { Нижегородский государственный университет им. Н.И.~Лобачевского },
    address   = { Нижний Новгород },
    year      = { 2006 },
    numpages  = { 43 },
    language  = { russian }
}

@book{guld_tobochnik_kmf,
    title     = { Компьютерное моделирование в физике },
    author    = { Гулд, Х. and Тобочник, Я. },
    publisher = { Мир },
    address   = { Москва },
    year      = { 1990 },
    numpages  = { 350 },
    volume    = { 2 },
    language  = { russian }
}

extension: bib


text:
@Article{taylor2015factors,
  title = {Factors influencing success of clinical genome sequencing across a broad spectrum of disorders},
  author = {Jenny C Taylor and Hilary C Martin and Stefano Lise and John Broxholme and Jean-Baptiste Cazier and Andy Rimmer and Alexander Kanapin and Gerton Lunter and Simon Fiddy and Chris Allan and {others}},
  journal = {Nature genetics},
  volume = {47},
  number = {7},
  pages = {717--726},
  year = {2015},
  publisher = {Nature Publishing Group},
  date = {2015-01-01},
}


text:
package collinqqualgrp

//NoCollInquiryQualifier is a repeating group in CollInqQualGrp
type NoCollInquiryQualifier struct {
	//CollInquiryQualifier is a non-required field for NoCollInquiryQualifier.
	CollInquiryQualifier *int `fix:"896"`
}

//CollInqQualGrp is a fix50 Component
type CollInqQualGrp struct {
	//NoCollInquiryQualifier is a non-required field for CollInqQualGrp.
	NoCollInquiryQualifier []NoCollInquiryQualifier `fix:"938,omitempty"`
}

func (m *CollInqQualGrp) SetNoCollInquiryQualifier(v []NoCollInquiryQualifier) {
	m.NoCollInquiryQualifier = v
}

repository: ericdeshayes/quickfix

repo_name: ericdeshayes/quickfix

extension: go


text:
package db

import (
	"github.com/btcsuite/btcd/chaincfg/chainhash"
	"github.com/jchavannes/btcd/txscript"
	"github.com/jchavannes/btcd/wire"
	"github.com/jchavannes/jgo/jerr"
	"github.com/rohenaz/dtvcash/app/bitcoin/wallet"
	"strconv"
	"time"
)

var transactionColumns = []string{
	BlockTable,
	TxInTable,
	TxInTxnOutTable,
	TxInKeyTable,
	TxInTxnOutTxnTable,
	TxOutTable,
	TxOutKeyTable,
	TxOutTxnInTable,
	TxOutTxnInTxnTable,
}

type Transaction struct {
	Id        uint              `gorm:"primary_key"`
	BlockId   uint
	Block     *Block
	Hash      []byte            `gorm:"unique;"`
	Version   int32
	TxIn      []*TransactionIn  `gorm:"foreignkey:TransactionHash"`
	TxOut     []*TransactionOut `gorm:"foreignkey:TransactionHash"`
	LockTime  uint32
	CreatedAt time.Time
	UpdatedAt time.Time
}

func (t *Transaction) GetBlockHeight() string {
	if t.Block == nil {
		return "Unknown"
	}
	return strconv.Itoa(int(t.Block.Height))
}

func (t *Transaction) GetBlockTime() string {
	if t.Block == nil {
		return "-"
	}
	return t.Block.Timestamp.Format("2006-01-02 15:04")
}

func (t *Transaction) GetKeyId() uint {
	if len(t.TxIn) != 1 || t.TxIn[0].Key == nil {
		return 0
	}
	return t.TxIn[0].Key.Id
}

type Value struct {
	amount int64
}

func (v Value) GetValue() int64 {
	return v.amount
}

func (v Value) GetValueBCH() float64 {
	return float64(v.GetValue()) * 1.e-8
}

func (t *Transaction) GetValues() map[string]*Value {
	var values = make(map[string]*Value)
	for _, in := range t.TxIn {
		if in.TxnOut == nil || in.Key == nil {
			continue
		}
		mapKey := in.Key.GetAddress().GetEncoded()
		_, ok := values[mapKey]
		if !ok {
			values[mapKey] = &Value{}
		}
		values[mapKey].amount -= in.TxnOut.Value
	}
	for _, out := range t.TxOut {
		if out.Key == nil {
			continue
		}
		mapKey := out.Key.GetAddress().GetEncoded()
		_, ok := values[mapKey]
		if !ok {
			values[mapKey] = &Value{}
		}
		values[mapKey].amount += out.Value
	}
	return values
}

func (t *Transaction) HasFee() bool {
	return t.GetFee() > 0
}

func (t *Transaction) GetFeeBCH() float64 {
	return float64(t.GetFee()) * 1.e-8
}

func (t *Transaction) GetFee() int64 {
	var inputTotal int64
	var outputTotal int64
	for _, in := range t.TxIn {
		if in.TxnOut == nil {
			// Unknown input, unable to calculate fee
			return 0
		}
		inputTotal += in.TxnOut.Value
	}
	for _, out := range t.TxOut {
		outputTotal += out.Value
	}
	return inputTotal - outputTotal
}

func (t *Transaction) Save() error {
	if t.Id == 0 {
		txn, err := GetTransactionByHash(t.Hash)
		if err != nil && ! IsRecordNotFoundError(err) {
			return jerr.Get("error getting transaction by hash", err)
		}
		if txn != nil {
			return jerr.Get("transaction already exists", alreadyExistsError)
		}
	}
	//fmt.Printf("Saving transaction: %#v\n", t)
	result := save(t)
	if result.Error != nil {
		return jerr.Get("error saving transaction", result.Error)
	}
	return nil
}

func (t *Transaction) Delete() error {
	for _, in := range t.TxIn {
		err := in.Delete()
		if err != nil {
			return jerr.Get("error removing transaction input", err)
		}
	}
	for _, out := range t.TxOut {
		result := remove(out)
		if result.Error != nil {
			return jerr.Get("error removing transaction output", result.Error)
		}
	}
	result := remove(t)
	if result.Error != nil {
		return jerr.Get("error removing transaction", result.Error)
	}
	return nil
}

func (t *Transaction) GetChainHash() *chainhash.Hash {
	hash, _ := chainhash.NewHash(t.Hash)
	return hash
}

func (t *Transaction) HasUserKey(userId uint) bool {
	for _, in := range t.TxIn {
		if in.Key != nil && in.Key.UserId == userId {
			return true
		}
	}
	for _, out := range t.TxOut {
		if out.Key != nil && out.Key.UserId == userId {
			return true
		}
	}
	return false
}

func GetTransactionById(transactionId uint) (*Transaction, error) {
	return getTransaction(Transaction{
		Id: transactionId,
	})
}

func getTransaction(whereTxn Transaction) (*Transaction, error) {
	var txn Transaction
	err := findPreloadColumns(transactionColumns, &txn, whereTxn)
	if err != nil {
		return nil, jerr.Get("error finding transaction", err)
	}
	return &txn, nil
}

func GetTransactions() ([]*Transaction, error) {
	var transactions []*Transaction
	err := findPreloadColumns(transactionColumns, &transactions)
	if err != nil {
		return nil, jerr.Get("error finding transactions", err)
	}
	return transactions, nil
}

func GetTransactionsForPkHash(pkHash []byte) ([]*Transaction, error) {
	ins, err := GetTransactionInputsForPkHash(pkHash)
	if err != nil {
		return nil, jerr.Get("error getting ins", err)
	}
	outs, err := GetTransactionOutputsForPkHash(pkHash)
	if err != nil {
		return nil, jerr.Get("error getting outs", err)
	}
	var hashes [][]byte
	for _, in := range ins {
		hashes = append(hashes, in.TransactionHash)
	}
	for _, out := range outs {
		hashes = append(hashes, out.TransactionHash)
	}
	query, err := getDb()
	if err != nil {
		return nil, jerr.Get("error getting db", err)
	}
	query = query.Preload(TxOutTable)
	var transactions []*Transaction
	result := query.Where("hash in (?)", hashes).Find(&transactions)

	if result.Error != nil {
		return nil, jerr.Get("error finding transactions", result.Error)
	}
	return transactions, nil
}

func GetTransactionByHash(hash []byte) (*Transaction, error) {
	var txn = Transaction{
		Hash: hash,
	}
	err := find(&txn, txn)
	if err != nil {
		return nil, jerr.Get("error finding transaction", err)
	}
	return &txn, nil
}

func GetTransactionByHashWithOutputs(hash []byte) (*Transaction, error) {
	var txn = Transaction{
		Hash: hash,
	}
	err := findPreloadColumns([]string{TxOutTable}, &txn, txn)
	if err != nil {
		return nil, jerr.Get("error finding transaction", err)
	}
	return &txn, nil
}

func ConvertMsgToTransaction(msg *wire.MsgTx) (*Transaction, error) {
	txHash := msg.TxHash()
	var txn = Transaction{
		Hash:     txHash.CloneBytes(),
		Version:  msg.Version,
		LockTime: msg.LockTime,
	}
	for index, in := range msg.TxIn {
		unlockScript, err := txscript.DisasmString(in.SignatureScript)
		if err != nil {
			return nil, jerr.Getf(err, "error disassembling unlockScript: %s", unlockScript)
		}
		var transactionIn = TransactionIn{
			Index:                 uint(index),
			PreviousOutPointHash:  in.PreviousOutPoint.Hash.CloneBytes(),
			PreviousOutPointIndex: in.PreviousOutPoint.Index,
			SignatureScript:       in.SignatureScript,
			Sequence:              in.Sequence,
			UnlockString:          unlockScript,
			TransactionHash:       txHash.CloneBytes(),
		}
		transactionIn.KeyPkHash = transactionIn.GetPkHash()
		transactionIn.HashString = transactionIn.GetHashString()
		transactionIn.TxnOutHashString = getHashString(transactionIn.PreviousOutPointHash, transactionIn.PreviousOutPointIndex)
		txn.TxIn = append(txn.TxIn, &transactionIn)
	}
	for index, out := range msg.TxOut {
		lockScript, err := txscript.DisasmString(out.PkScript)
		if err != nil {
			return nil, jerr.Get("error disassembling lockScript: %s\n", err)
		}
		scriptClass, _, sigCount, err := txscript.ExtractPkScriptAddrs(out.PkScript, &wallet.MainNetParamsOld)
		var transactionOut = TransactionOut{
			Index:           uint32(index),
			Value:           out.Value,
			PkScript:        out.PkScript,
			LockString:      lockScript,
			RequiredSigs:    uint(sigCount),
			ScriptClass:     uint(scriptClass),
			TransactionHash: txHash.CloneBytes(),
		}
		if transactionOut.IsMemo() && len(txn.TxIn) == 1 {
			transactionOut.KeyPkHash = txn.TxIn[0].KeyPkHash
		} else {
			transactionOut.KeyPkHash = transactionOut.GetPkHash()
		}
		transactionOut.HashString = transactionOut.GetHashString()
		txn.TxOut = append(txn.TxOut, &transactionOut)
	}
	return &txn, nil
}

repository: rohenaz/dtvcash

repo_name: rohenaz/dtvcash


text:
SUMMARY = "Control and monitor storage systems using S.M.A.R.T"
DESCRIPTION = \
"The smartmontools package contains two utility programs (smartctl \
and smartd) to control and monitor storage systems using the Self-\
Monitoring, Analysis and Reporting Technology System (SMART) built \
into most modern ATA and SCSI hard disks. In many cases, these \
utilities will provide advanced warning of disk degradation and failure."

HOMEPAGE = "http://smartmontools.sourceforge.net/"
SECTION = "console/utils"

LICENSE = "GPLv2"
LIC_FILES_CHKSUM = "file://COPYING;md5=b234ee4d69f5fce4486a80fdaf4a4263"

SRC_URI = "${SOURCEFORGE_MIRROR}/smartmontools/smartmontools-${PV}.tar.gz \
           file://initd.smartd \
          "

PACKAGECONFIG ??= "${@base_contains('DISTRO_FEATURES', 'libcap-ng', 'libcap-ng', '', d)} \
                   ${@base_contains('DISTRO_FEATURES', 'selinux', 'selinux', '', d)} \
                  "
PACKAGECONFIG[libcap-ng] = "--with-libcap-ng=yes,--with-libcap-ng=no,libcap-ng"
PACKAGECONFIG[selinux] = "--with-selinux=yes,--with-selinux=no,libselinux"

SRC_URI[md5sum] = "d44f84081a12cef79cd17f78044351fc"
SRC_URI[sha256sum] = "486f660579bb0fb4f6b927ded7531cb1f99685c666397377761c5b04dd96065b"

inherit autotools update-rc.d

do_install_append () {
	#install the init.d/smartd
	install -d ${D}${sysconfdir}/init.d
	install -p -m 0755 ${WORKDIR}/initd.smartd ${D}${sysconfdir}/init.d/smartd
}

INITSCRIPT_NAME = "smartd"
INITSCRIPT_PARAMS = "start 60 . stop 60 0 1 2 3 4 5 6 ."

RDEPENDS_${PN} += "mailx"

repository: ni/meta-oe

repo_name: ni/meta-oe

gha_language: BlitzBasic


text:
@techreport{tournier:inria-00321983,
 author = {Tournier, Maxime and Wu, Xiaomao and Courty, Nicolas and Arnaud, Elise and Reveret, Lionel},
 hal_id = {inria-00321983},
 hal_version = {v1},
 institution = {INRIA},
 number = {RR-6648},
 pages = {24},
 pdf = {https://hal.inria.fr/inria-00321983/file/RR-6648.pdf},
 title = {Motion Compression using Principal Geodesics Analysis},
 type = {Research Report},
 url = {https://hal.inria.fr/inria-00321983},
 year = {2008}
}

repository: ncourty/academic-kickstart

repo_name: ncourty/academic-kickstart


text:
@article{Brown2017b,
 abstract = {BACKGROUND: Breast cancer is the leading cause of cancer deaths among women in the Caribbean and accounts for >1 million disability adjusted life years. Little is known about the social inequalities of this disease in the Caribbean. In support of the Rio Political Declaration on addressing health inequities, this article presents a systematic review of evidence on the distribution, by social determinants, of breast cancer risk factors, frequency, and adverse outcomes in Caribbean women. METHODS: MEDLINE, EMBASE, SciELO, CINAHL, CUMED, LILACS, and IBECS were searched for observational studies reporting associations between social determinants and breast cancer risk factors, frequency, or outcomes. Based on the PROGRESS-plus checklist, we considered 8 social determinant groups for 14 breast cancer endpoints, which totalled to 189 possible ways ('relationship groups') to explore the role of social determinants on breast cancer. Studies with >50 participants conducted in Caribbean territories between 2004 and 2014 were eligible for inclusion. The review was conducted according to STROBE and PRISMA guidelines and results were planned as a narrative synthesis, with meta-analysis if possible. RESULTS: Thirty-four articles were included from 5,190 screened citations. From these included studies, 75 inequality relationships were reported examining 30 distinct relationship groups, leaving 84% of relationship groups unexplored. Most inequality relationships were reported for risk factors, particularly alcohol and overweight/obesity which generally showed a positive relationship with indicators of lower socioeconomic position. Evidence for breast cancer frequency and outcomes was scarce. Unmarried women tended to have a higher likelihood of being diagnosed with breast cancer when compared to married women. While no association was observed between breast cancer frequency and ethnicity, mortality from breast cancer was shown to be slightly higher among Asian-Indian compared to African-descent populations in Trinidad (OR 1.2, 95% CI 1.1-1.4) and Guyana (OR 1.3, 95% CI 1.0-1.6). CONCLUSION: Study quantity, quality, and variability in outcomes and reporting limited the synthesis of evidence on the role of social determinants on breast cancer in the Caribbean. This report represents important current evidence on the region, and can guide future research priorities for better describing and understanding of Caribbean breast cancer inequalities.},
 article-pii = {540},
 author = {Brown, Catherine R. and Hambleton, Ian R. and Hercules, Shawn M. and Alvarado, Miriam and Unwin, Nigel and Murphy, Madhuvanti M. and Harris, E. Nigel and Wilks, Rainford and MacLeish, Marlene and Sullivan, Louis and Sobers-Grannum, Natasha},
 completed = {20171012},
 corporate = {U.S. Caribbean Alliance for Health Disparities Research Group (USCAHDR)},
 doi = {10.1186/s12939-017-0540-z},
 electronic-issn = {1475-9276},
 electronic-publication = {20170405},
 grantno = {U24 MD006959/MD/NIMHD NIH HHS/United States},
 history = {2017/10/13 06:00 [medline]},
 investigator = {Alvarado, M, Alvarado M, Bennet, N, Bennet N, Bidulescu, A, Bidulescu A, Brown, C R, Brown CR, Ferguson, T, Ferguson T, Francis, D, Francis D, Hambleton, I R, Hambleton IR, Harris, E N, Harris EN, Hassell, C, Hassell C, Hennis, A J M, Hennis AJM, Hercules, S M, Hercules SM, Howitt, C, Howitt C, MacLeish, M, MacLeish M, Murphy, M M, Murphy MM, Samuels, T A, Samuels TA, Sobers-Grannum, N, Sobers-Grannum N, Sullivan, L, Sullivan L, Unwin, N, Unwin N, Wilks, R, Wilks R, Williams, L, Williams L, Younger-Coleman, N, Younger-Coleman N},
 issue = {1},
 journal = {International journal for equity in health},
 keywords = {*Breast Neoplasms/ethnology/etiology/mortality, Caribbean Region, *Continental Population Groups, *Ethnic Groups, Guyana, Humans, *Marital Status, Risk Factors, *Social Class, Social Determinants of Health, Socioeconomic Factors, Trinidad and Tobago},
 language = {eng},
 linking-issn = {1475-9276},
 location-id = {60},
 month = {Apr},
 nlm-unique-id = {101147692},
 owner = {NLM},
 pages = {60},
 publication-status = {epublish},
 revised = {20200318},
 source = {Int J Equity Health. 2017 Apr 5;16(1):60. doi: 10.1186/s12939-017-0540-z.},
 status = {MEDLINE},
 subset = {IM},
 title = {Social determinants of breast cancer in the Caribbean: a systematic review.},
 title-abbreviation = {Int J Equity Health},
 volume = {16},
 year = {2017}
}


text:
%CP3-10-13 (mlilley)%
@Article{Lilley:2010av,
     author    = "Lilley, Marc and Di Marco, Fabrizio and Martin, Jerome and
                  Peter, Patrick",
     title     = "{Nonabelian Bosonic Currents in Cosmic Strings}",
     journal   = "Phys. Rev.",
     volume    = "D82",
     year      = "2010",
     pages     = "023510",
     eprint    = "1003.4601",
     archivePrefix = "arXiv",
     primaryClass  =  "hep-th",
     doi       = "10.1103/PhysRevD.82.023510",
     SLACcitation  = "%%CITATION = 1003.4601;%%"
}

%CP3-11-16 (lorenz)%
@Article{Lilley:2011ag,
     author    = "Lilley, Marc and Lorenz, Larissa and Clesse, Sebastien",
     title     = "{Observational signatures of a non-singular bouncing
                  cosmology}",
     journal   = "JCAP",
     volume    = "1106",
     year      = "2011",
     pages     = "004",
     eprint    = "1104.3494",
     archivePrefix = "arXiv",
     primaryClass  =  "gr-qc",
     doi       = "10.1088/1475-7516/2011/06/004",
     SLACcitation  = "%%CITATION = 1104.3494;%%"
}

repository: eatdust/curl

repo_name: eatdust/curl

branch_name: refs/heads/gh-pages

gha_license_id: NOASSERTION

gha_language: HTML


text:
@misc{MetaStrategist.jl,
	author  = {Khalil CHRIT},
	title   = {MetaStrategist.jl},
	url     = {https://github.com/JuliaConstraints/MetaStrategist.jl},
	version = {v0.1.0},
	year    = {2021},
	month   = {3}
}


text:
$(document).ready(function(){
  $(".qbh-shopping-main-again").on('click',function(){
    $.fn.fullpage.moveTo(1);//主要是这一部分
  })
  $(".qbh-down").on('click',function(){
    $.fn.fullpage.moveSectionDown();//主要是这一部分

  })
  $('#fullpage').fullpage({//这里面写参数
sectionsColor:['#fadd67', '#84a2d4', '#ef674d', '#fed', '#d04759', '#84d9ed', '#8ac060'],
    //添加小圆点导航
    navigation:true,
    //小圆点的导航的位置
    navigationPosition:'right',
    //小圆点导航的文字提示
    navigationTooltips:['first','second','third','fourth','fifth','sixth','seventh','eighth'],
    //是否显示当前这一页的文字提示
    showActiveTooltip:true,
    //控制滚动速度
    scrollingSpeed:1000,
  //  当页面载入后的回调函数
    afterLoad:function(anchorLink,index){
      //第二屏动画
      if(index==2){
       //让未打字的搜索框向左移动
        $('.qbh-list-search').animate({
          opacity:1,
          marginRight:489
        },1000,function(){
          $('.qbh-list-search img:last-child').animate({
            opacity:1
          },1000,function(){
            $('.qbh-list-search').hide();

            //接着让写好的显示
            $('.qbh-list-search-finish').show().animate({
              //opacity:1,
              width:130,
              bottom:449,
              right:432
            },1000,function(){

              })
            $('.qhb-list-sofe').show().animate({
              width:442
            },1000,function(){
              $('.qbh-list-word img:last-child').animate({
                opacity:1
              },1000,function(){
                $('.qbh-down').animate({
                  opacity:1
                },500)
              })

            })
          })

        })

      }
      if(index==5){
        $('.qbh-payment-hands').animate({
          bottom:0
        },700,function(){
          $('.qbh-payment-mouse img:last-child').show();
          $('.qbh-payment-drop').delay(500).show(0).animate({
            bottom:145
          },1000,function(){
            $('.qbh-payment-bill img:first-child').animate({
              top:-100
            },1000)
            $('.qbh-payment-bill img:last-child').animate({
              top:164
            },600,function(){
              $('.qbh-down').animate({
                opacity:1
              },500)
            })
          })

        })

      }
      // 第七屏动画
      if (index == 7) {
        $('#star').addClass('star');

          //添加类名

          $('.qbh-appraise-haoping').delay(3000).show().animate({
            left: 40
          },500,function(){
            $(this).animate({
              width: 72
            },500,function(){
              $('.qbh-down').animate({
                opacity:1
              },500)
            })
          })

      }
      // 第八屏动画
      if(index == 8) {
        // 当鼠标在第八屏移动的时候
        $(document).mousemove(function(e){
          // console.log(1);
          // 获取鼠标的位置
          var x = e.pageX - 85;
          var y = e.pageY + 10;
          var yy = $(window).height() - 449;
          // console.log(e);
          // 把鼠标的位置的坐标设置给手图片
          if(y < yy) {
            $(".qbh-shopping-hands").css({
              "left": x,
              "top": yy
            })
          }else {
            $(".qbh-shopping-hands").css({
              "left": x,
              "top": y
            })
          }

        })
      }

    },
    //一旦用户离开某个session，过渡到新section，就会触发此回调
    onLeave:function(index,nextIndex,direction){
      if(index==1&& nextIndex==2){
        $('.qbh-down').animate({
          opacity:0
        },500)
      }
      if(index==2&& nextIndex==3){
        $('.qbh-down').animate({
          opacity:0
        },500)
      }
      if(index==3&& nextIndex==4){
        $('.qbh-down').animate({
          opacity:0
        },500)
      }
      if(index==4&& nextIndex==5){
        $('.qbh-down').animate({
          opacity:0
        },500)
      }
      if(index==5&& nextIndex==6){
        $('.qbh-down').animate({
          opacity:0
        },500)
      }
      if(index==6&& nextIndex==7){
        $('.qbh-down').animate({
          opacity:0
        },500)
      }
      if(index==7&& nextIndex==8){
        $('.qbh-down').animate({
          opacity:0
        },500)
      }
      //第三屏动画
      if(index==2&&nextIndex==3){
        //让第二屏的沙发显示并掉落
        $('.qbh-list-drop').show().animate({
          bottom:-($(window).height()-260),
          width:201,
          right:630
        },2000,function(){
          $('.qbh-buy-main-choose-false').hide();
            $('.qbh-down').animate({
              opacity:1
            },500)

        })
      }
      //第四屏动画
      if(index==3&&nextIndex==4){
        $('.qbh-info-rotate-sofa').show().animate({
          bottom: -($(window).height()-195),
          right:453
        },1000,function(){
          $('.qbh-info-cart img:last-child').show();
          $('.qbh-info-rotate-sofa').hide();
          $('.qbh-info-cart').animate({
            right:-500
          },2000,function(){
              $('.qbh-info-address-box').show();
            $('.qbh-info-word img:last-child').css('opacity','1')

              $('.qbh-down').animate({
                opacity:1
              },500)

          })

        })
      }
      //第五屏动画
      //if(index==4&&nextIndex==5){
      //  $('.qbh-payment-hands').animate({
      //    bottom:0
      //  },1000,function(){
      //    $('.qbh-payment-mouse img:last-child').show();
      //    $('.qbh-payment-drop').delay(500).show(0).animate({
      //      bottom:145
      //    },1000,function(){
      //      $('.qbh-payment-bill img:first-child').animate({
      //        top:-100
      //      },1000)
      //      $('.qbh-payment-bill img:last-child').animate({
      //        top:164
      //      },600)
      //    })
      //
      //  })
      //
      //}

      if(index==5&&nextIndex==6){
          $('.qbh-payment-drop2').show().animate({
            bottom:-($(window).height()-550),
            width:60
          },1000)
          $('.qbh-delivery-box').show().animate({
            left: 296,
            bottom: 536,
            width:123
          },1000,function(){
            $('.qbh-payment-drop2').hide()
            $('.qbh-delivery-box').animate({
              left: 420,
              bottom: 24,
              width:0
            },1000,function(){
              $('.qbh-delivery-word').show();
              $('.qbh-delivery-word img:last-child').animate({
                opacity:0
              },3000,function(){
                $('.qbh-delivery-word').hide();
              })
              $('.qbh-delivery-truck-font').show();
              $('.qbh-delivery').animate({
                backgroundPositionX:'100%'
              },2000,function(){
                $('.qbh-delivery-deliveryman').animate({
                  width:252,
                  bottom:104,
                  right:350
                },1000,function(){
                  $('.qbh-delivery-deliveryman').animate({
                    right:100
                  },1000,function(){
                    $('.qbh-delivery-door').show();
                    $('.qbh-delivery-buyer').animate({
                      width:87
                    },1000,function(){
                      $('.qhb-delivery-message').animate({
                        opacity:1
                      })
                        $('.qbh-down').animate({
                          opacity:1
                        },500)
                    })
                  })
                })
              })
            })
          })
      }

    },

  //  第四屏动画

  })
})

extension: js


text:
@article{BigBang,
  author = {Chuck Lorre and Bill Prady},
  journal = {CBS},
  title = {The Big Bang Theory},
  year = 2007
}

repository: cllu/CUHK-Thesis-Template

repo_name: cllu/CUHK-Thesis-Template


text:
@inproceedings{courty:inria-00306599,
 address = {Port d'Andratx, Spain},
 author = {Courty, Nicolas and Arnaud, Elise},
 booktitle = {ADMO 2008 - 5th Conference on Articulated Motion and Deformable Object},
 doi = {10.1007/978-3-540-70517-8_1},
 editor = {Francisco J. Perales and Robert B. Fisher},
 hal_id = {inria-00306599},
 hal_version = {v1},
 month = {July},
 pages = {1-10},
 pdf = {https://hal.inria.fr/inria-00306599/file/amdo08-final.pdf},
 publisher = {Springer},
 series = {Lecture Notes in Computer Science},
 title = {Inverse kinematics using sequential Monte Carlo methods},
 url = {https://hal.inria.fr/inria-00306599},
 volume = {5098},
 year = {2008}
}


text:
@article{krzakala_aging_2006,
 abstract = {Many recent experiments probed the off equilibrium dynamics of spin glasses and other glassy systems through temperature cycling protocols, and observed memory and rejuvenation phenomena. Here we show through numerical simulations, using powerful algorithms, that such features can already be observed to some extent in simple models such as two dimensional ferromagnets. We critically discuss these results and review some aspects of the literature in the light of our findings.},
 author = {Krzakala, Florent and Ricci-Tersenghi, Federico},
 doi = {10.1088/1742-6596/40/1/005},
 file = {IOP Full Text PDF:/Users/florentkrzakala/Zotero/storage/BKJNQATI/Krzakala and Ricci-Tersenghi - 2006 - Aging, memory and rejuvenation some lessons from .pdf:application/pdf},
 issn = {1742-6596},
 journal = {J. Phys.: Conf. Ser.},
 language = {en},
 month = {May},
 pages = {42--49},
 shorttitle = {Aging, memory and rejuvenation},
 title = {Aging, memory and rejuvenation: some lessons from simple models},
 url = {https://doi.org/10.1088%2F1742-6596%2F40%2F1%2F005},
 urldate = {2019-07-01},
 volume = {40},
 year = {2006}
}

repository: krzakala/academic-kickstart

repo_name: krzakala/academic-kickstart


text:
# Handle QUIET and REQUIRED etc.
include(FindPackageHandleStandardArgs)

# Just use pkg-config for hints.
find_package(PkgConfig QUIET)
if (PKGCONFIG_FOUND)
	pkg_check_modules(PC_LIBASS QUIET libass)
endif()

# locate <ass/ass.h>
find_path(LIBASS_INCLUDE_DIRS
	NAMES
		ass/ass.h
	HINTS
		${PC_LIBASS_INCLUDEDIR}
		${PC_LIBASS_INCLUDE_DIRS}
	PATHS
		${LIBASS_INC_DIR}
		$ENV{LIBASS_INC_DIR}
		/usr/local/include
		/usr/include
)

# locate libass.(dylib|so)
find_library(LIBASS_LIBRARIES
	NAMES
		ass
	HINTS
		${PC_LIBASS_LIBDIR}
		${PC_LIBASS_LIBRARY_DIRS}
	PATHS
		${LIBASS_LIB_DIR}
		$ENV{LIBASS_LIB_DIR}
		/usr/local/lib
		/usr/local/lib64
		/usr/local/lib/${CMAKE_LIBRARY_ARCHITECTURE}
		/usr/lib
		/usr/lib64
		/usr/lib/${CMAKE_LIBRARY_ARCHITECTURE}
)

# Error if header or library not found.
find_package_handle_standard_args(libass
	"libass not found. If you have installed it in a custom location, try setting the variables LIBASS_INC_DIR and LIBASS_LIB_DIR."

	LIBASS_LIBRARIES
	LIBASS_INCLUDE_DIRS
)

repository: CoffeeFlux/SubInspector

repo_name: CoffeeFlux/SubInspector

extension: cmake


text:
SUMMARY = "XaDe OS test tool package"

PR = "r1"

inherit packagegroup

RDEPENDS_${PN} = "stress-ng"
RDEPENDS_${PN} += "stressapptest"

repository: XDeschuyteneer/meta-xade

repo_name: XDeschuyteneer/meta-xade

gha_language: BitBake


text:
include(FindPackageHandleStandardArgs)
find_package(PkgConfig REQUIRED)

pkg_search_module(_SCALAPACK scalapack)
find_library(SCALAPACK_LIBRARIES NAMES scalapack
  HINTS
  ${_SCALAPACK_LIBRARY_DIRS}
  ENV SCALAPACKROOT
  /usr/lib
  PATH_SUFFIXES
  lib
  DOC "scalapack library path")

find_path(SCALAPACK_INCLUDE_DIR
  pblas.h
  PATH_SUFFIXES
  include
  HINTS
  ENV SCALAPACKROOT
  ${_SCALAPACK_INCLUDE_DIRS}
  /usr/lib)

find_package_handle_standard_args(ScaLAPACK DEFAULT_MSG SCALAPACK_LIBRARIES SCALAPACK_INCLUDE_DIR)

repository: Yamazaki-Youichi/SIRIUS

repo_name: Yamazaki-Youichi/SIRIUS


text:
var searchData=
[
  ['cardnumbervalidation_722',['CardNumberValidation',['../namespace_mercado_pago_1_1_common.html#a581d9f4ae8d0e284794c16f7045e767e',1,'MercadoPago::Common']]],
  ['currencyid_723',['CurrencyId',['../namespace_mercado_pago_1_1_common.html#a1599024ab4ff96204c9ba354a2a7e9a5',1,'MercadoPago::Common']]]
];

repository: HerussHub/dx-dotnet

repo_name: HerussHub/dx-dotnet


text:
%Introduction

@INPROCEEDINGS{ref:iot-apps,
author={N. Shahid and S. Aneja},
booktitle={2017 International Conference on I-SMAC (IoT in Social, Mobile, Analytics and Cloud) (I-SMAC)},
title={Internet of Things: Vision, application areas and research challenges},
year={2017},
volume={},
number={},
pages={583-587},
ISSN={},
month={Feb}
}

@TECHREPORT{ref:disasters-report,
author={D. Guha-Sapir P. Hoyois P. Wallemacq and R. Below},
title={Annual Disaster Statistical Review 2016 },
institution = {EM-DAT},
year = {2017}
}

@article{ref:wildfires-figures,
author = {Doerr, S.H. and Santín, Cristina},
year = {2016},
month = {Jun},
title = {Global trends in wildfire and its impacts: Perceptions versus realities in a changing world},
volume = {371},
booktitle = {Philosophical Transactions of the Royal Society B: Biological Sciences}
}

%Background

@misc{ref:bg-regulations,
  title = {{ERC} Recommendation 70-03},
  howpublished = {\url{https://www.ecodocdb.dk/download/25c41779-cd6e/attachments/2016_REC7003E.pdf}},
  note = {Accessed: 1-6-2018}
}

@misc{ref:bg-sx1276,
  title = {{SX1276/77/78/79} Datasheet},
  howpublished = {\url{https://www.semtech.com/uploads/documents/DS_SX1276-7-8-9_W_APP_V5.pdf}},
  note = {Accessed: 3-6-2018}
}

@misc{ref:bg-lorawan-spec,
  title = {{LoRaWAN 1.1} Specification},
  howpublished = {\url{https://lora-alliance.org/sites/default/files/2018-04/lorawantm_specification_-v1.1.pdf}},
  note = {Accessed: 3-6-2018}
}

@misc{ref:bg-semtech-lora,
  title = {{LoRa} Modulation Basics},
  howpublished = {\url{https://www.semtech.com/uploads/documents/an1200.22.pdf}},
  note = {Accessed: 3-6-2018}
}

@misc{ref:bg-reversing-lora1,
  title = {Reversing {LoRa}},
  author = {M. Knight},
  howpublished = {\url{https://github.com/matt-knight/research/blob/master/2016_05_20_jailbreak/Reversing-Lora-Knight.pdf}},
  note = {Accessed: 3-6-2018}
}

@article{ref:bg-reversing-lora2,
	author = {Matthew Knight and Balint Seeber},
	title = {Decoding LoRa: Realizing a Modern LPWAN with SDR},
	journal = {Proceedings of the GNU Radio Conference},
	volume = {1},
	number = {1},
	year = {2016},
	url = {https://pubs.gnuradio.org/index.php/grcon/article/view/8}
}

%State of the Art

@INPROCEEDINGS{ref:soa-lora-range1,
author={J. Petajajarvi and K. Mikhaylov and A. Roivainen and T. Hanninen and M. Pettissalo},
booktitle={2015 14th International Conference on ITS Telecommunications (ITST)},
title={On the coverage of LPWANs: range evaluation and channel attenuation model for LoRa technology},
year={2015},
volume={},
number={},
pages={55-59},
doi={10.1109/ITST.2015.7377400},
ISSN={},
month={Dec}
}

@INPROCEEDINGS{ref:soa-lora-range2,
author={P. Jörke and S. Böcker and F. Liedmann and C. Wietfeld},
booktitle={2017 IEEE 28th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)},
title={Urban channel models for smart city IoT-networks based on empirical measurements of LoRa-links at 433 and 868 MHz},
year={2017},
volume={},
number={},
pages={1-6},
doi={10.1109/PIMRC.2017.8292708},
ISSN={},
month={Oct}
}

@INPROCEEDINGS{ref:soa-lora-range3,
author={S. Y. Wang and Y. R. Chen and T. Y. Chen and C. H. Chang and Y. H. Cheng and C. C. Hsu and Y. B. Lin},
booktitle={2017 IEEE 86th Vehicular Technology Conference (VTC-Fall)},
title={Performance of LoRa-Based IoT Applications on Campus},
year={2017},
volume={},
number={},
pages={1-6},
ISSN={},
month={Sept}
}

@inproceedings{ref:soa-lora-mountains,
 author = {Iova, Oana and Murphy, Amy L. and Picco, Gian Pietro and Ghiro, Lorenzo and Molteni, Davide and Ossi, Federico and Cagnacci, Francesca},
 title = {LoRa from the City to the Mountains: Exploration of Hardware and Environmental Factors},
 booktitle = {Proceedings of the 2017 International Conference on Embedded Wireless Systems and Networks},
 series = {EWSN \&\#8217;17},
 year = {2017},
 isbn = {978-0-9949886-1-4},
 location = {Uppsala, Sweden},
 pages = {317--322},
 numpages = {6},
 url = {http://dl.acm.org/citation.cfm?id=3108009.3108091},
 acmid = {3108091},
 publisher = {Junction Publishing},
 address = {USA},
 keywords = {Internet of Things, LPWAN, LoRa, communication range}
}

@INPROCEEDINGS{ref:soa-lora-noise,
author={L. Angrisani and P. Arpaia and F. Bonavolontà and M. Conti and A. Liccardo},
booktitle={2017 IEEE 3rd International Forum on Research and Technologies for Society and Industry (RTSI)},
title={LoRa protocol performance assessment in critical noise conditions},
year={2017},
volume={},
number={},
pages={1-5},
ISSN={},
month={Sept}
}

@INPROCEEDINGS{ref:soa-lora-scal1,
author={K. Mikhaylov and .. Juha Petaejaejaervi and T. Haenninen},
booktitle={European Wireless 2016; 22th European Wireless Conference},
title={Analysis of Capacity and Scalability of the LoRa Low Power Wide Area Network Technology},
year={2016},
volume={},
number={},
pages={1-6},
keywords={},
doi={},
ISSN={},
month={May},}

@Article{ref:soa-lora-scal2,
AUTHOR = {Augustin, Aloÿs and Yi, Jiazi and Clausen, Thomas and Townsley, William Mark},
TITLE = {A Study of LoRa: Long Range and Low Power Networks for the Internet of Things},
JOURNAL = {Sensors},
VOLUME = {16},
YEAR = {2016},
NUMBER = {9},
ARTICLE NUMBER = {1466},
URL = {http://www.mdpi.com/1424-8220/16/9/1466},
ISSN = {1424-8220},
}

@inproceedings{ref:soa-lora-scal3,
 author = {Bor, Martin C. and Roedig, Utz and Voigt, Thiemo and Alonso, Juan M.},
 title = {Do LoRa Low-Power Wide-Area Networks Scale?},
 booktitle = {Proceedings of the 19th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems},
 series = {MSWiM '16},
 year = {2016},
 isbn = {978-1-4503-4502-6},
 location = {Malta, Malta},
 pages = {59--67},
 numpages = {9},
 url = {http://doi.acm.org/10.1145/2988287.2989163},
 doi = {10.1145/2988287.2989163},
 acmid = {2989163},
 publisher = {ACM},
 address = {New York, NY, USA}
}

@ARTICLE{ref:soa-lora-scal4,
author={F. Van den Abeele and J. Haxhibeqiri and I. Moerman and J. Hoebeke},
journal={IEEE Internet of Things Journal},
title={Scalability Analysis of Large-Scale LoRaWAN Networks in ns-3},
year={2017},
volume={4},
number={6},
pages={2186-2198},
doi={10.1109/JIOT.2017.2768498},
ISSN={},
month={Dec},}

@INPROCEEDINGS{ref:soa-lora-scal5,
author={D. Magrin and M. Centenaro and L. Vangelista},
booktitle={2017 IEEE International Conference on Communications (ICC)},
title={Performance evaluation of LoRa networks in a smart city scenario},
year={2017},
volume={},
number={},
pages={1-7},
doi={10.1109/ICC.2017.7996384},
ISSN={},
month={May},}

@INPROCEEDINGS{ref:soa-lora-scal6,
author={F. Cuomo and M. Campo and A. Caponi and G. Bianchi and G. Rossini and P. Pisani},
booktitle={2017 IEEE 13th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob)},
title={EXPLoRa: Extending the performance of LoRa by suitable spreading factor allocations},
year={2017},
volume={},
number={},
pages={1-8},
doi={10.1109/WiMOB.2017.8115779},
ISSN={},
month={Oct},}

@INPROCEEDINGS{ref:soa-plac-centr1,
author={K. Chandrashekar and M. R. Dekhordi and J. S. Baras},
booktitle={IEEE MILCOM 2004. Military Communications Conference, 2004.},
title={Providing full connectivity in large ad-hoc networks by dynamic placement of aerial platforms},
year={2004},
volume={3},
number={},
pages={1429-1436 Vol. 3},
doi={10.1109/MILCOM.2004.1495151},
ISSN={},
month={Oct}
}

@INPROCEEDINGS{ref:soa-plac-centr2,
author={C. Caillouet and T. Razafindralambo},
booktitle={2017 Global Information Infrastructure and Networking Symposium (GIIS)},
title={Efficient deployment of connected unmanned aerial vehicles for optimal target coverage},
year={2017},
volume={},
number={},
pages={1-8},
doi={10.1109/GIIS.2017.8169803},
ISSN={},
month={Oct}
}

@ARTICLE{ref:soa-plac-distr1,
author={N. Goddemeier and K. Daniel and C. Wietfeld},
journal={IEEE Journal on Selected Areas in Communications},
title={Role-Based Connectivity Management with Realistic Air-to-Ground Channels for Cooperative UAVs},
year={2012},
volume={30},
number={5},
pages={951-963},
month={June}
}

@INPROCEEDINGS{ref:soa-plac-distr2,
author={M. Di Felice and A. Trotta and L. Bedogni and K. R. Chowdhury and L. Bononi},
booktitle={2014 IEEE 25th Annual International Symposium on Personal, Indoor, and Mobile Radio Communication (PIMRC)},
title={Self-organizing aerial mesh networks for emergency communication},
year={2014},
volume={},
number={},
pages={1631-1636},
ISSN={2166-9570},
month={Sept}
}

@INPROCEEDINGS{ref:soa-ns-comp,
author={E. Weingartner and H. vom Lehn and K. Wehrle},
booktitle={2009 IEEE International Conference on Communications},
title={A Performance Comparison of Recent Network Simulators},
year={2009},
pages={1-5},
month={June}
}

@misc{ref:lorawan-module,
  title = {lorawan for ns-3},
  howpublished = {\url{https://github.com/signetlabdei/lorawan}},
  note = {Accessed: 12-6-2018}
}

%

%@INPROCEEDINGS{ref:soa-manet1,
%author={D. G. Reina and S. L. Toral and F. Barrero and N. Bessis and E. Asimakopoulou},
%booktitle={2011 Third International Conference on Intelligent Networking and Collaborative Systems},
%title={Evaluation of Ad Hoc Networks in Disaster Scenarios},
%year={2011},
%volume={},
%number={},
%pages={759-764},
%doi={10.1109/INCoS.2011.86},
%ISSN={},
%month={Nov},}
%
%@INPROCEEDINGS{ref:soa-manet2,
%author={M. A. Wister and P. Pancardo and F. D. Acosta and D. Arias-Torres},
%booktitle={2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications},
%title={Performance Evaluation of AODV and DYMO as a Plattform for Rescue Task Applications in MANETs},
%year={2011},
%volume={},
%number={},
%pages={670-675},
%doi={10.1109/WAINA.2011.46},
%ISSN={},
%month={March},}
%
%@INPROCEEDINGS{ref:soa-manet3,
%author={C. Raffelsberger and H. Hellwagner},
%booktitle={Proceedings of the 10th International Workshop on Intelligent Solutions in Embedded Systems},
%title={Evaluation of MANET routing protocols in a realistic emergency response scenario},
%year={2012},
%volume={},
%number={},
%pages={88-92},
%doi={},
%ISSN={},
%month={July},}
%
%@InProceedings{ref:soa-dtn1,
%author="Saha, Sujoy
%and Sushovan
%and Sheldekar, Anirudh
%and Joseph C., Rijo
%and Mukherjee, Amartya
%and Nandi, Subrata",
%editor="{\"O}zcan, Abdulkadir
%and Zizka, Jan
%and Nagamalai, Dhinaharan",
%title="Post Disaster Management Using Delay Tolerant Network",
%booktitle="Recent Trends in Wireless and Mobile Networks",
%year="2011",
%publisher="Springer Berlin Heidelberg",
%address="Berlin, Heidelberg",
%pages="170--184",
%isbn="978-3-642-21937-5"
%}
%
%@article{ref:soa-wsn1,
%author = {Molina-Pico, Antonio and Cuesta-Frau, David and Araujo, Alvaro and Alejandre, Javier and Rozas, Alba},
%year = {2016},
%month = {02},
%pages = {1-8},
%title = {Forest Monitoring and Wildland Early Fire Detection by a Hierarchical Wireless Sensor Network},
%volume = {2016},
%booktitle = {Journal of Sensors}
%}
%
%@article{ref:soa-wsn2,
%author = {Zhang, Junguo and li, Wenbin and Han, Ning and Kan, Jiangming},
%year = {2008},
%month = {09},
%pages = {369-374},
%title = {Forest fire detection system based on ZigBee wireless sensor network},
%volume = {3},
%booktitle = {Front. Forestry China}
%}
%
%@inproceedings{ref:soa-mobmodel1,
% author = {Aschenbruck, Nils and Gerhards-Padilla, Elmar and Gerharz, Michael and Frank, Matthias and Martini, Peter},
% title = {Modelling Mobility in Disaster Area Scenarios},
% booktitle = {Proceedings of the 10th ACM Symposium on Modeling, Analysis, and Simulation of Wireless and Mobile Systems},
% series = {MSWiM '07},
% year = {2007},
% isbn = {978-1-59593-851-0},
% location = {Chania, Crete Island, Greece},
% pages = {4--12},
% numpages = {9},
% url = {http://doi.acm.org/10.1145/1298126.1298131},
% doi = {10.1145/1298126.1298131},
% acmid = {1298131},
% publisher = {ACM},
% address = {New York, NY, USA},
% keywords = {disaster area, mobility model, multi-hop networks}
%}
%
%@INPROCEEDINGS{ref:soa-fanet1,
%author={H. Suzuki and Y. Kaneko and K. Mase and S. Yamazaki and H. Makino},
%booktitle={IEEE Vehicular Technology Conference},
%title={An Ad Hoc Network in the Sky, SKYMESH, for Large-Scale Disaster Recovery},
%year={2006},
%volume={},
%number={},
%pages={1-5},
%doi={10.1109/VTCF.2006.496},
%ISSN={1090-3038},
%month={Sept}
%}
%
%@INPROCEEDINGS{ref:soa-fanet2,
%author={M. Di Felice and A. Trotta and L. Bedogni and K. R. Chowdhury and L. Bononi},
%booktitle={2014 IEEE 25th Annual International Symposium on Personal, Indoor, and Mobile Radio Communication (PIMRC)},
%title={Self-organizing aerial mesh networks for emergency communication},
%year={2014},
%volume={},
%number={},
%pages={1631-1636},
%ISSN={2166-9570},
%month={Sept}
%}
%
%@inproceedings{ref:soa-fanet3,
% author = {Scherer, J\"{u}rgen and Yahyanejad, Saeed and Hayat, Samira and Yanmaz, Evsen and Andre, Torsten and Khan, Asif and Vukadinovic, Vladimir and Bettstetter, Christian and Hellwagner, Hermann and Rinner, Bernhard},
% title = {An Autonomous Multi-UAV System for Search and Rescue},
% booktitle = {Proceedings of the First Workshop on Micro Aerial Vehicle Networks, Systems, and Applications for Civilian Use},
% series = {DroNet '15},
% year = {2015},
% isbn = {978-1-4503-3501-0},
% location = {Florence, Italy},
% pages = {33--38},
% numpages = {6},
% url = {http://doi.acm.org/10.1145/2750675.2750683},
% doi = {10.1145/2750675.2750683},
% acmid = {2750683},
% publisher = {ACM},
% address = {New York, NY, USA},
% keywords = {aerial communication, search and rescue, system architecture, uav, unmanned aerial vehicles, video streaming}
%}


text:
#======================================#
#           SUMMARY/LICENCE            #
#--------------------------------------#
SUMMARY = "interface to seccomp filtering mechanism"

LICENSE = "LGPL-2.1"
LIC_FILES_CHKSUM = "file://LICENSE;beginline=0;endline=1;md5=8eac08d22113880357ceb8e7c37f989f"

#======================================#
#           REQUIRE/INHERIT            #
#--------------------------------------#
inherit autotools pkgconfig

#======================================#
#                SOURCE                #
#--------------------------------------#
SRC_URI = "https://github.com/seccomp/libseccomp/releases/download/v${PV}/libseccomp-${PV}.tar.gz;name=source"

SRC_URI[source.md5sum] = "e74a626bea0cd607c23229b10b5f93da"
SRC_URI[source.sha256sum] = "3ddc8c037956c0a5ac19664ece4194743f59e1ccd4adde848f4f0dae7f77bca1"

#======================================#
#           DEPENDS/PROVIDES           #
#--------------------------------------#

#======================================#
#         BUILD CONFIGURATIONS         #
#--------------------------------------#

#======================================#
#                TASKS                 #
#--------------------------------------#

#======================================#
#            PACKAGES/FILES            #
#--------------------------------------#

#======================================#
#            INSTALL SCRIPT            #
#--------------------------------------#

#======================================#
#             ALTERNATIVES             #
#--------------------------------------#

#======================================#
#           USERADD/SYSTEMD            #
#--------------------------------------#

#======================================#
#                 TEST                 #
#--------------------------------------#


text:
DESCRIPTION = "Little cms is a small-footprint, speed optimized color management engine."
SECTION = "libs"
LICENSE = "LGPL"
SRC_URI = "${SOURCEFORGE_MIRROR}/lcms/lcms-${PV}.tar.gz"

PR = "r2"

inherit autotools

AUTOTOOLS_STAGE_PKGCONFIG = "1"

# broken lz linking in tifficc, we don't need it * Arris *
EXTRA_OECONF_samygo = "--without-tiff"

do_stage() {
	autotools_stage_all
}

repository: metalsky/SamyGO

repo_name: metalsky/SamyGO


text:
@inproceedings{sepulvado_social_2020,
 abstract = {The Synthetic Biology Knowledge System (SBKS) is a
repository system designed to aid synthetic biologists by interlinking the synthetic biology literature through the application of ontologies. While many of these linking tasks are concerned with DNA/protein sequences, the organisms they are cultivated in, or chemical products of cellular processes, it is equally important to interlink the various ethical
issues that concern the tailoring biological life in the form of bacteria and yeasts for participation in industrial processes to consider. Thus, an additional linking task for the SBKS is to link pertinent bioethics articles to biological entities, processes, and products that are central to the research of synthetic biologists. In this paper, we make a preliminary analysis of the state of the ethical discourse in the burgeoning synthetic biology discipline.},
 address = {Virtual},
 author = {Sepulvado, Brandon and Jett, Jacob and Downie, Stephen},
 booktitle = {IWBDA2020Proceedings},
 keywords = {Ethics, Publishing, Synthetic Biology},
 language = {English},
 month = {August},
 pages = {70--71},
 title = {The Social and Conceptual Organization of Synthetic Biology Ethics},
 url = {https://www.iwbdaconf.org/2020/docs/IWBDA2020Proceedings.pdf},
 year = {2020}
}


text:
@book{Anke.2005,
 address = {Dresden},
 author = {Anke, Jürgen},
 file = {http://www.worldcat.org/oclc/181472769},
 isbn = {3-938863-04-8},
 keywords = {Beschaffungsplanung;Entscheidungsunterstützungssystem;Strategisches Management},
 publisher = {TUDpress},
 title = {Entscheidungsunterstützung in der strategischen Beschaffung: Systematische Identifikation potenzieller Einsatzbereiche},
 year = {2005}
}


text:
@Article{spatstat2005,
  title = {{spatstat}: An {R} Package for Analyzing Spatial Point Patterns},
  author = {Adrian Baddeley and Rolf Turner},
  journal = {Journal of Statistical Software},
  year = {2005},
  volume = {12},
  number = {6},
  pages = {1--42},
  url = {http://www.jstatsoft.org/v12/i06/},
}

repository: bsaul/solidagos

repo_name: bsaul/solidagos


text:
DESCRIPTION = "Test application for OpenGL ES 2"
LICENSE = "unknown"
LIC_FILES_CHKSUM = "file://${PN}.c;endline=3;md5=c285c12ebbc688f86180e40b2e3246d7"
DEPENDS = "virtual/egl"
PROVIDES = "hellogles2"

PR = "r0"
S = "${WORKDIR}"

SRC_URI = "file://${PN}.c"

do_compile () {
    ${CC} ${CFLAGS} ${LDFLAGS} ${PN}.c -lGLESv2 -lEGL -lX11 -o ${PN}
}

do_install () {
    mkdir -p "${D}${bindir}/"
    install -m 0755 "${S}/${PN}" "${D}${bindir}/"
}

FILES_${PN} = "${bindir}/${PN}"


text:
@article{stegen2008relationship,
 author = {Stegen, James C and White, Ethan P},
 journal = {Ecology letters},
 number = {12},
 pages = {1287--1293},
 publisher = {Blackwell Publishing Ltd},
 title = {On the relationship between mass and diameter distributions in tree communities},
 volume = {11},
 year = {2008}
}

repository: weecology/website

repo_name: weecology/website

gha_language: TeX


text:
file(REMOVE_RECURSE
  "CMakeFiles/gara_candriai_2.dir/main.cpp.o"
  "gara_candriai_2.pdb"
  "gara_candriai_2"
)

# Per-language clean rules from dependency scanning.
foreach(lang CXX)
  include(CMakeFiles/gara_candriai_2.dir/cmake_clean_${lang}.cmake OPTIONAL)
endforeach()


text:
@ARTICLE{sabuncu:11,
      AUTHOR = "Mert R. Sabuncu and Rahul S. Desikan and Jorge Sepulcre and Boon Thye T. Yeo and Hesheng Liu and Nicholas J. Schmansky and Martin Reuter and Michael W. Weiner and Randy L. Buckner and Reisa A. Sperling and Bruce Fischl and ADNI",
      TITLE = "The Dynamics of Cortical and Hippocampal Atrophy in {A}lzheimer Disease",
      JOURNAL = "Arch Neurol.",
      VOLUME = "68",
      NUMBER = "8",
      PAGES = "1040-1048",
      URL = "http://dx.doi.org/10.1001/archneurol.2011.167  [Titel anhand dieser DOI in Citavi-Projekt übernehmen] ",
      DOI = "DOI : 10.1001/archneurol.2011.167  [Titel anhand dieser DOI in Citavi-Projekt übernehmen] ",
      YEAR = "2011",
}