Trivialized Content, Elevated From: Aesthetics of Secrecy in Turkish Politics in the 2000s

This essay will first provide a brief history of the Islamist party\u27s coming to power by means of its effective use of a populist imagery. The paper will then focus on the emergence of a new regime of secrecy in Turkish politics by looking at two high-profile legal cases, Ergenekon and the “Cosmic Room,” in which one can observe the blueprints of a struggle between different factions for taking over the state. During the investigations, secret documents about the wrongdoings of the secular establishment were leaked to and widely covered by the media. Sober debates on the contents of such documents were dwarfed by the tendency to scandalize, stigmatize, and foster fascination for the purported clandestine organizations within the state in line with conspiracist aesthetics. In later sections of the paper, the elements of entertainment and seriousness of this conspiracist aesthetics are analyzed

Q factors for antennas in dispersive media

Stored energy and Q-factors are used to quantify the performance of small antennas. Accurate and efficient evaluation of the stored energy is also essential for current optimization and the associated physical bounds. Here, it is shown that the frequency derivative of the input impedance and the stored energy can be determined from the frequency derivative of the electric field integral equation. The expressions for the differentiated input impedance and stored energies differ by the use of a transpose and Hermitian transpose in the quadratic forms. The quadratic forms also provide simple single frequency formulas for the corresponding Q-factors. The expressions are further generalized to antennas integrated in temporally dispersive media. Numerical examples that compare the different Q-factors are presented for dipole and loop antennas in conductive, Debye, Lorentz, and Drude media. The computed Q-factors are also verified with the Q-factor obtained from the stored energy in Brune synthesized circuit models

Tacit Collusion under Fairness and Reciprocity

This paper explores the implications of fairness and reciprocity in dynamic market games. A reciprocal player responds to kind behavior of rivals with unkind actions (destructive reciprocity), while at the same time, it responds to kind behavior of rivals with kind actions (constructive reciprocity). The paper shows that for general perceptions of fairness, reciprocity facilitates collusion in dynamic market games. The paper also shows that this is a robust result. It holds when players' choices are strategic complements and strategic substitutes. It also holds under grim trigger punishments and optimal punishments.fairness; reciprocity; collusion; repeated games

Defining Equitable Geographic Districts in Road Networks via Stable Matching

We introduce a novel method for defining geographic districts in road networks using stable matching. In this approach, each geographic district is defined in terms of a center, which identifies a location of interest, such as a post office or polling place, and all other network vertices must be labeled with the center to which they are associated. We focus on defining geographic districts that are equitable, in that every district has the same number of vertices and the assignment is stable in terms of geographic distance. That is, there is no unassigned vertex-center pair such that both would prefer each other over their current assignments. We solve this problem using a version of the classic stable matching problem, called symmetric stable matching, in which the preferences of the elements in both sets obey a certain symmetry. In our case, we study a graph-based version of stable matching in which nodes are stably matched to a subset of nodes denoted as centers, prioritized by their shortest-path distances, so that each center is apportioned a certain number of nodes. We show that, for a planar graph or road network with $n$ nodes and $k$ centers, the problem can be solved in $O(n\sqrt{n}\log n)$ time, which improves upon the $O(nk)$ runtime of using the classic Gale-Shapley stable matching algorithm when $k$ is large. Finally, we provide experimental results on road networks for these algorithms and a heuristic algorithm that performs better than the Gale-Shapley algorithm for any range of values of $k$.Comment: 9 pages, 4 figures, to appear in 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (ACM SIGSPATIAL 2017) November 7-10, 2017, Redondo Beach, California, US