Frontolimbic Response to Negative Feedback in Clinical Depression.

Functional neuroimaging suggests that limbic regions of the medial frontal cortex may be abnormally active in individuals with depression. These regions, including the anterior cingulate cortex, are engaged in both action regulation, such as monitoring errors and conflict, and affect regulation, such as responding to pain. The authors examined whether clinically depressed subjects would show abnormal sensitivity of frontolimbic networks as they evaluated negative feedback. Depressed subjects and matched control subjects performed a video game in the laboratory as a 256-channel EEG was recorded. Speed of performance on each trial was graded with a feedback signal of A, C, or F. By 350 ms after the feedback signal, depressed subjects showed a larger medial frontal negativity for all feedback compared with control subjects with a particularly striking response to the F grade. This response was strongest for moderately depressed subjects and was attenuated for subjects who were more severely depressed. Localization analyses suggested that negative feedback engaged sources in the anterior cingulate and insular cortices. These results suggest that moderate depression may sensitize limbic networks to respond strongly to aversive events. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

On enabling integrated process compliance with semantic constraints in process management systems

Key to broad use of process management systems (PrMS) in practice is their ability to foster and ease the implementation, execution, monitoring, and adaptation of business processes while still being able to ensure robust and error-free process enactment. To meet these demands a variety of mechanisms has been developed to prevent errors at the structural level (e.g., deadlocks). In many application domains, however, processes often have to comply with business level rules and policies (i.e., semantic constraints) as well. Hence, to ensure error-free executions at the semantic level, PrMS need certain control mechanisms for validating and ensuring the compliance with semantic constraints. In this paper, we discuss fundamental requirements for a comprehensive support of semantic constraints in PrMS. Moreover, we provide a survey on existing approaches and discuss to what extent they are able to meet the requirements and which challenges still have to be tackled. In order to tackle the particular challenge of providing integrated compliance support over the process lifecycle, we introduce the SeaFlows framework. The framework introduces a behavioural level view on processes which serves a conceptual process representation for constraint specification approaches. Further, it provides general compliance criteria for static compliance validation but also for dealing with process changes. Altogether, the SeaFlows framework can serve as formal basis for realizing integrated support of semantic constraints in PrMS.     

Peer-to-peer bichromatic reverse nearest neighbours in mobile ad-hoc networks

The increasing use of mobile communications has raised many issues of decision support and resource allocation. A crucial problem is how to solve queries of Reverse Nearest Neighbour (RNN). An RNN query returns all objects that consider the query object as their nearest neighbour. Existing methods mostly rely on a centralised base station. However, mobile P2P systems offer many benefits, including self-organisation, fault-tolerance and load-balancing. In this study, we propose and evaluate 3 distinct P2P algorithms focusing on bichromatic RNN queries, in which mobile query peers and static objects of interest are of two different categories, based on a time-out mechanism and a boundary polygon around the mobile query peers. The Brute-Force Search Algorithm provides a naive approach to exploit shared information among peers whereas two other Boundary Search Algorithms filter a number of peers involved in query processing. The algorithms are evaluated in the MiXiM simulation framework with both real and synthetic datasets. The results show the practical feasibility of the P2P approach for solving bichromatic RNN queries for mobile networks.     

Enhanced security in internet voting protocol using blind signature and dynamic ballots

In this paper, we introduce an internet voting protocol which satisfies desired security requirements of electronic voting. In the newly proposed protocol, we allow the adversaries to get more power than in any previous works. They can be coercers or vote buyers outside, and corrupted parties inside our system. These adversaries also have ability to collude with each other to ruin the whole system. Our main contribution is to design an internet voting protocol which is unsusceptible to most of sophisticated attacks. We employ the blind signature technique and the dynamic ballots instead of complex cryptographic techniques to preserve privacy in electronic voting. Moreover, we also aim at the practical system by improving the blind signature scheme and removing physical assumptions which have often been used in the previous works.     

A pure peer-to-peer approach for kNN query processing in mobile ad hoc networks

Together with advanced positioning and mobile technologies, P2P query processing has attracted a growing interest number of location-aware applications such as answering kNN queries in mobile ad hoc networks. It not only overcomes drawbacks of centralized systems, for example single point of failure and bottleneck issues, but more importantly harnesses power of peers’ collaboration. In this research, we propose a pure mobile P2P query processing scheme which primarily focuses on the search and validation algorithm for kNN queries. The proposed scheme is designed for pure mobile P2P environments with the absence of the base station support. Compared with centralized and hybrid systems, our system can reduce energy consumption more than six times by making use of data sharing from peers in a reasonable mean latency of processing time for networks with high density of moving objects as can be seen in the simulation results.     

Affordance-based robot object retrieval

Autonomous Robots - Natural language object retrieval is a highly useful yet challenging task for robots in human-centric environments. Previous work has primarily focused on commands specifying...     

A revised method for ranking fuzzy numbers using maximizing set and minimizing set

A large number of methods have been proposed for ranking fuzzy numbers in the last few decades. Nevertheless, none of these methods can always guarantee a consistent result for every situation. Some of them are even non-intuitive and not discriminating. Chen proposed a ranking method in 1985 to overcome these limitations and simplify the computational procedure based on the criteria of total utility through maximizing set and minimizing set. However, there were some shortcomings associated with Chen’s ranking method. Therefore, we propose a revised ranking method that can overcome these shortcomings. Instead of considering just a single left and a single right utility in the total utility, the proposed method considers two left and two right utilities. In addition, the proposed method also takes into account the decision maker’s optimistic attitude of fuzzy numbers. Several comparative examples and an application demonstrating the usage, advantages, and applicability of the revised ranking method are presented. It can be concluded that the revised ranking method can effectively resolve the issues with Chen’s ranking method. Moreover, the revised ranking method can be used to differentiate different types of fuzzy numbers.     

A fuzzy-based interleaved multi-hop authentication scheme in wireless sensor networks

In sensor networks, a compromised node can either generate fabricated reports with false votes or inject false votes into real reports, which causes severe damage such as false alarms, energy drain and information loss. An interleaved hop-by-hop authentication (IHA) scheme addresses the former attack by detecting and filtering false reports in a deterministic and hop-by-hop fashion. Unfortunately, in IHA, all en-route nodes must join to verify reports while only a few are necessary to the authentication procedure. In this paper, we propose a fuzzy-based interleaved multi-hop authentication scheme based on IHA. In our scheme, the fuzzy logic system only selects some nodes for verification based on the network characteristics. Moreover, we apply a voting method and a hash-based key assignment mechanism to improve network security. Through performance evaluation, the proposed scheme is found to save up to 13% of the energy consumption and to provide more network protection compared to IHA.