33,790 research outputs found
Establishing Bilateral Trade Agreement Without Mutual Diplomatic Relations: The Case of the Republic of China on Taiwan
Extreme Candidates as the Beneficent Spoiler? Range Effect in the Plurality Voting System
How does the entrance of radical candidates influence election results? Conventional wisdom suggests that extreme candidates merely split the votes. Based on the range effect theory in cognitive psychology, we hypothesize that the entrance of an extreme candidate reframes the endpoints of the ideological spectrum among available candidates, which makes the moderate one on the same side to be perceived by the voters as even more moderate. Through two survey experiments in the United States and Taiwan, we provide empirical support for range effect in the vote choice in the plurality system. The results imply that a mainstream party can, even without changing its own manifesto, benefit from the entrance of its radical counterpart; it explains why the mainstream party may choose cooperation strategically. Our findings also challenge the assumption in regression models that the perceived ideological positions of candidates are independent of each other
Register automata with linear arithmetic
We propose a novel automata model over the alphabet of rational numbers,
which we call register automata over the rationals (RA-Q). It reads a sequence
of rational numbers and outputs another rational number. RA-Q is an extension
of the well-known register automata (RA) over infinite alphabets, which are
finite automata equipped with a finite number of registers/variables for
storing values. Like in the standard RA, the RA-Q model allows both equality
and ordering tests between values. It, moreover, allows to perform linear
arithmetic between certain variables. The model is quite expressive: in
addition to the standard RA, it also generalizes other well-known models such
as affine programs and arithmetic circuits.
The main feature of RA-Q is that despite the use of linear arithmetic, the
so-called invariant problem---a generalization of the standard non-emptiness
problem---is decidable. We also investigate other natural decision problems,
namely, commutativity, equivalence, and reachability. For deterministic RA-Q,
commutativity and equivalence are polynomial-time inter-reducible with the
invariant problem
A Finite Exact Representation of Register Automata Configurations
A register automaton is a finite automaton with finitely many registers
ranging from an infinite alphabet. Since the valuations of registers are
infinite, there are infinitely many configurations. We describe a technique to
classify infinite register automata configurations into finitely many exact
representative configurations. Using the finitary representation, we give an
algorithm solving the reachability problem for register automata. We moreover
define a computation tree logic for register automata and solve its model
checking problem.Comment: In Proceedings INFINITY 2013, arXiv:1402.661
Design of a large dynamic range readout unit for the PSD detector of DAMPE
A large dynamic range is required by the Plastic Scintillator Detector (PSD)
of DArk Matter Paricle Explorer (DAMPE), and a double-dynode readout has been
developed. To verify this design, a prototype detector module has been
constructed and tested with cosmic rays and heavy ion beams. The results match
with the estimation and the readout unit could easily cover the required
dynamic range
- …