Why Users Share the News: A Theory of Reasoned Action-Based Study on the Antecedents of News-Sharing Behavior

Social media have become an integral part of online news use, affecting how individuals find, consume, and share news. By applying the Theory of Reasoned Action (TRA), this study investigates the effects of motives, attitude, and intention on news-sharing behavior among German social media users (n = 333). Findings show that news-sharing attitude and subjective norms have a positive effect on news-sharing intention, which in turn has a positive effect on actual news-sharing behavior. Taken together, we see that a new media behavior in the early phases of its societal diffusion—like social media news sharing in Germany in 2015—can mainly be explained by a rational choice logic and is rooted in the motives of socializing and information seeking. This finding thus reflects the double nature of social media as a means for both information retrieval and social grooming.     

The graph-theoretic field model— II. application of multi-terminal representations to field problems

This paper is a sequel to a paper entitled “The Graph-Theoretic Field Model—I: Modelling and Formulations” (1). Herein, the Theory of Multi-Terminal Representations is applied to the Graph-Theoretic Field Model to provide mathematical models of finite elements. The element models are obtained solely from the algebraic building blocks of the Graph-Theoretic Field Model, without recourse to any functional mathematics. The theory of Multi-Terminal Representations is developed for both linear and non-linear problems. Examples of the application of the theory to one- and two-dimensional field problems are presented from heat conduction and electrostatics.     

The graph-theoretic field model—I. Modelling and formulations

The Graph-Theoretical Field Model provides a unifying approach for developing numerical models of field and continuum problems. The methodology examines the field problem from the first stages of conceptualization without recourse to the governing differential equations of the field problem; this is accomplished by deriving discrete statements of the physical laws which govern the field behaviour. There are generally three laws, and these are modelled by the “cutset equations”, the “circuit equations”, and the “terminal equations”. In order to establish these three sets of equations it is expedient first to spatially discretize the field in a manner similar to the finite difference method and then to associate a linear graph (denoted as the field graph) with the spatial discretization. The concept of “through” and “across” variables, which underlies the cutset and circuit equations respectively, enables one to define the graph in an unambiguous manner such that each “edge” of the graph identifies a pair of complementary variables. From a knowledge of the constitutive properties and the boundary conditions of the field it is possible to associate terminal equations with sets of edges. Since the resulting sets of equations represent the field equations, these equations provide the basis for a complete (but approximate) solution to the field or continuum problem. In fact, this system approach uses a two part model: one for the components and another for the interconnection pattern of the components which renders the formulation procedures totally independent of the solution procedure.This paper presents the theoretical basis of the model and several graph-theoretic formulations for steady-state problems. Examples from heat conduction and small- deformation elasticity are included.     

The DT-Polynomial Approach to Discrete Time-Varying Network Flow Problems

This paper introduces a polynomial operator called the DT-polynomial as a novel approach to network flow problems. The class of networks dealt with is time-varying in the sense that the capacity, cost, and travel-time of each edge may vary in discrete time. The Dt-polynomial is a polynomial in two operators, D (delay) and T (time), which is used for describing the time-varying transmission characteristics. The paper starts with the mathematics involving the DT-polynomials. A new shortest arrival route algorithm is presented, and its computational complexity is found to be favorable in comparison with others such as Dijkstra's method and the potential method derived from Ford-Fulkerson's technique. Furthermore, a dynamic flow problem is formulated and analyzed in terms of DT-polynomials, and a latest-departure earliest-arrival schedule is given. Finally, a modified DT-polynomial is applied to digital filter networks.