85 research outputs found

    Robust algorithms with polynomial loss for near-unanimity CSPs

    Get PDF
    An instance of the Constraint Satisfaction Problem (CSP) is given by a family of constraints on overlapping sets of variables, and the goal is to assign values from a xed domain to the variables so that all constraints are satised. In the optimization version, the goal is to maximize the number of satised constraints. An approximation algorithm for CSP is called robust if it outputs an assignment satisfying an (1????g("))-fraction of constraints on any (1????")-satisable instance, where the loss function g is such that g(") ! 0 as " ! 0. We study how the robust approximability of CSPs depends on the set of constraint relations allowed in instances, the so-called constraint language. All constraint languages admitting a robust polynomial-time algorithm (with some g) have been characterised by Barto and Kozik, with the general bound on the loss g being doubly exponential, specically g(") = O((log log(1="))= log(1=")). It is natural to ask when a better loss can be achieved: in particular, polynomial loss g(") = O("1=k) for some constant k. In this paper, we consider CSPs with a constraint language having a nearunanimity polymorphism. This general condition almost matches a known necessary condition for having a robust algorithm with polynomial loss. We give two randomized robust algorithms with polynomial loss for such CSPs: one works for any near-unanimity polymorphism and the parameter k in the loss depends on the size of the domain and the arity of the relations in ????, while the other works for a special ternary near-unanimity operation called dual discriminator with k = 2 for any domain size. In the latter case, the CSP is a common generalisation of Unique Games with a xed domain and 2-Sat. In the former case, we use the algebraic approach to the CSP. Both cases use the standard semidenite programming relaxation for CSP

    Ensuring Information Security When Serializing Java Objects

    Get PDF
    This paper describes how to serialize Java objects with support for encryption and electronic signature. Based on existing tools in Java, its own implementation with fixed security settings is proposed

    Обмен мнениями по поводу статьи Мартина Мюллера «Разыскивая глобальный Восток»

    Full text link
    This section presents exchanges between intellectuals from Eastern and Western Europe, Russia, and North America who kindly agreed to read and comment on Martin Mueller’s article “In Search of the Global East”, relying on the situation in their own academic disciplines, work experiences, and the twists and turns of their scientific research and creative challenges. Researchers, academic teachers, exhibition curators, writers, and architects reflect on the power and influence which geographical names exert on academic life, politics, and culture. Starting from Mueller’s article on the Global East, as well as his other text wherein he expresses his skepticism of the concept of post-socialism, the commentators, evaluating Mueller’s arguments critically, raise a number of fundamental questions. Among these questions is the need to historicize scientific concepts, the issue of the regularly-reproducible misunderstanding (or even exclusion) of the East by Western intellectuals, the tasks the inclusion of the Global East in the overall geographical picture will contribute to, as well as the question of whether the concern that the Global East is not sufficiently heard in the world is narrowly academic. This indirect debate between the author of the key text in this thematic issue and his commentators is significant as an episode of the joint search for a more democratic, creative, and inspiring future for the region that unites Eastern Europe, Russia, and Central Asia. © 2020, RUSSIAN SOCIOLOGICAL REVIEW. All rights reserved

    Politicising government engagement with corporate social responsibility: “CSR” as an empty signifier

    Get PDF
    Governments are widely viewed by academics and practitioners (and society more generally) as the key societal actors who are capable of compelling businesses to practice corporate social responsibility (CSR). Arguably, such government involvement could be seen as a technocratic device for encouraging ethical business behaviour. In this paper, we offer a more politicised interpretation of government engagement with CSR where “CSR” is not a desired form of business conduct but an element of discourse that governments can deploy in structuring their relationships with other social actors. We build our argument through a historical analysis of government CSR discourse in the Russian Federation. Laclau and Mouffe's (Hegemony and socialist strategy: Towards a radical democratic politics,Verso Books, London, 1985) social theory of hegemony underpins our research. We find that “CSR” in the Russian government’s discourse served to legitimise its power over large businesses. Using this case, we contribute to wider academic debates by providing fresh empirical evidence that allows the development of critical evaluation tools in relation to governments’ engagement with “CSR”. We find that governments are capable of hijacking CSR for their own self-interested gain. We close the paper by reflecting on the merit of exploring the case of the Russian Federation. As a “non-core”, non-western exemplar, it provides a useful “mirror” with which to reflect on the more widely used test-bed of Western industrial democracies when scrutinising CSR. Based on our findings, we invite other scholars to adopt a more critical, politicised stance when researching the role of governments in relation to CSR in other parts of the world

    Near-optimal algorithms for maximum constraint satisfaction problems

    No full text

    Beyond the Euler Characteristic

    No full text

    Testing ladle brick made by various factories

    No full text
    corecore