15,640 research outputs found

    Prospects for Russia's Economic Reforms

    Get PDF
    macroeconomics, Russia, Economic Reforms

    Creating a Market Economy in Eastern Europe: The Case of Poland

    Get PDF
    macroeconomics, market economy, Eastern Europe, Poland

    Copyright’s Twilight Zone: Digital Copyright Lessons from the Vampire Blogosphere

    Get PDF
    Web 2.0 technologies, characterized by user-generated content, raise new challenges for copyright law. Online interactions involving reproductions of copyrighted works in blogs, online fan fiction, and online social networks do not comfortably fit existing copyright paradigms. It is unclear whether participants in Web 2.0 forums are creating derivative works, making legitimate fair uses of copyright works, or engaging in acts of digital copyright piracy and plagiarism. As online conduct becomes more interactive, copyright laws are less effective in creating clear signals about proscribed conduct. This article examines the application of copyright law to Web 2.0 technologies. It suggests that social norms must take on greater significance because of the community-oriented nature of much of today’s online conduct. Social norms are significant both as a form of social regulation and because they can guide law and policy makers about appropriate new directions for copyright law reform. This article focuses on four case studies involving the popular Twilight book and movie franchise. These case studies illuminate the relationship between copyright norms and laws in the Web 2.0 context. The author draws lessons from the case studies that might inform future developments in copyright law and policy that would better align laws with expectations of Web 2.0 participants. Twilight is chosen as the focal point because of the complex online relationships that have developed in recent years between the various copyright stakeholders: the book author; movie directors; producers and distributors of the books and movies; actors and production crews; and, the fans

    The DRM Dilemma: Re-Aligning Rights Under the Digital Millennium Copyright Act

    Get PDF
    The Digital Millennium Copyright Act (‘DMCA’) prevents unauthorized copying and distribution of digital copyright works by regulating devices that can be used to circumvent Digital Rights Management (‘DRM’) measures that are used to restrict access to those works. A significant problem is that those devices, like many new technologies, have the potential to be used for both socially harmful and socially beneficial purposes. There is no obvious way for Congress to regulate circumvention devices to prevent the social harms, while at the same time facilitating the social benefits they might provide. Recent judicial interpretations of the DMCA have unsurprisingly erred on the side of harm-prevention to the detriment of potentially legitimate uses of circumvention devices. Unlike previous scholarship, this article suggests that the answer to this dilemma is not necessarily to amend the DMCA to bolster legitimate use exceptions to the anti-circumvention provisions. Instead, this article advocates resolving the problem through a new approach that takes socially beneficial uses of circumvention technologies outside the scope of the DMCA altogether. The idea is to create a new administrative complaints mechanism that would support those seeking to make such uses of digitally encrypted copyright works by imposing legal obligations on copyright holders to facilitate those uses. This approach has the added benefit of generating a significant amount of data about emerging social norms relating to the boundaries of the fair use doctrine that could be fed back into legislative and judicial processes as copyright law develops in the future

    Advanced Multilevel Node Separator Algorithms

    Full text link
    A node separator of a graph is a subset S of the nodes such that removing S and its incident edges divides the graph into two disconnected components of about equal size. In this work, we introduce novel algorithms to find small node separators in large graphs. With focus on solution quality, we introduce novel flow-based local search algorithms which are integrated in a multilevel framework. In addition, we transfer techniques successfully used in the graph partitioning field. This includes the usage of edge ratings tailored to our problem to guide the graph coarsening algorithm as well as highly localized local search and iterated multilevel cycles to improve solution quality even further. Experiments indicate that flow-based local search algorithms on its own in a multilevel framework are already highly competitive in terms of separator quality. Adding additional local search algorithms further improves solution quality. Our strongest configuration almost always outperforms competing systems while on average computing 10% and 62% smaller separators than Metis and Scotch, respectively

    An Approach to Ecosystem-Based Fishery Management

    Get PDF
    Marine scientists and policymakers are encouraging ecosystem-based fishery management (EBFM), but there is limited guidance on how to operationalize the concept. We adapt financial portfolio theory as a method for EBFM that accounts for species interdependencies, uncertainty, and sustainability constraints. Illustrating our method with routinely collected data available from the Chesapeake Bay, we demonstrate the gains from taking into account species variances and covariances in setting species total allowable catches. We find over the period from 1962–2003 that managers could have increased the revenues from fishing and reduced the variance by employing ecosystem frontiers in setting catch levels.ecosystem-based fishery management, portfolio, trophic modeling, precaution

    Dipole: Diagnosis Prediction in Healthcare via Attention-based Bidirectional Recurrent Neural Networks

    Full text link
    Predicting the future health information of patients from the historical Electronic Health Records (EHR) is a core research task in the development of personalized healthcare. Patient EHR data consist of sequences of visits over time, where each visit contains multiple medical codes, including diagnosis, medication, and procedure codes. The most important challenges for this task are to model the temporality and high dimensionality of sequential EHR data and to interpret the prediction results. Existing work solves this problem by employing recurrent neural networks (RNNs) to model EHR data and utilizing simple attention mechanism to interpret the results. However, RNN-based approaches suffer from the problem that the performance of RNNs drops when the length of sequences is large, and the relationships between subsequent visits are ignored by current RNN-based approaches. To address these issues, we propose {\sf Dipole}, an end-to-end, simple and robust model for predicting patients' future health information. Dipole employs bidirectional recurrent neural networks to remember all the information of both the past visits and the future visits, and it introduces three attention mechanisms to measure the relationships of different visits for the prediction. With the attention mechanisms, Dipole can interpret the prediction results effectively. Dipole also allows us to interpret the learned medical code representations which are confirmed positively by medical experts. Experimental results on two real world EHR datasets show that the proposed Dipole can significantly improve the prediction accuracy compared with the state-of-the-art diagnosis prediction approaches and provide clinically meaningful interpretation

    The Cop Number of the One-Cop-Moves Game on Planar Graphs

    Full text link
    Cops and robbers is a vertex-pursuit game played on graphs. In the classical cops-and-robbers game, a set of cops and a robber occupy the vertices of the graph and move alternately along the graph's edges with perfect information about each other's positions. If a cop eventually occupies the same vertex as the robber, then the cops win; the robber wins if she can indefinitely evade capture. Aigner and Frommer established that in every connected planar graph, three cops are sufficient to capture a single robber. In this paper, we consider a recently studied variant of the cops-and-robbers game, alternately called the one-active-cop game, one-cop-moves game or the lazy-cops-and-robbers game, where at most one cop can move during any round. We show that Aigner and Frommer's result does not generalise to this game variant by constructing a connected planar graph on which a robber can indefinitely evade three cops in the one-cop-moves game. This answers a question recently raised by Sullivan, Townsend and Werzanski.Comment: 32 page
    corecore