pinecone/core-2020-05-10-deduplication huggingface dataset:
Tight-binding modeling of charge migration in DNA devices

Long range charge transfer experiments in DNA oligomers and the subsequently
measured -- and very diverse -- transport response of DNA wires in solid state
experiments exemplifies the need for a thorough theoretical understanding of
charge migration in DNA-based natural and artificial materials. Here we present
a review of tight-binding models for DNA conduction which have the intrinsic
merit of containing more structural information than plain rate-equation models
while still retaining sufficient detail of the electronic properties. This
allows for simulations of transport properties to be more manageable with
respect to density functional theory methods or correlated first principle
algorithms.Comment: 24 PDF pages of Springer SVMult LaTeX (included), ISBN-10:
  3540724931, ISBN-13: 978-354072493
Generation and Matching of Ontology Data for the Semantic Web in a Peer-to-peer Framework

The abundance of ontology data is very crucial to the emerging semantic web. This paper proposes a framework that supports the generation of ontology data in a ptop environment. It not only enables users to convert existing structured data to ontology data aligned with given ontology schemas, but also allows them to publish new ontology data with ease. Besides ontology data generation, the common issue of data overlapping over the peers is addressed by the process of ontology data matching in the framework. This process helps turn the implicitly related data among the peers caused by overlapping into explicitly interlinked ontology data, which increases the overall quality of the ontology data. To improve matching accuracy, we explore ontology related features in the matching process. Experiments show that adding these features achieves better overall performance than using traditional features only
Symbolic computation of Petri nets

7th International Conference on Computational Science, ICCS 2007; Beijing; China; 27 May 2007 through 30 May 2007Petri nets are receiving increasing attention from the scientific community during the last few years. They provide the users with a powerful formalism for describing and analyzing a variety of information processing systems such as finite-state machines, concurrent systems, multiprocessors and parallel computation, formal languages, communication protocols, etc. Although the mathematical theory of Petri nets has been intensively analyzed from several points of view, the symbolic computation of these nets is still a challenge, particularly for general-purpose computer algebra systems (CAS). In this paper, a new Mathematica package for dealing with some Petri nets is introduced
Computational sciences learning project for pre-university students

7th International Conference on Computational Science, ICCS 2007; Beijing; China; 27 May 2007 through 30 May 2007It is quite useful for high school students to study on computational sciences, especially for those who are planning to have a higher education in engineering. This paper proposes a pilot study on 9th and 10 th grade students for teaching them the basic aspects of computer sciences. This study focuses on a schedule consisting two consecutive courses - first one theoric and the second one is applied - for student volunteers from science high schools
Annotating Relationships between Multiple Mixed-media Digital Objects by Extending Annotea

Annotea provides an annotation protocol to support collaborative Semantic Web-based annotation of digital resources accessible through the Web. It provides a model whereby a user may attach supplementary information to a resource or part of a resource in the form of: either a simple textual comment; a hyperlink to another web page; a local file; or a semantic tag extracted from a formal ontology and controlled vocabulary. Hence, annotations can be used to attach subjective notes, comments, rankings, queries or tags to enable semantic reasoning across web resources. More recently tabbed Browsers and specific annotation tools, allow users to view several resources (e.g., images, video, audio, text, HTML, PDF) simultaneously in order to carry out side-by-side comparisons. In such scenarios, users frequently want to be able to create and annotate a link or relationship between two or more objects or between segments within those objects. For example, a user might want to create a link between a scene in an original film and the corresponding scene in a remake and attach an annotation to that link. Based on past experiences gained from implementing Annotea within different communities in order to enable knowledge capture, this paper describes and compares alternative ways in which the Annotea Schema may be extended for the purpose of annotating links between multiple resources (or segments of resources). It concludes by identifying and recommending an optimum approach which will enhance the power, flexibility and applicability of Annotea in many domains
Web-annotations for humans and machines

We propose to manually annotate web pages with computer-processable controlled natural language. These annotations have well-defined \ud
formal properties and can be used as query relevant summaries to automatically \ud
answer questions expressed in controlled natural language, and as the basis for \ud
other forms of automated reasoning. Last, but not least, the annotations can also \ud
serve as human-readable summaries of the contents of the web pages. Arguably, annotations written in controlled natural language can bridge the gap between informal and formal notations and leverage true collaboration between \ud
humans and machines. This is a position paper that proposes a solution combining existing methods and techniques to achieve a highly relevant practical goal, \ud
namely how to effectively access information on the web. However, our solution introduces a "chicken and egg" problem: a critical mass of web annotations \ud
will be necessary that people perceive the value of these annotations and start \ud
annotating web pages themselves. Only the future will show whether this – basically non-technical – problem can be solved
Face Detection on Embedded Systems

Over recent years automated face detection and recognition (FDR) have gained significant attention from the commercial and research sectors. This paper presents an embedded face detection solution aimed at addressing the real-time image processing requirements within a wide range of applications. As face detection is a computationally intensive task, an embedded solution would give rise to opportunities for discrete economical devices that could be applied and integrated into a vast majority of applications. This work focuses on the use of FPGAs as the embedded prototyping technology where the thread of execution is carried out on an embedded soft-core processor. Custom instructions have been utilized as a means of applying software/hardware partitioning through which the computational bottlenecks are moved to hardware. A speedup by a factor of 110 was achieved from employing custom instructions and software optimizations
Fault Tolerant Scalable Support for Network Portability and Traffic Engineering

The P-SHIM6 architecture provides ISP independence to IPv6 sites without compromising scalability. This architecture is based on a middle-box, the P-SHIM6, which manages the SHIM6 protocol exchange on behalf of the nodes of a site, which are configured with provider independent addresses. Incoming and outgoing packets are processed by the P-SHIM6 box, which can assign different locators to a given communication, either when it is started, or dynamically after the communication has been established. As a consequence, changes required for provider portability are minimized, and fine-grained Traffic Engineering can be enforced at the P-SHIM6 box, in addition to the fault tolerance support provided by SHIM6.This project has been supported by the RiNG project IST-2005-035167 and by the IMPROVISA project TSI2005-07384-C03-02.Publicad
Detection of packet forwarding misbehavior in mobile ad-hoc networks

Mobile Ad Hoc networks (MANETs) are susceptible to having their effective operation compromised by a variety of security attacks. Nodes may misbehave either because they are malicious and deliberately wish to disrupt the network, or because they are selfish and wish to conserve their own limited resources such as power, or for other reasons. In this paper, we present a mechanism that enables the detection of nodes that exhibit packet forwarding misbehavior. We present evaluation results that demonstrate the operation of our algorithm in mobile ad hoc environments and show that it effectively detects nodes that drop a significant fraction of packets. © Springer-Verlag Berlin Heidelberg 2007
Receding horizon control for free-flight path optimisation

This is a journal article. It was published in the journal, Lecture Notes in Control and Information Sciences [© Springer Verlag] and is also available at: http://www.springerlink.com/content/110315/This paper presents a Receding Horizon Control (RHC) algorithm to the\ud
problem of on-line flight path optimization for aircraft in a Free Flight (FF) environment.\ud
The motivation to introduce the concept of RHC is to improve the robust performance of\ud
solutions in a dynamic and uncertain environment, and also to satisfy the restrictive time\ud
limit to the real-time optimization of this complicated air traffic control problem. Firstly,\ud
the mathematical model for the on-line FF path optimization problem is set up and\ud
discussed. Then, the proposed RHC algorithm is described in details. Simulation results\ud
illustrate that the new algorithm is very efficient and promising for practical applications.\ud
While achieving almost the same optimal solution as an existing algorithm in the absence\ud
of environmental uncertainties, it works better in a dynamic and uncertain environment.\ud
In either case, the online computational time of the proposed RHC algorithm is only a\ud
fraction of that of the existing algorithm
Capturing player enjoyment in computer games

The current state-of-the-art in intelligent game design using Artificial Intelligence (AI) techniques is mainly focused on generating human-like and intelligent characters. Even though complex opponent behaviors emerge through various machine learning techniques, there is generally no further analysis of whether these behaviors contribute to the satisfaction of the player. The implicit hypothesis motivating this research is that intelligent opponent behaviors enable the player to gain more satisfaction from the game. This hypothesis may well be true; however, since no notion of entertainment or enjoyment is explicitly defined, there is therefore no evidence that a specific opponent behavior generates enjoyable games.peer-reviewe
A bayesian decision theory approach for the techno-economic analysis of an all-optical router

Proceedings of 11th International IFIP TC6 Conference, ONDM 2007, Athens, Greece, May 29-31, 2007.The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-540-72731-6_46Typically, core networks are provided with both optical and electronic physical layers. However, the interaction between the two layers is at present limited, since most of the traditional transport functionalities, such as traffic engineering, switching and restoration, are carried in the IP/MPLS layer.
In this light, the research community has paid little attention to the potential benefits of the interaction between layers, multilayer capabilities, on attempts to improve the Quality of Service control.
This work shows when to move incoming Label Switched Paths (LSPs) between layers based on a multilayer mechanism that trades off a QoS metric, such as end-to-end delay, and techno-economic aspects. Such mechanism follows the Bayesian decision theory, and is tested with a set of representative case scenarios.The authors would like to thank the support from the European Union VI Framework
Programme e-Photon/ONe+ Network of Excellence (FP6-IST-027497). This work
has also been partially funded by the IST Project NOBEL II (FP6-IST-027305)
Uniform circuits, & Boolean proof nets

21 pagesInternational audienceThe relationship between Boolean proof nets of multiplicative linear logic (APN) and Boolean circuits has been studied [Ter04] in a non-uniform setting. We refine this results by taking care of uniformity: the relationship can be expressed in term of the (Turing) polynomial hierarchy. We give a proofs-as-programs correspondence between proof nets and deterministic as well as non-deterministic Boolean circuits with a uniform depth-preserving simulation of each other. The Boolean proof nets class m&BN(poly) is built on multiplicative and additive linear logic with a polynomial amount of additive connectives as the non-deterministic circuit class NNC(poly) is with non-deterministic variables. We obtain uniform-APN = NC and m&BN(poly) = NNC(poly) = N
On complexity of Ehrenfeucht-Fraïssé games

In this paper we initiate the study of Ehrenfeucht-Fraïssé games for some standard finite structures. Examples of such standard structures are equivalence relations, trees, unary relation structures, Boolean algebras, and some of their natural expansions. The paper concerns the following question that we call Ehrenfeucht-Fraïssé problem. Given n ϵ ω as a parameter, two relational structures A and B from one of the classes of structures mentioned above. How efficient is it to decide if Duplicator wins the n-round EF game  G_n  (A,B)? We provide algorithms for solving the Ehrenfeucht-Fraïssé problem for the mentioned classes of structures. The running times of all the algorithms are bounded by constants. We obtain the values of these constants as functions of n
Satisfiability with exponential families

Fix a set S⊆{0,1}∗ of exponential size, e.g. |S∩{0,1}^n|∈Ω(α^n),α>1. The S-SAT problem asks whether a propositional formula F over variables v_1, ..., v_n has a satisfying assignment (v_1,…,v_n)∈{0,1}^n∩S. Our interest is in determining the complexity of S-SAT. We prove that S-SAT is NP-complete for all context-free sets S. Furthermore, we show that if S-SAT is in P for some exponential S, then SAT and all problems in NP have polynomial circuits. This strongly indicates that satisfiability with exponential families is a hard problem. However, we also give an example of an exponential set S for which the S-SAT problem is not NP-hard, provided P≠NP
A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem

The degree-constrained minimum spanning tree (DCMST) is relevant in the design of networks. It consists of finding a spanning tree whose nodes do not exceed a given maximum degree and whose total edge length is minimum. We design a primal branch-and-cut algorithm that solves instances of the problem to optimality. Primal methods have not been used extensively in the past, and their performance often could not compete with their standard 'dual' counterparts. We show that primal separation procedures yield good bounds for the DCMST problem. On several instances, the primal branch-and-cut program turns out to be competitive with other methods known in the literature. This shows the potential of the primal method
Robust multiple-people tracking using color-based particle filters

Presentado al 3rd Iberian Conference on Pattern Recognition and Image Analysis (IbPRIA-2007) celebrado en Girona (Spain) del 6 al 8 de junio.Robust and accurate people tracking is a key task in many promising computer-vision applications. One must deal with non-rigid targets in open-world scenarios, whose shape and appearance evolve over time. Targets may interact, causing partial or complete occlusions. This paper improves tracking by means of particle filtering, where occlusions are handled considering the target's predicted trajectories. Model drift is tackled by careful updating, based on the history of likelihood measures. A colour-based likelihood, computed from histogram similarity, is used. Experiments are carried out using sequences from the CAVIAR database.This work has been supported by the Catalan Research Agency (AGAUR), by the Spanish Ministry of Education (MEC) under projects TIC2003-08865 and DPI-2004-5414, and by the EC grant IST-027110 under the HERMES project.Peer Reviewe
New neighborhood based classification rules for metric spaces and their use in ensemble classification

The k-nearest-neighbor rule is a well known pattern recognition technique with very good results in a great variety of real classification tasks. Based on the neighborhood concept, several classification rules have been proposed to reduce the error rate of the k-nearest-neighbor rule (or its time requirements). In this work, two new geometrical neighborhoods are defined and the classification rules derived from them are used in several real data classification tasks. Also, some voting ensembles of classifiers based on these new rules have been tested and compared.This work has been supported in part by grant DPI2006-15542-C04-01 from the
Spanish CICYT (Ministerio de Ciencia y Tecnología), GV06/166 from Generalitat Valenciana, and the IST Programme of the European Community, under
the Pascal Network of Excellence, IST-2002-506778
Hierarchical eyelid and face tracking

Presentado al 3rd Iberian Conference on Pattern Recognition and Image Analysis (IbPRIA-2007) celebrado en Girona (Spain) del 6 al 8 de junio.Most applications on Human Computer Interaction (HCI) require to extract the movements of user faces, while avoiding high memory and time expenses. Moreover, HCI systems usually use low-cost cameras, while current face tracking techniques strongly depend on the image resolution. In this paper, we tackle the problem of eyelid tracking by using Appearance-Based Models, thus achieving accurate estimations of the movements of the eyelids, while avoiding cues, which require high-resolution faces, such as edge detectors or colour information. Consequently, we can track the fast and spontaneous movements of the eyelids, a very hard task due to the small resolution of the eye regions. Subsequently, we combine the results of eyelid tracking with the estimations of other facial features, such as the eyebrows and the lips. As a result, a hierarchical tracking framework is obtained: we demonstrate that combining two appearance-based trackers allows to get accurate estimates for the eyelid, eyebrows, lips and also the 3D head pose by using low-cost video cameras and in real-time. Therefore, our approach is shown suitable to be used for further facial-expression analysis.This work has been supported by the EC grant IST-\ud
027110 for the Hermes Project and by the Spanish MEC under projects TIN2006-14606 and DPI-2004-5414. J. Gonzàlez acknowledges the support of a Juan de la Cierva Postdoctoral fellowship from the Spanish MEC.Peer Reviewe
Automatic learning of conceptual knowledge in image sequences for human behavior interpretation

Presentado al 3rd Iberian Conference on Pattern Recognition and Image Analysis (IbPRIA-2007) celebrado en Girona (Spain) del 6 al 8 de junio.This work describes an approach for the interpretation and explanation of human behavior in image sequences, within the context of a Cognitive Vision System. The information source is the geometrical data obtained by applying tracking algorithms to an image sequence, which is used to generate conceptual data. The spatial characteristics of the scene are automatically extracted from the resuling tracking trajectories obtained during a training period. Interpretation is achieved by means of a rule-based inference engine called Fuzzy Metric Temporal Horn Logic and a behavior modeling tool called Situation Graph Tree. These tools are used to generate conceptual descriptions which semantically describe observed behaviors.This work has been supported by the EC grant IST-\ud
027110 for the HERMES project and by the Spanish MEC under projects TIN2006-14606 and and DPI-2004-541. J. Gonzàlez acknowledges the support\ud
of a Juan de la Cierva postdoctoral fellowship from the Spanish MEC.Peer Reviewe
Improving background subtraction based on a casuistry of colour-motion segmentation problems

Presentado al 3rd Iberian Conference on Pattern Recognition and Image Analysis (IbPRIA-2007) celebrado en Girona (Spain) del 6 al 8 de junio.The basis for the high-level interpretation of observed patterns of human motion still relies on motion segmentation. Popular approaches based on background subtraction use colour information to model each pixel during a training period. Nevertheless, a deep analysis on colour segmentation problems demonstrates that colour segmentation is not enough to detect all foreground objects in the image, for instance when there is a lack of colour necessary to build the background model. In this paper, our segmentation procedure is based not only on colour, but also on intensity information. Consequently, the intensity model enhances segmentation when the use of colour is not feasible. Experimental results demonstrate the feasibility of our approach.This work was supported by the project 'Integration of robust perception, learning, and navigation systems in mobile robotics' (J-0929).This work has been supported by EC grant IST-027110 for the HERMES project and by the Spanish MEC under projects CICYT SISY-PHUS TIN2006-14606 and DPI-2004-5414. Jordi Gonzàlez also acknowledges the support of a Juan de la Cierva Postdoctoral fellowship from the Spanish MEC.Peer Reviewe
Unidimensional multiscale local features for object detection under rotation and mild occlusions

Presentado al 3rd Iberian Conference (IbPRIA-2007) celebrado en Girona (Spain) del 6 al 8 de junio.In this article, scale and orientation invariant object detection is performed by matching intensity level histograms. Unlike other global measurement methods, the present one uses a local feature description that allows small changes in the histogram signature, giving robustness to partial occlusions. Local features over the object histogram are extracted during a Boosting learning phase, selecting the most discriminant features within a training histogram image set. The Integral Histogram has been used to compute local histograms in constant time.Peer Reviewe
An Efficient Algorithm for the Evacuation Problem in a Certain Class of a Network with Uniform Path-Lengths (Algorithmic Aspects in Information and Management)

Algorithmic aspects in information and management : Third International Conference, AAIM 2007, Portland, OR, USA, June 6-8, 2007 : proceedings : (Lecture notes in computer science ; 4508)Proc. of 3rd Int. Conf. on Algorithmic Aspect in Information and Management. (AAIM 2007)In this paper, we consider the evacuation problem for a network which consists of a directed graph with capacities and transit times on its arcs. This problem can be solved by the algorithm of Hoppe and Tardos [1] in polynomial time. However their running time is high-order polynomial, and hence is not practical in general. Thus it is necessary to devise a faster algorithm for a tractable and practically useful subclass of this problem. In this paper, we consider a dynamic network with a single sink s such that (i) for each vertex v the sum of transit times of arcs on any path from v to s takes the same value, and (ii) for each vertex v the minimum v-s cut is determined by the arcs incident to s whose tails are reachable from v. We propose an efficient algorithm for this network problem. This class of networks is a generalization of the grid network studied in the paper [2]
Constellations and the unsupervised learning of graphs

In this paper, we propose a novel method for the unsupervised clustering of graphs in the context of the constellation approach to object recognition. Such method is an EM central clustering algorithm which builds prototypical graphs on the basis of fast matching with graph transformations. Our experiments, both with random graphs and in realistic situations (visual localization), show that our prototypes improve the set median graphs and also the prototypes derived from our previous incremental method. We also discuss how the method scales with a growing number of images