Training parsers by inverse reinforcement learning

One major idea in structured prediction is to assume that the predictor computes its output by finding the maximum of a score function. The training of such a predictor can then be cast as the problem of finding weights of the score function so that the output of the predictor on the inputs matches the corresponding structured labels on the training set. A similar problem is studied in inverse reinforcement learning (IRL) where one is given an environment and a set of trajectories and the problem is to find a reward function such that an agent acting optimally with respect to the reward function would follow trajectories that match those in the training set. In this paper we show how IRL algorithms can be applied to structured prediction, in particular to parser training. We present a number of recent incremental IRL algorithms in a unified framework and map them to parser training algorithms. This allows us to recover some existing parser training algorithms, as well as to obtain a new one. The resulting algorithms are compared in terms of their sensitivity to the choice of various parameters and generalization ability on the Penn Treebank WSJ corpus.     

Minimum Weight Convex Steiner Partitions

New tight bounds are presented on the minimum length of planar straight line graphs connecting n given points in the plane and having convex faces. Specifically, we show that the minimum length of a convex Steiner partition for n points in the plane is at most O(log n/log log n) times longer than a Euclidean minimum spanning tree (EMST), and this bound is the best possible. Without Steiner points, the corresponding bound is known to be Θ(log n), attained for n vertices of a pseudo-triangle. We also show that the minimum length convex Steiner partition of n points along a pseudo-triangle is at most O(log log n) times longer than an EMST, and this bound is also the best possible. Our methods are constructive and lead to O(nlog n) time algorithms for computing convex Steiner partitions having O(n) Steiner points and weight within the above worst-case bounds in both cases.     

The Design, Implementation, and Operation of a Hungarian E-Mail Reader

The market's leading Hungarian Global System for Mobile Communications (GSM) operator—Westel—has recently introduced a Hungarian e-mail reading system as a regular service. It was implemented on the basis of an experimental system developed at the Department of Telecommunications and Telematics of the Budapest University of Technology and Economics (DTT BUTE). In this article, the considerations involved in the design and implementation decisions of both the experimental and the industrial systems will be described. Results of the first 10 weeks of regular use of the industrial system will also be given.     

First genetically verified occurrence of Ligula pavlovskii outside its native range and characteristics of its infection in Neogobius fluviatilis

In this study, we provide the first genetically verified distribution record beyond its native range of Ligula pavlovskii, a high-impact endoparasite of Ponto-Caspian gobies. According to parasitological surveys, ligulosis was detected for the first time in monkey goby individuals collected from Lake Balaton in 2004, 34 years after the first record of monkey goby in the lake. During a Lake Balaton survey in 2018, we detected tapeworms in 44.4% of the sampled monkey gobies. This prevalence is about two to ten times higher than it was reported from within the native range of the fish hosts. The same survey revealed an uneven spatial distribution of the ligulosis in the monkey gobies inhabiting different shoreline sections of the lake. We assume that the occurrence and recent distribution data of this high-impact endoparasite may provide useful information for potential biocontrol measures of invasive Ponto-Caspian gobies in the future.     

Yield estimation and forecasting for winter wheat in Hungary using time series of MODIS data

Wheat is one of the most important crops in Hungary, which represents approximately 20% of the entire agricultural area of the country, and about 40% of cereals. A robust yield method has been improved for estimating and forecasting wheat yield in Hungary in the period of 2003–2015 using normalized difference vegetation index (NDVI) derived from the data of the Moderate Resolution Imaging Spectroradiometer. Estimation was made at the end of June – it is generally the beginning of harvest of winter wheat in Hungary – while the forecasts were performed 1–7 weeks earlier. General yield unified robust reference index (GYURRI) vegetation index was calculated each year using different curve-fitting methods to the NDVI time series. The correlation between GYURRI and country level yield data gave correlation coefficient (r) of 0.985 for the examined 13 years in the case of estimation. Simulating a quasi-operative yield estimation process, 10 years’ (2006–2015) yield data was estimated. The differences between the estimated and actual yield data provided by the Hungarian Central Statistical Office were less than 5%, the average difference was 2.5%. In the case of forecasting, these average differences calculated approximately 2 and 4 weeks before the beginning of harvest season were 4.5% and 6.8%, respectively. We also tested the yield estimation procedure for smaller areas, for the 19 counties (Nomenclature of Territorial Units for Statistics-3 level) of Hungary. We found that, the relationship between GYURRI and the county level yield data had r of 0.894 for the years 2003–2014, and by simulating the quasi-operative forecast for 2015, the resulting 19 county average yield values differed from the actual yield as much as 8.7% in average.     

2D operators on topographic and non‐topographic architectures—implementation,efficiency analysis,and architecture selection methodology

Topographic and non‐topographic image processing architectures and chips, developed within the CNN community recently, are analyzed and compared. It is achieved on a way that the 2D operators are collected to classes according to their implementation methods on the different architectures, and the main implementation parameters of the different operator classes are compared. Based on the results, an efficient architecture selection methodology is formalized. Copyright © 2010 John Wiley & Sons, Ltd.     

Parallel sphere detector algorithm providing optimal MIMO detection on massively parallel architectures

Multiple‐input multiple‐output (MIMO) systems have attracted considerable attention in wireless communications because they offer a significant increase in data throughput and link coverage without additional bandwidth requirement or increased transmit power. The price that has to be paid is the increased complexity of hardware components and algorithms. The sphere detector (SD) algorithm solves the problem of maximum likelihood (ML) detection for MIMO channels by significantly reducing the search space of possible solutions. The main drawback of the SD algorithm is in its sequential nature, consequently, running it on massively parallel architectures (MPAs) is very inefficient. In order to overcome the drawbacks of the SD algorithm, a new parallel sphere detector (PSD) algorithm is proposed. It implements a novel hybrid tree search method, where the algorithm parallelism is assured by the efficient combination of depth‐first search and breadth‐first search algorithms. A path metric‐based parallel sorting is employed at each intermediate stage. The PSD algorithm is able to adjust its memory requirements and extent of parallelism to fit a wide range of parallel architectures. Mapping details for MPAs are proposed by giving the details of thread dependent, highly parallel building blocks of the algorithm. Based on the building blocks proposed, a mapping to general‐purpose graphics processing unit is provided, and its performance is evaluated. In order to achieve high‐throughput, several levels of parallelism are introduced, and different scheduling strategies are considered. Copyright © 2015 John Wiley & Sons, Ltd.     

N-Aminierung von Isochinolinbasen

N-Amination of Isoquinoline Bases 3, 3-Pentamethylene oxaziridine 1 forms an N N-bond with secondary isoquinoline bases 2a – f to give the cyclohexylidene hydrazines 3a – f . In some cases nitrogen elimination yielding indane derivatives 13b, 13e competes with hydrazone formation. The cyclic Schiff'base 14 and the β-carboline derivative 16 can also be aminated.     

Phenylalanine Ammonia‐Lyase‐Catalyzed Deamination of an Acyclic Amino Acid: Enzyme Mechanistic Studies Aided by a Novel Microreactor Filled with Magnetic Nanoparticles

Phenylalanine ammonia‐lyase (PAL), found in many organisms, catalyzes the deamination of l ‐phenylalanine (Phe) to (E)‐cinnamate by the aid of its MIO prosthetic group. By using PAL immobilized on magnetic nanoparticles and fixed in a microfluidic reactor with an in‐line UV detector, we demonstrated that PAL can catalyze ammonia elimination from the acyclic propargylglycine (PG) to yield (E)‐pent‐2‐ene‐4‐ynoate. This highlights new opportunities to extend MIO enzymes towards acyclic substrates. As PG is acyclic, its deamination cannot involve a Friedel–Crafts‐type attack at an aromatic ring. The reversibility of the PAL reaction, demonstrated by the ammonia addition to (E)‐pent‐2‐ene‐4‐ynoate yielding enantiopure l ‐PG, contradicts the proposed highly exothermic single‐step mechanism. Computations with the QM/MM models of the N‐MIO intermediates from l ‐PG and l ‐Phe in PAL show similar arrangements within the active site, thus supporting a mechanism via the N‐MIO intermediate.