Probing the location of displayed cytochrome b562 on amyloid by scanning tunnelling microscopy.

Amyloid fibres displaying cytochrome b562 were probed using scanning tunnelling microscopy (STM) in vacuo. The cytochromes are electron transfer proteins containing a haem cofactor and could, in principle, mediate electron transfer between the tip and the gold substrate. If the core fibres were insulating and electron transfer within the 3D haem network was detected, then the electron transport properties of the fibre could be controlled by genetic engineering. Three kinds of STM images were obtained. At a low bias (<1.5 V) the fibres appeared as regions of low conductivity with no evidence of cytochrome mediated electron transfer. At a high bias, stable peaks in tunnelling current were observed for all three fibre species containing haem and one species of fibre that did not contain haem. In images of this kind, some of the current peaks were collinear and spaced around 10 nm apart over ranges longer than 100 nm, but background monomers complicate interpretation. Images of the third kind were rare (1 in 150 fibres); in these, fully conducting structures with the approximate dimensions of fibres were observed, suggesting the possibility of an intermittent conduction mechanism, for which a precedent exists in DNA. To test the conductivity, some fibres were immobilized with sputtered gold, and no evidence of conduction between the grains of gold was seen. In control experiments, a variation of monomeric cytochrome b562 was not detected by STM, which was attributed to low adhesion, whereas a monomeric multi-haem protein, GSU1996, was readily imaged. We conclude that the fibre superstructure may be intermittently conducting, that the cytochromes have been seen within the fibres and that they are too far apart for detectable current flow between sites to occur. We predict that GSU1996, being 10 nm long, is more likely to mediate successful electron transfer along the fibre as well as being more readily detectable when displayed from amyloid.

Evaluating the impact of V2G services on the degradation of batteries in PHEV and EV

Many researchers and industry observers claim that electric vehicles (EV) and plug-in hybrid electric vehicles (PHEV) could provide vehicle-to-grid (V2G) bulk energy and ancillary services to an electricity network. This work quantified the impact on various battery characteristics whilst providing such services. The sensitivity of the impact of V2G services on battery degradation was assessed for EV and PHEV for different battery capacities, charging regimes, and battery depth of discharge. Battery degradation was found to be most dependent on energy throughput for both the EV and PHEV powertrains, but was most sensitive to charging regime (for EVs) and battery capacity (for PHEVs). When providing ancillary services, battery degradation in both powertrains was most sensitive to individual vehicle battery depth of discharge. Degradation arising from both bulk energy and ancillary services could be minimised by reducing the battery capacity of the vehicle, restricting the number of hours connected and reducing the depth of discharge of each vehicle for ancillary services. Regardless, best case minimum impacts of providing V2G services are severe such as to require multiple battery pack replacements over the vehicle lifetime. © 2013 Elsevier Ltd.

An integrated representation of the services provided by global water resources

Water is essential not only to maintain the livelihoods of human beings but also to sustain ecosystems. Over the last few decades several global assessments have reviewed current and future uses of water, and have offered potential solutions to a possible water crisis. However, these have tended to focus on water supply rather than on the range of demands for all water services (including those of ecosystems). In this paper, a holistic global view of water resources and the services they provide is presented, using Sankey diagrams as a visualisation tool. These diagrams provide a valuable addition to the spatial maps of other global assessments, as they track the sources, uses, services and sinks of water resources. They facilitate comparison of different water services, and highlight trade-offs amongst them. For example, they reveal how increasing the supply of water resources to one service (crop production) can generate a reduction in provision of other water services (e.g., to ecosystem maintenance). The potential impacts of efficiency improvements in the use of water are also highlighted; for example, reduction in soil evaporation from crop production through better farming practices, or the results of improved treatment and re-use of return flows leading to reduction of delivery to final sinks. This paper also outlines the measures needed to ensure sustainable water resource use and supply for multiple competing services in the future, and emphasises that integrated management of land and water resources is essential to achieve this goal. © 2013 Elsevier Ltd.

Research of Face Location System Based on Human Vision Simulations

In this paper we present a robust face location system based on human vision simulations to automatically locate faces in color static images. Our method is divided into four stages. In the first stage we use a gauss low-pass filter to remove the fine information of images, which is useless in the initial stage of human vision. During the second and the third stages, our technique approximately detects the image regions, which may contain faces. During the fourth stage, the existence of faces in the selected regions is verified. Having combined the advantages of Bottom-Up Feature Based Methods and Appearance-Based Methods, our algorithm performs well in various images, including those with highly complex backgrounds.

A novel image restoration approach based on point location in high-dimensional space geometry

The goal of image restoration is to restore the original clear image from the existing blurred image without distortion as possible. A novel approach based on point location in high-dimensional space geometry method is proposed, which is quite different from the thought ways of existing traditional image restoration approaches. It is based on the high-dimensional space geometry method, which derives from the fact of the Principle of Homology-Continuity (PHC). Begin with the original blurred image, we get two further blurred images. Through the regressive deducing curve fitted by these three images, the first iterative deblured image could be obtained. This iterative "blurring-debluring-blurring" process is performed till reach the deblured image. Experiments have proved the availability of the proposed approach and achieved not only common image restoration but also blind image restoration which represents the majority of real problems.

Web Services Workflows—Composition, Co-Ordination, and Transactions in Service-Oriented Computing

Web services can be seen as a newly emerging research area for Service-oriented Computing and their implementation in Service-oriented Architectures. Web services are self-contained, self-describing modular applications or components providing services. Web services may be dynamically aggregated, composed, and enacted as Web services Workflows. This requires frameworks and interaction protocols for their co-ordination and transaction support. In a Service-oriented Computing setting, transactions are more complex, involve multiple parties (roles), span many organizations, and may be long-running, consisting of a highly decentralized service partner and performed by autonomous entities. A Service-oriented Transaction Model has to provide comprehensive support for long-running propositions including negotiations, conversations, commitments, contracts, tracking, payments, and exception handling. Current transaction models and mechanisms including their protocols and primitives do not sufficiently cater for quality-aware and long running transactions comprising loosely-coupled (federated) service partners and resources. Web services transactions require co-ordination behavior provided by a traditional transaction mechanism to control the operations and outcome of an application. Furthermore, Web services transactions require the capability to handle the co-ordination of processing outcomes or results from multiple services in a more flexible manner. This requires more relaxed forms of transactions—those that do not strictly have to abide by the ACID properties—such as loosely-coupled collaboration and workflows. Furthermore, there is a need to group Web services into applications that require some form of correlation, but do not necessarily require transactional behavior. The purpose of this paper is to provide a state-of-the-art review and overview of some proposed standards surrounding Web services composition, co-ordination, and transaction. In particular the Business Process Execution Language for Web services (BPEL4WS), its co-ordination, and transaction frameworks (WS-Co-ordination and WS-Transaction) are discussed.

A shortest path algorithm for moving objects in spatial network databases

One of the most important kinds of queries in Spatial Network Databases (SNDB) to support location-based services (LBS) is the shortest path query. Given an object in a network, e.g. a location of a car on a road network, and a set of objects of interests, e.g. hotels,gas station, and car, the shortest path query returns the shortest path from the query object to interested objects. The studies of shortest path query have two kinds of ways, online processing and preprocessing. The studies of preprocessing suppose that the interest objects are static. This paper proposes a shortest path algorithm with a set of index structures to support the situation of moving objects. This algorithm can transform a dynamic problem to a static problem. In this paper we focus on road networks. However, our algorithms do not use any domain specific information, and therefore can be applied to any network. This algorithm’s complexity is O(klog2 i), and traditional Dijkstra’s complexity is O((i + k)2).