pinecone/core-2020-05-10-deduplication huggingface dataset:
Vortices in Bose-Einstein Condensates: Theory

Vortices are pervasive in nature, representing the breakdown of laminar fluid
flow and hence playing a key role in turbulence. The fluid rotation associated
with a vortex can be parameterized by the circulation $\Gamma=\oint {\rm d}{\bf
r}\cdot{\bf v}({\bf r})$ about the vortex, where ${\bf v}({\bf r})$ is the
fluid velocity field. While classical vortices can take any value of
circulation, superfluids are irrotational, and any rotation or angular momentum
is constrained to occur through vortices with quantized circulation. Quantized
vortices also play a key role in the dissipation of transport in superfluids.
In BECs quantized vortices have been observed in several forms, including
single vortices, vortex lattices, and vortex pairs and rings. The recent
observation of quantized vortices in a fermionic gas was taken as a clear
signature of the underlying condensation and superfluidity of fermion pairs. In
addition to BECs, quantized vortices also occur in superfluid Helium, nonlinear
optics, and type-II superconductors.Comment: 17 pages, 2 figures. Book chapter to appear in "Emergent Nonlinear
  Phenomena in Bose-Einstein condensates: Theory and Experiment"
  (Springer-Verlag)
Introduction to higgs sector: Theory and phenomenology

Proceedings of the 2nd International Summer School in High Energy Physics, Muğla, 25–30 September 2006This review is based on lectures delivered at International Summer School on High Energy Physics, in Akyaka, Mugla, Turkey, September 2006. The goal of the review is to introduce junior graduate students, having a some knowledge of field theory, to the problem of mass generation and its physical consequences. The review starts with the statements and a toy model of mass generation in Sect. 2. In Sect. 3 a model of weak interactions is constructed and its predictions are compared with experimental results obtained so far. Given in Sect. 4 is search strategies for Higgs boson, the only remnant of the mechanism that gives mass to matter, by referring to model predictions and experimental facilities. Finally, in Sect. 5, given are a summary of results plus reasons for and expectations from models which rehabilitate the minimal model constructed in Sect. 3.Turkish Academy of Sciences through GEBIP grant, and Scientific and Technical Research Council of Turkey through project 104T50
Reducing the Representation Complexity of Lattice-Based Taxonomies

<p>Representing concept lattices constructed from large contexts often results in heavy, complex diagrams that can be impractical to handle and, eventually, to make sense of. In this respect, many concepts could allegedly be dropped from the lattice without impairing its relevance towards a taxonomy description task at a certain level of detail. We propose a method where the notion of stability is introduced to select potentially more pertinent concepts. We present some theoretical properties of stability and discuss several use cases where taxonomy building is an issue.</p
PCA and K-Means decipher genome

In this paper, we aim to give a tutorial for undergraduate students studying
statistical methods and/or bioinformatics. The students will learn how data
visualization can help in genomic sequence analysis. Students start with a
fragment of genetic text of a bacterial genome and analyze its structure. By
means of principal component analysis they ``discover'' that the information in
the genome is encoded by non-overlapping triplets. Next, they learn how to find
gene positions. This exercise on PCA and K-Means clustering enables active
study of the basic bioinformatics notions. Appendix 1 contains program listings
that go along with this exercise. Appendix 2 includes 2D PCA plots of triplet
usage in moving frame for a series of bacterial genomes from GC-poor to GC-rich
ones. Animated 3D PCA plots are attached as separate gif files. Topology
(cluster structure) and geometry (mutual positions of clusters) of these plots
depends clearly on GC-content.Comment: 18 pages, with program listings for MatLab, PCA analysis of genomes
  and additional animated 3D PCA plot
Comparison of a theoretical impedance model with experimental measurements of pulsatile blood flow

The velocity dependent changes in the impedance of flowing blood have been widely reported in the literature. These changes have been suggested as a source of the impedance change of the thorax measured during Impedance Cardiography techniques. In this study, a theoretical model incorporating red blood cell orientation, was developed to predict the impedance of pulsatile blood as it flows through rigid tubes. Experimental measurements were recorded for comparisons with the theoretical model. Bovine blood was pumped through rigid tubes in a mock circulatory system and its impedance and velocity were measured. Experimental and theoretical impedance and velocity waveforms are presented for a range of cardiac parameters such as pulse rate, stroke volume and systolic/ diastolic ratio. Comparisons show that the theoretical model successfully simulated features of the experimental waveforms. These were: 1) a difference between impedance during accelerating and decelerating flow at the same velocity, 2) an instantaneous impedance response to acceleration, and 3) a decay in impedance during deceleration to zero flow. Both the modelled and experimental impedance data also indicate a good cross correlation with the velocity (r=0.73 and 0.65 respectively at a pulse rate of 70 beats per minute)
The electrical impedance of pulsatile blood flowing through rigid tubes: an experimental investigation

Small fluctuations present in an Impedance Cardiogram are often dismissed as noise, but may be due to unknown physiological origins. One such origin suggested in literature is the impedance variation induced by changes in red blood cell orientation during pulsatile blood flow. This study investigated the relationship between the impedance, velocity and acceleration of blood as it pulses during the cardiac cycle. This was achieved experimentally by pumping blood through rigid tubes in a mock circulatory system while measuring the impedance and velocity of the blood. Analysis of collected data confirms that impedance responds to changes in both velocity and acceleration. During acceleration, impedance and velocity are linearly related. However, during deceleration, it was found that the relationship between impedance and velocity is non linear. As velocity increases, the relationship becomes linear with a reducing slope. This indicates that for the same change in acceleration at low velocities, the impedance response is significantly larger than at higher velocities. Experimental data demonstrating these trends is presented for varied pulse rates (20 – 100 beats per minute), stroke volumes (20 – 60 ml) and systolic/diastolic ratios (50/50 – 30/70)
A Pilot Study For Tissue Characterisation Using Bioimpedance Mapping

Bioimpedance has shown potential as a method for characterising biological tissue with the use of the tetrapolar electrode configuration. This configuration has been shown to distinguish between normal squamous epithelium and Cervical Intra-epithelial Neoplasia (CIN) [1]. The tetrapolar configuration has also been shown to produce anomalous results in the form of an increase in measured impedance when a low impedance lesion is located between a drive and measurement electrode [2]. We have investigated a possible solution to this problem using bioimpedance mapping employing an array of 25 (5x5) electrodes. The array allows 64 individual tetrapolar measurements to be taken on 16 locations giving an impedance map of 49 mm2 on the surface of a tissue sample. Multiple measurements at each location reduce the chance of anomalous results since these can later be identified and excluded. Preliminary results on bovine blood have shown good separation of the measured impedance between areas of different haematocrit and provided a visual representation of the surface impedance. Impedance maps have been obtained for a range of haematocrit between 0 - 80%
Generalized ordering-search for learning directed probabilistic logical models

Recently, there has been an increasing interest in directed probabilistic logical models and a variety of languages for describing such models has been proposed. Although many authors provide high-level arguments to show that in principle models in their language can be learned from data, most of the proposed learning algorithms have not yet been studied in detail. We introduce an algorithm, generalized ordering-search, to learn both structure and conditional probability distributions (CPDs) of directed probabilistic logical models. The algorithm upgrades the ordering-search algorithm for Bayesian networks. We use relational probability trees as a representation for the CPDs. We present experiments on blocks world domains, a gene domain and the Cora dataset.status: publishe
Free modal algebras: a coalgebraic perspective.

This is the author’s final draft of the paper published as Lecture Notes in Computer Science, 2007, 4624, pp. 143-157.  The original publication is available at www.springerlink.com, Doi: 10.1007/978-3-540-73859-6_10.In this paper we discuss a uniform method for constructing free modal and distributive modal algebras. This method draws on works by (Abramsky 2005) and (Ghilardi 1995).We revisit the theory of normal forms for modal logic and derive a normal form representation for positive modal logic. We also show that every finitely generated free modal and distributive modal algebra axiomatised by equations of rank 1 is a reduct of a temporal algebra
Graphical Encoding of a Spatial Logic for the pi-Calculus

This paper extends our graph-based approach to the verification of spatial properties of π-calculus specifications. The mechanism is based on an encoding for mobile calculi where each process is mapped into a graph (with interfaces) such that the denotation is fully abstract with respect to the usual structural congruence, i.e., two processes are equivalent exactly when the corresponding encodings yield isomorphic graphs. Behavioral and structural properties of π-calculus processes expressed in a spatial logic can then be verified on the graphical encoding of a process rather than on its textual representation. In this paper we introduce a modal logic for graphs and define a translation of spatial formulae such that a process verifies a spatial formula exactly when its graphical representation verifies the translated modal graph formula.\u
GPX - Gardens Point XML IR at INEX 2006

Abstract The INEX 2006 evaluation was based on the Wikipedia collection in XML format. It consisted of several tasks that required different approaches. In this paper we described the approach that we adopted in an attempt to satisfy the requirements of all the tasks, Thorough, Focused, Relevant in Context, and Best in Context. We have used the same underlying system to approach all tasks. The retrieval strategy is\ud
based on the construction of a collection sub-tree, consisting of all nodes that contain one or more of the search terms. Nodes containing search terms are then assigned a score using the GPX ranking scheme which incorporates TF-IDF or BM25 variants, but extends them. Scores are propagated upwards in the document XML tree, and finally all XML elements are ranked. We present results that demonstrate that the\ud
approach is versatile and produces consistently good performance. We also provide empirical analysis of the GPX ranking scheme and demonstrate its performance against a baseline TF-IDF and a BM25 scoring scheme
Fusing visual and textual retrieval techniques to effectively search large collections of Wikipedia images

This paper presents an experimental study that examines the performance of various combination techniques for content-based image retrieval using a fusion of visual and textual search results. The evaluation is comprehensively benchmarked using more than 160,000 samples from INEX-MM2006 images dataset and the corresponding XML documents. For visual search, we have successfully combined Hough transform, Object’s color histogram, and Texture (H.O.T). For comparison purposes, we used the provided UvA features. Based on the evaluation, our submissions show that Uva+Text combination performs most effectively, but it is closely followed by our H.O.T- (visual only) feature. Moreover, H.O.T+Text performance is still better than UvA (visual) only. These findings show that the combination of effective text and visual search results can improve the overall performance of CBIR in Wikipedia collections which contain a heterogeneous (i.e. wide) range of genres and topics
What XML users may want

It is assumed that by focusing on retrieval at a granularity lower than\ud
documents that XML-IR systems will better satisfy users’ information need\ud
than traditional IR systems. Participates in INEX’s Ad-hoc track develop XMLIR\ud
systems based upon this assumption, using an evaluation methodology in the\ud
tradition of Cranfield. However, since the inception of INEX, debate has raged\ud
on how applicable some of the Ad-hoc tasks are to real user tasks. The purpose\ud
of the User-Case Studies track from to explore the application of XML-IR systems\ud
from the users’ perspective. This paper outlines QUT’s involvement in\ud
this task. For our involvement we conducted a user experiment using an XMLIR\ud
system (GPX) and three interfaces: a standard keyword interface, a natural\ud
language interface (NLPX) and a query-by-template interface (Bricks). Following\ud
the experiment we interviewed the users about their experience and asked\ud
them - in comparison with a traditional XML-IR system - what type of tasks\ud
would they use an XML-IR system for, what extra information they would need\ud
to interact with an XML-IR system and how would they want to see XML-IR\ud
results presented. It is hoped that the outcomes of this study will bring us closer\ud
to understanding what users want from XML-IR systems
Maximizing Maximal Angles for Plane Straight-Line Graphs

Let $G=(S, E)$ be a plane straight-line graph on a finite point set
$S\subset\R^2$ in general position. The incident angles of a vertex $p \in S$
of $G$ are the angles between any two edges of $G$ that appear consecutively in
the circular order of the edges incident to $p$.
  A plane straight-line graph is called $\phi$-open if each vertex has an
incident angle of size at least $\phi$. In this paper we study the following
type of question: What is the maximum angle $\phi$ such that for any finite set
$S\subset\R^2$ of points in general position we can find a graph from a certain
class of graphs on $S$ that is $\phi$-open? In particular, we consider the
classes of triangulations, spanning trees, and paths on $S$ and give tight
bounds in most cases.Comment: 15 pages, 14 figures. Apart of minor corrections, some proofs that
  were omitted in the previous version are now include
On-the-go machine vision sensing of cotton plant geometric parameters: first results

Plant geometrical parameters such as internode length (i.e. the distance between successive branches on the main stem) indicate water stress in cotton. This paper describes a machine vision system that has been designed to measure internode length for the purpose of determining real-time cotton plant irrigation requirement. The imaging system features an enclosure which continuously traverses the crop canopy and forces the flexible upper main stem of individual plants against a glass panel at the front of the enclosure, hence allowing images of the plant to be captured in a fixed object plane. Subsequent image processing of selected video sequences enabled detection of the main stem in 88% of frames. However, node detection\ud
was subject to a high false detection rate due to leaf edges present in the images. Manual identification of nodes in the acquired imagery enabled measurement of internode lengths with 3% standard error
The impact of European integration on institutional change in Switzerland

Europe comprises a large number of large and small countries with varying internal rules and norms, and the differences are still remarkable.1 The literature on varieties of capitalism, for example, highlights common features for some of the European countries during specific periods of time, and even within the European Union not convergence, but instead uneasy rivalry, seems to have prevailed.2 Swiss firms had to take into account different national rules if they wanted to successfully do business with and in these countries. Furthermore, the cultural diversity and the federal structure of Switzerland led to the evolution of a variety of rules within the country itself. Firms were thus used to coping with different legal and cultural systems both at home and abroad
An Agent-Based Approach to Self-Organized Production

The chapter describes the modeling of a material handling system with the
production of individual units in a scheduled order. The units represent the
agents in the model and are transported in the system which is abstracted as a
directed graph. Since the hindrances of units on their path to the destination
can lead to inefficiencies in the production, the blockages of units are to be
reduced. Therefore, the units operate in the system by means of local
interactions in the conveying elements and indirect interactions based on a
measure of possible hindrances. If most of the units behave cooperatively
("socially"), the blockings in the system are reduced.
  A simulation based on the model shows the collective behavior of the units in
the system. The transport processes in the simulation can be compared with the
processes in a real plant, which gives conclusions about the consequencies for
the production based on the superordinate planning.Comment: For related work see http://www.soms.ethz.c
On-line Viterbi Algorithm and Its Relationship to Random Walks

In this paper, we introduce the on-line Viterbi algorithm for decoding hidden
Markov models (HMMs) in much smaller than linear space. Our analysis on
two-state HMMs suggests that the expected maximum memory used to decode
sequence of length $n$ with $m$-state HMM can be as low as $\Theta(m\log n)$,
without a significant slow-down compared to the classical Viterbi algorithm.
Classical Viterbi algorithm requires $O(mn)$ space, which is impractical for
analysis of long DNA sequences (such as complete human genome chromosomes) and
for continuous data streams. We also experimentally demonstrate the performance
of the on-line Viterbi algorithm on a simple HMM for gene finding on both
simulated and real DNA sequences
Using cases utility for heuristic planning improvement

Proceedings of: 7th International Conference on Case-Based Reasoning (ICCBR07), Belfast, Northern Ireland, UK, 13 - 16 August 2007Current efficient planners employ an informed search guided by a heuristic function that is quite expensive to compute. Thus, ordering nodes in the search tree becomes a key issue, in order to select efficiently nodes to evaluate from the successors of the current search node. In a previous work, we successfully applied a CBR approach to order nodes for evaluation, thus reducing the number of calls to the heuristic function. However, once cases were learned, they were not modified according to their utility on solving planning problems. We present in this work a scheme for learning case quality based on its utility during a validation phase. The qualities obtained determine the way in which these cases are preferred in the retrieval and replay processes. Then, the paper shows some experimental results for several benchmarks taken from the International Planning Competition (IPC). These results show the planning performance improvement when case utilities are used.Publicad
Team Playing Behavior in Robot Soccer: A Case-Based Reasoning Approach

The original publication is available at http//:www.springerlink.comThis paper presents extensions and improvements of previous work, where we defined a CBR system for action selection in the robot soccer domain. We show empirical results obtained with real robots, comparing our team playing approach with an individualist approach.Partial funding by the Spanish Ministry of Education and Science project MID-CBR (TIN2006-15140-C03-01) and partly sponsored by BBNT Solutions, LLC under contract no. FA8760-04-C-0002. Raquel Ros holds a scholarship from the Generalitat de Catalunya Government.Peer reviewe
Observations of the High Redshift Universe

(Abridged) In these lectures aimed for non-specialists, I review progress in understanding how galaxies form and evolve. Both the star formation history and assembly of stellar mass can be empirically traced from redshifts z~6 to the present, but how the various distant populations inter-relate and how stellar assembly is regulated by feedback and environmental processes remains unclear. I also discuss how these studies are being extended to locate and characterize the earlier sources beyond z~6. Did early star-forming galaxies contribute significantly to the reionization process and over what period did this occur? Neither theory nor observations are well-developed in this frontier topic but the first results presented here provide important guidance on how we will use more powerful future facilities
Removing shape-preserving transformations in Square-Root Elastic (SRE) framework for shape analysis of curves.

This paper illustrates and extends an efficient framework, called the square-root-elastic (SRE) framework, for studying shapes of closed curves, that was first introduced in [2]. This framework combines the strengths of two important ideas - elastic shape metric and path-straightening methods - for finding geodesics in shape spaces of curves. The elastic metric allows for optimal matching of features between curves while path-straightening ensures that the algorithm results in geodesic paths. This paper extends this framework by removing two important shape preserving transformations: rotations and re-parameterizations, by forming quotient spaces and constructing geodesics on these quotient spaces. These ideas are demonstrated using experiments involving 2D and 3D curves
Diagnosability of Fuzzy Discrete Event Systems

In order to more effectively cope with the real-world problems of vagueness,
{\it fuzzy discrete event systems} (FDESs) were proposed recently, and the
supervisory control theory of FDESs was developed. In view of the importance of
failure diagnosis, in this paper, we present an approach of the failure
diagnosis in the framework of FDESs. More specifically: (1) We formalize the
definition of diagnosability for FDESs, in which the observable set and failure
set of events are {\it fuzzy}, that is, each event has certain degree to be
observable and unobservable, and, also, each event may possess different
possibility of failure occurring. (2) Through the construction of
observability-based diagnosers of FDESs, we investigate its some basic
properties. In particular, we present a necessary and sufficient condition for
diagnosability of FDESs. (3) Some examples serving to illuminate the
applications of the diagnosability of FDESs are described. To conclude, some
related issues are raised for further consideration.Comment: 14 pages; revisions have been mad