Miracle-dz/UniFAR-FTUs huggingface dataset:
Introduction to this Special Issue

This issue of Natural Language Engineering journal reports on recent achievements in the domain of HPSG-based parsing. Research groups at Saarbrücken, CSLI Stanford and the University of Tokyo have worked on grammar development and processing systems that allow the use of HPSG-based processing in practical application contexts. Much of the research reported here has been collaborative, and all of the work shares a commitment to producing comparable results on wide-coverage grammars with substantial test suites. The focus of this special issue is deliberately narrow, to allow detailed technical reports on the results obtained among the collaborating groups. Thus, the volume cannot aim at providing a complete survey on the current state of the field. This introduction summarizes the research background for the work reported in the issue, and puts the major new approaches and results into perspective. Relationships to similar efforts pursued elsewhere are included, along with a brief summary of the research and development efforts reflected in the volume, the joint reference grammar, and the common sets of reference data.
Databases and ontologies ORegAnno : an open access database and curation system for literature-derived promoters , transcription factor binding sites and regulatory variation

Motivation: Our understanding of gene regulation is currently limited by our ability to collectively synthesize and catalogue transcriptional regulatory elements stored in scientific literature.Over the past decade, this task has become increasingly challenging as the accrual of biologically validated regulatory sequences has accelerated. To meet this challenge, novel community-based approaches to regulatory element annotation are required. Summary: Here, we present the Open Regulatory Annotation (ORegAnno) database as a dynamic collection of literature-curated regulatory regions, transcription factor binding sites and regulatory mutations (polymorphisms and haplotypes). ORegAnno has been designed to manage the submission, indexing and validation of new annotations from users worldwide. Submissions to ORegAnno are immediately cross-referenced to EnsEMBL, dbSNP, Entrez Gene, the NCBI Taxonomy database and PubMed, where appropriate. Availability: ORegAnno is available directly through MySQL, Web services, and online at http://www.oreganno. org. All software is licensed under the Lesser GNU Public License (LGPL). Contact: sjones@bcgsc.ca
Automated Generation of Model Cases for HelpDesk Applications

Document databases may be ill formed containing redun dant and poorly organized documents For example a database of cus tomers descriptions of problems with products and the vendor s descrip tions of their resolution may contain many descriptions of the same prob lem A highly desirable goal is to transform the database into a concise set of summarized reports model cases which in turn are more amenable to search and problem resolution without expert intervention In this paper we describe techniques that try to automate the procedures for reducing a database to its essential components Our initial application is self help for resolution of product problems A lightweight document clustering method is described that operates in high dimensions processes tens of thousands of documents and groups them into several thousand clusters Techniques for summarization and exemplar selection are described to further re ne the database contents The method has been evaluated on a database of over customer service problem reports that are reduced to clusters and exemplar documents Preliminary results are promising and demonstrate e cient clustering performance with excellent group similarity measures reducing the original database size by several orders of magnitude
The DEEP Groth Strip Survey VII: The Metallicity of Field Galaxies at 0.26

Using spectroscopic data from the Deep Extragalactic Evolutionary Probe (DEEP) Groth Strip survey (DGSS), we analyze the gas-phase oxygen abundances in the warm ionized medium for 64 emission-line field galaxies in the redshift range 0.26<z<0.82. Oxygen abundances relative to hydrogen range between 8.4<12+log(O/H)<9.0 with typical internal plus systematic measurement uncertainties of 0.17 dex. The 64 DGSS galaxies collectively exhibit an increase in metallicity with B-band luminosity. DGSS galaxies in the highest redshift bin (z=0.6-0.82) are brighter, on average, by ~1 mag at fixed metallicity compared to the lowest DGSS redshift bin (z=0.26-0.40) and brighter by up to ~2.4 mag compared to local (z<0.1) emission-line field galaxies. Alternatively, DGSS galaxies in the highest redshift bin (z=0.6-0.82) are, on average, 40% (0.15 dex) more metal-poor at fixed luminosity compared to local (z<0.1) emission-line field galaxies. For 0.6<z<0.8 galaxies, the offset from the local L-Z relation is greatest for objects at the low-luminosity (M_B>-19) end of the sample and vanishingly small for objects at the high-luminosity end of the sample (M_B ~ -22). Simple galaxy evolution models can produce reasonable agreement with observations for low-mass galaxies when least two of the following are true: 1) low-mass galaxies have lower effective chemical yields than massive galaxies, 2) low-mass galaxies assemble on longer timescales than massive galaxies, 3) low-mass galaxies began the assembly process at a later epoch than massive galaxies. (abridged)
ESTBED FOR W IRELESS A DAPTIVE S IGNAL P ROCESSING S YSTEMS György

Nowadays the investigation of wireless sensor netwo rks’ (WSN) application is a relevant research topic, because WSN are utilized with success in var ious fields [1]. In this paper a testbed is introduced, which can be a common base of current i nvestigations on the applicability of wireless sensor networks in closed loop multiple-input multi ple-output (MIMO) control systems. The proposed generic application for testing is an acti ve noise control (ANC) [2] system, the feedback part of which comprises a WSN for sensing the noise to be suppressed. Because of the inherent and inevitable problems of radio communication (e.g. pa cket loss, uncertainty in data transfer time) the deployment of WSN in closed loop applications is no t spread yet [3]. The novel feature of this testbed is that it offers a framework for the inves tigations to eliminate the disadvantageous effects of radio communication. This arrangement poses strict demands on the main c omponents of the testbed (WSN and ANC algorithms) for ensuring the overall reliability of the system: the sensor network has to provide efficient data transmission towards the signal proc essing algorithm, which in turn has to be adaptive for the anomalies in data transfer. Because of the wid variety of ANC algorithms and their particular sensitivity against anomalies in the feedback loop, this system is appropriate for test purposes and comparative analysis of results. Major topics that c n be studied in this field with the testbed are summarized in this article.
On conflict-free coloring of points and simple regions in the plane

In this paper, we study coloring problems related to frequency assignment problems in cellular networks. In abstract setting, the problems are of the following two types:<b>CF-coloring of regions</b>: Given a finite family <i>S</i> of <i>n</i> regions of some fixed type (such as discs, pseudo-discs, axis-parallel rectangles, etc.), what is the minimum integer <i>k</i>, such that one can assign a color to each region of <i>S</i>, using a total of at most <i>k</i> colors, such that the resulting coloring has the following property: For each point <i>p ∈<sub>b∈S</sub> b</i> there is at least one region <i>b∈S</i> that contains <i>p</i> in its interior, whose color is unique among all regions in <i>S</i> that contain <i>p</i> in their interior (in this case we say that <i>p</i> is being `served' by that color). We refer to such a coloring as a <i> conflict-free</i> coloring of <i>S</i> (CF-coloring in short). <b>CF-coloring of a range space</b>: Given a set <i>P</i> of <i>n</i> points in <i>R<sup>d</sup></i> and a set <i>R</i> of ranges (for example, the set of all discs in the plane), what is the minimum integer <i>k</i>, such that one can color the points of <i>P</i> by <i>k</i> colors, so that for any <i>r ∈ R</i> with <i>P∩r∈≠Ø</i>, there is at least one point <i>q ∈ P ∩ r</i> that is assigned a unique color among all colors assigned to points of <i>P ∩ r</i> (in this case we say that <i>r</i> is 'served' by that color). We refer to such a coloring as a <i>conflict-free</i> coloring of <i>(P,R)</i> (CF-coloring in short).
Assessment on Fault-tolerance Performance Using Neural Network Model Based on Ant Colony Optimization Algorithm for Fault Diagnosis in Distribution Systems of Electric Power Systems

This paper presents a model based on neural network optimized by the ant colony optimization algorithm (ACOA) for fault section diagnosis in distribution systems of electric power systems, and the simulation results show that it can effectively improve the fault-tolerance ability of fault section diagnosis. It had better fault-tolerance ability in contrast with the BP-NN model and the DGA-NN model. It must be pointed out that the improvement degree is correlative with the space distribution of samples, and it isn 't the essential improvement, but it is the potential mining of neural network.
Automatic Detection of Blood Vessel in Retinal Images

Automatic detection of retinal blood vessels and measurement of vessel diameter are very much important for the diagnosis and the treatment of different ocular diseases including diabetic retinopathy (DR), glaucoma and hypertension. In this paper, we present a novel method to detect blood vessels in the fundus retinal images. The proposed method consists of three main steps. The first step is pre-processing of retinal image to improve the retinal images by evaluation of several image enhancement techniques. In the second step, the vesselness filter is usually used to enhance the blood vessels. Finally Hessian multiscale enhancement filter is designed from the adaptive thresholding of the output of the vesselness filter for vessels detection. The performance of algorithms is compared and analyzed on three publicly available databases (DRIVE, STARE and CHASE_DB) of retinal images using a number of measures, which include accuracy, sensitivity, and specificity.
Spotting “ Hot Spots ” i Human Judgments and

Recent interest in the automatic processing of meetings is motivated by a desire to summarize, browse, and retrieve important information from lengthy archives of spoken data. One of the most useful capabilities such a technology could provide is a way for users to locate “hot spots” or regions in which participants are highly involved in the discussion (e.g. heated arguments, points of excitement, etc.). We ask two questions about hot spots in meetings in the ICSI Meeting Recorder corpus. First, we ask whether involvement can be judged reliably by human listeners. Results show that despite the subjective nature of the task, raters show significant agreement in distinguishing involved from non-involved utterances. Second, we ask whether there is a relationship between human judgments of involvement and automatically extracted prosodic features of the associated regions. Results show that there are significant differences in both F0 and energy between involved and non-involved utterances. These findings suggest that humans do agree to some extent on the judgment of hot spots, and that acoustic-only cues could be used for automatic detection of hot spots in natural meetings.
Widespread and polymorphous noncoding amino acid residues in human sperm proteome

Proteins are usually deciphered by translation of the coding genome; however, their amino acid residues are seldom determined directly across the proteome. Herein, we describe a systematic workflow for identifying all possible protein residues that differ from the coding genome, termed noncoding amino acids (ncAAs). By measuring the mass differences between the coding amino acids and the actual protein residues in human spermatozoa, over a million nonzero “delta masses” were detected, fallen into 424 high-quality Gaussian clusters and 571 high-confidence ncAAs spanning 29,053 protein sites. Most ncAAs are novel with unresolved side-chains and discriminative between healthy individuals and patients with oligoasthenospermia. For validation, 40 out of 98 ncAAs that matched with amino acid substitutions were confirmed by exon sequencing. This workflow revealed the widespread existence of previously unreported ncAAs in the sperm proteome, which represents a new dimension on the understanding of amino acid polymorphisms at the proteomic level. sensitivity and lengthy it is clear that unmatched peptide spectra are largely due to undefined noncoding protein residues. Since undefined noncoding amino acids indicate novel amino acid side-chains and structures, assumed important protein transcriptionally and translationally silent. This study explored noncoding protein residues in human spermatozoa, with an emphasis on comparing healthy individuals and patients with oligoasthenospermia. Taking advantage of the high accuracy and fast data acquisition of mass spectrometry, a modified Shotgun proteomics method was used to measure all possible mass differences or delta masses between coding amino acids and actual protein residues in sperm proteins from 48 people. Over a million nonzero delta masses were obtained out of ~7 million peptides or 10,591 non-redundant proteins detected with high confidence. To account for the false positive rate, nonzero delta masses were clustered by a multi -variable model and further fitted by Gaussian regression to archive statistically clustered delta masses for calculation of high-confidence ncAAs and ncAA-containing protein sites. Our study revealed a large number of unreported ncAAs with undefined side-chain structures in human spermatozoa that are polymorphous in healthy populations and discriminative in patients with oligoasthenospermia.
Estimation of Linear Shape Deformations and its Medical Applications

In this report, we present the main results of our work supported by the OTKA K-75637 grant during January 2009 – March 2012. The main achievement of the project is a fully functional automatic shape registration method with the following properties: We made publicly available three demo programs implementing our afﬁne 2D, 3D and planar homography registration algorithms. Furthermore, we have also developed a prototype software for aligning hip prosthesis X-ray images, which has been transfered to collaborating radiologists for further exploitation and validation for potential application in everyday health care. Our results have been presented at top conferences of the ﬁeld ( e.g. ICCV , ECCV ) as well as in leading journals ( e.g. IEEE Transactions on Pattern Analysis and Machine Intelligence , Pattern Recognition ). One of the MSc students working on the project received the second price of the National Scientiﬁc Student Conference ( OTDK ). Csaba Domokos successfully defended his PhD degree ( Summa cum laude ) and his work on solving afﬁne puzzle s has been awarded the prestigious Attila Kuba Prize of the Hungarian Association for Image Processing and Pattern Recognition . More details about our results can be found at the project’s webpages:
Formal Veri(cid:2)cation of Scalable NonZero Indicators

Concurrent algorithms are notoriously dif(cid:2)cult to design correctly, and high performance algorithms that make little or no use of locks even more so. In this paper, we describe a formal veri(cid:2)cation of a recent concurrent data structure Scalable NonZero Indicators. The algorithm supports in-crementing, decrementing, and querying the shared counter in an ef(cid:2)cient and linearizable way without blocking. The algorithm is highly non-trivial and it is challenging to prove the correctness. We have proved that the algorithm satis-(cid:2)es linearizability, by showing a trace re(cid:2)nement relation from the concrete implementation to its abstract speci(cid:2)cation. These models are speci(cid:2)ed in CSP and veri(cid:2)ed automatically using the model checking toolkit PAT.
A Survey on Techniques of Separation of Machine Printed Text and Handwritten Text

—In many documents such as admission form, bank cheques, memorandums, letters and application forms machine printed and handwritten characters are mixed. Since the algorithms for recognition of machine-printed texts and handwritten texts are different, it is necessary to distinguish between these two types of texts before giving it to respective OCR systems to process it. This separation will definitely increase the performance and overall system quality. The paper discusses some observations about characteristics of these two types of texts and various techniques of separation of machine printed and handwritten text into three categories (Structural and statistical features, Gradient features and Geometric features) based on feature extraction method.
Near Surface Characterization Using VP/VS and Poisson's Ratio from Seismic Refractions

ABSTRACT This paper shows that the ratio of compressional- and shear-wave velocities (VP and VS, respectively) better characterize the near-surface than individual velocity models. In a proof-of-concept experiment, vertical and tangential data were acquired along a 23 m, 2D profile containing two well-documented utility pipes with 0.76 m diameter and 1.5 m burial depth. First arrivals of both datasets were inverted using a regularized tomography algorithm. The inverted VP and VS images, which fit their respective datasets within the noise level, were smooth with no clear anomalous structure at the pipe locations. In the VP/VS ratio image, however, the pipe locations appear as zones with high ratio values (>1.8). A nearby zone of low (<1.5) VP/VS ratio was interpreted as a backfilled void. These results suggested that carefully conducted P- and S-refraction tomography can provide quick and effective near-surface reconnaissance.
Baumhöhenmessung mit flugzeuggetragenen Laserscannern

Die Entwicklung neuer Fernerkundungssensoren hat Produkte auf den Markt gebracht, deren Einsatz neue Möglichkeiten bei der Erfassung von Waldstrukturen erwarten lässt. Um das Potenzial dieser Sensoren und neuartiger Auswerteverfahren zu untersuchen, wurde im Nationalpark Bayerischer Wald das Projekt „Innovative Fernerkundungsmethoden zur Erfassung von Waldstrukturen“ ins Leben gerufen. Für die Datenerhebung wurden vier Testgebiete in unterschiedlichen Waldgesellschaften mit einer Ausdehnung von 3.000 ha ausgewählt. Im Rahmen des Projektes wurden verschiedene flugzeuggetragene Sensoren wie Laserscanner, multifrequentes Radar, optische Scanner und Stereoluftbilder eingesetzt. Parallel zur Aufnahme der Fernerkundungsdaten wurden eine umfangreiche Bodenreferenz von 44 hochgenau vermessenen Referenzflächen und 700 permanenten Inventurpunkten aufgenommen. Außerdem fand eine im bayerischen Wirtschaftswald übliche Beschreibung der Waldbestände nach Waldentwicklungsstadien statt [2].
Un protocole de validation pour la réplication optimiste dans les syst̀emes ŕepartis śemantiquement riches

We study large-scale distributed cooperative systems that use optimistic replication. We represent a system as a graph of actions (operations) connec ted by edges that reify semantic constraints between actions. Constraint types include conflic t, execution order, dependence, and atomicity. The local state is some schedule that conforms to the c onstraints; because of conflicts, client state is only tentative. For consistency, site schedules sh ould converge; we designed a decentralised, asynchronous commitment protocol. Each client makes a prop osal, reflecting its tentative and/or preferred schedules. Our protocol distributes the proposa ls, which it decomposes into semanticallymeaningful units called candidates, and runs an election be tween comparable candidates. A candidate wins when it receives a majority or a plurality. The prot oc l is fully asynchronous: each site executes its tentative schedule independently, and determ in s locally when a candidate has won an election. The committed schedule is as close as possible to t he preferences expressed by clients. Key-words: data replication, optimistic replication, semantic repli cat on, commitment, voting protocols. ∗ LIP6, 104, ave. du Président Kennedy, 75016 Paris, France; mailto:pierre.sutra@lip6.fr Un protocole de validation pour la réplication optimiste dans les syst̀emes ŕepartis śemantiquement riches Résuḿe : Nous examinons à travers ce document la cohérence dans les syst` mes répartis répliquant des données de manière optimiste. Le paradigme de la répl ication optimiste est que les sites composant le système réparti peuvent ré-éxecuter les requêtes d es clients (actions) si la sémantique liant les actions le nécessite. Dans de tels systèmes le critère de coh ́ rence est que les sites convergent à terme vers des exécutions équivalentes. Afin d’assurer ce tte onvergence, un protocole de validation est nécessaire. C’est l’objet de cette étude. Notre proto cole procède par éléctions successives sur des ensembles d’actions exécutées de manière optimiste par l système. La sémantique prise en compte dans ce protocole est suffisament riche pour exprimer des not ions telles que la non-commutativité, le conflit ou encore la causalité entre les actions. Nous pro uvons que notre protocole est sûr, et ce en dépit des éventuelles pannes franches pouvant survenir s ur les sites. Mots-clés : réplication optimiste, validation, protocoles de vote An Asynchronous, Decentralised Commitment for Optimistic Semantic Replication 3
Tensor completion for estimating missing values in visual data

In this paper we propose an algorithm to estimate missing values in tensors of visual data. The values can be missing due to problems in the acquisition process, or because the user manually identified unwanted outliers. Our algorithm works even with a small amount of samples and it can propagate structure to fill larger missing regions. Our methodology is built on recent studies about matrix completion using the matrix trace norm. The contribution of our paper is to extend the matrix case to the tensor case by laying out the theoretical foundations and then by building a working algorithm. First, we propose a definition for the tensor trace norm, that generalizes the established definition of the matrix trace norm. Second, similar to matrix completion, the tensor completion is formulated as a convex optimization problem. Unfortunately, the straightforward problem extension is significantly harder to solve than the matrix case because of the dependency among multiple constraints. To tackle this problem, we employ a relaxation technique to separate the dependant relationships and use the block coordinate descent (BCD) method to achieve a globally optimal solution. Our experiments show potential applications of our algorithm and the quantitative evaluation indicates that our method is more accurate and robust than heuristic approaches.
Similarity searching: Towards bulk-loading peer-to-peer networks

Due to the exponential growth of digital data and its complexity, we need a technique which allows us to search such collections efficiently. A suitable solution seems to be based on the peer-to-peer (P2P) network paradigm and the metric-space model of similarity. During the building phase of the distributed structure, the peers often split as new peers join the network. During a peer split, the local data is halved and one half is migrated to the new peer. In this paper, we study the problem of efficient splits of metric data locally organized by an M-tree and we propose a novel algorithm for speeding the splits up. In particular, we focus on the metric-based structured P2P network called the M-Chord. In experimental evaluation, we compare the proposed algorithm with several straightforward solutions on a real network organizing 10 million images. Our algorithm provides a significant performance boost.