pinecone/core-2020-05-10-deduplication huggingface dataset:
Simple Atoms, Quantum Electrodynamics and Fundamental Constants

This review is devoted to precision physics of simple atoms. The atoms can
essentially be described in the framework of quantum electrodynamics (QED),
however, the energy levels are also affected by the effects of the strong
interaction due to the nuclear structure. We pay special attention to QED tests
based on studies of simple atoms and consider the influence of nuclear
structure on energy levels. Each calculation requires some values of relevant
fundamental constants. We discuss the accurate determination of the constants
such as the Rydberg constant, the fine structure constant and masses of
electron, proton and muon etc.Comment: A talk at PSAS (St. Petersburg, 2002
Multi-Party Pseudo-Telepathy

Quantum entanglement, perhaps the most non-classical manifestation of quantum
information theory, cannot be used to transmit information between remote
parties. Yet, it can be used to reduce the amount of communication required to
process a variety of distributed computational tasks. We speak of
pseudo-telepathy when quantum entanglement serves to eliminate the classical
need to communicate. In earlier examples of pseudo-telepathy, classical
protocols could succeed with high probability unless the inputs were very
large. Here we present a simple multi-party distributed problem for which the
inputs and outputs consist of a single bit per player, and we present a perfect
quantum protocol for it. We prove that no classical protocol can succeed with a
probability that differs from 1/2 by more than a fraction that is exponentially
small in the number of players. This could be used to circumvent the detection
loophole in experimental tests of nonlocality.Comment: 11 pages. To be appear in WADS 2003 proceeding
A basis of tiling motifs for generating repeated patterns and its complexity for higher quorum

International audienceWe investigate the problem of determining the basis of motifs (a form of repeated patterns with don't cares) in an input string. We give new upper and lower bounds on the problem, introducing a new notion of basis that is provably smaller than (and contained in) previously defined ones. Our basis can be computed in less time and space, and is still able to generate the same set of motifs. We also prove that the number of motifs in all these bases grows exponentially with the quorum, the minimal number of times a motif must appear. We show that a polynomial-time algorithm exists only for fixed quorum
Sequence prediction based on monotone complexity

This paper studies sequence prediction based on the monotone Kolmogorov complexity Km = − logm, i.e. based on universal deterministic/one-part MDL. m is extremely close to Solomonoff’s prior M, the latter being an excellent predictor in deterministic as well as probabilistic environments, where performance is measured in terms of convergence of posteriors or losses. Despite this closeness to M, it is difficult to assess the prediction quality of m, since little is known about the closeness of their posteriors, which are the important quantities for prediction. We show that for deterministic computable environments, the “posterior” and losses of m converge, but rapid convergence could only be shown on-sequence; the off-sequence behavior is unclear. In probabilistic environments, neither the posterior nor the losses converge, in general
A user evaluation of hierarchical phrase browsing

Phrase browsing interfaces based on hierarchies of phrases extracted automatically from document collections offer a useful compromise between automatic full-text searching and manually-created subject indexes. The literature contains descriptions of such systems that many find compelling and persuasive. However, evaluation studies have either been anecdotal, or focused on objective measures of the quality of automatically-extracted index terms, or restricted to questions of computational efficiency and feasibility. This paper reports on an empirical, controlled user study that compares hierarchical phrase browsing with full-text searching over a range of information seeking tasks. Users found the results located via phrase browsing to be relevant and useful but preferred keyword searching for certain types of queries. Users experiences were marred by interface details, including inconsistencies between the phrase browser and the surrounding digital library interface
Preserving the fabric of our lives: a survey of Web preservation initiatives

This paper argues that the growing importance of the World Wide Web means that Web sites are key candidates for digital preservation. After an brief outline of some of the main reasons why the preservation of Web sites can be problematic, a review of selected Web archiving initiatives shows that most current initiatives are based on combinations of three main approaches: automatic harvesting, selection and deposit. The paper ends with a discussion of issues relating to collection and access policies, software, costs and preservation
Process support for evolving active architectures

This work is supported by the EC Framework V project ArchWare (IST-001-32360), and the UK Engineering and Physical Sciences Research Council (EPSRC) under grants GR/R51872 (Reflective Application Framework for Distributed Architectures) and GR/R67743 (my Grid: Directly Supporting the E-Scientist).Long-lived, architecture-based software. systems are increasingly important. Effective process support for these systems depends upon recognising their compositional nature and the active, role of their architecture in guiding evolutionary development. Current process approaches have difficulty with run-time architecture changes that are not known a priori, and dealing with extant data during system evolution. This paper describes an approach that deals with these issues. It is based on a process-aware architecture description language (ADL), with explicit compose and decompose constructs, and with a hyper-code representation for dealing with extant data and code. An example is given to illustrate the ease-of-use benefits of this approach.Postprin
Scene Reconstruction Based on Constraints: Details on the Equation System Decomposition

International audienceWe present a new approach to 3D scene modeling based on geometrical constraints. Contrary to most of the existing methods, we obtain 3D scene models that respect the given constraints exactly. Our tool can describe a large variety of linear and non-linear constraints in a flexible way. Our approach is based on a dictionary of so-called r-methods, based on theorems in geometry, which can solve a subset of geometrical constraints in a very efficient way. Two fast and complete graph-based algorithms are proposed to find a reduced parametrization of a scene, and to decompose the equation system in a sequence of r-methods
Numerical investigations of scaling at the Anderson transition

At low temperature T, a significant difference between the behavior of
crystals on the one hand and disordered solids on the other is seen:
sufficiently strong disorder can give rise to a transition of the transport
properties from conducting behavior with finite resistance R to insulating
behavior with R=infinity as T -> 0. This well-studied phenomenon is called the
disorder-driven metal-insulator transition and it is characteristic to
non-crystalline solids. In this review of recent advances, we have presented
results of transport studies in disordered systems, ranging from modifications
of the standard Anderson model of localization to effects of a two-body
interaction. Of paramount importance in these studies was always the highest
possible accuracy of the raw data combined with the careful subsequent
application of the finite-size scaling technique. In fact, it is this scaling
method that has allowed numerical studies to move beyond simple extrapolations
and reliably construct estimates of quantities as if one were studying an
infinite system.Comment: 18 pages, 6 figures, "The Anderson Transition and its
  Ramifications-Localisation, Quantum Interference, and Interactions", 'Lecture
  Notes in Physics' series, ed. T. Brandes and S. Kettemann, Springer Verlag,
  to be publishe
Electron dynamics in AC-driven quantum dots

A quantum dot (QD) is a structure in which electrons can be confined to small length scales, comparable to their Fermi wavelength. A set of electrons held in such a structure is conceptually similar to a set of atomic electrons bound to a nucleus, and for this reason quantum dots are sometimes termed “artificial atoms” [1]. Unlike real atoms, the physical properties of quantum dots can be easily varied, which gives theorists and experimentalists the opportunity to study novel quantum effects in a well-controlled system
Superconductivity from the repulsive electron interaction -- from 1D to
  3D

An overview is given on how superconductivity with anisotropic pairing can be
realised from repulsive electron-electron interaction. (i) We start from the
physics in one dimension, where the Tomonaga-Luttinger theory predicts that,
while there is no superconducting phase for the repulsive case for a single
chain, the phase does exists in ladders with the number of legs equal to or
greater than two, as shown both by analytically (renormalisation) and
numerically (quantum Monte Carlo). (ii) We then show how this pairing has a
natural extension to the two-dimensional case, where anisotropic (usually d)
pairing superconductivity arises mediated by spin fluctuations (usually
antiferromagnetic), as shown both by analytically (renormalisation) and
numerically (quantum Monte Carlo). (iii) We finally discuss how the
superconductivity from the electron repulsion can be "optimised" (i.e., how
$T_C$ can be raised) in 2D and 3D, where we propose that the anisotropic
pairing is much favoured in systems having {\it disconnected Fermi surfaces}
where $T_C$ can be almost an order of magnitude higher.Comment: 27 pages, 10 figures, in Tobias Brandes et al.(ed.): The Anderson
  Transition and its Ramifications -- Localisation, Quantum Interference, and
  Interaction
Frequency Dependent Electrical Transport in the Integer Quantum Hall
  Effect

The status of the ac quantum Hall effect is reviewed with emphasis on the
theoretical development in recent years. In particular, the numerical
approaches for the calculation of the frequency dependent Hall and longitudinal
conductivities of non-interacting electrons are considered in detail. Results
for the frequency scaling at the critical point and for the frequency dependent
deviation of the Hall conductivity from the quantised plateau value are
presented.Comment: 18 pages incl. 9 figures. "The Anderson Transition and its
  Ramifications -- Localisation, Quantum Interference, and Interactions",
  'Lecture Notes in Physics' series, ed. T. Brandes and S. Kettemann, Springer
  Verlag, to be publishe
Coscheduling techniques and monitoring tools for non-dedicated cluster computing

Our efforts are directed towards the understanding of the coscheduling mechanism in a NOW system when a parallel job is executed jointly with local workloads, balancing parallel performance against the local interactive response. Explicit and implicit coscheduling techniques in a PVM-Linux NOW (or cluster) have been implemented. Furthermore, dynamic coscheduling remains an open question when parallel jobs are executed in a non-dedicated Cluster. A basis model for dynamic coscheduling in Cluster systems is presented in this paper. Also, one dynamic coscheduling algorithm for this model is proposed. The applicability of this algorithm has been proved and its performance analyzed by simulation.
Finally, a new tool (named Monito) for monitoring the different queues of messages in such an environments is presented. The main aim of implementing this facility is to provide a mean of capturing the bottlenecks and overheads of the communication system in a PVM-Linux cluster
A Methodology and Tool Support for Generating Scheduled Native Code for Real-Time Java Applications

Current trends in industry are leading towards the use of Java [5] as a programming language for implementing embedded and real-time applications. From the software engineering perspective, the Java environment is indeed a very attractive development framework. Object-oriented programming provides encapsulation of abstractions into objects that communicate through clearly defined interfaces. Dynamic loading eases the maintenance and improvement of complex applications with evolving requirements and functionality. Besides, Java provides built-in support for multi-threading
Neural Networks and Photometric Redshifts

We present a neural network based approach to the determination of photometric redshift. The method was tested on the Sloan Digital Sky Survey Early Data Release (SDSS-EDR) reaching an accuracy comparable and, in some cases, better than SED template fitting techniques. Different neural networks architecture have been tested and the combination of a Multi Layer Perceptron with 1 hidden layer (22 neurons) operated in a Bayesian framework, with a Self Organizing Map used to estimate the accuracy of the results, turned out to be the most effective. In the best experiment, the implemented network reached an accuracy of 0.020 (interquartile error) in the range 0<zphot<0.3, and of 0.022 in the range 0<zphot<0.5
Large scale prediction of protein interactions by a SVM-based method

A number of techniques have been developed in order to address issues such as genome, trascriptome and proteome analysis. However, a time and cost effective technique for interactome analysis is still lacking. Lots of methods for the predicion of protein - protein interacions have been developed: some of them are based on high quality alignment of sequences, others are based on the tridimensional features of proteins, but they all bear strong limitations that make impossible their large scale application. Recently, an SVM-based machine learning approach has been used to address this topic. Although the method was able to correctly classify 80% of the test samples, it was not applied to the prediction of yet unknown interactions. In this work, we address this topic and show that an optimized, SVM-based machine learning approach trained with combinations of shuffled sequences as examples of lack of interaction is unable to make large scale predictions of interaction. Â© Springer-Verlag Berlin Heidelberg 2003
Consistency Modeling in a Multi-Model Architecture : Integrate and Celebrate Diversity

Central to Model-Driven Engineering (MDE) is seeing models as objects that can be handled and organized into metamodel stacks and multi-model architectures. This work contributes with a unique way of doing consistency modeling where the involved models are explicitly organized in a multi-model architecture; a general model for creating multi-model architectures that allows semantics to be attached is defined and applied; explicit attachment of semantics is demonstrated by attaching Java classes that implement different instantiation semantics in order to realize the consistency modeling and the automatic generation of consistency data.
The kind of consistency addressed concerns relations between data residing in legacy databases defined by different schemas. The consistency modeling is meant to solve the problem of exposing inconsistencies by relating the data. The consistency modeling combines in a practical way visual modeling and logic (OCL). The approach is not limited to exposing inconsistencies, but may also be used to derive more general information given one or more data sets.
The consistency is modeled by defining a consistency model that relates elements of two given legacy models. The consistency model is expressed in a language specially designed for consistency modeling. The language allows definition of classes, associations and invariants expressed in OCL. The interpretation of the language is special: Given one conforming data set for each of the legacy models, the consistency model may then be automatically instantiated to consistency data that tells if the data sets are consistent or not. The invariants are used to decide what instances to generate when making the consistency data. The amount of consistency data to create is finite and limited by the given data sets. The consistency model is instantiated until no more elements can be added without breaking some invariant or multiplicity. The consistency data is presented as a model which can be investigated by the user
The application of virtual reality to the understanding and treatment of schizophrenia

Virtual Reality (VR) techniques are increasingly being used\ud
in education about and in the treatment of certain types of mental illness.  Research indicates VR is delivering on it's promised potential to provide enhanced training and treatment outcomes through incorporation of this high-end technology. Schizophrenia is a mental disorder affecting\ud
1−2% of the population. A significant research project being\ud
undertaken at the University of Queensland has constructed virtual environments that reproduce the phenomena experienced by patients who have psychosis. The VR  environment will allow behavioral exposure therapies to be conducted with exactly controlled exposure stimuli and an expected reduction in risk of harm. This paper reports on the work of the project, previous stages of software development and current and future educational and clinical applications of the Virtual Environments
Building XML data warehouse based on frequent patterns in user queries

[Abstract]: With the proliferation of XML-based data sources available across the Internet, it is increasingly important to provide users with a data warehouse of XML data sources to facilitate decision-making processes. Due to the extremely large amount of XML data available on web, unguided warehousing of XML data turns out to be highly costly and usually cannot well accommodate the users’ needs in XML data acquirement. In this paper, we propose an approach to materialize XML data warehouses based on frequent query patterns discovered from historical queries issued by users. The schemas of integrated XML documents in the warehouse are built using these frequent query patterns represented as Frequent Query Pattern Trees (FreqQPTs). Using hierarchical clustering technique, the integration approach in the data warehouse is flexible with respect to obtaining and maintaining XML documents. Experiments show that the overall processing of the same queries issued against the global schema become much efficient by using the XML data warehouse built than by directly searching the multiple data sources
That strange procedure called quantisation

This is a pedagogical and (almost) self-contained introduction into the
theorem of Groenewold and van Howe, which states that a naive transcription of
Dirac's quantisation rules cannot work. Some related issues in quantisation
theory are also discussed. First-class constrained systems are briefly
described in a slightly more `global' fashion.Comment: 28 pages, no figures, contribution to the conference ``Aspects of
  Quantum Gravity -- From Theory to Experimental Search'', Bad Honnef (Ger)
  200
Lectures on Loop Quantum Gravity

Quantum General Relativity (QGR), sometimes called Loop Quantum Gravity, has
matured over the past fifteen years to a mathematically rigorous candidate
quantum field theory of the gravitational field. The features that distinguish
it from other quantum gravity theories are 1) background independence and 2)
minimality of structures. Background independence means that this is a
non-perturbative approach in which one does not perturb around a given,
distinguished, classical background metric, rather arbitrary fluctuations are
allowed, thus precisely encoding the quantum version of Einstein's radical
perception that gravity is geometry. Minimality here means that one explores
the logical consequences of bringing together the two fundamental principles of
modern physics, namely general covariance and quantum theory, without adding
any experimentally unverified additional structures. The approach is purposely
conservative in order to systematically derive which basic principles of
physics have to be given up and must be replaced by more fundamental ones. QGR
unifies all presently known interactions in a new sense by quantum mechanically
implementing their common symmetry group, the four-dimensional diffeomorphism
group, which is almost completely broken in perturbative approaches. These
lectures offer a problem -- supported introduction to the subject.Comment: 90 pages, Latex, 18 figures, uses graphicx and pstricks for coloured
  text and graphics, based on lectures given at the 271st WE Heraeus Seminar
  ``Aspects of Quantum Gravity: From Theory to Experimental Search'', Bad
  Honnef, Germany, February 25th -- March 1st, to appear in Lecture Notes in
  Physic
Mapping statecharts to Verilog for hardware/software co-specification.

Hardware-Software co-specification is a critical phase in co-design. Our co-specification process starts with a high level graphical description in Statecharts and ends with an equivalent parallel composition of hardware and software descriptions in Verilog. In this paper, we investigate the  statecharts formalism by providing it a formal syntax and a compositional operational semantics. After that, we design a semantics-preserving mapping function to transform a \ud
Statecharts description into Verilog specification. We can combine this mapping  with our previous formal partitioning process so as to form a more complete and  automated co-specification process
A semantic foundation for TCOZ in unifying theories of programming.

Unifying Theories of Programming (UTP) can provide a formal semantic foundation not only for programming languages but also for more expressive specification languages. We believe UTP is particularly well suited for presenting the formal semantics for integrated specification languages which often have rich language constructs for state encapsulation, event communication and real-time modeling. This paper uses UTP to formalise the semantics of Timed Communicating Object Z (TCOZ) and captures some TCOZ new features for the first time. In particular, a novel unified semantic model of the channel based synchronisation and sensor/actuator based asynchronisation in TCOZ is presented. This semantic model will be used as a reference document for developing tools support for TCOZ and as a semantic foundation for proving soundness of those tools
Goal oriented error estimation for the element free Galerkin method

A novel approach for implicit residual-type error estimation in meshfree methods is presented. This allows to compute upper and lower bounds of the error in energy norm with the ultimate goal of obtaining bounds for outputs of interest. The proposed approach precludes the main drawbacks of standard residual type estimators circumventing the need of flux-equilibration and resulting in a simple implementation that avoids integrals on edges/sides of a domain decomposition (mesh). This is especially interesting for mesh-free methods.Peer ReviewedPostprint (author’s final draft