958 research outputs found

    Could and Should America Have Made an Ottoman Republic in 1919?

    Get PDF
    Numerous Americans, perhaps especially American lawyers, have since the 1780s presumed to tell other peoples how to govern themselves. In 2006, that persistent impulse was once again echoed in an address to the American Bar Association by a Justice of the Supreme Court. The purpose of this essay is to question the wisdom of this evangelical ambition, especially when the form of instruction includes military force. It is draws on Spreading America\u27s Word (2005) and directs attention to the hopes of American Protestant Zionists to make a democratic republic in Ottoman Palestine. It suggests that chances were better in 1919 than they are in 2008, but were none to good at that time. It rejects the appeal of the militant neo-conservatives who expressed their hopes and expectations in The Project for A New American Century, an instrument that should be read and remembered for centuries to come

    BINet: Multi-perspective Business Process Anomaly Classification

    Full text link
    In this paper, we introduce BINet, a neural network architecture for real-time multi-perspective anomaly detection in business process event logs. BINet is designed to handle both the control flow and the data perspective of a business process. Additionally, we propose a set of heuristics for setting the threshold of an anomaly detection algorithm automatically. We demonstrate that BINet can be used to detect anomalies in event logs not only on a case level but also on event attribute level. Finally, we demonstrate that a simple set of rules can be used to utilize the output of BINet for anomaly classification. We compare BINet to eight other state-of-the-art anomaly detection algorithms and evaluate their performance on an elaborate data corpus of 29 synthetic and 15 real-life event logs. BINet outperforms all other methods both on the synthetic as well as on the real-life datasets

    TRIDEnT: Building Decentralized Incentives for Collaborative Security

    Full text link
    Sophisticated mass attacks, especially when exploiting zero-day vulnerabilities, have the potential to cause destructive damage to organizations and critical infrastructure. To timely detect and contain such attacks, collaboration among the defenders is critical. By correlating real-time detection information (alerts) from multiple sources (collaborative intrusion detection), defenders can detect attacks and take the appropriate defensive measures in time. However, although the technical tools to facilitate collaboration exist, real-world adoption of such collaborative security mechanisms is still underwhelming. This is largely due to a lack of trust and participation incentives for companies and organizations. This paper proposes TRIDEnT, a novel collaborative platform that aims to enable and incentivize parties to exchange network alert data, thus increasing their overall detection capabilities. TRIDEnT allows parties that may be in a competitive relationship, to selectively advertise, sell and acquire security alerts in the form of (near) real-time peer-to-peer streams. To validate the basic principles behind TRIDEnT, we present an intuitive game-theoretic model of alert sharing, that is of independent interest, and show that collaboration is bound to take place infinitely often. Furthermore, to demonstrate the feasibility of our approach, we instantiate our design in a decentralized manner using Ethereum smart contracts and provide a fully functional prototype.Comment: 28 page

    A Systematic Approach to Constructing Incremental Topology Control Algorithms Using Graph Transformation

    Full text link
    Communication networks form the backbone of our society. Topology control algorithms optimize the topology of such communication networks. Due to the importance of communication networks, a topology control algorithm should guarantee certain required consistency properties (e.g., connectivity of the topology), while achieving desired optimization properties (e.g., a bounded number of neighbors). Real-world topologies are dynamic (e.g., because nodes join, leave, or move within the network), which requires topology control algorithms to operate in an incremental way, i.e., based on the recently introduced modifications of a topology. Visual programming and specification languages are a proven means for specifying the structure as well as consistency and optimization properties of topologies. In this paper, we present a novel methodology, based on a visual graph transformation and graph constraint language, for developing incremental topology control algorithms that are guaranteed to fulfill a set of specified consistency and optimization constraints. More specifically, we model the possible modifications of a topology control algorithm and the environment using graph transformation rules, and we describe consistency and optimization properties using graph constraints. On this basis, we apply and extend a well-known constructive approach to derive refined graph transformation rules that preserve these graph constraints. We apply our methodology to re-engineer an established topology control algorithm, kTC, and evaluate it in a network simulation study to show the practical applicability of our approachComment: This document corresponds to the accepted manuscript of the referenced journal articl

    A Systematic Approach to Constructing Families of Incremental Topology Control Algorithms Using Graph Transformation

    Full text link
    In the communication systems domain, constructing and maintaining network topologies via topology control (TC) algorithms is an important cross-cutting research area. Network topologies are usually modeled using attributed graphs whose nodes and edges represent the network nodes and their interconnecting links. A key requirement of TC algorithms is to fulfill certain consistency and optimization properties to ensure a high quality of service. Still, few attempts have been made to constructively integrate these properties into the development process of TC algorithms. Furthermore, even though many TC algorithms share substantial parts (such as structural patterns or tie-breaking strategies), few works constructively leverage these commonalities and differences of TC algorithms systematically. In previous work, we addressed the constructive integration of consistency properties into the development process. We outlined a constructive, model-driven methodology for designing individual TC algorithms. Valid and high-quality topologies are characterized using declarative graph constraints; TC algorithms are specified using programmed graph transformation. We applied a well-known static analysis technique to refine a given TC algorithm in a way that the resulting algorithm preserves the specified graph constraints. In this paper, we extend our constructive methodology by generalizing it to support the specification of families of TC algorithms. To show the feasibility of our approach, we reneging six existing TC algorithms and develop e-kTC, a novel energy-efficient variant of the TC algorithm kTC. Finally, we evaluate a subset of the specified TC algorithms using a new tool integration of the graph transformation tool eMoflon and the Simonstrator network simulation framework.Comment: Corresponds to the accepted manuscrip

    Interaction Support for Hybrid Groups of Paper and Digital Documents on Tabletops

    Get PDF
    Based on the results of a user study, this paper presents a set of hybrid interaction techniques for groups of paper and digital documents on interactive surfaces. By leveraging a novel concept of tangible controls, these techniques allow highly flexible, fluid and lightweight interactions

    Влияние кристаллической структуры вещества на потери энергии быстрыми протонами в монокристаллах галогенидов щелочных металлов

    Get PDF
    В работе рассмотрен вопрос о каналировании протонов в ионных кристаллах, обладающих простой кубической структурой. Рассмотрены случаи прохождения протонов в направлении [100] и между плоскостями (100) монокристаллов. Рассчитаны потенциалы для атомных плоскостей и атомных рядов кристаллов и определены предельные углы каналирования для соединений галогенидов натрия и калия. Исследованы энергетические спектры протонов, прошедших монокристаллические мишени различных соединений, и найдена корреляция между формой энергетического спектра и соотношением радиусов ионов в соединении, между долей каналирования частиц и порядковым номером галоида в рядах

    Die erfolgreiche Steuerung von Vertriebspartnern in Mehrkanalvertriebssystemen

    Full text link
    Formalisierung wirkt sich sowohl auf den Erfolg des Herstellers als auch auf den Erfolg der Vertriebspartner positiv aus. Die Zentralisierung von Entscheidungsgewalt beim Hersteller beeinfluss dagegen den Erfolg von Herstellern und Vertriebspartnern negativ. Der negative Effekt von Zentralisierung auf Hersteller und Vertriebspartner ist insbesondere in Vertriebssystemen mit (1) stark differenzierten Kanälen oder in (2) volatilen Industrien stark ausgeprägt. Vertriebspartner profitieren besonders von einem hohen grad an Formalisierung in Vertriebssystemen mit hoher (1) Distributionsintensität oder wenn sie mehr (2) Markt- und Kundeninformationen als ihre Hersteller besitzen

    Design and governance of multichannel sales systems: Financial performance consequences in business-to-business markets

    Get PDF
    Multichannel sales systems in business-to-business markets vary substantially in their designs and thereby either attenuate or aggravate agency conflicts between manufacturers and sales partners. Drawing on multiple agency theory, the authors introduce direct and indirect channel usage as focal design dimensions of multichannel sales systems and investigate each channel’s performance effects using a matched manufacturer–sales partner data set. Whereas direct channel usage predominantly lowers agency conflicts in terms of information asymmetry and sales partner moral hazard, indirect channel usage amplifies moral hazard concerns. How those sales partner effects translate into manufacturer performance outcomes critically depends on governance mechanisms, confirming predictions from governance value analysis: formalization enhances performance outcomes for manufacturers in the case of indirect channel usage but diminishes performance in the case of direct channel usage. The authors observe converse effects for centralization and information exchange: centralization and information exchange enhance outcomes of direct channel usage but diminish outcomes of indirect channel usage. The focal managerial implication is that managers must align the design of their multichannel sales systems with effective governance mechanisms
    corecore