Separation of Circulating Tokens

Self-stabilizing distributed control is often modeled by token abstractions. A system with a single token may implement mutual exclusion; a system with multiple tokens may ensure that immediate neighbors do not simultaneously enjoy a privilege. For a cyber-physical system, tokens may represent physical objects whose movement is controlled. The problem studied in this paper is to ensure that a synchronous system with m circulating tokens has at least d distance between tokens. This problem is first considered in a ring where d is given whilst m and the ring size n are unknown. The protocol solving this problem can be uniform, with all processes running the same program, or it can be non-uniform, with some processes acting only as token relays. The protocol for this first problem is simple, and can be expressed with Petri net formalism. A second problem is to maximize d when m is given, and n is unknown. For the second problem, the paper presents a non-uniform protocol with a single corrective process.Comment: 22 pages, 7 figures, epsf and pstricks in LaTe

ARBEx: Attentive Feature Extraction with Reliability Balancing for Robust Facial Expression Learning

In this paper, we introduce a framework ARBEx, a novel attentive feature extraction framework driven by Vision Transformer with reliability balancing to cope against poor class distributions, bias, and uncertainty in the facial expression learning (FEL) task. We reinforce several data pre-processing and refinement methods along with a window-based cross-attention ViT to squeeze the best of the data. We also employ learnable anchor points in the embedding space with label distributions and multi-head self-attention mechanism to optimize performance against weak predictions with reliability balancing, which is a strategy that leverages anchor points, attention scores, and confidence values to enhance the resilience of label predictions. To ensure correct label classification and improve the models' discriminative power, we introduce anchor loss, which encourages large margins between anchor points. Additionally, the multi-head self-attention mechanism, which is also trainable, plays an integral role in identifying accurate labels. This approach provides critical elements for improving the reliability of predictions and has a substantial positive effect on final prediction capabilities. Our adaptive model can be integrated with any deep neural network to forestall challenges in various recognition tasks. Our strategy outperforms current state-of-the-art methodologies, according to extensive experiments conducted in a variety of contexts.Comment: 10 pages, 7 figures. Code: https://github.com/takihasan/ARBE

Communication Patterns for Randomized Algorithms

Examples of large scale networks include the Internet, peer-to-peer networks, parallel computing systems, cloud computing systems, sensor networks, and social networks. Efficient dissemination of information in large networks such as these is a funda- mental problem. In many scenarios the gathering of information by a centralised controller can be impractical. When designing and analysing distributed algorithms we must consider the limitations imposed by the heterogeneity of devices in the networks. Devices may have limited computational ability or space. This makes randomised algorithms attractive solutions. Randomised algorithms can often be simpler and easier to implement than their deterministic counterparts. This thesis analyses the effect of communication patterns on the performance of distributed randomised algorithms. We study randomized algorithms with application to three different areas. Firstly, we study a generalization of the balls-into-bins game. Balls into bins games have been used to analyse randomised load balancing. Under the Greedy[d] allocation scheme each ball queries the load of d random bins and is then allocated to the least loaded of them. We consider an infinite, parallel setting where expectedly λn balls are allocated in parallel according to the Greedy[d] allocation scheme in to n bins and subsequently each non-empty bin removes a ball. Our results show that for d = 1,2, the Greedy[d] allocation scheme is self-stabilizing and that in any round the maximum system load for high arrival rates is exponentially smaller for d = 2 compared to d = 1 (w.h.p). Secondly, we introduce protocols that solve the plurality consensus problem on arbitrary graphs for arbitrarily small bias. Typically, protocols depend heavily on the employed communication mechanism. Our protocols are based on an interest- ing relationship between plurality consensus and distributed load balancing. This relationship allows us to design protocols that are both time and space efficient and generalize the state of the art for a large range of problem parameters. Finally, we investigate the effect of restricting the communication of the classical PULL algorithm for randomised rumour spreading. Rumour spreading (broadcast) is a fundamental task in distributed computing. Under the classical PULL algo- rithm, a node with the rumour that receives multiple requests is able to respond to all of them in a given round. Our model restricts nodes such that they can re- spond to at most one request per round. Our results show that the restricted PULL algorithm is optimal for several graph classes such as complete graphs, expanders, random graphs and several Cayley graphs

Affective modulation of cognitive control is determined by performance-contingency and mediated by ventromedial prefrontal and cingulate cortex

Cognitive control requires a fine balance between stability, the protection of an on-going task-set, and flexibility, the ability to update a task-set in line with changing contingencies. It is thought that emotional processing modulates this balance, but results have been equivocal regarding the direction of this modulation. Here, we tested the hypothesis that a crucial determinant of this modulation is whether affective stimuli represent performance-contingent or task-irrelevant signals. Combining functional magnetic resonance imaging with a conflict task-switching paradigm, we contrasted the effects of presenting negative- and positive-valence pictures on the stability/flexibility trade-off in humans, depending on whether picture presentation was contingent on behavioral performance. Both the behavioral and neural expressions of cognitive control were modulated by stimulus valence and performance contingency: in the performance-contingent condition, cognitive flexibility was enhanced following positive pictures, whereas in the nonperformance-contingent condition, positive stimuli promoted cognitive stability. The imaging data showed that, as anticipated, the stability/flexibility trade-off per se was reflected in differential recruitment of dorsolateral frontoparietal and striatal regions. In contrast, the affective modulation of stability/flexibility shifts was mirrored, unexpectedly, by neural responses in ventromedial prefrontal and posterior cingulate cortices, core nodes of the “default mode” network. Our results demonstrate that the affective modulation of cognitive control depends on the performance contingency of the affect-inducing stimuli, and they document medial default mode regions to mediate the flexibility-promoting effects of performance-contingent positive affect, thus extending recent work that recasts these regions as serving a key role in on-task control processes

Fast Discrete Consensus Based on Gossip for Makespan Minimization in Networked Systems

In this paper we propose a novel algorithm to solve the discrete consensus problem, i.e., the problem of distributing evenly a set of tokens of arbitrary weight among the nodes of a networked system. Tokens are tasks to be executed by the nodes and the proposed distributed algorithm minimizes monotonically the makespan of the assigned tasks. The algorithm is based on gossip-like asynchronous local interactions between the nodes. The convergence time of the proposed algorithm is superior with respect to the state of the art of discrete and quantized consensus by at least a factor O(n) in both theoretical and empirical comparisons

Nonlinear modeling of FES-supported standing-up in paraplegia for selection of feedback sensors

This paper presents analysis of the standing-up manoeuvre in paraplegia considering the body supportive forces as a potential feedback source in functional electrical stimulation (FES)-assisted standing-up. The analysis investigates the significance of arm, feet, and seat reaction signals to the human body center-of-mass (COM) trajectory reconstruction. The standing-up behavior of eight paraplegic subjects was analyzed, measuring the motion kinematics and reaction forces to provide the data for modeling. Two nonlinear empirical modeling methods are implemented-Gaussian process (GP) priors and multilayer perceptron artificial neural networks (ANN)-and their performance in vertical and horizontal COM component reconstruction is compared. As the input, ten sensory configurations that incorporated different number of sensors were evaluated trading off the modeling performance for variables chosen and ease-of-use in everyday application. For the purpose of evaluation, the root-mean-square difference was calculated between the model output and the kinematics-based COM trajectory. Results show that the force feedback in COM assessment in FES assisted standing-up is comparable alternative to the kinematics measurement systems. It was demonstrated that the GP provided better modeling performance, at higher computational cost. Moreover, on the basis of averaged results, the use of a sensory system incorporating a six-dimensional handle force sensor and an instrumented foot insole is recommended. The configuration is practical for realization and with the GP model achieves an average accuracy of COM estimation 16 /spl plusmn/ 1.8 mm in horizontal and 39 /spl plusmn/ 3.7 mm in vertical direction. Some other configurations analyzed in the study exhibit better modeling accuracy, but are less practical for everyday usage

Review of energy system flexibility measures to enable high levels of variable renewable electricity

The paper reviews different approaches, technologies, and strategies to manage large-scale schemes of variable renewable electricity such as solar and wind power. We consider both supply and demand side measures. In addition to presenting energy system flexibility measures, their importance to renewable electricity is discussed. The flexibility measures available range from traditional ones such as grid extension or pumped hydro storage to more advanced strategies such as demand side management and demand side linked approaches, e.g. the use of electric vehicles for storing excess electricity, but also providing grid support services. Advanced batteries may offer new solutions in the future, though the high costs associated with batteries may restrict their use to smaller scale applications. Different “P2Y”-type of strategies, where P stands for surplus renewable power and Y for the energy form or energy service to which this excess in converted to, e.g. thermal energy, hydrogen, gas or mobility are receiving much attention as potential flexibility solutions, making use of the energy system as a whole. To “functionalize” or to assess the value of the various energy system flexibility measures, these need often be put into an electricity/energy market or utility service context. Summarizing, the outlook for managing large amounts of RE power in terms of options available seems to be promising.Peer reviewe

Part 3: Systemic risk in ecology and engineering

The Federal Reserve Bank of New York released a report -- New Directions for Understanding Systemic Risk -- that presents key findings from a cross-disciplinary conference that it cosponsored in May 2006 with the National Academy of Sciences' Board on Mathematical Sciences and Their Applications. ; The pace of financial innovation over the past decade has increased the complexity and interconnectedness of the financial system. This development is important to central banks, such as the Federal Reserve, because of their traditional role in addressing systemic risks to the financial system. ; To encourage innovative thinking about systemic issues, the New York Fed partnered with the National Academy of Sciences to bring together more than 100 experts on systemic risk from 22 countries to compare cross-disciplinary perspectives on monitoring, addressing and preventing this type of risk. ; This report, released as part of the Bank's Economic Policy Review series, outlines some of the key points concerning systemic risk made by the various disciplines represented - including economic research, ecology, physics and engineering - as well as presentations on market-oriented models of financial crises, and systemic risk in the payments system and the interbank funds market. The report concludes with observations gathered from the sessions and a discussion of potential applications to policy. ; The three papers presented in this conference session highlighted the positive feedback effects that produce herdlike behavior in markets, and the subsequent discussion focused in part on means of encouraging heterogeneous investment strategies to counter such behavior. Participants in the session also discussed the types of models used to study systemic risk and commented on the challenges and trade-offs researchers face in developing their models.Financial risk management ; Financial markets ; Financial stability ; Financial crises

ABSTRACTS OF SELECTED PAPERS

Teaching/Communication/Extension/Profession,