Search

Toxic content detection aims to identify content that can offend or harm its recipients. Automated classifiers of toxic content need to be robust against adversaries who deliberately try to bypass filters. We propose a method of generating realistic model-agnostic attacks using a lexicon of toxic tokens, which attempts to mislead toxicity classifiers by diluting the toxicity signal either by obfuscating toxic tokens through character-level perturbations, or by injecting non-toxic distractor tokens. We show that these realistic attacks reduce the detection recall of state-of-the-art neural toxicity detectors, including those using ELMo and BERT, by more than 50% in some cases. We explore two approaches for defending against such attacks. First, we examine the effect of training on synthetically noised data. Second, we propose the Contextual Denoising Autoencoder (CDAE): a method for learning robust representations that uses character-level and contextual information to denoise perturbed tokens. We show that the two approaches are complementary, improving robustness to both character-level perturbations and distractors, recovering a considerable portion of the lost accuracy. Finally, we analyze the robustness characteristics of the most competitive methods and outline practical considerations for improving toxicity detectors., Comment: to appear at EDSMLS 2020

We propose and investigate feasibility of a novel task that consists in finding e-sports talent using multimodal Twitch chat and video stream data. In that, we focus on predicting the ranks of Counter-Strike: Global Offensive (CS:GO) gamers who broadcast their games on Twitch. During January 2019-April 2019, we have built two Twitch stream collections: One for 425 publicly ranked CS:GO gamers and one for 9,928 unranked CS:GO gamers. We extract neural features from video, audio and text chat data and estimate modality-specific probabilities for a gamer to be top-ranked during the data collection time-frame. A hierarchical Bayesian model is then used to pool the evidence across modalities and generate estimates of intrinsic skill for each gamer. Our modeling is validated through correlating the intrinsic skill predictions with May 2019 ranks of the publicly profiled gamers.

The PhD thesis considers four topics in dynamical systems and is based on one paper and three manuscripts. In Paper I we apply methods of interval analysis in order to compute the rigorous enclosure of rotation number. The described algorithm is supplemented with a method of proving the existence of periodic points which is used to check rationality of the rotation number. In Manuscript II we provide a numerical algorithm for computing critical points of the multiplier map for the quadratic family (i.e., points where the derivative of the multiplier with respect to the complex parameter vanishes). Manuscript III concerns continued fractions of quadratic irrationals. We show that the generating function corresponding to the sequence of denominators of the best rational approximants of a quadratic irrational is a rational function with integer coefficients. As a corollary we can compute the Lévy constant of any quadratic irrational explicitly in terms of its partial quotients. Finally, in Manuscript IV we develop a method for finding rigorous enclosures of all odd periodic solutions of the stationary Kuramoto-Sivashinsky equation. The problem is reduced to a bounded, finite-dimensional constraint satisfaction problem whose solution gives the desired information about the original problem. Developed approach allows us to exclude the regions in L2, where no solution can exist.

The PhD thesis considers four topics in dynamical systems and is based on one paper and three manuscripts. In Paper I we apply methods of interval analysis in order to compute the rigorous enclosure of rotation number. The described algorithm is supplemented with a method of proving the existence of periodic points which is used to check rationality of the rotation number. In Manuscript II we provide a numerical algorithm for computing critical points of the multiplier map for the quadratic family (i.e., points where the derivative of the multiplier with respect to the complex parameter vanishes). Manuscript III concerns continued fractions of quadratic irrationals. We show that the generating function corresponding to the sequence of denominators of the best rational approximants of a quadratic irrational is a rational function with integer coefficients. As a corollary we can compute the Lévy constant of any quadratic irrational explicitly in terms of its partial quotients. Finally, in Manuscript IV we develop a method for finding rigorous enclosures of all odd periodic solutions of the stationary Kuramoto-Sivashinsky equation. The problem is reduced to a bounded, finite-dimensional constraint satisfaction problem whose solution gives the desired information about the original problem. Developed approach allows us to exclude the regions in L2, where no solution can exist.

The PhD thesis considers four topics in dynamical systems and is based on one paper and three manuscripts. In Paper I we apply methods of interval analysis in order to compute the rigorous enclosure of rotation number. The described algorithm is supplemented with a method of proving the existence of periodic points which is used to check rationality of the rotation number. In Manuscript II we provide a numerical algorithm for computing critical points of the multiplier map for the quadratic family (i.e., points where the derivative of the multiplier with respect to the complex parameter vanishes). Manuscript III concerns continued fractions of quadratic irrationals. We show that the generating function corresponding to the sequence of denominators of the best rational approximants of a quadratic irrational is a rational function with integer coefficients. As a corollary we can compute the Lévy constant of any quadratic irrational explicitly in terms of its partial quotients. Finally, in Manuscript IV we develop a method for finding rigorous enclosures of all odd periodic solutions of the stationary Kuramoto-Sivashinsky equation. The problem is reduced to a bounded, finite-dimensional constraint satisfaction problem whose solution gives the desired information about the original problem. Developed approach allows us to exclude the regions in L2, where no solution can exist.

The PhD thesis considers four topics in dynamical systems and is based on one paper and three manuscripts. In Paper I we apply methods of interval analysis in order to compute the rigorous enclosure of rotation number. The described algorithm is supplemented with a method of proving the existence of periodic points which is used to check rationality of the rotation number. In Manuscript II we provide a numerical algorithm for computing critical points of the multiplier map for the quadratic family (i.e., points where the derivative of the multiplier with respect to the complex parameter vanishes). Manuscript III concerns continued fractions of quadratic irrationals. We show that the generating function corresponding to the sequence of denominators of the best rational approximants of a quadratic irrational is a rational function with integer coefficients. As a corollary we can compute the Lévy constant of any quadratic irrational explicitly in terms of its partial quotients. Finally, in Manuscript IV we develop a method for finding rigorous enclosures of all odd periodic solutions of the stationary Kuramoto-Sivashinsky equation. The problem is reduced to a bounded, finite-dimensional constraint satisfaction problem whose solution gives the desired information about the original problem. Developed approach allows us to exclude the regions in L2, where no solution can exist.

The PhD thesis considers four topics in dynamical systems and is based on one paper and three manuscripts. In Paper I we apply methods of interval analysis in order to compute the rigorous enclosure of rotation number. The described algorithm is supplemented with a method of proving the existence of periodic points which is used to check rationality of the rotation number. In Manuscript II we provide a numerical algorithm for computing critical points of the multiplier map for the quadratic family (i.e., points where the derivative of the multiplier with respect to the complex parameter vanishes). Manuscript III concerns continued fractions of quadratic irrationals. We show that the generating function corresponding to the sequence of denominators of the best rational approximants of a quadratic irrational is a rational function with integer coefficients. As a corollary we can compute the Lévy constant of any quadratic irrational explicitly in terms of its partial quotients. Finally, in Manuscript IV we develop a method for finding rigorous enclosures of all odd periodic solutions of the stationary Kuramoto-Sivashinsky equation. The problem is reduced to a bounded, finite-dimensional constraint satisfaction problem whose solution gives the desired information about the original problem. Developed approach allows us to exclude the regions in L2, where no solution can exist.

We apply set-valued numerical methods to compute an accurate enclosure of the rotation number. The described algorithm is supplemented with a method of proving the existence of periodic points, which is used to check the rationality of the rotation number. A few numerical experiments are presented to show that the implementation of interval methods produces a good enclosure of the rotation number of a circle map.

Kaliningrad Oblast of the Russian Federation has a unique position in the Baltic Sea Region due to its physiographic situation and, thereby, it plays an active role in geopolitical and economic processes that occur in the Baltic Sea Region. This, first of all, happens owing to its exclave position that causes to a great extent a necessity for close cross-border integration for the developing economy of the Oblast. The article considers new spatial forms of international economic integration (NSFIEI) contributing to the development of border regions; distinguishing of the border regions as international "development corridors" has been substantiated within the general region classification; the place of Kaliningrad Oblast regarding the level of economic development and maturity of external relations among the border regions of Russia has been shown; its role as an "international development corridor" of Russia and EU has also been viewed. The comparative method and the technique of economic geography classification have been applied. (author's abstract)

The article focuses on the basic tools of Russia-EU international cooperation, cofunded by the EU and Russia, such as crossborder, trans-border, and transnational cooperation programmes, which can contribute to innovative, scientific and technological development. The author gives an overview of large-scale Russia-EU international cooperation projects in the field of innovations and comments on the cooperation programme running until the end of 2013. Special attention is paid to a special financial tool - the Framework Programme - one of the most important tools of financial support for joint projects in the fields of science and innovation with the EU participation. The article emphasises the opportunities for career growth and professional development for individual researchers in the field of innovation.

This article addresses the role of innovative centres in the development of surrounding areas beyond large cities. At the same time, the innovative development of rural areas should be of a composite nature; municipality development strategies take innovations into account. International practices serve as a an argument in favour of establishing innovative centres in smaller and medium-sized towns in order to facilitate the socioeconomic development of the territory and surrounding rural areas. Science parks created in smaller towns give a boost to socioeconomic development. The authors analyse the case of the science park in the town of Gusev in the Kaliningrad region and emphasise the role of development and adoption of legal acts at regional and municipal levels, for example, the law «On the production policy of the Kaliningrad region».

We merged results obtained from the Category B index with results obtained from the index built over complete (Category A) anchor text. However, we were unable to improve over Category B results in either the ad hoc or the diversity task., Presented at the Twenty-First Text REtrieval Conference (TREC 2012) held in Gaithersburg, Maryland, November 6-9, 2012. The conference was co-sponsored by the National Institute of Standards and Technology (NIST) the Defense Advanced Research Projects Agency (DARPA) and the Advanced Research and Development Activity (ARDA). U.S. Government or Federal Rights License

A meshfree approximation scheme based on the radial basis function methods is presented for the numerical solution of the options pricing model. This thesis deals with the valuation of the European, Barrier, Asian, American options of a single asset and American options of multi assets. The option prices are modeled by the Black-Scholes equation. The θ-method is used to discretize the equation with respect to time. By the next step, the option price is approximated in space with radial basis functions (RBF) with unknown parameters, in particular, we con- sider multiquadric radial basis functions (MQ-RBF). In case of Ameri- can options a penalty method is used, i.e. removing the free boundary is achieved by adding a small and continuous penalty term to the Black- Scholes equation. Finally, a comparison of analytical and finite difference solutions and numerical results from the literature is included.

We describe experiments with proximity-aware ranking functions that use indexing of word pairs. Our goal is to evaluate a method of "mild" pruning of proximity information, which would be appropriate for a moderately loaded retrieval system, e.g., an enterprise search engine. We create an index that includes occurrences of close word pairs, where one of the words is frequent. This allows one to efficiently restore relative positional information for all non-stop words within a certain distance. It is also possible to answer phrase queries promptly. We use two functions to evaluate relevance: a modification of a classic proximity-aware function and a logistic function that includes a linear combination of relevance features. Additionally, we use the spam scores provided by the University of Waterloo., Presented at the Text REtrieval Conference (TREC 2010) (19th) held in Gaithersburg, Maryland on 16-19 November 2010. Published in the Proceedings of the Text REtrieval Conference (TREC 2010) (19th), November 2010. Sponsored in part by the Defense Advanced Research Projects Agency (DARPA), and the Advanced Research and Development Activity (ARDA).