Results 1  10
of
454,258
Quick Overview
"... widely recognized phrase has been slightly changed to Complementary and Integrative Medicine. Throughout this chapter the acronym CAM will be used to denote this growing domain of treatments. ■ Complementary therapies are generally described as unconventional treatment modalities and approaches tha ..."
Abstract
 Add to MetaCart
widely recognized phrase has been slightly changed to Complementary and Integrative Medicine. Throughout this chapter the acronym CAM will be used to denote this growing domain of treatments. ■ Complementary therapies are generally described as unconventional treatment modalities and approaches that are (usually) nonsurgical and nonpharmaceutical but have known efficacy used with mainstream care (i.e., scientifically based care). Alternative therapies are generally described as therapies or approaches which replace or are used instead of traditional, mainstream treatment and have not been scientifically proven. Alternative therapies frequently do not have a scientific basis and sometimes have even been disproved (Society of Integrative Medicine (SIO), 2009; National Center for Complementary Medicine (NCCAM), 2010). That being said, it is really the intent with which the therapy is used that defines it. For example, high dose vitamin C infusions are complementary therapy when used in conjunction with “traditional ” or “conventional ” therapies. They are alternative therapy if used “instead ” of “traditional ” or “conventional ” therapies. ■ The term “integrative medicine ” has been gaining acceptance in medical academia. In
A Quick Overview of Larch/C++
 JOURNAL OF OBJECTORIENTED PROGRAMMING
, 1994
"... This paper gives a quick overview of Larch/C++, an interface specification language for C++. Through examples, we explain declarations, function specifications, class specifications, and template specifications. An extended example is given in the last section. The reader is assumed to have some fam ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
This paper gives a quick overview of Larch/C++, an interface specification language for C++. Through examples, we explain declarations, function specifications, class specifications, and template specifications. An extended example is given in the last section. The reader is assumed to have some
SU(N) chiral gauge theories on the lattice: a quick overview
, 2004
"... We describe how an SU(N) chiral gauge theory can be put on the lattice using nonperturbative gauge fixing. In particular, we explain how the Gribov problem is dealt with. Our construction is local, avoids doublers, and weakcoupling perturbation theory applies at the critical point which defines th ..."
Abstract
 Add to MetaCart
We describe how an SU(N) chiral gauge theory can be put on the lattice using nonperturbative gauge fixing. In particular, we explain how the Gribov problem is dealt with. Our construction is local, avoids doublers, and weakcoupling perturbation theory applies at the critical point which defines the continuum limit of our lattice chiral gauge theory. The construction of lattice chiral gauge theories (ChGTs) is an old problem. Because of the Nielsen–Ninomiya theorem [1] and the chiral anomaly [2], one either has to give up on chiral symmetry on the lattice, but enforce it to reemerge in the continuum limit, or modify the lattice definition of chiral symmetry in order to maintain exact chiral symmetry on the lattice. For reviews, see refs. [3,4]. Here we follow the first approach, reporting on our recent completion of a construction based on nonperturbative gauge fixing [5]. We will have some comments on the second approach towards the end. If gauge invariance is broken, the longitudinal modes of the gauge field couple to the fermions. If the dynamics of the longitudinal modes is uncontrolled, their “backreaction ” changes the fermion spectrum from chiral to vectorlike [3]. A key point here is that having a reasonable definition of the fermion determinant for smooth gauge fields does not solve the problem. A solution is to construct a lattice theory with a critical point whose universality class is described by the perturbative expansion of the target continuum theory [6]. A renormalizable gauge is mandatory [7], so that, in spite of the lack of gauge invariance of the regulated theory, we can use the usual powercounting arguments together with Slavnov–Taylor identities to construct the counter terms, which are finite in number. ∗ Presenter at conference gauge field’s mass
Topics in Bioinformatics I A Quick Overview of Multiple Sequence Alignment
"... We assume that the reader is reasonably familiar with pairwise sequence alignment, such as obtained from a standard dynamic programming formulation (NeedlemanWunsch or SmithWaterman), but restate the goals in a slightly different fashion. Pairwise Alignment. We can distinguish two main views of pa ..."
Abstract
 Add to MetaCart
We assume that the reader is reasonably familiar with pairwise sequence alignment, such as obtained from a standard dynamic programming formulation (NeedlemanWunsch or SmithWaterman), but restate the goals in a slightly different fashion. Pairwise Alignment. We can distinguish two main views of pairwise alignment. The first is the evolutionary view. In this context, to align two sequences is to infer a collection of evolutionary changes (typically indels and substitutions) that could have transformed one sequence into the other. There will be many possible answers, of course, so the optimization used in most alignment programs is intended to return a collection of lowest cost. This may be undesirable, in that nature need not have followed a path of least cost. We could replace “least cost ” by “maximum likelihood (ML),” which would get around this problem, but an ML approach requires a parameterized model of evolution, something we may not be able to design correctly. We should note that this particular view of alignment is not necessarily compatible with the very name of the procedure, which suggests a columnbycolumn arrangement.
1.1 Random Generation of Combinatorial Structures: a Quick Overview
"... The Boltzmann model for the random generation of “decomposable ” combinatorial structures is a set of techniques that allows for efficient random sampling algorithms for a large class of families of discrete objects. The usual requirement of sampling uniformly from the set of objects of a given size ..."
Abstract
 Add to MetaCart
The Boltzmann model for the random generation of “decomposable ” combinatorial structures is a set of techniques that allows for efficient random sampling algorithms for a large class of families of discrete objects. The usual requirement of sampling uniformly from the set of objects of a given size is somehow relaxed, though uniformity among objects of each size is still ensured. Generating functions, rather than the enumeration sequences they are based on, are the crucial ingredient. We give a brief description of the general theory, as well as a number of newer developments.
ONLINE LEARNING AND GAME THEORY. A QUICK OVERVIEW WITH RECENT RESULTS AND APPLICATIONS
, 2015
"... We study one of the main concept of online learning and sequential decision problem known as regret minimization. We investigate three different frameworks, whether data are generated accordingly to some i.i.d. process, or when no assumption whatsoever are made on their generation and, finally, whe ..."
Abstract
 Add to MetaCart
We study one of the main concept of online learning and sequential decision problem known as regret minimization. We investigate three different frameworks, whether data are generated accordingly to some i.i.d. process, or when no assumption whatsoever are made on their generation and, finally, when they are the consequences of some sequential interactions between players. The overall objective is to provide a comprehensive introduction to this domain. In each of these main setups, we define and analyze classical algorithms and we analyze their performances. Finally, we also show that some concepts of equilibria that emerged in game theory are learnable by players using online learning schemes while some other concepts are not learnable.
Nearoptimal hashing algorithms for approximate nearest neighbor in high dimensions
, 2008
"... In this article, we give an overview of efficient algorithms for the approximate and exact nearest neighbor problem. The goal is to preprocess a dataset of objects (e.g., images) so that later, given a new query object, one can quickly return the dataset object that is most similar to the query. The ..."
Abstract

Cited by 443 (7 self)
 Add to MetaCart
In this article, we give an overview of efficient algorithms for the approximate and exact nearest neighbor problem. The goal is to preprocess a dataset of objects (e.g., images) so that later, given a new query object, one can quickly return the dataset object that is most similar to the query
Discussion Molecular epidemiology of clonal diploids: A quick overview and a short DIY (do it yourself) notice
, 2005
"... In this short review we report the basic notions needed for understanding the population genetics of clonal diploids. We focus on the consequences of clonality on the distribution of genetic diversity within individuals, between individuals and between populations. We then summarise how to detect cl ..."
Abstract
 Add to MetaCart
In this short review we report the basic notions needed for understanding the population genetics of clonal diploids. We focus on the consequences of clonality on the distribution of genetic diversity within individuals, between individuals and between populations. We then summarise how to detect clonality in mainly sexual populations, conversely, how to detect sexuality in mainly clonal populations and also how genetic differentiation between populations is affected by clonality in diploids. This information is then used for building recipes on how to analyse and interpret genetic polymorphism data in molecular epidemiology studies of clonal diploids.
Results 1  10
of
454,258