Entrograms and coarse graining of dynamics on complex networks

Using an information theoretic point of view, we investigate how a dynamics acting on a network can be coarse grained through the use of graph partitions. Specifically, we are interested in how aggregating the state space of a Markov process according to a partition impacts on the thus obtained lower-dimensional dynamics. We highlight that for a dynamics on a particular graph there may be multiple coarse grained descriptions that capture different, incomparable features of the original process. For instance, a coarse graining induced by one partition may be commensurate with a time-scale separation in the dynamics, while another coarse graining may correspond to a different lower-dimensional dynamics that preserves the Markov property of the original process. Taking inspiration from the literature of Computational Mechanics, we find that a convenient tool to summarise and visualise such dynamical properties of a coarse grained model (partition) is the entrogram. The entrogram gathers certain information-theoretic measures, which quantify how information flows across time steps. These information theoretic quantities include the entropy rate, as well as a measure for the memory contained in the process, i.e., how well the dynamics can be approximated by a first order Markov process. We use the entrogram to investigate how specific macro-scale connection patterns in the state-space transition graph of the original dynamics result in desirable properties of coarse grained descriptions. We thereby provide a fresh perspective on the interplay between structure and dynamics in networks, and the process of partitioning from an information theoretic perspective. We focus on networks that may be approximated by both a core-periphery or a clustered organization, and highlight that each of these coarse grained descriptions can capture different aspects of a Markov process acting on the network.Comment: 17 pages, 6 figue

Underreporting Chargeable Time: A Continuing Problem for Public Accounting Firms

Prior research shows that underreporting chargeable time has been a concern for public accounting firms even though many of these firms have policies and procedures that prohibit eating time. The purpose of this study is to examine the current state of this problem and to provide recommendations to manage the problem more effectively. Practicing public accountants at all professional levels were surveyed to determine the extent, opportunity, ethical perception and perceived benefits of underreporting time. The results show that although the majority of the respondents believe underreporting time is unethical, the majority of them did not report all of their chargeable hours in the prior year. The main reasons for such behavior stem from the desire to: (1) receive better periodic performance evaluations, (2) be viewed as competent by superiors and (3) receive promotions

Retroactive Anti-Jamming for MISO Broadcast Channels

Jamming attacks can significantly impact the performance of wireless communication systems. In addition to reducing the capacity, such attacks may lead to insurmountable overhead in terms of re-transmissions and increased power consumption. In this paper, we consider the multiple-input single-output (MISO) broadcast channel (BC) in the presence of a jamming attack in which a subset of the receivers can be jammed at any given time. Further, countermeasures for mitigating the effects of such jamming attacks are presented. The effectiveness of these anti-jamming countermeasures is quantified in terms of the degrees-of-freedom (DoF) of the MISO BC under various assumptions regarding the availability of the channel state information (CSIT) and the jammer state information at the transmitter (JSIT). The main contribution of this paper is the characterization of the DoF region of the two user MISO BC under various assumptions on the availability of CSIT and JSIT. Partial extensions to the multi-user broadcast channels are also presented.Comment: submitted to IEEE Transactions on Information Theor

The stability of a graph partition: A dynamics-based framework for community detection

Recent years have seen a surge of interest in the analysis of complex networks, facilitated by the availability of relational data and the increasingly powerful computational resources that can be employed for their analysis. Naturally, the study of real-world systems leads to highly complex networks and a current challenge is to extract intelligible, simplified descriptions from the network in terms of relevant subgraphs, which can provide insight into the structure and function of the overall system. Sparked by seminal work by Newman and Girvan, an interesting line of research has been devoted to investigating modular community structure in networks, revitalising the classic problem of graph partitioning. However, modular or community structure in networks has notoriously evaded rigorous definition. The most accepted notion of community is perhaps that of a group of elements which exhibit a stronger level of interaction within themselves than with the elements outside the community. This concept has resulted in a plethora of computational methods and heuristics for community detection. Nevertheless a firm theoretical understanding of most of these methods, in terms of how they operate and what they are supposed to detect, is still lacking to date. Here, we will develop a dynamical perspective towards community detection enabling us to define a measure named the stability of a graph partition. It will be shown that a number of previously ad-hoc defined heuristics for community detection can be seen as particular cases of our method providing us with a dynamic reinterpretation of those measures. Our dynamics-based approach thus serves as a unifying framework to gain a deeper understanding of different aspects and problems associated with community detection and allows us to propose new dynamically-inspired criteria for community structure.Comment: 3 figures; published as book chapte

An evaluation of higher-order model methods for calculating transient structural response

A higher-order modal method proposed by Leung for transient structural analysis entitled the force-derivative method is evaluated. This method repeatedly integrates by parts with respect to time the convolution-integral form of the structural response to produce successively better approximations to the contribution of the higher modes which are neglected in the modal summation. Comparisons are made of the force-derivative, the mode-displacement, and the mode-acceleration methods for several numerical example problems for various times, levels of damping, and forcing functions. The example problems include a tip-loaded cantilevered beam and a simply-supported multispan beam. The force-derivative method is shown to converge to an accurate solution in fewer modes than either the mode-displacement or the mode-acceleration methods. In addition, for problems in which there are a large number of closely-spaced frequencies whose mode shapes have a negligible contribution to the response, the force-derivative method is very effective in representing the effect of the important, but otherwise neglected, higher modes

Kinematics and control algorithm development and simulation for a redundant two-arm robotic manipulator system

An efficient approach to cartesian motion and force control of a 7 degree of freedom (DOF) manipulator is presented. It is based on extending the active stiffness controller to the 7 DOF case in general and use of an efficient version of the gradient projection technique for solving the inverse kinematics problem. Cooperative control is achieved through appropriate configuration of individual manipulator controllers. In addition, other aspects of trajectory generation using standard techniques are integrated into the controller. The method is then applied to a specific manipulator of interest (Robotics Research T-710). Simulation of the kinematics, dynamics, and control are provided in the context of several scenarios: one pertaining to a noncontact pick and place operation; one relating to contour following where contact is made between the manipulator and environment; and one pertaining to cooperative control