ART: A Data Aggregation Program for the Behavioral Sciences

Today, many experiments in the field of behavioral sciences are conducted using a computer. While there is a broad choice of computer programs facilitating the process of conducting experiments as well as programs for statistical analysis there are relatively few programs facilitating the intermediate step of data aggregation. ART has been developed in order to fill this gap and to provide a computer program for data aggregation that has a graphical user interface such that aggregation can be done more easily and without any programming. All “rules” that are necessary to extract variables can be seen “at a glance” which helps the user to conduct even complex aggregations with several hundreds of variables and makes aggregation more resistant against errors. ART runs with Windows XP, Vista, 7, and 8 and it is free. Copies (executable and source code) are available at http://www.psychologie.hhu.de/arbeitsgruppen/allgemeinepsychologie-und-arbeitspsychologie/art.html

On absolute Galois splitting fields of central simple algebras

A splitting field of a central simple algebra is said to be absolute Galois if it is Galois over some fixed subfield of the centre of the algebra. The paper provides an existence theorem for such fields over global fields with enough roots of unity. As an application, all twisted function fields and all twisted Laurent series rings over symbol algebras (or p-algebras) over global fields are crossed products. A closely related statement holds for division algebras over Henselian valued fields with global residue field. The existence of absolute Galois splitting fields in central simple algebras over global fields is equivalent to a suitable generalization of the weak Grunwald-Wang Theorem, which is proved to hold if enough roots of unity are present. In general, it does not hold and counter examples have been used in noncrossed product constructions. This paper shows in particular that a certain computational difficulty involved in the construction of explicit examples of noncrossed product twisted Laurent series rings can not be avoided by starting the construction with a symbol algebra.Comment: 12 pages (A4); to appear in J. Number Theory (2007

The Treasury bill futures market and market expectations of interest rates

Interest rates ; Treasury bills

Introduction: The Politics of International Political Theory

The introductory chapter situates Chris Brown’s work in relation to wider themes in International Political Theory (IPT). It provides some context to Brown’s development as a scholar, looking to the ways in which his ideas emerged in relation to different debates and ideas in both political theory and international relations. It first provides a brief intellectual biography and then explores the idea of IPT through an engagement with three books through which Brown has defined the field. The following sections of the introduction look at Brown’s engagement with the predominant liberal international order and the theme of political judgement.Postprin

Systems Analysis & Design: An Essential Part of IS Education

Systems analysis and design has been as critical building block in Information Systems (IS) education since the inception of the IS major. Whether it is taught using the traditional or structured approach or the object-oriented approach, it exposes students to the different methods, tools, and techniques used in developing new systems, develops students analytical and problem-solving skills, teaches fact-finding and data gathering techniques, and provides teamwork skills. All of these are valuable skills for systems analysts. This paper introduces the reader of this special issue on systems analysis and design education to the issue, discusses the two approaches to teaching systems analysis and design, and ways that it is taught in the various curricula

Incorporating Ethics and Social Responsibility in IS Education

This paper discusses the importance of ethics and social responsibility in information systems (IS) education. The many public scandals of corporate misconduct have increased the need for more emphasis to be placed on ethics and ethical issues in IS education. The authors describe how the inclusion of ethics and social responsibility in the IS curriculum enhances IS education and discuss the core issues to be addressed, including: professional conduct, privacy, intellectual property, cybercrime, impact on humans, freedom of speech, and “Green” computing issues. The authors also introduce the papers presented in this special issue and challenge IS educators to increase their emphasis on ethics and social responsibility in their classes

F as in Fat: How Obesity Threatens America’s Future 2012

https://www.rwjf.org/content/dam/farm/reports/reports/2012/rwjf40131

Exactly solvable scale-free network model

We study a deterministic scale-free network recently proposed by Barab\'{a}si, Ravasz and Vicsek. We find that there are two types of nodes: the hub and rim nodes, which form a bipartite structure of the network. We first derive the exact numbers $P(k)$ of nodes with degree $k$ for the hub and rim nodes in each generation of the network, respectively. Using this, we obtain the exact exponents of the distribution function $P(k)$ of nodes with $k$ degree in the asymptotic limit of $k \to \infty$. We show that the degree distribution for the hub nodes exhibits the scale-free nature, $P(k) \propto k^{-\gamma}$ with $\gamma = \ln3/\ln2 = 1.584962$, while the degree distribution for the rim nodes is given by $P(k) \propto e^{-\gamma'k}$ with $\gamma' = \ln(3/2) = 0.405465$. Second, we numerically as well as analytically calculate the spectra of the adjacency matrix $A$ for representing topology of the network. We also analytically obtain the exact number of degeneracy at each eigenvalue in the network. The density of states (i.e., the distribution function of eigenvalues) exhibits the fractal nature with respect to the degeneracy. Third, we study the mathematical structure of the determinant of the eigenequation for the adjacency matrix. Fourth, we study hidden symmetry, zero modes and its index theorem in the deterministic scale-free network. Finally, we study the nature of the maximum eigenvalue in the spectrum of the deterministic scale-free network. We will prove several theorems for it, using some mathematical theorems. Thus, we show that most of all important quantities in the network theory can be analytically obtained in the deterministic scale-free network model of Barab\'{a}si, Ravasz and Vicsek. Therefore, we may call this network model the exactly solvable scale-free network.Comment: 18 pages, 5 figure