pinecone/core-2020-05-10-deduplication huggingface dataset:
A marching method for computing intersection curves of two subdivision solids

This paper presents a marching method for computing inter-\ud
section curves between two solids represented by subdivision surfaces of\ud
Catmull-Clark or Loop type. It can be used in trimming and boolean op-\ud
erations for subdivision surfaces. The main idea is to apply a marching\ud
method with geometric interpretation to trace the intersection curves.\ud
We first determine all intersecting regions, then find pairs of initial in-\ud
tersection points, and trace the intersection curves from the initial inter-\ud
section points. Various examples are given to demonstrate the robustness\ud
and efficiency of our algorithm
Level sets of functions and symmetry sets of smooth surface sections

We prove that the level sets of a real C^s function of two variables near a
non-degenerate critical point are of class C^[s/2] and apply this to the study
of planar sections of surfaces close to the singular section by the tangent
plane at hyperbolic points or elliptic points, and in particular at umbilic
points.
  We also analyse the cases coming from degenerate critical points,
corresponding to elliptic cusps of Gauss on a surface, where the
differentiability is now reduced to C^[s/4].
  However in all our applications to symmetry sets of families of plane curves,
we assume the C^infty smoothness.Comment: 15 pages, Latex, 6 grouped figures. The final version will appear in
  Mathematics of Surfaces. Lecture Notes in Computer Science (2005
Event-based Coordination of Process-oriented Composite Applications

A process-oriented composite application aggregates functionality\ud
from a number of other applications and coordinates these applications\ud
according to a process model. Traditional approaches to develop\ud
process-oriented composite application rely on statically defined\ud
process models that are deployed into a process management engine.\ud
This approach has the advantage that application designers and users\ud
can comprehend the dependencies between the applications involved in\ud
the composition by referring to the process model. A major disadvantage\ud
however is that once deployed the behaviour of every execution of the\ud
composite application is expected to abide by its process model until this\ud
model is changed and re-deployed. This makes it difficult to enrich the\ud
application with even minor features, to plug-in new applications into\ud
the composition, or to hot-fix the composite application to meet special\ud
circumstances or demands (e.g. to personalise the application). This paper\ud
describes a technique for translating a process-oriented application\ud
into an event-based application which is more amenable to such runtime\ud
adaptation. The process-based and event-based views of the application\ud
can then co-exist and be synchronised offline if the changes become permanent\ud
and it is found desirable to reflect them in the process model
Service Interaction Patterns

With increased sophistication and standardization of modeling\ud
languages and execution platforms supporting business process management\ud
(BPM) across traditional boundaries, has come the need for\ud
consolidated insights into their exploitation from a business perspective.\ud
Key technology developments in BPM bear this out, with several web\ud
services-related initiatives investing significant effort in the collection of\ud
compelling use cases to heighten the exploitation of BPM in multi-party\ud
collaborative environments. In this setting, we present a collection of\ud
patterns of service interactions which allow emerging web services functionality,\ud
especially that pertaining to choreography and orchestration,\ud
to be benchmarked against abstracted forms of representative scenarios.\ud
Beyond bilateral interactions, these patterns cover multilateral, competing,\ud
atomic and causally related interactions. Issues related to the implementation\ud
of these patterns using established and emerging web services\ud
standards, most notably BPEL, are discussed
Probabilistic Anonymity

International audienceThe concept of anonymity comes into play in a wide range of situations, varying from voting and anonymous donations to postings on bulletin boards and sending mails. The systems for ensuring anonymity often use random mechanisms which can be described probabilistically, while the agents' interest in performing the anonymous action may be totally unpredictable, irregular, and hence expressible only nondeterministically. Formal definitions of the concept of anonymity have been investigated in the past either in a totally nondeterministic framework, or in a purely probabilistic one. In this paper, we investigate a notion of anonymity which combines both probability and nondeterminism, and which is suitable for describing the most general situation in which both the systems and the user can have both probabilistic and nondeterministic behavior. We also investigate the properties of the definition for the particular cases of purely nondeterministic users and purely probabilistic users. We formulate our notions of anonymity in terms of observables for processes in the probabilistic pi-calculus, whose semantics is based on Probabilistic Automata. We illustrate our ideas by using the example of the dining cryptographers
Bisimulations Up-to for the Linear Time Branching Time Spectrum

Coinductive definitions of semantics based on bisimulations have rather pleasant properties and are simple to use. In order to get coinductive characterisations of those semantic equivalences that are weaker than strong bisimulation we use a variant of the bisimulation up-to technique in which we allow the use of a given preorder relation. We prove that under some technical conditions our bisimulations up-to characterise the kernel of the given preorder. It is remarkable that the adequate orientation of the ordering relation is crucial to get this result. As a corollary, we get nice coinductive characterisations of all the axiomatic semantic equivalences in Van Glabbeek’s spectrum. Although we first prove our results for finite processes, reasoning by induction, then we see, by using continuity arguments, that they are also valid for infinite (finitary) processes
A theory of system behaviour in the presence of node and link failure

We develop a behavioural theory of distributed programs in the presence of failures such as nodes crashing and links breaking. The framework we use is that of Dπ, a language in which located processes, or agents, may migrate between dynamically created locations. In our extended framework, these processes run on a distributed network, in which individual nodes may crash in fail-stop fashion or the links between these nodes may become permanently broken. The original language, Dπ, is also extended by a ping construct for detecting and reacting to these failures.\ud
We define a bisimulation equivalence between these systems, based on labelled actions which record, in addition to the effect actions have on the processes, the effect on the actual state of the underlying network and the view of this state known to observers. We prove that the equivalence is fully abstract, in the sense that two systems will be differentiated if and only if, in some sense, there is a computational context, consisting of a surrounding network and an observer, which can see the difference.peer-reviewe
Long-term prediction of discharges in Manwan Hydropower using adaptive-network-based fuzzy inference systems models

Forecasting reservoir inflow is important to hydropower reservoir management and scheduling. An Adaptive-Network-based Fuzzy Inference System (ANFIS) is successfully developed to forecast the long-term discharges in Manwan Hydropower. Using the long-term observations of discharges of monthly river flow discharges during 1953-2003, different types of membership functions and antecedent input flows associated with ANFIS model are tested. When compared to the ANN model, the ANFIS model has shown a significant forecast improvement. The training and validation results show that the ANFIS model is an effective algorithm to forecast the long-term discharges in Manwan Hydropower. The ANFIS model is finally employed in the advanced water resource project of Yunnan Power Group.Department of Civil and Environmental EngineeringAuthor name used in this publication: Chun-Tian ChengAuthor name used in this publication: Ying-Guang SunAuthor name used in this publication: Kwokwing ChauAuthor name used in this publication: Jian-Yi Lin2004-2005 > Academic research: refereed > Publication in refereed journalpreprint_postprin
Essential Incompleteness of Arithmetic Verified by Coq

A constructive proof of the Goedel-Rosser incompleteness theorem has been
completed using the Coq proof assistant. Some theory of classical first-order
logic over an arbitrary language is formalized. A development of primitive
recursive functions is given, and all primitive recursive functions are proved
to be representable in a weak axiom system. Formulas and proofs are encoded as
natural numbers, and functions operating on these codes are proved to be
primitive recursive. The weak axiom system is proved to be essentially
incomplete. In particular, Peano arithmetic is proved to be consistent in Coq's
type theory and therefore is incomplete.Comment: This paper is part of the proceedings of the 18th International
  Conference on Theorem Proving in Higher Order Logics (TPHOLs 2005). For the
  associated Coq source files see the TeX sources, or see
  <http://r6.ca/Goedel20050512.tar.gz
An ID-logic formalization of the composition of autonomous databases

We introduce a declarative approach for a coherent composition of autonomous databases. For this we use ID-logic, a formalism that extends classical logic with inductive definitions. We consider ID-logic theories that express, at the same time, the two basic challenges in database composition problems: relating different schemas of the local databases to one global schema (schema integration) and amalgamating the distributed and possibly contradictory data to one consistent database (data integration). We show that our framework supports different methods for schema integration (as well as their combinations) and that it provides a straightforward way of dealing with inconsistent data. Moreover, this framework facilitates the implementation of database repair and consistent query answering by means of a variety of reasoning systems.status: publishe
On the local closed-world assumption of data-sources

The Closed-World Assumption (CWA) on a database expresses that an atom not in the database is false. The CWA is only applicable in domains where the database has complete knowledge. In many cases, for example in the context of distributed databases, a data source has only complete knowledge about part of the domain of discourse. In this paper, we introduce an expressive and intuitively appealing method of representing a local closed-world assumption (LCWA) of autonomous data-sources. This approach distinguishes between the data that is conveyed by a data-source and the meta-knowledge about the area in which these data is complete. The data is stored in a relational database that can be queried in the standard way, whereas the meta-knowledge about its completeness is expressed by a first order theory that can be processed by an independent reasoning system (for example a mediator). We consider different ways of representing our approach, relate it to other methods of representing local closed-word assumptions of data-sources, and show some useful properties of our framework which facilitate its application in real-life systems.status: publishe
Inference of well-typings for logic programs with application to termination analysis

A method is developed to infer a polymorphic well-typing for a logic program. Our motivation is to improve the automation of termination analysis by deriving types from which norms can automatically be constructed. Previous work on type-based termination analysis used either types declared by the user, or automatically generated monomorphic types describing the success set of predicates. The latter types are less precise and result in weaker termination conditions than those obtained from declared types. Our type inference procedure involves solving set constraints generated from the program and derives a well-typing in contrast to a success-set approximation. Experiments so far show that our automatically inferred well-typings axe close to the declared types and result in termination conditions that are as strong as those obtained with declared types. We describe the method, its implementation and experiments with termination analysis based on the inferred types.status: publishe
Memory usage verification for OO programs.

We present a new type system for an object-oriented (OO) language that characterizes the sizes of data structures and the amount of heap memory required to successfully execute methods that operate on these data structures. Key components of this type system include type assertions that use symbolic Presburger arithmetic expressions to capture data structure sizes, the effect of methods on the data structures that they manipulate, and the amount of memory that methods allocate and deallocate. For each method, we conservatively capture the amount of memory required to execute the method as a function of the sizes of the method’s inputs. The safety guarantee is that the method will never attempt to use more memory than its type expressions specify. We have implemented a type checker to verify memory usages of OO programs. Our experience is that the type system can precisely and effectively capture memory bounds for a wide range of programs
Design and Implementation of Scalable Online Evolvable Hardware Pattern Recognition Systems

Evolvable hardware (EHW) is a method where hardware is designed and/or modified automatically by optimization algorithms called evolutionary algorithms (EAs). The results so far are promising but somewhat limited partly because of a scalability problem of the EHW design method. It is hard to generate circuits which are capable of handling large real-world problems in a competitive manner. Schemes for dealing with the scalability problem have been proposed earlier, however the application of these to run-time adaptive EHW systems has been limited. This thesis addresses the challenge to generate autonomous run-time adaptive digital EHW systems for solving large real-world problems. The challenge consists of dealing with the lack of scalability in EAs, combined with the challenge of designing an adaptive hardware architecture for the evolution. Specifically, hardware classifiers are developed for accurate classification of inputs with a large number of features. For experimentation with online adaptation, an on-chip evolutionary system has been proposed and implemented, making use of an on-chip processor. In order to overcome the scalability problem, the use of data buses and high-level building blocks has been investigated. Further, these elements have been combined with incremental evolution into a specialized high-speed classifier architecture for online evolution. The architecture has been applied to several difficult application benchmarks and compared to traditional approaches as well as previously presented EHW approaches. The work has resulted in a flexible system for on-chip evolution. The proposed online architecture is capable of classifying problems with a larger number of inputs than previous online EHW classifiers, and it gives a higher accuracy for these problems than previously presented EHW systems. These systems have often been based on offline evolution – regarded as less challenging than online evolution. In addition, the amount of evaluations needed for the evolutionary search is low compared to previously presented systems. The system has also shown to be competitive to traditional classification approaches for the applied benchmarks
Recent analytical and numerical techniques applied to the Einstein
  equations

Combining deeper insight of Einstein's equations with sophisticated numerical
techniques promises the ability to construct accurate numerical implementations
of these equations. We illustrate this in two examples, the numerical evolution
of ``bubble'' and single black hole spacetimes. The former is chosen to
demonstrate how accurate numerical solutions can answer open questions and even
reveal unexpected phenomena. The latter illustrates some of the difficulties
encountered in three-dimensional black hole simulations, and presents some
possible remedies.Comment: Contribution to appear in the Proceedings of the March-2004 Heraeus
  Seminar in Bad Honnef (Eds D. Giulini, J. Frauendiener and V. Perlick
On the geometry of pp-wave type spacetimes

Global geometric properties of product manifolds ${\cal M}= M \times \R^2$,
endowed with a metric type $<\cdot, \cdot > = < \cdot, \cdot >_R + 2 dudv +
H(x,u) du^2$ (where $<\cdot, \cdot >_R$ is a Riemannian metric on $M$ and $H:M
\times \R \to \R$ a function), which generalize classical plane waves, are
revisited. Our study covers causality (causal ladder, inexistence of horizons),
geodesic completeness, geodesic connectedness and existence of conjugate
points. Appropiate mathematical tools for each problem are emphasized and the
necessity to improve several Riemannian (positive definite) results is claimed.Comment: 19 pages, Proceedings of the March-2004 Heraeus Seminar "Mathematical
  Relativity: New ideas and developments
Concepts of Hyperbolicity and Relativistic Continuum Mechanics

After a short introduction to the characteristic geometry underlying weakly
hyperbolic systems of partial differential equations we review the notion of
symmetric hyperbolicity of first-order systems and that of regular
hyperbolicity of second-order systems. Numerous examples are provided, mainly
taken from nonrelativistic and relativistic continuum mechanics.Comment: 12 pages, uses svmult.cls style file, expanded version of lecture
  given at 319th WE-Heraeus Seminar on "Mathematical Relativity: New Ideas and
  Developments
A first attempt at constructing genetic programming expressions for EEG classification

Proceeding of: 15th International Conference on Artificial Neural Networks ICANN 2005, Poland, 11-15 September, 2005In BCI (Brain Computer Interface) research, the classification of EEG signals is a domain where raw data has to undergo some preprocessing, so that the right attributes for classification are obtained. Several transformational techniques have been used for this purpose: Principal Component Analysis, the Adaptive Autoregressive Model, FFT or Wavelet Transforms, etc. However, it would be useful to automatically build significant attributes appropriate for each particular problem. In this paper, we use Genetic Programming to evolve projections that translate EEG data into a new vectorial space (coordinates of this space being the new attributes), where projected data can be more easily classified. Although our method is applied here in a straightforward way to check for feasibility, it has achieved reasonable classification results that are comparable to those obtained by other state of the art algorithms. In the future, we expect that by choosing carefully primitive functions, Genetic Programming will be able to give original results that cannot be matched by other machine learning classification algorithms.Publicad
A biophysical model of decision making in an antisaccade task through variable climbing activity

We present a biophysical model of saccade initiation based on\ud
competitive integration of planned and reactive cortical saccade decision signals\ud
in the intermediate layer of the superior colliculus. In the model, the variable\ud
slopes of the climbing activities of the input cortical decision signals are\ud
produced from variability in the conductances of Na+, K+, Ca2+ activated K+,\ud
NMDA and GABA currents. These cortical decision signals are integrated in\ud
the activities of buildup neurons in the intermediate layer of the superior\ud
colliculus, whose activities grow nonlinearly towards a preset criterion level.\ud
When the level is crossed, a movement is initiated. The resultant model\ud
reproduces the unimodal distributions of saccade reaction times (SRTs) for\ud
correct antisaccades and erroneous prosaccades as well as the variability of\ud
SRTs (ranging from 80ms to 600ms) and the overall 25% of erroneous\ud
prosaccade responses in a large sample of 2006 young men performing an\ud
antisaccade task
Action understanding and imitation learning in a robot-human task

We report results of an interdisciplinary project which aims
at endowing a real robot system with the capacity for learning by goaldirected
imitation. The control architecture is biologically inspired as
it reflects recent experimental findings in action observation/execution
studies. We test its functionality in variations of an imitation paradigm
in which the artefact has to reproduce the observed or inferred end state
of a grasping-placing sequence displayed by a human model.European Commission (EC) - IST-2000-29686
Tools for Address-Event-Representation Communication Systems and Debugging

Address-Event-Representation (AER) is a communications protocol
for transferring spikes between bio-inspired chips. Such systems may consist of
a hierarchical structure with several chips that transmit spikes among them in
real time, while performing some processing. To develop and test AER based
systems it is convenient to have a set of instruments that would allow to:
generate AER streams, monitor the output produced by neural chips and modify
the spike stream produced by an emitting chip to adapt it to the requirements of
the receiving elements. In this paper we present a set of tools that implement
these functions developed in the CAVIAR EU project.European Commission IST-2001-34124Ministerio de Ciencia y Tecnología TIC-2003-08164-C03-0
Ordering of the RGB space with a growing self-organizing network: application to color mathematical morphology

Mathematical morphology is broadly used in image processing, but it is mainly restricted to binary or greyscale images. Extension to color images is not straightforward due to the need of application to an ordered space with an infimum and a supremum. In this paper a new approach for the ordering of the RGB space is presented. The adaptation of a linear growing self-organizing network to the three-dimensional color space allows the definition of an order relationship among colors. This adaptation is measured with the topographic product to guarantee a good topology-preservation of the RGB space. Once an order has been established, several examples of application of mathematical morphology operations to color images are presented.This work has been partially funded by the Spanish Ministry of Science and Technology under project DPI2002-04434-C04-01