Quantifying robustness and dissipation cost of yeast cell cycle network: The funneled energy landscape perspectives

We study the origin of robustness of yeast cell cycle cellular network through uncovering its underlying energy landscape. This is realized from the information of the steady-state probabilities by solving a discrete set of kinetic master equations for the network. We discovered that the potential landscape of yeast cell cycle network is funneled toward the global minimum, G1 state. The ratio of the energy gap between G1 and average versus roughness of the landscape termed as robustness ratio ( RR) becomes a quantitative measure of the robustness and stability for the network. The funneled landscape is quite robust against random perturbations from the inherent wiring or connections of the network. There exists a global phase transition between the more sensitive response or less self-degradation phase leading to underlying funneled global landscape with large RR, and insensitive response or more self-degradation phase leading to shallower underlying landscape of the network with small RR. Furthermore, we show that the more robust landscape also leads to less dissipation cost of the network. Least dissipation and robust landscape might be a realization of Darwinian principle of natural selection at cellular network level. It may provide an optimal criterion for network wiring connections and design.

基于无线通信的阀门泄漏检测系统

阀门泄漏的在线监测一直是困扰流程工业的难题,采用传统有线监控方式需要巨大的布线安装成本。本文通过结合无线通信技术和超声检测技术,研究并开发了一种基于无线通信的阀门泄漏检测系统,可极大地降低测控系统的投资和使用成本,通过实时检测阀门的工作状态,及时发现并定位泄漏位置,实现工业生产的节能降耗。

Improving the Performance of Overlay Routing and P2P File Sharing using Selfish Neighbor Selection

A foundational issue underlying many overlay network applications ranging from routing to P2P file sharing is that of connectivity management, i.e., folding new arrivals into the existing mesh and re-wiring to cope with changing network conditions. Previous work has considered the problem from two perspectives: devising practical heuristics for specific applications designed to work well in real deployments, and providing abstractions for the underlying problem that are tractable to address via theoretical analyses, especially game-theoretic analysis. Our work unifies these two thrusts first by distilling insights gleaned from clean theoretical models, notably that under natural resource constraints, selfish players can select neighbors so as to efficiently reach near-equilibria that also provide high global performance. Using Egoist, a prototype overlay routing system we implemented on PlanetLab, we demonstrate that our neighbor selection primitives significantly outperform existing heuristics on a variety of performance metrics; that Egoist is competitive with an optimal, but unscalable full-mesh approach; and that it remains highly effective under significant churn. We also describe variants of Egoist's current design that would enable it to scale to overlays of much larger scale and allow it to cater effectively to applications, such as P2P file sharing in unstructured overlays, based on the use of primitives such as scoped-flooding rather than routing.

EGOIST: Overlay Routing Using Selfish Neighbor Selection

A foundational issue underlying many overlay network applications ranging from routing to P2P file sharing is that of connectivity management, i.e., folding new arrivals into an existing overlay, and re-wiring to cope with changing network conditions. Previous work has considered the problem from two perspectives: devising practical heuristics for specific applications designed to work well in real deployments, and providing abstractions for the underlying problem that are analytically tractable, especially via game-theoretic analysis. In this paper, we unify these two thrusts by using insights gleaned from novel, realistic theoretic models in the design of Egoist – a prototype overlay routing system that we implemented, deployed, and evaluated on PlanetLab. Using measurements on PlanetLab and trace-based simulations, we demonstrate that Egoist's neighbor selection primitives significantly outperform existing heuristics on a variety of performance metrics, including delay, available bandwidth, and node utilization. Moreover, we demonstrate that Egoist is competitive with an optimal, but unscalable full-mesh approach, remains highly effective under significant churn, is robust to cheating, and incurs minimal overhead. Finally, we discuss some of the potential benefits Egoist may offer to applications.

Overlay Network Creation and Maintenance with Selfish Users

Overlay networks have been used for adding and enhancing functionality to the end-users without requiring modifications in the Internet core mechanisms. Overlay networks have been used for a variety of popular applications including routing, file sharing, content distribution, and server deployment. Previous work has focused on devising practical neighbor selection heuristics under the assumption that users conform to a specific wiring protocol. This is not a valid assumption in highly decentralized systems like overlay networks. Overlay users may act selfishly and deviate from the default wiring protocols by utilizing knowledge they have about the network when selecting neighbors to improve the performance they receive from the overlay. This thesis goes against the conventional thinking that overlay users conform to a specific protocol. The contributions of this thesis are threefold. It provides a systematic evaluation of the design space of selfish neighbor selection strategies in real overlays, evaluates the performance of overlay networks that consist of users that select their neighbors selfishly, and examines the implications of selfish neighbor and server selection to overlay protocol design and service provisioning respectively. This thesis develops a game-theoretic framework that provides a unified approach to modeling Selfish Neighbor Selection (SNS) wiring procedures on behalf of selfish users. The model is general, and takes into consideration costs reflecting network latency and user preference profiles, the inherent directionality in overlay maintenance protocols, and connectivity constraints imposed on the system designer. Within this framework the notion of user’s "best response" wiring strategy is formalized as a k-median problem on asymmetric distance and is used to obtain overlay structures in which no node can re-wire to improve the performance it receives from the overlay. Evaluation results presented in this thesis indicate that selfish users can reap substantial performance benefits when connecting to overlay networks composed of non-selfish users. In addition, in overlays that are dominated by selfish users, the resulting stable wirings are optimized to such great extent that even non-selfish newcomers can extract near-optimal performance through naïve wiring strategies. To capitalize on the performance advantages of optimal neighbor selection strategies and the emergent global wirings that result, this thesis presents EGOIST: an SNS-inspired overlay network creation and maintenance routing system. Through an extensive measurement study on the deployed prototype, results presented in this thesis show that EGOIST’s neighbor selection primitives outperform existing heuristics on a variety of performance metrics, including delay, available bandwidth, and node utilization. Moreover, these results demonstrate that EGOIST is competitive with an optimal but unscalable full-mesh approach, remains highly effective under significant churn, is robust to cheating, and incurs minimal overheads. This thesis also studies selfish neighbor selection strategies for swarming applications. The main focus is on n-way broadcast applications where each of n overlay user wants to push its own distinct file to all other destinations as well as download their respective data files. Results presented in this thesis demonstrate that the performance of our swarming protocol for n-way broadcast on top of overlays of selfish users is far superior than the performance on top of existing overlays. In the context of service provisioning, this thesis examines the use of distributed approaches that enable a provider to determine the number and location of servers for optimal delivery of content or services to its selfish end-users. To leverage recent advances in virtualization technologies, this thesis develops and evaluates a distributed protocol to migrate servers based on end-users demand and only on local topological knowledge. Results under a range of network topologies and workloads suggest that the performance of the distributed deployment is comparable to that of the optimal but unscalable centralized deployment.

Implications of Selfish Neighbor Selection in Overlay Networks

In a typical overlay network for routing or content sharing, each node must select a fixed number of immediate overlay neighbors for routing traffic or content queries. A selfish node entering such a network would select neighbors so as to minimize the weighted sum of expected access costs to all its destinations. Previous work on selfish neighbor selection has built intuition with simple models where edges are undirected, access costs are modeled by hop-counts, and nodes have potentially unbounded degrees. However, in practice, important constraints not captured by these models lead to richer games with substantively and fundamentally different outcomes. Our work models neighbor selection as a game involving directed links, constraints on the number of allowed neighbors, and costs reflecting both network latency and node preference. We express a node's "best response" wiring strategy as a k-median problem on asymmetric distance, and use this formulation to obtain pure Nash equilibria. We experimentally examine the properties of such stable wirings on synthetic topologies, as well as on real topologies and maps constructed from PlanetLab and AS-level Internet measurements. Our results indicate that selfish nodes can reap substantial performance benefits when connecting to overlay networks composed of non-selfish nodes. On the other hand, in overlays that are dominated by selfish nodes, the resulting stable wirings are optimized to such great extent that even non-selfish newcomers can extract near-optimal performance through naive wiring strategies.

Development of miniaturized wireless sensor nodes suitable for building energy management and modelling

Buildings consume 40% of Ireland's total annual energy translating to 3.5 billion (2004). The EPBD directive (effective January 2003) places an onus on all member states to rate the energy performance of all buildings in excess of 50m2. Energy and environmental performance management systems for residential buildings do not exist and consist of an ad-hoc integration of wired building management systems and Monitoring & Targeting systems for non-residential buildings. These systems are unsophisticated and do not easily lend themselves to cost effective retrofit or integration with other enterprise management systems. It is commonly agreed that a 15-40% reduction of building energy consumption is achievable by efficiently operating buildings when compared with typical practice. Existing research has identified that the level of information available to Building Managers with existing Building Management Systems and Environmental Monitoring Systems (BMS/EMS) is insufficient to perform the required performance based building assessment. The cost of installing additional sensors and meters is extremely high, primarily due to the estimated cost of wiring and the needed labour. From this perspective wireless sensor technology provides the capability to provide reliable sensor data at the required temporal and spatial granularity associated with building energy management. In this paper, a wireless sensor network mote hardware design and implementation is presented for a building energy management application. Appropriate sensors were selected and interfaced with the developed system based on user requirements to meet both the building monitoring and metering requirements. Beside the sensing capability, actuation and interfacing to external meters/sensors are provided to perform different management control and data recording tasks associated with minimisation of energy consumption in the built environment and the development of appropriate Building information models(BIM)to enable the design and development of energy efficient spaces.

Movement-related potentials in high-functioning autism and Asperger's disorder

Autism and Asperger's disorder (AD) are neurodevelopmental conditions that affect cognitive and social-communicative function. Using a movement-related potential (MRP) paradigm, we investigated the clinical and neurobiological issue of 'disorder separateness' versus 'disorder variance' in autism and AD. This paradigm has been used to assess basal ganglia/supplementary motor functioning in Parkinson's disease. Three groups (high functioning autism [HFA]: 16 males, 1 female; mean age 12y 5mo [SD 4y 4mo]; AD: 11 males, 2 females; mean age 13y 5mo [SD 3y 8mo]; comparison group: 13 males, 8 females; mean age 13y 10mo, [SD 3y 11 mo]) completed a cued motor task during electroencephalogram recording of MRPs. The HFA group showed reduced peak amplitude at Cz, indicating less activity over the supplementary motor area during movement preparation. Although an overall significant between-group effect was found for early slope and peak amplitude, subanalysis revealed that the group with AD did not differ significantly from either group. However, it is suggested that autism and AD may be dissociated on the basis of brain-behaviour correlations of IQ with specific neurobiological measures. The overlap between MRP traces for autism and Parkinson's disease suggests that the neurobiological wiring of motor functioning in autism may bypass the supplementary motor area/primary motor cortex pathway.

Pathfinding of corticothalamic axons relies on a rendezvous with thalamic projections.

Major outputs of the neocortex are conveyed by corticothalamic axons (CTAs), which form reciprocal connections with thalamocortical axons, and corticosubcerebral axons (CSAs) headed to more caudal parts of the nervous system. Previous findings establish that transcriptional programs define cortical neuron identity and suggest that CTAs and thalamic axons may guide each other, but the mechanisms governing CTA versus CSA pathfinding remain elusive. Here, we show that thalamocortical axons are required to guide pioneer CTAs away from a default CSA-like trajectory. This process relies on a hold in the progression of cortical axons, or waiting period, during which thalamic projections navigate toward cortical axons. At the molecular level, Sema3E/PlexinD1 signaling in pioneer cortical neurons mediates a "waiting signal" required to orchestrate the mandatory meeting with reciprocal thalamic axons. Our study reveals that temporal control of axonal progression contributes to spatial pathfinding of cortical projections and opens perspectives on brain wiring.

Context Interchange as a Scalable Solution to Interoperating Amongst Heterogeneous Dynamic Services

Many online services access a large number of autonomous data sources and at the same time need to meet different user requirements. It is essential for these services to achieve semantic interoperability among these information exchange entities. In the presence of an increasing number of proprietary business processes, heterogeneous data standards, and diverse user requirements, it is critical that the services are implemented using adaptable, extensible, and scalable technology. The COntext INterchange (COIN) approach, inspired by similar goals of the Semantic Web, provides a robust solution. In this paper, we describe how COIN can be used to implement dynamic online services where semantic differences are reconciled on the fly. We show that COIN is flexible and scalable by comparing it with several conventional approaches. With a given ontology, the number of conversions in COIN is quadratic to the semantic aspect that has the largest number of distinctions. These semantic aspects are modeled as modifiers in a conceptual ontology; in most cases the number of conversions is linear with the number of modifiers, which is significantly smaller than traditional hard-wiring middleware approach where the number of conversion programs is quadratic to the number of sources and data receivers. In the example scenario in the paper, the COIN approach needs only 5 conversions to be defined while traditional approaches require 20,000 to 100 million. COIN achieves this scalability by automatically composing all the comprehensive conversions from a small number of declaratively defined sub-conversions.

Projecte d’instal∙lacions d’un edifici mixte d’habitatges, local industrial i aparcament

Aquest projecte tracta d’un estudi tècnic, disseny i càlcul de les instal∙lacions d’un edifici mixte d’habitatges, local comercial i zona d’aparcament, complint la normativa que li pertoca segons l’ús a que es destina l’espai. L’edifici objecte d’aquest projecte es troba situat a la cruïlla Platja d’Aro s/n de la localitat de Santa Cristina d’Aro, i es tracta com un edifici de nova construcció. L’abast del projecte contempla les instal∙lacions elèctriques, tèrmiques, contra incendis, sanejament i de salubritat, per tal d’assolir les fases executives del projecte, així com les legalitzacions de les diferents activitats que es desenvolupen a l’edifici (aparcament de vehicles, comercial, taller de reparació de vehicles a motor i d’ús administratiu). Es pretén fer un estudi integral de les instal∙lacions i mesures correctores que es poden realitzar en un edifici amb les característiques esmentades

Redisseny d’una línia d’alta tensió comparant el traçat aeri amb el traçat soterrat

A petició d’un grup d’empreses del polígon industrial “Polígon”, es redacta el present projecte que té per objecte establir les característiques tècniques per a la construcció d’una variant de la línia de doble circuit 110 kV que uneix les dues subestacions; S.E. Polígon Nord – S.E. Polígon Sur. Actualment es disposa d’una línia de doble circuit 110 kV que uneix les dues subestacions; S.E. Polígon Nord – S.E. Polígon Sur i que travessa vàries parcel•les del polígon industrial “Polígon” sobrevolant-les i reduint, per tant, la seva capacitat d’aprofitament de sòl. Es consideraran, i es calcularan, les dues alternatives que existeixen actualment en línies de transport elèctric: variant aèria i variant soterrada

Instal·lacions de baixa tensió, mesures contra incendis, climatització i qualificació energètica d’un supermercat

El present projecte pretén oferir una solució constructiva de les instal•lacions de baixa tensió, mesures contra incendis i climatització d’un supermercat i també l’obtenció d’una qualificació energètica de l’establiment. Aquesta activitat terciari d’ús comercial és classifica com un comerç al detall amb predomini de productes alimentaris, begudes i una altra àmplia gamma de mercaderies (com són els cosmètics, detergents, productes de papereria, etc.)

Fault-finding device

El projecte es va fer al KHLim a Diepenbeek. Es tractava de dissenyar un nou dispositiu de localització d'avaries del relè del motor, per tal de de substituir el que ja hi havia, per raons de seguretat

Chemical modification of a nanocrystalline TiO(2) film for efficient electric connection of glucose oxidase

A novel biosensor for glucose was prepared by adsorption of 1,1`-bis(4-carboxybenzyl)-4,4`-bipyridinium di-bromide compound (H(2)BpybcBr(2)) onto the surface of a nanocrystalline TiO(2) film deposited onto FTO glasses, which was used as a platform to assemble the enzyme glucose oxidase to the electrode surface. The H(2)BpybcBr(2)/TiO(2)/FTO modified electrode was characterized by scanning electron microscopy, X-ray fluorescence image, cyclic voltammograms and spectroelectrochemical measurements. The immobilization of GOD on functionalized TiO(2) film led to stable amperometric biosensing for glucose with a linear range from 153 mu mol L(-1) to 1.30 mmol L(-1) and a detection limit of 51 mu mol L(-1). The apparent Michaelis-Menten constant (K(m)) was estimated to be 3.76 mmol L(-1), which suggested a high enzyme-substrate affinity. The maximum electrode sensitivity was 1.25 mu A mmol L(-1). The study proved that the combination of viologen mediators with TiO(2) film retains the electrocatalytic activity of the enzyme, and also enhances the electron transfer process, and hence regenerating the enzyme in the reaction with glucose. (C) 2010 Elsevier Inc. All rights reserved.