内源性注意与外源性注意神经机制的渐合假说

The relationship between exogenous attention and endogenous attention is still unclear. We conclude the result of previous studies and our experiments by proposing a convergence hypothesis. A lot of evidences from ERP and fMRI proved the distinction between exogenous and endogenous attention. The distinction is fit for the complicated surroundings. Some studies found that exogenous and endogenous attention activated some common brain areas but if there’s any common function in these areas was still unclear. Previous studies failed to disentangle the relationship between these two mechanisms in detail, and most of the previous studies compared these two mechanisms separately. We used the cue-target paradigm, controlled the SOA and the cue validity to separate endogenous and exogenous attention. We try to figure out the relationship between endogenous and exogenous attention. We found that, in the exogenous attention condition, the amplitude of the P1 component was larger and the amplitude of N1 was smaller than that in the invalid trials. In the endogenous attention condition, the amplitudes of the P1 and N1 components in valid trials were both larger than that in the invalid trials. The difference wave of endogenous and exogenous attentions showed that at the beginning of their process endogenous and exogenous attentions were separate and then the process was going to converge. The stimuli appear in the visual field will activate the “external trigger” in exogenous attention processing, and then the signal will be transferred to next stage, in the endogenous attention processing, when the observer want to attend, the “inner trigger” will be activated and the signal will be transfered. The difference between “external trigger” and “inner trigger” in endogenous and exogenous attention was significant, so the difference at the beginning of the process was significant. When the signal was transferred to the next processing stage, the difference between the endogenous and exogenous attention became diminished, and it was a convergence process. We used the cue-target paradigm, let the central cue and peripheral cue appear in one trial, try to investigate the relationship between endogenous and exogenous attention under different perceptual load conditions. The result from of difference wave showed that the relationship between the two attentions was consistent with the convergence hypothesis. We also found that under different perceptual load conditions, the relationship between endogenous and exogenous attention was different. The perceptual load has influence on the “external trigger” and “inner trigger”. A cue-target paradigm was used to investigate the relationship between attention, age and perceptual load, we found that the function of visual attention was decrease in the old group, they need more attentional resource when they face the issue. The aging effect has influence on the “external trigger” and “inner trigger”. The effects of age and perceptual load were much higher in exogenous attention condition.

External Examining: an Engineering Subject Centre guide.

This handbook was prepared for external examiners and for use in training workshops for newly appointed external examiners.

Dynamical Systems in the Sensorimotor Loop: On the Interrelation Between Internal and External Mechanisms of Evolved Robot Behavior

Huelse, M., Wischmann, S., Manoonpong, P., Twickel, A.v., Pasemann, F.: Dynamical Systems in the Sensorimotor Loop: On the Interrelation Between Internal and External Mechanisms of Evolved Robot Behavior. In: M. Lungarella, F. Iida, J. Bongard, R. Pfeifer (Eds.) 50 Years of Artificial Intelligence, LNCS 4850, Springer, 186 - 195, 2007.

A modified TRIMP to quantify the in-season training load of team sport players

Thatcher, Rhys, et al., 'A modified TRIMP to quantify the in-season training load of team sport players', Journal of Sport Sciences, (2007) 25(6) pp.629-634 RAE2008

Using Speculation to Reduce Server Load and Service Time on the WWW

Speculative service implies that a client's request for a document is serviced by sending, in addition to the document requested, a number of other documents (or pointers thereto) that the server speculates will be requested by the client in the near future. This speculation is based on statistical information that the server maintains for each document it serves. The notion of speculative service is analogous to prefetching, which is used to improve cache performance in distributed/parallel shared memory systems, with the exception that servers (not clients) control when and what to prefetch. Using trace simulations based on the logs of our departmental HTTP server http://cs-www.bu.edu, we show that both server load and service time could be reduced considerably, if speculative service is used. This is above and beyond what is currently achievable using client-side caching [3] and server-side dissemination [2]. We identify a number of parameters that could be used to fine-tune the level of speculation performed by the server.

Load Profiling in Distributed Real-Time Systems

Load balancing is often used to ensure that nodes in a distributed systems are equally loaded. In this paper, we show that for real-time systems, load balancing is not desirable. In particular, we propose a new load-profiling strategy that allows the nodes of a distributed system to be unequally loaded. Using load profiling, the system attempts to distribute the load amongst its nodes so as to maximize the chances of finding a node that would satisfy the computational needs of incoming real-time tasks. To that end, we describe and evaluate a distributed load-profiling protocol for dynamically scheduling time-constrained tasks in a loosely-coupled distributed environment. When a task is submitted to a node, the scheduling software tries to schedule the task locally so as to meet its deadline. If that is not feasible, it tries to locate another node where this could be done with a high probability of success, while attempting to maintain an overall load profile for the system. Nodes in the system inform each other about their state using a combination of multicasting and gossiping. The performance of the proposed protocol is evaluated via simulation, and is contrasted to other dynamic scheduling protocols for real-time distributed systems. Based on our findings, we argue that keeping a diverse availability profile and using passive bidding (through gossiping) are both advantageous to distributed scheduling for real-time systems.

Load Profiling for Efficient Route Selection in Multi-Class Networks

High-speed networks, such as ATM networks, are expected to support diverse Quality of Service (QoS) constraints, including real-time QoS guarantees. Real-time QoS is required by many applications such as those that involve voice and video communication. To support such services, routing algorithms that allow applications to reserve the needed bandwidth over a Virtual Circuit (VC) have been proposed. Commonly, these bandwidth-reservation algorithms assign VCs to routes using the least-loaded concept, and thus result in balancing the load over the set of all candidate routes. In this paper, we show that for such reservation-based protocols|which allow for the exclusive use of a preset fraction of a resource's bandwidth for an extended period of time-load balancing is not desirable as it results in resource fragmentation, which adversely affects the likelihood of accepting new reservations. In particular, we show that load-balancing VC routing algorithms are not appropriate when the main objective of the routing protocol is to increase the probability of finding routes that satisfy incoming VC requests, as opposed to equalizing the bandwidth utilization along the various routes. We present an on-line VC routing scheme that is based on the concept of "load profiling", which allows a distribution of "available" bandwidth across a set of candidate routes to match the characteristics of incoming VC QoS requests. We show the effectiveness of our load-profiling approach when compared to traditional load-balancing and load-packing VC routing schemes.

Evaluation of a Load Profiling Approach to Routing Guaranteed Bandwidth Flows

To support the diverse Quality of Service (QoS) requirements of real-time (e.g. audio/video) applications in integrated services networks, several routing algorithms that allow for the reservation of the needed bandwidth over a Virtual Circuit (VC) established on one of several candidate routes have been proposed. Traditionally, such routing is done using the least-loaded concept, and thus results in balancing the load across the set of candidate routes. In a recent study, we have established the inadequacy of this load balancing practice and proposed the use of load profiling as an alternative. Load profiling techniques allow the distribution of "available" bandwidth across a set of candidate routes to match the characteristics of incoming VC QoS requests. In this paper we thoroughly characterize the performance of VC routing using load profiling and contrast it to routing using load balancing and load packing. We do so both analytically and via extensive simulations of multi-class traffic routing in Virtual Path (VP) based networks. Our findings confirm that for routing guaranteed bandwidth flows in VP networks, load balancing is not desirable as it results in VP bandwidth fragmentation, which adversely affects the likelihood of accepting new VC requests. This fragmentation is more pronounced when the granularity of VC requests is large. Typically, this occurs when a common VC is established to carry the aggregate traffic flow of many high-bandwidth real-time sources. For VP-based networks, our simulation results show that our load-profiling VC routing scheme performs better or as well as the traditional load-balancing VC routing in terms of revenue under both skewed and uniform workloads. Furthermore, load-profiling routing improves routing fairness by proactively increasing the chances of admitting high-bandwidth connections.

Task Assignment in a Distributed System: Improving Performance by Unbalancing Load

We consider the problem of task assignment in a distributed system (such as a distributed Web server) in which task sizes are drawn from a heavy-tailed distribution. Many task assignment algorithms are based on the heuristic that balancing the load at the server hosts will result in optimal performance. We show this conventional wisdom is less true when the task size distribution is heavy-tailed (as is the case for Web file sizes). We introduce a new task assignment policy, called Size Interval Task Assignment with Variable Load (SITA-V). SITA-V purposely operates the server hosts at different loads, and directs smaller tasks to the lighter-loaded hosts. The result is that SITA-V provably decreases the mean task slowdown by significant factors (up to 1000 or more) where the more heavy-tailed the workload, the greater the improvement factor. We evaluate the tradeoff between improvement in slowdown and increase in waiting time in a system using SITA-V, and show conditions under which SITA-V represents a particularly appealing policy. We conclude with a discussion of the use of SITA-V in a distributed Web server, and show that it is attractive because it has a simple implementation which requires no communication from the server hosts back to the task router.

Simple Load Balancing for Distributed Hash Tables

Distributed hash tables have recently become a useful building block for a variety of distributed applications. However, current schemes based upon consistent hashing require both considerable implementation complexity and substantial storage overhead to achieve desired load balancing goals. We argue in this paper that these goals can b e achieved more simply and more cost-effectively. First, we suggest the direct application of the "power of two choices" paradigm, whereby an item is stored at the less loaded of two (or more) random alternatives. We then consider how associating a small constant number of hash values with a key can naturally b e extended to support other load balancing methods, including load-stealing or load-shedding schemes, as well as providing natural fault-tolerance mechanisms.

Load Balancing a Cluster of Web Servers using Distributed Packet Rewriting

In this paper, we propose and evaluate an implementation of a prototype scalable web server. The prototype consists of a load-balanced cluster of hosts that collectively accept and service TCP connections. The host IP addresses are advertised using the Round Robin DNS technique, allowing any host to receive requests from any client. Once a client attempts to establish a TCP connection with one of the hosts, a decision is made as to whether or not the connection should be redirected to a different host---namely, the host with the lowest number of established connections. We use the low-overhead Distributed Packet Rewriting (DPR) technique to redirect TCP connections. In our prototype, each host keeps information about connections in hash tables and linked lists. Every time a packet arrives, it is examined to see if it has to be redirected or not. Load information is maintained using periodic broadcasts amongst the cluster hosts.

Cerebellar Learning in an Opponent Motor Controller for Adaptive Load Compensation and Synergy Formation

This paper shows how a minimal neural network model of the cerebellum may be embedded within a sensory-neuro-muscular control system that mimics known anatomy and physiology. With this embedding, cerebellar learning promotes load compensation while also allowing both coactivation and reciprocal inhibition of sets of antagonist muscles. In particular, we show how synaptic long term depression guided by feedback from muscle stretch receptors can lead to trans-cerebellar gain changes that are load-compensating. It is argued that the same processes help to adaptively discover multi-joint synergies. Simulations of rapid single joint rotations under load illustrates design feasibility and stability.

Control circuits for avalanche photodiodes

Avalanche Photodiodes (APDs) have been used in a wide range of low light sensing applications such as DNA sequencing, quantum key distribution, LIDAR and medical imaging. To operate the APDs, control circuits are required to achieve the desired performance characteristics. This thesis presents the work on development of three control circuits including a bias circuit, an active quench and reset circuit and a gain control circuit all of which are used for control and performance enhancement of the APDs. The bias circuit designed is used to bias planar APDs for operation in both linear and Geiger modes. The circuit is based on a dual charge pumps configuration and operates from a 5 V supply. It is capable of providing milliamp load currents for shallow-junction planar APDs that operate up to 40 V. With novel voltage regulators, the bias voltage provided by the circuit can be accurately controlled and easily adjusted by the end user. The circuit is highly integrable and provides an attractive solution for applications requiring a compact integrated APD device. The active quench and reset circuit is designed for APDs that operate in Geiger-mode and are required for photon counting. The circuit enables linear changes in the hold-off time of the Geiger-mode APD (GM-APD) from several nanoseconds to microseconds with a stable setting step of 6.5 ns. This facilitates setting the optimal `afterpulse-free' hold-off time for any GM-APD via user-controlled digital inputs. In addition this circuit doesn’t require an additional monostable or pulse generator to reset the detector, thus simplifying the circuit. Compared to existing solutions, this circuit provides more accurate and simpler control of the hold-off time while maintaining a comparable maximum count-rate of 35.2 Mcounts/s. The third circuit designed is a gain control circuit. This circuit is based on the idea of using two matched APDs to set and stabilize the gain. The circuit can provide high bias voltage for operating the planar APD, precisely set the APD’s gain (with the errors of less than 3%) and compensate for the changes in the temperature to maintain a more stable gain. The circuit operates without the need for external temperature sensing and control electronics thus lowering the system cost and complexity. It also provides a simpler and more compact solution compared to previous designs. The three circuits designed in this project were developed independently of each other and are used for improving different performance characteristics of the APD. Further research on the combination of the three circuits will produce a more compact APD-based solution for a wide range of applications.

Anti-cholinergic load, health care utilization, and survival in people with advanced cancer: a pilot study.

INTRODUCTION: Anti-cholinergic medications have been associated with increased risks of cognitive impairment, premature mortality and increased risk of hospitalisation. Anti-cholinergic load associated with medication increases as death approaches in those with advanced cancer, yet little is known about associated adverse outcomes in this setting. METHODS: A substudy of 112 participants in a randomised control trial who had cancer and an Australia modified Karnofsky Performance Scale (AKPS) score (AKPS) of 60 or above, explored survival and health service utilisation; with anti-cholinergic load calculated using the Clinician Rated Anti-cholinergic Scale (modified version) longitudinally to death. A standardised starting point for prospectively calculating survival was an AKPS of 60 or above. RESULTS: Baseline entry to the sub-study was a mean 62 +/- 81 days (median 37, range 1-588) days before death (survival), with mean of 4.8 (median 3, SD 4.18, range 1 - 24) study assessments in this time period. Participants spent 22% of time as an inpatient. There was no significant association between anti-cholinergic score and time spent as an inpatient (adjusted for survival time) (p = 0.94); or survival time. DISCUSSION: No association between anti-cholinergic load and survival or time spent as an inpatient was seen. Future studies need to include cognitively impaired populations where the risks of symptomatic deterioration may be more substantial.