A rigorous comparison of the Ewald method and the fast multipole method in two dimensions

The most efficient and proper standard method for simulating charged or dipolar systems is the Ewald method, which asymptotically scales as where N is the number of charges. However, recently the “fast multipole method” (FMM) which scales linearly with N has been developed. The break-even of the two methods (that is, the value of N below which Ewald is faster and above which FMM is faster) is very sensitive to the way the methods are optimized and implemented and to the required simulation accuracy.In this paper we use theoretical estimates and simulation results for the accuracies to carefully compare the two methods with respect to speed. We have developed and implemented highly efficient algorithms for both methods for a serial computer (a SPARCstation ELC) as well as a parallel computer (a T800 transputer based MEIKO computer). Breakevens in the range between N = 10 000 and N = 30 000 were found for reasonable values of the average accuracies found in our simulations. Furthermore, we illustrate how huge but rare single charge pair errors in the FMM inflate the error for some of the charges.     

GOST 34.10—A brief overview of Russia's DSA

GOST 34.10 is Russia's DSA. Like its US counterpart, GOST is an ElGamal-like signature scheme used in Schnorr mode. It is similar to NIST DSA in many aspects. In this paper we will overview GOST 34.10 and discuss the three main differences between the two algorithms, (i) GOST's principal design criterion does not seem to be computational efficiency: the algorithm is 1.6 times slower than the DSA and produces 512-bit signatures. This is mainly due to the usage of the modulus q which is at least 254 bits long. During verification, modular inverses are computed by exponentiation (while the Extended Euclidian algorithm is roughly 100 times faster for this parameter size) and the generation of the public parameters is much more complicated than in the DSA. This choice of the parameters makes GOST 34.10 very secure. (ii) GOST signers do not have to generate modular inverses as the basic signature equation is s = xr + mk (mod q) instead of (mod q). (iii) GOST's hash function (the Russian equivalent of the SHA) is the standard GOST 34.11 which uses the block cipher GOST 28147 (partially classified) as a building block. The hash function will be briefly described. Copyright     

Problematic Demography: Representations of Population Ageing in the Swedish Daily Press

The ageing of populations has been a topic of discussion during the last few decades, but how is this subject represented in the media, and what images of old age are produced? In this article we present the results of a quantitative content analysis that investigates how the concept of population ageing has been represented in Swedish local and national daily news press between 1988 and 2009, and the old age positions that are offered in these representations. We also use discourse analysis in order to qualitatively examine the ways in which the concept of population ageing is articulated in these news press articles and the old age positions that are thereby constituted. The results show that the concept is constituted as a naturalised expert concept, and is primarily used in order to contextualise articles about future political and economical difficulties or even crises. By articulating population ageing with both political policies, political economy and older people??s (as a group) reported need for care and services, population ageing was constituted as a political economic concern rather than a problem for the aged individual.     

Hierarchical vibrations for part-based recognition of complex objects

We propose a technique for the recognition and segmentation of complex shapes in 2D images using a hierarchy of finite element vibration modes in an evolutionary shape search. The different levels of the shape hierarchy can influence each other, which can be exploited in top-down part-based image analysis. Our method overcomes drawbacks of existing structural approaches, which cannot uniformly encode shape variation and co-variation, or rely on training. We present results demonstrating that by utilizing a quality-of-fit function the model explicitly recognizes missing parts of a complex shape, thus allowing for categorization between shape classes.     

Insights from Dividing 3D Goal-Directed Movements into Meaningful Phases

Existing measures for evaluating user performance on interaction tasks in virtual environments don't often provide sufficient information for improving these interactions. A new method for analyzing 3D goal-directed movements divides them into meaningful phases. The authors applied this method to experimental data collected for a 3D task resembling a standardized 2D multidirectional pointing task (ISO 9241-9). The results and analysis demonstrate that the method provides a more detailed insight into 3D goal-directed movements. This analysis can help researchers better identify input devices' and interaction techniques' strengths and weaknesses. This article is part of a special issue on 3D user interfaces.     

Range mode and range median queries in constant time and sub-quadratic space

Given a list of n items and a function defined over sub-lists, we study the space required for computing the function for arbitrary sub-lists in constant time.For the function mode we improve the previously known space bound O(n²/logn) to O(n²loglogn/log²n) words.For median the space bound is improved to O(n²loglog²n/log²n) words from O(n²⋅log(k)n/logn), where k is an arbitrary constant and log(k) is the iterated logarithm.     

Nonlinear robust state feedback control system design for nonlinear uncertain systems

This paper presents a systematic approach to the design of a nonlinear robust dynamic state feedback controller for nonlinear uncertain systems using copies of the plant nonlinearities. The technique is based on the use of integral quadratic constraints and minimax linear quadratic regulator control, and uses a structured uncertainty representation. The approach combines a linear state feedback guaranteed cost controller and copies of the plant nonlinearities to form a robust nonlinear controller with a novel control architecture. A nonlinear state feedback controller is designed for a synchronous machine using the proposed method. The design provides improved stability and transient response in the presence of uncertainty and nonlinearity in the system and also provides a guaranteed bound on the cost function. An automatic voltage regulator to track reference terminal voltage is also provided by a state feedback equivalent robust nonlinear proportional integral controller. Copyright © 2016 John Wiley & Sons, Ltd.     

A Kleene–Schützenberger theorem for weighted timed automata

During the last years, weighted timed automata have received much interest in the real-time community. Weighted timed automata form an extension of timed automata and allow us to assign weights (costs) to both locations and edges. This model, introduced by Alur et al. (2001) and Behrmann et al. (2001), permits the treatment of continuous consumption of resources and has led to much research on scheduling problems, optimal reachability and model checking. Also, several authors have derived Kleene-type characterizations of (unweighted) timed automata and their accepted timed languages. The goal of this paper is to provide a characterization of the behaviours of weighted timed automata by rational power series. We define weighted timed automata with weights taken in an arbitrary semiring, resulting in a model that subsumes several weighted timed automata concepts of the literature. For our main result, we combine the methods of Schützenberger, a recent approach for a Kleene-type theorem for unweighted timed automata by Bouyer and Petit as well as new techniques. Our main result also implies Kleene-type theorems for several subclasses of weighted timed automata investigated before, e.g., for timed automata and timed automata with stopwatch observers.     

Proteomic studies in animal models of diabetes

The aim of this review is to provide an overview of proteomic studies in animal models of diabetes and to give some insight into the different methods available today in the rapidly developing field of proteomics. A summary of 31 papers published between 1997 and 2007 is presented. For instance, proteomics has been used to study the development of both type 1 and type 2 diabetes, diabetic complications in tissues like heart, kidney and retina and changes after treatment with anti-diabetic drugs like peroxisome proliferator-activated receptors agonists. Together, these studies give a good overview of a number of experimental approaches. Proteomics holds the promise of providing major contributions to the field of diabetes research. However, to achieve this, a number of issues need to be resolved. Appropriate data representation to facilitate data comparison, exchange, and verification is required, as well as improved statistical assessment of proteomic experiments. In addition, it is important to follow up the results with functional studies to be able to make biologically relevant conclusions. The potential of proteomics to dissect complex human disorders is now beginning to be realized. In the future, this will result in new important information concerning diabetes.