Is there Still a PR Problem Online? Exploring the Effects of Different Sources and Crisis Response Strategies in Online Crisis Communication Via Social Media

This study examined the effects of source and crisis response strategy on crisis communication outcomes in the context of social media. A 3 (source: organization, CEO, or customer) × 2 (strategy: accommodative or defensive) × 2 (crisis type: airline crash or bank hacking) mixed experimental study was conducted with 391 participants. The organizational sources were more likely to be perceived as more credible than the non-organizational sources. In particular, the CEO appeared to be the most trustworthy and credible source in delivering crisis messages. The path analysis indicated that perceived source credibility mediated the effect of source on reputation and behavioral intentions. This mediation appeared to be contingent on the type of crisis response strategy

Investigation on the Tachyonic Neutrino

According to the experimental data, it is still controversial whether the neutrinos, especially the electron-neutrino and muon-neutrino, can be considered as the fermionic spinorial tachyons, and there is still no reliable report on the existence of the right-handed neutrinos. In this letter, we show that the neutrinos with the single handedness can not be the tachyons, but only those of the both handedness can be. Several implications of this result are discussed.Comment: 13 pages, latex, no figure

Iteratively Reweighted Least Squares Algorithms for L1-Norm Principal Component Analysis

Principal component analysis (PCA) is often used to reduce the dimension of data by selecting a few orthonormal vectors that explain most of the variance structure of the data. L1 PCA uses the L1 norm to measure error, whereas the conventional PCA uses the L2 norm. For the L1 PCA problem minimizing the fitting error of the reconstructed data, we propose an exact reweighted and an approximate algorithm based on iteratively reweighted least squares. We provide convergence analyses, and compare their performance against benchmark algorithms in the literature. The computational experiment shows that the proposed algorithms consistently perform best

Towards Interactive Logic Programming

Linear logic programming uses provability as the basis for computation. In the operational semantics based on provability, executing the additive-conjunctive goal $G_1 \& G_2$ from a program $P$ simply terminates with a success if both $G_1$ and $G_2$ are solvable from $P$. This is an unsatisfactory situation, as a central action of \& -- the action of choosing either $G_1$ or $G_2$ by the user -- is missing in this semantics. We propose to modify the operational semantics above to allow for more active participation from the user. We illustrate our idea via muProlog, an extension of Prolog with additive goals.Comment: 8 pages. It describes two execution models for interactive logic programmin